Struct PeerDiscoveryCache 

pub struct PeerDiscoveryCache {
    pub records: HashMap<String, PeerRecord>,
    pub max_size: usize,
    pub ttl_secs: u64,
}

Cache for peer discovery results with TTL and capacity management.

Fields

records: HashMap<String, PeerRecord>

Peer records keyed by peer_id

max_size: usize

Maximum number of records to retain

ttl_secs: u64

Time-to-live in seconds; records older than this are stale

Implementations

impl PeerDiscoveryCache

pub fn new(max_size: usize, ttl_secs: u64) -> Self

Create a new empty cache.

pub fn upsert(&mut self, record: PeerRecord)

Insert or update a peer record.

If the peer already exists, addresses are merged (deduped), last_seen_secs is updated if the incoming record is newer, and source is updated.

If the cache is at capacity and the peer is new, the peer with the lowest reliability_score is evicted (ties broken by oldest last_seen_secs).

pub fn record_success(&mut self, peer_id: &str, now_secs: u64) -> bool

Record a successful connection to a peer.

Increments successful_connections and updates last_seen_secs. Returns false if the peer is not in the cache.

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

Record a failed connection attempt to a peer.

Increments failed_connections. Returns false if the peer is not in the cache.

pub fn evict_stale(&mut self, now_secs: u64)

Remove all records where last_seen_secs + ttl_secs < now_secs.

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

Look up a peer record by peer_id.

pub fn peers_by_reliability(&self) -> Vec<&PeerRecord>

Return all peer records sorted by reliability score descending.

pub fn peers_from_source(&self, source: DiscoverySource) -> Vec<&PeerRecord>

Return all peers discovered from a specific source, sorted by last_seen_secs descending.

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

Remove a peer from the cache.

Returns true if the peer was present and removed, false otherwise.

pub fn stats(&self) -> DiscoveryCacheStats

Compute and return aggregate cache statistics.