fn query_closest(&mut self, peer_id: PeerId, call: WaitPeer) {
        log::debug!("Queried closest peers for peer_id {}", peer_id);
        // TODO: Don't call get_closest_peers if there are already WaitPeer::Neighbourhood or WaitPeer::Routable enqueued
        self.wait_peer.enqueue(peer_id.clone(), call);
        // NOTE: Using Qm form of `peer_id` here (via peer_id.borrow), since kademlia uses that for keys
        self.kademlia.get_closest_peers(peer_id);
    }
/// Query for peers closest to the `peer_id` as DHT key, enqueue call until response
Query for peers closest to the `peer_id` as DHT key, enqueue call until response
Query for peers closest to the ` peer_id ` as DHT key enqueue call until response
fn query_closest(&mut self, peer_id: PeerId, call: WaitPeer) {
        log::debug!("Queried closest peers for peer_id {}", peer_id);
        // TODO: Don't call get_closest_peers if there are already WaitPeer::Neighbourhood or WaitPeer::Routable enqueued
        self.wait_peer.enqueue(peer_id.clone(), call);
        // NOTE: Using Qm form of `peer_id` here (via peer_id.borrow), since kademlia uses that for keys
        self.kademlia.get_closest_peers(peer_id);
    }
fn query_closest ( & mut self , peer_id : PeerId , call : WaitPeer ) { log :: debug ! ( " " peer_id ) ; // TODO: Don't call get_closest_peers if there are already WaitPeer::Neighbourhood or WaitPeer::Routable enqueued self . wait_peer . enqueue ( peer_id . clone ( ) , call ) ; // NOTE: Using Qm form of `peer_id` here (via peer_id.borrow), since kademlia uses that for keys self . kademlia . get_closest_peers ( peer_id ) ; }
Query for peers closest to the `peer_id` as DHT key, enqueue call until response
Query for peers closest to the ` peer_id ` as DHT key enqueue call until response
&mut self
peer_id
PeerId
call
WaitPeer