Struct ArcOrdMapWithIntersection 

pub struct ArcOrdMapWithIntersection<K: DefTraits, VD: LatticeDef> { /* private fields */ }

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 ArcOrdMapWithIntersection<K, VD>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

fn default() -> ArcOrdMapWithIntersection<K, VD>

Returns the “default value” for a type.

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

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<K: DefTraits, VD: LatticeDef> LatticeDef for ArcOrdMapWithIntersection<K, VD>

where VD::T: Clone,

type T = Option<OrdMap<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 + DefTraits, VD: Ord + LatticeDef> Ord for ArcOrdMapWithIntersection<K, VD>

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

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

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

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

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

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

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

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

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

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

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

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

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