All Classes and Interfaces
Class
Description
Common superclass for collections.
Common superclass for collections.
Common superclass for collections.
Common superclass for collections.
Common superclass for collections.
Simplifies the implementation of iterators a bit.
Common superclass for collections.
Common superclass for collections.
Common superclass for collections.
Adds additional source directories to test or main sources.
Adds additional source directories to test or main sources.
Resizing (growth) strategy for array-backed buffers.
Bit mixing utilities.
An "open" BitSet implementation that allows direct access to the array of words storing
the bits.
An iterator to iterate over set bits in an BitSet.
A variety of high efficiency bit twiddling routines.
Array resizing proportional to the current buffer size, optionally kept
within the given minimum and maximum growth limits.
An array-backed
ByteDeque
.An array-backed list of bytes.
An iterator implementation for
ByteArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and byte
values).
A hash map of
byte
to byte
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, byte
pairs.A procedure that applies to
byte
, byte
pairs.Same as
ByteByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and char
values).
A hash map of
byte
to char
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, char
pairs.A procedure that applies to
byte
, char
pairs.Same as
ByteCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
byte
s.A cursor over a collection of
bytes
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and double
values).
A hash map of
byte
to double
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, double
pairs.A procedure that applies to
byte
, double
pairs.Same as
ByteDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and float
values).
A hash map of
byte
to float
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, float
pairs.A procedure that applies to
byte
, float
pairs.Same as
ByteFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
byte
s, implemented using using open addressing
with linear probing for collision resolution.An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and int
values).
A hash map of
byte
to int
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, int
pairs.A procedure that applies to
byte
, int
pairs.Same as
ByteIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and long
values).
A hash map of
byte
to long
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, long
pairs.A procedure that applies to
byte
, long
pairs.Same as
ByteLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and Object
values).
A hash map of
byte
to Object
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, Object
pairs.A procedure that applies to
byte
, Object
pairs.Same as
ByteObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
byte
objects.A procedure that applies to
byte
objects.Same as
ByteHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
byte
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (byte keys and short
values).
A hash map of
byte
to short
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
byte
, short
pairs.A procedure that applies to
byte
, short
pairs.Same as
ByteShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
ByteArrayList
adding stack-related utility methods.An array-backed
CharDeque
.An array-backed list of chars.
An iterator implementation for
CharArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and byte
values).
A hash map of
char
to byte
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, byte
pairs.A procedure that applies to
char
, byte
pairs.Same as
CharByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and char
values).
A hash map of
char
to char
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, char
pairs.A procedure that applies to
char
, char
pairs.Same as
CharCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
char
s.A cursor over a collection of
chars
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and double
values).
A hash map of
char
to double
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, double
pairs.A procedure that applies to
char
, double
pairs.Same as
CharDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and float
values).
A hash map of
char
to float
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, float
pairs.A procedure that applies to
char
, float
pairs.Same as
CharFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
char
s, implemented using using open addressing
with linear probing for collision resolution.An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and int
values).
A hash map of
char
to int
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, int
pairs.A procedure that applies to
char
, int
pairs.Same as
CharIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and long
values).
A hash map of
char
to long
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, long
pairs.A procedure that applies to
char
, long
pairs.Same as
CharLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and Object
values).
A hash map of
char
to Object
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, Object
pairs.A procedure that applies to
char
, Object
pairs.Same as
CharObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
char
objects.A procedure that applies to
char
objects.Same as
CharHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
char
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (char keys and short
values).
A hash map of
char
to short
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
char
, short
pairs.A procedure that applies to
char
, short
pairs.Same as
CharShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
CharArrayList
adding stack-related utility methods.Constants used as defaults in containers.
An array-backed
DoubleDeque
.An array-backed list of doubles.
An iterator implementation for
DoubleArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and byte
values).
A hash map of
double
to byte
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, byte
pairs.A procedure that applies to
double
, byte
pairs.Same as
DoubleByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and char
values).
A hash map of
double
to char
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, char
pairs.A procedure that applies to
double
, char
pairs.Same as
DoubleCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
double
s.A cursor over a collection of
doubles
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and double
values).
A hash map of
double
to double
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, double
pairs.A procedure that applies to
double
, double
pairs.Same as
DoubleDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and float
values).
A hash map of
double
to float
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, float
pairs.A procedure that applies to
double
, float
pairs.Same as
DoubleFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
double
s, implemented using using open addressing
with linear probing for collision resolution.An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and int
values).
A hash map of
double
to int
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, int
pairs.A procedure that applies to
double
, int
pairs.Same as
DoubleIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and long
values).
A hash map of
double
to long
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, long
pairs.A procedure that applies to
double
, long
pairs.Same as
DoubleLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and Object
values).
A hash map of
double
to Object
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, Object
pairs.A procedure that applies to
double
, Object
pairs.Same as
DoubleObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
double
objects.A procedure that applies to
double
objects.Same as
DoubleHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
double
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (double keys and short
values).
A hash map of
double
to short
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
double
, short
pairs.A procedure that applies to
double
, short
pairs.Same as
DoubleShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
DoubleArrayList
adding stack-related utility methods.An array-backed
FloatDeque
.An array-backed list of floats.
An iterator implementation for
FloatArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and byte
values).
A hash map of
float
to byte
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, byte
pairs.A procedure that applies to
float
, byte
pairs.Same as
FloatByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and char
values).
A hash map of
float
to char
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, char
pairs.A procedure that applies to
float
, char
pairs.Same as
FloatCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
float
s.A cursor over a collection of
floats
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and double
values).
A hash map of
float
to double
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, double
pairs.A procedure that applies to
float
, double
pairs.Same as
FloatDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and float
values).
A hash map of
float
to float
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, float
pairs.A procedure that applies to
float
, float
pairs.Same as
FloatFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
float
s, implemented using using open addressing
with linear probing for collision resolution.An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and int
values).
A hash map of
float
to int
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, int
pairs.A procedure that applies to
float
, int
pairs.Same as
FloatIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and long
values).
A hash map of
float
to long
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, long
pairs.A procedure that applies to
float
, long
pairs.Same as
FloatLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and Object
values).
A hash map of
float
to Object
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, Object
pairs.A procedure that applies to
float
, Object
pairs.Same as
FloatObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
float
objects.A procedure that applies to
float
objects.Same as
FloatHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
float
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (float keys and short
values).
A hash map of
float
to short
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
float
, short
pairs.A procedure that applies to
float
, short
pairs.Same as
FloatShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
FloatArrayList
adding stack-related utility methods.Factory methods to acquire the most common types of
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.
Display help information on hppc-template-processor.
Call
Call
mvn hppc-template-processor:help -Ddetail=true -Dgoal=<goal-name>
to display parameter details.Compare objects at two given indices and return the result of their
comparison consistent with
Comparator
's contract.A natural-order comparator for doubles.
A natural-order comparator for floats.
A natural-order comparator for integers.
A natural-order comparator for integers.
A delegating comparator for object types.
A reverse-order comparator for doubles.
A reverse-order comparator for floats.
A reverse-order comparator for integers.
A reverse-order comparator for shorts.
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.
An array-backed
IntDeque
.An array-backed list of ints.
An iterator implementation for
IntArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and byte
values).
A hash map of
int
to byte
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, byte
pairs.A procedure that applies to
int
, byte
pairs.Same as
IntByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and char
values).
A hash map of
int
to char
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, char
pairs.A procedure that applies to
int
, char
pairs.Same as
IntCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
int
s.A cursor over a collection of
ints
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and double
values).
A hash map of
int
to double
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, double
pairs.A procedure that applies to
int
, double
pairs.Same as
IntDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and float
values).
A hash map of
int
to float
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, float
pairs.A procedure that applies to
int
, float
pairs.Same as
IntFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
int
s, implemented using using open addressing
with linear probing for collision resolution.An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and int
values).
A hash map of
int
to int
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, int
pairs.A procedure that applies to
int
, int
pairs.Same as
IntIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and long
values).
A hash map of
int
to long
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, long
pairs.A procedure that applies to
int
, long
pairs.Same as
IntLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and Object
values).
A hash map of
int
to Object
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, Object
pairs.A procedure that applies to
int
, Object
pairs.Same as
IntObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
int
objects.A procedure that applies to
int
objects.Intrinsic method invocation.
Intrinsic methods that are fully functional for the source templates
(generic) and are replaced with low-level corresponding equivalents for the
generated primitive types.
Anything that implements value-equality function as replaced by the
Intrinsics.EqualityFunction.equals(java.lang.Object, java.lang.Object)
intrinsic.Anything that distributes keys by their hash value.
Same as
IntHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
int
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (int keys and short
values).
A hash map of
int
to short
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
int
, short
pairs.A procedure that applies to
int
, short
pairs.Same as
IntShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
IntArrayList
adding stack-related utility methods.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.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.This interface defines a complete listener for a parse tree produced by
Java7Parser
.This interface defines a complete generic visitor for a parse tree produced
by
Java7Parser
.An array-backed
LongDeque
.An array-backed list of longs.
An iterator implementation for
LongArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and byte
values).
A hash map of
long
to byte
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, byte
pairs.A procedure that applies to
long
, byte
pairs.Same as
LongByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and char
values).
A hash map of
long
to char
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, char
pairs.A procedure that applies to
long
, char
pairs.Same as
LongCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
long
s.A cursor over a collection of
longs
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and double
values).
A hash map of
long
to double
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, double
pairs.A procedure that applies to
long
, double
pairs.Same as
LongDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and float
values).
A hash map of
long
to float
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, float
pairs.A procedure that applies to
long
, float
pairs.Same as
LongFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
long
s, implemented using using open addressing
with linear probing for collision resolution.An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and int
values).
A hash map of
long
to int
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, int
pairs.A procedure that applies to
long
, int
pairs.Same as
LongIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and long
values).
A hash map of
long
to long
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, long
pairs.A procedure that applies to
long
, long
pairs.Same as
LongLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and Object
values).
A hash map of
long
to Object
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, Object
pairs.A procedure that applies to
long
, Object
pairs.Same as
LongObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
long
objects.A procedure that applies to
long
objects.Same as
LongHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
long
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (long keys and short
values).
A hash map of
long
to short
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
long
, short
pairs.A procedure that applies to
long
, short
pairs.Same as
LongShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
LongArrayList
adding stack-related utility methods.An array-backed
ObjectDeque
.An array-backed list of Objects.
An iterator implementation for
ObjectArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and byte
values).
A hash map of
Object
to byte
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to byte
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, byte
pairs.A procedure that applies to
Object
, byte
pairs.Same as
ObjectByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and char
values).
A hash map of
Object
to char
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to char
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, char
pairs.A procedure that applies to
Object
, char
pairs.Same as
ObjectCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
Object
s.A cursor over a collection of
Objects
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and double
values).
A hash map of
Object
to double
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to double
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, double
pairs.A procedure that applies to
Object
, double
pairs.Same as
ObjectDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and float
values).
A hash map of
Object
to float
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to float
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, float
pairs.A procedure that applies to
Object
, float
pairs.Same as
ObjectFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
Object
s, implemented using using open addressing
with linear probing for collision resolution.A reference-equality (identity) hash set.
An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and int
values).
A hash map of
Object
to int
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to int
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, int
pairs.A procedure that applies to
Object
, int
pairs.Same as
ObjectIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and long
values).
A hash map of
Object
to long
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to long
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, long
pairs.A procedure that applies to
Object
, long
pairs.Same as
ObjectLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and Object
values).
A hash map of
Object
to Object
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to Object
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, Object
pairs.A procedure that applies to
Object
, Object
pairs.Same as
ObjectObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
Object
objects.A procedure that applies to
Object
objects.Same as
ObjectHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
Object
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (Object keys and short
values).
A hash map of
Object
to short
, implemented using open
addressing with linear probing for collision resolution.An identity hash map of
Object
to short
.An associative container with unique binding from keys to a single value.
A predicate that applies to
Object
, short
pairs.A procedure that applies to
Object
, short
pairs.Same as
ObjectShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
ObjectArrayList
adding stack-related utility methods.Anything that can preallocate buffers given prior knowledge of the number of
stored elements.
Randomized hash order.
An array-backed
ShortDeque
.An array-backed list of shorts.
An iterator implementation for
ShortArrayList.iterator()
.Reused buffer visualization routines.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and byte
values).
A hash map of
short
to byte
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, byte
pairs.A procedure that applies to
short
, byte
pairs.Same as
ShortByteHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and char
values).
A hash map of
short
to char
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, char
pairs.A procedure that applies to
short
, char
pairs.Same as
ShortCharHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A collection allows basic, efficient operations on sets of elements
(difference and intersection).
A generic container holding
short
s.A cursor over a collection of
shorts
.A linear collection that supports element insertion and removal at both ends.
An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and double
values).
A hash map of
short
to double
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, double
pairs.A procedure that applies to
short
, double
pairs.Same as
ShortDoubleHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and float
values).
A hash map of
short
to float
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, float
pairs.A procedure that applies to
short
, float
pairs.Same as
ShortFloatHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A hash set of
short
s, implemented using using open addressing
with linear probing for collision resolution.An indexed container provides random access to elements based on an
index
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and int
values).
A hash map of
short
to int
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, int
pairs.A procedure that applies to
short
, int
pairs.Same as
ShortIntHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and long
values).
A hash map of
short
to long
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, long
pairs.A procedure that applies to
short
, long
pairs.Same as
ShortLongHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.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)
.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and Object
values).
A hash map of
short
to Object
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, Object
pairs.A procedure that applies to
short
, Object
pairs.Same as
ShortObjectHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A predicate that applies to
short
objects.A procedure that applies to
short
objects.Same as
ShortHashSet
but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.A set of
short
s.An associative container from keys to (one or
possibly more) values.
A cursor over entries of an associative container (short keys and short
values).
A hash map of
short
to short
, implemented using open
addressing with linear probing for collision resolution.An associative container with unique binding from keys to a single value.
A predicate that applies to
short
, short
pairs.A procedure that applies to
short
, short
pairs.Same as
ShortShortHashMap
but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.A subclass of
ShortArrayList
adding stack-related utility methods.Suppresses forbidden-API checks.
Template options for velocity directives in templates.
Maven mojo applying preprocessor templates.
A fast pseudo-random number generator.