|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
k
to the set.
ByteByteOpenHashMap.values
table is allocated
or empty.
ByteCharOpenHashMap.values
table is allocated
or empty.
ByteDoubleOpenHashMap.values
table is allocated
or empty.
ByteFloatOpenHashMap.values
table is allocated
or empty.
ByteIntOpenHashMap.values
table is allocated
or empty.
ByteLongOpenHashMap.values
table is allocated
or empty.
ByteObjectOpenHashMap.values
table is allocated
or empty.
ByteOpenHashSet.keys
table is allocated
or empty.
ByteShortOpenHashMap.values
table is allocated
or empty.
CharByteOpenHashMap.values
table is allocated
or empty.
CharCharOpenHashMap.values
table is allocated
or empty.
CharDoubleOpenHashMap.values
table is allocated
or empty.
CharFloatOpenHashMap.values
table is allocated
or empty.
CharIntOpenHashMap.values
table is allocated
or empty.
CharLongOpenHashMap.values
table is allocated
or empty.
CharObjectOpenHashMap.values
table is allocated
or empty.
CharOpenHashSet.keys
table is allocated
or empty.
CharShortOpenHashMap.values
table is allocated
or empty.
DoubleByteOpenHashMap.values
table is allocated
or empty.
DoubleCharOpenHashMap.values
table is allocated
or empty.
DoubleDoubleOpenHashMap.values
table is allocated
or empty.
DoubleFloatOpenHashMap.values
table is allocated
or empty.
DoubleIntOpenHashMap.values
table is allocated
or empty.
DoubleLongOpenHashMap.values
table is allocated
or empty.
DoubleObjectOpenHashMap.values
table is allocated
or empty.
DoubleOpenHashSet.keys
table is allocated
or empty.
DoubleShortOpenHashMap.values
table is allocated
or empty.
FloatByteOpenHashMap.values
table is allocated
or empty.
FloatCharOpenHashMap.values
table is allocated
or empty.
FloatDoubleOpenHashMap.values
table is allocated
or empty.
FloatFloatOpenHashMap.values
table is allocated
or empty.
FloatIntOpenHashMap.values
table is allocated
or empty.
FloatLongOpenHashMap.values
table is allocated
or empty.
FloatObjectOpenHashMap.values
table is allocated
or empty.
FloatOpenHashSet.keys
table is allocated
or empty.
FloatShortOpenHashMap.values
table is allocated
or empty.
IntByteOpenHashMap.values
table is allocated
or empty.
IntCharOpenHashMap.values
table is allocated
or empty.
IntDoubleOpenHashMap.values
table is allocated
or empty.
IntFloatOpenHashMap.values
table is allocated
or empty.
IntIntOpenHashMap.values
table is allocated
or empty.
IntLongOpenHashMap.values
table is allocated
or empty.
IntObjectOpenHashMap.values
table is allocated
or empty.
IntOpenHashSet.keys
table is allocated
or empty.
IntShortOpenHashMap.values
table is allocated
or empty.
KTypeOpenHashSet.keys
table is allocated
or empty.
KTypeVTypeOpenHashMap.values
table is allocated
or empty.
LongByteOpenHashMap.values
table is allocated
or empty.
LongCharOpenHashMap.values
table is allocated
or empty.
LongDoubleOpenHashMap.values
table is allocated
or empty.
LongFloatOpenHashMap.values
table is allocated
or empty.
LongIntOpenHashMap.values
table is allocated
or empty.
LongLongOpenHashMap.values
table is allocated
or empty.
LongObjectOpenHashMap.values
table is allocated
or empty.
LongOpenHashSet.keys
table is allocated
or empty.
LongShortOpenHashMap.values
table is allocated
or empty.
ObjectByteOpenHashMap.values
table is allocated
or empty.
ObjectCharOpenHashMap.values
table is allocated
or empty.
ObjectDoubleOpenHashMap.values
table is allocated
or empty.
ObjectFloatOpenHashMap.values
table is allocated
or empty.
ObjectIntOpenHashMap.values
table is allocated
or empty.
ObjectLongOpenHashMap.values
table is allocated
or empty.
ObjectObjectOpenHashMap.values
table is allocated
or empty.
ObjectOpenHashSet.keys
table is allocated
or empty.
ObjectShortOpenHashMap.values
table is allocated
or empty.
ShortByteOpenHashMap.values
table is allocated
or empty.
ShortCharOpenHashMap.values
table is allocated
or empty.
ShortDoubleOpenHashMap.values
table is allocated
or empty.
ShortFloatOpenHashMap.values
table is allocated
or empty.
ShortIntOpenHashMap.values
table is allocated
or empty.
ShortLongOpenHashMap.values
table is allocated
or empty.
ShortObjectOpenHashMap.values
table is allocated
or empty.
ShortOpenHashSet.keys
table is allocated
or empty.
ShortShortOpenHashMap.values
table is allocated
or empty.
ArrayDeque
(used as a Stack
against ObjectStack
.IntLookupContainer
.
LongLookupContainer
.
ByteByteOpenHashMap.allocated
.
ByteCharOpenHashMap.allocated
.
ByteDoubleOpenHashMap.allocated
.
ByteFloatOpenHashMap.allocated
.
ByteIntOpenHashMap.allocated
.
ByteLongOpenHashMap.allocated
.
ByteObjectOpenHashMap.allocated
.
ByteOpenHashSet.allocated
.
ByteShortOpenHashMap.allocated
.
CharByteOpenHashMap.allocated
.
CharCharOpenHashMap.allocated
.
CharDoubleOpenHashMap.allocated
.
CharFloatOpenHashMap.allocated
.
CharIntOpenHashMap.allocated
.
CharLongOpenHashMap.allocated
.
CharObjectOpenHashMap.allocated
.
CharOpenHashSet.allocated
.
CharShortOpenHashMap.allocated
.
DoubleByteOpenHashMap.allocated
.
DoubleCharOpenHashMap.allocated
.
DoubleDoubleOpenHashMap.allocated
.
DoubleFloatOpenHashMap.allocated
.
DoubleIntOpenHashMap.allocated
.
DoubleLongOpenHashMap.allocated
.
DoubleObjectOpenHashMap.allocated
.
DoubleOpenHashSet.allocated
.
DoubleShortOpenHashMap.allocated
.
FloatByteOpenHashMap.allocated
.
FloatCharOpenHashMap.allocated
.
FloatDoubleOpenHashMap.allocated
.
FloatFloatOpenHashMap.allocated
.
FloatIntOpenHashMap.allocated
.
FloatLongOpenHashMap.allocated
.
FloatObjectOpenHashMap.allocated
.
FloatOpenHashSet.allocated
.
FloatShortOpenHashMap.allocated
.
IntByteOpenHashMap.allocated
.
IntCharOpenHashMap.allocated
.
IntDoubleOpenHashMap.allocated
.
IntFloatOpenHashMap.allocated
.
IntIntOpenHashMap.allocated
.
IntLongOpenHashMap.allocated
.
IntObjectOpenHashMap.allocated
.
IntOpenHashSet.allocated
.
IntShortOpenHashMap.allocated
.
KTypeOpenHashSet.allocated
.
KTypeVTypeOpenHashMap.allocated
.
LongByteOpenHashMap.allocated
.
LongCharOpenHashMap.allocated
.
LongDoubleOpenHashMap.allocated
.
LongFloatOpenHashMap.allocated
.
LongIntOpenHashMap.allocated
.
LongLongOpenHashMap.allocated
.
LongObjectOpenHashMap.allocated
.
LongOpenHashSet.allocated
.
LongShortOpenHashMap.allocated
.
ObjectByteOpenHashMap.allocated
.
ObjectCharOpenHashMap.allocated
.
ObjectDoubleOpenHashMap.allocated
.
ObjectFloatOpenHashMap.allocated
.
ObjectIntOpenHashMap.allocated
.
ObjectLongOpenHashMap.allocated
.
ObjectObjectOpenHashMap.allocated
.
ObjectOpenHashSet.allocated
.
ObjectShortOpenHashMap.allocated
.
ShortByteOpenHashMap.allocated
.
ShortCharOpenHashMap.allocated
.
ShortDoubleOpenHashMap.allocated
.
ShortFloatOpenHashMap.allocated
.
ShortIntOpenHashMap.allocated
.
ShortLongOpenHashMap.allocated
.
ShortObjectOpenHashMap.allocated
.
ShortOpenHashSet.allocated
.
ShortShortOpenHashMap.allocated
.
BigramCounting
.Collections.sort(java.util.List)
, in particular for differences
in the new JDK 1.7 (TimSort).java.util.BitSet
.e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
byte
to byte
, implemented using open
addressing with linear probing for collision resolution.byte
, byte
pairs.byte
to char
, implemented using open
addressing with linear probing for collision resolution.byte
, char
pairs.byte
s.bytes
.byte
s.byte
to double
, implemented using open
addressing with linear probing for collision resolution.byte
, double
pairs.byte
to float
, implemented using open
addressing with linear probing for collision resolution.byte
, float
pairs.byte
holder.index
.byte
to int
, implemented using open
addressing with linear probing for collision resolution.byte
, int
pairs.byte
to long
, implemented using open
addressing with linear probing for collision resolution.byte
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.byte
to VType
, implemented using open
addressing with linear probing for collision resolution.byte
, VType
pairs.byte
s, implemented using using open
addressing with linear probing for collision resolution.byte
objects.byte
objects.byte
s.byte
to short
, implemented using open
addressing with linear probing for collision resolution.byte
, short
pairs.ObjectArrayList
adding stack-related utility methods.char
to byte
, implemented using open
addressing with linear probing for collision resolution.char
, byte
pairs.char
to char
, implemented using open
addressing with linear probing for collision resolution.char
, char
pairs.char
s.chars
.char
s.char
to double
, implemented using open
addressing with linear probing for collision resolution.char
, double
pairs.char
to float
, implemented using open
addressing with linear probing for collision resolution.char
, float
pairs.char
holder.index
.char
to int
, implemented using open
addressing with linear probing for collision resolution.char
, int
pairs.char
to long
, implemented using open
addressing with linear probing for collision resolution.char
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.char
to VType
, implemented using open
addressing with linear probing for collision resolution.char
, VType
pairs.char
s, implemented using using open
addressing with linear probing for collision resolution.char
objects.char
objects.char
s.char
to short
, implemented using open
addressing with linear probing for collision resolution.char
, short
pairs.ObjectArrayList
adding stack-related utility methods.byte
, int
, etc.) to conserve
memory and boost performance.true
/ false
for
a given value.keys
this map has.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
true
if this container has an association to a value for
the given key.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all elements of this deque, tail to head.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
double
to byte
, implemented using open
addressing with linear probing for collision resolution.double
, byte
pairs.double
to char
, implemented using open
addressing with linear probing for collision resolution.double
, char
pairs.double
s.doubles
.double
s.double
to double
, implemented using open
addressing with linear probing for collision resolution.double
, double
pairs.double
to float
, implemented using open
addressing with linear probing for collision resolution.double
, float
pairs.double
holder.index
.double
to int
, implemented using open
addressing with linear probing for collision resolution.double
, int
pairs.double
to long
, implemented using open
addressing with linear probing for collision resolution.double
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.double
to VType
, implemented using open
addressing with linear probing for collision resolution.double
, VType
pairs.double
s, implemented using using open
addressing with linear probing for collision resolution.double
objects.double
objects.double
s.double
to short
, implemented using open
addressing with linear probing for collision resolution.double
, short
pairs.ObjectArrayList
adding stack-related utility methods.ByteArrayList.buffer
.
CharArrayList.buffer
.
DoubleArrayList.buffer
.
FloatArrayList.buffer
.
IntArrayList.buffer
.
IntDoubleLinkedSet.dense
).
KTypeArrayList.buffer
.
LongArrayList.buffer
.
ObjectArrayList.buffer
.
ShortArrayList.buffer
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
expectedAdditions
.
value
.
float
to byte
, implemented using open
addressing with linear probing for collision resolution.float
, byte
pairs.float
to char
, implemented using open
addressing with linear probing for collision resolution.float
, char
pairs.float
s.floats
.float
s.float
to double
, implemented using open
addressing with linear probing for collision resolution.float
, double
pairs.float
to float
, implemented using open
addressing with linear probing for collision resolution.float
, float
pairs.float
holder.index
.float
to int
, implemented using open
addressing with linear probing for collision resolution.float
, int
pairs.float
to long
, implemented using open
addressing with linear probing for collision resolution.float
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.float
to VType
, implemented using open
addressing with linear probing for collision resolution.float
, VType
pairs.float
s, implemented using using open
addressing with linear probing for collision resolution.float
objects.float
objects.float
s.float
to short
, implemented using open
addressing with linear probing for collision resolution.float
, short
pairs.ObjectArrayList
adding stack-related utility methods.procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
procedure
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive.
predicate
to container elements as long, as the predicate
returns true
.
predicate
to a slice of the list,
fromIndex
, inclusive, to toIndex
,
exclusive, or until predicate returns false
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
procedure
to all container elements.
predicate
to container elements as long, as the predicate
returns true
.
byte
.
byte
.
char
.
char
.
double
.
double
.
float
.
float
.
int
.
int
.
int
.
KType
.
KType
.
long
.
long
.
KType
.
KType
.
short
.
short
.
BoundedProportionalArraySizingStrategy.growRatio
, BoundedProportionalArraySizingStrategy.minGrowCount
and BoundedProportionalArraySizingStrategy.maxGrowCount
.
Predicate
and HPPC's ObjectPredicate
.Predicate
and HPPC's ObjectProcedure
.HashMap
against
ObjectObjectOpenHashMap
.IndirectComparator.AscendingIntComparator
's contract.int
to byte
, implemented using open
addressing with linear probing for collision resolution.int
, byte
pairs.int
to char
, implemented using open
addressing with linear probing for collision resolution.int
, char
pairs.int
s.ints
.int
s.int
values.int
to double
, implemented using open
addressing with linear probing for collision resolution.int
, double
pairs.int
to float
, implemented using open
addressing with linear probing for collision resolution.int
, float
pairs.int
holder.index
.int
to int
, implemented using open
addressing with linear probing for collision resolution.int
, int
pairs.int
to long
, implemented using open
addressing with linear probing for collision resolution.int
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.int
to VType
, implemented using open
addressing with linear probing for collision resolution.int
, VType
pairs.int
s, implemented using using open
addressing with linear probing for collision resolution.int
objects.int
objects.int
s.int
to short
, implemented using open
addressing with linear probing for collision resolution.int
, short
pairs.ObjectArrayList
adding stack-related utility methods.size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
size() == 0
.
KType
s.KTypes
.KType
s.index
.O(log n)
and ideally in amortized
constant time O(1)
.KType
s, implemented using using open
addressing with linear probing for collision resolution.KType
objects.KType
objects.KType
s.ObjectArrayList
adding stack-related utility methods.KType
to VType
, implemented using open
addressing with linear probing for collision resolution.KType
, VType
pairs.e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
e1
.
ByteByteOpenHashMap.containsKey(byte)
.
ByteCharOpenHashMap.containsKey(byte)
.
ByteDoubleOpenHashMap.containsKey(byte)
.
ByteFloatOpenHashMap.containsKey(byte)
.
ByteIntOpenHashMap.containsKey(byte)
.
ByteLongOpenHashMap.containsKey(byte)
.
ByteObjectOpenHashMap.containsKey(byte)
.
ByteOpenHashSet.contains(byte)
.
ByteShortOpenHashMap.containsKey(byte)
.
CharByteOpenHashMap.containsKey(char)
.
CharCharOpenHashMap.containsKey(char)
.
CharDoubleOpenHashMap.containsKey(char)
.
CharFloatOpenHashMap.containsKey(char)
.
CharIntOpenHashMap.containsKey(char)
.
CharLongOpenHashMap.containsKey(char)
.
CharObjectOpenHashMap.containsKey(char)
.
CharOpenHashSet.contains(char)
.
CharShortOpenHashMap.containsKey(char)
.
DoubleByteOpenHashMap.containsKey(double)
.
DoubleCharOpenHashMap.containsKey(double)
.
DoubleDoubleOpenHashMap.containsKey(double)
.
DoubleFloatOpenHashMap.containsKey(double)
.
DoubleIntOpenHashMap.containsKey(double)
.
DoubleLongOpenHashMap.containsKey(double)
.
DoubleObjectOpenHashMap.containsKey(double)
.
DoubleOpenHashSet.contains(double)
.
DoubleShortOpenHashMap.containsKey(double)
.
FloatByteOpenHashMap.containsKey(float)
.
FloatCharOpenHashMap.containsKey(float)
.
FloatDoubleOpenHashMap.containsKey(float)
.
FloatFloatOpenHashMap.containsKey(float)
.
FloatIntOpenHashMap.containsKey(float)
.
FloatLongOpenHashMap.containsKey(float)
.
FloatObjectOpenHashMap.containsKey(float)
.
FloatOpenHashSet.contains(float)
.
FloatShortOpenHashMap.containsKey(float)
.
IntByteOpenHashMap.containsKey(int)
.
IntCharOpenHashMap.containsKey(int)
.
IntDoubleOpenHashMap.containsKey(int)
.
IntFloatOpenHashMap.containsKey(int)
.
IntIntOpenHashMap.containsKey(int)
.
IntLongOpenHashMap.containsKey(int)
.
IntObjectOpenHashMap.containsKey(int)
.
IntOpenHashSet.contains(int)
.
IntShortOpenHashMap.containsKey(int)
.
KTypeOpenHashSet.contains(KType)
.
KTypeVTypeOpenHashMap.containsKey(KType)
.
LongByteOpenHashMap.containsKey(long)
.
LongCharOpenHashMap.containsKey(long)
.
LongDoubleOpenHashMap.containsKey(long)
.
LongFloatOpenHashMap.containsKey(long)
.
LongIntOpenHashMap.containsKey(long)
.
LongLongOpenHashMap.containsKey(long)
.
LongObjectOpenHashMap.containsKey(long)
.
LongOpenHashSet.contains(long)
.
LongShortOpenHashMap.containsKey(long)
.
ObjectByteOpenHashMap.containsKey(KType)
.
ObjectCharOpenHashMap.containsKey(KType)
.
ObjectDoubleOpenHashMap.containsKey(KType)
.
ObjectFloatOpenHashMap.containsKey(KType)
.
ObjectIntOpenHashMap.containsKey(KType)
.
ObjectLongOpenHashMap.containsKey(KType)
.
ObjectObjectOpenHashMap.containsKey(KType)
.
ObjectOpenHashSet.contains(KType)
.
ObjectShortOpenHashMap.containsKey(KType)
.
ShortByteOpenHashMap.containsKey(short)
.
ShortCharOpenHashMap.containsKey(short)
.
ShortDoubleOpenHashMap.containsKey(short)
.
ShortFloatOpenHashMap.containsKey(short)
.
ShortIntOpenHashMap.containsKey(short)
.
ShortLongOpenHashMap.containsKey(short)
.
ShortObjectOpenHashMap.containsKey(short)
.
ShortOpenHashSet.contains(short)
.
ShortShortOpenHashMap.containsKey(short)
.
long
to byte
, implemented using open
addressing with linear probing for collision resolution.long
, byte
pairs.long
to char
, implemented using open
addressing with linear probing for collision resolution.long
, char
pairs.long
s.longs
.long
s.long
to double
, implemented using open
addressing with linear probing for collision resolution.long
, double
pairs.long
to float
, implemented using open
addressing with linear probing for collision resolution.long
, float
pairs.long
holder.index
.long
to int
, implemented using open
addressing with linear probing for collision resolution.long
, int
pairs.long
to long
, implemented using open
addressing with linear probing for collision resolution.long
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.long
to VType
, implemented using open
addressing with linear probing for collision resolution.long
, VType
pairs.long
s, implemented using using open
addressing with linear probing for collision resolution.long
objects.long
objects.long
s.long
to short
, implemented using open
addressing with linear probing for collision resolution.long
, short
pairs.ObjectArrayList
adding stack-related utility methods.ByteByteOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
ByteCharOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
ByteDoubleOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
ByteFloatOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
ByteIntOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
ByteLongOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
ByteObjectOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
ByteShortOpenHashMap.containsKey(byte)
, if and only if the key exists
in the map already.
CharByteOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
CharCharOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
CharDoubleOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
CharFloatOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
CharIntOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
CharLongOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
CharObjectOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
CharShortOpenHashMap.containsKey(char)
, if and only if the key exists
in the map already.
DoubleByteOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
DoubleCharOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
DoubleDoubleOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
DoubleFloatOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
DoubleIntOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
DoubleLongOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
DoubleObjectOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
DoubleShortOpenHashMap.containsKey(double)
, if and only if the key exists
in the map already.
FloatByteOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
FloatCharOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
FloatDoubleOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
FloatFloatOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
FloatIntOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
FloatLongOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
FloatObjectOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
FloatShortOpenHashMap.containsKey(float)
, if and only if the key exists
in the map already.
IntByteOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
IntCharOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
IntDoubleOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
IntFloatOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
IntIntOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
IntLongOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
IntObjectOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
IntShortOpenHashMap.containsKey(int)
, if and only if the key exists
in the map already.
KTypeVTypeOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
LongByteOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
LongCharOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
LongDoubleOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
LongFloatOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
LongIntOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
LongLongOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
LongObjectOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
LongShortOpenHashMap.containsKey(long)
, if and only if the key exists
in the map already.
ObjectByteOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ObjectCharOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ObjectDoubleOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ObjectFloatOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ObjectIntOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ObjectLongOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ObjectObjectOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ObjectShortOpenHashMap.containsKey(KType)
, if and only if the key exists
in the map already.
ShortByteOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
ShortCharOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
ShortDoubleOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
ShortFloatOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
ShortIntOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
ShortLongOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
ShortObjectOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
ShortShortOpenHashMap.containsKey(short)
, if and only if the key exists
in the map already.
start
and
length
, as indicated by the given comparator
.
start
and
length
, as indicated by the given comparator
.
ObjectArrayList
.KType
to byte
, implemented using open
addressing with linear probing for collision resolution.KType
, byte
pairs.KType
to char
, implemented using open
addressing with linear probing for collision resolution.KType
, char
pairs.KType
s.KTypes
.KType
s.KType
to double
, implemented using open
addressing with linear probing for collision resolution.KType
, double
pairs.KType
to float
, implemented using open
addressing with linear probing for collision resolution.KType
, float
pairs.index
.KType
to int
, implemented using open
addressing with linear probing for collision resolution.KType
, int
pairs.KType
to long
, implemented using open
addressing with linear probing for collision resolution.KType
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.KType
to VType
, implemented using open
addressing with linear probing for collision resolution.HashMap
against
ObjectObjectOpenHashMap
.KType
, VType
pairs.KType
s, implemented using using open
addressing with linear probing for collision resolution.KType
objects.KType
objects.KType
s.KType
to short
, implemented using open
addressing with linear probing for collision resolution.KType
, short
pairs.ObjectArrayList
adding stack-related utility methods.ObjectStack
.ByteOpenHashSet.removeAllOccurrences(byte)
.
CharOpenHashSet.removeAllOccurrences(char)
.
DoubleOpenHashSet.removeAllOccurrences(double)
.
FloatOpenHashSet.removeAllOccurrences(float)
.
IntDoubleLinkedSet.removeAllOccurrences(int)
.
IntOpenHashSet.removeAllOccurrences(int)
.
KTypeOpenHashSet.removeAllOccurrences(KType)
.
LongOpenHashSet.removeAllOccurrences(long)
.
ObjectOpenHashSet.removeAllOccurrences(KType)
.
ShortOpenHashSet.removeAllOccurrences(short)
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
c
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
true
.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
e
from this collection.
index
in the internal
{#link ByteArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link CharArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link DoubleArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link FloatArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link IntArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link KTypeArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link LongArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link ObjectArrayDeque.buffer
} array, returning its value.
index
in the internal
{#link ShortArrayDeque.buffer
} array, returning its value.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
e1
, returning its
deleted position or -1
if the element was not found.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
fromIndex
, inclusive, and toIndex
, exclusive.
c
.
true
.
c
.
true
.
c
.
true
.
c
.
true
.
c
.
true
.
c
.
true
.
c
.
true
.
c
.
true
.
c
.
true
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
slot
.
short
to byte
, implemented using open
addressing with linear probing for collision resolution.short
, byte
pairs.short
to char
, implemented using open
addressing with linear probing for collision resolution.short
, char
pairs.short
s.shorts
.short
s.short
to double
, implemented using open
addressing with linear probing for collision resolution.short
, double
pairs.short
to float
, implemented using open
addressing with linear probing for collision resolution.short
, float
pairs.short
holder.index
.short
to int
, implemented using open
addressing with linear probing for collision resolution.short
, int
pairs.short
to long
, implemented using open
addressing with linear probing for collision resolution.short
, long
pairs.O(log n)
and ideally in amortized
constant time O(1)
.short
to VType
, implemented using open
addressing with linear probing for collision resolution.short
, VType
pairs.short
s, implemented using using open
addressing with linear probing for collision resolution.short
objects.short
objects.short
s.short
to short
, implemented using open
addressing with linear probing for collision resolution.short
, short
pairs.ObjectArrayList
adding stack-related utility methods.IntDoubleLinkedSet.dense
.
BitSet.wlen
, the number of words in use, by checking for trailing zero
words.
ByteByteOpenHashMap.keys
.
ByteCharOpenHashMap.keys
.
ByteDoubleOpenHashMap.keys
.
ByteFloatOpenHashMap.keys
.
ByteIntOpenHashMap.keys
.
ByteLongOpenHashMap.keys
.
ByteObjectOpenHashMap.keys
.
ByteShortOpenHashMap.keys
.
CharByteOpenHashMap.keys
.
CharCharOpenHashMap.keys
.
CharDoubleOpenHashMap.keys
.
CharFloatOpenHashMap.keys
.
CharIntOpenHashMap.keys
.
CharLongOpenHashMap.keys
.
CharObjectOpenHashMap.keys
.
CharShortOpenHashMap.keys
.
DoubleByteOpenHashMap.keys
.
DoubleCharOpenHashMap.keys
.
DoubleDoubleOpenHashMap.keys
.
DoubleFloatOpenHashMap.keys
.
DoubleIntOpenHashMap.keys
.
DoubleLongOpenHashMap.keys
.
DoubleObjectOpenHashMap.keys
.
DoubleShortOpenHashMap.keys
.
FloatByteOpenHashMap.keys
.
FloatCharOpenHashMap.keys
.
FloatDoubleOpenHashMap.keys
.
FloatFloatOpenHashMap.keys
.
FloatIntOpenHashMap.keys
.
FloatLongOpenHashMap.keys
.
FloatObjectOpenHashMap.keys
.
FloatShortOpenHashMap.keys
.
IntByteOpenHashMap.keys
.
IntCharOpenHashMap.keys
.
IntDoubleOpenHashMap.keys
.
IntFloatOpenHashMap.keys
.
IntIntOpenHashMap.keys
.
IntLongOpenHashMap.keys
.
IntObjectOpenHashMap.keys
.
IntShortOpenHashMap.keys
.
KTypeVTypeOpenHashMap.keys
.
LongByteOpenHashMap.keys
.
LongCharOpenHashMap.keys
.
LongDoubleOpenHashMap.keys
.
LongFloatOpenHashMap.keys
.
LongIntOpenHashMap.keys
.
LongLongOpenHashMap.keys
.
LongObjectOpenHashMap.keys
.
LongShortOpenHashMap.keys
.
ObjectByteOpenHashMap.keys
.
ObjectCharOpenHashMap.keys
.
ObjectDoubleOpenHashMap.keys
.
ObjectFloatOpenHashMap.keys
.
ObjectIntOpenHashMap.keys
.
ObjectLongOpenHashMap.keys
.
ObjectObjectOpenHashMap.keys
.
ObjectShortOpenHashMap.keys
.
ShortByteOpenHashMap.keys
.
ShortCharOpenHashMap.keys
.
ShortDoubleOpenHashMap.keys
.
ShortFloatOpenHashMap.keys
.
ShortIntOpenHashMap.keys
.
ShortLongOpenHashMap.keys
.
ShortObjectOpenHashMap.keys
.
ShortShortOpenHashMap.keys
.
BitSet.bits
array.
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |