Struct MemoryStore 

pub struct MemoryStore { /* private fields */ }

A fast in-memory first-in first-out queue.

Records live only for the lifetime of the process, which suits tests, the simulators, and the upper tier of a layered store. An optional capacity caps the number of buffered records and turns a full queue into an explicit backpressure signal rather than letting memory grow without bound.

Examples

use pamoja_core::Store;
use pamoja_sync::MemoryStore;

let mut store = MemoryStore::new();
store.append(b"first").await?;
store.append(b"second").await?;
assert_eq!(store.len().await?, 2);
assert_eq!(store.pop().await?, Some(b"first".to_vec()));

Implementations

impl MemoryStore

pub fn new() -> Self

Creates an unbounded in-memory store.

Returns

An empty store that grows to hold as many records as memory allows.

pub fn with_capacity(capacity: usize) -> Self

Creates a store that buffers at most capacity records.

Arguments

• capacity - the maximum number of records to buffer; once reached, append reports backpressure instead of growing.

Returns

An empty capacity-bounded store.

Trait Implementations

impl Clone for MemoryStore

fn clone(&self) -> MemoryStore

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MemoryStore

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

Formats the value using the given formatter.

impl Default for MemoryStore

fn default() -> MemoryStore

Returns the “default value” for a type.

impl Store for MemoryStore

async fn append(&mut self, record: &[u8]) -> Result<()>

Appends a record to the back of the queue.

async fn peek(&self) -> Result<Option<Vec<u8>>>

Returns the oldest record without removing it.

async fn pop(&mut self) -> Result<Option<Vec<u8>>>

Removes and returns the oldest record in the queue.

async fn len(&self) -> Result<usize>

Returns the number of records currently buffered.

async fn is_empty(&self) -> Result<bool, Error>

Returns whether the queue currently holds no records.