(package private) class |
AbstractByteCollection |
Common superclass for collections.
|
(package private) class |
AbstractCharCollection |
Common superclass for collections.
|
(package private) class |
AbstractDoubleCollection |
Common superclass for collections.
|
(package private) class |
AbstractFloatCollection |
Common superclass for collections.
|
(package private) class |
AbstractIntCollection |
Common superclass for collections.
|
(package private) class |
AbstractLongCollection |
Common superclass for collections.
|
(package private) class |
AbstractObjectCollection<KType> |
Common superclass for collections.
|
(package private) class |
AbstractShortCollection |
Common superclass for collections.
|
class |
ByteArrayDeque |
|
class |
ByteArrayList |
An array-backed list of bytes.
|
interface |
ByteCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
ByteContainer |
A generic container holding bytes.
|
interface |
ByteDeque |
A linear collection that supports element insertion and removal at both ends.
|
interface |
ByteIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
interface |
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).
|
class |
ByteStack |
A subclass of ByteArrayList adding stack-related utility methods.
|
class |
CharArrayDeque |
|
class |
CharArrayList |
An array-backed list of chars.
|
interface |
CharByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
CharByteHashMap |
A hash map of char to byte, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharByteMap |
An associative container with unique binding from keys to a single value.
|
class |
CharByteScatterMap |
Same as CharByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
CharCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
CharCharHashMap |
A hash map of char to char, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharCharMap |
An associative container with unique binding from keys to a single value.
|
class |
CharCharScatterMap |
Same as CharCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
CharCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
CharContainer |
A generic container holding chars.
|
interface |
CharDeque |
A linear collection that supports element insertion and removal at both ends.
|
interface |
CharDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
CharDoubleHashMap |
A hash map of char to double, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharDoubleMap |
An associative container with unique binding from keys to a single value.
|
class |
CharDoubleScatterMap |
Same as CharDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
CharFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
CharFloatHashMap |
A hash map of char to float, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharFloatMap |
An associative container with unique binding from keys to a single value.
|
class |
CharFloatScatterMap |
Same as CharFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
CharHashSet |
A hash set of chars, implemented using using open addressing
with linear probing for collision resolution.
|
interface |
CharIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
interface |
CharIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
CharIntHashMap |
A hash map of char to int, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharIntMap |
An associative container with unique binding from keys to a single value.
|
class |
CharIntScatterMap |
Same as CharIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
CharLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
CharLongHashMap |
A hash map of char to long, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharLongMap |
An associative container with unique binding from keys to a single value.
|
class |
CharLongScatterMap |
Same as CharLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
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).
|
interface |
CharObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
class |
CharObjectHashMap<VType> |
A hash map of char to Object, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
class |
CharObjectScatterMap<VType> |
Same as CharObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
CharScatterSet |
Same as CharHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
interface |
CharSet |
A set of chars.
|
interface |
CharShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
CharShortHashMap |
A hash map of char to short, implemented using open
addressing with linear probing for collision resolution.
|
interface |
CharShortMap |
An associative container with unique binding from keys to a single value.
|
class |
CharShortScatterMap |
Same as CharShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
CharStack |
A subclass of CharArrayList adding stack-related utility methods.
|
class |
DoubleArrayDeque |
|
class |
DoubleArrayList |
An array-backed list of doubles.
|
interface |
DoubleCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
DoubleContainer |
A generic container holding doubles.
|
interface |
DoubleDeque |
A linear collection that supports element insertion and removal at both ends.
|
interface |
DoubleIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
interface |
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).
|
class |
DoubleStack |
|
class |
FloatArrayDeque |
|
class |
FloatArrayList |
An array-backed list of floats.
|
interface |
FloatCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
FloatContainer |
A generic container holding floats.
|
interface |
FloatDeque |
A linear collection that supports element insertion and removal at both ends.
|
interface |
FloatIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
interface |
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).
|
class |
FloatStack |
|
class |
IntArrayDeque |
|
class |
IntArrayList |
An array-backed list of ints.
|
interface |
IntByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
IntByteHashMap |
A hash map of int to byte, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntByteMap |
An associative container with unique binding from keys to a single value.
|
class |
IntByteScatterMap |
Same as IntByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
IntCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
IntCharHashMap |
A hash map of int to char, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntCharMap |
An associative container with unique binding from keys to a single value.
|
class |
IntCharScatterMap |
Same as IntCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
IntCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
IntContainer |
A generic container holding ints.
|
interface |
IntDeque |
A linear collection that supports element insertion and removal at both ends.
|
interface |
IntDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
IntDoubleHashMap |
A hash map of int to double, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntDoubleMap |
An associative container with unique binding from keys to a single value.
|
class |
IntDoubleScatterMap |
Same as IntDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
IntFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
IntFloatHashMap |
A hash map of int to float, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntFloatMap |
An associative container with unique binding from keys to a single value.
|
class |
IntFloatScatterMap |
Same as IntFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
IntHashSet |
A hash set of ints, implemented using using open addressing
with linear probing for collision resolution.
|
interface |
IntIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
interface |
IntIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
IntIntHashMap |
A hash map of int to int, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntIntMap |
An associative container with unique binding from keys to a single value.
|
class |
IntIntScatterMap |
Same as IntIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
IntLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
IntLongHashMap |
A hash map of int to long, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntLongMap |
An associative container with unique binding from keys to a single value.
|
class |
IntLongScatterMap |
Same as IntLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
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).
|
interface |
IntObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
class |
IntObjectHashMap<VType> |
A hash map of int to Object, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
class |
IntObjectScatterMap<VType> |
Same as IntObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
IntScatterSet |
Same as IntHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
interface |
IntSet |
A set of ints.
|
interface |
IntShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
IntShortHashMap |
A hash map of int to short, implemented using open
addressing with linear probing for collision resolution.
|
interface |
IntShortMap |
An associative container with unique binding from keys to a single value.
|
class |
IntShortScatterMap |
Same as IntShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
IntStack |
A subclass of IntArrayList adding stack-related utility methods.
|
class |
LongArrayDeque |
|
class |
LongArrayList |
An array-backed list of longs.
|
interface |
LongByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
LongByteHashMap |
A hash map of long to byte, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongByteMap |
An associative container with unique binding from keys to a single value.
|
class |
LongByteScatterMap |
Same as LongByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
LongCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
LongCharHashMap |
A hash map of long to char, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongCharMap |
An associative container with unique binding from keys to a single value.
|
class |
LongCharScatterMap |
Same as LongCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
LongCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
LongContainer |
A generic container holding longs.
|
interface |
LongDeque |
A linear collection that supports element insertion and removal at both ends.
|
interface |
LongDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
LongDoubleHashMap |
A hash map of long to double, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongDoubleMap |
An associative container with unique binding from keys to a single value.
|
class |
LongDoubleScatterMap |
Same as LongDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
LongFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
LongFloatHashMap |
A hash map of long to float, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongFloatMap |
An associative container with unique binding from keys to a single value.
|
class |
LongFloatScatterMap |
Same as LongFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
LongHashSet |
A hash set of longs, implemented using using open addressing
with linear probing for collision resolution.
|
interface |
LongIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
interface |
LongIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
LongIntHashMap |
A hash map of long to int, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongIntMap |
An associative container with unique binding from keys to a single value.
|
class |
LongIntScatterMap |
Same as LongIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
LongLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
LongLongHashMap |
A hash map of long to long, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongLongMap |
An associative container with unique binding from keys to a single value.
|
class |
LongLongScatterMap |
Same as LongLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
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).
|
interface |
LongObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
class |
LongObjectHashMap<VType> |
A hash map of long to Object, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
class |
LongObjectScatterMap<VType> |
Same as LongObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
LongScatterSet |
Same as LongHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
interface |
LongSet |
A set of longs.
|
interface |
LongShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
LongShortHashMap |
A hash map of long to short, implemented using open
addressing with linear probing for collision resolution.
|
interface |
LongShortMap |
An associative container with unique binding from keys to a single value.
|
class |
LongShortScatterMap |
Same as LongShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
LongStack |
A subclass of LongArrayList adding stack-related utility methods.
|
class |
ObjectArrayDeque<KType> |
|
class |
ObjectArrayList<KType> |
An array-backed list of Objects.
|
interface |
ObjectByteAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectByteHashMap<KType> |
A hash map of Object to byte, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectByteIdentityHashMap<KType> |
An identity hash map of Object to byte.
|
interface |
ObjectByteMap<KType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectByteScatterMap<KType> |
Same as ObjectByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ObjectCharAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectCharHashMap<KType> |
A hash map of Object to char, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectCharIdentityHashMap<KType> |
An identity hash map of Object to char.
|
interface |
ObjectCharMap<KType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectCharScatterMap<KType> |
Same as ObjectCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ObjectCollection<KType> |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
ObjectContainer<KType> |
A generic container holding Objects.
|
interface |
ObjectDeque<KType> |
A linear collection that supports element insertion and removal at both ends.
|
interface |
ObjectDoubleAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectDoubleHashMap<KType> |
A hash map of Object to double, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectDoubleIdentityHashMap<KType> |
An identity hash map of Object to double.
|
interface |
ObjectDoubleMap<KType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectDoubleScatterMap<KType> |
Same as ObjectDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ObjectFloatAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectFloatHashMap<KType> |
A hash map of Object to float, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectFloatIdentityHashMap<KType> |
An identity hash map of Object to float.
|
interface |
ObjectFloatMap<KType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectFloatScatterMap<KType> |
Same as ObjectFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
ObjectHashSet<KType> |
A hash set of Objects, implemented using using open addressing
with linear probing for collision resolution.
|
interface |
ObjectIndexedContainer<KType> |
An indexed container provides random access to elements based on an
index.
|
interface |
ObjectIntAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectIntHashMap<KType> |
A hash map of Object to int, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectIntIdentityHashMap<KType> |
An identity hash map of Object to int.
|
interface |
ObjectIntMap<KType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectIntScatterMap<KType> |
Same as ObjectIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ObjectLongAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectLongHashMap<KType> |
A hash map of Object to long, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectLongIdentityHashMap<KType> |
An identity hash map of Object to long.
|
interface |
ObjectLongMap<KType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectLongScatterMap<KType> |
Same as ObjectLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
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).
|
interface |
ObjectObjectAssociativeContainer<KType,VType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectObjectHashMap<KType,VType> |
A hash map of Object to Object, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectObjectIdentityHashMap<KType,VType> |
An identity hash map of Object to Object.
|
interface |
ObjectObjectMap<KType,VType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectObjectScatterMap<KType,VType> |
Same as ObjectObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
ObjectScatterSet<KType> |
Same as ObjectHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
interface |
ObjectSet<KType> |
A set of Objects.
|
interface |
ObjectShortAssociativeContainer<KType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ObjectShortHashMap<KType> |
A hash map of Object to short, implemented using open
addressing with linear probing for collision resolution.
|
class |
ObjectShortIdentityHashMap<KType> |
An identity hash map of Object to short.
|
interface |
ObjectShortMap<KType> |
An associative container with unique binding from keys to a single value.
|
class |
ObjectShortScatterMap<KType> |
Same as ObjectShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
ObjectStack<KType> |
|
class |
ShortArrayDeque |
|
class |
ShortArrayList |
An array-backed list of shorts.
|
interface |
ShortByteAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortByteHashMap |
A hash map of short to byte, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortByteMap |
An associative container with unique binding from keys to a single value.
|
class |
ShortByteScatterMap |
Same as ShortByteHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ShortCharAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortCharHashMap |
A hash map of short to char, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortCharMap |
An associative container with unique binding from keys to a single value.
|
class |
ShortCharScatterMap |
Same as ShortCharHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ShortCollection |
A collection allows basic, efficient operations on sets of elements
(difference and intersection).
|
interface |
ShortContainer |
A generic container holding shorts.
|
interface |
ShortDeque |
A linear collection that supports element insertion and removal at both ends.
|
interface |
ShortDoubleAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortDoubleHashMap |
A hash map of short to double, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortDoubleMap |
An associative container with unique binding from keys to a single value.
|
class |
ShortDoubleScatterMap |
Same as ShortDoubleHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ShortFloatAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortFloatHashMap |
A hash map of short to float, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortFloatMap |
An associative container with unique binding from keys to a single value.
|
class |
ShortFloatScatterMap |
Same as ShortFloatHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
ShortHashSet |
A hash set of shorts, implemented using using open addressing
with linear probing for collision resolution.
|
interface |
ShortIndexedContainer |
An indexed container provides random access to elements based on an
index.
|
interface |
ShortIntAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortIntHashMap |
A hash map of short to int, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortIntMap |
An associative container with unique binding from keys to a single value.
|
class |
ShortIntScatterMap |
Same as ShortIntHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
ShortLongAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortLongHashMap |
A hash map of short to long, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortLongMap |
An associative container with unique binding from keys to a single value.
|
class |
ShortLongScatterMap |
Same as ShortLongHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
interface |
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).
|
interface |
ShortObjectAssociativeContainer<VType> |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortObjectHashMap<VType> |
A hash map of short to Object, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortObjectMap<VType> |
An associative container with unique binding from keys to a single value.
|
class |
ShortObjectScatterMap<VType> |
Same as ShortObjectHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
ShortScatterSet |
Same as ShortHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
|
interface |
ShortSet |
A set of shorts.
|
interface |
ShortShortAssociativeContainer |
An associative container from keys to (one or
possibly more) values.
|
class |
ShortShortHashMap |
A hash map of short to short, implemented using open
addressing with linear probing for collision resolution.
|
interface |
ShortShortMap |
An associative container with unique binding from keys to a single value.
|
class |
ShortShortScatterMap |
Same as ShortShortHashMap but does not implement per-instance
key mixing strategy and uses a simpler (faster) bit distribution function.
|
class |
ShortStack |
|