Uses of Annotation Interface
org.agrona.generation.DoNotSub
Packages that use DoNotSub
Package
Description
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 DoNotSubModifier and TypeFieldDescriptionstatic final intIntHashSet.DEFAULT_INITIAL_CAPACITYThe initial capacity used when none is specified in the constructor.static final intLongHashSet.DEFAULT_INITIAL_CAPACITYThe initial capacity used when none is specified in the constructor.static final intIntArrayList.INITIAL_CAPACITYInitial capacity to which the array will be sized.static final intLongArrayList.INITIAL_CAPACITYInitial capacity to which the array will be sized.static final intIntArrayQueue.MIN_CAPACITYMinimum capacity for the queue which must also be a power of 2.static final intLongArrayQueue.MIN_CAPACITYMinimum capacity for the queue which must also be a power of 2.Methods in org.agrona.collections with annotations of type DoNotSubModifier and TypeMethodDescriptionintInt2IntCounterMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intInt2IntHashMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intInt2ObjectCache.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intInt2ObjectHashMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intIntArrayList.capacity()The current capacity for the collection.intIntArrayQueue.capacity()The current capacity for the collection.intIntHashSet.capacity()Get the total capacity for the set to which the load factor with be a fraction of.intIntLruCache.capacity()Returns cache capacity.intLong2LongCounterMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intLong2LongHashMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intLong2ObjectCache.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intLong2ObjectHashMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intLongArrayList.capacity()The current capacity for the collection.intLongArrayQueue.capacity()The current capacity for the collection.intLongHashSet.capacity()Get the total capacity for the set to which the load factor with be a fraction of.intLongLruCache.capacity()Returns cache capacity.intObject2IntCounterMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intObject2IntHashMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intObject2LongCounterMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.intObject2LongHashMap.capacity()Get the total capacity for the map to which the load factor will be a fraction of.booleanbooleanintInt2IntHashMap.EntryIterator.hashCode()intInt2IntHashMap.EntryIterator.MapEntry.hashCode()intInt2IntHashMap.hashCode()intInt2ObjectCache.hashCode()intInt2ObjectHashMap.EntryIterator.MapEntry.hashCode()intInt2ObjectHashMap.hashCode()intIntArrayList.hashCode()intIntHashSet.hashCode()intLong2LongHashMap.EntryIterator.hashCode()intLong2LongHashMap.EntryIterator.MapEntry.hashCode()intLong2LongHashMap.hashCode()intLong2ObjectCache.hashCode()intLong2ObjectHashMap.EntryIterator.MapEntry.hashCode()intLong2ObjectHashMap.hashCode()intLongArrayList.hashCode()intLongHashSet.hashCode()intObject2IntHashMap.EntryIterator.hashCode()intObject2IntHashMap.EntryIterator.MapEntry.hashCode()intObject2IntHashMap.hashCode()intObject2LongHashMap.EntryIterator.hashCode()intObject2LongHashMap.EntryIterator.MapEntry.hashCode()intObject2LongHashMap.hashCode()intIntArrayList.indexOf(int value) Index of the first element with this value.intLongArrayList.indexOf(long value) Index of the first element with this value.intIntArrayList.lastIndexOf(int value) Index of the last element with this value.intLongArrayList.lastIndexOf(long value) Index of the last element with this value.intIntHashSet.IntIterator.remaining()Returns number of remaining (not yet visited) elements.intLongHashSet.LongIterator.remaining()Returns number of remaining (not yet visited) elements.intInt2IntCounterMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intInt2IntHashMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intInt2ObjectHashMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intIntHashSet.resizeThreshold()Get the actual threshold which when reached the map will resize.intLong2LongCounterMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intLong2LongHashMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intLong2ObjectHashMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intLongHashSet.resizeThreshold()Get the actual threshold which when reached the map will resize.intObject2IntCounterMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intObject2IntHashMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intObject2LongCounterMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intObject2LongHashMap.resizeThreshold()Get the actual threshold which when reached the map will resize.intInt2IntCounterMap.size()The current size of the map which at not atInt2IntCounterMap.initialValue().intInt2IntHashMap.EntrySet.size()intInt2IntHashMap.KeySet.size()intInt2IntHashMap.size()intInt2IntHashMap.ValueCollection.size()intInt2ObjectCache.EntrySet.size()intInt2ObjectCache.KeySet.size()intInt2ObjectCache.size()intInt2ObjectCache.ValueCollection.size()intInt2ObjectHashMap.EntrySet.size()intInt2ObjectHashMap.KeySet.size()intInt2ObjectHashMap.size()intInt2ObjectHashMap.ValueCollection.size()intIntArrayList.size()intIntArrayQueue.size()intIntHashSet.size()intLong2LongCounterMap.size()The current size of the map which at not atLong2LongCounterMap.initialValue().intLong2LongHashMap.EntrySet.size()intLong2LongHashMap.KeySet.size()intLong2LongHashMap.size()intLong2LongHashMap.ValueCollection.size()intLong2ObjectCache.EntrySet.size()intLong2ObjectCache.KeySet.size()intLong2ObjectCache.size()intLong2ObjectCache.ValueCollection.size()intLong2ObjectHashMap.EntrySet.size()intLong2ObjectHashMap.KeySet.size()intLong2ObjectHashMap.size()intLong2ObjectHashMap.ValueCollection.size()intLongArrayList.size()intLongArrayQueue.size()intLongHashSet.size()intObject2IntCounterMap.size()The current size of the map which at not atObject2IntCounterMap.initialValue().intObject2IntHashMap.EntrySet.size()intObject2IntHashMap.KeySet.size()intObject2IntHashMap.size()intObject2IntHashMap.ValueCollection.size()intObject2LongCounterMap.size()The current size of the map which at not atObject2LongCounterMap.initialValue().intObject2LongHashMap.EntrySet.size()intObject2LongHashMap.KeySet.size()intObject2LongHashMap.size()intObject2LongHashMap.ValueCollection.size()Method parameters in org.agrona.collections with annotations of type DoNotSubModifier and TypeMethodDescriptionvoidvoidbooleanIntArrayList.addAll(int index, IntArrayList list) Inserts all the elements from the specified list to this list at the specified position.booleanLongArrayList.addAll(int index, LongArrayList list) Inserts all the elements from the specified list to this list at the specified position.voidIntArrayList.addInt(int index, int element) Add an element without boxing at a given index.voidLongArrayList.addLong(int index, long element) Add an element without boxing at a given index.voidIntArrayList.ensureCapacity(int requiredCapacity) Ensure the backing array has a required capacity.voidLongArrayList.ensureCapacity(int requiredCapacity) Ensure the backing array has a required capacity.intIntArrayList.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.longLongArrayList.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.IntArrayList.get(int index) LongArrayList.get(int index) intIntArrayList.getInt(int index) Get the element at a given index without boxing.longLongArrayList.getLong(int index) Get the element at a given index without boxing.IntArrayList.remove(int index) Remove at a given index.LongArrayList.remove(int index) Remove at a given index.intIntArrayList.removeAt(int index) Remove at a given index.longLongArrayList.removeAt(int index) Remove at a given index.intIntArrayList.setInt(int index, int element) Set an element at a given index without boxing.longLongArrayList.setLong(int index, long element) Set an element at a given index without boxing.voidIntArrayList.wrap(int[] initialElements, int initialSize) Wrap an existing array without copying it.voidLongArrayList.wrap(long[] initialElements, int initialSize) Wrap an existing array without copying it.Constructor parameters in org.agrona.collections with annotations of type DoNotSubModifierConstructorDescriptionInt2IntCounterMap(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 and0as a missing value.IntHashSet(int proposedCapacity, float loadFactor) Construct a hash set with a proposed initial capacity, load factor, iterator caching support and0as 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-1as 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 and0as a missing value.LongHashSet(int proposedCapacity, float loadFactor) Construct a hash set with a proposed initial capacity, load factor, iterator caching support and0as 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-1as 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.