Collision handling by double hashing using h2
More...

Inheritance diagram for aud.example.hash.HashtableExample.DoubleHashing< T >:

Collaboration diagram for aud.example.hash.HashtableExample.DoubleHashing< T >:

Public Member Functions
	DoubleHashing (HashFunction< T > h2)

long	newHash (SimpleHashtable< T > table, T key, long h, int count)
	Handle collision by computing a new hash value. More...

String	toString ()

abstract long	newHash (SimpleHashtable< T > table, T key, long h, int count)
	Handle collision by computing a new hash value. More...

Detailed Description

Collision handling by double hashing using h2

Definition at line 126 of file HashtableExample.java.

Constructor & Destructor Documentation

◆ DoubleHashing()

aud.example.hash.HashtableExample.DoubleHashing< T >.DoubleHashing ( HashFunction< T > h2 )

Definition at line 129 of file HashtableExample.java.

129{ h2_=h2; }

Member Function Documentation

◆ newHash()

long aud.example.hash.HashtableExample.DoubleHashing< T >.newHash	(	SimpleHashtable< T >	table,
		T	key,
		long	h,
		int	count
	)

Handle collision by computing a new hash value.

Parameters

table	hash table
key	new entry that is to be inserted but caused the collision
h	previously used hash value
count	iteration count for collision handling starting with 1 (=first collision)

Returns: new hash value

Reimplemented from aud.example.hash.CollisionHandler< T >.

Definition at line 132 of file HashtableExample.java.

                                                               {
        long h2=h2_.hash(key);
        return h+count*(h2!=0 ? h2 : 18014398509481951l);
    }

◆ toString()

String aud.example.hash.HashtableExample.DoubleHashing< T >.toString ( )

Definition at line 137 of file HashtableExample.java.

                                       {
      return "DoubleHahsing[h2="+h2_+"]";
    }

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