Struct Change 

pub struct Change<T, K> { /* private fields */ }

A change of one item of a cache (Change<TObject, TKey>): its reason, its key, the item and, for an update, the item it replaced; the indexes for a sorted collection.

Deviation (DEVIATIONS.md, DynamicData): the indexes are Option<usize>, where upstream writes -1 for no index.

Implementations

impl<T, K> Change<T, K>

pub fn new(reason: ChangeReason, key: K, current: T) -> Self

A change without a previous item (Change(ChangeReason, TKey, TObject, int index = -1)).

Panics

For ChangeReason::Update, which needs the previous item (ArgumentException).

pub fn with_index( reason: ChangeReason, key: K, current: T, index: Option<usize>, ) -> Self

A change with the index of the item (Change(ChangeReason, TKey, TObject, int index)).

pub fn with_previous( reason: ChangeReason, key: K, current: T, previous: Option<T>, current_index: Option<usize>, previous_index: Option<usize>, ) -> Self

A change with every part (Change(ChangeReason, TKey, TObject, in Optional<TObject>, int, int)).

Panics

For ChangeReason::Add with a previous item, and for ChangeReason::Update without one (ArgumentException).

pub fn update(key: K, current: T, previous: T) -> Self

An update of key from previous to current (Change(ChangeReason.Update, key, current, previous)).

pub fn moved( key: K, current: T, current_index: usize, previous_index: usize, ) -> Self

A move within a sorted collection (Change(TKey, TObject, int currentIndex, int previousIndex)).

pub fn key(&self) -> &K

The key of the item (Key).

pub fn reason(&self) -> ChangeReason

The reason of the change (Reason).

pub fn current(&self) -> &T

The item (Current).

pub fn previous(&self) -> Option<&T>

The item that an update replaced (Previous).

pub fn current_index(&self) -> Option<usize>

The index of the item in a sorted collection (CurrentIndex; -1 upstream when none).

pub fn previous_index(&self) -> Option<usize>

The previous index of the item (PreviousIndex).

pub fn into_parts(self) -> (ChangeReason, K, T, Option<T>)

The parts of the change, taken apart.

Trait Implementations

impl<T: Clone, K: Clone> Clone for Change<T, K>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, K: Debug> Debug for Change<T, K>

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

ToString: the reason, the key, the item and the previous item.

impl<T: Eq, K: Eq> Eq for Change<T, K>

impl<T, K> FromIterator<Change<T, K>> for ChangeSet<T, K>

fn from_iter<I: IntoIterator<Item = Change<T, K>>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: Hash, K: Hash> Hash for Change<T, K>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq, K: PartialEq> PartialEq for Change<T, K>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: PartialEq, K: PartialEq> StructuralPartialEq for Change<T, K>