| AbstractIterator |
Simplifies the implementation of iterators a bit.
|
| ArraySizingStrategy |
Resizing (growth) strategy for array-backed buffers.
|
| BufferAllocationException |
|
| DoubleArrayList |
An array-backed list of doubles.
|
| DoubleCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| DoubleContainer |
A generic container holding doubles.
|
| DoubleIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
| DoubleLookupContainer |
Marker interface for containers that can check if they contain a given object
in at least time O(log n) and ideally in amortized constant time
O(1).
|
| FloatCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| FloatContainer |
A generic container holding floats.
|
| FloatLookupContainer |
Marker interface for containers that can check if they contain a given object
in at least time O(log n) and ideally in amortized constant time
O(1).
|
| Generated |
|
| HashOrderMixing.Strategy |
|
| HashOrderMixingStrategy |
Hash order mixing strategy implementations should provide an, ideally,
random integer that is later XORed with the hash of a given key before
the slot lookup in associative arrays.
|
| IntArrayList |
An array-backed list of ints.
|
| IntCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| IntContainer |
A generic container holding ints.
|
| IntHashSet |
A hash set of ints, implemented using using open addressing
with linear probing for collision resolution.
|
| IntIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
| IntLookupContainer |
Marker interface for containers that can check if they contain a given object
in at least time O(log n) and ideally in amortized constant time
O(1).
|
| IntObjectAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntObjectHashMap |
A hash map of int to Object, implemented using open
addressing with linear probing for collision resolution.
|
| IntObjectHashMap.KeysContainer |
A view of the keys inside this hash map.
|
| IntObjectMap |
An associative container with unique binding from keys to a single value.
|
| IntSet |
A set of ints.
|
| LongArrayList |
An array-backed list of longs.
|
| LongCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| LongContainer |
A generic container holding longs.
|
| LongHashSet |
A hash set of longs, implemented using using open addressing
with linear probing for collision resolution.
|
| LongIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
| LongIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongIntHashMap |
A hash map of long to int, implemented using open
addressing with linear probing for collision resolution.
|
| LongIntHashMap.KeysContainer |
A view of the keys inside this hash map.
|
| LongIntMap |
An associative container with unique binding from keys to a single value.
|
| LongLookupContainer |
Marker interface for containers that can check if they contain a given object
in at least time O(log n) and ideally in amortized constant time
O(1).
|
| LongObjectAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongObjectHashMap |
A hash map of long to Object, implemented using open
addressing with linear probing for collision resolution.
|
| LongObjectHashMap.KeysContainer |
A view of the keys inside this hash map.
|
| LongObjectMap |
An associative container with unique binding from keys to a single value.
|
| LongSet |
A set of longs.
|
| ObjectArrayList |
An array-backed list of Objects.
|
| ObjectCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ObjectContainer |
A generic container holding Objects.
|
| ObjectFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ObjectFloatHashMap |
A hash map of Object to float, implemented using open
addressing with linear probing for collision resolution.
|
| ObjectFloatHashMap.KeysContainer |
A view of the keys inside this hash map.
|
| ObjectFloatMap |
An associative container with unique binding from keys to a single value.
|
| ObjectHashSet |
A hash set of Objects, implemented using using open addressing
with linear probing for collision resolution.
|
| ObjectIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
| ObjectIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ObjectIntHashMap |
A hash map of Object to int, implemented using open
addressing with linear probing for collision resolution.
|
| ObjectIntHashMap.KeysContainer |
A view of the keys inside this hash map.
|
| ObjectIntMap |
An associative container with unique binding from keys to a single value.
|
| ObjectIntScatterMap |
Same as ObjectIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ObjectLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ObjectLongHashMap |
A hash map of Object to long, implemented using open
addressing with linear probing for collision resolution.
|
| ObjectLongHashMap.KeysContainer |
A view of the keys inside this hash map.
|
| ObjectLongMap |
An associative container with unique binding from keys to a single value.
|
| ObjectLookupContainer |
Marker interface for containers that can check if they contain a given object
in at least time O(log n) and ideally in amortized constant time
O(1).
|
| ObjectObjectAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ObjectObjectHashMap |
A hash map of Object to Object, implemented using open
addressing with linear probing for collision resolution.
|
| ObjectObjectHashMap.KeysContainer |
A view of the keys inside this hash map.
|
| ObjectObjectMap |
An associative container with unique binding from keys to a single value.
|
| ObjectSet |
A set of Objects.
|
| Preallocable |
Anything that can preallocate buffers given prior knowledge of the number of
stored elements.
|
| RandomizedHashOrderMixer |
Randomized hash order.
|
| SuppressForbidden |
Suppresses forbidden-API checks.
|