Struct PeerCandidates 

pub struct PeerCandidates { /* private fields */ }

A peer’s aggregated, family-tagged, de-duplicated candidate addresses.

Addresses are kept in insertion (discovery) order within each family so the caller’s source ordering is preserved; a duplicate address keeps the FIRST source it was seen from.

Implementations

impl PeerCandidates

pub fn new() -> PeerCandidates

An empty candidate set.

pub fn add(&mut self, addr: SocketAddr, source: CandidateSource) -> bool

Add one discovered address (family derived, deduplicated). Returns true if it was new.

pub fn extend<I>(&mut self, addrs: I, source: CandidateSource)

where I: IntoIterator<Item = SocketAddr>,

Add many addresses from one discovery source (dedup applies).

pub fn families(&self) -> BTreeSet<Family>

The families this peer offers at least one candidate on.

pub fn of_family(&self, family: Family) -> impl Iterator<Item = SocketAddr> + '_

The candidate addresses of family, in discovery order.

pub fn all(&self) -> &[Candidate]

Every candidate, in discovery order (family-tagged).

pub fn is_empty(&self) -> bool

Whether this peer has no candidates at all.

Trait Implementations

impl Clone for PeerCandidates

fn clone(&self) -> PeerCandidates

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PeerCandidates

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

Formats the value using the given formatter.

impl Default for PeerCandidates

fn default() -> PeerCandidates

Returns the “default value” for a type.

impl Eq for PeerCandidates

impl PartialEq for PeerCandidates

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PeerCandidates