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