AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
CollisionHandler.java
Go to the documentation of this file.
1package aud.example.hash;
2
3
6public abstract class CollisionHandler<T> {
15 public abstract long newHash(SimpleHashtable<T> table,T key,long h,int count);
16}
aud.example.hash.CollisionHandler
Collision handling strategy in SimpleHashtable.
Definition: CollisionHandler.java:6
aud.example.hash.CollisionHandler.newHash
abstract long newHash(SimpleHashtable< T > table, T key, long h, int count)
Handle collision by computing a new hash value.
aud.example.hash.SimpleHashtable
Base class for simple hash tables (mainly for demonstration).
Definition: SimpleHashtable.java:17