Struct PeerTable 

pub struct PeerTable { /* private fields */ }

A table of known peers and their reachable transport addresses.

The peer table is the central data structure for routing decisions. It maps agent UUIDs to their identity and one or more transport addresses through which they can be reached.

Implementations

impl PeerTable

pub fn new() -> Self

Create an empty peer table.

pub fn upsert( &mut self, identity: AgentIdentity, addresses: Vec<TransportAddress>, )

Add or update a peer in the table.

pub fn remove(&mut self, id: &Uuid) -> Option<AgentIdentity>

Remove a peer from the table.

pub fn get(&self, id: &Uuid) -> Option<&AgentIdentity>

Look up a peer’s identity.

pub fn addresses(&self, id: &Uuid) -> Option<&[TransportAddress]>

Get all transport addresses for a peer.

pub fn all_peers(&self) -> impl Iterator<Item = &AgentIdentity>

Get all known peers.

pub fn all_peer_ids(&self) -> impl Iterator<Item = &Uuid>

Get all known peer IDs.

pub fn len(&self) -> usize

Number of known peers.

pub fn is_empty(&self) -> bool

Whether the table is empty.

pub fn subscribe(&mut self, peer_id: Uuid, topic: impl Into<String>)

Subscribe a peer to a topic.

pub fn unsubscribe(&mut self, peer_id: &Uuid, topic: &str)

Unsubscribe a peer from a topic.

pub fn subscribers(&self, topic: &str) -> Vec<Uuid>

Get all peers subscribed to a topic.

Trait Implementations

impl Debug for PeerTable

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

Formats the value using the given formatter.

impl Default for PeerTable

fn default() -> PeerTable

Returns the “default value” for a type.