Struct MemoryStore 

pub struct MemoryStore {
    pub windows: Mutex<HashMap<String, Vec<(f64, f64)>>>,
    pub bans: Mutex<HashMap<String, f64>>,
    pub fail: AtomicBool,
}

An in-memory backend for the distributed paths: the same operations a Redis runs, keyed the same way, so the engine’s store paths are testable without a backend process.

Fields

windows: Mutex<HashMap<String, Vec<(f64, f64)>>>

bans: Mutex<HashMap<String, f64>>

fail: AtomicBool

When set, every operation fails (the fail-closed/fail-open tests).

Trait Implementations

impl BanStore for MemoryStore

fn set_ban( &self, key: &str, expiry: f64, _ttl_seconds: u64, ) -> Result<(), StoreError>

SET key expiry EX ttl with the expiry as unix seconds (the reference set_key("banned_ips", ip, str(expiry), ttl=duration)).

fn get_ban(&self, key: &str) -> Result<Option<f64>, StoreError>

GET key, parsed to the stored expiry unix seconds.

fn delete_ban(&self, key: &str) -> Result<(), StoreError>

DEL key for a stale ban (the reference _check_redis_exact).

impl Default for MemoryStore

fn default() -> Self

Returns the “default value” for a type.

impl SlidingWindowStore for MemoryStore

fn record_hit( &self, key: &str, now: f64, window: u64, ) -> Result<u64, StoreError>

Record one hit at now into the window key and return the post-eviction ZCARD count. The four reference operations run atomically (one transaction).