Struct dittolive_ditto::transport::PresenceGraph

#[non_exhaustive]
pub struct PresenceGraph {
    pub local_peer: Peer,
    pub remote_peers: Vec<Peer>,
}

Graph of all known peers generated by Presence methods.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

local_peer: Peer

The local peer.

remote_peers: Vec<Peer>

Note that the peers in this set might not be directly connected to the local peer. Some peers might be be connected indirectly via a another peer or even form part of an isolated graph.

Others yet might be discovered but disconnected due to version incompatibilities.

Trait Implementations

impl Clone for PresenceGraph

fn clone(&self) -> PresenceGraph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PresenceGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PresenceGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for PresenceGraph

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for PresenceGraph