Struct EfficientPeerCache 

pub struct EfficientPeerCache { /* private fields */ }

Compact peer presence cache using stable integer indices.

Implementations

impl EfficientPeerCache

pub fn new() -> Self

pub fn add_presence(&mut self, hash: Hash, peer: PublicKey) -> Result<()>

Record that a peer can serve a blob.

Errors

Returns an error after all u16 peer indices have been allocated.

pub fn remove_presence(&mut self, hash: &Hash, peer: &PublicKey) -> bool

pub fn has_peer(&self, hash: &Hash, peer: &PublicKey) -> bool

pub fn peers(&self, hash: &Hash) -> Vec<PublicKey>

pub const fn total_peers(&self) -> usize

Return the total number of unique peers registered across all blobs. For per-blob counts see active_peer_count.

pub fn active_peer_count(&self, hash: &Hash) -> usize

pub fn memory_usage(&self) -> usize

pub fn remove_peer(&mut self, peer: &PublicKey)

Remove a peer from every blob while retaining stable indices for peers that may be observed again later.

pub fn retain_active(&mut self, ttl: Duration) -> usize

Remove peers whose last_seen timestamp exceeds the given TTL.

Fully reclaims each removed peer’s index, so the total number of tracked peers stays bounded.

Returns the number of peers removed.

Trait Implementations

impl Clone for EfficientPeerCache

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for EfficientPeerCache

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

Formats the value using the given formatter.

impl Default for EfficientPeerCache

fn default() -> Self

Returns the “default value” for a type.