Struct backroll_transport::Peers

pub struct Peers<T>(_)
 where
    T: Eq + Hash;

A keyed mapping of Peers with ownership semantics.

Dropping will disconnect all owned peers.

Implementations

impl<T: Eq + Hash> Peers<T>

pub fn get(&self, id: &T) -> Option<Peer>

Gets a Peer by it’s ID, if available.

pub fn len(&self) -> usize

Gets the number of active connections managed by it.

pub fn contains(&self, id: &T) -> bool

Checks if the store has a connection to the given ID.

pub fn create_unbounded(&self, id: T) -> Peer

Creates a new unbounded peer pair and stores one end, mapping it to the provided ID, returning the other end.

If a peer was previous stored at the given ID, it will be replaced and disconnected.

pub fn create_bounded(&self, id: T, capacity: usize) -> Peer

Creates an bounded peer pair and stores one end, mapping it to the provided ID, returning the other end.

If a peer was previous stored at the given ID, it will be dropped and replaced.

pub fn disconnect(&self, id: &T)

Disconnects and removes a connection by it’s ID

A no-op if there no Peer with the given ID.

pub fn flush_disconnected(&self)

Removes all peers that are disconnected.

Trait Implementations

impl<T: Debug> Debug for Peers<T> where
    T: Eq + Hash, 

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

Formats the value using the given formatter.

impl<T: Eq + Hash> Default for Peers<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Eq + Hash> Drop for Peers<T>

fn drop(&mut self)

Executes the destructor for this type.