class DHTNodes extends Object
And a real Kademlia routing table, which stores node IDs only.
| Constructor and Description |
|---|
DHTNodes(I2PAppContext ctx,
NID me) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
List<NodeInfo> |
findClosest(SHA1Hash h,
int numWant)
DHT
|
NodeInfo |
get(NID nid) |
List<NID> |
getExploreKeys()
DHT - get random keys to explore
|
NodeInfo |
putIfAbsent(NodeInfo nInfo) |
NodeInfo |
remove(NID nid) |
void |
renderStatusHTML(StringBuilder buf)
Debug info, HTML formatted
|
int |
size() |
void |
start() |
void |
stop() |
Collection<NodeInfo> |
values() |
public DHTNodes(I2PAppContext ctx, NID me)
public void clear()
public List<NodeInfo> findClosest(SHA1Hash h, int numWant)
h - either a InfoHash or a NIDpublic NodeInfo putIfAbsent(NodeInfo nInfo)
public void renderStatusHTML(StringBuilder buf)
public int size()
public void start()
public void stop()
public Collection<NodeInfo> values()