Struct InMemoryEntryStore 

pub struct InMemoryEntryStore { /* private fields */ }

In-memory EntryStore implementation backed by a HashMap.

Partitioned entries are stored in-memory using tokio::sync::Mutex. Not suitable for production persistence — data is lost on drop.

Implementations

impl InMemoryEntryStore

pub fn new() -> Self

Create a new, empty InMemoryEntryStore.

Trait Implementations

impl Default for InMemoryEntryStore

fn default() -> Self

Returns the “default value” for a type.

impl EntryStore for InMemoryEntryStore

fn append<'life0, 'async_trait>( &'life0 self, entry: Entry, ) -> Pin<Box<dyn Future<Output = Result<(), StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Append a new entry to the partition.

fn query<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, partition: &'life1 str, range: &'life2 TimeRange, opts: &'life3 QueryOptions, ) -> Pin<Box<dyn Future<Output = Result<Vec<Entry>, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Query entries within a time range, sorted and limited.

fn evict<'life0, 'life1, 'async_trait>( &'life0 self, partition: &'life1 str, keep: usize, ) -> Pin<Box<dyn Future<Output = Result<usize, StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Evict oldest entries, keeping only keep most recent. Returns the number of entries evicted.

fn delete<'life0, 'life1, 'async_trait>( &'life0 self, id: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<(), StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Delete a single entry by ID.

fn clear_partition<'life0, 'life1, 'async_trait>( &'life0 self, partition: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<(), StoreError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Remove all entries in a partition.