Struct LocalCache 

pub struct LocalCache<K, V, H> { /* private fields */ }

When immutable cache access is required, use this LocalCache to store evicted values. Then when you get mutable cache access, call into_iter to update the cache manually.

This cache comes with a price: the values will be boxed in order to provide stable borrows. Ideally, it should be cheap to box your values, i.e. most of their data should already be on the heap.

Implementations

impl<K, V, H> LocalCache<K, V, H>

where K: Eq + Hash, H: Default + BuildHasher,

pub fn new() -> Self

pub fn remember_cached_access(&self, key: K)

pub fn get_or_insert_with(&self, key: K, f: impl FnOnce() -> V) -> &V

pub fn into_iter(self) -> impl Iterator<Item = (K, LocalAccess<V>)>

Trait Implementations

impl<K: Default, V: Default, H: Default> Default for LocalCache<K, V, H>

fn default() -> LocalCache<K, V, H>

Returns the “default value” for a type.