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