| ArraySizingStrategy |
Resizing (growth) strategy for array-backed buffers.
|
| 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).
|
| 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.
|
| IntCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| IntContainer |
A generic container holding ints.
|
| 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<VType> |
An associative container from keys to (one or
possibly more) values.
|
| IntObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| IntSet |
A set of ints.
|
| LongCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| LongContainer |
A generic container holding longs.
|
| 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.
|
| 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<VType> |
An associative container from keys to (one or
possibly more) values.
|
| LongObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| LongSet |
A set of longs.
|
| ObjectCollection<KType> |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ObjectContainer<KType> |
A generic container holding Objects.
|
| ObjectFloatAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectFloatMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectIndexedContainer<KType> |
An indexed container provides random access to elements based on an
index.
|
| ObjectIntAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectIntMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectLongAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectLongMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectLookupContainer<KType> |
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<KType,VType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectObjectMap<KType,VType> |
An associative container with unique binding from keys to a single value.
|
| ObjectSet<KType> |
A set of Objects.
|
| Preallocable |
Anything that can preallocate buffers given prior knowledge of the number of
stored elements.
|