Uses of Package
com.carrotsearch.hppc

Packages that use com.carrotsearch.hppc
com.carrotsearch.hppc High Performance Primitive Collections (HPPC) library provides typical data structures (lists, stacks, maps) template-generated for all Java primitive types (byte, int, etc.) to conserve memory and boost performance. 
 

Classes in com.carrotsearch.hppc used by com.carrotsearch.hppc
ArraySizingStrategy
          Resizing (growth) strategy for array-backed buffers.
BigramCountingBase
           
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.
ByteArrayDeque
          An array-backed deque (doubly linked queue) of bytes.
ByteArrayList
          An array-backed list of bytes.
ByteByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteByteMap
          An associative container with unique binding from keys to a single value.
ByteByteOpenHashMap
          A hash map of byte to byte, implemented using open addressing with linear probing for collision resolution.
ByteByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ByteCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteCharMap
          An associative container with unique binding from keys to a single value.
ByteCharOpenHashMap
          A hash map of byte to char, implemented using open addressing with linear probing for collision resolution.
ByteCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ByteCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
ByteContainer
          A generic container holding bytes.
ByteDeque
          A double-linked queue of bytes.
ByteDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteDoubleMap
          An associative container with unique binding from keys to a single value.
ByteDoubleOpenHashMap
          A hash map of byte to double, implemented using open addressing with linear probing for collision resolution.
ByteDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ByteFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteFloatMap
          An associative container with unique binding from keys to a single value.
ByteFloatOpenHashMap
          A hash map of byte to float, implemented using open addressing with linear probing for collision resolution.
ByteFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ByteIndexedContainer
          An indexed container provides random access to elements based on an index.
ByteIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteIntMap
          An associative container with unique binding from keys to a single value.
ByteIntOpenHashMap
          A hash map of byte to int, implemented using open addressing with linear probing for collision resolution.
ByteIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ByteLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteLongMap
          An associative container with unique binding from keys to a single value.
ByteLongOpenHashMap
          A hash map of byte to long, implemented using open addressing with linear probing for collision resolution.
ByteLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
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).
ByteObjectAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteObjectMap
          An associative container with unique binding from keys to a single value.
ByteObjectOpenHashMap
          A hash map of byte to VType, implemented using open addressing with linear probing for collision resolution.
ByteObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ByteOpenHashSet
          A hash set of bytes, implemented using using open addressing with linear probing for collision resolution.
ByteSet
          A set of bytes.
ByteShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ByteShortMap
          An associative container with unique binding from keys to a single value.
ByteShortOpenHashMap
          A hash map of byte to short, implemented using open addressing with linear probing for collision resolution.
ByteShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ByteStack
          An extension to ObjectArrayList adding stack-related utility methods.
CharArrayDeque
          An array-backed deque (doubly linked queue) of chars.
CharArrayList
          An array-backed list of chars.
CharByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharByteMap
          An associative container with unique binding from keys to a single value.
CharByteOpenHashMap
          A hash map of char to byte, implemented using open addressing with linear probing for collision resolution.
CharByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
CharCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharCharMap
          An associative container with unique binding from keys to a single value.
CharCharOpenHashMap
          A hash map of char to char, implemented using open addressing with linear probing for collision resolution.
CharCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
CharCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
CharContainer
          A generic container holding chars.
CharDeque
          A double-linked queue of chars.
CharDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharDoubleMap
          An associative container with unique binding from keys to a single value.
CharDoubleOpenHashMap
          A hash map of char to double, implemented using open addressing with linear probing for collision resolution.
CharDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
CharFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharFloatMap
          An associative container with unique binding from keys to a single value.
CharFloatOpenHashMap
          A hash map of char to float, implemented using open addressing with linear probing for collision resolution.
CharFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
CharIndexedContainer
          An indexed container provides random access to elements based on an index.
CharIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharIntMap
          An associative container with unique binding from keys to a single value.
CharIntOpenHashMap
          A hash map of char to int, implemented using open addressing with linear probing for collision resolution.
CharIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
CharLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharLongMap
          An associative container with unique binding from keys to a single value.
CharLongOpenHashMap
          A hash map of char to long, implemented using open addressing with linear probing for collision resolution.
CharLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
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
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharObjectMap
          An associative container with unique binding from keys to a single value.
CharObjectOpenHashMap
          A hash map of char to VType, implemented using open addressing with linear probing for collision resolution.
CharObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
CharOpenHashSet
          A hash set of chars, implemented using using open addressing with linear probing for collision resolution.
CharSet
          A set of chars.
CharShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
CharShortMap
          An associative container with unique binding from keys to a single value.
CharShortOpenHashMap
          A hash map of char to short, implemented using open addressing with linear probing for collision resolution.
CharShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
CharStack
          An extension to ObjectArrayList adding stack-related utility methods.
