[−][src]Trait abstalg::Lattice

pub trait Lattice: Domain {
    fn meet(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem;

    fn join(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem;

    fn leq(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> bool { ... }
}

A set where the join and meet of elements can be calculated. Typical examples are the total orders of integers or the divisibility relation on the associate classes of an Euclidean domain.

Required methods

fn meet(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem

Returns the largest element that is less than or equal to both given elements.

fn join(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem

Returns the smallest element that is greater than or equal to both given elements.

Loading content...

Provided methods

fn leq(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> bool

Returns true if the first element is less than or equal to the second one in the lattice order.

Loading content...

Implementors

impl Lattice for Integers[src]

impl<E> Lattice for ApproxFloats<E> where
    E: Float + Debug + Zero + One, [src]

impl<E> Lattice for CheckedInts<E> where
    E: PrimInt + Signed + Debug + From<i8>, [src]

impl<R: EuclideanDomain> Lattice for DivisibilityLattice<R>[src]

Loading content...