Trait lattices::Merge

pub trait Merge<Other> {
    // Required method
    fn merge(&mut self, other: Other) -> bool;

    // Provided method
    fn merge_owned(this: Self, delta: Other) -> Self
       where Self: Sized { ... }
}

Trait for lattice merge (AKA “join” or “least upper bound”).

Required Methods

fn merge(&mut self, other: Other) -> bool

Merge other into the self lattice.

This operation must be associative, commutative, and idempotent.

Returns true if self changed, false otherwise. Returning true implies that the new value for self is later in the lattice order than the old value. Returning false means that self was unchanged and therefore other came before self (or the two are equal) in the lattice order.

Provided Methods

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

where Self: Sized,

Merge this and delta together, returning the new value.

Implementations on Foreign Types

impl Merge<()> for ()

fn merge(&mut self, _other: Self) -> bool

Implementors

impl<Head, Node> Merge<GhtInner<Head, Node>> for GhtInner<Head, Node>

where Node: GeneralizedHashTrieNode + Merge<Node>, Node::Storage: VariadicSet<Schema = Node::Schema>, Self: GeneralizedHashTrieNode, Head: Hash + Eq + Clone,

impl<Inner, Other> Merge<WithBot<Other>> for WithBot<Inner>

where Inner: Merge<Other> + LatticeFrom<Other>, Other: IsBot,

impl<Inner, Other> Merge<WithTop<Other>> for WithTop<Inner>

where Inner: Merge<Other> + LatticeFrom<Other>,

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>,

impl<KeySelf, KeyOther, ValSelf, ValOther> Merge<DomPair<KeyOther, ValOther>> for DomPair<KeySelf, ValSelf>

where KeySelf: Merge<KeyOther> + LatticeFrom<KeyOther> + PartialOrd<KeyOther>, ValSelf: Merge<ValOther> + LatticeFrom<ValOther>,

impl<LatA, LatB, __LatAOther, __LatBOther> Merge<Pair<__LatAOther, __LatBOther>> for Pair<LatA, LatB>

where LatA: Merge<__LatAOther>, LatB: Merge<__LatBOther>,

impl<LatSelf, LatOther> Merge<VecUnion<LatOther>> for VecUnion<LatSelf>

where LatSelf: Merge<LatOther> + LatticeFrom<LatOther>,

impl<MapSelf, MapOther, K> Merge<UnionFind<MapOther>> for UnionFind<MapSelf>

where MapSelf: MapMut<K, Cell<K>, Key = K, Item = Cell<K>>, MapOther: IntoIterator<Item = (K, Cell<K>)>, K: Copy + Eq,

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,

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>,

impl<Schema, ValType, Storage> Merge<GhtLeaf<Schema, ValType, Storage>> for GhtLeaf<Schema, ValType, Storage>

where Schema: Eq + Hash, Storage: VariadicSet<Schema = Schema> + Extend<Schema> + IntoIterator<Item = Schema>,

impl<SetSelf, SetOther, Item> Merge<SetUnion<SetOther>> for SetUnion<SetSelf>

where SetSelf: Extend<Item> + Len, SetOther: IntoIterator<Item = Item>,

impl<T> Merge<Max<T>> for Max<T>

where T: Ord,

impl<T> Merge<Min<T>> for Min<T>

where T: Ord,

impl<T, O> Merge<Conflict<O>> for Conflict<T>

where T: PartialEq<O>,

impl<T, Provenance> Merge<Point<T, Provenance>> for Point<T, Provenance>

where T: PartialEq,