dht

ExampleDHT is a simple example that searches for a particular infohash and exits when it finds any peers. A stand-alone version can be found in the examples/ directory.

if testing.Short() {
	fmt.Println("Peer found for the requested infohash or the test was skipped")
	return
}
d, err := NewDHTNode(0, 100, false)
if err != nil {
	fmt.Println(err)
	return
}
go d.DoDHT()

infoHash, err := DecodeInfoHash("d1c5676ae7ac98e8b19f63565905105e3c4c37a2")
if err != nil {
	fmt.Printf("DecodeInfoHash faiure: %v", err)
	return
}

// Give the DHT some time to "warm-up" its routing table.
time.Sleep(5 * time.Second)

d.PeersRequest(string(infoHash), false)

var infoHashPeers map[InfoHash][]string
select {
case infoHashPeers = <-d.PeersRequestResults:
	break
case <-time.After(30 * time.Second):
	fmt.Printf("Could not find new peers: timed out")
	return
}
for ih, peers := range infoHashPeers {
	if len(peers) > 0 {
		// Peers are encoded in binary format. Decoding example using github.com/nictuku/nettools:
		// for _, peer := range peers {
		// 	fmt.Println(DecodePeerAddress(peer))
		// }

		if fmt.Sprintf("%x", ih) == "d1c5676ae7ac98e8b19f63565905105e3c4c37a2" {
			fmt.Println("Peer found for the requested infohash or the test was skipped")
			return
		}
	}
}

Output:

Peer found for the requested infohash or the test was skipped