Struct pergola::BTreeMapWithIntersection

pub struct BTreeMapWithIntersection<K: DefTraits, 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: Clone + DefTraits, VD: Clone + LatticeDef> Clone for BTreeMapWithIntersection<K, VD>

pub fn clone(&self) -> BTreeMapWithIntersection<K, VD>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug + DefTraits, VD: Debug + LatticeDef> Debug for BTreeMapWithIntersection<K, VD>

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K: Default + DefTraits, VD: Default + LatticeDef> Default for BTreeMapWithIntersection<K, VD>

pub fn default() -> BTreeMapWithIntersection<K, VD>

Returns the "default value" for a type.

impl<'de, K: DefTraits, VD: LatticeDef> Deserialize<'de> for BTreeMapWithIntersection<K, VD>

pub fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<K: Eq + DefTraits, VD: Eq + LatticeDef> Eq for BTreeMapWithIntersection<K, VD>

impl<K: Hash + DefTraits, VD: Hash + LatticeDef> Hash for BTreeMapWithIntersection<K, VD>

pub fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

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

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

pub fn unit() -> Self::T

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

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

impl<K: Ord + DefTraits, VD: Ord + LatticeDef> Ord for BTreeMapWithIntersection<K, VD>

pub fn cmp(&self, other: &BTreeMapWithIntersection<K, VD>) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<K: PartialEq + DefTraits, VD: PartialEq + LatticeDef> PartialEq<BTreeMapWithIntersection<K, VD>> for BTreeMapWithIntersection<K, VD>

pub fn eq(&self, other: &BTreeMapWithIntersection<K, VD>) -> bool

This method tests for self and other values to be equal, and is used by ==.

pub fn ne(&self, other: &BTreeMapWithIntersection<K, VD>) -> bool

This method tests for !=.

impl<K: PartialOrd + DefTraits, VD: PartialOrd + LatticeDef> PartialOrd<BTreeMapWithIntersection<K, VD>> for BTreeMapWithIntersection<K, VD>

pub fn partial_cmp(
    &self,
    other: &BTreeMapWithIntersection<K, VD>
) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

pub fn lt(&self, other: &BTreeMapWithIntersection<K, VD>) -> bool

This method tests less than (for self and other) and is used by the < operator.

pub fn le(&self, other: &BTreeMapWithIntersection<K, VD>) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

pub fn gt(&self, other: &BTreeMapWithIntersection<K, VD>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

pub fn ge(&self, other: &BTreeMapWithIntersection<K, VD>) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<K: DefTraits, VD: LatticeDef> Serialize for BTreeMapWithIntersection<K, VD>

pub fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<K: DefTraits, VD: LatticeDef> StructuralEq for BTreeMapWithIntersection<K, VD>

impl<K: DefTraits, VD: LatticeDef> StructuralPartialEq for BTreeMapWithIntersection<K, VD>