Struct BestAvailablePeers 

pub struct BestAvailablePeers {
    pub count: usize,
    pub reliable: usize,
    pub transient_local: usize,
    pub manual_by_topic: usize,
    pub deadline_min: u32,
    pub deadline_max: u32,
    pub lease_min: u32,
    pub lease_max: u32,
}

The discovered peers of one topic, folded down to what QoSProfile::resolve_best_available reads — issue 1973.

A fold rather than a list so a graph walk can feed it one endpoint at a time, with no allocator and no bound on how many endpoints there are.

Fields

count: usize

Peers observed.

reliable: usize

…of which RELIABLE.

transient_local: usize

…of which TRANSIENT_LOCAL.

manual_by_topic: usize

…of which MANUAL_BY_TOPIC.

deadline_min: u32

Smallest finite deadline seen, ms; 0 when none was finite.

deadline_max: u32

Largest finite deadline seen, ms; 0 when none was finite.

lease_min: u32

Smallest finite liveliness lease seen, ms; 0 when none was finite.

lease_max: u32

Largest finite liveliness lease seen, ms; 0 when none was finite.

Implementations

impl BestAvailablePeers

pub const NONE: Self

No peers — what a backend with no graph reports.

pub fn observe(&mut self, peer: &QoSProfile)

Fold one discovered endpoint’s profile in.

0, DURATION_INFINITE_MS and the best-available sentinel all read as “no finite window” — upstream’s RMW_QOS_DEADLINE_DEFAULT comparison, widened to our two spellings of infinite.

Trait Implementations

impl Clone for BestAvailablePeers

fn clone(&self) -> BestAvailablePeers

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BestAvailablePeers

impl Debug for BestAvailablePeers

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

Formats the value using the given formatter.

impl Default for BestAvailablePeers

fn default() -> BestAvailablePeers

Returns the “default value” for a type.

impl Eq for BestAvailablePeers

impl PartialEq for BestAvailablePeers

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BestAvailablePeers