|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.klomp.snark.dht.DHTNodes
class DHTNodes
All the nodes we know about, stored as a mapping from node ID to a Destination and Port. And a real Kademlia routing table, which stores node IDs only.
Constructor Summary | |
---|---|
DHTNodes(I2PAppContext ctx,
NID me)
|
Method Summary | |
---|---|
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()
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public DHTNodes(I2PAppContext ctx, NID me)
Method Detail |
---|
public void start()
public void stop()
public int size()
public void clear()
public NodeInfo get(NID nid)
public NodeInfo putIfAbsent(NodeInfo nInfo)
public NodeInfo remove(NID nid)
public Collection<NodeInfo> values()
public List<NodeInfo> findClosest(SHA1Hash h, int numWant)
h
- either a InfoHash or a NIDpublic List<NID> getExploreKeys()
public void renderStatusHTML(StringBuilder buf)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |