All Classes Interface Summary Class Summary Enum Summary Exception Summary Annotation Types Summary
| Class |
Description |
| AbstractByteCollection |
Common superclass for collections.
|
| AbstractCharCollection |
Common superclass for collections.
|
| AbstractDoubleCollection |
Common superclass for collections.
|
| AbstractFloatCollection |
Common superclass for collections.
|
| AbstractIntCollection |
Common superclass for collections.
|
| AbstractIntrinsicMethod |
|
| AbstractIterator<E> |
Simplifies the implementation of iterators a bit.
|
| AbstractLongCollection |
Common superclass for collections.
|
| AbstractObjectCollection<KType> |
Common superclass for collections.
|
| AbstractShortCollection |
Common superclass for collections.
|
| Add |
|
| AddSourceMojo |
Adds additional source directories to test or main sources.
|
| AddTestSourceMojo |
Adds additional source directories to test or main sources.
|
| ArraySizingStrategy |
Resizing (growth) strategy for array-backed buffers.
|
| 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.
|
| BitUtil |
A variety of high efficiency bit twiddling routines.
|
| BoundedProportionalArraySizingStrategy |
Array resizing proportional to the current buffer size, optionally kept
within the given minimum and maximum growth limits.
|
| BufferAllocationException |
|
| ByteArrayDeque |
|
| ByteArrayList |
An array-backed list of bytes.
|
| ByteArrayList.ValueIterator |
|
| ByteBufferVisualizer |
Reused buffer visualization routines.
|
| ByteByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteByteCursor |
A cursor over entries of an associative container (byte keys and byte
values).
|
| ByteByteHashMap |
A hash map of byte to byte, implemented using open
addressing with linear probing for collision resolution.
|
| ByteByteMap |
An associative container with unique binding from keys to a single value.
|
| ByteBytePredicate |
A predicate that applies to byte, byte pairs.
|
| ByteByteProcedure |
A procedure that applies to byte, byte pairs.
|
| ByteByteScatterMap |
Same as ByteByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ByteCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteCharCursor |
A cursor over entries of an associative container (byte keys and char
values).
|
| ByteCharHashMap |
A hash map of byte to char, implemented using open
addressing with linear probing for collision resolution.
|
| ByteCharMap |
An associative container with unique binding from keys to a single value.
|
| ByteCharPredicate |
A predicate that applies to byte, char pairs.
|
| ByteCharProcedure |
A procedure that applies to byte, char pairs.
|
| ByteCharScatterMap |
Same as ByteCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ByteCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ByteContainer |
A generic container holding bytes.
|
| ByteCursor |
A cursor over a collection of 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.
|
| ByteDoubleCursor |
A cursor over entries of an associative container (byte keys and double
values).
|
| ByteDoubleHashMap |
A hash map of byte to double, implemented using open
addressing with linear probing for collision resolution.
|
| ByteDoubleMap |
An associative container with unique binding from keys to a single value.
|
| ByteDoublePredicate |
A predicate that applies to byte, double pairs.
|
| ByteDoubleProcedure |
A procedure that applies to byte, double pairs.
|
| ByteDoubleScatterMap |
Same as ByteDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ByteFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteFloatCursor |
A cursor over entries of an associative container (byte keys and float
values).
|
| ByteFloatHashMap |
A hash map of byte to float, implemented using open
addressing with linear probing for collision resolution.
|
| ByteFloatMap |
An associative container with unique binding from keys to a single value.
|
| ByteFloatPredicate |
A predicate that applies to byte, float pairs.
|
| ByteFloatProcedure |
A procedure that applies to byte, float pairs.
|
| 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.
|
| 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.
|
| ByteIntCursor |
A cursor over entries of an associative container (byte keys and int
values).
|
| ByteIntHashMap |
A hash map of byte to int, implemented using open
addressing with linear probing for collision resolution.
|
| ByteIntMap |
An associative container with unique binding from keys to a single value.
|
| ByteIntPredicate |
A predicate that applies to byte, int pairs.
|
| ByteIntProcedure |
A procedure that applies to byte, int pairs.
|
| ByteIntScatterMap |
Same as ByteIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ByteLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteLongCursor |
A cursor over entries of an associative container (byte keys and long
values).
|
| ByteLongHashMap |
A hash map of byte to long, implemented using open
addressing with linear probing for collision resolution.
|
| ByteLongMap |
An associative container with unique binding from keys to a single value.
|
| ByteLongPredicate |
A predicate that applies to byte, long pairs.
|
| ByteLongProcedure |
A procedure that applies to byte, long pairs.
|
| ByteLongScatterMap |
Same as ByteLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| ByteObjectCursor<VType> |
A cursor over entries of an associative container (byte keys and Object
values).
|
| ByteObjectHashMap<VType> |
A hash map of byte to Object, implemented using open
addressing with linear probing for collision resolution.
|
| ByteObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| ByteObjectPredicate<VType> |
A predicate that applies to byte, Object pairs.
|
| ByteObjectProcedure<VType> |
A procedure that applies to byte, Object pairs.
|
| ByteObjectScatterMap<VType> |
Same as ByteObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| BytePredicate |
A predicate that applies to byte objects.
|
| ByteProcedure |
A procedure that applies to byte objects.
|
| ByteScatterSet |
Same as ByteHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| ByteSet |
A set of bytes.
|
| ByteShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ByteShortCursor |
A cursor over entries of an associative container (byte keys and short
values).
|
| ByteShortHashMap |
A hash map of byte to short, implemented using open
addressing with linear probing for collision resolution.
|
| ByteShortMap |
An associative container with unique binding from keys to a single value.
|
| ByteShortPredicate |
A predicate that applies to byte, short pairs.
|
| ByteShortProcedure |
A procedure that applies to byte, short pairs.
|
| 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.
|
| Cast |
|
| Channels |
|
| CharArrayDeque |
|
| CharArrayList |
An array-backed list of chars.
|
| CharArrayList.ValueIterator |
|
| CharBufferVisualizer |
Reused buffer visualization routines.
|
| CharByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharByteCursor |
A cursor over entries of an associative container (char keys and byte
values).
|
| CharByteHashMap |
A hash map of char to byte, implemented using open
addressing with linear probing for collision resolution.
|
| CharByteMap |
An associative container with unique binding from keys to a single value.
|
| CharBytePredicate |
A predicate that applies to char, byte pairs.
|
| CharByteProcedure |
A procedure that applies to char, byte pairs.
|
| CharByteScatterMap |
Same as CharByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| CharCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharCharCursor |
A cursor over entries of an associative container (char keys and char
values).
|
| CharCharHashMap |
A hash map of char to char, implemented using open
addressing with linear probing for collision resolution.
|
| CharCharMap |
An associative container with unique binding from keys to a single value.
|
| CharCharPredicate |
A predicate that applies to char, char pairs.
|
| CharCharProcedure |
A procedure that applies to char, char pairs.
|
| CharCharScatterMap |
Same as CharCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| CharCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| CharContainer |
A generic container holding chars.
|
| CharCursor |
A cursor over a collection of 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.
|
| CharDoubleCursor |
A cursor over entries of an associative container (char keys and double
values).
|
| CharDoubleHashMap |
A hash map of char to double, implemented using open
addressing with linear probing for collision resolution.
|
| CharDoubleMap |
An associative container with unique binding from keys to a single value.
|
| CharDoublePredicate |
A predicate that applies to char, double pairs.
|
| CharDoubleProcedure |
A procedure that applies to char, double pairs.
|
| CharDoubleScatterMap |
Same as CharDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| CharFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharFloatCursor |
A cursor over entries of an associative container (char keys and float
values).
|
| CharFloatHashMap |
A hash map of char to float, implemented using open
addressing with linear probing for collision resolution.
|
| CharFloatMap |
An associative container with unique binding from keys to a single value.
|
| CharFloatPredicate |
A predicate that applies to char, float pairs.
|
| CharFloatProcedure |
A procedure that applies to char, float pairs.
|
| 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.
|
| 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.
|
| CharIntCursor |
A cursor over entries of an associative container (char keys and int
values).
|
| CharIntHashMap |
A hash map of char to int, implemented using open
addressing with linear probing for collision resolution.
|
| CharIntMap |
An associative container with unique binding from keys to a single value.
|
| CharIntPredicate |
A predicate that applies to char, int pairs.
|
| CharIntProcedure |
A procedure that applies to char, int pairs.
|
| CharIntScatterMap |
Same as CharIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| CharLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharLongCursor |
A cursor over entries of an associative container (char keys and long
values).
|
| CharLongHashMap |
A hash map of char to long, implemented using open
addressing with linear probing for collision resolution.
|
| CharLongMap |
An associative container with unique binding from keys to a single value.
|
| CharLongPredicate |
A predicate that applies to char, long pairs.
|
| CharLongProcedure |
A procedure that applies to char, long pairs.
|
| CharLongScatterMap |
Same as CharLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| CharObjectCursor<VType> |
A cursor over entries of an associative container (char keys and Object
values).
|
| CharObjectHashMap<VType> |
A hash map of char to Object, implemented using open
addressing with linear probing for collision resolution.
|
| CharObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| CharObjectPredicate<VType> |
A predicate that applies to char, Object pairs.
|
| CharObjectProcedure<VType> |
A procedure that applies to char, Object pairs.
|
| CharObjectScatterMap<VType> |
Same as CharObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| CharPredicate |
A predicate that applies to char objects.
|
| CharProcedure |
A procedure that applies to char objects.
|
| CharScatterSet |
Same as CharHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| CharSet |
A set of chars.
|
| CharShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| CharShortCursor |
A cursor over entries of an associative container (char keys and short
values).
|
| CharShortHashMap |
A hash map of char to short, implemented using open
addressing with linear probing for collision resolution.
|
| CharShortMap |
An associative container with unique binding from keys to a single value.
|
| CharShortPredicate |
A predicate that applies to char, short pairs.
|
| CharShortProcedure |
A procedure that applies to char, short pairs.
|
| 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 |
|
| DoubleArrayList |
An array-backed list of doubles.
|
| DoubleArrayList.ValueIterator |
|
| DoubleBufferVisualizer |
Reused buffer visualization routines.
|
| DoubleByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleByteCursor |
A cursor over entries of an associative container (double keys and byte
values).
|
| DoubleByteHashMap |
A hash map of double to byte, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleByteMap |
An associative container with unique binding from keys to a single value.
|
| DoubleBytePredicate |
A predicate that applies to double, byte pairs.
|
| DoubleByteProcedure |
A procedure that applies to double, byte pairs.
|
| DoubleByteScatterMap |
Same as DoubleByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| DoubleCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleCharCursor |
A cursor over entries of an associative container (double keys and char
values).
|
| DoubleCharHashMap |
A hash map of double to char, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleCharMap |
An associative container with unique binding from keys to a single value.
|
| DoubleCharPredicate |
A predicate that applies to double, char pairs.
|
| DoubleCharProcedure |
A procedure that applies to double, char pairs.
|
| DoubleCharScatterMap |
Same as DoubleCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| DoubleCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| DoubleContainer |
A generic container holding doubles.
|
| DoubleCursor |
A cursor over a collection of 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.
|
| DoubleDoubleCursor |
A cursor over entries of an associative container (double keys and double
values).
|
| DoubleDoubleHashMap |
A hash map of double to double, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleDoubleMap |
An associative container with unique binding from keys to a single value.
|
| DoubleDoublePredicate |
A predicate that applies to double, double pairs.
|
| DoubleDoubleProcedure |
A procedure that applies to double, double pairs.
|
| DoubleDoubleScatterMap |
Same as DoubleDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| DoubleFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleFloatCursor |
A cursor over entries of an associative container (double keys and float
values).
|
| DoubleFloatHashMap |
A hash map of double to float, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleFloatMap |
An associative container with unique binding from keys to a single value.
|
| DoubleFloatPredicate |
A predicate that applies to double, float pairs.
|
| DoubleFloatProcedure |
A procedure that applies to double, float pairs.
|
| 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.
|
| 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.
|
| DoubleIntCursor |
A cursor over entries of an associative container (double keys and int
values).
|
| DoubleIntHashMap |
A hash map of double to int, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleIntMap |
An associative container with unique binding from keys to a single value.
|
| DoubleIntPredicate |
A predicate that applies to double, int pairs.
|
| DoubleIntProcedure |
A procedure that applies to double, int pairs.
|
| DoubleIntScatterMap |
Same as DoubleIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| DoubleLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleLongCursor |
A cursor over entries of an associative container (double keys and long
values).
|
| DoubleLongHashMap |
A hash map of double to long, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleLongMap |
An associative container with unique binding from keys to a single value.
|
| DoubleLongPredicate |
A predicate that applies to double, long pairs.
|
| DoubleLongProcedure |
A procedure that applies to double, long pairs.
|
| DoubleLongScatterMap |
Same as DoubleLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| DoubleObjectCursor<VType> |
A cursor over entries of an associative container (double keys and Object
values).
|
| DoubleObjectHashMap<VType> |
A hash map of double to Object, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| DoubleObjectPredicate<VType> |
A predicate that applies to double, Object pairs.
|
| DoubleObjectProcedure<VType> |
A procedure that applies to double, Object pairs.
|
| DoubleObjectScatterMap<VType> |
Same as DoubleObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| DoublePredicate |
A predicate that applies to double objects.
|
| DoubleProcedure |
A procedure that applies to double objects.
|
| DoubleScatterSet |
Same as DoubleHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| DoubleSet |
A set of doubles.
|
| DoubleShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| DoubleShortCursor |
A cursor over entries of an associative container (double keys and short
values).
|
| DoubleShortHashMap |
A hash map of double to short, implemented using open
addressing with linear probing for collision resolution.
|
| DoubleShortMap |
An associative container with unique binding from keys to a single value.
|
| DoubleShortPredicate |
A predicate that applies to double, short pairs.
|
| DoubleShortProcedure |
A procedure that applies to double, short pairs.
|
| DoubleShortScatterMap |
Same as DoubleShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| DoubleStack |
|
| Empty |
|
| Equals |
|
| FloatArrayDeque |
|
| FloatArrayList |
An array-backed list of floats.
|
| FloatArrayList.ValueIterator |
|
| FloatBufferVisualizer |
Reused buffer visualization routines.
|
| FloatByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatByteCursor |
A cursor over entries of an associative container (float keys and byte
values).
|
| FloatByteHashMap |
A hash map of float to byte, implemented using open
addressing with linear probing for collision resolution.
|
| FloatByteMap |
An associative container with unique binding from keys to a single value.
|
| FloatBytePredicate |
A predicate that applies to float, byte pairs.
|
| FloatByteProcedure |
A procedure that applies to float, byte pairs.
|
| FloatByteScatterMap |
Same as FloatByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| FloatCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatCharCursor |
A cursor over entries of an associative container (float keys and char
values).
|
| FloatCharHashMap |
A hash map of float to char, implemented using open
addressing with linear probing for collision resolution.
|
| FloatCharMap |
An associative container with unique binding from keys to a single value.
|
| FloatCharPredicate |
A predicate that applies to float, char pairs.
|
| FloatCharProcedure |
A procedure that applies to float, char pairs.
|
| FloatCharScatterMap |
Same as FloatCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| FloatCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| FloatContainer |
A generic container holding floats.
|
| FloatCursor |
A cursor over a collection of 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.
|
| FloatDoubleCursor |
A cursor over entries of an associative container (float keys and double
values).
|
| FloatDoubleHashMap |
A hash map of float to double, implemented using open
addressing with linear probing for collision resolution.
|
| FloatDoubleMap |
An associative container with unique binding from keys to a single value.
|
| FloatDoublePredicate |
A predicate that applies to float, double pairs.
|
| FloatDoubleProcedure |
A procedure that applies to float, double pairs.
|
| FloatDoubleScatterMap |
Same as FloatDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| FloatFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatFloatCursor |
A cursor over entries of an associative container (float keys and float
values).
|
| FloatFloatHashMap |
A hash map of float to float, implemented using open
addressing with linear probing for collision resolution.
|
| FloatFloatMap |
An associative container with unique binding from keys to a single value.
|
| FloatFloatPredicate |
A predicate that applies to float, float pairs.
|
| FloatFloatProcedure |
A procedure that applies to float, float pairs.
|
| 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.
|
| 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.
|
| FloatIntCursor |
A cursor over entries of an associative container (float keys and int
values).
|
| FloatIntHashMap |
A hash map of float to int, implemented using open
addressing with linear probing for collision resolution.
|
| FloatIntMap |
An associative container with unique binding from keys to a single value.
|
| FloatIntPredicate |
A predicate that applies to float, int pairs.
|
| FloatIntProcedure |
A procedure that applies to float, int pairs.
|
| FloatIntScatterMap |
Same as FloatIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| FloatLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatLongCursor |
A cursor over entries of an associative container (float keys and long
values).
|
| FloatLongHashMap |
A hash map of float to long, implemented using open
addressing with linear probing for collision resolution.
|
| FloatLongMap |
An associative container with unique binding from keys to a single value.
|
| FloatLongPredicate |
A predicate that applies to float, long pairs.
|
| FloatLongProcedure |
A procedure that applies to float, long pairs.
|
| FloatLongScatterMap |
Same as FloatLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| FloatObjectCursor<VType> |
A cursor over entries of an associative container (float keys and Object
values).
|
| FloatObjectHashMap<VType> |
A hash map of float to Object, implemented using open
addressing with linear probing for collision resolution.
|
| FloatObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| FloatObjectPredicate<VType> |
A predicate that applies to float, Object pairs.
|
| FloatObjectProcedure<VType> |
A procedure that applies to float, Object pairs.
|
| FloatObjectScatterMap<VType> |
Same as FloatObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| FloatPredicate |
A predicate that applies to float objects.
|
| FloatProcedure |
A procedure that applies to float objects.
|
| FloatScatterSet |
Same as FloatHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| FloatSet |
A set of floats.
|
| FloatShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| FloatShortCursor |
A cursor over entries of an associative container (float keys and short
values).
|
| FloatShortHashMap |
A hash map of float to short, implemented using open
addressing with linear probing for collision resolution.
|
| FloatShortMap |
An associative container with unique binding from keys to a single value.
|
| FloatShortPredicate |
A predicate that applies to float, short pairs.
|
| FloatShortProcedure |
A procedure that applies to float, short pairs.
|
| FloatShortScatterMap |
Same as FloatShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| FloatStack |
|
| HashContainers |
|
| HashOrderMixing |
|
| 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.
|
| HelpMojo |
Display help information on hppc-template-processor.
Call mvn hppc-template-processor:help -Ddetail=true -Dgoal=<goal-name> to display parameter details.
|
| IndirectComparator |
Compare objects at two given indices and return the result of their
comparison consistent with Comparator's contract.
|
| IndirectComparator.AscendingDoubleComparator |
A natural-order comparator for doubles.
|
| IndirectComparator.AscendingFloatComparator |
A natural-order comparator for floats.
|
| IndirectComparator.AscendingIntComparator |
A natural-order comparator for integers.
|
| IndirectComparator.AscendingShortComparator |
A natural-order comparator for integers.
|
| IndirectComparator.DelegatingComparator<T> |
A delegating comparator for object types.
|
| IndirectComparator.DescendingDoubleComparator |
A reverse-order comparator for doubles.
|
| IndirectComparator.DescendingFloatComparator |
A reverse-order comparator for floats.
|
| IndirectComparator.DescendingIntComparator |
A reverse-order comparator for integers.
|
| IndirectComparator.DescendingShortComparator |
A reverse-order comparator for shorts.
|
| IndirectSort |
Sorting routines that return an array of sorted indices implied by a given
comparator rather than move elements of whatever the comparator is using for
comparisons.
|
| IntArrayDeque |
|
| IntArrayList |
An array-backed list of ints.
|
| IntArrayList.ValueIterator |
|
| IntBufferVisualizer |
Reused buffer visualization routines.
|
| IntByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntByteCursor |
A cursor over entries of an associative container (int keys and byte
values).
|
| IntByteHashMap |
A hash map of int to byte, implemented using open
addressing with linear probing for collision resolution.
|
| IntByteMap |
An associative container with unique binding from keys to a single value.
|
| IntBytePredicate |
A predicate that applies to int, byte pairs.
|
| IntByteProcedure |
A procedure that applies to int, byte pairs.
|
| IntByteScatterMap |
Same as IntByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| IntCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntCharCursor |
A cursor over entries of an associative container (int keys and char
values).
|
| IntCharHashMap |
A hash map of int to char, implemented using open
addressing with linear probing for collision resolution.
|
| IntCharMap |
An associative container with unique binding from keys to a single value.
|
| IntCharPredicate |
A predicate that applies to int, char pairs.
|
| IntCharProcedure |
A procedure that applies to int, char pairs.
|
| IntCharScatterMap |
Same as IntCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| IntCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| IntContainer |
A generic container holding ints.
|
| IntCursor |
A cursor over a collection of 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.
|
| IntDoubleCursor |
A cursor over entries of an associative container (int keys and double
values).
|
| IntDoubleHashMap |
A hash map of int to double, implemented using open
addressing with linear probing for collision resolution.
|
| IntDoubleMap |
An associative container with unique binding from keys to a single value.
|
| IntDoublePredicate |
A predicate that applies to int, double pairs.
|
| IntDoubleProcedure |
A procedure that applies to int, double pairs.
|
| IntDoubleScatterMap |
Same as IntDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| IntFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntFloatCursor |
A cursor over entries of an associative container (int keys and float
values).
|
| IntFloatHashMap |
A hash map of int to float, implemented using open
addressing with linear probing for collision resolution.
|
| IntFloatMap |
An associative container with unique binding from keys to a single value.
|
| IntFloatPredicate |
A predicate that applies to int, float pairs.
|
| IntFloatProcedure |
A procedure that applies to int, float pairs.
|
| 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.
|
| 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.
|
| IntIntCursor |
A cursor over entries of an associative container (int keys and int
values).
|
| IntIntHashMap |
A hash map of int to int, implemented using open
addressing with linear probing for collision resolution.
|
| IntIntMap |
An associative container with unique binding from keys to a single value.
|
| IntIntPredicate |
A predicate that applies to int, int pairs.
|
| IntIntProcedure |
A procedure that applies to int, int pairs.
|
| IntIntScatterMap |
Same as IntIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| IntLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntLongCursor |
A cursor over entries of an associative container (int keys and long
values).
|
| IntLongHashMap |
A hash map of int to long, implemented using open
addressing with linear probing for collision resolution.
|
| IntLongMap |
An associative container with unique binding from keys to a single value.
|
| IntLongPredicate |
A predicate that applies to int, long pairs.
|
| IntLongProcedure |
A procedure that applies to int, long pairs.
|
| IntLongScatterMap |
Same as IntLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| IntObjectCursor<VType> |
A cursor over entries of an associative container (int keys and Object
values).
|
| IntObjectHashMap<VType> |
A hash map of int to Object, implemented using open
addressing with linear probing for collision resolution.
|
| IntObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| IntObjectPredicate<VType> |
A predicate that applies to int, Object pairs.
|
| IntObjectProcedure<VType> |
A procedure that applies to int, Object pairs.
|
| IntObjectScatterMap<VType> |
Same as IntObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| IntPredicate |
A predicate that applies to int objects.
|
| IntProcedure |
A procedure that applies to int objects.
|
| IntrinsicMethod |
Intrinsic method invocation.
|
| Intrinsics |
Intrinsic methods that are fully functional for the source templates
(generic) and are replaced with low-level corresponding equivalents for the
generated primitive types.
|
| Intrinsics.EqualityFunction |
|
| Intrinsics.KeyHasher<T> |
Anything that distributes keys by their hash value.
|
| IntScatterSet |
Same as IntHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| IntSet |
A set of ints.
|
| IntShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| IntShortCursor |
A cursor over entries of an associative container (int keys and short
values).
|
| IntShortHashMap |
A hash map of int to short, implemented using open
addressing with linear probing for collision resolution.
|
| IntShortMap |
An associative container with unique binding from keys to a single value.
|
| IntShortPredicate |
A predicate that applies to int, short pairs.
|
| IntShortProcedure |
A procedure that applies to int, short pairs.
|
| 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.
|
| IsEmpty |
|
| Java7Lexer |
|
| Java7Parser |
|
| Java7Parser.AnnotationConstantRestContext |
|
| Java7Parser.AnnotationContext |
|
| Java7Parser.AnnotationMethodOrConstantRestContext |
|
| Java7Parser.AnnotationMethodRestContext |
|
| Java7Parser.AnnotationNameContext |
|
| Java7Parser.AnnotationTypeBodyContext |
|
| Java7Parser.AnnotationTypeDeclarationContext |
|
| Java7Parser.AnnotationTypeElementDeclarationContext |
|
| Java7Parser.AnnotationTypeElementRestContext |
|
| Java7Parser.ArgumentsContext |
|
| Java7Parser.ArrayCreatorRestContext |
|
| Java7Parser.ArrayInitializerContext |
|
| Java7Parser.BlockContext |
|
| Java7Parser.BlockStatementContext |
|
| Java7Parser.CatchClauseContext |
|
| Java7Parser.CatchTypeContext |
|
| Java7Parser.ClassBodyContext |
|
| Java7Parser.ClassBodyDeclarationContext |
|
| Java7Parser.ClassCreatorRestContext |
|
| Java7Parser.ClassDeclarationContext |
|
| Java7Parser.ClassOrInterfaceModifierContext |
|
| Java7Parser.ClassOrInterfaceTypeContext |
|
| Java7Parser.CompilationUnitContext |
|
| Java7Parser.ConstantDeclaratorContext |
|
| Java7Parser.ConstantExpressionContext |
|
| Java7Parser.ConstDeclarationContext |
|
| Java7Parser.ConstructorBodyContext |
|
| Java7Parser.ConstructorDeclarationContext |
|
| Java7Parser.CreatedNameContext |
|
| Java7Parser.CreatorContext |
|
| Java7Parser.DefaultValueContext |
|
| Java7Parser.ElementValueArrayInitializerContext |
|
| Java7Parser.ElementValueContext |
|
| Java7Parser.ElementValuePairContext |
|
| Java7Parser.ElementValuePairsContext |
|
| Java7Parser.EnhancedForControlContext |
|
| Java7Parser.EnumBodyDeclarationsContext |
|
| Java7Parser.EnumConstantContext |
|
| Java7Parser.EnumConstantNameContext |
|
| Java7Parser.EnumConstantsContext |
|
| Java7Parser.EnumDeclarationContext |
|
| Java7Parser.ExplicitGenericInvocationContext |
|
| Java7Parser.ExplicitGenericInvocationSuffixContext |
|
| Java7Parser.ExpressionContext |
|
| Java7Parser.ExpressionListContext |
|
| Java7Parser.FieldDeclarationContext |
|
| Java7Parser.FinallyBlockContext |
|
| Java7Parser.ForControlContext |
|
| Java7Parser.ForInitContext |
|
| Java7Parser.FormalParameterContext |
|
| Java7Parser.FormalParameterListContext |
|
| Java7Parser.FormalParametersContext |
|
| Java7Parser.ForUpdateContext |
|
| Java7Parser.GenericConstructorDeclarationContext |
|
| Java7Parser.GenericInterfaceMethodDeclarationContext |
|
| Java7Parser.GenericMethodDeclarationContext |
|
| Java7Parser.IdentifierTypeOrDiamondPairContext |
|
| Java7Parser.IdentifierTypePairContext |
|
| Java7Parser.ImportDeclarationContext |
|
| Java7Parser.InnerCreatorContext |
|
| Java7Parser.InterfaceBodyContext |
|
| Java7Parser.InterfaceBodyDeclarationContext |
|
| Java7Parser.InterfaceDeclarationContext |
|
| Java7Parser.InterfaceMemberDeclarationContext |
|
| Java7Parser.InterfaceMethodDeclarationContext |
|
| Java7Parser.LastFormalParameterContext |
|
| Java7Parser.LiteralContext |
|
| Java7Parser.LocalVariableDeclarationContext |
|
| Java7Parser.LocalVariableDeclarationStatementContext |
|
| Java7Parser.MemberDeclarationContext |
|
| Java7Parser.MethodBodyContext |
|
| Java7Parser.MethodDeclarationContext |
|
| Java7Parser.ModifierContext |
|
| Java7Parser.NonWildcardTypeArgumentsContext |
|
| Java7Parser.NonWildcardTypeArgumentsOrDiamondContext |
|
| Java7Parser.PackageDeclarationContext |
|
| Java7Parser.ParExpressionContext |
|
| Java7Parser.PrimaryContext |
|
| Java7Parser.PrimitiveTypeContext |
|
| Java7Parser.QualifiedNameContext |
|
| Java7Parser.QualifiedNameListContext |
|
| Java7Parser.ResourceContext |
|
| Java7Parser.ResourcesContext |
|
| Java7Parser.ResourceSpecificationContext |
|
| Java7Parser.StatementContext |
|
| Java7Parser.StatementExpressionContext |
|
| Java7Parser.SuperSuffixContext |
|
| Java7Parser.SwitchBlockStatementGroupContext |
|
| Java7Parser.SwitchLabelContext |
|
| Java7Parser.TypeArgumentContext |
|
| Java7Parser.TypeArgumentsContext |
|
| Java7Parser.TypeArgumentsOrDiamondContext |
|
| Java7Parser.TypeBoundContext |
|
| Java7Parser.TypeContext |
|
| Java7Parser.TypeDeclarationContext |
|
| Java7Parser.TypeListContext |
|
| Java7Parser.TypeParameterContext |
|
| Java7Parser.TypeParametersContext |
|
| Java7Parser.VariableDeclaratorContext |
|
| Java7Parser.VariableDeclaratorIdContext |
|
| Java7Parser.VariableDeclaratorsContext |
|
| Java7Parser.VariableInitializerContext |
|
| Java7Parser.VariableModifierContext |
|
| Java7ParserBaseListener |
This class provides an empty implementation of Java7ParserListener,
which can be extended to create a listener which only needs to handle a subset
of the available methods.
|
| Java7ParserBaseVisitor<T> |
This class provides an empty implementation of Java7ParserVisitor,
which can be extended to create a visitor which only needs to handle a subset
of the available methods.
|
| Java7ParserListener |
This interface defines a complete listener for a parse tree produced by
Java7Parser.
|
| Java7ParserVisitor<T> |
This interface defines a complete generic visitor for a parse tree produced
by Java7Parser.
|
| LongArrayDeque |
|
| LongArrayList |
An array-backed list of longs.
|
| LongArrayList.ValueIterator |
|
| LongBufferVisualizer |
Reused buffer visualization routines.
|
| LongByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongByteCursor |
A cursor over entries of an associative container (long keys and byte
values).
|
| LongByteHashMap |
A hash map of long to byte, implemented using open
addressing with linear probing for collision resolution.
|
| LongByteMap |
An associative container with unique binding from keys to a single value.
|
| LongBytePredicate |
A predicate that applies to long, byte pairs.
|
| LongByteProcedure |
A procedure that applies to long, byte pairs.
|
| LongByteScatterMap |
Same as LongByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| LongCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongCharCursor |
A cursor over entries of an associative container (long keys and char
values).
|
| LongCharHashMap |
A hash map of long to char, implemented using open
addressing with linear probing for collision resolution.
|
| LongCharMap |
An associative container with unique binding from keys to a single value.
|
| LongCharPredicate |
A predicate that applies to long, char pairs.
|
| LongCharProcedure |
A procedure that applies to long, char pairs.
|
| LongCharScatterMap |
Same as LongCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| LongCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| LongContainer |
A generic container holding longs.
|
| LongCursor |
A cursor over a collection of 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.
|
| LongDoubleCursor |
A cursor over entries of an associative container (long keys and double
values).
|
| LongDoubleHashMap |
A hash map of long to double, implemented using open
addressing with linear probing for collision resolution.
|
| LongDoubleMap |
An associative container with unique binding from keys to a single value.
|
| LongDoublePredicate |
A predicate that applies to long, double pairs.
|
| LongDoubleProcedure |
A procedure that applies to long, double pairs.
|
| LongDoubleScatterMap |
Same as LongDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| LongFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongFloatCursor |
A cursor over entries of an associative container (long keys and float
values).
|
| LongFloatHashMap |
A hash map of long to float, implemented using open
addressing with linear probing for collision resolution.
|
| LongFloatMap |
An associative container with unique binding from keys to a single value.
|
| LongFloatPredicate |
A predicate that applies to long, float pairs.
|
| LongFloatProcedure |
A procedure that applies to long, float pairs.
|
| 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.
|
| 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.
|
| LongIntCursor |
A cursor over entries of an associative container (long keys and int
values).
|
| LongIntHashMap |
A hash map of long to int, implemented using open
addressing with linear probing for collision resolution.
|
| LongIntMap |
An associative container with unique binding from keys to a single value.
|
| LongIntPredicate |
A predicate that applies to long, int pairs.
|
| LongIntProcedure |
A procedure that applies to long, int pairs.
|
| LongIntScatterMap |
Same as LongIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| LongLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongLongCursor |
A cursor over entries of an associative container (long keys and long
values).
|
| LongLongHashMap |
A hash map of long to long, implemented using open
addressing with linear probing for collision resolution.
|
| LongLongMap |
An associative container with unique binding from keys to a single value.
|
| LongLongPredicate |
A predicate that applies to long, long pairs.
|
| LongLongProcedure |
A procedure that applies to long, long pairs.
|
| LongLongScatterMap |
Same as LongLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| LongObjectCursor<VType> |
A cursor over entries of an associative container (long keys and Object
values).
|
| LongObjectHashMap<VType> |
A hash map of long to Object, implemented using open
addressing with linear probing for collision resolution.
|
| LongObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| LongObjectPredicate<VType> |
A predicate that applies to long, Object pairs.
|
| LongObjectProcedure<VType> |
A procedure that applies to long, Object pairs.
|
| LongObjectScatterMap<VType> |
Same as LongObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| LongPredicate |
A predicate that applies to long objects.
|
| LongProcedure |
A procedure that applies to long objects.
|
| LongScatterSet |
Same as LongHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| LongSet |
A set of longs.
|
| LongShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| LongShortCursor |
A cursor over entries of an associative container (long keys and short
values).
|
| LongShortHashMap |
A hash map of long to short, implemented using open
addressing with linear probing for collision resolution.
|
| LongShortMap |
An associative container with unique binding from keys to a single value.
|
| LongShortPredicate |
A predicate that applies to long, short pairs.
|
| LongShortProcedure |
A procedure that applies to long, short pairs.
|
| 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.
|
| NewArray |
|
| ObjectArrayDeque<KType> |
|
| ObjectArrayList<KType> |
An array-backed list of Objects.
|
| ObjectArrayList.ValueIterator<KType> |
|
| ObjectBufferVisualizer<KType> |
Reused buffer visualization routines.
|
| ObjectByteAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectByteCursor<KType> |
A cursor over entries of an associative container (Object keys and byte
values).
|
| 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.
|
| ObjectByteMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectBytePredicate<KType> |
A predicate that applies to Object, byte pairs.
|
| ObjectByteProcedure<KType> |
A procedure that applies to Object, byte pairs.
|
| ObjectByteScatterMap<KType> |
Same as ObjectByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ObjectCharAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectCharCursor<KType> |
A cursor over entries of an associative container (Object keys and char
values).
|
| 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.
|
| ObjectCharMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectCharPredicate<KType> |
A predicate that applies to Object, char pairs.
|
| ObjectCharProcedure<KType> |
A procedure that applies to Object, char pairs.
|
| ObjectCharScatterMap<KType> |
Same as ObjectCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ObjectCollection<KType> |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ObjectContainer<KType> |
A generic container holding Objects.
|
| ObjectCursor<KType> |
A cursor over a collection of 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.
|
| ObjectDoubleCursor<KType> |
A cursor over entries of an associative container (Object keys and double
values).
|
| 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.
|
| ObjectDoubleMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectDoublePredicate<KType> |
A predicate that applies to Object, double pairs.
|
| ObjectDoubleProcedure<KType> |
A procedure that applies to Object, double pairs.
|
| ObjectDoubleScatterMap<KType> |
Same as ObjectDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ObjectFloatAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectFloatCursor<KType> |
A cursor over entries of an associative container (Object keys and float
values).
|
| 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.
|
| ObjectFloatMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectFloatPredicate<KType> |
A predicate that applies to Object, float pairs.
|
| ObjectFloatProcedure<KType> |
A procedure that applies to Object, float pairs.
|
| 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.
|
| 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.
|
| ObjectIntCursor<KType> |
A cursor over entries of an associative container (Object keys and int
values).
|
| 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.
|
| ObjectIntMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectIntPredicate<KType> |
A predicate that applies to Object, int pairs.
|
| ObjectIntProcedure<KType> |
A procedure that applies to Object, int pairs.
|
| ObjectIntScatterMap<KType> |
Same as ObjectIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ObjectLongAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectLongCursor<KType> |
A cursor over entries of an associative container (Object keys and long
values).
|
| 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.
|
| ObjectLongMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectLongPredicate<KType> |
A predicate that applies to Object, long pairs.
|
| ObjectLongProcedure<KType> |
A procedure that applies to Object, long pairs.
|
| ObjectLongScatterMap<KType> |
Same as ObjectLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| ObjectObjectCursor<KType,VType> |
A cursor over entries of an associative container (Object keys and Object
values).
|
| 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.
|
| ObjectObjectMap<KType,VType> |
An associative container with unique binding from keys to a single value.
|
| ObjectObjectPredicate<KType,VType> |
A predicate that applies to Object, Object pairs.
|
| ObjectObjectProcedure<KType,VType> |
A procedure that applies to Object, Object pairs.
|
| ObjectObjectScatterMap<KType,VType> |
Same as ObjectObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ObjectPredicate<KType> |
A predicate that applies to Object objects.
|
| ObjectProcedure<KType> |
A procedure that applies to Object objects.
|
| ObjectScatterSet<KType> |
Same as ObjectHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| ObjectSet<KType> |
A set of Objects.
|
| ObjectShortAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
| ObjectShortCursor<KType> |
A cursor over entries of an associative container (Object keys and short
values).
|
| 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.
|
| ObjectShortMap<KType> |
An associative container with unique binding from keys to a single value.
|
| ObjectShortPredicate<KType> |
A predicate that applies to Object, short pairs.
|
| ObjectShortProcedure<KType> |
A procedure that applies to Object, short pairs.
|
| ObjectShortScatterMap<KType> |
Same as ObjectShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ObjectStack<KType> |
|
| OutputFile |
|
| Preallocable |
Anything that can preallocate buffers given prior knowledge of the number of
stored elements.
|
| RandomizedHashOrderMixer |
Randomized hash order.
|
| Replacement |
|
| ShortArrayDeque |
|
| ShortArrayList |
An array-backed list of shorts.
|
| ShortArrayList.ValueIterator |
|
| ShortBufferVisualizer |
Reused buffer visualization routines.
|
| ShortByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortByteCursor |
A cursor over entries of an associative container (short keys and byte
values).
|
| ShortByteHashMap |
A hash map of short to byte, implemented using open
addressing with linear probing for collision resolution.
|
| ShortByteMap |
An associative container with unique binding from keys to a single value.
|
| ShortBytePredicate |
A predicate that applies to short, byte pairs.
|
| ShortByteProcedure |
A procedure that applies to short, byte pairs.
|
| ShortByteScatterMap |
Same as ShortByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ShortCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortCharCursor |
A cursor over entries of an associative container (short keys and char
values).
|
| ShortCharHashMap |
A hash map of short to char, implemented using open
addressing with linear probing for collision resolution.
|
| ShortCharMap |
An associative container with unique binding from keys to a single value.
|
| ShortCharPredicate |
A predicate that applies to short, char pairs.
|
| ShortCharProcedure |
A procedure that applies to short, char pairs.
|
| ShortCharScatterMap |
Same as ShortCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ShortCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
| ShortContainer |
A generic container holding shorts.
|
| ShortCursor |
A cursor over a collection of 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.
|
| ShortDoubleCursor |
A cursor over entries of an associative container (short keys and double
values).
|
| ShortDoubleHashMap |
A hash map of short to double, implemented using open
addressing with linear probing for collision resolution.
|
| ShortDoubleMap |
An associative container with unique binding from keys to a single value.
|
| ShortDoublePredicate |
A predicate that applies to short, double pairs.
|
| ShortDoubleProcedure |
A procedure that applies to short, double pairs.
|
| ShortDoubleScatterMap |
Same as ShortDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ShortFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortFloatCursor |
A cursor over entries of an associative container (short keys and float
values).
|
| ShortFloatHashMap |
A hash map of short to float, implemented using open
addressing with linear probing for collision resolution.
|
| ShortFloatMap |
An associative container with unique binding from keys to a single value.
|
| ShortFloatPredicate |
A predicate that applies to short, float pairs.
|
| ShortFloatProcedure |
A procedure that applies to short, float pairs.
|
| 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.
|
| 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.
|
| ShortIntCursor |
A cursor over entries of an associative container (short keys and int
values).
|
| ShortIntHashMap |
A hash map of short to int, implemented using open
addressing with linear probing for collision resolution.
|
| ShortIntMap |
An associative container with unique binding from keys to a single value.
|
| ShortIntPredicate |
A predicate that applies to short, int pairs.
|
| ShortIntProcedure |
A procedure that applies to short, int pairs.
|
| ShortIntScatterMap |
Same as ShortIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ShortLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortLongCursor |
A cursor over entries of an associative container (short keys and long
values).
|
| ShortLongHashMap |
A hash map of short to long, implemented using open
addressing with linear probing for collision resolution.
|
| ShortLongMap |
An associative container with unique binding from keys to a single value.
|
| ShortLongPredicate |
A predicate that applies to short, long pairs.
|
| ShortLongProcedure |
A procedure that applies to short, long pairs.
|
| ShortLongScatterMap |
Same as ShortLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| 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.
|
| ShortObjectCursor<VType> |
A cursor over entries of an associative container (short keys and Object
values).
|
| ShortObjectHashMap<VType> |
A hash map of short to Object, implemented using open
addressing with linear probing for collision resolution.
|
| ShortObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
| ShortObjectPredicate<VType> |
A predicate that applies to short, Object pairs.
|
| ShortObjectProcedure<VType> |
A procedure that applies to short, Object pairs.
|
| ShortObjectScatterMap<VType> |
Same as ShortObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ShortPredicate |
A predicate that applies to short objects.
|
| ShortProcedure |
A procedure that applies to short objects.
|
| ShortScatterSet |
Same as ShortHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
| ShortSet |
A set of shorts.
|
| ShortShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
| ShortShortCursor |
A cursor over entries of an associative container (short keys and short
values).
|
| ShortShortHashMap |
A hash map of short to short, implemented using open
addressing with linear probing for collision resolution.
|
| ShortShortMap |
An associative container with unique binding from keys to a single value.
|
| ShortShortPredicate |
A predicate that applies to short, short pairs.
|
| ShortShortProcedure |
A procedure that applies to short, short pairs.
|
| ShortShortScatterMap |
Same as ShortShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
| ShortStack |
|
| SignatureProcessor |
|
| SignatureReplacementVisitor |
|
| SignatureReplacementVisitor.TypeBound |
|
| SuppressForbidden |
Suppresses forbidden-API checks.
|
| TemplateFile |
|
| TemplateOptions |
Template options for velocity directives in templates.
|
| TemplateProcessorMojo |
Maven mojo applying preprocessor templates.
|
| Type |
|
| XorShift128P |
A fast pseudo-random number generator.
|