Struct TtlMap 

pub struct TtlMap<K, V>
where
    K: Eq + Hash,
{ /* private fields */ }

A HashMap whose entries expire after ttl.

Implementations

impl<K, V> TtlMap<K, V>

where K: Eq + Hash + Clone,

pub fn new(ttl: Duration) -> Self

Creates a new map with the given TTL.

A ttl of zero disables expiry entirely — entries stay until explicitly removed.

pub fn with_on_expire<F>(self, cb: F) -> Self

where F: Fn(&K, V) + Send + Sync + 'static,

Sets a callback invoked whenever an entry is removed due to TTL expiry.

The registry uses this to reject pending request promises with a timeout error.

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

Inserts a value, returning the previous entry if any.

pub fn remove(&self, key: &K) -> Option<V>

Removes and returns the value for key, bypassing expiry.

pub fn contains_key(&self, key: &K) -> bool

Returns whether key is present and unexpired.

Triggers on_expire as a side effect if the entry is stale.

pub fn get_cloned(&self, key: &K) -> Option<V>

where V: Clone,

Returns a clone of the value for key if present and unexpired.

pub fn len(&self) -> usize

Returns the current size of the map (including any stale entries that have not yet been touched).

pub fn is_empty(&self) -> bool

pub fn clear(&self)

Drops all entries without firing on_expire.

pub fn sweep_expired(&self)

Removes every entry that has exceeded the TTL, firing on_expire for each. Callers may invoke this periodically to bound memory in long-running processes.

pub fn snapshot_keys_where<F>(&self, pred: F) -> Vec<K>

where F: Fn(&V) -> bool,

Returns every key whose (unexpired) value satisfies pred.

The registry uses this during channel-close cleanup to find all pending replies and routes associated with the dead channel.