javadoc

apps/i2psnark/java/src/net/i2p/kademlia/KBucket.java

@@ -17,6 +17,7 @@ import net.i2p.data.SimpleDataStructure;
  * a local key, using XOR as the distance metric
  *
  * Refactored from net.i2p.router.networkdb.kademlia
+ * @since 0.9.2
  */
 public interface KBucket<T extends SimpleDataStructure> {
 

apps/i2psnark/java/src/net/i2p/kademlia/KBucketImpl.java

@@ -41,6 +41,7 @@ import net.i2p.util.ConcurrentHashSet;
  *  removing entries, this KBucket will exceed the max size.
  *
  *  Refactored from net.i2p.router.networkdb.kademlia
+ *  @since 0.9.2
  */
 class KBucketImpl<T extends SimpleDataStructure> implements KBucket<T> {
     /**

apps/i2psnark/java/src/net/i2p/kademlia/KBucketSet.java

@@ -35,6 +35,7 @@ import net.i2p.util.Log;
  * times 2**(B-1) for Kademlia value B.
  *
  * Refactored from net.i2p.router.networkdb.kademlia
+ * @since 0.9.2
  */
 public class KBucketSet<T extends SimpleDataStructure> {
     private final Log _log;

apps/i2psnark/java/src/net/i2p/kademlia/SelectionCollector.java

@@ -4,6 +4,7 @@ import net.i2p.data.SimpleDataStructure;
 
 /**
  * Visit kbuckets, gathering matches
+ * @since 0.9.2
  */
 public interface SelectionCollector<T extends SimpleDataStructure> {
     public void add(T entry);

apps/i2psnark/java/src/net/i2p/kademlia/XORComparator.java

@@ -8,6 +8,7 @@ import net.i2p.data.SimpleDataStructure;
 /**
  * Help sort Hashes in relation to a base key using the XOR metric
  *
+ * @since 0.9.2
  */
 class XORComparator<T extends SimpleDataStructure> implements Comparator<T> {
     private final byte[] _base;