Struct CompressedKvStore 

pub struct CompressedKvStore<S: KvStore> { /* private fields */ }

Compressed KV store wrapper

Wraps any KvStore implementation and transparently compresses/decompresses values.

Example

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

let inner = MemoryKvStore::new();
let store = CompressedKvStore::new(inner, Compression::Lz4);

// Values are transparently compressed
store.set("key", vec![0u8; 10000]).await?;
let value = store.get("key").await?;

Implementations

impl<S: KvStore> CompressedKvStore<S>

pub const fn new(inner: S, compression: Compression) -> Self

Create a new compressed KV store wrapping the given store

pub const fn inner(&self) -> &S

Get reference to inner store (for inspection/testing)

pub const fn compression(&self) -> Compression

Get compression algorithm

Trait Implementations

impl<S: Debug + KvStore> Debug for CompressedKvStore<S>

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

Formats the value using the given formatter.

impl<S: KvStore> KvStore for CompressedKvStore<S>

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).