Struct LruPeerDiscoveryCache 

pub struct LruPeerDiscoveryCache { /* private fields */ }

LRU cache for recently discovered peer addresses with tick-based TTL.

Entries are stored in a Vec ordered by last access time — the front (index 0) is the least recently used and the back is the most recently used. When capacity is exceeded, the LRU entry (front) is evicted.

Implementations

impl LruPeerDiscoveryCache

pub fn new(config: DiscoveryCacheConfig) -> Self

Create a new cache with the given configuration.

pub fn put( &mut self, peer_id: &str, addresses: Vec<String>, source: &str, ttl: Option<u64>, )

Insert or update a peer entry.

If the peer already exists its addresses, source, and TTL are updated and the entry is moved to the back (MRU position). If the cache is at capacity, the LRU entry (front) is evicted first.

pub fn get(&mut self, peer_id: &str) -> Option<&CacheEntry>

Retrieve a peer entry, moving it to the MRU position.

Returns None if the peer is not present or has expired (expired entries are removed on access). Increments access_count and updates hit/miss counters.

pub fn remove(&mut self, peer_id: &str) -> bool

Remove a peer entry. Returns true if the entry existed.

pub fn contains(&self, peer_id: &str) -> bool

Check whether a peer is in the cache without updating LRU order or access counters.

pub fn tick_cleanup(&mut self)

Advance the internal tick counter by one and remove all expired entries.

pub fn entry_count(&self) -> usize

Number of entries currently in the cache.

pub fn hit_rate(&self) -> f64

Hit rate as hits / (hits + misses), or 0.0 when no lookups have been performed.

pub fn entries_by_source(&self, source: &str) -> Vec<&CacheEntry>

Return references to all entries that match the given discovery source.

pub fn stats(&self) -> LruDiscoveryCacheStats

Snapshot of current cache statistics.

Trait Implementations

impl Debug for LruPeerDiscoveryCache

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.