|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use KBucketSet | |
---|---|
net.i2p.router.networkdb.kademlia |
Uses of KBucketSet in net.i2p.router.networkdb.kademlia |
---|
Methods in net.i2p.router.networkdb.kademlia that return KBucketSet | |
---|---|
(package private) KBucketSet |
KademliaNetworkDatabaseFacade.getKBuckets()
|
Methods in net.i2p.router.networkdb.kademlia with parameters of type KBucketSet | |
---|---|
java.util.List |
FloodfillPeerSelector.selectFloodfillParticipants(KBucketSet kbuckets)
|
java.util.List |
PeerSelector.selectMostReliablePeers(Hash key,
int numClosest,
java.util.Set alreadyChecked,
KBucketSet kbuckets)
Search through the kbucket set to find the most reliable peers close to the given key, skipping all of the ones already checked |
java.util.List |
PeerSelector.selectNearest(Hash key,
int maxNumRouters,
java.util.Set peersToIgnore,
KBucketSet kbuckets)
Generic KBucket filtering to find the hashes close to a key, regardless of other considerations. |
java.util.List |
PeerSelector.selectNearestExplicit(Hash key,
int maxNumRouters,
java.util.Set peersToIgnore,
KBucketSet kbuckets)
Ignore KBucket ordering and do the XOR explicitly per key. |
java.util.List |
PeerSelector.selectNearestExplicitThin(Hash key,
int maxNumRouters,
java.util.Set peersToIgnore,
KBucketSet kbuckets)
Ignore KBucket ordering and do the XOR explicitly per key. |
java.util.List |
FloodfillPeerSelector.selectNearestExplicitThin(Hash key,
int maxNumRouters,
java.util.Set peersToIgnore,
KBucketSet kbuckets)
Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |