Uses of Annotation Interface
org.agrona.generation.DoNotSub

Packages that use DoNotSub

Package	Description
org.agrona.collections	Collections classes that support primitive types and tend to be cache friendly.

Uses of DoNotSub in org.agrona.collections

Fields in org.agrona.collections with annotations of type DoNotSub

Modifier and Type	Field	Description
private final int	Int2ObjectCache.capacity
private final int	IntLruCache.capacity
private final int	Long2ObjectCache.capacity
private final int	LongLruCache.capacity
static final int	IntHashSet.DEFAULT_INITIAL_CAPACITY	The initial capacity used when none is specified in the constructor.
static final int	LongHashSet.DEFAULT_INITIAL_CAPACITY	The initial capacity used when none is specified in the constructor.
private int	IntArrayQueue.head
private int	LongArrayQueue.head
private int	IntArrayQueue.IntIterator.index
private int	LongArrayQueue.LongIterator.index
static final int	IntArrayList.INITIAL_CAPACITY	Initial capacity to which the array will be sized.
static final int	LongArrayList.INITIAL_CAPACITY	Initial capacity to which the array will be sized.
private final float	Int2IntCounterMap.loadFactor
private final float	Long2LongCounterMap.loadFactor
private final int	Int2ObjectCache.mask
private final int	Long2ObjectCache.mask
private static final int	Int2IntCounterMap.MIN_CAPACITY
(package private) static final int	Int2IntHashMap.MIN_CAPACITY
(package private) static final int	Int2ObjectHashMap.MIN_CAPACITY
static final int	IntArrayQueue.MIN_CAPACITY	Minimum capacity for the queue which must also be a power of 2.
private static final int	Long2LongCounterMap.MIN_CAPACITY
(package private) static final int	Long2LongHashMap.MIN_CAPACITY
(package private) static final int	Long2ObjectHashMap.MIN_CAPACITY
static final int	LongArrayQueue.MIN_CAPACITY	Minimum capacity for the queue which must also be a power of 2.
private static final int	Object2IntCounterMap.MIN_CAPACITY
(package private) static final int	Object2IntHashMap.MIN_CAPACITY
private static final int	Object2LongCounterMap.MIN_CAPACITY
(package private) static final int	Object2LongHashMap.MIN_CAPACITY
private int	Int2ObjectHashMap.AbstractIterator.posCounter
private int	Long2ObjectHashMap.AbstractIterator.posCounter
private int	Object2IntHashMap.AbstractIterator.posCounter
private int	Object2LongHashMap.AbstractIterator.posCounter
private int	Int2ObjectCache.AbstractIterator.position
private int	Long2ObjectCache.AbstractIterator.position
private int	Int2IntHashMap.AbstractIterator.positionCounter
private int	IntHashSet.IntIterator.positionCounter
private int	Long2LongHashMap.AbstractIterator.positionCounter
private int	LongHashSet.LongIterator.positionCounter
private int	Int2IntHashMap.AbstractIterator.remaining
private int	Int2ObjectCache.AbstractIterator.remaining
private int	Int2ObjectHashMap.AbstractIterator.remaining
private int	IntHashSet.IntIterator.remaining
private int	Long2LongHashMap.AbstractIterator.remaining
private int	Long2ObjectCache.AbstractIterator.remaining
private int	Long2ObjectHashMap.AbstractIterator.remaining
private int	LongHashSet.LongIterator.remaining
private int	Object2IntHashMap.AbstractIterator.remaining
private int	Object2LongHashMap.AbstractIterator.remaining
private int	Int2IntCounterMap.resizeThreshold
private int	Int2IntHashMap.resizeThreshold
private int	Int2ObjectHashMap.resizeThreshold
private int	IntHashSet.resizeThreshold
private int	Long2LongCounterMap.resizeThreshold
private int	Long2LongHashMap.resizeThreshold
private int	Long2ObjectHashMap.resizeThreshold
private int	LongHashSet.resizeThreshold
private int	Object2IntCounterMap.resizeThreshold
private int	Object2IntHashMap.resizeThreshold
private int	Object2LongCounterMap.resizeThreshold
private int	Object2LongHashMap.resizeThreshold
private final int	Int2ObjectCache.setSize
private final int	Long2ObjectCache.setSize
private final int	Int2ObjectCache.setSizeShift
private final int	Long2ObjectCache.setSizeShift
private int	Int2IntCounterMap.size
private int	Int2IntHashMap.size
private int	Int2ObjectCache.size
private int	Int2ObjectHashMap.size
private int	IntArrayList.size
private int	IntLruCache.size
private int	Long2LongCounterMap.size
private int	Long2LongHashMap.size
private int	Long2ObjectCache.size
private int	Long2ObjectHashMap.size
private int	LongArrayList.size
private int	LongLruCache.size
private int	Object2IntCounterMap.size
private int	Object2IntHashMap.size
private int	Object2LongCounterMap.size
private int	Object2LongHashMap.size
private int	IntHashSet.sizeOfArrayValues
private int	LongHashSet.sizeOfArrayValues
private int	Int2IntHashMap.AbstractIterator.stopCounter
private int	Int2ObjectHashMap.AbstractIterator.stopCounter
private int	IntHashSet.IntIterator.stopCounter
private int	Long2LongHashMap.AbstractIterator.stopCounter
private int	Long2ObjectHashMap.AbstractIterator.stopCounter
private int	LongHashSet.LongIterator.stopCounter
private int	Object2IntHashMap.AbstractIterator.stopCounter
private int	Object2LongHashMap.AbstractIterator.stopCounter
private int	IntArrayQueue.tail
private int	LongArrayQueue.tail

