Enum libp2p_kad::KademliaBucketInserts

pub enum KademliaBucketInserts {
    OnConnected,
    Manual,
}

The configurable strategies for the insertion of peers and their addresses into the k-buckets of the Kademlia routing table.

Variants

OnConnected

Whenever a connection to a peer is established as a result of a dialing attempt and that peer is not yet in the routing table, it is inserted as long as there is a free slot in the corresponding k-bucket. If the k-bucket is full but still has a free pending slot, it may be inserted into the routing table at a later time if an unresponsive disconnected peer is evicted from the bucket.

Manual

New peers and addresses are only added to the routing table via explicit calls to Kademlia::add_address.

Note: Even though peers can only get into the routing table as a result of Kademlia::add_address, routing table entries are still updated as peers connect and disconnect (i.e. the order of the entries as well as the network addresses).

Trait Implementations

impl Clone for KademliaBucketInserts

fn clone(&self) -> KademliaBucketInserts

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for KademliaBucketInserts

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

Formats the value using the given formatter.

impl PartialEq<KademliaBucketInserts> for KademliaBucketInserts

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

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for KademliaBucketInserts

impl Eq for KademliaBucketInserts

impl StructuralEq for KademliaBucketInserts

impl StructuralPartialEq for KademliaBucketInserts