DoubleArrayDeque
          An array-backed deque (doubly linked queue) of doubles.
DoubleArrayList
          An array-backed list of doubles.
DoubleByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleByteMap
          An associative container with unique binding from keys to a single value.
DoubleByteOpenHashMap
          A hash map of double to byte, implemented using open addressing with linear probing for collision resolution.
DoubleByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
DoubleCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleCharMap
          An associative container with unique binding from keys to a single value.
DoubleCharOpenHashMap
          A hash map of double to char, implemented using open addressing with linear probing for collision resolution.
DoubleCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
DoubleCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
DoubleContainer
          A generic container holding doubles.
DoubleDeque
          A double-linked queue of doubles.
DoubleDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleDoubleMap
          An associative container with unique binding from keys to a single value.
DoubleDoubleOpenHashMap
          A hash map of double to double, implemented using open addressing with linear probing for collision resolution.
DoubleDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
DoubleFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleFloatMap
          An associative container with unique binding from keys to a single value.
DoubleFloatOpenHashMap
          A hash map of double to float, implemented using open addressing with linear probing for collision resolution.
DoubleFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
DoubleIndexedContainer
          An indexed container provides random access to elements based on an index.
DoubleIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleIntMap
          An associative container with unique binding from keys to a single value.
DoubleIntOpenHashMap
          A hash map of double to int, implemented using open addressing with linear probing for collision resolution.
DoubleIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
DoubleLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleLongMap
          An associative container with unique binding from keys to a single value.
DoubleLongOpenHashMap
          A hash map of double to long, implemented using open addressing with linear probing for collision resolution.
DoubleLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
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).
DoubleObjectAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleObjectMap
          An associative container with unique binding from keys to a single value.
DoubleObjectOpenHashMap
          A hash map of double to VType, implemented using open addressing with linear probing for collision resolution.
DoubleObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
DoubleOpenHashSet
          A hash set of doubles, implemented using using open addressing with linear probing for collision resolution.
DoubleSet
          A set of doubles.
DoubleShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
DoubleShortMap
          An associative container with unique binding from keys to a single value.
DoubleShortOpenHashMap
          A hash map of double to short, implemented using open addressing with linear probing for collision resolution.
DoubleShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
DoubleStack
          An extension to ObjectArrayList adding stack-related utility methods.
FloatArrayDeque
          An array-backed deque (doubly linked queue) of floats.
FloatArrayList
          An array-backed list of floats.
FloatByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatByteMap
          An associative container with unique binding from keys to a single value.
FloatByteOpenHashMap
          A hash map of float to byte, implemented using open addressing with linear probing for collision resolution.
FloatByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
FloatCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatCharMap
          An associative container with unique binding from keys to a single value.
FloatCharOpenHashMap
          A hash map of float to char, implemented using open addressing with linear probing for collision resolution.
FloatCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
FloatCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
FloatContainer
          A generic container holding floats.
FloatDeque
          A double-linked queue of floats.
FloatDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatDoubleMap
          An associative container with unique binding from keys to a single value.
FloatDoubleOpenHashMap
          A hash map of float to double, implemented using open addressing with linear probing for collision resolution.
FloatDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
FloatFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatFloatMap
          An associative container with unique binding from keys to a single value.
FloatFloatOpenHashMap
          A hash map of float to float, implemented using open addressing with linear probing for collision resolution.
FloatFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
FloatIndexedContainer
          An indexed container provides random access to elements based on an index.
FloatIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatIntMap
          An associative container with unique binding from keys to a single value.
FloatIntOpenHashMap
          A hash map of float to int, implemented using open addressing with linear probing for collision resolution.
FloatIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
FloatLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatLongMap
          An associative container with unique binding from keys to a single value.
FloatLongOpenHashMap
          A hash map of float to long, implemented using open addressing with linear probing for collision resolution.
FloatLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
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).
FloatObjectAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatObjectMap
          An associative container with unique binding from keys to a single value.
FloatObjectOpenHashMap
          A hash map of float to VType, implemented using open addressing with linear probing for collision resolution.
FloatObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
FloatOpenHashSet
          A hash set of floats, implemented using using open addressing with linear probing for collision resolution.
FloatSet
          A set of floats.
FloatShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
FloatShortMap
          An associative container with unique binding from keys to a single value.
FloatShortOpenHashMap
          A hash map of float to short, implemented using open addressing with linear probing for collision resolution.
FloatShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
FloatStack
          An extension to ObjectArrayList adding stack-related utility methods.
IntArrayDeque
          An array-backed deque (doubly linked queue) of ints.
IntArrayList
          An array-backed list of ints.
IntByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntByteMap
          An associative container with unique binding from keys to a single value.
IntByteOpenHashMap
          A hash map of int to byte, implemented using open addressing with linear probing for collision resolution.
IntByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
IntCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntCharMap
          An associative container with unique binding from keys to a single value.
IntCharOpenHashMap
          A hash map of int to char, implemented using open addressing with linear probing for collision resolution.
IntCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
IntCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
IntContainer
          A generic container holding ints.
IntDeque
          A double-linked queue of ints.
IntDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntDoubleLinkedSet
          A double-linked set of int values.
IntDoubleMap
          An associative container with unique binding from keys to a single value.
IntDoubleOpenHashMap
          A hash map of int to double, implemented using open addressing with linear probing for collision resolution.
IntDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
IntFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntFloatMap
          An associative container with unique binding from keys to a single value.
IntFloatOpenHashMap
          A hash map of int to float, implemented using open addressing with linear probing for collision resolution.
IntFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
IntIndexedContainer
          An indexed container provides random access to elements based on an index.
IntIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntIntMap
          An associative container with unique binding from keys to a single value.
IntIntOpenHashMap
          A hash map of int to int, implemented using open addressing with linear probing for collision resolution.
IntIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
IntLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntLongMap
          An associative container with unique binding from keys to a single value.
IntLongOpenHashMap
          A hash map of int to long, implemented using open addressing with linear probing for collision resolution.
IntLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
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
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntObjectMap
          An associative container with unique binding from keys to a single value.
IntObjectOpenHashMap
          A hash map of int to VType, implemented using open addressing with linear probing for collision resolution.
IntObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
IntOpenHashSet
          A hash set of ints, implemented using using open addressing with linear probing for collision resolution.
IntSet
          A set of ints.
IntShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
IntShortMap
          An associative container with unique binding from keys to a single value.
IntShortOpenHashMap
          A hash map of int to short, implemented using open addressing with linear probing for collision resolution.
IntShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
IntStack
          An extension to ObjectArrayList adding stack-related utility methods.
KTypeArrayDeque
          An array-backed deque (doubly linked queue) of KTypes.
KTypeArrayList
          An array-backed list of KTypes.
KTypeCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
KTypeContainer
          A generic container holding KTypes.
KTypeDeque
          A double-linked queue of KTypes.
KTypeIndexedContainer
          An indexed container provides random access to elements based on an index.
KTypeLookupContainer
          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).
KTypeOpenHashSet
          A hash set of KTypes, implemented using using open addressing with linear probing for collision resolution.
KTypeSet
          A set of KTypes.
KTypeStack
          An extension to ObjectArrayList adding stack-related utility methods.
KTypeVTypeAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
KTypeVTypeMap
          An associative container with unique binding from keys to a single value.
KTypeVTypeOpenHashMap
          A hash map of KType to VType, implemented using open addressing with linear probing for collision resolution.
KTypeVTypeOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongArrayDeque
          An array-backed deque (doubly linked queue) of longs.
LongArrayList
          An array-backed list of longs.
LongByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongByteMap
          An associative container with unique binding from keys to a single value.
LongByteOpenHashMap
          A hash map of long to byte, implemented using open addressing with linear probing for collision resolution.
LongByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongCharMap
          An associative container with unique binding from keys to a single value.
LongCharOpenHashMap
          A hash map of long to char, implemented using open addressing with linear probing for collision resolution.
LongCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
LongContainer
          A generic container holding longs.
LongDeque
          A double-linked queue of longs.
LongDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongDoubleMap
          An associative container with unique binding from keys to a single value.
LongDoubleOpenHashMap
          A hash map of long to double, implemented using open addressing with linear probing for collision resolution.
LongDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongFloatMap
          An associative container with unique binding from keys to a single value.
LongFloatOpenHashMap
          A hash map of long to float, implemented using open addressing with linear probing for collision resolution.
LongFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongIndexedContainer
          An indexed container provides random access to elements based on an index.
LongIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongIntMap
          An associative container with unique binding from keys to a single value.
LongIntOpenHashMap
          A hash map of long to int, implemented using open addressing with linear probing for collision resolution.
LongIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongLongMap
          An associative container with unique binding from keys to a single value.
LongLongOpenHashMap
          A hash map of long to long, implemented using open addressing with linear probing for collision resolution.
LongLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
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
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongObjectMap
          An associative container with unique binding from keys to a single value.
LongObjectOpenHashMap
          A hash map of long to VType, implemented using open addressing with linear probing for collision resolution.
LongObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongOpenHashSet
          A hash set of longs, implemented using using open addressing with linear probing for collision resolution.
LongSet
          A set of longs.
LongShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
LongShortMap
          An associative container with unique binding from keys to a single value.
LongShortOpenHashMap
          A hash map of long to short, implemented using open addressing with linear probing for collision resolution.
LongShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
LongStack
          An extension to ObjectArrayList adding stack-related utility methods.
