Struct poldercast::Node

pub struct Node { /* fields omitted */ }

The data associated to a Node.

This can be gossiped through the topology in order to update the topology of new nodes or better neighbors.

Methods

impl Node

pub fn new<R: RngCore>(rng: &mut R) -> Self

create a new unreachable Node with the given Address.

pub fn new_with(address: Address) -> Self

create a new Node with the given Address.

pub fn id(&self) -> &Id

access the unique identifier of the Node.

pub fn address(&self) -> &Option<Address>

get the Node's address (mean to contact it)

pub fn subscriptions(&self) -> impl Iterator<Item = (&Topic, &InterestLevel)>

these are the Topic and the InterestLevel associated.

pub fn subscribers(&self) -> impl Iterator<Item = &Id>

the nodes that are related to this Node

pub fn add_subscription(
    &mut self,
    subscription: Subscription
) -> Option<InterestLevel>

add a subscription

pub fn remove_subscription(&mut self, topic: Topic) -> Option<InterestLevel>

remove a subscriptions

pub fn common_subscriptions<'a>(
    &'a self,
    other: &'a Self
) -> impl Iterator<Item = &'a Topic>

list all common subscriptions between the two nodes

pub fn common_subscribers<'a>(
    &'a self,
    other: &'a Self
) -> impl Iterator<Item = &'a Id>

list all common subscribers between the two nodes

pub fn proximity(&self, other: &Self) -> Proximity

compute the relative proximity between these 2 nodes.

This is based on the subscription. The more 2 nodes have subscription in common the closer they are.

Trait Implementations

impl Eq for Node

impl Clone for Node

fn clone(&self) -> Node

Returns a copy of the value.

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

Performs copy-assignment from source.

impl PartialEq<Node> for Node

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

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

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

This method tests for !=.

impl Debug for Node

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

Formats the value using the given formatter.