|
PCJ API Version 1.2 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object bak.pcj.map.AbstractIntKeyMap bak.pcj.map.IntKeyChainedHashMap
This class represents chained hash table based maps from int values to objects.
IntKeyOpenHashMap
,
Map
,
Serialized FormField 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 | |
IntKeyChainedHashMap()
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
IntKeyChainedHashMap(double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. |
|
IntKeyChainedHashMap(int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. |
|
IntKeyChainedHashMap(int capacity,
double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. |
|
IntKeyChainedHashMap(int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
IntKeyChainedHashMap(int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
|
IntKeyChainedHashMap(IntHashFunction keyhash)
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
IntKeyChainedHashMap(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. |
|
IntKeyChainedHashMap(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%. |
|
IntKeyChainedHashMap(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. |
|
IntKeyChainedHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
IntKeyChainedHashMap(IntHashFunction keyhash,
int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
|
IntKeyChainedHashMap(IntKeyMap map)
Creates a new hash map with the same mappings as a specified map. |
Method Summary | |
void |
clear()
Clears this map. |
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(Object value)
Indicates whether this map contains a mapping to a specified value. |
IntKeyMapIterator |
entries()
Returns an iterator over the entries of this map. |
Object |
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. |
Object |
put(int key,
Object value)
Adds a mapping from a specified key to a specified value to this map. |
Object |
remove(int key)
Removes the mapping from a specified key from this map. |
int |
size()
Returns the size of this map. |
Collection |
values()
Returns a collection view of the values in this map. |
Methods inherited from class bak.pcj.map.AbstractIntKeyMap |
equals, hashCode, putAll, toString, trimToSize |
Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface bak.pcj.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 IntKeyChainedHashMap()
public IntKeyChainedHashMap(IntKeyMap map)
map
- the map whose mappings to put into the new map.
NullPointerException
- if map is null.public IntKeyChainedHashMap(int capacity)
capacity
- the initial capacity of the map.
IllegalArgumentException
- if capacity is negative.public IntKeyChainedHashMap(double loadFactor)
loadFactor
- the load factor of the map.
IllegalArgumentException
- if capacity is negative.public IntKeyChainedHashMap(int capacity, double loadFactor)
capacity
- the initial capacity of the map.loadFactor
- the load factor of the map.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive.public IntKeyChainedHashMap(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.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive;
if growthFactor is not positive.public IntKeyChainedHashMap(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.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive;
if growthChunk is not positive;public IntKeyChainedHashMap(IntHashFunction keyhash)
keyhash
- the hash function to use when hashing keys.
NullPointerException
- if keyhash is null.public IntKeyChainedHashMap(IntHashFunction keyhash, int capacity)
keyhash
- the hash function to use when hashing keys.capacity
- the initial capacity of the map.
IllegalArgumentException
- if capacity is negative.
NullPointerException
- if keyhash is null.public IntKeyChainedHashMap(IntHashFunction keyhash, double loadFactor)
keyhash
- the hash function to use when hashing keys.loadFactor
- the load factor of the map.
IllegalArgumentException
- if capacity is negative.
NullPointerException
- if keyhash is null.public IntKeyChainedHashMap(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.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive.
NullPointerException
- if keyhash is null.public IntKeyChainedHashMap(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.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive;
if growthFactor is not positive.
NullPointerException
- if keyhash is null.public IntKeyChainedHashMap(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.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive;
if growthChunk is not positive;
NullPointerException
- if keyhash is null.Method Detail |
public IntSet keySet()
IntKeyMap
keySet
in interface IntKeyMap
public Object put(int key, Object value)
IntKeyMap
put
in interface IntKeyMap
key
- the key of the mapping to add to this map.value
- the value of the mapping to add to this map.
public Collection values()
IntKeyMap
values
in interface IntKeyMap
public Object clone()
public IntKeyMapIterator entries()
IntKeyMap
entries
in interface IntKeyMap
public void clear()
IntKeyMap
clear
in interface IntKeyMap
clear
in class AbstractIntKeyMap
public boolean containsKey(int key)
IntKeyMap
containsKey
in interface IntKeyMap
containsKey
in class AbstractIntKeyMap
public boolean containsValue(Object value)
IntKeyMap
containsValue
in interface IntKeyMap
containsValue
in class AbstractIntKeyMap
public Object get(int key)
IntKeyMap
get
in interface IntKeyMap
get
in class AbstractIntKeyMap
public boolean isEmpty()
IntKeyMap
isEmpty
in interface IntKeyMap
isEmpty
in class AbstractIntKeyMap
public Object remove(int key)
IntKeyMap
remove
in interface IntKeyMap
remove
in class AbstractIntKeyMap
public int size()
IntKeyMap
size
in interface IntKeyMap
size
in class AbstractIntKeyMap
|
PCJ API Version 1.2 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |