Uses of Package
org.limewire.collection

Packages that use org.limewire.collection

org.limewire.collection

Classes in org.limewire.collection used by org.limewire.collection

AutoCompleteDictionary
Defines the interface for an auto-complete dictionary.

BitField
Defines the interface to manipulate a fixed size field of bits.

BitNumbers
Allows storage & retrieval of numbers based on the index of an on or off bit in a byte[] or a hexadecimal String representation of that byte[].

BitSet
Contains a vector of bits that grows as needed.

BucketQueue
Provides a discrete-case priority queue.

Buffer
Provides a simple fixed-size double-ended queue, a circular buffer.

DoublyLinkedList.ListElement
Represents an immutable element of the linked list.

FixedSizeArrayHashMap
A fixed size HashMap that provides indexed access.

FixedSizeArrayHashSet
Provides a fixed size HashSet with index access.

FixedsizeForgetfulHashMap
Provides a better-defined replacement policy version of ForgetfulHashMap.

FixedsizeForgetfulHashSet
Stores a fixed size of elements as a Set and removes elements when that size is reached.

FixedSizeLIFOSet.EjectionPolicy
The EjectionPolicy controls which element should be removed from the Set if has reached its maximum capacity.

Function
Defines the interface for passing a type as an argument to a method, with a return value of a type.

IntBuffer
Provides a fixed-size double-ended queue, a circular buffer.

IntervalSet
Provides an interval of ranges (a "range" version of IntSet).

IntervalSet.ByteIntervals
Allows you to keep int and long intervals in the same location.

IntHashMap
A hash map that uses primitive ints for the key rather than objects.

IntSet
Represents a set of distinct integers.

IntSet.IntSetIterator
Yields a sequence of int's (not Object's) in order, without removal support.

LIFOSet
A hash-based Set ordered with the last added element is the first item in the list.

LongHashMap
A hash map that uses primitive longs for the key rather than objects.

MultiIterable
Lets you iterate over many Iterables easily.

MultiIterator
Implements the Iterator interface.

NodeGenerator
Something that generates a tree node such as Tiger hash.

NoMoreStorageException
Thrown when there isn't any more space left in the underlying data structure to store the new element which was attempted to be added.

Pair
Contains an int property key and its corresponding value type Object.

PatriciaTrie.KeyAnalyzer
Defines the interface to analyze Trie keys on a bit level.

RandomAccessCollection
A collection that can retrieve items at specific indexes.

RandomAccessMap
A Map that can be retrieved through getAt methods.

Range
An ordered tuple of long values, (low, high).

RoundRobinQueue
A round-robin queue.

SortedList
Extends TreeList to sort elements upon insertion.

TreeList
A List implementation that is optimized for fast insertions and removals at any index in the list.

Trie
Defines the interface for a prefix tree, an ordered tree data structure.

Trie.Cursor
An interface used by a Trie.

Trie.Cursor.SelectStatus
The mode during selection.

UnmodifiableIterator
A convenience class to aid in developing iterators that cannot be modified.