Struct MemoryKvStore 

pub struct MemoryKvStore { /* private fields */ }

In-memory key-value store using lock-free concurrent hashmap.

Thread-safe and optimized for high-concurrency read/write workloads. Uses DashMap internally for O(1) average-case operations.

Example

use trueno_db::kv::{KvStore, MemoryKvStore};

let store = MemoryKvStore::new();
store.set("hello", b"world".to_vec()).await?;
assert_eq!(store.get("hello").await?, Some(b"world".to_vec()));

Implementations

impl MemoryKvStore

pub fn new() -> Self

Create a new in-memory KV store.

pub fn with_capacity(capacity: usize) -> Self

Create with pre-allocated capacity.

pub fn len(&self) -> usize

Get the number of entries in the store.

pub fn is_empty(&self) -> bool

Check if the store is empty.

pub fn clear(&self)

Clear all entries.

Trait Implementations

impl Default for MemoryKvStore

fn default() -> Self

Returns the “default value” for a type.

impl KvStore for MemoryKvStore

async fn get(&self, key: &str) -> Result<Option<Vec<u8>>>

Get a value by key.

async fn set(&self, key: &str, value: Vec<u8>) -> Result<()>

Set a value for a key.

async fn delete(&self, key: &str) -> Result<()>

Delete a key.

async fn exists(&self, key: &str) -> Result<bool>

Check if a key exists.

fn batch_get( &self, keys: &[&str], ) -> impl Future<Output = Result<Vec<Option<Vec<u8>>>>> + Send

Get multiple keys in a batch (SIMD-optimized).

fn batch_set( &self, pairs: Vec<(&str, Vec<u8>)>, ) -> impl Future<Output = Result<()>> + Send

Set multiple key-value pairs in a batch (SIMD-optimized).