Struct ZeroShard 

pub struct ZeroShard<'a, K: Key, const V: usize, T: Copy + IntoBytes + FromBytes + Immutable = [u8; V], D: Durability = Bitcask, WH: WriteHook<K> = NoHook> { /* private fields */ }

Handle for atomic multi-key operations within a single shard. Obtained via ZeroTree::atomic.

Implementations

impl<K: Key, const V: usize, T: Copy + IntoBytes + FromBytes + Immutable, D: Durability, WH: WriteHook<K>> ZeroShard<'_, K, V, T, D, WH>

pub fn put(&mut self, key: &K, value: &T) -> DbResult<Option<T>>

pub fn insert(&mut self, key: &K, value: &T) -> DbResult<()>

pub fn delete(&mut self, key: &K) -> DbResult<Option<T>>

pub fn try_get(&self, key: &K) -> DbResult<Option<T>>

pub fn get_or_err(&self, key: &K) -> DbResult<T>

pub fn try_contains(&self, key: &K) -> DbResult<bool>

pub fn update( &mut self, key: &K, f: impl FnOnce(&T) -> T, ) -> DbResult<Option<T>>

Atomically read-modify-write. Returns Some(T) (the new value) if key existed, None otherwise.

pub fn fetch_update( &mut self, key: &K, f: impl FnOnce(&T) -> T, ) -> DbResult<Option<T>>

Like update(), but returns Some(T) with the old value.

pub fn upsert<U: IntoUpsert<T>>( &mut self, key: &K, f: impl FnOnce(Option<&T>) -> U, ) -> DbResult<U::Out>

Decide-and-write within the shard. The closure must be short — shard lock is held.