Packages that use KBucketSet
Package
Description
The Kademlia distributed hash table (DHT) network database: lookup, store and explore jobs, the data store, the floodfill variants, and lookup throttling.
BitTorrent distributed hash table (DHT) implementation following the Mainline protocol, for trackerless peer discovery.
Uses of KBucketSet in net.i2p.router.networkdb.kademlia
Fields in net.i2p.router.networkdb.kademlia declared as KBucketSetModifier and TypeFieldDescriptionprivate KBucketSet<Hash> KademliaNetworkDatabaseFacade._kbKbucket set.Methods in net.i2p.router.networkdb.kademlia that return KBucketSetModifier and TypeMethodDescription(package private) KBucketSet<Hash> KademliaNetworkDatabaseFacade.getKBuckets()KBucketSet for the main DB.Methods in net.i2p.router.networkdb.kademlia with parameters of type KBucketSetModifier and TypeMethodDescriptionFloodfillPeerSelector.selectFloodfillParticipants(Set<Hash> toIgnore, KBucketSet<Hash> _kbuckets) List MAY INCLUDE our own hash.FloodfillPeerSelector.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.selectFloodfillParticipantsIncludingUs(Hash key, int howMany, Set<Hash> toIgnore, KBucketSet<Hash> kbuckets) See above for description List MAY CONTAIN our own hash unless included in toIgnore Returns new list, may be modified.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) Peers nearest to the key in routing space.FloodfillPeerSelector.selectNearestExplicit(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.selectNearestExplicit(Hash key, int maxNumRouters, Set<Hash> peersToIgnore, KBucketSet<Hash> kbuckets) Peers nearest to the key, floodfills first, then sorted by Kademlia distance.Uses of KBucketSet in org.klomp.snark.dht
Fields in org.klomp.snark.dht declared as KBucketSetModifier and TypeFieldDescriptionprivate final KBucketSet<NID> DHTNodes._kadThe Kademlia buckets of the known nodes.