Struct lattices::map_union_with_tombstones::MapUnionWithTombstones

pub struct MapUnionWithTombstones<Map, TombstoneSet> { /* private fields */ }

Map-union-with-tombstones compound lattice.

When a key is deleted from the map-union-with-tombstones lattice, it is removed from the underlying map and placed into the tombstones set.

This forms the first invariant for this data structure. A key should appear either nowhere, in map or in tombstones. but never in map and tombstones at the same time.

merging is done by merging the underlying map and then merging the tombstones set, then doing map = map - tombstones.

The implementation of tombstones can be any set-like thing. This allows a user to plug in their own set-like implementation. For example, if the user knows that keys will be created and deleted strictly sequentially, then they could create a highly optimized set implementation which would just be a single integer, correpsonding to the current key value that the set is up to. Queries for keys below that integer would return true, queries for keys above it would return false.

Implementations

impl<Map, TombstoneSet> MapUnionWithTombstones<Map, TombstoneSet>

pub fn new(map: Map, tombstones: TombstoneSet) -> Self

Create a new MapUnionWithTombstones from a Map and a TombstoneSet.

pub fn new_from( map: impl Into<Map>, tombstones: impl Into<TombstoneSet>, ) -> Self

Create a new MapUnionWithTombstones from an Into<Map> and an Into<TombstoneSet>.

pub fn as_reveal_ref(&self) -> (&Map, &TombstoneSet)

Reveal the inner value as a shared reference.

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

Reveal the inner value as an exclusive reference.

pub fn into_reveal(self) -> (Map, TombstoneSet)

Gets the inner by value, consuming self.

Trait Implementations

impl<Map: Clone, TombstoneSet: Clone> Clone for MapUnionWithTombstones<Map, TombstoneSet>

fn clone(&self) -> MapUnionWithTombstones<Map, TombstoneSet>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Map: Debug, TombstoneSet: Debug> Debug for MapUnionWithTombstones<Map, TombstoneSet>

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

Formats the value using the given formatter.

impl<Map: Default, TombstoneSet: Default> Default for MapUnionWithTombstones<Map, TombstoneSet>

fn default() -> MapUnionWithTombstones<Map, TombstoneSet>

Returns the “default value” for a type.

impl<'de, Map, TombstoneSet> Deserialize<'de> for MapUnionWithTombstones<Map, TombstoneSet>

where Map: Deserialize<'de>, TombstoneSet: 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, TombstoneSet> IsBot for MapUnionWithTombstones<Map, TombstoneSet>

where Map: Iter, Map::Item: IsBot, TombstoneSet: Len,

fn is_bot(&self) -> bool

Returns if self is lattice bottom (⊥).

impl<Map, TombstoneSet> IsTop for MapUnionWithTombstones<Map, TombstoneSet>

fn is_top(&self) -> bool

Returns if self is lattice top (⊤).

impl<MapSelf, MapOther, K, ValSelf, ValOther, TombstoneSetSelf, TombstoneSetOther> LatticeFrom<MapUnionWithTombstones<MapOther, TombstoneSetOther>> for MapUnionWithTombstones<MapSelf, TombstoneSetSelf>

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

fn lattice_from( other: MapUnionWithTombstones<MapOther, TombstoneSetOther>, ) -> Self

Convert from the Other lattice into Self.

impl<MapSelf, MapOther, K, ValSelf, ValOther, TombstoneSetSelf, TombstoneSetOther> Merge<MapUnionWithTombstones<MapOther, TombstoneSetOther>> for MapUnionWithTombstones<MapSelf, TombstoneSetSelf>

where MapSelf: Keyed<Key = K, Item = ValSelf> + Extend<(K, ValSelf)> + for<'a> GetMut<&'a K, Item = ValSelf> + for<'b> Remove<&'b K>, MapOther: IntoIterator<Item = (K, ValOther)>, ValSelf: Merge<ValOther> + LatticeFrom<ValOther>, ValOther: IsBot, TombstoneSetSelf: Extend<K> + Len + for<'a> Get<&'a K> + Iter<Item = K>, TombstoneSetOther: IntoIterator<Item = K>,

fn merge( &mut self, other: MapUnionWithTombstones<MapOther, TombstoneSetOther>, ) -> 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, TombstoneSetSelf, TombstoneSetOther> PartialEq<MapUnionWithTombstones<MapOther, TombstoneSetOther>> for MapUnionWithTombstones<MapSelf, TombstoneSetSelf>

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, TombstoneSetSelf: Len + Iter<Item = K> + for<'a> Get<&'a K>, TombstoneSetOther: Len + Iter<Item = K> + for<'b> Get<&'b K>,

fn eq( &self, other: &MapUnionWithTombstones<MapOther, TombstoneSetOther>, ) -> 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, TombstoneSetSelf, TombstoneSetOther> PartialOrd<MapUnionWithTombstones<MapOther, TombstoneSetOther>> for MapUnionWithTombstones<MapSelf, TombstoneSetSelf>

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, TombstoneSetSelf: Len + Iter<Item = K> + for<'a> Get<&'a K>, TombstoneSetOther: Len + Iter<Item = K> + for<'a> Get<&'a K>,

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

where Map: Serialize, TombstoneSet: 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, TombstoneSet: Copy> Copy for MapUnionWithTombstones<Map, TombstoneSet>

impl<MapSelf, TombstoneSetSelf> Eq for MapUnionWithTombstones<MapSelf, TombstoneSetSelf>

where Self: PartialEq,

impl<MapSelf, MapOther, TombstoneSetSelf, TombstoneSetOther> LatticeOrd<MapUnionWithTombstones<MapOther, TombstoneSetOther>> for MapUnionWithTombstones<MapSelf, TombstoneSetSelf>

where Self: PartialOrd<MapUnionWithTombstones<MapOther, TombstoneSetOther>>,