pub enum KademliaEvent {
    InboundRequest {
        request: InboundRequest,
    },
    OutboundQueryProgressed {
        id: QueryId,
        result: QueryResult,
        stats: QueryStats,
        step: ProgressStep,
    },
    RoutingUpdated {
        peer: PeerId,
        is_new_peer: bool,
        addresses: Addresses,
        bucket_range: (Distance, Distance),
        old_peer: Option<PeerId>,
    },
    UnroutablePeer {
        peer: PeerId,
    },
    RoutablePeer {
        peer: PeerId,
        address: Multiaddr,
    },
    PendingRoutablePeer {
        peer: PeerId,
        address: Multiaddr,
    },
}
Expand description

The events produced by the Kademlia behaviour.

See NetworkBehaviour::poll.

Variants§

§

InboundRequest

Fields

An inbound request has been received and handled.

§

OutboundQueryProgressed

Fields

§id: QueryId

The ID of the query that finished.

§result: QueryResult

The intermediate result of the query.

§stats: QueryStats

Execution statistics from the query.

§step: ProgressStep

Indicates which event this is, if therer are multiple responses for a single query.

An outbound query has made progress.

§

RoutingUpdated

Fields

§peer: PeerId

The ID of the peer that was added or updated.

§is_new_peer: bool

Whether this is a new peer and was thus just added to the routing table, or whether it is an existing peer who’s addresses changed.

§addresses: Addresses

The full list of known addresses of peer.

§bucket_range: (Distance, Distance)

Returns the minimum inclusive and maximum inclusive distance for the bucket of the peer.

§old_peer: Option<PeerId>

The ID of the peer that was evicted from the routing table to make room for the new peer, if any.

The routing table has been updated with a new peer and / or address, thereby possibly evicting another peer.

§

UnroutablePeer

Fields

§peer: PeerId

A peer has connected for whom no listen address is known.

If the peer is to be added to the routing table, a known listen address for the peer must be provided via Kademlia::add_address.

§

RoutablePeer

Fields

§peer: PeerId
§address: Multiaddr

A connection to a peer has been established for whom a listen address is known but the peer has not been added to the routing table either because KademliaBucketInserts::Manual is configured or because the corresponding bucket is full.

If the peer is to be included in the routing table, it must must be explicitly added via Kademlia::add_address, possibly after removing another peer.

See Kademlia::kbucket for insight into the contents of the k-bucket of peer.

§

PendingRoutablePeer

Fields

§peer: PeerId
§address: Multiaddr

A connection to a peer has been established for whom a listen address is known but the peer is only pending insertion into the routing table if the least-recently disconnected peer is unresponsive, i.e. the peer may not make it into the routing table.

If the peer is to be unconditionally included in the routing table, it should be explicitly added via Kademlia::add_address after removing another peer.

See Kademlia::kbucket for insight into the contents of the k-bucket of peer.

Trait Implementations§

source§

impl Clone for KademliaEvent

source§

fn clone(&self) -> KademliaEvent

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for KademliaEvent

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V