Struct LsmTreeMap 

pub struct LsmTreeMap<S, K, V>
where
    S: AnyBlockStorage,
    K: Hash + Ord + Clone + Serialize + DeserializeOwned + Send + Sync + 'static,
    V: Clone + Serialize + DeserializeOwned + Send + Sync + 'static,
{ /* private fields */ }

LSM Tree Instance.

Implementations

impl<S, K, V> LsmTreeMap<S, K, V>

where S: AnyBlockStorage, K: Hash + Ord + Clone + Serialize + DeserializeOwned + Send + Sync + 'static, V: Clone + Serialize + DeserializeOwned + Send + Sync + 'static,

pub fn new(storage: S, settings: LsmTreeMapSettings) -> Self

Create new empty tree.

pub async fn load( storage: S, root: Link<Root<K, V>>, ) -> Result<Self, StorageError>

Load Tree from root CID.

pub async fn insert(&mut self, key: K, value: V) -> Result<(), StorageError>

Insert/Replace key.

pub async fn remove(&mut self, key: K) -> Result<(), StorageError>

Remove key.

pub async fn get(&self, key: &K) -> Result<Option<V>, StorageError>

Get value for key.

pub async fn contains_key(&self, key: &K) -> Result<bool, StorageError>

pub fn stream( &self, ) -> impl Stream<Item = Result<(K, V), StorageError>> + use<S, K, V>

Stream all tree entries.

pub fn stream_query( &self, start_at: Option<K>, ) -> impl Stream<Item = Result<(K, V), StorageError>> + use<S, K, V>

Stream tree entries.

pub fn reverse_stream( &self, ) -> impl Stream<Item = Result<(K, V), StorageError>> + use<S, K, V>

Stream all tree entries in reverse order.

pub fn reverse_stream_query( &self, start_at: Option<K>, ) -> impl Stream<Item = Result<(K, V), StorageError>> + use<S, K, V>

Stream tree entries in reverse order.

pub async fn store(&mut self) -> Result<OptionLink<Root<K, V>>, StorageError>

Store active items and return the root link.

Guarantees

• The method detects if the collection is empty after this and accordingly returns OptionLink::none.

pub async fn stats(&self) -> Result<LsmTreeStats, StorageError>

Tree stats.

pub async fn is_empty(&self) -> Result<bool, StorageError>

Whether the collection is empty.

pub async fn min_key(&self) -> Result<Option<K>, StorageError>

Find the first (active - not tombstoned) key.

pub async fn max_key(&self) -> Result<Option<K>, StorageError>

Find the last (active - not tombstoned) key.

pub async fn compact(&mut self, flush_active: bool) -> Result<(), StorageError>

Compact tree.

Arguments

• flush_active - Flush active “in memory” entries to L0.

Trait Implementations

impl<S, K, V> Clone for LsmTreeMap<S, K, V>

where S: AnyBlockStorage + Clone, K: Hash + Ord + Clone + Serialize + DeserializeOwned + Send + Sync + 'static + Clone, V: Clone + Serialize + DeserializeOwned + Send + Sync + 'static + Clone,

fn clone(&self) -> LsmTreeMap<S, K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.