Methods in org.agrona.collections with annotations of type DoNotSub

Modifier and Type	Method	Description
int	Int2IntCounterMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Int2IntHashMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Int2ObjectCache.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Int2ObjectHashMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	IntArrayList.capacity()	The current capacity for the collection.
int	IntArrayQueue.capacity()	The current capacity for the collection.
int	IntHashSet.capacity()	Get the total capacity for the set to which the load factor with be a fraction of.
int	IntLruCache.capacity()	Returns cache capacity.
int	Long2LongCounterMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Long2LongHashMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Long2ObjectCache.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Long2ObjectHashMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	LongArrayList.capacity()	The current capacity for the collection.
int	LongArrayQueue.capacity()	The current capacity for the collection.
int	LongHashSet.capacity()	Get the total capacity for the set to which the load factor with be a fraction of.
int	LongLruCache.capacity()	Returns cache capacity.
int	Object2IntCounterMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Object2IntHashMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Object2LongCounterMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
int	Object2LongHashMap.capacity()	Get the total capacity for the map to which the load factor will be a fraction of.
(package private) void	IntHashSet.compactChain(int deleteIndex)
(package private) void	LongHashSet.compactChain(int deleteIndex)
boolean	Int2IntHashMap.EntryIterator.MapEntry.equals(Object o)
boolean	Long2LongHashMap.EntryIterator.MapEntry.equals(Object o)
int	Int2IntHashMap.EntryIterator.hashCode()
int	Int2IntHashMap.EntryIterator.MapEntry.hashCode()
int	Int2IntHashMap.hashCode()
int	Int2ObjectCache.hashCode()
int	Int2ObjectHashMap.EntryIterator.MapEntry.hashCode()
int	Int2ObjectHashMap.hashCode()
int	IntArrayList.hashCode()
int	IntHashSet.hashCode()
int	Long2LongHashMap.EntryIterator.hashCode()
int	Long2LongHashMap.EntryIterator.MapEntry.hashCode()
int	Long2LongHashMap.hashCode()
int	Long2ObjectCache.hashCode()
int	Long2ObjectHashMap.EntryIterator.MapEntry.hashCode()
int	Long2ObjectHashMap.hashCode()
int	LongArrayList.hashCode()
int	LongHashSet.hashCode()
int	Object2IntHashMap.EntryIterator.hashCode()
int	Object2IntHashMap.EntryIterator.MapEntry.hashCode()
int	Object2IntHashMap.hashCode()
int	Object2LongHashMap.EntryIterator.hashCode()
int	Object2LongHashMap.EntryIterator.MapEntry.hashCode()
int	Object2LongHashMap.hashCode()
int	IntArrayList.indexOf(int value)	Index of the first element with this value.
int	LongArrayList.indexOf(long value)	Index of the first element with this value.
protected final int	Int2IntHashMap.AbstractIterator.keyPosition()	Returns position of the key of the current entry.
protected final int	Long2LongHashMap.AbstractIterator.keyPosition()	Returns position of the key of the current entry.
int	IntArrayList.lastIndexOf(int value)	Index of the last element with this value.
int	LongArrayList.lastIndexOf(long value)	Index of the last element with this value.
private static int	Int2IntCounterMap.next(int index, int mask)
private static int	Int2IntHashMap.next(int index, int mask)
private static int	IntHashSet.next(int index, int mask)
private static int	Long2LongCounterMap.next(int index, int mask)
private static int	Long2LongHashMap.next(int index, int mask)
private static int	LongHashSet.next(int index, int mask)
protected final int	Int2ObjectCache.AbstractIterator.position()	Position of the current element.
protected final int	Int2ObjectHashMap.AbstractIterator.position()	Position of the current element.
private int	IntHashSet.IntIterator.position(int[] values)
protected final int	Long2ObjectCache.AbstractIterator.position()	Position of the current element.
protected final int	Long2ObjectHashMap.AbstractIterator.position()	Position of the current element.
private int	LongHashSet.LongIterator.position(long[] values)
protected final int	Object2IntHashMap.AbstractIterator.position()	Position of the current element.
protected final int	Object2LongHashMap.AbstractIterator.position()	Position of the current element.
int	Int2IntHashMap.AbstractIterator.remaining()	Number of remaining elements.
int	Int2ObjectHashMap.AbstractIterator.remaining()	Number of remaining elements.
int	IntHashSet.IntIterator.remaining()	Returns number of remaining (not yet visited) elements.
int	Long2LongHashMap.AbstractIterator.remaining()	Number of remaining elements.
int	Long2ObjectHashMap.AbstractIterator.remaining()	Number of remaining elements.
int	LongHashSet.LongIterator.remaining()	Returns number of remaining (not yet visited) elements.
int	Int2IntCounterMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Int2IntHashMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Int2ObjectHashMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	IntHashSet.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Long2LongCounterMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Long2LongHashMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Long2ObjectHashMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	LongHashSet.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Object2IntCounterMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Object2IntHashMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Object2LongCounterMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
int	Object2LongHashMap.resizeThreshold()	Get the actual threshold which when reached the map will resize.
private void	Int2ObjectCache.shuffleDown(int setBeginIndex)
private void	Long2ObjectCache.shuffleDown(int setBeginIndex)
private void	Int2ObjectCache.shuffleUp(int fromIndex, int toIndex)
private void	Long2ObjectCache.shuffleUp(int fromIndex, int toIndex)
int	Int2IntCounterMap.size()	The current size of the map which at not at Int2IntCounterMap.initialValue().
int	Int2IntHashMap.EntrySet.size()
int	Int2IntHashMap.KeySet.size()
int	Int2IntHashMap.size()
int	Int2IntHashMap.ValueCollection.size()
int	Int2ObjectCache.EntrySet.size()
int	Int2ObjectCache.KeySet.size()
int	Int2ObjectCache.size()
int	Int2ObjectCache.ValueCollection.size()
int	Int2ObjectHashMap.EntrySet.size()
int	Int2ObjectHashMap.KeySet.size()
int	Int2ObjectHashMap.size()
int	Int2ObjectHashMap.ValueCollection.size()
int	IntArrayList.size()
int	IntArrayQueue.size()
int	IntHashSet.size()
int	Long2LongCounterMap.size()	The current size of the map which at not at Long2LongCounterMap.initialValue().
int	Long2LongHashMap.EntrySet.size()
int	Long2LongHashMap.KeySet.size()
int	Long2LongHashMap.size()
int	Long2LongHashMap.ValueCollection.size()
int	Long2ObjectCache.EntrySet.size()
int	Long2ObjectCache.KeySet.size()
int	Long2ObjectCache.size()
int	Long2ObjectCache.ValueCollection.size()
int	Long2ObjectHashMap.EntrySet.size()
int	Long2ObjectHashMap.KeySet.size()
int	Long2ObjectHashMap.size()
int	Long2ObjectHashMap.ValueCollection.size()
int	LongArrayList.size()
int	LongArrayQueue.size()
int	LongHashSet.size()
int	Object2IntCounterMap.size()	The current size of the map which at not at Object2IntCounterMap.initialValue().
int	Object2IntHashMap.EntrySet.size()
int	Object2IntHashMap.KeySet.size()
int	Object2IntHashMap.size()
int	Object2IntHashMap.ValueCollection.size()
int	Object2LongCounterMap.size()	The current size of the map which at not at Object2LongCounterMap.initialValue().
int	Object2LongHashMap.EntrySet.size()
int	Object2LongHashMap.KeySet.size()
int	Object2LongHashMap.size()
int	Object2LongHashMap.ValueCollection.size()

