Trait gf::support::lattice::Bottom

pub trait Bottom: Sized {
    fn bottom() -> Self;
    fn is_bottom(&self) -> bool;

    fn to_option(self) -> Option<Self> { ... }
    fn reset_to_bottom(&mut self) { ... }
}

A type that has a designated bottom element, ⊥.

Blanket implementations

• A blanket implementation is provided for Option<T>, with None being the bottom element.
• A blanket implementation is provided for 2- and 3-tuples of Bottom implementors where if at least one of the tuple elements is ⊥, the tuple is also considered ⊥.
• A blanket implementation is provided for Bottom implementors wrapped in Arc, Box, or Rc.

Required methods

fn bottom() -> Self

Return the bottom element, ⊥.

fn is_bottom(&self) -> bool

Test whether self is ⊥.

Loading content...

Provided methods

fn to_option(self) -> Option<Self>

Convert ⊥ to None and all other elements to Some.

fn reset_to_bottom(&mut self)

Reset self to ⊥.

The default implementation assigns self to what bottom returns. In many cases, a more efficient implementation is possible.

Loading content...

Implementations on Foreign Types

impl<T> Bottom for Option<T>

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<A: Bottom, B: Bottom> Bottom for (A, B)

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<A: Bottom, B: Bottom, C: Bottom> Bottom for (A, B, C)

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<T: Bottom> Bottom for Arc<T>

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<T: Bottom> Bottom for Box<T>

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<T: Bottom> Bottom for Rc<T>

fn bottom() -> Self

fn is_bottom(&self) -> bool

Loading content...

Implementors

impl<'a> Bottom for ConcolicState<'a>

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<'a> Bottom for SymbolicState<'a>

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<'a, A, V, S> Bottom for State<'a, A, V, S> where
    V: Bottom + Clone + Eq,
    S: Clone + SpaceState<A, V>, 

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<K: Clone + Hash + Eq, V: Clone + Eq + Bottom> Bottom for HashLattice<K, V>

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<L: Top> Bottom for Flip<L>

fn bottom() -> Self

fn is_bottom(&self) -> bool

impl<T: Clone + Eq + Bottom> Bottom for VarState<T>

fn bottom() -> Self

fn is_bottom(&self) -> bool

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

fn bottom() -> Self

fn is_bottom(&self) -> bool

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

fn bottom() -> Self

fn is_bottom(&self) -> bool

Loading content...