Uses of Class
net.i2p.kademlia.KBucketSet
Package
Description
The network database, including implementation of floodfills.
-
Uses of KBucketSet in net.i2p.router.networkdb.kademlia
Modifier and TypeMethodDescription(package private) KBucketSet<Hash>
KademliaNetworkDatabaseFacade.getKBuckets()
Modifier and TypeMethodDescriptionFloodfillPeerSelector.selectFloodfillParticipants
(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets) See above for description List will not include our own hash Returns new list, may be modified.FloodfillPeerSelector.selectFloodfillParticipants
(Hash key, int maxNumRouters, KBucketSet<Hash> kbuckets) Sort the floodfills.FloodfillPeerSelector.selectFloodfillParticipants
(KBucketSet<Hash> kbuckets) List will not include our own hash.FloodfillPeerSelector.selectMostReliablePeers
(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets) Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia.PeerSelector.selectMostReliablePeers
(Hash key, int numClosest, Set<Hash> alreadyChecked, KBucketSet<Hash> kbuckets) UNUSED - See FloodfillPeerSelector override Search through the kbucket set to find the most reliable peers close to the given key, skipping all of the ones already checked List will not include our own hash.FloodfillPeerSelector.selectNearest
(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets) Floodfill peers only.PeerSelector.selectNearest
(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets) UNUSED - See FloodfillPeerSelector override Generic KBucket filtering to find the hashes close to a key, regardless of other considerations.PeerSelector.selectNearestExplicit
(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets) Ignore KBucket ordering and do the XOR explicitly per key.FloodfillPeerSelector.selectNearestExplicitThin
(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets) Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia.FloodfillPeerSelector.selectNearestExplicitThin
(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets, boolean preferConnected) Pick out peers with the floodfill capacity set, returning them first, but then after they're complete, sort via kademlia.PeerSelector.selectNearestExplicitThin
(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets) UNUSED - See FloodfillPeerSelector override Ignore KBucket ordering and do the XOR explicitly per key.