
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.AbstractDoubleKeyShortMap bak.pcj.map.DoubleKeyShortOpenHashMap
This class represents open addressing hash table based maps from double values to short values.
DoubleKeyShortChainedHashMap
,
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  
DoubleKeyShortOpenHashMap()
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. 

DoubleKeyShortOpenHashMap(double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. 

DoubleKeyShortOpenHashMap(DoubleHashFunction keyhash)
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. 

DoubleKeyShortOpenHashMap(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. 

DoubleKeyShortOpenHashMap(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%. 

DoubleKeyShortOpenHashMap(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. 

DoubleKeyShortOpenHashMap(DoubleHashFunction keyhash,
int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. 

DoubleKeyShortOpenHashMap(DoubleHashFunction keyhash,
int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. 

DoubleKeyShortOpenHashMap(DoubleKeyShortMap map)
Creates a new hash map with the same mappings as a specified map. 

DoubleKeyShortOpenHashMap(int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. 

DoubleKeyShortOpenHashMap(int capacity,
double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. 

DoubleKeyShortOpenHashMap(int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. 

DoubleKeyShortOpenHashMap(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(short value)
Indicates whether this map contains a mapping to a specified value. 
DoubleKeyShortMapIterator 
entries()
Returns an iterator over the entries of this map. 
short 
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. 
short 
lget()
Returns the last value corresponding to a positive result from containsKey(double) . 
short 
put(double key,
short value)
Adds a mapping from a specified key to a specified value to this map. 
short 
remove(double key)
Removes the mapping from a specified key from this map. 
int 
size()
Returns the size of this map. 
short 
tget(double key)
Maps a specified key to a value. 
ShortCollection 
values()
Returns a collection view of the values in this map. 
Methods inherited from class bak.pcj.map.AbstractDoubleKeyShortMap 
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.DoubleKeyShortMap 
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 DoubleKeyShortOpenHashMap()
public DoubleKeyShortOpenHashMap(DoubleKeyShortMap map)
map
 the map whose mappings to put into the new map.
NullPointerException
 if map is null.public DoubleKeyShortOpenHashMap(int capacity)
capacity
 the initial capacity of the map.
IllegalArgumentException
 if capacity is negative.public DoubleKeyShortOpenHashMap(double loadFactor)
loadFactor
 the load factor of the map.
IllegalArgumentException
 if capacity is negative;
if loadFactor is not positive.public DoubleKeyShortOpenHashMap(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 DoubleKeyShortOpenHashMap(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 DoubleKeyShortOpenHashMap(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 DoubleKeyShortOpenHashMap(DoubleHashFunction keyhash)
keyhash
 the hash function to use when hashing keys.
NullPointerException
 if keyhash is null.public DoubleKeyShortOpenHashMap(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 DoubleKeyShortOpenHashMap(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 DoubleKeyShortOpenHashMap(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 DoubleKeyShortOpenHashMap(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 DoubleKeyShortOpenHashMap(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()
DoubleKeyShortMap
keySet
in interface DoubleKeyShortMap
public short lget()
DoubleKeyShortMap
containsKey(double)
. This is useful
for checking checking the existence of a mapping while
avoiding two lookups on the same key.
lget
in interface DoubleKeyShortMap
containsKey(double)
.DoubleKeyShortMap.get(double)
,
DoubleKeyShortMap.tget(double)
,
DoubleKeyShortMap.containsKey(double)
public short put(double key, short value)
DoubleKeyShortMap
put
in interface DoubleKeyShortMap
key
 the key of the mapping to add to this map.value
 the value of the mapping to add to this map.
MapDefaults
public ShortCollection values()
DoubleKeyShortMap
values
in interface DoubleKeyShortMap
public Object clone()
public DoubleKeyShortMapIterator entries()
DoubleKeyShortMap
entries
in interface DoubleKeyShortMap
public void clear()
DoubleKeyShortMap
clear
in interface DoubleKeyShortMap
clear
in class AbstractDoubleKeyShortMap
public boolean containsKey(double key)
DoubleKeyShortMap
lget()
will return the corresponding value.
containsKey
in interface DoubleKeyShortMap
containsKey
in class AbstractDoubleKeyShortMap
public boolean containsValue(short value)
DoubleKeyShortMap
containsValue
in interface DoubleKeyShortMap
containsValue
in class AbstractDoubleKeyShortMap
public short get(double key)
DoubleKeyShortMap
get
in interface DoubleKeyShortMap
get
in class AbstractDoubleKeyShortMap
public boolean isEmpty()
DoubleKeyShortMap
isEmpty
in interface DoubleKeyShortMap
isEmpty
in class AbstractDoubleKeyShortMap
public short remove(double key)
DoubleKeyShortMap
remove
in interface DoubleKeyShortMap
remove
in class AbstractDoubleKeyShortMap
public int size()
DoubleKeyShortMap
size
in interface DoubleKeyShortMap
size
in class AbstractDoubleKeyShortMap
public short tget(double key)
DoubleKeyShortMap
tget
in interface DoubleKeyShortMap
tget
in class AbstractDoubleKeyShortMap

PCJ API Version 1.2 

PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 