forked from I2P_Developers/i2p.i2p
javadocs
This commit is contained in:
@ -778,7 +778,6 @@ public class KBucketSet<T extends SimpleDataStructure> {
|
||||
* To always discard a newer entry, always return false.
|
||||
*
|
||||
* @param kbucket the kbucket that is now too big
|
||||
* @param justAdded the entry that was just added, causing it to be too big
|
||||
* @return true to actually add the entry.
|
||||
*/
|
||||
public boolean trim(KBucket<K> kbucket, K toAdd);
|
||||
|
6
apps/i2psnark/java/src/net/i2p/kademlia/package.html
Normal file
6
apps/i2psnark/java/src/net/i2p/kademlia/package.html
Normal file
@ -0,0 +1,6 @@
|
||||
<html><body><p>
|
||||
This is a major rewrite of KBucket, KBucketSet, and KBucketImpl from net.i2p.router.networkdb.kademlia.
|
||||
The classes are now generic to support SHA1. SHA256, or other key lengths.
|
||||
The long-term goal is to prove out this new implementation in i2psnark,
|
||||
then move it to core, then convert the network database to use it.
|
||||
</p></body></html>
|
@ -194,10 +194,10 @@ interface PeerListener
|
||||
*
|
||||
* @param peer the Peer that got the message.
|
||||
* @param port the query port
|
||||
* @param port the response port
|
||||
* @param rport the response port
|
||||
* @since 0.8.4
|
||||
*/
|
||||
void gotPort(Peer peer, int port, int qport);
|
||||
void gotPort(Peer peer, int port, int rport);
|
||||
|
||||
/**
|
||||
* Called when peers are received via PEX
|
||||
|
@ -98,7 +98,7 @@ class DHTNodes {
|
||||
|
||||
/**
|
||||
* DHT
|
||||
* @param sha1 either a InfoHash or a NID
|
||||
* @param h either a InfoHash or a NID
|
||||
*/
|
||||
public List<NodeInfo> findClosest(SHA1Hash h, int numWant) {
|
||||
NID key;
|
||||
|
@ -383,7 +383,7 @@ public class KRPC implements I2PSessionMuxedListener, DHT {
|
||||
* Non-blocking.
|
||||
*
|
||||
* @param ih the Info Hash (torrent)
|
||||
* @param peer the peer's Hash
|
||||
* @param peerHash the peer's Hash
|
||||
*/
|
||||
public void announce(byte[] ih, byte[] peerHash) {
|
||||
InfoHash iHash = new InfoHash(ih);
|
||||
|
Reference in New Issue
Block a user