Trait Unordered 

pub trait Unordered: Sized {
    type Delta: Default;

    // Required methods
    fn diff(old: Self, new: Self) -> Option<Self::Delta>;
    fn apply(&mut self, delta: Self::Delta);
}

A collection that can be diffed by membership alone.

Required Associated Types

type Delta: Default

The shape a membership diff of this collection takes.

Required Methods

fn diff(old: Self, new: Self) -> Option<Self::Delta>

Computes what it would take to turn old into new, or None when the two hold the same elements.

The None mirrors Delta::delta: it is how a field says it has nothing to contribute, so that a struct whose fields all say so produces no delta at all.

fn apply(&mut self, delta: Self::Delta)

Applies a membership diff in place.

Membership is preserved but position is not — additions land wherever the collection decides to put them. Unlike map::apply this cannot fail, because it never recurses into Delta::apply_delta.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<K, V, S> Unordered for HashMap<K, V, S>

where K: Hash + Eq, V: PartialEq, S: BuildHasher,

type Delta = EntryDelta<K, V>

fn diff(old: Self, new: Self) -> Option<EntryDelta<K, V>>

fn apply(&mut self, delta: EntryDelta<K, V>)

impl<K, V> Unordered for BTreeMap<K, V>

where K: Ord, V: PartialEq,

type Delta = EntryDelta<K, V>

fn diff(old: Self, new: Self) -> Option<EntryDelta<K, V>>

fn apply(&mut self, delta: EntryDelta<K, V>)

impl<T, S> Unordered for HashSet<T, S>

where T: Hash + Eq, S: BuildHasher,

type Delta = BagDelta<T>

fn diff(old: Self, new: Self) -> Option<BagDelta<T>>

fn apply(&mut self, delta: BagDelta<T>)

impl<T> Unordered for BTreeSet<T>

where T: Ord,

type Delta = BagDelta<T>

fn diff(old: Self, new: Self) -> Option<BagDelta<T>>

fn apply(&mut self, delta: BagDelta<T>)

Implementors