ObjectArrayDeque
          An array-backed deque (doubly linked queue) of KTypes.
ObjectArrayList
          An array-backed list of KTypes.
ObjectByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectByteMap
          An associative container with unique binding from keys to a single value.
ObjectByteOpenHashMap
          A hash map of KType to byte, implemented using open addressing with linear probing for collision resolution.
ObjectByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectCharMap
          An associative container with unique binding from keys to a single value.
ObjectCharOpenHashMap
          A hash map of KType to char, implemented using open addressing with linear probing for collision resolution.
ObjectCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
ObjectContainer
          A generic container holding KTypes.
ObjectDeque
          A double-linked queue of KTypes.
ObjectDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectDoubleMap
          An associative container with unique binding from keys to a single value.
ObjectDoubleOpenHashMap
          A hash map of KType to double, implemented using open addressing with linear probing for collision resolution.
ObjectDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectFloatMap
          An associative container with unique binding from keys to a single value.
ObjectFloatOpenHashMap
          A hash map of KType to float, implemented using open addressing with linear probing for collision resolution.
ObjectFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectIndexedContainer
          An indexed container provides random access to elements based on an index.
ObjectIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectIntMap
          An associative container with unique binding from keys to a single value.
ObjectIntOpenHashMap
          A hash map of KType to int, implemented using open addressing with linear probing for collision resolution.
ObjectIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectLongMap
          An associative container with unique binding from keys to a single value.
ObjectLongOpenHashMap
          A hash map of KType to long, implemented using open addressing with linear probing for collision resolution.
ObjectLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectLookupContainer
          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
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectObjectMap
          An associative container with unique binding from keys to a single value.
ObjectObjectOpenHashMap
          A hash map of KType to VType, implemented using open addressing with linear probing for collision resolution.
ObjectObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectOpenHashSet
          A hash set of KTypes, implemented using using open addressing with linear probing for collision resolution.
ObjectSet
          A set of KTypes.
ObjectShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ObjectShortMap
          An associative container with unique binding from keys to a single value.
ObjectShortOpenHashMap
          A hash map of KType to short, implemented using open addressing with linear probing for collision resolution.
ObjectShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ObjectStack
          An extension to ObjectArrayList adding stack-related utility methods.
ShortArrayDeque
          An array-backed deque (doubly linked queue) of shorts.
ShortArrayList
          An array-backed list of shorts.
ShortByteAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortByteMap
          An associative container with unique binding from keys to a single value.
ShortByteOpenHashMap
          A hash map of short to byte, implemented using open addressing with linear probing for collision resolution.
ShortByteOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ShortCharAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortCharMap
          An associative container with unique binding from keys to a single value.
ShortCharOpenHashMap
          A hash map of short to char, implemented using open addressing with linear probing for collision resolution.
ShortCharOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ShortCollection
          A collection allows basic, efficient operations on sets of elements (difference and intersection).
ShortContainer
          A generic container holding shorts.
ShortDeque
          A double-linked queue of shorts.
ShortDoubleAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortDoubleMap
          An associative container with unique binding from keys to a single value.
ShortDoubleOpenHashMap
          A hash map of short to double, implemented using open addressing with linear probing for collision resolution.
ShortDoubleOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ShortFloatAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortFloatMap
          An associative container with unique binding from keys to a single value.
ShortFloatOpenHashMap
          A hash map of short to float, implemented using open addressing with linear probing for collision resolution.
ShortFloatOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ShortIndexedContainer
          An indexed container provides random access to elements based on an index.
ShortIntAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortIntMap
          An associative container with unique binding from keys to a single value.
ShortIntOpenHashMap
          A hash map of short to int, implemented using open addressing with linear probing for collision resolution.
ShortIntOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ShortLongAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortLongMap
          An associative container with unique binding from keys to a single value.
ShortLongOpenHashMap
          A hash map of short to long, implemented using open addressing with linear probing for collision resolution.
ShortLongOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
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
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortObjectMap
          An associative container with unique binding from keys to a single value.
ShortObjectOpenHashMap
          A hash map of short to VType, implemented using open addressing with linear probing for collision resolution.
ShortObjectOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ShortOpenHashSet
          A hash set of shorts, implemented using using open addressing with linear probing for collision resolution.
ShortSet
          A set of shorts.
ShortShortAssociativeContainer
          An associative container (alias: map, dictionary) from keys to (one or possibly more) values.
ShortShortMap
          An associative container with unique binding from keys to a single value.
ShortShortOpenHashMap
          A hash map of short to short, implemented using open addressing with linear probing for collision resolution.
ShortShortOpenHashMap.KeysContainer
          A view of the keys inside this hash map.
ShortStack
          An extension to ObjectArrayList adding stack-related utility methods.
 



Copyright © 2011 Carrot Search s.c.. All Rights Reserved.