o to the set.i to the set.i to the set.Queue instances based on a best fit to the ConcurrentQueueSpec.longs, supporting low-contention CAS
operations.o is in the set.i is in the set.NonBlockingHashMapLong.containsKey(long).ConcurrentAutoTable.add(long) with -1Set 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.ConcurrentAutoTable.add(long) with +1ConcurrentAutoTable.get(), included for completeness.Iterator.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.Queue
interface sufficient for concurrent message passing.ConcurrentCircularArrayQueue.ConcurrentCircularArrayQueue.AtomicReferenceArrayQueue.long.ConcurrentHashMap
with better scaling properties and generally lower costs to mutate the Map.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.Queue.offer(Object) interface.Queue.offer(Object) interface.Queue.offer(Object) interface.Queue.offer(Object) interface.Queue.offer(Object) interface.MpscArrayQueue#offer(E)} if ConcurrentCircularArrayQueue.size() is less than threshold.ConcurrentLinkedQueue which is an unbounded multi-producer, multi-consumer queue which
is further encumbered by the need to implement the full range of Queue methods.Queue.peek() interface.Queue.peek() interface.Queue.peek() interface.Queue.peek() interface.Queue.peek() interface.Queue.poll() interface.Queue.poll() interface.Queue.poll() interface.Queue.poll() interface.Queue.poll() interface.Queue.poll() interface.Queue.poll() interface.Queue.poll() interface.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.Queue instances based on a best fit to the ConcurrentQueueSpec.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.AtomicReferenceFieldUpdater and similar but their performance is arguably worse than the DIY approach
(depending on JVM version) while Unsafe intrinsification is a far lesser challenge for JIT compilers.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.Copyright © 2013–2017. All rights reserved.