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