public final class TLongIntHashMap
extends java.lang.Object
| Modifier and Type | Field and Description |
|---|---|
private boolean |
consumeFreeSlot |
private int |
free |
(package private) static int |
largestPrime |
private int |
maxSize |
(package private) static int[] |
primeCapacities |
private long[] |
set |
private int |
size |
private int[] |
values |
| Constructor and Description |
|---|
TLongIntHashMap()
Creates a new
TLongIntHashMap instance with the default
capacity and load factor. |
TLongIntHashMap(long key,
int value) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
forEachEntry(java.util.function.BiFunction<java.lang.Long,java.lang.Integer,java.lang.Boolean> procedure) |
int |
get(long key) |
private int |
insertKey(long key)
Locates the index at which val can be inserted.
|
(package private) static int |
nextPrime(int desiredCapacity) |
void |
put(long key,
int value) |
int |
putIfAbsent(long key,
int value) |
private void |
rehash(int capacity) |
int |
size() |
java.lang.String |
toString() |
static final int largestPrime
static final int[] primeCapacities
private int[] values
private long[] set
private boolean consumeFreeSlot
private int size
private int free
private int maxSize
public TLongIntHashMap()
TLongIntHashMap instance with the default
capacity and load factor.public TLongIntHashMap(long key,
int value)
static int nextPrime(int desiredCapacity)
public void put(long key,
int value)
public int putIfAbsent(long key,
int value)
private void rehash(int capacity)
public int get(long key)
public boolean forEachEntry(java.util.function.BiFunction<java.lang.Long,java.lang.Integer,java.lang.Boolean> procedure)
public java.lang.String toString()
toString in class java.lang.Objectpublic int size()
private int insertKey(long key)
key - an long valueint value