Struct Memory 

pub struct Memory { /* private fields */ }

The memory façade over the store.

Implementations

impl Memory

pub fn new(max_value_bytes: usize, list_default_limit: usize) -> Memory

pub fn check_key(key: &str) -> Result<(), String>

Validate a key: non-empty, no whitespace, not reserved, bounded.

pub fn set( &mut self, d: &Durable, key: &str, value: Value, ttl_ms: Option<u64>, by: Option<&str>, ) -> Result<Value, String>

memory.set {key, value, ttl?} → the record’s meta.

pub fn push( &mut self, d: &Durable, key: &str, value: Value, by: Option<&str>, ) -> Result<Value, String>

memory.push {key, value} — append to the ARRAY at key, creating it. The durable queue primitive: producers push, a consumer shifts, and the list survives restarts. Read-modify-write is atomic here because the reactor is the single writer.

pub fn shift( &mut self, d: &Durable, key: &str, by: Option<&str>, ) -> Result<Value, String>

memory.shift {key} — remove and return the FIRST element ({found: false} on empty or absent — never an error, so a drain loop can just stop).

pub fn pop( &mut self, d: &Durable, key: &str, by: Option<&str>, ) -> Result<Value, String>

memory.pop {key} — remove and return the LAST element.

pub fn get(&mut self, d: &Durable, key: &str) -> Result<Value, String>

memory.get {key} → {value?, meta?, found} (expired ⇒ not found).

pub fn delete(&mut self, d: &Durable, key: &str) -> Result<Value, String>

memory.delete {key}.

pub fn list( &mut self, d: &Durable, prefix: Option<&str>, limit: Option<usize>, ) -> Result<Value, String>

memory.list {prefix?, limit?} → {keys: [{key, ts?}], truncated}.