| Interface | Description |
|---|---|
| ArraySizingStrategy |
Resizing (growth) strategy for array-backed buffers.
|
| ByteByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteByteMap |
An associative container with unique binding from keys to a single value.
|
| ByteCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteCharMap |
An associative container with unique binding from keys to a single value.
|
| ByteCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ByteContainer |
A generic container holding
bytes. |
| ByteDeque |
A linear collection that supports element insertion and removal at both ends.
|
| ByteDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteDoubleMap |
An associative container with unique binding from keys to a single value.
|
| ByteFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteFloatMap |
An associative container with unique binding from keys to a single value.
|
| ByteIndexedContainer |
An indexed container provides random access to elements based on an
index. |
| ByteIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteIntMap |
An associative container with unique binding from keys to a single value.
|
| ByteLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteLongMap |
An associative container with unique binding from keys to a single value.
|
| ByteLookupContainer |
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). |
| ByteObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
| ByteObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| ByteSet |
A set of
bytes. |
| ByteShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteShortMap |
An associative container with unique binding from keys to a single value.
|
| CharByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharByteMap |
An associative container with unique binding from keys to a single value.
|
| CharCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharCharMap |
An associative container with unique binding from keys to a single value.
|
| CharCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| CharContainer |
A generic container holding
chars. |
| CharDeque |
A linear collection that supports element insertion and removal at both ends.
|
| CharDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharDoubleMap |
An associative container with unique binding from keys to a single value.
|
| CharFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharFloatMap |
An associative container with unique binding from keys to a single value.
|
| CharIndexedContainer |
An indexed container provides random access to elements based on an
index. |
| CharIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharIntMap |
An associative container with unique binding from keys to a single value.
|
| CharLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharLongMap |
An associative container with unique binding from keys to a single value.
|
| CharLookupContainer |
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). |
| CharObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
| CharObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| CharSet |
A set of
chars. |
| CharShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharShortMap |
An associative container with unique binding from keys to a single value.
|
| DoubleByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleByteMap |
An associative container with unique binding from keys to a single value.
|
| DoubleCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleCharMap |
An associative container with unique binding from keys to a single value.
|
| DoubleCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| DoubleContainer |
A generic container holding
doubles. |
| DoubleDeque |
A linear collection that supports element insertion and removal at both ends.
|
| DoubleDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleDoubleMap |
An associative container with unique binding from keys to a single value.
|
| DoubleFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleFloatMap |
An associative container with unique binding from keys to a single value.
|
| DoubleIndexedContainer |
An indexed container provides random access to elements based on an
index. |
| DoubleIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleIntMap |
An associative container with unique binding from keys to a single value.
|
| DoubleLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleLongMap |
An associative container with unique binding from keys to a single value.
|
| 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). |
| DoubleObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
| DoubleObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| DoubleSet |
A set of
doubles. |
| DoubleShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleShortMap |
An associative container with unique binding from keys to a single value.
|
| FloatByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatByteMap |
An associative container with unique binding from keys to a single value.
|
| FloatCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatCharMap |
An associative container with unique binding from keys to a single value.
|
| FloatCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| FloatContainer |
A generic container holding
floats. |
| FloatDeque |
A linear collection that supports element insertion and removal at both ends.
|
| FloatDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatDoubleMap |
An associative container with unique binding from keys to a single value.
|
| FloatFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatFloatMap |
An associative container with unique binding from keys to a single value.
|
| FloatIndexedContainer |
An indexed container provides random access to elements based on an
index. |
| FloatIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatIntMap |
An associative container with unique binding from keys to a single value.
|
| FloatLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatLongMap |
An associative container with unique binding from keys to a single value.
|
| 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). |
| FloatObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
| FloatObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| FloatSet |
A set of
floats. |
| FloatShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatShortMap |
An associative container with unique binding from keys to a single value.
|
| 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.
|
| IntByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntByteMap |
An associative container with unique binding from keys to a single value.
|
| IntCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntCharMap |
An associative container with unique binding from keys to a single value.
|
| IntCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| IntContainer |
A generic container holding
ints. |
| IntDeque |
A linear collection that supports element insertion and removal at both ends.
|
| IntDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntDoubleMap |
An associative container with unique binding from keys to a single value.
|
| IntFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntFloatMap |
An associative container with unique binding from keys to a single value.
|
| IntIndexedContainer |
An indexed container provides random access to elements based on an
index. |
| IntIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntIntMap |
An associative container with unique binding from keys to a single value.
|
| IntLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntLongMap |
An associative container with unique binding from keys to a single value.
|
| 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. |
| IntShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntShortMap |
An associative container with unique binding from keys to a single value.
|
| LongByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongByteMap |
An associative container with unique binding from keys to a single value.
|
| LongCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongCharMap |
An associative container with unique binding from keys to a single value.
|
| LongCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| LongContainer |
A generic container holding
longs. |
| LongDeque |
A linear collection that supports element insertion and removal at both ends.
|
| LongDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongDoubleMap |
An associative container with unique binding from keys to a single value.
|
| LongFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongFloatMap |
An associative container with unique binding from keys to a single value.
|
| 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.
|
| LongLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongLongMap |
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. |
| LongShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongShortMap |
An associative container with unique binding from keys to a single value.
|
| ObjectByteAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectByteMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectCharAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectCharMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectCollection<KType> |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ObjectContainer<KType> |
A generic container holding
Objects. |
| ObjectDeque<KType> |
A linear collection that supports element insertion and removal at both ends.
|
| ObjectDoubleAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectDoubleMap<KType> |
An associative container with unique binding from keys to a single value.
|
| 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. |
| ObjectShortAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectShortMap<KType> |
An associative container with unique binding from keys to a single value.
|
| Preallocable |
Anything that can preallocate buffers given prior knowledge of the number of
stored elements.
|
| ShortByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortByteMap |
An associative container with unique binding from keys to a single value.
|
| ShortCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortCharMap |
An associative container with unique binding from keys to a single value.
|
| ShortCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ShortContainer |
A generic container holding
shorts. |
| ShortDeque |
A linear collection that supports element insertion and removal at both ends.
|
| ShortDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortDoubleMap |
An associative container with unique binding from keys to a single value.
|
| ShortFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortFloatMap |
An associative container with unique binding from keys to a single value.
|
| ShortIndexedContainer |
An indexed container provides random access to elements based on an
index. |
| ShortIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortIntMap |
An associative container with unique binding from keys to a single value.
|
| ShortLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortLongMap |
An associative container with unique binding from keys to a single value.
|
| ShortLookupContainer |
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). |
| ShortObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
| ShortObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| ShortSet |
A set of
shorts. |
| ShortShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortShortMap |
An associative container with unique binding from keys to a single value.
|
| Class | Description |
|---|---|
| AbstractIterator<E> |
Simplifies the implementation of iterators a bit.
|
| BitMixer |
Bit mixing utilities.
|
| BitSet |
An "open" BitSet implementation that allows direct access to the array of words storing
the bits.
|
| BitSetIterator |
An iterator to iterate over set bits in an BitSet.
|
| BoundedProportionalArraySizingStrategy |
Array resizing proportional to the current buffer size, optionally kept
within the given minimum and maximum growth limits.
|
| ByteArrayDeque |
An array-backed
ByteDeque. |
| ByteArrayList |
An array-backed list of bytes.
|
| ByteByteHashMap |
A hash map of
byte to byte, implemented using open
addressing with linear probing for collision resolution. |
| ByteByteScatterMap |
Same as
ByteByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteCharHashMap |
A hash map of
byte to char, implemented using open
addressing with linear probing for collision resolution. |
| ByteCharScatterMap |
Same as
ByteCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteDoubleHashMap |
A hash map of
byte to double, implemented using open
addressing with linear probing for collision resolution. |
| ByteDoubleScatterMap |
Same as
ByteDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteFloatHashMap |
A hash map of
byte to float, implemented using open
addressing with linear probing for collision resolution. |
| ByteFloatScatterMap |
Same as
ByteFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteHashSet |
A hash set of
bytes, implemented using using open addressing
with linear probing for collision resolution. |
| ByteIntHashMap |
A hash map of
byte to int, implemented using open
addressing with linear probing for collision resolution. |
| ByteIntScatterMap |
Same as
ByteIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteLongHashMap |
A hash map of
byte to long, implemented using open
addressing with linear probing for collision resolution. |
| ByteLongScatterMap |
Same as
ByteLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteObjectHashMap<VType> |
A hash map of
byte to Object, implemented using open
addressing with linear probing for collision resolution. |
| ByteObjectScatterMap<VType> |
Same as
ByteObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteScatterSet |
Same as
ByteHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| ByteShortHashMap |
A hash map of
byte to short, implemented using open
addressing with linear probing for collision resolution. |
| ByteShortScatterMap |
Same as
ByteShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ByteStack |
A subclass of
ByteArrayList adding stack-related utility methods. |
| CharArrayDeque |
An array-backed
CharDeque. |
| CharArrayList |
An array-backed list of chars.
|
| CharByteHashMap |
A hash map of
char to byte, implemented using open
addressing with linear probing for collision resolution. |
| CharByteScatterMap |
Same as
CharByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharCharHashMap |
A hash map of
char to char, implemented using open
addressing with linear probing for collision resolution. |
| CharCharScatterMap |
Same as
CharCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharDoubleHashMap |
A hash map of
char to double, implemented using open
addressing with linear probing for collision resolution. |
| CharDoubleScatterMap |
Same as
CharDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharFloatHashMap |
A hash map of
char to float, implemented using open
addressing with linear probing for collision resolution. |
| CharFloatScatterMap |
Same as
CharFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharHashSet |
A hash set of
chars, implemented using using open addressing
with linear probing for collision resolution. |
| CharIntHashMap |
A hash map of
char to int, implemented using open
addressing with linear probing for collision resolution. |
| CharIntScatterMap |
Same as
CharIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharLongHashMap |
A hash map of
char to long, implemented using open
addressing with linear probing for collision resolution. |
| CharLongScatterMap |
Same as
CharLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharObjectHashMap<VType> |
A hash map of
char to Object, implemented using open
addressing with linear probing for collision resolution. |
| CharObjectScatterMap<VType> |
Same as
CharObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharScatterSet |
Same as
CharHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| CharShortHashMap |
A hash map of
char to short, implemented using open
addressing with linear probing for collision resolution. |
| CharShortScatterMap |
Same as
CharShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| CharStack |
A subclass of
CharArrayList adding stack-related utility methods. |
| Containers |
Constants used as defaults in containers.
|
| DoubleArrayDeque |
An array-backed
DoubleDeque. |
| DoubleArrayList |
An array-backed list of doubles.
|
| DoubleByteHashMap |
A hash map of
double to byte, implemented using open
addressing with linear probing for collision resolution. |
| DoubleByteScatterMap |
Same as
DoubleByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleCharHashMap |
A hash map of
double to char, implemented using open
addressing with linear probing for collision resolution. |
| DoubleCharScatterMap |
Same as
DoubleCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleDoubleHashMap |
A hash map of
double to double, implemented using open
addressing with linear probing for collision resolution. |
| DoubleDoubleScatterMap |
Same as
DoubleDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleFloatHashMap |
A hash map of
double to float, implemented using open
addressing with linear probing for collision resolution. |
| DoubleFloatScatterMap |
Same as
DoubleFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleHashSet |
A hash set of
doubles, implemented using using open addressing
with linear probing for collision resolution. |
| DoubleIntHashMap |
A hash map of
double to int, implemented using open
addressing with linear probing for collision resolution. |
| DoubleIntScatterMap |
Same as
DoubleIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleLongHashMap |
A hash map of
double to long, implemented using open
addressing with linear probing for collision resolution. |
| DoubleLongScatterMap |
Same as
DoubleLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleObjectHashMap<VType> |
A hash map of
double to Object, implemented using open
addressing with linear probing for collision resolution. |
| DoubleObjectScatterMap<VType> |
Same as
DoubleObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleScatterSet |
Same as
DoubleHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| DoubleShortHashMap |
A hash map of
double to short, implemented using open
addressing with linear probing for collision resolution. |
| DoubleShortScatterMap |
Same as
DoubleShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| DoubleStack |
A subclass of
DoubleArrayList adding stack-related utility methods. |
| FloatArrayDeque |
An array-backed
FloatDeque. |
| FloatArrayList |
An array-backed list of floats.
|
| FloatByteHashMap |
A hash map of
float to byte, implemented using open
addressing with linear probing for collision resolution. |
| FloatByteScatterMap |
Same as
FloatByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatCharHashMap |
A hash map of
float to char, implemented using open
addressing with linear probing for collision resolution. |
| FloatCharScatterMap |
Same as
FloatCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatDoubleHashMap |
A hash map of
float to double, implemented using open
addressing with linear probing for collision resolution. |
| FloatDoubleScatterMap |
Same as
FloatDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatFloatHashMap |
A hash map of
float to float, implemented using open
addressing with linear probing for collision resolution. |
| FloatFloatScatterMap |
Same as
FloatFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatHashSet |
A hash set of
floats, implemented using using open addressing
with linear probing for collision resolution. |
| FloatIntHashMap |
A hash map of
float to int, implemented using open
addressing with linear probing for collision resolution. |
| FloatIntScatterMap |
Same as
FloatIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatLongHashMap |
A hash map of
float to long, implemented using open
addressing with linear probing for collision resolution. |
| FloatLongScatterMap |
Same as
FloatLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatObjectHashMap<VType> |
A hash map of
float to Object, implemented using open
addressing with linear probing for collision resolution. |
| FloatObjectScatterMap<VType> |
Same as
FloatObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatScatterSet |
Same as
FloatHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| FloatShortHashMap |
A hash map of
float to short, implemented using open
addressing with linear probing for collision resolution. |
| FloatShortScatterMap |
Same as
FloatShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| FloatStack |
A subclass of
FloatArrayList adding stack-related utility methods. |
| HashContainers | |
| HashOrderMixing |
Factory methods to acquire the most common types of
HashOrderMixingStrategy. |
| IntArrayDeque |
An array-backed
IntDeque. |
| IntArrayList |
An array-backed list of ints.
|
| IntByteHashMap |
A hash map of
int to byte, implemented using open
addressing with linear probing for collision resolution. |
| IntByteScatterMap |
Same as
IntByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntCharHashMap |
A hash map of
int to char, implemented using open
addressing with linear probing for collision resolution. |
| IntCharScatterMap |
Same as
IntCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntDoubleHashMap |
A hash map of
int to double, implemented using open
addressing with linear probing for collision resolution. |
| IntDoubleScatterMap |
Same as
IntDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntFloatHashMap |
A hash map of
int to float, implemented using open
addressing with linear probing for collision resolution. |
| IntFloatScatterMap |
Same as
IntFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntHashSet |
A hash set of
ints, implemented using using open addressing
with linear probing for collision resolution. |
| IntIntHashMap |
A hash map of
int to int, implemented using open
addressing with linear probing for collision resolution. |
| IntIntScatterMap |
Same as
IntIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntLongHashMap |
A hash map of
int to long, implemented using open
addressing with linear probing for collision resolution. |
| IntLongScatterMap |
Same as
IntLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntObjectHashMap<VType> |
A hash map of
int to Object, implemented using open
addressing with linear probing for collision resolution. |
| IntObjectScatterMap<VType> |
Same as
IntObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntScatterSet |
Same as
IntHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| IntShortHashMap |
A hash map of
int to short, implemented using open
addressing with linear probing for collision resolution. |
| IntShortScatterMap |
Same as
IntShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| IntStack |
A subclass of
IntArrayList adding stack-related utility methods. |
| LongArrayDeque |
An array-backed
LongDeque. |
| LongArrayList |
An array-backed list of longs.
|
| LongByteHashMap |
A hash map of
long to byte, implemented using open
addressing with linear probing for collision resolution. |
| LongByteScatterMap |
Same as
LongByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongCharHashMap |
A hash map of
long to char, implemented using open
addressing with linear probing for collision resolution. |
| LongCharScatterMap |
Same as
LongCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongDoubleHashMap |
A hash map of
long to double, implemented using open
addressing with linear probing for collision resolution. |
| LongDoubleScatterMap |
Same as
LongDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongFloatHashMap |
A hash map of
long to float, implemented using open
addressing with linear probing for collision resolution. |
| LongFloatScatterMap |
Same as
LongFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongHashSet |
A hash set of
longs, implemented using using open addressing
with linear probing for collision resolution. |
| LongIntHashMap |
A hash map of
long to int, implemented using open
addressing with linear probing for collision resolution. |
| LongIntScatterMap |
Same as
LongIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongLongHashMap |
A hash map of
long to long, implemented using open
addressing with linear probing for collision resolution. |
| LongLongScatterMap |
Same as
LongLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongObjectHashMap<VType> |
A hash map of
long to Object, implemented using open
addressing with linear probing for collision resolution. |
| LongObjectScatterMap<VType> |
Same as
LongObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongScatterSet |
Same as
LongHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| LongShortHashMap |
A hash map of
long to short, implemented using open
addressing with linear probing for collision resolution. |
| LongShortScatterMap |
Same as
LongShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| LongStack |
A subclass of
LongArrayList adding stack-related utility methods. |
| ObjectArrayDeque<KType> |
An array-backed
ObjectDeque. |
| ObjectArrayList<KType> |
An array-backed list of Objects.
|
| ObjectByteHashMap<KType> |
A hash map of
Object to byte, implemented using open
addressing with linear probing for collision resolution. |
| ObjectByteIdentityHashMap<KType> |
An identity hash map of
Object to byte. |
| ObjectByteScatterMap<KType> |
Same as
ObjectByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectCharHashMap<KType> |
A hash map of
Object to char, implemented using open
addressing with linear probing for collision resolution. |
| ObjectCharIdentityHashMap<KType> |
An identity hash map of
Object to char. |
| ObjectCharScatterMap<KType> |
Same as
ObjectCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectDoubleHashMap<KType> |
A hash map of
Object to double, implemented using open
addressing with linear probing for collision resolution. |
| ObjectDoubleIdentityHashMap<KType> |
An identity hash map of
Object to double. |
| ObjectDoubleScatterMap<KType> |
Same as
ObjectDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectFloatHashMap<KType> |
A hash map of
Object to float, implemented using open
addressing with linear probing for collision resolution. |
| ObjectFloatIdentityHashMap<KType> |
An identity hash map of
Object to float. |
| ObjectFloatScatterMap<KType> |
Same as
ObjectFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectHashSet<KType> |
A hash set of
Objects, implemented using using open addressing
with linear probing for collision resolution. |
| ObjectIdentityHashSet<KType> |
A reference-equality (identity) hash set.
|
| ObjectIntHashMap<KType> |
A hash map of
Object to int, implemented using open
addressing with linear probing for collision resolution. |
| ObjectIntIdentityHashMap<KType> |
An identity hash map of
Object to int. |
| ObjectIntScatterMap<KType> |
Same as
ObjectIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectLongHashMap<KType> |
A hash map of
Object to long, implemented using open
addressing with linear probing for collision resolution. |
| ObjectLongIdentityHashMap<KType> |
An identity hash map of
Object to long. |
| ObjectLongScatterMap<KType> |
Same as
ObjectLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectObjectHashMap<KType,VType> |
A hash map of
Object to Object, implemented using open
addressing with linear probing for collision resolution. |
| ObjectObjectIdentityHashMap<KType,VType> |
An identity hash map of
Object to Object. |
| ObjectObjectScatterMap<KType,VType> |
Same as
ObjectObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectScatterSet<KType> |
Same as
ObjectHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| ObjectShortHashMap<KType> |
A hash map of
Object to short, implemented using open
addressing with linear probing for collision resolution. |
| ObjectShortIdentityHashMap<KType> |
An identity hash map of
Object to short. |
| ObjectShortScatterMap<KType> |
Same as
ObjectShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ObjectStack<KType> |
A subclass of
ObjectArrayList adding stack-related utility methods. |
| RandomizedHashOrderMixer |
Randomized hash order.
|
| ShortArrayDeque |
An array-backed
ShortDeque. |
| ShortArrayList |
An array-backed list of shorts.
|
| ShortByteHashMap |
A hash map of
short to byte, implemented using open
addressing with linear probing for collision resolution. |
| ShortByteScatterMap |
Same as
ShortByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortCharHashMap |
A hash map of
short to char, implemented using open
addressing with linear probing for collision resolution. |
| ShortCharScatterMap |
Same as
ShortCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortDoubleHashMap |
A hash map of
short to double, implemented using open
addressing with linear probing for collision resolution. |
| ShortDoubleScatterMap |
Same as
ShortDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortFloatHashMap |
A hash map of
short to float, implemented using open
addressing with linear probing for collision resolution. |
| ShortFloatScatterMap |
Same as
ShortFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortHashSet |
A hash set of
shorts, implemented using using open addressing
with linear probing for collision resolution. |
| ShortIntHashMap |
A hash map of
short to int, implemented using open
addressing with linear probing for collision resolution. |
| ShortIntScatterMap |
Same as
ShortIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortLongHashMap |
A hash map of
short to long, implemented using open
addressing with linear probing for collision resolution. |
| ShortLongScatterMap |
Same as
ShortLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortObjectHashMap<VType> |
A hash map of
short to Object, implemented using open
addressing with linear probing for collision resolution. |
| ShortObjectScatterMap<VType> |
Same as
ShortObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortScatterSet |
Same as
ShortHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function. |
| ShortShortHashMap |
A hash map of
short to short, implemented using open
addressing with linear probing for collision resolution. |
| ShortShortScatterMap |
Same as
ShortShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function. |
| ShortStack |
A subclass of
ShortArrayList adding stack-related utility methods. |
| XorShift128P |
A fast pseudo-random number generator.
|
| Enum | Description |
|---|---|
| HashOrderMixing.Strategy |
| Exception | Description |
|---|---|
| BufferAllocationException |
| Annotation Type | Description |
|---|---|
| SuppressForbidden |
Suppresses forbidden-API checks.
|
Copyright © 2015 Carrot Search s.c.. All Rights Reserved.