Struct InMemoryRateLimitStore 

pub struct InMemoryRateLimitStore { /* private fields */ }

In-memory rate limit store.

Uses bounded HashMaps protected by Mutexes for thread-safe access. Each algorithm retains at most max_keys distinct keys. When a map is full, stale entries are reclaimed no more than once per second; if a map remains full, unseen keys fail closed instead of evicting live buckets. Suitable for single-process deployments. For distributed systems, implement a custom store using Redis or similar.

Implementations

impl InMemoryRateLimitStore

pub fn new() -> Self

Create a new in-memory store with DEFAULT_RATE_LIMIT_MAX_KEYS per algorithm.

pub fn with_max_keys(max_keys: usize) -> Self

Create an in-memory store with an explicit per-algorithm key bound.

A bound of zero fails closed for every keyed request.

pub fn check( &self, key: &str, algorithm: RateLimitAlgorithm, max_requests: u64, window: Duration, ) -> RateLimitResult

Check and consume a request against the rate limit.

Trait Implementations

impl Default for InMemoryRateLimitStore

fn default() -> Self

Returns the “default value” for a type.