[−][src]Struct pergola::BTreeMapWithUnion
This is a lattice for maps that contain other lattices as values. The join operator takes the union of (key, value) pairs for keys present in only one map -- equivalent to an elementwise join-with-unit -- and the elementwise join of values for keys that exist in both maps.
As with BitSet
, this avoids the typical lexicographic order on maps in
favour of the join-induced partial order: a subset relation extended with
the lattice orders of the values when the same key is present in both maps.
Trait Implementations
impl<K: Debug + Ord + Clone, VD: Debug + LatticeDef> Debug for BTreeMapWithUnion<K, VD>
[src]
impl<K: Ord + Clone, VD: LatticeDef> LatticeDef for BTreeMapWithUnion<K, VD> where
VD::T: Clone,
[src]
VD::T: Clone,
Auto Trait Implementations
impl<K, VD> RefUnwindSafe for BTreeMapWithUnion<K, VD> where
K: RefUnwindSafe,
VD: RefUnwindSafe,
K: RefUnwindSafe,
VD: RefUnwindSafe,
impl<K, VD> Send for BTreeMapWithUnion<K, VD> where
K: Send,
VD: Send,
K: Send,
VD: Send,
impl<K, VD> Sync for BTreeMapWithUnion<K, VD> where
K: Sync,
VD: Sync,
K: Sync,
VD: Sync,
impl<K, VD> Unpin for BTreeMapWithUnion<K, VD> where
K: Unpin,
VD: Unpin,
K: Unpin,
VD: Unpin,
impl<K, VD> UnwindSafe for BTreeMapWithUnion<K, VD> where
K: UnwindSafe,
VD: UnwindSafe,
K: UnwindSafe,
VD: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,