aud.example.hash.HashtableExample Class Reference

Simple framework for experiments with hash tables. More...

Classes
class	DoubleHashing
	Collision handling by double hashing using h2 More...
class	HashString
	Compute integer hash value from string.
class	IdentityHash
	Identity hash function.
class	Key
	Key could be integer or string.
class	LinearProbing
	Collision handling by linear probing h(x,i)=h(x)+i*b More...
class	QuadraticProbing
	Collision handling by quadratic probing h(x,i)=h(x)+i*b+i*i*c More...
class	UniversalHash
	Universal hash function parameterized as described in Goodrich and Tamassia.

Detailed Description

Simple framework for experiments with hash tables.

The program lets you choose among hash functions and strategies for collision handling. The you can fill the hash tables either with integers or with strings. The latter uses HashString to compute integer values. You can output the hash table or visualize the history of inserts to see entries are well-spread in the table.

Few hash functions and collision handlers for SimpleHashtable are implemented as nested classes. Don't hesitate to extend the program and experiment with your own functions! Have fun! :-)

See also

SimpleHashtable

Definition at line 23 of file HashtableExample.java.

---

The documentation for this class was generated from the following file:

• HashtableExample.java