Interface | Description |
---|---|
BiInt2ObjectMap.EntryConsumer<V> |
Handler for a map entry
|
Class | Description |
---|---|
ArrayUtils |
Convenient method for array manipulations.
|
BiInt2ObjectMap<V> |
Map that takes two part int key and associates with an object.
|
ComposedKeyMap<K1,K2,V> |
Map with a composed key.
|
Hashing |
Hashcode functions for classes in this package.
|
InflatableSet<T> |
Provides fast
Set implementation for cases where items are known to not
contain duplicates. |
InflatableSet.Builder<T> |
Builder for
InflatableSet . |
Int2ObjectHashMap<V> |
Map implementation specialized for int keys using open addressing and
linear probing for cache-efficient access. |
InternalListMultiMap<K,V> |
Simplistic implementation of MultiMap.
|
InternalSetMultimap<K,V> |
Simplistic implementation of MultiMap.
|
IntHashSet |
Simple fixed-size int hashset.
|
IntIterator |
An iterator for a sequence of primitive integers.
|
Long2LongHashMap |
A Probing hashmap specialised for long key and value pairs.
|
Long2ObjectHashMap<V> |
Map implementation specialised for long keys using open addressing and
linear probing for cache efficient access. |
LongHashSet |
Simple fixed-size long hashset.
|
LongIterator |
An iterator for a sequence of primitive integers.
|
MapDelegatingSet<V> |
Read-only collection which delegates its operations to an underlying map and a couple of functions.
|
OAHashSet<E> |
Not thread-safe open-addressing hash
Set implementation with linear
probing for CPU cache efficiency. |
Object2LongHashMap<K> |
Map implementation specialised for long values using open addressing and
linear probing for cache efficient access. |
WeightedEvictableList<T> |
This list keeps the items as long as its size is less than maximum
capacity.
|
WeightedEvictableList.WeightedItem<T> |
A node that contains an item and its weight
|
Copyright © 2020 Hazelcast, Inc.. All Rights Reserved.