Enum gf::support::lattice::FlatLattice

pub enum FlatLattice<T> {
    Bottom,
    Top,
    Inner(T),
}

Lattice constructed from a set by adding dedicated bottom and top elements.

Example

This example uses FlatLattice to reason about integer values, like in an integer constant propagation pass.

let a = FlatLattice::from(10u32);
let b = FlatLattice::from(20u32);

assert_eq!(Meet::meet(&a, &a), a);
assert_eq!(Meet::meet(&a, &b), FlatLattice::Bottom);
assert_eq!(Join::join(&a, &a), a);
assert_eq!(Join::join(&a, &b), FlatLattice::Top);

Variants

Bottom

Dedicated bottom element, ⊥.

Top

Dedicated top element, ⊤.

Inner(T)

Inner element.

Implementations

impl<T> FlatLattice<T>

pub fn from_vec(vec: Vec<FlatLattice<T>>) -> FlatLattice<Vec<T>>

Convert from a Vec<FlatLattice<T>> to FlatLattice<Vec<T>>.

If the vector contains a ⊥, the result is also ⊥. Otherwise, if the vector contains a ⊤, the result is also ⊤. Otherwise, the result is an inner element.

pub fn as_ref(&self) -> FlatLattice<&T>

Convert from a &FlatLattice<T> to FlatLattice<&T>.

pub fn is_inner(&self) -> bool

Return whether the FlatLattice contains an inner element.

pub fn unwrap(self) -> T

Unwrap an inner element.

Errors

• Panics if FlatLattice contains a bottom element.
• Panics if FlatLattice contains a top element.

pub fn map<U, F: FnOnce(T) -> U>(self, f: F) -> FlatLattice<U>

Map inner elements using f, while preserving dedicated bottom and top elements.

pub fn map_bottom<F: FnOnce() -> Self>(self, f: F) -> Self

Map bottom elements using f, while preserving inner and top elements.

pub fn map_top<F: FnOnce() -> Self>(self, f: F) -> Self

Map top elements using f, while preserving inner and bottom elements.

pub fn and_then<U, F: FnOnce(T) -> FlatLattice<U>>(self, f: F) -> FlatLattice<U>

Map inner elements using f which may also return bottom or top, while preserving bottom and top elements.

impl<'a, T: Clone> FlatLattice<&'a T>

pub fn cloned(self) -> FlatLattice<T>

Convert from a FlatLattice<&T> to FlatLattice<T> by cloning the element.

impl<'a, T: Copy> FlatLattice<&'a T>

pub fn copied(self) -> FlatLattice<T>

Convert from a FlatLattice<&T> to FlatLattice<T> by copying the element.

Trait Implementations

impl<T: Eq> Bottom for FlatLattice<T>

fn bottom() -> Self

Return the bottom element, ⊥.

fn is_bottom(&self) -> bool

Test whether self is ⊥.

fn to_option(self) -> Option<Self>

Convert ⊥ to None and all other elements to Some.

fn reset_to_bottom(&mut self)

Reset self to ⊥.

impl<T: Clone> Clone for FlatLattice<T>

fn clone(&self) -> FlatLattice<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<A: IntoU128> ConstSpaceState<A, FlatLattice<BitVec>> for ConcreteSpaceState

fn load(
    &mut self,
    span: SpaceSpan<A>
) -> (FlatLattice<BitVec>, FlatLattice<BitVec>)

Load from the space.

fn load_result(&mut self, span: SpaceSpan<A>) -> Result<V, V>

Load from the space returning a Result.

impl<A: IntoU128> ConstSpaceState<A, FlatLattice<Expr>> for SymbolicSpaceState

fn load(&mut self, span: SpaceSpan<A>) -> (FlatLattice<Expr>, FlatLattice<Expr>)

Load from the space.

fn load_result(&mut self, span: SpaceSpan<A>) -> Result<V, V>

Load from the space returning a Result.

impl ConstSpaceState<BitVec, FlatLattice<BitVec>> for ConcreteSpaceState

fn load(
    &mut self,
    span: SpaceSpan<BitVec>
) -> (FlatLattice<BitVec>, FlatLattice<BitVec>)

Load from the space.

fn load_result(&mut self, span: SpaceSpan<A>) -> Result<V, V>

Load from the space returning a Result.

impl ConstSpaceState<BitVec, FlatLattice<Expr>> for SymbolicSpaceState

fn load(
    &mut self,
    span: SpaceSpan<BitVec>
) -> (FlatLattice<Expr>, FlatLattice<Expr>)

Load from the space.

fn load_result(&mut self, span: SpaceSpan<A>) -> Result<V, V>

Load from the space returning a Result.

impl ConstSpaceState<FlatLattice<BitVec>, FlatLattice<BitVec>> for ConcreteSpaceState

fn load(
    &mut self,
    span: SpaceSpan<FlatLattice<BitVec>>
) -> (FlatLattice<BitVec>, FlatLattice<BitVec>)

Load from the space.

fn load_result(&mut self, span: SpaceSpan<A>) -> Result<V, V>

Load from the space returning a Result.

