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