| 
PCJ API Version 1.2  | 
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectbak.pcj.map.AbstractShortKeyCharMap
bak.pcj.map.ShortKeyCharChainedHashMap
This class represents chained hash table based maps from short values to char values.
ShortKeyCharOpenHashMap, 
Map, 
Serialized Form| Field 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 | |
ShortKeyCharChainedHashMap()
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%.  | 
|
ShortKeyCharChainedHashMap(double loadFactor)
Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor.  | 
|
ShortKeyCharChainedHashMap(int capacity)
Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%.  | 
|
ShortKeyCharChainedHashMap(int capacity,
                           double loadFactor)
Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0.  | 
|
ShortKeyCharChainedHashMap(int capacity,
                           double loadFactor,
                           double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor.  | 
|
ShortKeyCharChainedHashMap(int capacity,
                           double loadFactor,
                           int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor.  | 
|
ShortKeyCharChainedHashMap(ShortHashFunction keyhash)
Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%.  | 
|
ShortKeyCharChainedHashMap(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.  | 
|
ShortKeyCharChainedHashMap(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%.  | 
|
ShortKeyCharChainedHashMap(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.  | 
|
ShortKeyCharChainedHashMap(ShortHashFunction keyhash,
                           int capacity,
                           double loadFactor,
                           double growthFactor)
Creates a new hash map with a specified capacity, load factor, and relative growth factor.  | 
|
ShortKeyCharChainedHashMap(ShortHashFunction keyhash,
                           int capacity,
                           double loadFactor,
                           int growthChunk)
Creates a new hash map with a specified capacity, load factor, and absolute growth factor.  | 
|
ShortKeyCharChainedHashMap(ShortKeyCharMap 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(char value)
Indicates whether this map contains a mapping to a specified value.  | 
 ShortKeyCharMapIterator | 
entries()
Returns an iterator over the entries of this map.  | 
 char | 
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.  | 
 char | 
lget()
Returns the last value corresponding to a positive result from containsKey(short).  | 
 char | 
put(short key,
    char value)
Adds a mapping from a specified key to a specified value to this map.  | 
 char | 
remove(short key)
Removes the mapping from a specified key from this map.  | 
 int | 
size()
Returns the size of this map.  | 
 char | 
tget(short key)
Maps a specified key to a value.  | 
 CharCollection | 
values()
Returns a collection view of the values in this map.  | 
| Methods inherited from class bak.pcj.map.AbstractShortKeyCharMap | 
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.ShortKeyCharMap | 
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 ShortKeyCharChainedHashMap()
public ShortKeyCharChainedHashMap(ShortKeyCharMap map)
map - the map whose mappings to put into the new map.
NullPointerException - if map is null.public ShortKeyCharChainedHashMap(int capacity)
capacity - the initial capacity of the map.
IllegalArgumentException - if capacity is negative.public ShortKeyCharChainedHashMap(double loadFactor)
loadFactor - the load factor of the map.
IllegalArgumentException - if capacity is negative.
public ShortKeyCharChainedHashMap(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 ShortKeyCharChainedHashMap(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 ShortKeyCharChainedHashMap(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 ShortKeyCharChainedHashMap(ShortHashFunction keyhash)
keyhash - the hash function to use when hashing keys.
NullPointerException - if keyhash is null.
public ShortKeyCharChainedHashMap(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 ShortKeyCharChainedHashMap(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.
NullPointerException - if keyhash is null.
public ShortKeyCharChainedHashMap(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 ShortKeyCharChainedHashMap(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 ShortKeyCharChainedHashMap(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()
ShortKeyCharMap
keySet in interface ShortKeyCharMappublic char lget()
ShortKeyCharMapcontainsKey(short). This is useful
  for checking checking the existence of a mapping while
  avoiding two lookups on the same key.
lget in interface ShortKeyCharMapcontainsKey(short).ShortKeyCharMap.get(short), 
ShortKeyCharMap.tget(short), 
ShortKeyCharMap.containsKey(short)
public char put(short key,
                char value)
ShortKeyCharMap
put in interface ShortKeyCharMapkey - the key of the mapping to add to this map.value - the value of the mapping to add to this map.
MapDefaultspublic CharCollection values()
ShortKeyCharMap
values in interface ShortKeyCharMappublic Object clone()
public ShortKeyCharMapIterator entries()
ShortKeyCharMap
entries in interface ShortKeyCharMappublic void clear()
ShortKeyCharMap
clear in interface ShortKeyCharMapclear in class AbstractShortKeyCharMappublic boolean containsKey(short key)
ShortKeyCharMaplget() will return the corresponding value.
containsKey in interface ShortKeyCharMapcontainsKey in class AbstractShortKeyCharMappublic boolean containsValue(char value)
ShortKeyCharMap
containsValue in interface ShortKeyCharMapcontainsValue in class AbstractShortKeyCharMappublic char get(short key)
ShortKeyCharMap
get in interface ShortKeyCharMapget in class AbstractShortKeyCharMappublic boolean isEmpty()
ShortKeyCharMap
isEmpty in interface ShortKeyCharMapisEmpty in class AbstractShortKeyCharMappublic char remove(short key)
ShortKeyCharMap
remove in interface ShortKeyCharMapremove in class AbstractShortKeyCharMappublic int size()
ShortKeyCharMap
size in interface ShortKeyCharMapsize in class AbstractShortKeyCharMappublic char tget(short key)
ShortKeyCharMap
tget in interface ShortKeyCharMaptget in class AbstractShortKeyCharMap
  | 
PCJ API Version 1.2  | 
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||