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