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