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 peer_count(&self) -> usize

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.

Trait Implementations

impl Clone for EfficientPeerCache

fn clone(&self) -> EfficientPeerCache

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() -> EfficientPeerCache

Returns the “default value” for a type.