public final class IntIntMap
extends java.lang.Object
Modifier and Type | Class and Description |
---|---|
private static class |
IntIntMap.Entry
The structure used for chaining colliding keys.
|
Modifier and Type | Field and Description |
---|---|
private static java.lang.String |
EOL |
private IntIntMap.Entry[] |
m_buckets |
private float |
m_loadFactor |
private int |
m_size |
private int |
m_sizeThreshold |
Constructor and Description |
---|
IntIntMap()
Equivalent to
IntObjectMap(11, 0.75F) . |
IntIntMap(int initialCapacity)
Equivalent to
IntObjectMap(capacity, 0.75F) . |
IntIntMap(int initialCapacity,
float loadFactor)
Constructs an IntObjectMap with specified initial capacity and load factor.
|
Modifier and Type | Method and Description |
---|---|
boolean |
contains(int key) |
(package private) void |
debugDump(java.lang.StringBuffer out) |
boolean |
get(int key,
int[] out)
Returns the value that is mapped to a given 'key'.
|
boolean |
get(int key,
int[] out,
int index) |
int[] |
keys() |
void |
put(int key,
int value)
Updates the table to map 'key' to 'value'.
|
private void |
rehash()
Re-hashes the table into a new array of buckets.
|
void |
remove(int key)
Updates the table to map 'key' to 'value'.
|
int |
size()
Returns the number of key-value mappings in this map.
|
java.lang.String |
toString()
Overrides Object.toString() for debug purposes.
|
private final float m_loadFactor
private IntIntMap.Entry[] m_buckets
private int m_size
private int m_sizeThreshold
private static final java.lang.String EOL
public IntIntMap()
IntObjectMap(11, 0.75F)
.public IntIntMap(int initialCapacity)
IntObjectMap(capacity, 0.75F)
.public IntIntMap(int initialCapacity, float loadFactor)
initialCapacity
- initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].loadFactor
- the load factor to use to determine rehashing points [must be in (0.0, 1.0] range].public java.lang.String toString()
toString
in class java.lang.Object
public int size()
public boolean contains(int key)
public boolean get(int key, int[] out)
key
- mapping keyout
- holder for the found value [must be at least of size 1]public boolean get(int key, int[] out, int index)
public int[] keys()
public void put(int key, int value)
key
- mapping keyvalue
- mapping valuepublic void remove(int key)
key
- mapping keyvoid debugDump(java.lang.StringBuffer out)
private void rehash()