Public

<init>

The keys closest to the key. Returned list will never contain us.

getClosest

For every bucket that hasn't been updated in this long, or isn't close to full,
generate a random ke

getExploreKeys

toString

clear

Generate a random key to go within this bucket Package private for testing only.
Others shouldn't ne

generateRandomKey

getAll

The number of bits minus 1 (range number) for the xor of the key. Package
private for testing only. 

getRange

remove

size

createBucket

createBuckets

The bucket that the xor of the key goes in Caller must hold read lock

getBucket

Returned list is a copy of the bucket list, closest first, with the actual
buckets (not a copy). Pri

getBuckets

getReadLock

getWriteLock

Creates two or more new buckets. The old bucket is replaced and discarded.
Caller must hold write lo

locked_split

Make a new SimpleDataStrucure from the data

makeKey

The bucket number (NOT the range number) that the xor of the key goes in Caller
must hold read lock

pickBucket

SimpleDateFormat

Finding current android device location

An "abstract" representation of a file system entity identified by a pathname.
The pathname may be a

java.io.File

Thrown when a file specified by a program cannot be found.

java.io.FileNotFoundException

A linear collection that supports element insertion and removal at both ends.
The name deque is shor

java.util.Deque

A Map is a data structure consisting of a set of keys and values in which each
key is mapped to a si

java.util.Map

An unbounded priority Queue based on a priority heap. The elements of the
priority queue are ordered

java.util.PriorityQueue

javax.swing.JTable

getResourceAsStream

Return the original filename in the client's filesystem.This may contain path
information depending 

getOriginalFilename

getSharedPreferences

/**
     *  Creates two or more new buckets. The old bucket is replaced and discarded.
     *
     *  Caller must hold write lock
     *  The bucket should be splittable (range start != range end).
     *  @param r the range start of the bucket to be split
     */

// When B_VALUE = 1, or the bucket is larger than B_FACTOR, then

// When B_VALUE > 1, and the bucket is smaller than B_FACTOR, then

// e.g. 1020-1023 => 1020-1021, 1022-1023

// The bucket is a "whole" kbucket with a range > B_FACTOR,

// so it should be split into two "whole" kbuckets each with

// The bucket is the smallest "whole" kbucket with a range == B_FACTOR,

// or B_VALUE > 1 and the bucket has already been split.

// Start or continue splitting down to a depth B_VALUE.

//    _log.debug("State is now: " + toString());

// should be rare... too hard to call _trimmer from here

// (and definitely not from inside the write lock)

// loop if all the entries went in the first bucket

How to use createBucketmethodin net.i2p.kademlia.KBucketSet

Best Java code snippets using net.i2p.kademlia.KBucketSet.createBucket (Showing top 2 results out of 315)

How to use
createBucket
method
in
net.i2p.kademlia.KBucketSet