Skip to main content

KademliaDiscovery

Struct KademliaDiscovery 

Source
pub struct KademliaDiscovery {
    table: Arc<RoutingTable>,
    lookup_service: Arc<LookupService>,
    refresh_service: Arc<RefreshService>,
    peer_queue: Arc<AsyncQueue<DiscoveredPeer>>,
    task_group: TaskGroup,
    config: Arc<Config>,
    bloom: BloomRef,
}

Fields§

§table: Arc<RoutingTable>

Routing table

§lookup_service: Arc<LookupService>

Lookup Service

§refresh_service: Arc<RefreshService>

Refresh Service

§peer_queue: Arc<AsyncQueue<DiscoveredPeer>>

Discovered peers queued for the Node to dial. Producers (connect_loop, manual peer_endpoints) push; the Node’s connect_discovered_peers task drains via recv().

§task_group: TaskGroup

Managing spawned tasks.

§config: Arc<Config>

Holds the configuration for the P2P network.

§bloom: BloomRef

Shared local bloom. Snapshotted on every connect-loop iteration to filter routing-table entries (and stamped on outgoing PeerMsgs via the lookup service).

Implementations§

Source§

impl KademliaDiscovery

Source

pub fn new( key_pair: &KeyPair, peer_id: &PeerID, config: Arc<Config>, monitor: Arc<Monitor>, bloom: BloomRef, ex: Executor, ) -> Arc<Self>

Creates a new KademliaDiscovery

Source

async fn connect_loop(self: Arc<Self>) -> Result<()>

This method will attempt to find a peer in the routing table and send it as a DiscoveredPeer for the Node to connect to. If the routing table is empty, it will start the seeding process.

Source

async fn start_seeding(&self)

Starts seeding process.

This method randomly selects a peer from the routing table and attempts to connect to that peer for the initial lookup. If the routing table doesn’t have an available entry, it will connect to one of the provided bootstrap endpoints in the Config and initiate the lookup.

Trait Implementations§

Source§

impl Discovery for KademliaDiscovery

Source§

fn start<'async_trait>( self: Arc<Self>, ) -> Pin<Box<dyn Future<Output = Result<()>> + Send + 'async_trait>>
where Self: 'async_trait,

Start the discovery service. Listen endpoints, if needed by the implementation, must be provided at construction time.
Source§

fn shutdown<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = ()> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Shutdown the discovery service.
Source§

fn recv<'life0, 'async_trait>( &'life0 self, ) -> Pin<Box<dyn Future<Output = DiscoveredPeer> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait,

Await the next discovered peer. The Node calls this in a loop; on shutdown the surrounding task is cancelled.
Source§

fn on_event(&self, event: PeerConnectionEvent)

Receive a peer connection event from the Node.
Source§

fn find_peers_with(&self, item: &[u8]) -> Vec<DiscoveredPeer>

Return peers in the routing table whose advertised bloom may contain item. Used by application layers (e.g. Swarm) to find candidates for protocol- or swarm-targeted dials. Implementations without a routing table may return an empty vector.

Auto Trait Implementations§

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

§

fn implicit( self, class: Class, constructed: bool, tag: u32, ) -> TaggedParser<'a, Implicit, Self, E>

Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where 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.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where 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 for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

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 T
where U: TryFrom<T>,

Source§

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 T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more