Struct AddressBook 

pub struct AddressBook<A: Address> { /* private fields */ }

A bounded, deduplicated collection of addresses for a peer.

Backed by an LRU cache: all operations (insert, lookup, promote, evict) are O(1). Most recently seen addresses are promoted automatically. When capacity is exceeded, the least recently seen entry is evicted.

Implementations

impl<A: Address> AddressBook<A>

pub fn new(first_addr: A, max_size: usize) -> AddressBook<A>

pub fn seen(&mut self, addr: A) -> bool

Record that we’ve seen this address. Returns true if it was newly added. If already present, promotes it to most recent. If at capacity, evicts the least recently seen entry.

pub fn get(&self, index: usize) -> Option<&A>

pub fn first(&self) -> &A

Returns the most recently seen address.

pub fn iter(&self) -> impl Iterator<Item = &A>

Iterates from most recently seen to least recently seen.

pub fn len(&self) -> usize

pub fn max_size(&self) -> usize

pub fn into_vec(self) -> Vec<A>

Consumes the page and returns addresses in MRU-first order.

pub fn contains(&self, addr: &A) -> bool

pub fn remove(&mut self, addr: &A) -> bool

pub fn is_empty(&self) -> bool

pub fn concat(&mut self, other: &AddressBook<A>) -> usize

Merge addresses from another page into this one. New addresses go in as least recent. Returns number added.

Trait Implementations

impl<A: Address> Clone for AddressBook<A>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Address + Debug> Debug for AddressBook<A>

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

Formats the value using the given formatter.

impl<A: Address> Display for AddressBook<A>

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

Formats the value using the given formatter.

impl<A: Address> Hash for AddressBook<A>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<A: Address> PartialEq for AddressBook<A>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A: Address> Eq for AddressBook<A>