Struct tari_storage::LMDBWrapper

pub struct LMDBWrapper<K, V> { /* fields omitted */ }

This is a simple wrapper struct that lifts the generic parameters so that KeyValStore can be implemented on LMDBDatabase. LMDBDatabase doesn't have the generics at the struct level because the LMDBStore can contain many instances of LMDBDatabase each with different K and V types.

Implementations

impl<K, V> LMDBWrapper<K, V>

pub fn new(db: Arc<LMDBDatabase>) -> LMDBWrapper<K, V>

Wrap a LMDBDatabase instance so that it implements KeyValueStore

pub fn inner(&self) -> Arc<LMDBDatabase>

Get access to the underlying LMDB database

Trait Implementations

impl<K, V> KeyValueStore<K, V> for LMDBWrapper<K, V> where
    K: AsLmdbBytes + DeserializeOwned,
    V: Serialize + DeserializeOwned, 

fn insert(&self, key: K, value: V) -> Result<(), KeyValStoreError>

Inserts a key-value pair into the key-value database.

fn get(&self, key: &K) -> Result<Option<V>, KeyValStoreError> where
    V: DeserializeOwned, 

Get the value corresponding to the provided key from the key-value database.

fn size(&self) -> Result<usize, KeyValStoreError>

Returns the total number of entries recorded in the key-value database.

fn for_each<F>(&self, f: F) -> Result<(), KeyValStoreError> where
    F: FnMut(Result<(K, V), KeyValStoreError>) -> IterationResult, 

Iterate over all the stored records and execute the function f for each pair in the key-value database.

fn exists(&self, key: &K) -> Result<bool, KeyValStoreError>

Checks whether a record exist in the key-value database that corresponds to the provided key.

fn delete(&self, key: &K) -> Result<(), KeyValStoreError>

Remove the record from the key-value database that corresponds with the provided key.

fn for_each_ok<F>(&self, mut f: F) -> Result<(), KeyValStoreError> where
    Self: Sized,
    F: FnMut((K, V)) -> IterationResult, 

Execute function f for each value in the database. Any errors are filtered out. This is useful for any caller which could not do any better with an error than filtering it out.

fn filter<F>(&self, predicate: F) -> Result<Vec<(K, V)>, KeyValStoreError> where
    Self: Sized,
    F: FnMut(&(K, V)) -> bool, 

Return a Vec<(K, V)> filtered by the predicate.

fn filter_take<F>(
    &self,
    n: usize,
    mut predicate: F
) -> Result<Vec<(K, V)>, KeyValStoreError> where
    Self: Sized,
    F: FnMut(&(K, V)) -> bool, 

Return a Vec<(K, V)> filtered by the predicate. At most n pairs are returned.