Struct lattices::set_union_with_tombstones::SetUnionWithTombstones

pub struct SetUnionWithTombstones<Set, TombstoneSet> { /* private fields */ }

Set-union lattice with tombstones.

When an item is deleted from the SetUnionWithTombstones, it is removed from set and added to tombstones. This also is an invariant, if an item appears in tombstones it must not also be in set.

Merging set-union lattices is done by unioning the keys of both the (set and tombstone) sets, and then performing set = set - tombstones, to preserve the above invariant.

TODO: I think there is even one more layer of abstraction that can be made here. this ‘SetUnionWithTombstones’ can be turned into a kind of interface, because there are multiple underlying implementations. This implementation is two separate sets. Another implementation could be MapUnion<Key, WithTop<()>>, this would be less hash lookups, but maybe gives you less options for cool storage tricks. This implementation with two separate sets means that the actual set implementation can be decided for both the regular set and the tombstone set. Lots of opportunities there for cool storage tricks.

Implementations

impl<Set, TombstoneSet> SetUnionWithTombstones<Set, TombstoneSet>

pub fn new(set: Set, tombstones: TombstoneSet) -> Self

Create a new SetUnionWithTombstones from a Set and TombstoneSet.

pub fn new_from( set: impl Into<Set>, tombstones: impl Into<TombstoneSet>, ) -> Self

Create a new SetUnionWithTombstones from an Into<Set> and an Into<TombstonesSet>.

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

Reveal the inner value as a shared reference.

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

Reveal the inner value as an exclusive reference.

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

Gets the inner by value, consuming self.

Trait Implementations

impl<Set: Clone, TombstoneSet: Clone> Clone for SetUnionWithTombstones<Set, TombstoneSet>

fn clone(&self) -> SetUnionWithTombstones<Set, TombstoneSet>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Set: Debug, TombstoneSet: Debug> Debug for SetUnionWithTombstones<Set, TombstoneSet>

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

Formats the value using the given formatter.

impl<Set: Default, TombstoneSet: Default> Default for SetUnionWithTombstones<Set, TombstoneSet>

fn default() -> SetUnionWithTombstones<Set, TombstoneSet>

Returns the “default value” for a type.

impl<Set, TombstoneSet> IsBot for SetUnionWithTombstones<Set, TombstoneSet>

where Set: Len, TombstoneSet: Len,

fn is_bot(&self) -> bool

Returns if self is lattice bottom (⊥).

impl<Set, TombstoneSet> IsTop for SetUnionWithTombstones<Set, TombstoneSet>

fn is_top(&self) -> bool

Returns if self is lattice top (⊤).

impl<SetSelf, TombstoneSetSelf, SetOther, TombstoneSetOther, Item> LatticeFrom<SetUnionWithTombstones<SetOther, TombstoneSetOther>> for SetUnionWithTombstones<SetSelf, TombstoneSetSelf>

where SetSelf: FromIterator<Item>, SetOther: IntoIterator<Item = Item>, TombstoneSetSelf: FromIterator<Item>, TombstoneSetOther: IntoIterator<Item = Item>,

fn lattice_from( other: SetUnionWithTombstones<SetOther, TombstoneSetOther>, ) -> Self

Convert from the Other lattice into Self.

impl<Item, SetSelf, TombstoneSetSelf, SetOther, TombstoneSetOther> Merge<SetUnionWithTombstones<SetOther, TombstoneSetOther>> for SetUnionWithTombstones<SetSelf, TombstoneSetSelf>

where SetSelf: Extend<Item> + Len + for<'a> Remove<&'a Item>, SetOther: IntoIterator<Item = Item>, TombstoneSetSelf: Extend<Item> + Len + for<'a> Get<&'a Item>, TombstoneSetOther: IntoIterator<Item = Item>,

fn merge( &mut self, other: SetUnionWithTombstones<SetOther, 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<SetSelf, TombstoneSetSelf, SetOther, TombstoneSetOther, Item> PartialEq<SetUnionWithTombstones<SetOther, TombstoneSetOther>> for SetUnionWithTombstones<SetSelf, TombstoneSetSelf>

where SetSelf: Set<Item, Item = Item> + Iter, SetOther: Set<Item, Item = Item> + Iter, TombstoneSetSelf: Set<Item, Item = Item> + Iter, TombstoneSetOther: Set<Item, Item = Item> + Iter,

fn eq( &self, other: &SetUnionWithTombstones<SetOther, 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<SetSelf, TombstoneSetSelf, SetOther, TombstoneSetOther, Item> PartialOrd<SetUnionWithTombstones<SetOther, TombstoneSetOther>> for SetUnionWithTombstones<SetSelf, TombstoneSetSelf>

where SetSelf: Set<Item, Item = Item> + Iter, SetOther: Set<Item, Item = Item> + Iter, TombstoneSetSelf: Set<Item, Item = Item> + Iter, TombstoneSetOther: Set<Item, Item = Item> + Iter,

fn partial_cmp( &self, other: &SetUnionWithTombstones<SetOther, 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<SetSelf, TombstoneSetSelf> Eq for SetUnionWithTombstones<SetSelf, TombstoneSetSelf>

where Self: PartialEq,

impl<SetSelf, TombstoneSetSelf, SetOther, TombstoneSetOther> LatticeOrd<SetUnionWithTombstones<SetOther, TombstoneSetOther>> for SetUnionWithTombstones<SetSelf, TombstoneSetSelf>

where Self: PartialOrd<SetUnionWithTombstones<SetOther, TombstoneSetOther>>,