Method parameters in org.agrona.collections with annotations of type DoNotSub

Modifier and Type	Method	Description
void	IntArrayList.add(int index, Integer element)
void	LongArrayList.add(int index, Long element)
boolean	IntArrayList.addAll(int index, IntArrayList list)	Inserts all the elements from the specified list to this list at the specified position.
boolean	LongArrayList.addAll(int index, LongArrayList list)	Inserts all the elements from the specified list to this list at the specified position.
void	IntArrayList.addInt(int index, int element)	Add an element without boxing at a given index.
void	LongArrayList.addLong(int index, long element)	Add an element without boxing at a given index.
private void	Int2IntCounterMap.capacity(int newCapacity)
private void	Int2IntHashMap.capacity(int newCapacity)
private void	Long2LongCounterMap.capacity(int newCapacity)
private void	Long2LongHashMap.capacity(int newCapacity)
private void	IntArrayList.checkIndex(int index)
private void	LongArrayList.checkIndex(int index)
private void	IntArrayList.checkIndexForAdd(int index)
private void	LongArrayList.checkIndexForAdd(int index)
private void	Int2IntCounterMap.compactChain(int deleteKeyIndex)
private void	Int2IntHashMap.compactChain(int deleteKeyIndex)
private void	Int2ObjectHashMap.compactChain(int deleteIndex)
private void	Long2LongCounterMap.compactChain(int deleteKeyIndex)
private void	Long2LongHashMap.compactChain(int deleteKeyIndex)
private void	Long2ObjectHashMap.compactChain(int deleteIndex)
private void	Object2IntCounterMap.compactChain(int deleteIndex)
private void	Object2IntHashMap.compactChain(int deleteIndex)
private void	Object2LongCounterMap.compactChain(int deleteIndex)
private void	Object2LongHashMap.compactChain(int deleteIndex)
void	IntArrayList.ensureCapacity(int requiredCapacity)	Ensure the backing array has a required capacity.
void	LongArrayList.ensureCapacity(int requiredCapacity)	Ensure the backing array has a required capacity.
private void	IntArrayList.ensureCapacityPrivate(int requiredCapacity)
private void	LongArrayList.ensureCapacityPrivate(int requiredCapacity)
int	IntArrayList.fastUnorderedRemove(int index)	Removes element at index, but instead of copying all elements to the left, it replaces the item in the slot with the last item in the list.
long	LongArrayList.fastUnorderedRemove(int index)	Removes element at index, but instead of copying all elements to the left, it replaces the item in the slot with the last item in the list.
Integer	IntArrayList.get(int index)
Long	LongArrayList.get(int index)
int	IntArrayList.getInt(int index)	Get the element at a given index without boxing.
long	LongArrayList.getLong(int index)	Get the element at a given index without boxing.
private void	IntLruCache.makeMostRecent(int key, Object value, int fromIndex)
private void	LongLruCache.makeMostRecent(long key, Object value, int fromIndex)
private void	Int2IntCounterMap.rehash(int newCapacity)
private void	Int2IntHashMap.rehash(int newCapacity)
private void	Int2ObjectHashMap.rehash(int newCapacity)
private void	IntHashSet.rehash(int newCapacity)
private void	Long2LongCounterMap.rehash(int newCapacity)
private void	Long2LongHashMap.rehash(int newCapacity)
private void	Long2ObjectHashMap.rehash(int newCapacity)
private void	LongHashSet.rehash(int newCapacity)
private void	Object2IntCounterMap.rehash(int newCapacity)
private void	Object2IntHashMap.rehash(int newCapacity)
private void	Object2LongCounterMap.rehash(int newCapacity)
private void	Object2LongHashMap.rehash(int newCapacity)
Integer	IntArrayList.remove(int index)	Remove at a given index.
Long	LongArrayList.remove(int index)	Remove at a given index.
int	IntArrayList.removeAt(int index)	Remove at a given index.
long	LongArrayList.removeAt(int index)	Remove at a given index.
Integer	IntArrayList.set(int index, Integer element)
Long	LongArrayList.set(int index, Long element)
int	IntArrayList.setInt(int index, int element)	Set an element at a given index without boxing.
long	LongArrayList.setLong(int index, long element)	Set an element at a given index without boxing.
void	IntArrayList.wrap(int[] initialElements, int initialSize)	Wrap an existing array without copying it.
void	LongArrayList.wrap(long[] initialElements, int initialSize)	Wrap an existing array without copying it.

