Package com.carrotsearch.hppc

package com.carrotsearch.hppc

Related Packages

Package	Description
com.carrotsearch.hppc.comparators
com.carrotsearch.hppc.cursors
com.carrotsearch.hppc.predicates
com.carrotsearch.hppc.procedures
com.carrotsearch.hppc.sorting

Class	Description
AbstractIterator<E>	Simplifies the implementation of iterators a bit.
Accountable	Anything that could be accounted for memory usage
ArraySizingStrategy	Resizing (growth) strategy for array-backed buffers.
BitMixer	Bit mixing utilities.
BitSet	An "open" BitSet implementation that allows direct access to the array of words storing the bits.
BitSetIterator	An iterator to iterate over set bits in an BitSet.
BoundedProportionalArraySizingStrategy	Array resizing proportional to the current buffer size, optionally kept within the given minimum and maximum growth limits.
BufferAllocationException
ByteArrayDeque	An array-backed ByteDeque.
ByteArrayList	An array-backed list of bytes.
ByteCollection	A collection allows basic, efficient operations on sets of elements (difference and intersection).
ByteContainer	A generic container holding bytes.
ByteDeque	A linear collection that supports element insertion and removal at both ends.
ByteIndexedContainer	An indexed container provides random access to elements based on an index.
ByteLookupContainer	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
ByteStack	A subclass of ByteArrayList adding stack-related utility methods.
CharArrayDeque	An array-backed CharDeque.
CharArrayList	An array-backed list of chars.
CharByteAssociativeContainer	An associative container from keys to (one or possibly more) values.
CharByteHashMap	A hash map of char to byte, implemented using open addressing with linear probing for collision resolution.
CharByteMap	An associative container with unique binding from keys to a single value.
CharByteWormMap	A hash map of char to byte, implemented using Worm Hashing strategy.
CharCharAssociativeContainer	An associative container from keys to (one or possibly more) values.
CharCharHashMap	A hash map of char to char, implemented using open addressing with linear probing for collision resolution.
CharCharMap	An associative container with unique binding from keys to a single value.
CharCharWormMap	A hash map of char to char, implemented using Worm Hashing strategy.
CharCollection	A collection allows basic, efficient operations on sets of elements (difference and intersection).
CharContainer	A generic container holding chars.
CharDeque	A linear collection that supports element insertion and removal at both ends.
CharDoubleAssociativeContainer	An associative container from keys to (one or possibly more) values.
CharDoubleHashMap	A hash map of char to double, implemented using open addressing with linear probing for collision resolution.
CharDoubleMap	An associative container with unique binding from keys to a single value.
CharDoubleWormMap	A hash map of char to double, implemented using Worm Hashing strategy.
CharFloatAssociativeContainer	An associative container from keys to (one or possibly more) values.
CharFloatHashMap	A hash map of char to float, implemented using open addressing with linear probing for collision resolution.
CharFloatMap	An associative container with unique binding from keys to a single value.
CharFloatWormMap	A hash map of char to float, implemented using Worm Hashing strategy.
CharHashSet	A hash set of chars, implemented using using open addressing with linear probing for collision resolution.
CharIndexedContainer	An indexed container provides random access to elements based on an index.
CharIntAssociativeContainer	An associative container from keys to (one or possibly more) values.
CharIntHashMap	A hash map of char to int, implemented using open addressing with linear probing for collision resolution.
CharIntMap	An associative container with unique binding from keys to a single value.
CharIntWormMap	A hash map of char to int, implemented using Worm Hashing strategy.
CharLongAssociativeContainer	An associative container from keys to (one or possibly more) values.
CharLongHashMap	A hash map of char to long, implemented using open addressing with linear probing for collision resolution.
CharLongMap	An associative container with unique binding from keys to a single value.
CharLongWormMap	A hash map of char to long, implemented using Worm Hashing strategy.
CharLookupContainer	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
CharObjectAssociativeContainer<VType>	An associative container from keys to (one or possibly more) values.
CharObjectHashMap<VType>	A hash map of char to Object, implemented using open addressing with linear probing for collision resolution.
CharObjectMap<VType>	An associative container with unique binding from keys to a single value.
CharObjectWormMap<VType>	A hash map of char to Object, implemented using Worm Hashing strategy.
CharSet	A set of chars.
CharShortAssociativeContainer	An associative container from keys to (one or possibly more) values.
CharShortHashMap	A hash map of char to short, implemented using open addressing with linear probing for collision resolution.
CharShortMap	An associative container with unique binding from keys to a single value.
CharShortWormMap	A hash map of char to short, implemented using Worm Hashing strategy.
CharStack	A subclass of CharArrayList adding stack-related utility methods.
CharWormSet	A hash set of chars, implemented using Worm Hashing strategy.
Containers	Constants used as defaults in containers.
DoubleArrayDeque	An array-backed DoubleDeque.
DoubleArrayList	An array-backed list of doubles.
DoubleCollection	A collection allows basic, efficient operations on sets of elements (difference and intersection).
DoubleContainer	A generic container holding doubles.
DoubleDeque	A linear collection that supports element insertion and removal at both ends.
DoubleIndexedContainer	An indexed container provides random access to elements based on an index.
DoubleLookupContainer	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
DoubleStack	A subclass of DoubleArrayList adding stack-related utility methods.
FloatArrayDeque	An array-backed FloatDeque.
FloatArrayList	An array-backed list of floats.
FloatCollection	A collection allows basic, efficient operations on sets of elements (difference and intersection).
FloatContainer	A generic container holding floats.
FloatDeque	A linear collection that supports element insertion and removal at both ends.
FloatIndexedContainer	An indexed container provides random access to elements based on an index.
FloatLookupContainer	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
FloatStack	A subclass of FloatArrayList adding stack-related utility methods.
Generated
HashContainers
IntArrayDeque	An array-backed IntDeque.
IntArrayList	An array-backed list of ints.
IntByteAssociativeContainer	An associative container from keys to (one or possibly more) values.
IntByteHashMap	A hash map of int to byte, implemented using open addressing with linear probing for collision resolution.
IntByteMap	An associative container with unique binding from keys to a single value.
IntByteWormMap	A hash map of int to byte, implemented using Worm Hashing strategy.
IntCharAssociativeContainer	An associative container from keys to (one or possibly more) values.
IntCharHashMap	A hash map of int to char, implemented using open addressing with linear probing for collision resolution.
IntCharMap	An associative container with unique binding from keys to a single value.
IntCharWormMap	A hash map of int to char, implemented using Worm Hashing strategy.
IntCollection	A collection allows basic, efficient operations on sets of elements (difference and intersection).
IntContainer	A generic container holding ints.
IntDeque	A linear collection that supports element insertion and removal at both ends.
IntDoubleAssociativeContainer	An associative container from keys to (one or possibly more) values.
IntDoubleHashMap	A hash map of int to double, implemented using open addressing with linear probing for collision resolution.
IntDoubleMap	An associative container with unique binding from keys to a single value.
IntDoubleWormMap	A hash map of int to double, implemented using Worm Hashing strategy.
IntFloatAssociativeContainer	An associative container from keys to (one or possibly more) values.
IntFloatHashMap	A hash map of int to float, implemented using open addressing with linear probing for collision resolution.
IntFloatMap	An associative container with unique binding from keys to a single value.
IntFloatWormMap	A hash map of int to float, implemented using Worm Hashing strategy.
IntHashSet	A hash set of ints, implemented using using open addressing with linear probing for collision resolution.
IntIndexedContainer	An indexed container provides random access to elements based on an index.
IntIntAssociativeContainer	An associative container from keys to (one or possibly more) values.
IntIntHashMap	A hash map of int to int, implemented using open addressing with linear probing for collision resolution.
IntIntMap	An associative container with unique binding from keys to a single value.
IntIntWormMap	A hash map of int to int, implemented using Worm Hashing strategy.
IntLongAssociativeContainer	An associative container from keys to (one or possibly more) values.
IntLongHashMap	A hash map of int to long, implemented using open addressing with linear probing for collision resolution.
IntLongMap	An associative container with unique binding from keys to a single value.
IntLongWormMap	A hash map of int to long, implemented using Worm Hashing strategy.
IntLookupContainer	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
IntObjectAssociativeContainer<VType>	An associative container from keys to (one or possibly more) values.
IntObjectHashMap<VType>	A hash map of int to Object, implemented using open addressing with linear probing for collision resolution.
IntObjectMap<VType>	An associative container with unique binding from keys to a single value.
IntObjectWormMap<VType>	A hash map of int to Object, implemented using Worm Hashing strategy.
IntSet	A set of ints.
IntShortAssociativeContainer	An associative container from keys to (one or possibly more) values.
IntShortHashMap	A hash map of int to short, implemented using open addressing with linear probing for collision resolution.
IntShortMap	An associative container with unique binding from keys to a single value.
IntShortWormMap	A hash map of int to short, implemented using Worm Hashing strategy.
IntStack	A subclass of IntArrayList adding stack-related utility methods.
IntWormSet	A hash set of ints, implemented using Worm Hashing strategy.
LongArrayDeque	An array-backed LongDeque.
LongArrayList	An array-backed list of longs.
LongByteAssociativeContainer	An associative container from keys to (one or possibly more) values.
LongByteHashMap	A hash map of long to byte, implemented using open addressing with linear probing for collision resolution.
LongByteMap	An associative container with unique binding from keys to a single value.
LongByteWormMap	A hash map of long to byte, implemented using Worm Hashing strategy.
LongCharAssociativeContainer	An associative container from keys to (one or possibly more) values.
LongCharHashMap	A hash map of long to char, implemented using open addressing with linear probing for collision resolution.
LongCharMap	An associative container with unique binding from keys to a single value.
LongCharWormMap	A hash map of long to char, implemented using Worm Hashing strategy.
LongCollection	A collection allows basic, efficient operations on sets of elements (difference and intersection).
LongContainer	A generic container holding longs.
LongDeque	A linear collection that supports element insertion and removal at both ends.
LongDoubleAssociativeContainer	An associative container from keys to (one or possibly more) values.
LongDoubleHashMap	A hash map of long to double, implemented using open addressing with linear probing for collision resolution.
LongDoubleMap	An associative container with unique binding from keys to a single value.
LongDoubleWormMap	A hash map of long to double, implemented using Worm Hashing strategy.
LongFloatAssociativeContainer	An associative container from keys to (one or possibly more) values.
LongFloatHashMap	A hash map of long to float, implemented using open addressing with linear probing for collision resolution.
LongFloatMap	An associative container with unique binding from keys to a single value.
LongFloatWormMap	A hash map of long to float, implemented using Worm Hashing strategy.
LongHashSet	A hash set of longs, implemented using using open addressing with linear probing for collision resolution.
LongIndexedContainer	An indexed container provides random access to elements based on an index.
LongIntAssociativeContainer	An associative container from keys to (one or possibly more) values.
LongIntHashMap	A hash map of long to int, implemented using open addressing with linear probing for collision resolution.
LongIntMap	An associative container with unique binding from keys to a single value.
LongIntWormMap	A hash map of long to int, implemented using Worm Hashing strategy.
LongLongAssociativeContainer	An associative container from keys to (one or possibly more) values.
LongLongHashMap	A hash map of long to long, implemented using open addressing with linear probing for collision resolution.
LongLongMap	An associative container with unique binding from keys to a single value.
LongLongWormMap	A hash map of long to long, implemented using Worm Hashing strategy.
LongLookupContainer	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
LongObjectAssociativeContainer<VType>	An associative container from keys to (one or possibly more) values.
LongObjectHashMap<VType>	A hash map of long to Object, implemented using open addressing with linear probing for collision resolution.
LongObjectMap<VType>	An associative container with unique binding from keys to a single value.
LongObjectWormMap<VType>	A hash map of long to Object, implemented using Worm Hashing strategy.
LongSet	A set of longs.
LongShortAssociativeContainer	An associative container from keys to (one or possibly more) values.
LongShortHashMap	A hash map of long to short, implemented using open addressing with linear probing for collision resolution.
LongShortMap	An associative container with unique binding from keys to a single value.
LongShortWormMap	A hash map of long to short, implemented using Worm Hashing strategy.
LongStack	A subclass of LongArrayList adding stack-related utility methods.
LongWormSet	A hash set of longs, implemented using Worm Hashing strategy.
ObjectArrayDeque<KType>	An array-backed ObjectDeque.
ObjectArrayList<KType>	An array-backed list of Objects.
ObjectByteAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectByteHashMap<KType>	A hash map of Object to byte, implemented using open addressing with linear probing for collision resolution.
ObjectByteIdentityHashMap<KType>	An identity hash map of Object to byte.
ObjectByteMap<KType>	An associative container with unique binding from keys to a single value.
ObjectByteWormMap<KType>	A hash map of Object to byte, implemented using Worm Hashing strategy.
ObjectCharAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectCharHashMap<KType>	A hash map of Object to char, implemented using open addressing with linear probing for collision resolution.
ObjectCharIdentityHashMap<KType>	An identity hash map of Object to char.
ObjectCharMap<KType>	An associative container with unique binding from keys to a single value.
ObjectCharWormMap<KType>	A hash map of Object to char, implemented using Worm Hashing strategy.
ObjectCollection<KType>	A collection allows basic, efficient operations on sets of elements (difference and intersection).
ObjectContainer<KType>	A generic container holding Objects.
ObjectDeque<KType>	A linear collection that supports element insertion and removal at both ends.
ObjectDoubleAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectDoubleHashMap<KType>	A hash map of Object to double, implemented using open addressing with linear probing for collision resolution.
ObjectDoubleIdentityHashMap<KType>	An identity hash map of Object to double.
ObjectDoubleMap<KType>	An associative container with unique binding from keys to a single value.
ObjectDoubleWormMap<KType>	A hash map of Object to double, implemented using Worm Hashing strategy.
ObjectFloatAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectFloatHashMap<KType>	A hash map of Object to float, implemented using open addressing with linear probing for collision resolution.
ObjectFloatIdentityHashMap<KType>	An identity hash map of Object to float.
ObjectFloatMap<KType>	An associative container with unique binding from keys to a single value.
ObjectFloatWormMap<KType>	A hash map of Object to float, implemented using Worm Hashing strategy.
ObjectHashSet<KType>	A hash set of Objects, implemented using using open addressing with linear probing for collision resolution.
ObjectIdentityHashSet<KType>	A reference-equality (identity) hash set.
ObjectIndexedContainer<KType>	An indexed container provides random access to elements based on an index.
ObjectIntAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectIntHashMap<KType>	A hash map of Object to int, implemented using open addressing with linear probing for collision resolution.
ObjectIntIdentityHashMap<KType>	An identity hash map of Object to int.
ObjectIntMap<KType>	An associative container with unique binding from keys to a single value.
ObjectIntWormMap<KType>	A hash map of Object to int, implemented using Worm Hashing strategy.
ObjectLongAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectLongHashMap<KType>	A hash map of Object to long, implemented using open addressing with linear probing for collision resolution.
ObjectLongIdentityHashMap<KType>	An identity hash map of Object to long.
ObjectLongMap<KType>	An associative container with unique binding from keys to a single value.
ObjectLongWormMap<KType>	A hash map of Object to long, implemented using Worm Hashing strategy.
ObjectLookupContainer<KType>	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
ObjectObjectAssociativeContainer<KType,VType>	An associative container from keys to (one or possibly more) values.
ObjectObjectHashMap<KType,VType>	A hash map of Object to Object, implemented using open addressing with linear probing for collision resolution.
ObjectObjectIdentityHashMap<KType,VType>	An identity hash map of Object to Object.
ObjectObjectMap<KType,VType>	An associative container with unique binding from keys to a single value.
ObjectObjectWormMap<KType,VType>	A hash map of Object to Object, implemented using Worm Hashing strategy.
ObjectSet<KType>	A set of Objects.
ObjectShortAssociativeContainer<KType>	An associative container from keys to (one or possibly more) values.
ObjectShortHashMap<KType>	A hash map of Object to short, implemented using open addressing with linear probing for collision resolution.
ObjectShortIdentityHashMap<KType>	An identity hash map of Object to short.
ObjectShortMap<KType>	An associative container with unique binding from keys to a single value.
ObjectShortWormMap<KType>	A hash map of Object to short, implemented using Worm Hashing strategy.
ObjectStack<KType>	A subclass of ObjectArrayList adding stack-related utility methods.
ObjectWormSet<KType>	A hash set of Objects, implemented using Worm Hashing strategy.
Preallocable	Anything that can preallocate buffers given prior knowledge of the number of stored elements.
RamUsageEstimator	Helper class that helps estimate memory usage
ShortArrayDeque	An array-backed ShortDeque.
ShortArrayList	An array-backed list of shorts.
ShortByteAssociativeContainer	An associative container from keys to (one or possibly more) values.
ShortByteHashMap	A hash map of short to byte, implemented using open addressing with linear probing for collision resolution.
ShortByteMap	An associative container with unique binding from keys to a single value.
ShortByteWormMap	A hash map of short to byte, implemented using Worm Hashing strategy.
ShortCharAssociativeContainer	An associative container from keys to (one or possibly more) values.
ShortCharHashMap	A hash map of short to char, implemented using open addressing with linear probing for collision resolution.
ShortCharMap	An associative container with unique binding from keys to a single value.
ShortCharWormMap	A hash map of short to char, implemented using Worm Hashing strategy.
ShortCollection	A collection allows basic, efficient operations on sets of elements (difference and intersection).
ShortContainer	A generic container holding shorts.
ShortDeque	A linear collection that supports element insertion and removal at both ends.
ShortDoubleAssociativeContainer	An associative container from keys to (one or possibly more) values.
ShortDoubleHashMap	A hash map of short to double, implemented using open addressing with linear probing for collision resolution.
ShortDoubleMap	An associative container with unique binding from keys to a single value.
ShortDoubleWormMap	A hash map of short to double, implemented using Worm Hashing strategy.
ShortFloatAssociativeContainer	An associative container from keys to (one or possibly more) values.
ShortFloatHashMap	A hash map of short to float, implemented using open addressing with linear probing for collision resolution.
ShortFloatMap	An associative container with unique binding from keys to a single value.
ShortFloatWormMap	A hash map of short to float, implemented using Worm Hashing strategy.
ShortHashSet	A hash set of shorts, implemented using using open addressing with linear probing for collision resolution.
ShortIndexedContainer	An indexed container provides random access to elements based on an index.
ShortIntAssociativeContainer	An associative container from keys to (one or possibly more) values.
ShortIntHashMap	A hash map of short to int, implemented using open addressing with linear probing for collision resolution.
ShortIntMap	An associative container with unique binding from keys to a single value.
ShortIntWormMap	A hash map of short to int, implemented using Worm Hashing strategy.
ShortLongAssociativeContainer	An associative container from keys to (one or possibly more) values.
ShortLongHashMap	A hash map of short to long, implemented using open addressing with linear probing for collision resolution.
ShortLongMap	An associative container with unique binding from keys to a single value.
ShortLongWormMap	A hash map of short to long, implemented using Worm Hashing strategy.
ShortLookupContainer	Marker interface for containers that can check if they contain a given object in at least time O(log n) and ideally in amortized constant time O(1).
ShortObjectAssociativeContainer<VType>	An associative container from keys to (one or possibly more) values.
ShortObjectHashMap<VType>	A hash map of short to Object, implemented using open addressing with linear probing for collision resolution.
ShortObjectMap<VType>	An associative container with unique binding from keys to a single value.
ShortObjectWormMap<VType>	A hash map of short to Object, implemented using Worm Hashing strategy.
ShortSet	A set of shorts.
ShortShortAssociativeContainer	An associative container from keys to (one or possibly more) values.
ShortShortHashMap	A hash map of short to short, implemented using open addressing with linear probing for collision resolution.
ShortShortMap	An associative container with unique binding from keys to a single value.
ShortShortWormMap	A hash map of short to short, implemented using Worm Hashing strategy.
ShortStack	A subclass of ShortArrayList adding stack-related utility methods.
ShortWormSet	A hash set of shorts, implemented using Worm Hashing strategy.
SortedIterationCharByteHashMap	Read-only view with sorted iteration order on a delegate CharByteHashMap.
SortedIterationCharCharHashMap	Read-only view with sorted iteration order on a delegate CharCharHashMap.
SortedIterationCharDoubleHashMap	Read-only view with sorted iteration order on a delegate CharDoubleHashMap.
SortedIterationCharFloatHashMap	Read-only view with sorted iteration order on a delegate CharFloatHashMap.
SortedIterationCharIntHashMap	Read-only view with sorted iteration order on a delegate CharIntHashMap.
SortedIterationCharLongHashMap	Read-only view with sorted iteration order on a delegate CharLongHashMap.
SortedIterationCharObjectHashMap<VType>	Read-only view with sorted iteration order on a delegate CharObjectHashMap.
SortedIterationCharShortHashMap	Read-only view with sorted iteration order on a delegate CharShortHashMap.
SortedIterationIntByteHashMap	Read-only view with sorted iteration order on a delegate IntByteHashMap.
SortedIterationIntCharHashMap	Read-only view with sorted iteration order on a delegate IntCharHashMap.
SortedIterationIntDoubleHashMap	Read-only view with sorted iteration order on a delegate IntDoubleHashMap.
SortedIterationIntFloatHashMap	Read-only view with sorted iteration order on a delegate IntFloatHashMap.
SortedIterationIntIntHashMap	Read-only view with sorted iteration order on a delegate IntIntHashMap.
SortedIterationIntLongHashMap	Read-only view with sorted iteration order on a delegate IntLongHashMap.
SortedIterationIntObjectHashMap<VType>	Read-only view with sorted iteration order on a delegate IntObjectHashMap.
SortedIterationIntShortHashMap	Read-only view with sorted iteration order on a delegate IntShortHashMap.
SortedIterationLongByteHashMap	Read-only view with sorted iteration order on a delegate LongByteHashMap.
SortedIterationLongCharHashMap	Read-only view with sorted iteration order on a delegate LongCharHashMap.
SortedIterationLongDoubleHashMap	Read-only view with sorted iteration order on a delegate LongDoubleHashMap.
SortedIterationLongFloatHashMap	Read-only view with sorted iteration order on a delegate LongFloatHashMap.
SortedIterationLongIntHashMap	Read-only view with sorted iteration order on a delegate LongIntHashMap.
SortedIterationLongLongHashMap	Read-only view with sorted iteration order on a delegate LongLongHashMap.
SortedIterationLongObjectHashMap<VType>	Read-only view with sorted iteration order on a delegate LongObjectHashMap.
SortedIterationLongShortHashMap	Read-only view with sorted iteration order on a delegate LongShortHashMap.
SortedIterationObjectByteHashMap<KType>	Read-only view with sorted iteration order on a delegate ObjectByteHashMap.
SortedIterationObjectCharHashMap<KType>	Read-only view with sorted iteration order on a delegate ObjectCharHashMap.
SortedIterationObjectDoubleHashMap<KType>	Read-only view with sorted iteration order on a delegate ObjectDoubleHashMap.
SortedIterationObjectFloatHashMap<KType>	Read-only view with sorted iteration order on a delegate ObjectFloatHashMap.
SortedIterationObjectIntHashMap<KType>	Read-only view with sorted iteration order on a delegate ObjectIntHashMap.
SortedIterationObjectLongHashMap<KType>	Read-only view with sorted iteration order on a delegate ObjectLongHashMap.
SortedIterationObjectObjectHashMap<KType,VType>	Read-only view with sorted iteration order on a delegate ObjectObjectHashMap.
SortedIterationObjectShortHashMap<KType>	Read-only view with sorted iteration order on a delegate ObjectShortHashMap.
SortedIterationShortByteHashMap	Read-only view with sorted iteration order on a delegate ShortByteHashMap.
SortedIterationShortCharHashMap	Read-only view with sorted iteration order on a delegate ShortCharHashMap.
SortedIterationShortDoubleHashMap	Read-only view with sorted iteration order on a delegate ShortDoubleHashMap.
SortedIterationShortFloatHashMap	Read-only view with sorted iteration order on a delegate ShortFloatHashMap.
SortedIterationShortIntHashMap	Read-only view with sorted iteration order on a delegate ShortIntHashMap.
SortedIterationShortLongHashMap	Read-only view with sorted iteration order on a delegate ShortLongHashMap.
SortedIterationShortObjectHashMap<VType>	Read-only view with sorted iteration order on a delegate ShortObjectHashMap.
SortedIterationShortShortHashMap	Read-only view with sorted iteration order on a delegate ShortShortHashMap.
SuppressForbidden	Suppresses forbidden-API checks.
XorShift128P	A fast pseudo-random number generator.