Struct kademlia_routing_table::AddedNodeDetails

pub struct AddedNodeDetails<T: ContactInfo> {
    pub must_notify: Vec<T>,
    pub unneeded: Vec<T>,
}

This is returned by RoutingTable::add_node if a new node has been added.

Fields

must_notify: Vec<T>

The list of contacts that need to be notified about the new node: If the bucket was already full, that's nobody, but if it wasn't, everyone with a bucket index greater than the new nodes' must be notified.

unneeded: Vec<T>

List of contacts no longer within the close group at the bucket index of the contact added.

Trait Implementations

impl<T: PartialEq + ContactInfo> PartialEq for AddedNodeDetails<T>

fn eq(&self, __arg_0: &AddedNodeDetails<T>) -> bool

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

fn ne(&self, __arg_0: &AddedNodeDetails<T>) -> bool

This method tests for !=.

impl<T: Eq + ContactInfo> Eq for AddedNodeDetails<T>

impl<T: Debug + ContactInfo> Debug for AddedNodeDetails<T>

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

Formats the value using the given formatter.