Struct kademlia_routing_table::AddedNodeDetails
[−]
[src]
pub struct AddedNodeDetails<T, U> where U: Eq + Hash { pub must_notify: Vec<NodeInfo<T, U>>, pub common_groups: bool, }
This is returned by RoutingTable::add_node
if a new node has been added.
Fields
must_notify: Vec<NodeInfo<T, U>>
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.
common_groups: bool
Whether we are together in any close group with that contact.
Trait Implementations
impl<T: Debug, U: Debug> Debug for AddedNodeDetails<T, U> where U: Eq + Hash
[src]
impl<T: Clone, U: Clone> Clone for AddedNodeDetails<T, U> where U: Eq + Hash
[src]
fn clone(&self) -> AddedNodeDetails<T, U>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more
impl<T: Eq, U: Eq> Eq for AddedNodeDetails<T, U> where U: Eq + Hash
[src]
impl<T: PartialEq, U: PartialEq> PartialEq for AddedNodeDetails<T, U> where U: Eq + Hash
[src]
fn eq(&self, __arg_0: &AddedNodeDetails<T, U>) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &AddedNodeDetails<T, U>) -> bool
This method tests for !=
.