Struct ClosestNodes 

pub struct ClosestNodes { /* private fields */ }

Manage closest nodes found in a query.

Useful to estimate the Dht size.

Implementations

impl ClosestNodes

pub fn new(target: Id) -> Self

Create a new instance of ClosestNodes.

pub fn target(&self) -> Id

Returns the target of the query for these closest nodes.

pub fn nodes(&self) -> &[Node]

Returns a slice of the nodes array.

pub fn len(&self) -> usize

Returns the number of nodes.

pub fn is_empty(&self) -> bool

Returns true if there are no nodes.

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

Add a node.

pub fn take_until_secure( &self, previous_dht_size_estimate: usize, average_subnets: usize, ) -> &[Node]

Take enough nodes closest to the target, until the following are satisfied:

1. At least the closest k nodes (20).
2. The last node should be at a distance edk which is the expected distance of the 20th node given previous estimations of the DHT size.
3. The number of subnets with unique 6 bits prefix in nodes ipv4 addresses match or exceeds the average from previous queries.

If one or more of these conditions are not met, then we just take all responding nodes and store data at them.

pub fn subnets_count(&self) -> u8

Count the number of subnets with unique 6 bits prefix in ipv4

pub fn dht_size_estimate(&self) -> f64

An estimation of the Dht from the distribution of closest nodes responding to a query.

Trait Implementations

impl Clone for ClosestNodes

fn clone(&self) -> ClosestNodes

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ClosestNodes

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

Formats the value using the given formatter.