Type Alias MapUnionBTreeMap

pub type MapUnionBTreeMap<K, Val> = MapUnion<BTreeMap<K, Val>>;

std::collections::BTreeMap-backed MapUnion lattice.

Aliased Type

struct MapUnionBTreeMap<K, Val>(/* private fields */);

Implementations

impl<Map> MapUnion<Map>

pub fn new(val: Map) -> Self

Create a new MapUnion from a Map.

pub fn new_from(val: impl Into<Map>) -> Self

Create a new MapUnion from an Into<Map>.

pub fn as_reveal_ref(&self) -> &Map

Reveal the inner value as a shared reference.

pub fn as_reveal_mut(&mut self) -> &mut Map

Reveal the inner value as an exclusive reference.

pub fn into_reveal(self) -> Map

Gets the inner by value, consuming self.

Trait Implementations

impl<Map, K, Val> Atomize for MapUnion<Map>

where Map: 'static + IntoIterator<Item = (K, Val)> + Keyed<Key = K, Item = Val> + Extend<(K, Val)> + for<'a> GetMut<&'a K, Item = Val>, K: 'static + Clone, Val: 'static + Atomize + LatticeFrom<<Val as Atomize>::Atom>,

type Atom = MapUnion<SingletonMap<K, <Val as Atomize>::Atom>>

The type of atoms for this lattice.

type AtomIter = Box<dyn Iterator<Item = <MapUnion<Map> as Atomize>::Atom>>

The iter type iterating the antichain atoms.

fn atomize(self) -> Self::AtomIter

Atomize self: convert into an iter of atoms.

impl<Map: Clone> Clone for MapUnion<Map>

fn clone(&self) -> MapUnion<Map>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Map: Debug> Debug for MapUnion<Map>

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

Formats the value using the given formatter.

impl<Map, Val> DeepReveal for MapUnion<Map>

where Map: Keyed<Item = Val> + MapMapValues<Val>, Val: DeepReveal,

type Revealed = <Map as MapMapValues<Val>>::MapValue<<Val as DeepReveal>::Revealed>

The underlying type when revealed.

fn deep_reveal(self) -> Self::Revealed

Reveals the underlying lattice types recursively.

impl<Map: Default> Default for MapUnion<Map>

fn default() -> MapUnion<Map>

Returns the “default value” for a type.

impl<'de, Map> Deserialize<'de> for MapUnion<Map>

where Map: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<Map> IsBot for MapUnion<Map>

where Map: Iter, Map::Item: IsBot,

fn is_bot(&self) -> bool

Returns if self is lattice bottom (⊥).

impl<Map> IsTop for MapUnion<Map>

fn is_top(&self) -> bool

Returns if self is lattice top (⊤).

impl<MapSelf, MapOther, K, ValSelf, ValOther> LatticeFrom<MapUnion<MapOther>> for MapUnion<MapSelf>

where MapSelf: Keyed<Key = K, Item = ValSelf> + FromIterator<(K, ValSelf)>, MapOther: IntoIterator<Item = (K, ValOther)>, ValSelf: LatticeFrom<ValOther>,

fn lattice_from(other: MapUnion<MapOther>) -> Self

Convert from the Other lattice into Self.

impl<MapSelf, MapOther, K, ValSelf, ValOther> Merge<MapUnion<MapOther>> for MapUnion<MapSelf>

where MapSelf: Keyed<Key = K, Item = ValSelf> + Extend<(K, ValSelf)> + for<'a> GetMut<&'a K, Item = ValSelf>, MapOther: IntoIterator<Item = (K, ValOther)>, ValSelf: Merge<ValOther> + LatticeFrom<ValOther>, ValOther: IsBot,

fn merge(&mut self, other: MapUnion<MapOther>) -> bool

Merge other into the self lattice.

fn merge_owned(this: Self, delta: Other) -> Self

where Self: Sized,

Merge this and delta together, returning the new value.

impl<MapSelf, MapOther, K, ValSelf, ValOther> PartialEq<MapUnion<MapOther>> for MapUnion<MapSelf>

where MapSelf: Map<K, ValSelf, Key = K, Item = ValSelf> + MapIter + SimpleKeyedRef, MapOther: Map<K, ValOther, Key = K, Item = ValOther> + MapIter + SimpleKeyedRef, ValSelf: PartialEq<ValOther> + IsBot, ValOther: IsBot,

fn eq(&self, other: &MapUnion<MapOther>) -> 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<MapSelf, MapOther, K, ValSelf, ValOther> PartialOrd<MapUnion<MapOther>> for MapUnion<MapSelf>

where MapSelf: Map<K, ValSelf, Key = K, Item = ValSelf> + MapIter + SimpleKeyedRef, MapOther: Map<K, ValOther, Key = K, Item = ValOther> + MapIter + SimpleKeyedRef, ValSelf: PartialOrd<ValOther> + IsBot, ValOther: IsBot,

fn partial_cmp(&self, other: &MapUnion<MapOther>) -> 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<Map> Serialize for MapUnion<Map>

where Map: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<Map: Copy> Copy for MapUnion<Map>

impl<MapSelf> Eq for MapUnion<MapSelf>

where Self: PartialEq,

impl<MapSelf, MapOther> LatticeOrd<MapUnion<MapOther>> for MapUnion<MapSelf>

where Self: PartialOrd<MapUnion<MapOther>>,