Struct IndirectPeer 

pub struct IndirectPeer {
    pub node_id: NodeId,
    pub min_hops: u8,
    pub via_peers: BTreeMap<NodeId, u8>,
    pub discovered_at: u64,
    pub last_seen_ms: u64,
    pub messages_received: u32,
    pub callsign: Option<String>,
}

Reachability information for an indirect (multi-hop) peer

Tracks peers that are not directly connected via BLE but are reachable through relay messages via intermediate nodes.

Fields

node_id: NodeId

The indirect peer’s node ID

min_hops: u8

Minimum hop count to reach this peer (1-3)

via_peers: BTreeMap<NodeId, u8>

Direct peers through which we can reach this peer Maps via_peer NodeId → hop count through that peer

discovered_at: u64

When we first learned about this peer (ms since epoch)

last_seen_ms: u64

Last time we received data from/about this peer (ms since epoch)

messages_received: u32

Number of messages relayed from this peer

callsign: Option<String>

Optional callsign if learned from documents

Implementations

impl IndirectPeer

pub fn new( node_id: NodeId, via_peer: NodeId, hop_count: u8, now_ms: u64, ) -> Self

Create a new indirect peer entry

pub fn update_path( &mut self, via_peer: NodeId, hop_count: u8, now_ms: u64, ) -> bool

Update with a new path to this peer

Returns true if this is a better (shorter) path

pub fn degree(&self) -> Option<PeerDegree>

Get the degree classification for this peer

pub fn is_stale(&self, now_ms: u64, timeout_ms: u64) -> bool

Check if this peer is stale (not seen within timeout)

pub fn paths(&self) -> Vec<(NodeId, u8)>

Get all paths to this peer as (via_peer, hop_count) pairs

Trait Implementations

impl Clone for IndirectPeer

fn clone(&self) -> IndirectPeer

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IndirectPeer

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

Formats the value using the given formatter.