Struct InMemoryStore

pub struct InMemoryStore {
    data: RwLock<BTreeMap<(u64, u32, i64), TemporalPoint>>,
}

Non-persistent in-memory storage using a sorted BTreeMap.

Thread-safe: multiple readers or one writer via [RwLock]. All data is lost when the process exits.

Fields

data: RwLock<BTreeMap<(u64, u32, i64), TemporalPoint>>

Implementations

impl InMemoryStore

pub fn new() -> Self

Create a new empty in-memory store.

pub fn len(&self) -> usize

Number of points currently stored.

pub fn is_empty(&self) -> bool

Whether the store is empty.

Trait Implementations

impl Default for InMemoryStore

fn default() -> Self

Returns the “default value” for a type.

impl StorageBackend for InMemoryStore

fn get( &self, entity_id: u64, space_id: u32, timestamp: i64, ) -> Result<Option<TemporalPoint>, StorageError>

Retrieve a single point by entity, space, and timestamp.

fn put(&self, space_id: u32, point: &TemporalPoint) -> Result<(), StorageError>

Store a temporal point.

fn range( &self, entity_id: u64, space_id: u32, start: i64, end: i64, ) -> Result<Vec<TemporalPoint>, StorageError>

Retrieve all points for an entity in a time range, ordered by timestamp.

fn delete( &self, entity_id: u64, space_id: u32, timestamp: i64, ) -> Result<(), StorageError>

Delete a specific point.