Struct kv_rs::storage::memory::Memory

pub struct Memory { /* private fields */ }

An in-memory key/value storage engine using the Rust standard library B-tree implementation. Data is not persisted.

Implementations

impl Memory

pub fn new() -> Self

Creates a new Memory key-value storage engine.

Trait Implementations

impl Display for Memory

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Engine for Memory

type ScanIterator<'a> = MemoryScanIterator<'a>

The iterator returned by scan().

fn delete(&mut self, key: &[u8]) -> CResult<i64>

Deletes a key, or does nothing if it does not exist.

fn flush(&mut self) -> CResult<()>

Flushes any buffered data to the underlying storage medium.

fn get(&mut self, key: &[u8]) -> CResult<Option<Vec<u8>>>

Gets a value for a key, if it exists.

fn scan(&mut self, range: impl RangeBounds<Vec<u8>>) -> Self::ScanIterator<'_>

where Self: Sized,

Iterates over an ordered range of key/value pairs.

fn scan_dyn( &mut self, range: (Bound<Vec<u8>>, Bound<Vec<u8>>) ) -> Box<dyn ScanIteratorT + '_>

Like scan, but can be used from trait objects. The iterator will use dynamic dispatch, which has a minor performance penalty.

fn set(&mut self, key: &[u8], value: Vec<u8>) -> CResult<()>

Sets a value for a key, replacing the existing value if any.

fn status(&mut self) -> CResult<Status>

Returns engine status.

fn scan_prefix(&mut self, prefix: &[u8]) -> Self::ScanIterator<'_>

where Self: Sized,

Iterates over all key/value pairs starting with prefix.