Struct PeerRepeaterTable 

pub struct PeerRepeaterTable { /* private fields */ }

The repeaters whose identities this node has seen.

RAM-only: a listing describes a neighborhood as it is now, and a table restored from flash would name repeaters that may have moved or gone.

Implementations

impl PeerRepeaterTable

pub fn new() -> Self

pub fn is_repeater(identity: &NodeIdentityPayload) -> bool

Whether an identity describes a repeater, and so belongs here.

The capability is the claim that matters — a node may forward while presenting itself as something else — but a node whose whole role is repeating counts even if it advertises no capability bitmap.

pub fn observe_identity( &mut self, from: &PublicKey, identity: &NodeIdentityPayload, now_ms: u64, ) -> bool

Record what an identity said, if it came from a repeater.

Returns whether the table changed. A repeat identity replaces the record rather than merging with it: the newest advertisement is the node’s own account of itself.

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn generation(&self) -> u16

The value a paging cursor carries, so a follow-up request that resumes into a changed list is recognized as stale.

Trait Implementations

impl Clone for PeerRepeaterTable

fn clone(&self) -> PeerRepeaterTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PeerRepeaterTable

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

Formats the value using the given formatter.

impl Default for PeerRepeaterTable

fn default() -> PeerRepeaterTable

Returns the “default value” for a type.