|
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.AbstractBooleanKeyMap bak.pcj.map.BooleanKeyChainedHashMap
This class represents chained hash table based maps from boolean values to objects.
BooleanKeyOpenHashMap
,
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 | |
BooleanKeyChainedHashMap()
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
BooleanKeyChainedHashMap(BooleanHashFunction keyhash)
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. |
|
BooleanKeyChainedHashMap(BooleanHashFunction 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. |
|
BooleanKeyChainedHashMap(BooleanHashFunction 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%. |
|
BooleanKeyChainedHashMap(BooleanHashFunction 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. |
|
BooleanKeyChainedHashMap(BooleanHashFunction keyhash,
int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
BooleanKeyChainedHashMap(BooleanHashFunction keyhash,
int capacity,
double loadFactor,
int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor. |
|
BooleanKeyChainedHashMap(BooleanKeyMap map)
Creates a new hash map with the same mappings as a specified map. |
|
BooleanKeyChainedHashMap(double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. |
|
BooleanKeyChainedHashMap(int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. |
|
BooleanKeyChainedHashMap(int capacity,
double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. |
|
BooleanKeyChainedHashMap(int capacity,
double loadFactor,
double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor. |
|
BooleanKeyChainedHashMap(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(boolean key)
Indicates whether this map contains a mapping from a specified key. |
boolean |
containsValue(Object value)
Indicates whether this map contains a mapping to a specified value. |
BooleanKeyMapIterator |
entries()
Returns an iterator over the entries of this map. |
Object |
get(boolean key)
Maps a specified key to a value. |
boolean |
isEmpty()
Indicates whether this map is empty. |
BooleanSet |
keySet()
Returns a set view of the keys of this map. |
Object |
put(boolean key,
Object value)
Adds a mapping from a specified key to a specified value to this map. |
Object |
remove(boolean key)
Removes the mapping from a specified key from this map. |
int |
size()
Returns the size of this map. |
Collection |
values()
Returns a collection view of the values in this map. |
Methods inherited from class bak.pcj.map.AbstractBooleanKeyMap |
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.BooleanKeyMap |
equals, hashCode, putAll |
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 BooleanKeyChainedHashMap()
public BooleanKeyChainedHashMap(BooleanKeyMap map)
map
- the map whose mappings to put into the new map.
NullPointerException
- if map is null.public BooleanKeyChainedHashMap(int capacity)
capacity
- the initial capacity of the map.
IllegalArgumentException
- if capacity is negative.public BooleanKeyChainedHashMap(double loadFactor)
loadFactor
- the load factor of the map.
IllegalArgumentException
- if capacity is negative.public BooleanKeyChainedHashMap(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 BooleanKeyChainedHashMap(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 BooleanKeyChainedHashMap(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 BooleanKeyChainedHashMap(BooleanHashFunction keyhash)
keyhash
- the hash function to use when hashing keys.
NullPointerException
- if keyhash is null.public BooleanKeyChainedHashMap(BooleanHashFunction 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 BooleanKeyChainedHashMap(BooleanHashFunction 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 BooleanKeyChainedHashMap(BooleanHashFunction 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 BooleanKeyChainedHashMap(BooleanHashFunction 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 BooleanKeyChainedHashMap(BooleanHashFunction 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 BooleanSet keySet()
BooleanKeyMap
keySet
in interface BooleanKeyMap
public Object put(boolean key, Object value)
BooleanKeyMap
put
in interface BooleanKeyMap
key
- the key of the mapping to add to this map.value
- the value of the mapping to add to this map.
public Collection values()
BooleanKeyMap
values
in interface BooleanKeyMap
public Object clone()
public BooleanKeyMapIterator entries()
BooleanKeyMap
entries
in interface BooleanKeyMap
public void clear()
BooleanKeyMap
clear
in interface BooleanKeyMap
clear
in class AbstractBooleanKeyMap
public boolean containsKey(boolean key)
BooleanKeyMap
containsKey
in interface BooleanKeyMap
containsKey
in class AbstractBooleanKeyMap
public boolean containsValue(Object value)
BooleanKeyMap
containsValue
in interface BooleanKeyMap
containsValue
in class AbstractBooleanKeyMap
public Object get(boolean key)
BooleanKeyMap
get
in interface BooleanKeyMap
get
in class AbstractBooleanKeyMap
public boolean isEmpty()
BooleanKeyMap
isEmpty
in interface BooleanKeyMap
isEmpty
in class AbstractBooleanKeyMap
public Object remove(boolean key)
BooleanKeyMap
remove
in interface BooleanKeyMap
remove
in class AbstractBooleanKeyMap
public int size()
BooleanKeyMap
size
in interface BooleanKeyMap
size
in class AbstractBooleanKeyMap
|
PCJ API Version 1.2 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |