|
Class Summary |
| AndView |
Provides a logical conjunction, 'And', operation on BitFields. |
| ApproximateMatcher |
Determines if two strings are considered "approximately equal" if one
string can be transformed into the other string through some series of
inserts, deletes and substitutions. |
| BitFieldSet |
Provides a BitField implementation for a BitSet object. |
| 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<E> |
Provides a discrete-case priority queue. |
| Buffer<E> |
Provides a simple fixed-size double-ended queue, a circular buffer. |
| ByteArrayCache |
A cache of byte[]. |
| CharSequenceKeyAnalyzer |
Analyzes CharSequence keys with case sensitivity. |
| Comparators |
Provides a way to compare various data types with static methods. |
| Comparators.ByteArrayComparator |
Compares two byte arrays. |
| Comparators.CaseInsensitiveStringComparator |
Compares String objects without regard to case. |
| DoublyLinkedList<E> |
Provides a doubly-linked list. |
| DoublyLinkedList.ListElement<E> |
Represents an immutable element of the linked list. |
| DualIterator<T> |
Provides an iterator that iterates over two other iterators, in order. |
| EmptyIterator |
Provides an unmodifiable empty iterator. |
| FixedSizeArrayHashMap<K,V> |
A fixed size HashMap that provides indexed access. |
| FixedSizeArrayHashSet<E> |
Provides a fixed size HashSet with index access. |
| FixedSizeExpiringSet<T> |
Maintains, at most, a fixed size of objects in a Set
for a specified time. |
| FixedsizeForgetfulHashMap<K,V> |
Provides a better-defined replacement policy version of
ForgetfulHashMap. |
| FixedsizeForgetfulHashSet<E> |
Stores a fixed size of elements as a Set and removes elements
when that size is reached. |
| FixedsizeHashMap<K,V> |
Implements a fixed size HashMap. |
| FixedSizeLIFOSet<E> |
A fixed size Set where the last added element is the first
item in the list. |
| FixedsizePriorityQueue<E> |
Provides a priority queue with bounded size in an
AVL tree. |
| FixedSizeSortedList<E> |
Gives a sorted list of elements with a maximum size. |
| FixedSizeSortedSet<E> |
Gives a sorted Set of elements with a maximum size. |
| ForgetfulHashMap<K,V> |
A mapping that "forgets" keys and values using a FIFO replacement
policy, much like a cache. |
| IdentityHashSet<E> |
A set equivalent of IdentityHashMap. |
| 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<V> |
A hash map that uses primitive ints for the key rather than objects. |
| IntPair |
Provides the storage of two integers. |
| IntSet |
Represents a set of distinct integers. |
| KeyValue<K,V> |
Stores a property key and its corresponding value pair. |
| LIFOSet<E> |
A hash-based Set ordered with the last added element is the
first item in the list. |
| ListPartitioner<E> |
Partitions a list into sublists with equal size. |
| LongHashMap<V> |
A hash map that uses primitive longs for the key rather than objects. |
| LongInterval |
An implementation of range that stores data in longs |
| MultiCollection<T> |
A Collection that delegates to other collections. |
| MultiIterable<T> |
Lets you iterate over many Iterables easily. |
| MultiIterator<T> |
Implements the Iterator interface. |
| MultiRRIterator<T> |
Is a round robin Iterator for multiple interators. |
| NodeGenerator.NullGenerator |
|
| NotView |
Provides a not view for a BitField. |
| NumericBuffer<T extends Number> |
Provides a circular buffer for Numbers. |
| OrView |
Gives an Or view over one to many BitFields. |
| Pair |
Contains an int property key and its corresponding value type Object. |
| PatriciaTrie<K,V> |
A PATRICIA Trie. |
| Periodic |
A utility to schedule, reschedule and cancel the execution of
a task. |
| PowerOf2ByteArrayCache |
Creates a byte array with a size that is a power of 2 (byte array size = 2^power). |
| QueueCounter |
Measures the average number of elements in a queueing system. |
| RandomOrderHashMap<K,V> |
A variant of FixedSizeArrayHashMap that allows iterations over
its elements in random order. |
| RandomOrderHashSet<T> |
A variant of FixedSizeArrayHashSet that allows iterations over
its elements in random order. |
| RandomSequence |
Generates all the integers from 0 to a certain limit in a
random fashion where each number is generated only once per cycle. |
| Range |
An ordered tuple of long values, (low, high). |
| RoundRobinQueue<T> |
A round-robin queue. |
| RoundRobinSetQueue<T> |
A round-robin queue where types are unique. |
| RRProcessingQueue |
Executes Runnables in a round-robin order per queue ID. |
| SortedList<E> |
Extends TreeList to sort elements upon insertion. |
| SparseIntSet |
Represents a set of distinct integers. |
| StringTrie<V> |
An information reTRIEval tree, a.k.a., a prefix tree. |
| StringTrieSet |
Provides a set-like interface designed specifically for Strings. |
| TreeList<E> |
A List implementation that is optimized for fast insertions and
removals at any index in the list. |
| TreeStorage |
Structure that contains only the necessary nodes of a hash tree, automatically
verifies new nodes against the root and compacts the tree as nodes are used. |
| TrieUtils |
Miscellaneous utilities for Tries. |
| Tuple<T1,T2> |
Typed tuple that holds two objects of possibly different types. |
| UnmodifiableIterator<E> |
A convenience class to aid in developing iterators that cannot be modified. |
| XorView |
Provides an XOR view. |