[−][src]Struct pergola::BTreeMapWithIntersection

pub struct BTreeMapWithIntersection<K: Ord + Clone, VD: LatticeDef> { /* fields omitted */ }

Similar to other intersection-based lattices in this crate, this lattice is a map that stores inner lattices and joins using intersection. Maps are represented as Option<BTreeMap> and the unit is again a putative "maximum" map-with-all-possible-keys (represented by None).

Trait Implementations

impl<K: Debug + Ord + Clone, VD: Debug + LatticeDef> Debug for BTreeMapWithIntersection<K, VD>[src]

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

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

Auto Trait Implementations

impl<K, VD> RefUnwindSafe for BTreeMapWithIntersection<K, VD> where
    K: RefUnwindSafe,
    VD: RefUnwindSafe, 

impl<K, VD> Send for BTreeMapWithIntersection<K, VD> where
    K: Send,
    VD: Send, 

impl<K, VD> Sync for BTreeMapWithIntersection<K, VD> where
    K: Sync,
    VD: Sync, 

impl<K, VD> Unpin for BTreeMapWithIntersection<K, VD> where
    K: Unpin,
    VD: Unpin, 

impl<K, VD> UnwindSafe for BTreeMapWithIntersection<K, VD> where
    K: UnwindSafe,
    VD: UnwindSafe, 

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.