libp2p/protocols/kademlia/find

Search:
Group by:
Source   Edit  

Procs

proc findClosestPeers(kad: KadDHT; target: Key): seq[Peer] {....raises: [],
    tags: [RootEffect], forbids: [].}
Source   Edit  
proc findNode(kad: KadDHT; targetId: Key): InternalRaisesFuture[seq[PeerId],
    (CancelledError,)] {....stackTrace: false, raises: [], gcsafe,
                         tags: [RootEffect], forbids: [].}
Iteratively search for the k closest peers to a target ID. Source   Edit  
proc findPeer(kad: KadDHT; peer: PeerId): InternalRaisesFuture[
    Result[PeerInfo, string], (CancelledError,)] {....stackTrace: false,
    raises: [], gcsafe, tags: [RootEffect], forbids: [].}
Walks the key space until it finds candidate addresses for a peer Id Source   Edit  
proc handleFindNode(kad: KadDHT; conn: Connection; msg: Message): InternalRaisesFuture[
    void, (CancelledError,)] {....stackTrace: false, raises: [], gcsafe,
                               tags: [RootEffect], forbids: [].}
Source   Edit  
proc sendFindNode(kad: KadDHT; peerId: PeerId; addrs: seq[MultiAddress];
                  targetId: Key): InternalRaisesFuture[Message,
    (CancelledError, DialFailedError, ValueError, LPStreamError)] {.
    ...stackTrace: false, raises: [], gcsafe, tags: [RootEffect], forbids: [].}
Source   Edit