Constructor parameters in org.agrona.collections with annotations of type DoNotSub

Modifier	Constructor	Description
	Int2IntCounterMap(int initialCapacity, float loadFactor, int initialValue)	Construct a new counter map with the initial value for the counter provided.
	Int2IntCounterMap(int initialCapacity, float loadFactor, int initialValue)	Construct a new counter map with the initial value for the counter provided.
	Int2IntHashMap(int initialCapacity, float loadFactor, int missingValue)	Create a map instance that does not allocate iterators with specified parameters.
	Int2IntHashMap(int initialCapacity, float loadFactor, int missingValue)	Create a map instance that does not allocate iterators with specified parameters.
	Int2IntHashMap(int initialCapacity, float loadFactor, int missingValue, boolean shouldAvoidAllocation)	Create a map instance with specified parameters.
	Int2IntHashMap(int initialCapacity, float loadFactor, int missingValue, boolean shouldAvoidAllocation)	Create a map instance with specified parameters.
	Int2NullableObjectHashMap(int initialCapacity, float loadFactor)	Constructs map with given initial capacity and load factory and enables caching of iterators.
	Int2NullableObjectHashMap(int initialCapacity, float loadFactor, boolean shouldAvoidAllocation)	Construct a new map allowing a configuration for initial capacity and load factor.
	Int2ObjectCache(int numSets, int setSize, Consumer<V> evictionConsumer)	Constructs cache with provided configuration.
	Int2ObjectCache(int numSets, int setSize, Consumer<V> evictionConsumer)	Constructs cache with provided configuration.
	Int2ObjectHashMap(int initialCapacity, float loadFactor)	Constructs map with given initial capacity and load factory and enables caching of iterators.
	Int2ObjectHashMap(int initialCapacity, float loadFactor, boolean shouldAvoidAllocation)	Construct a new map allowing a configuration for initial capacity and load factor.
	IntArrayList(int[] initialElements, int initialSize, int nullValue)	Create a new list that wraps an existing arrays without copying it.
	IntArrayList(int initialCapacity, int nullValue)	Construct a new list.
	IntArrayQueue(int initialCapacity, int nullValue)	Construct a new queue default to cached iterators.
	IntArrayQueue(int initialCapacity, int nullValue, boolean shouldAvoidAllocation)	Construct a new queue providing all the config options.
	IntHashSet(int proposedCapacity)	Construct a hash set with a proposed capacity, Hashing.DEFAULT_LOAD_FACTOR, iterator caching support and 0 as a missing value.
	IntHashSet(int proposedCapacity, float loadFactor)	Construct a hash set with a proposed initial capacity, load factor, iterator caching support and 0 as a missing value.
	IntHashSet(int proposedCapacity, float loadFactor, boolean shouldAvoidAllocation)	Construct a hash set with a proposed initial capacity, load factor, iterator caching support and -1 as a missing value.
	IntLruCache(int capacity, IntFunction<E> factory, Consumer<E> closer)	Constructor.
	Long2LongCounterMap(int initialCapacity, float loadFactor, long initialValue)	Construct a new counter map with the initial value for the counter provided.
	Long2LongCounterMap(int initialCapacity, float loadFactor, long initialValue)	Construct a new counter map with the initial value for the counter provided.
	Long2LongHashMap(int initialCapacity, float loadFactor, long missingValue)	Create a map instance that does not allocate iterators with specified parameters.
	Long2LongHashMap(int initialCapacity, float loadFactor, long missingValue)	Create a map instance that does not allocate iterators with specified parameters.
	Long2LongHashMap(int initialCapacity, float loadFactor, long missingValue, boolean shouldAvoidAllocation)	Create a map instance with specified parameters.
	Long2LongHashMap(int initialCapacity, float loadFactor, long missingValue, boolean shouldAvoidAllocation)	Create a map instance with specified parameters.
	Long2NullableObjectHashMap(int initialCapacity, float loadFactor)	Constructs map with given initial capacity and load factory and enables caching of iterators.
	Long2NullableObjectHashMap(int initialCapacity, float loadFactor, boolean shouldAvoidAllocation)	Construct a new map allowing a configuration for initial capacity and load factor.
	Long2ObjectCache(int numSets, int setSize, Consumer<V> evictionConsumer)	Constructs cache with provided configuration.
	Long2ObjectCache(int numSets, int setSize, Consumer<V> evictionConsumer)	Constructs cache with provided configuration.
	Long2ObjectHashMap(int initialCapacity, float loadFactor)	Constructs map with given initial capacity and load factory and enables caching of iterators.
	Long2ObjectHashMap(int initialCapacity, float loadFactor, boolean shouldAvoidAllocation)	Construct a new map allowing a configuration for initial capacity and load factor.
	LongArrayList(int initialCapacity, long nullValue)	Construct a new list.
	LongArrayList(long[] initialElements, int initialSize, long nullValue)	Create a new list that wraps an existing arrays without copying it.
	LongArrayQueue(int initialCapacity, long nullValue)	Construct a new queue default to cached iterators.
	LongArrayQueue(int initialCapacity, long nullValue, boolean shouldAvoidAllocation)	Construct a new queue providing all the config options.
	LongHashSet(int proposedCapacity)	Construct a hash set with a proposed capacity, Hashing.DEFAULT_LOAD_FACTOR, iterator caching support and 0 as a missing value.
	LongHashSet(int proposedCapacity, float loadFactor)	Construct a hash set with a proposed initial capacity, load factor, iterator caching support and 0 as a missing value.
	LongHashSet(int proposedCapacity, float loadFactor, boolean shouldAvoidAllocation)	Construct a hash set with a proposed initial capacity, load factor, iterator caching support and -1 as a missing value.
	LongLruCache(int capacity, LongFunction<E> factory, Consumer<E> closer)	Constructor.
	Object2IntCounterMap(int initialCapacity, float loadFactor, int initialValue)	Construct a new counter map with the initial value for the counter provided.
	Object2IntCounterMap(int initialCapacity, float loadFactor, int initialValue)	Construct a new counter map with the initial value for the counter provided.
	Object2IntHashMap(int initialCapacity, float loadFactor, int missingValue)	Construct a new map allowing a configuration for initial capacity and load factor.
	Object2IntHashMap(int initialCapacity, float loadFactor, int missingValue, boolean shouldAvoidAllocation)	Construct a new map allowing a configuration for initial capacity and load factor.
	Object2LongCounterMap(int initialCapacity, float loadFactor, long initialValue)	Construct a new counter map with the initial value for the counter provided.
	Object2LongCounterMap(int initialCapacity, float loadFactor, long initialValue)	Construct a new counter map with the initial value for the counter provided.
	Object2LongHashMap(int initialCapacity, float loadFactor, long missingValue)	Construct a new map allowing a configuration for initial capacity and load factor.
	Object2LongHashMap(int initialCapacity, float loadFactor, long missingValue, boolean shouldAvoidAllocation)	Construct a new map allowing a configuration for initial capacity and load factor.