Struct BoundedMap 

pub struct BoundedMap<K, V> { /* private fields */ }

Capacity-bounded, optionally TTL-swept map for caches and rate-limit tables. Eviction order is oldest-insert (approximate LRU: a re-insert of an existing key moves it to newest; get refreshes the idle timestamp but does not reorder). insert returns any (key, value) evicted for capacity so the caller can persist-before-drop. capacity == 0 disables the cache, mirroring Ring.

Implementations

impl<K: Eq + Hash + Clone, V> BoundedMap<K, V>

pub fn new(capacity: usize, idle_ttl_secs: u64, gauge: SizeGauge) -> Self

pub fn insert(&mut self, key: K, value: V, now_secs: u64) -> Option<(K, V)>

pub fn get(&mut self, key: &K, now_secs: u64) -> Option<&V>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn capacity(&self) -> usize