|
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.AbstractCharKeyIntMap bak.pcj.map.CharKeyIntOpenHashMap
This class represents open addressing hash table based maps from char values to int values.
CharKeyIntChainedHashMap
,
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 | |
CharKeyIntOpenHashMap()
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
CharKeyIntOpenHashMap(CharHashFunction keyhash)
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
CharKeyIntOpenHashMap(CharHashFunction 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. |
|
CharKeyIntOpenHashMap(CharHashFunction 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%. |
|
CharKeyIntOpenHashMap(CharHashFunction 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. |
|
CharKeyIntOpenHashMap(CharHashFunction keyhash,
int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
CharKeyIntOpenHashMap(CharHashFunction keyhash,
int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
|
CharKeyIntOpenHashMap(CharKeyIntMap map)
Creates a new hash map with the same mappings as a specified map. |
|
CharKeyIntOpenHashMap(double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. |
|
CharKeyIntOpenHashMap(int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. |
|
CharKeyIntOpenHashMap(int capacity,
double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. |
|
CharKeyIntOpenHashMap(int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
CharKeyIntOpenHashMap(int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
Method Summary | |
void |
clear()
Clears this map. |
Object |
clone()
Returns a clone of this hash map. |
boolean |
containsKey(char key)
Indicates whether this map contains a mapping from a specified key. |
boolean |
containsValue(int value)
Indicates whether this map contains a mapping to a specified value. |
CharKeyIntMapIterator |
entries()
Returns an iterator over the entries of this map. |
int |
get(char key)
Maps a specified key to a value. |
boolean |
isEmpty()
Indicates whether this map is empty. |
CharSet |
keySet()
Returns a set view of the keys of this map. |
int |
lget()
Returns the last value corresponding to a positive result from containsKey(char) . |
int |
put(char key,
int value)
Adds a mapping from a specified key to a specified value to this map. |
int |
remove(char key)
Removes the mapping from a specified key from this map. |
int |
size()
Returns the size of this map. |
int |
tget(char key)
Maps a specified key to a value. |
IntCollection |
values()
Returns a collection view of the values in this map. |
Methods inherited from class bak.pcj.map.AbstractCharKeyIntMap |
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.CharKeyIntMap |
equals, hashCode, putAll, trimToSize |
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 CharKeyIntOpenHashMap()
public CharKeyIntOpenHashMap(CharKeyIntMap map)
map
- the map whose mappings to put into the new map.
NullPointerException
- if map is null.public CharKeyIntOpenHashMap(int capacity)
capacity
- the initial capacity of the map.
IllegalArgumentException
- if capacity is negative.public CharKeyIntOpenHashMap(double loadFactor)
loadFactor
- the load factor of the map.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive.public CharKeyIntOpenHashMap(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 CharKeyIntOpenHashMap(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 CharKeyIntOpenHashMap(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 CharKeyIntOpenHashMap(CharHashFunction keyhash)
keyhash
- the hash function to use when hashing keys.
NullPointerException
- if keyhash is null.public CharKeyIntOpenHashMap(CharHashFunction 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 CharKeyIntOpenHashMap(CharHashFunction keyhash, double loadFactor)
keyhash
- the hash function to use when hashing keys.loadFactor
- the load factor of the map.
IllegalArgumentException
- if capacity is negative;
if loadFactor is not positive.
NullPointerException
- if keyhash is null.public CharKeyIntOpenHashMap(CharHashFunction 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 CharKeyIntOpenHashMap(CharHashFunction 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 CharKeyIntOpenHashMap(CharHashFunction 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 CharSet keySet()
CharKeyIntMap
keySet
in interface CharKeyIntMap
public int lget()
CharKeyIntMap
containsKey(char)
. This is useful
for checking checking the existence of a mapping while
avoiding two lookups on the same key.
lget
in interface CharKeyIntMap
containsKey(char)
.CharKeyIntMap.get(char)
,
CharKeyIntMap.tget(char)
,
CharKeyIntMap.containsKey(char)
public int put(char key, int value)
CharKeyIntMap
put
in interface CharKeyIntMap
key
- the key of the mapping to add to this map.value
- the value of the mapping to add to this map.
MapDefaults
public IntCollection values()
CharKeyIntMap
values
in interface CharKeyIntMap
public Object clone()
public CharKeyIntMapIterator entries()
CharKeyIntMap
entries
in interface CharKeyIntMap
public void clear()
CharKeyIntMap
clear
in interface CharKeyIntMap
clear
in class AbstractCharKeyIntMap
public boolean containsKey(char key)
CharKeyIntMap
lget()
will return the corresponding value.
containsKey
in interface CharKeyIntMap
containsKey
in class AbstractCharKeyIntMap
public boolean containsValue(int value)
CharKeyIntMap
containsValue
in interface CharKeyIntMap
containsValue
in class AbstractCharKeyIntMap
public int get(char key)
CharKeyIntMap
get
in interface CharKeyIntMap
get
in class AbstractCharKeyIntMap
public boolean isEmpty()
CharKeyIntMap
isEmpty
in interface CharKeyIntMap
isEmpty
in class AbstractCharKeyIntMap
public int remove(char key)
CharKeyIntMap
remove
in interface CharKeyIntMap
remove
in class AbstractCharKeyIntMap
public int size()
CharKeyIntMap
size
in interface CharKeyIntMap
size
in class AbstractCharKeyIntMap
public int tget(char key)
CharKeyIntMap
tget
in interface CharKeyIntMap
tget
in class AbstractCharKeyIntMap
|
PCJ API Version 1.2 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |