Struct ChangeAwareCache 

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

A keyed collection that records its changes until they are captured (ChangeAwareCache<TObject, TKey>): the building block of the cache operators.

Implementations

impl<T: Clone, K: Eq + Hash + Clone> ChangeAwareCache<T, K>

pub fn new() -> Self

An empty cache.

pub fn with_capacity(capacity: usize) -> Self

An empty cache with room for capacity items.

pub fn from_dictionary(data: Dictionary<K, T>) -> Self

A cache of the items of data, without changes (ChangeAwareCache(Dictionary<TKey, TObject>)).

pub fn dictionary(&self) -> &Dictionary<K, T>

The underlying dictionary (GetDictionary).

pub fn into_dictionary(self) -> Dictionary<K, T>

The items, giving up the cache.

pub fn add(&mut self, item: T, key: K)

Adds an item (Add).

Panics

When the key is there already (ArgumentException of the dictionary).

pub fn capture_changes(&mut self) -> ChangeSet<T, K>

The changes since the last capture, and a clean slate (CaptureChanges).

pub fn has_changes(&self) -> bool

Whether there are changes not captured yet.

Trait Implementations

impl<T: Clone, K: Eq + Hash + Clone> Default for ChangeAwareCache<T, K>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Clone, K: Eq + Hash + Clone> ICache<T, K> for ChangeAwareCache<T, K>

fn add_or_update(&mut self, item: T, key: K)

Adds the item, or replaces the item of its key (AddOrUpdate(TObject, TKey)).

fn clear(&mut self)

Removes every item (Clear).

fn clone_changes(&mut self, changes: &ChangeSet<T, K>)

Applies a change set (Clone(IChangeSet<TObject, TKey>)).

fn refresh_all(&mut self)

Refreshes every item (Refresh()).

fn refresh_keys(&mut self, keys: &mut dyn Iterator<Item = K>)

Refreshes the items of the keys (Refresh(IEnumerable<TKey>)).

fn refresh(&mut self, key: &K)

Refreshes the item of key (Refresh(TKey)).

fn remove(&mut self, key: &K)

Removes the item of key (Remove(TKey)).

fn remove_keys(&mut self, keys: &mut dyn Iterator<Item = K>)

Removes the items of the keys (Remove(IEnumerable<TKey>)).

impl<T: Clone, K: Eq + Hash + Clone> IQuery<T, K> for ChangeAwareCache<T, K>

fn count(&self) -> usize

The number of items (Count).

fn items(&self) -> Vec<T>

The items, in the order of enumeration (Items).

fn keys(&self) -> Vec<K>

The keys, in the order of enumeration (Keys).

fn key_values(&self) -> Vec<(K, T)>

The keys and items, in the order of enumeration (KeyValues).

fn lookup(&self, key: &K) -> Option<T>

The item of key (Lookup).