Struct DataStore 

pub struct DataStore { /* private fields */ }

DataStore

Thin persistence wrapper over one stable BTreeMap.

Invariant: callers provide already-validated RawDataKey and canonical row bytes. This type intentionally does not enforce commit-phase ordering.

Implementations

impl DataStore

pub fn init(memory: VirtualMemory<DefaultMemoryImpl>) -> Self

Initialize a data store with the provided backing memory.

pub fn remove(&mut self, key: &RawDataKey) -> Option<RawRow>

Remove one row by raw key.

pub fn get(&self, key: &RawDataKey) -> Option<RawRow>

Load one row by raw key.

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

Return whether one raw key exists without cloning the row payload.

pub fn clear(&mut self)

Clear all stored rows from the data store.

pub fn len(&self) -> u64

Return the number of stored rows without exposing the backing map.

pub fn is_empty(&self) -> bool

Return whether the data store currently contains no rows.

pub fn memory_bytes(&self) -> u64

Sum of bytes used by all stored rows.