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