|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
v to this vector.
o to the set.
i to the set.
i to the set.
o to the set.
longs, supporting low-contention CAS
operations.o is in the set.
i is in the set.
NonBlockingHashMapLong.containsKey(long).
ConcurrentAutoTable.add(long) with -1
Set view of the mappings contained in this map.
Set view of the mappings contained in this map.
Set view of the mappings contained in this map.
ConcurrentAutoTable.get().
null
if this map contains no mapping for the key.
null
if this map contains no mapping for the key.
NonBlockingHashMapLong.get(long).
null
if this map contains no mapping for the key.
null
if this map contains no mapping for the key.
H2O Cloud.Node in an H2O Cloud.ConcurrentAutoTable.add(long) with +1
ConcurrentAutoTable.get(), included for completeness.
Iterator.
RequestBuilders.Response for finished job.
RequestBuilders.Response for finished job.
Response for finished job.
Response for finished job.
Response for finished job.
Response.
Response.
Set view of the keys contained in this map.
Set view of the keys contained in this map; with care
the keys may be iterated over without auto-boxing.
Set view of the keys contained in this map.
ConcurrentAutoTable.get(), included for completeness.
long.
ConcurrentHashMap
with better scaling properties and generally lower costs to mutate the Map.java.util.ConcurrentHashMap
with primitive long keys, better scaling properties and
generally lower costs.Iterator and Enumeration
interfaces, generified to the Long class and supporting a
non-auto-boxing NonBlockingHashMapLong.IteratorLong.nextLong() function.NonBlockingHashMap making it implement the
Set interface.NonBlockingHashSet.
ConcurrentHashMap
with better scaling properties and generally lower costs to mutate the Map.longs.ConcurrentAutoTable.toString(), showing internal structure.
NonBlockingHashMapLong.put(long, TypeV).
NonBlockingHashMap.put(TypeK, TypeV) if-and-only-if the key is not mapped.
NonBlockingHashMapLong.put(long, TypeV) if-and-only-if the key is not mapped.
NonBlockingHashMapLong.putIfAbsent(long, TypeV).
NonBlockingIdentityHashMap.put(TypeK, TypeV) if-and-only-if the key is not mapped.
NonBlockingHashMap.remove(Object) if-and-only-if the key is mapped
to a value which is equals to the given value.
NonBlockingHashMapLong.IteratorLong.next() or NonBlockingHashMapLong.IteratorLong.nextLong().
NonBlockingHashMapLong.remove(long) if-and-only-if the key is mapped
to a value which is equals to the given value.
NonBlockingHashMapLong.remove(long).
NonBlockingHashMapLong.remove(long,Object).
o from the set.
NonBlockingIdentityHashMap.remove(Object) if-and-only-if the key is mapped
to a value which is equals to the given value.
o from the set.
i from the set.
put(key,val) if-and-only-if the key is
mapped to some value already.
put(key,newValue) if-and-only-if the key is
mapped a value which is equals to oldValue.
put(key,val) if-and-only-if the key is
mapped to some value already.
put(key,newValue) if-and-only-if the key is
mapped a value which is equals to oldValue.
NonBlockingHashMapLong.replace(long, TypeV).
NonBlockingHashMapLong.replace(long, TypeV).
put(key,val) if-and-only-if the key is
mapped to some value already.
put(key,newValue) if-and-only-if the key is
mapped a value which is equals to oldValue.
long value converted to a string.
Unsafe object.Collection view of the values contained in this map.
Collection view of the values contained in this map.
Collection view of the values contained in this map.
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||