AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
HashtableExample.java File Reference

Go to the source code of this file.

Classes

class  aud.example.hash.HashtableExample
 Simple framework for experiments with hash tables. More...
 
class  aud.example.hash.HashtableExample.HashString
 Compute integer hash value from string.
 
class  aud.example.hash.HashtableExample.IdentityHash
 Identity hash function.
 
class  aud.example.hash.HashtableExample.UniversalHash
 Universal hash function parameterized as described in Goodrich and Tamassia.
 
class  aud.example.hash.HashtableExample.LinearProbing< T >
 Collision handling by linear probing h(x,i)=h(x)+i*b
More...
 
class  aud.example.hash.HashtableExample.QuadraticProbing< T >
 Collision handling by quadratic probing h(x,i)=h(x)+i*b+i*i*c
More...
 
class  aud.example.hash.HashtableExample.DoubleHashing< T >
 Collision handling by double hashing using h2
More...
 
class  aud.example.hash.HashtableExample.Key
 Key could be integer or string.
 

Packages

package  aud.example.hash
 simple hash for experimenting and visualization