Trait gf::support::lattice::Top

pub trait Top: Sized {
    fn top() -> Self;
    fn is_top(&self) -> bool;

    fn reset_to_top(&mut self) { ... }
}

A type that has a designated top element, ⊤.

Option<()> is a trivial lattice

Option<()> implements Top with Some(()) as ⊤, and Bottom with None as ⊥. Therefore, it is a trivial lattice {⊥, ⊤}. We use Option<()> in place of bool to indicate success or failure in lattice contexts.

Blanket implementations

• A blanket implementation is provided for 2- and 3-tuples of Top implementors where if all of the tuple elements are ⊤, the tuple is also considered ⊤.
• A blanket implementation is provided for Top implementors wrapped in Arc, Box, or Rc.

Required methods

fn top() -> Self

Return the top element, ⊤.

fn is_top(&self) -> bool

Test whether self is ⊤.

Loading content...

Provided methods

fn reset_to_top(&mut self)

Reset self to ⊤.

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

Loading content...

Implementations on Foreign Types

impl Top for Option<()>

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

impl<T: Top> Top for Arc<T>

fn top() -> Self

fn is_top(&self) -> bool

impl<T: Top> Top for Box<T>

fn top() -> Self

fn is_top(&self) -> bool

impl<T: Top> Top for Rc<T>

fn top() -> Self

fn is_top(&self) -> bool

Loading content...

Implementors

impl<'a> Top for ConcolicState<'a>

fn top() -> Self

fn is_top(&self) -> bool

impl<'a> Top for SymbolicState<'a>

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

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

fn top() -> Self

fn is_top(&self) -> bool

Loading content...