Struct MemStore 

pub struct MemStore { /* private fields */ }

In-memory store for testing and simple use cases

Implementations

impl MemStore

pub fn new() -> Self

Create a new empty in-memory store

Trait Implementations

impl Debug for MemStore

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

Formats the value using the given formatter.

impl Default for MemStore

fn default() -> MemStore

Returns the “default value” for a type.

impl ManifestStore for MemStore

type Error = MemStoreError

Error type for manifest operations.

fn get_root(&self, name: &[u8]) -> Result<Option<RootManifest>, Self::Error>

Load a named root manifest.

fn put_root( &self, name: &[u8], manifest: &RootManifest, ) -> Result<(), Self::Error>

Unconditionally insert or replace a named root manifest.

fn delete_root(&self, name: &[u8]) -> Result<(), Self::Error>

Delete a named root manifest. Deleting a missing name is not an error.

fn compare_and_swap_root( &self, name: &[u8], expected: Option<&RootManifest>, new: Option<&RootManifest>, ) -> Result<ManifestUpdate, Self::Error>

Atomically update a named root if the current manifest matches expected.

impl ManifestStoreScan for MemStore

fn list_roots(&self) -> Result<Vec<NamedRootManifest>, Self::Error>

List all durable named root manifests.

impl NodeStoreScan for MemStore

type Error = MemStoreError

Error type for scan operations.

fn list_node_cids(&self) -> Result<Vec<Cid>, Self::Error>

List all content-addressed node CIDs currently known to the store.

impl Store for MemStore

fn batch_get( &self, keys: &[&[u8]], ) -> Result<HashMap<Vec<u8>, Vec<u8>>, Self::Error>

Optimized batch_get for MemStore - acquires lock once for all reads

fn batch_get_ordered( &self, keys: &[&[u8]], ) -> Result<Vec<Option<Vec<u8>>>, Self::Error>

Optimized batch_get_ordered for MemStore - acquires lock once for all reads

fn batch_put(&self, entries: &[(&[u8], &[u8])]) -> Result<(), Self::Error>

Optimized batch_put for MemStore - acquires lock once for all writes

type Error = MemStoreError

Error type for storage operations

fn get(&self, key: &[u8]) -> Result<Option<Vec<u8>>, Self::Error>

Get value by key

fn put(&self, key: &[u8], value: &[u8]) -> Result<(), Self::Error>

Store key-value pair

fn delete(&self, key: &[u8]) -> Result<(), Self::Error>

Delete key

fn batch(&self, ops: &[BatchOp<'_>]) -> Result<(), Self::Error>

Batch write operations (atomic if supported by backend)

fn batch_get_ordered_unique( &self, keys: &[&[u8]], ) -> Result<Vec<Option<Vec<u8>>>, Self::Error>

Retrieve unique keys in input order.

fn prefers_batch_reads(&self) -> bool

Whether this store has an efficient batched-read implementation.

fn supports_hints(&self) -> bool

Whether this store persists performance hints.

fn get_hint( &self, namespace: &[u8], key: &[u8], ) -> Result<Option<Vec<u8>>, Self::Error>

Retrieve an optional performance hint for a logical namespace and key.

fn put_hint( &self, namespace: &[u8], key: &[u8], value: &[u8], ) -> Result<(), Self::Error>

Persist an optional performance hint for a logical namespace and key.

fn batch_put_with_hint( &self, entries: &[(&[u8], &[u8])], namespace: &[u8], key: &[u8], value: &[u8], ) -> Result<(), Self::Error>

Store content-addressed nodes and one hint atomically when supported.

impl TransactionalStore for MemStore

fn supports_transactions(&self) -> bool

Whether this backend can atomically commit staged nodes and roots.

fn commit_transaction( &self, node_writes: &[TransactionNodeWrite], root_conditions: &[RootCondition], root_writes: &[RootWrite], ) -> Result<TransactionUpdate, Error>

Atomically validate root conditions, write nodes, and apply root writes.