Struct MemoryContentStore 

pub struct MemoryContentStore { /* private fields */ }

In-memory content store backed by a HashMap.

Suitable for the PoC and testing. Not persisted across runs. Uses RwLock for interior mutability so that the ContentStore trait methods (which take &self) can mutate the internal map safely across threads.

Concurrency

Read operations (get, contains) acquire a read lock. Write operations (put) acquire a write lock. Multiple concurrent readers are allowed; writers are exclusive.

Example

use bcp_encoder::MemoryContentStore;
use bcp_types::ContentStore;

let store = MemoryContentStore::new();
let data = b"fn main() {}";
let hash = store.put(data);
assert_eq!(store.get(&hash).unwrap(), data);
assert!(store.contains(&hash));
assert_eq!(store.len(), 1);

Implementations

impl MemoryContentStore

pub fn new() -> Self

Create an empty in-memory content store.

pub fn len(&self) -> usize

Return the number of unique entries in the store.

pub fn is_empty(&self) -> bool

Return true if the store contains no entries.

pub fn total_bytes(&self) -> usize

Return the total bytes stored across all entries.

This counts only the content bytes, not the 32-byte hash keys or HashMap overhead.

Trait Implementations

impl ContentStore for MemoryContentStore

fn get(&self, hash: &[u8; 32]) -> Option<Vec<u8>>

Retrieve content by its BLAKE3 hash.

fn put(&self, content: &[u8]) -> [u8; 32]

Store content and return its BLAKE3 hash.

fn contains(&self, hash: &[u8; 32]) -> bool

Check whether a hash exists in the store without retrieving the content.

impl Default for MemoryContentStore

fn default() -> Self

Returns the “default value” for a type.