Struct LastValCacheStore 

pub struct LastValCacheStore<S>
where
    S: StoreBase,
{ /* private fields */ }

A OrderedStore that caches the last value in memory

If you need to call OrderedStoreRead::last as lot, this will speed up access

Implementations

impl<S> LastValCacheStore<S>

where S: StoreBase,

pub fn new(store: S) -> Self

Trait Implementations

impl<S> AppendableStore for LastValCacheStore<S>

where S: AppendableStore<Key: Clone, Value: Clone>,

fn append(&self, value: Self::Value) -> Self::Key

Insert a value into the store and return the index

impl<S> AsyncAppendableStore for LastValCacheStore<S>

where S: AsyncAppendableStore<Key: Clone, Value: Clone>,

async fn append(&self, value: Self::Value) -> Self::Key

Insert a value into the store and return the index

impl<S> AsyncOrderedStoreRead for LastValCacheStore<S>

where S: AsyncOrderedStoreRead<Key: Clone, Value: Clone>,

async fn last(&self) -> Option<(Self::Key, Self::Value)>

Returns the last element in the store

impl<S> AsyncSearchableStoreRead for LastValCacheStore<S>

where S: AsyncSearchableStoreRead<Key: Clone, Value: Clone>,

async fn filter( &self, pred: impl FnMut(&Self::Key, &Self::Value) -> bool, ) -> Vec<(Self::Key, Self::Value)>

Search for all entries in the store, that fulfill a certain predicate

async fn find( &self, pred: impl FnMut(&Self::Key, &Self::Value) -> bool, ) -> Option<(Self::Key, Self::Value)>

impl<S> AsyncStoreRead for LastValCacheStore<S>

where S: AsyncStoreRead<Key: Clone>,

async fn get(&self, key: Self::Key) -> Option<Self::Value>

Returns the value associated with key from the Store

async fn len(&self) -> usize

Returns the number of elements in the Store

fn is_empty(&self) -> impl Future<Output = bool>

Returns true, if the store is empty

impl<S> AsyncStoreWrite for LastValCacheStore<S>

where S: AsyncStoreWrite<Key: Clone>,

async fn insert(&self, key: Self::Key, value: Self::Value)

Insert a value into the store

async fn delete(&self, key: Self::Key) -> bool

Remove a value from the store

impl<S> Deref for LastValCacheStore<S>

where S: StoreBase,

type Target = S

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<S> DerefMut for LastValCacheStore<S>

where S: StoreBase,

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<S> OrderedStoreRead for LastValCacheStore<S>

where S: OrderedStoreRead<Key: Clone, Value: Clone>,

fn last(&self) -> Option<(Self::Key, Self::Value)>

Returns the last element in the store

impl<S> SearchableStoreRead for LastValCacheStore<S>

where S: SearchableStoreRead<Key: Clone, Value: Clone>,

fn filter( &self, pred: impl FnMut(&Self::Key, &Self::Value) -> bool, ) -> Vec<(Self::Key, Self::Value)>

Search for all entries in the store, that fulfill a certain predicate

fn find( &self, pred: impl FnMut(&Self::Key, &Self::Value) -> bool, ) -> Option<(Self::Key, Self::Value)>

impl<S> StoreBase for LastValCacheStore<S>

where S: StoreBase,

type Key = <S as StoreBase>::Key

type Value = <S as StoreBase>::Value

impl<S> StoreRead for LastValCacheStore<S>

where S: StoreRead,

fn get(&self, key: &Self::Key) -> Option<Self::Value>

Returns the value associated with key from the Store

fn len(&self) -> usize

Returns the number of elements in the Store

fn is_empty(&self) -> bool

Returns true, if the store is empty

impl<S> StoreWrite for LastValCacheStore<S>

where S: StoreWrite,

fn insert(&self, key: Self::Key, value: Self::Value)

Insert a value into the store

fn delete(&self, key: &Self::Key) -> bool

Remove a value from the store