impl ConstSpaceState<FlatLattice<BitVec>, FlatLattice<Expr>> for SymbolicSpaceState

fn load(
    &mut self,
    span: SpaceSpan<FlatLattice<BitVec>>
) -> (FlatLattice<Expr>, FlatLattice<Expr>)

Load from the space.

fn load_result(&mut self, span: SpaceSpan<A>) -> Result<V, V>

Load from the space returning a Result.

impl<T: Copy> Copy for FlatLattice<T>

impl<T: Debug> Debug for FlatLattice<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Eq> Eq for FlatLattice<T>

impl<T> From<T> for FlatLattice<T>

fn from(src: T) -> Self

Performs the conversion.

impl<T: Hash> Hash for FlatLattice<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<T: Clone + Eq> Join for FlatLattice<T>

fn join(a: &Self, b: &Self) -> Self

Return a ⊔ b.

fn join_cmp(a: &Self, b: &Self) -> Option<Ordering>

Compare a and b using the induced partial order ⊑.

impl<T: Clone + Eq> Meet for FlatLattice<T>

fn meet(a: &Self, b: &Self) -> Self

Return a ⊓ b.

fn meet_cmp(a: &Self, b: &Self) -> Option<Ordering>

Compare a and b using the induced partial order ⊑.

impl<T: PartialEq> PartialEq<FlatLattice<T>> for FlatLattice<T>

fn eq(&self, other: &FlatLattice<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &FlatLattice<T>) -> bool

This method tests for !=.

impl<A: IntoU128> SpaceState<A, FlatLattice<BitVec>> for ConcreteSpaceState

fn store(
    &mut self,
    span: SpaceSpan<A>,
    value: FlatLattice<BitVec>
) -> (Option<()>, FlatLattice<BitVec>)

Store to the space.

fn store_result(
    &mut self,
    span: SpaceSpan<A>,
    value: V
) -> Result<Option<()>, V>

Store to the space returning a Result.

impl<A: IntoU128> SpaceState<A, FlatLattice<Expr>> for SymbolicSpaceState

fn store(
    &mut self,
    span: SpaceSpan<A>,
    value: FlatLattice<Expr>
) -> (Option<()>, FlatLattice<Expr>)

Store to the space.

fn store_result(
    &mut self,
    span: SpaceSpan<A>,
    value: V
) -> Result<Option<()>, V>

Store to the space returning a Result.

impl SpaceState<BitVec, FlatLattice<BitVec>> for ConcreteSpaceState

fn store(
    &mut self,
    span: SpaceSpan<BitVec>,
    value: FlatLattice<BitVec>
) -> (Option<()>, FlatLattice<BitVec>)

Store to the space.

fn store_result(
    &mut self,
    span: SpaceSpan<A>,
    value: V
) -> Result<Option<()>, V>

Store to the space returning a Result.

impl SpaceState<BitVec, FlatLattice<Expr>> for SymbolicSpaceState

fn store(
    &mut self,
    span: SpaceSpan<BitVec>,
    value: FlatLattice<Expr>
) -> (Option<()>, FlatLattice<Expr>)

Store to the space.

fn store_result(
    &mut self,
    span: SpaceSpan<A>,
    value: V
) -> Result<Option<()>, V>

Store to the space returning a Result.

impl SpaceState<FlatLattice<BitVec>, FlatLattice<BitVec>> for ConcreteSpaceState

fn store(
    &mut self,
    span: SpaceSpan<FlatLattice<BitVec>>,
    value: FlatLattice<BitVec>
) -> (Option<()>, FlatLattice<BitVec>)

Store to the space.

fn store_result(
    &mut self,
    span: SpaceSpan<A>,
    value: V
) -> Result<Option<()>, V>

Store to the space returning a Result.

impl SpaceState<FlatLattice<BitVec>, FlatLattice<Expr>> for SymbolicSpaceState

fn store(
    &mut self,
    span: SpaceSpan<FlatLattice<BitVec>>,
    value: FlatLattice<Expr>
) -> (Option<()>, FlatLattice<Expr>)

Store to the space.

fn store_result(
    &mut self,
    span: SpaceSpan<A>,
    value: V
) -> Result<Option<()>, V>

Store to the space returning a Result.

impl<T> StructuralEq for FlatLattice<T>

impl<T> StructuralPartialEq for FlatLattice<T>

impl<T: Eq> Top for FlatLattice<T>

fn top() -> Self

Return the top element, ⊤.

fn is_top(&self) -> bool

Test whether self is ⊤.

fn reset_to_top(&mut self)

Reset self to ⊤.

impl<T: Clone + Eq + Ord> ValueSet<T> for FlatLattice<T>

fn singleton(member: T) -> Self

Create a singleton set from member.

fn card(&self) -> FlatLattice<NonZeroUsize>

Return the set cardinality where ⊥ means 0 and ⊤ means infinite or too many to count.

fn has_member(&self, value: &T) -> bool

Return whether the set contains value.

fn as_singleton(&self) -> FlatLattice<&T>

Return the single member of a singleton set.

fn to_sorted_vec(&self) -> FlatLattice<Vec<T>>

Return the set members as a sorted vector.