Trait pergola::LatticeDef

pub trait LatticeDef {
    type T;
    fn unit() -> Self::T;
    fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T;
    fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>;
}

Implement this trait on a (typically vacuous) type to define a specific lattice as a type-with-some-choice-of-operators.

Associated Types

type T

Loading content...

Required methods

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

Loading content...

Implementors

impl LatticeDef for BitSetWithIntersection

type T = Option<BitSet>

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl LatticeDef for BitSetWithUnion

type T = BitSet

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<A: LatticeDef, B: LatticeDef> LatticeDef for Tuple2<A, B>

type T = (A::T, B::T)

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<A: LatticeDef, B: LatticeDef, C: LatticeDef> LatticeDef for Tuple3<A, B, C>

type T = (A::T, B::T, C::T)

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<A: LatticeDef, B: LatticeDef, C: LatticeDef, D: LatticeDef> LatticeDef for Tuple4<A, B, C, D>

type T = (A::T, B::T, C::T, D::T)

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<A: LatticeDef, B: LatticeDef, C: LatticeDef, D: LatticeDef, E: LatticeDef> LatticeDef for Tuple5<A, B, C, D, E>

type T = (A::T, B::T, C::T, D::T, E::T)

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<K: Ord + Clone, VD: LatticeDef> LatticeDef for BTreeMapWithIntersection<K, VD> where
    VD::T: Clone, 

type T = Option<BTreeMap<K, LatticeElt<VD>>>

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<K: Ord + Clone, VD: LatticeDef> LatticeDef for BTreeMapWithUnion<K, VD> where
    VD::T: Clone, 

type T = BTreeMap<K, LatticeElt<VD>>

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<M: Ord + Clone + MaxUnitDefault> LatticeDef for MaxDef<M>

type T = M

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<M: Ord + Clone + MaxUnitMinValue> LatticeDef for MaxNum<M>

type T = M

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<M: Ord + Clone + Bounded> LatticeDef for MinNum<M>

type T = M

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<M: Ord + Clone> LatticeDef for MinOpt<M>

type T = Option<M>

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<U: Clone + Ord> LatticeDef for BTreeSetWithIntersection<U>

type T = Option<BTreeSet<U>>

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

impl<U: Clone + Ord> LatticeDef for BTreeSetWithUnion<U>

type T = BTreeSet<U>

fn unit() -> Self::T

fn join(lhs: &Self::T, rhs: &Self::T) -> Self::T

fn partial_order(lhs: &Self::T, rhs: &Self::T) -> Option<Ordering>

Loading content...