Struct InMemoryStorageAccess 

pub struct InMemoryStorageAccess<K, V>
where
    K: Hash + Eq + Clone + Send + Sync + 'static,
    V: Clone + Send + Sync + 'static,
{ /* private fields */ }

Process-local cache backed by a locked hash map.

K is the key type; V is the value type. When the map reaches capacity, inserting a new key first removes one arbitrary existing entry.

Implementations

impl<K, V> InMemoryStorageAccess<K, V>

where K: Hash + Eq + Clone + Send + Sync + 'static, V: Clone + Send + Sync + 'static,

pub fn new(max_capacity: u64) -> Self

Creates an empty cache holding up to max_capacity entries.

pub fn for_region(_region: &str) -> Self

Creates an empty cache with capacity 1024; the region name is ignored.

Trait Implementations

impl<K, V> StorageAccess<K, V> for InMemoryStorageAccess<K, V>

where K: Hash + Eq + Clone + Send + Sync + 'static, V: Clone + Send + Sync + 'static,

fn get(&self, key: &K) -> Option<V>

Returns the value for key, or None when absent.

fn put(&self, key: K, value: V)

Stores value under key, overwriting any existing entry.

fn invalidate(&self, key: &K)

Removes the entry for key, if present.

fn clear(&self)

Removes all entries.

fn contains(&self, key: &K) -> bool

Returns true when a value is present for key.