Struct RoutingTable

pub struct RoutingTable { /* private fields */ }

Simplified Kademlia routing table

Implementations

impl RoutingTable

pub fn new(id: Id) -> Self

Create a new RoutingTable with a given id.

pub fn id(&self) -> &Id

Returns the Id of this node, where the distance is measured from.

pub fn add(&mut self, node: Node) -> bool

Attempts to add a node to this routing table, and return true if it did.

pub fn remove(&mut self, node_id: &Id)

Remove a node from this routing table.

pub fn closest(&self, target: Id) -> Box<[Node]>

Return the closest nodes to the target while prioritizing secure nodes, as defined in BEP_0042

pub fn closest_secure( &self, target: Id, dht_size_estimate: usize, subnets: usize, ) -> Vec<Node>

Secure version of Self::closest that tries to circumvent sybil attacks.

pub fn is_empty(&self) -> bool

Returns true if this routing table is empty.

pub fn size(&self) -> usize

Return the number of nodes in this routing table.

pub fn nodes(&self) -> RoutingTableIterator<'_>

Returns an iterator over the nodes in this routing table.

pub fn to_owned_nodes(&self) -> Vec<Node>

Export an owned vector of nodes from this routing table.

pub fn to_bootstrap(&self) -> Vec<String>

Turn this routing table to a list of bootstrapping nodes.

Trait Implementations

impl Clone for RoutingTable

fn clone(&self) -> RoutingTable

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for RoutingTable

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

Formats the value using the given formatter.