|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
ObjectFastHashMap<K,V>
public class FastHashMap<K,V>
A fast but inflexible hash table where the keys are strings and the size is fixed. Handles consecutive keys gracefully, but doesn't support resizing, deletion, or iteration.
Nested Class Summary | |
---|---|
private static class |
FastHashMap.Ent<K,V>
Keeps track of a single entry in the hash table. |
Field Summary | |
---|---|
private int |
curSize
|
private FastHashMap.Ent[] |
ents
|
private int |
hashSize
|
static Tester |
tester
Basic regression test |
Constructor Summary | |
---|---|
FastHashMap(int maxSize)
Create the hash table that can comfortably hold the specified number of entries. |
Method Summary | |
---|---|
boolean |
contains(K key)
Checks if the hash contains an entry for the given key. |
V |
get(K key)
Retrieves the entry for the given key. |
private int |
hashSlot(K key)
Calculate the hash slot for a given key |
void |
put(K key,
V val)
Sets the entry for the given key number. |
int |
size()
Tells how many entries are currently in the hash table |
Methods inherited from class Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
---|
private final int hashSize
private final FastHashMap.Ent[] ents
private int curSize
public static final Tester tester
Constructor Detail |
---|
public FastHashMap(int maxSize)
maxSize
- Max # of entriesMethod Detail |
---|
public void put(K key, V val)
private final int hashSlot(K key)
public boolean contains(K key)
public V get(K key)
key
- Key to look for
public int size()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |