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