ArrayUtil |
Methods for manipulating arrays.
|
AutoHashMap<K,V> |
A Hash that creates new elements if they don't exists
|
BitUtil |
A variety of high efficiency bit twiddling routines.
|
HashLongLongArray |
A Hash using primitive types instead or warped object
The idea is to be able to add many long values for each key
This could be implemented by simply doing HashMap > (but it
would consume much more memory)
Note: We call each 'long[]' a bucket
WARNING: This collection does NOT allow elements to be deleted! But you can replace values.
|
MultivalueHashMap<K,V> |
A Hash that can hold multiple values for each key
|
OpenBitSet |
An "open" BitSet implementation that allows direct access to the array of words
storing the bits.
|