|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectzombie.util.map.AbstractIntKeyMap<V>
zombie.util.map.IntKeyOpenHashMap<V>
public class IntKeyOpenHashMap<V>
This class represents open addressing hash table based maps from int values to objects.
IntKeyChainedHashMap,
Map,
Serialized Form| Field Summary | |
|---|---|
static int |
DEFAULT_CAPACITY
The default capacity of this map. |
static int |
DEFAULT_GROWTH_CHUNK
The default chunk size with which to increase the capacity of this map. |
static double |
DEFAULT_GROWTH_FACTOR
The default factor with which to increase the capacity of this map. |
static double |
DEFAULT_LOAD_FACTOR
The default load factor of this map. |
| Constructor Summary | |
|---|---|
IntKeyOpenHashMap()
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
IntKeyOpenHashMap(double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. |
|
IntKeyOpenHashMap(int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. |
|
IntKeyOpenHashMap(int capacity,
double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. |
|
IntKeyOpenHashMap(int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
IntKeyOpenHashMap(int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
|
IntKeyOpenHashMap(IntHashFunction keyhash)
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
IntKeyOpenHashMap(IntHashFunction keyhash,
double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. |
|
IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. |
|
IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. |
|
IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
|
IntKeyOpenHashMap(IntKeyMap<V> map)
Creates a new hash map with the same mappings as a specified map. |
|
| Method Summary | |
|---|---|
void |
clear()
Clears this map. |
java.lang.Object |
clone()
Returns a clone of this hash map. |
boolean |
containsKey(int key)
Indicates whether this map contains a mapping from a specified key. |
boolean |
containsValue(java.lang.Object value)
Indicates whether this map contains a mapping to a specified value. |
IntKeyMapIterator<V> |
entries()
Returns an iterator over the entries of this map. |
V |
get(int key)
Maps a specified key to a value. |
boolean |
isEmpty()
Indicates whether this map is empty. |
IntSet |
keySet()
Returns a set view of the keys of this map. |
V |
put(int key,
V value)
Adds a mapping from a specified key to a specified value to this map. |
V |
remove(int key)
Removes the mapping from a specified key from this map. |
int |
size()
Returns the size of this map. |
java.util.Collection<V> |
values()
Returns a collection view of the values in this map. |
| Methods inherited from class zombie.util.map.AbstractIntKeyMap |
|---|
equals, hashCode, putAll, toString, trimToSize |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface zombie.util.map.IntKeyMap |
|---|
equals, hashCode, putAll |
| Field Detail |
|---|
public static final double DEFAULT_GROWTH_FACTOR
public static final int DEFAULT_GROWTH_CHUNK
public static final int DEFAULT_CAPACITY
public static final double DEFAULT_LOAD_FACTOR
| Constructor Detail |
|---|
public IntKeyOpenHashMap()
public IntKeyOpenHashMap(IntKeyMap<V> map)
map - the map whose mappings to put into the new map.
java.lang.NullPointerException - if map is null.public IntKeyOpenHashMap(int capacity)
capacity - the initial capacity of the map.
java.lang.IllegalArgumentException - if capacity is negative.public IntKeyOpenHashMap(double loadFactor)
loadFactor - the load factor of the map.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive.
public IntKeyOpenHashMap(int capacity,
double loadFactor)
capacity - the initial capacity of the map.loadFactor - the load factor of the map.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive.
public IntKeyOpenHashMap(int capacity,
double loadFactor,
double growthFactor)
The map capacity increases to capacity()*(1+growthFactor). This strategy is good for avoiding many capacity increases, but the amount of wasted memory is approximately the size of the map.
capacity - the initial capacity of the map.loadFactor - the load factor of the map.growthFactor - the relative amount with which to increase the
the capacity when a capacity increase is needed.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive;
if growthFactor is not positive.
public IntKeyOpenHashMap(int capacity,
double loadFactor,
int growthChunk)
The map capacity increases to capacity()+growthChunk. This strategy is good for avoiding wasting memory. However, an overhead is potentially introduced by frequent capacity increases.
capacity - the initial capacity of the map.loadFactor - the load factor of the map.growthChunk - the absolute amount with which to increase the
the capacity when a capacity increase is needed.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive;
if growthChunk is not positive.public IntKeyOpenHashMap(IntHashFunction keyhash)
keyhash - the hash function to use when hashing keys.
java.lang.NullPointerException - if keyhash is null.
public IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity)
keyhash - the hash function to use when hashing keys.capacity - the initial capacity of the map.
java.lang.IllegalArgumentException - if capacity is negative.
java.lang.NullPointerException - if keyhash is null.
public IntKeyOpenHashMap(IntHashFunction keyhash,
double loadFactor)
keyhash - the hash function to use when hashing keys.loadFactor - the load factor of the map.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive.
java.lang.NullPointerException - if keyhash is null.
public IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor)
keyhash - the hash function to use when hashing keys.capacity - the initial capacity of the map.loadFactor - the load factor of the map.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive.
java.lang.NullPointerException - if keyhash is null.
public IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor,
double growthFactor)
The map capacity increases to capacity()*(1+growthFactor). This strategy is good for avoiding many capacity increases, but the amount of wasted memory is approximately the size of the map.
keyhash - the hash function to use when hashing keys.capacity - the initial capacity of the map.loadFactor - the load factor of the map.growthFactor - the relative amount with which to increase the
the capacity when a capacity increase is needed.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive;
if growthFactor is not positive.
java.lang.NullPointerException - if keyhash is null.
public IntKeyOpenHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor,
int growthChunk)
The map capacity increases to capacity()+growthChunk. This strategy is good for avoiding wasting memory. However, an overhead is potentially introduced by frequent capacity increases.
keyhash - the hash function to use when hashing keys.capacity - the initial capacity of the map.loadFactor - the load factor of the map.growthChunk - the absolute amount with which to increase the
the capacity when a capacity increase is needed.
java.lang.IllegalArgumentException - if capacity is negative;
if loadFactor is not positive;
if growthChunk is not positive.
java.lang.NullPointerException - if keyhash is null.| Method Detail |
|---|
public IntSet keySet()
IntKeyMap
keySet in interface IntKeyMap<V>
public V put(int key,
V value)
IntKeyMap
put in interface IntKeyMap<V>key - the key of the mapping to add to this map.value - the value of the mapping to add to this map.
public java.util.Collection<V> values()
IntKeyMap
values in interface IntKeyMap<V>public java.lang.Object clone()
clone in class java.lang.Objectpublic IntKeyMapIterator<V> entries()
IntKeyMap
entries in interface IntKeyMap<V>public void clear()
IntKeyMap
clear in interface IntKeyMap<V>clear in class AbstractIntKeyMap<V>public boolean containsKey(int key)
IntKeyMap
containsKey in interface IntKeyMap<V>containsKey in class AbstractIntKeyMap<V>key - the key to test for.
public boolean containsValue(java.lang.Object value)
IntKeyMap
containsValue in interface IntKeyMap<V>containsValue in class AbstractIntKeyMap<V>value - the value to test for.
public V get(int key)
IntKeyMap
get in interface IntKeyMap<V>get in class AbstractIntKeyMap<V>key - the key to map to a value.
public boolean isEmpty()
IntKeyMap
isEmpty in interface IntKeyMap<V>isEmpty in class AbstractIntKeyMap<V>public V remove(int key)
IntKeyMap
remove in interface IntKeyMap<V>remove in class AbstractIntKeyMap<V>key - the key whose mapping to remove from this map.
public int size()
IntKeyMap
size in interface IntKeyMap<V>size in class AbstractIntKeyMap<V>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||