|
PCJ API Version 1.2 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectbak.pcj.map.AbstractDoubleKeyDoubleMap
bak.pcj.map.DoubleKeyDoubleOpenHashMap
This class represents open addressing hash table based maps from double values to double values.
DoubleKeyDoubleChainedHashMap,
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 | |
DoubleKeyDoubleOpenHashMap()
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
DoubleKeyDoubleOpenHashMap(double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. |
|
DoubleKeyDoubleOpenHashMap(DoubleHashFunction keyhash)
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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. |
|
DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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%. |
|
DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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. |
|
DoubleKeyDoubleOpenHashMap(DoubleHashFunction keyhash,
int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
DoubleKeyDoubleOpenHashMap(DoubleHashFunction keyhash,
int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
|
DoubleKeyDoubleOpenHashMap(DoubleKeyDoubleMap map)
Creates a new hash map with the same mappings as a specified map. |
|
DoubleKeyDoubleOpenHashMap(int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. |
|
DoubleKeyDoubleOpenHashMap(int capacity,
double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. |
|
DoubleKeyDoubleOpenHashMap(int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
DoubleKeyDoubleOpenHashMap(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(double 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. |
DoubleKeyDoubleMapIterator |
entries()
Returns an iterator over the entries of this map. |
double |
get(double key)
Maps a specified key to a value. |
boolean |
isEmpty()
Indicates whether this map is empty. |
DoubleSet |
keySet()
Returns a set view of the keys of this map. |
double |
lget()
Returns the last value corresponding to a positive result from containsKey(double). |
double |
put(double key,
double value)
Adds a mapping from a specified key to a specified value to this map. |
double |
remove(double key)
Removes the mapping from a specified key from this map. |
int |
size()
Returns the size of this map. |
double |
tget(double 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.AbstractDoubleKeyDoubleMap |
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.DoubleKeyDoubleMap |
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 DoubleKeyDoubleOpenHashMap()
public DoubleKeyDoubleOpenHashMap(DoubleKeyDoubleMap map)
map - the map whose mappings to put into the new map.
NullPointerException - if map is null.public DoubleKeyDoubleOpenHashMap(int capacity)
capacity - the initial capacity of the map.
IllegalArgumentException - if capacity is negative.public DoubleKeyDoubleOpenHashMap(double loadFactor)
loadFactor - the load factor of the map.
IllegalArgumentException - if capacity is negative;
if loadFactor is not positive.
public DoubleKeyDoubleOpenHashMap(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 DoubleKeyDoubleOpenHashMap(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 DoubleKeyDoubleOpenHashMap(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 DoubleKeyDoubleOpenHashMap(DoubleHashFunction keyhash)
keyhash - the hash function to use when hashing keys.
NullPointerException - if keyhash is null.
public DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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 DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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 DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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 DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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 DoubleKeyDoubleOpenHashMap(DoubleHashFunction 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 DoubleSet keySet()
DoubleKeyDoubleMap
keySet in interface DoubleKeyDoubleMappublic double lget()
DoubleKeyDoubleMapcontainsKey(double). This is useful
for checking checking the existence of a mapping while
avoiding two lookups on the same key.
lget in interface DoubleKeyDoubleMapcontainsKey(double).DoubleKeyDoubleMap.get(double),
DoubleKeyDoubleMap.tget(double),
DoubleKeyDoubleMap.containsKey(double)
public double put(double key,
double value)
DoubleKeyDoubleMap
put in interface DoubleKeyDoubleMapkey - the key of the mapping to add to this map.value - the value of the mapping to add to this map.
MapDefaultspublic DoubleCollection values()
DoubleKeyDoubleMap
values in interface DoubleKeyDoubleMappublic Object clone()
public DoubleKeyDoubleMapIterator entries()
DoubleKeyDoubleMap
entries in interface DoubleKeyDoubleMappublic void clear()
DoubleKeyDoubleMap
clear in interface DoubleKeyDoubleMapclear in class AbstractDoubleKeyDoubleMappublic boolean containsKey(double key)
DoubleKeyDoubleMaplget() will return the corresponding value.
containsKey in interface DoubleKeyDoubleMapcontainsKey in class AbstractDoubleKeyDoubleMappublic boolean containsValue(double value)
DoubleKeyDoubleMap
containsValue in interface DoubleKeyDoubleMapcontainsValue in class AbstractDoubleKeyDoubleMappublic double get(double key)
DoubleKeyDoubleMap
get in interface DoubleKeyDoubleMapget in class AbstractDoubleKeyDoubleMappublic boolean isEmpty()
DoubleKeyDoubleMap
isEmpty in interface DoubleKeyDoubleMapisEmpty in class AbstractDoubleKeyDoubleMappublic double remove(double key)
DoubleKeyDoubleMap
remove in interface DoubleKeyDoubleMapremove in class AbstractDoubleKeyDoubleMappublic int size()
DoubleKeyDoubleMap
size in interface DoubleKeyDoubleMapsize in class AbstractDoubleKeyDoubleMappublic double tget(double key)
DoubleKeyDoubleMap
tget in interface DoubleKeyDoubleMaptget in class AbstractDoubleKeyDoubleMap
|
PCJ API Version 1.2 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||