gum::HashFunc< unsigned long > Class Reference

Hash function for unsigned long integers. More...

#include <agrum/base/core/hashFunc.h>

Inheritance diagram for gum::HashFunc< unsigned long >:

Collaboration diagram for gum::HashFunc< unsigned long >:

Public Member Functions
virtual Size	operator() (const unsigned long &key) const override final
	Computes the hashed value of a key.
void	resize (const Size new_size)
	Update the hash function to take into account a resize of the hash table.
Size	size () const
	Returns the hash table size as known by the hash function.

Static Public Member Functions
static Size	castToSize (const unsigned long &key)
	Returns the value of a key as a Size.

Protected Attributes
Size	hash_size_
	The size of the hash table.
unsigned int	hash_log2_size_
	Log of the number of slots of the hash table in base 2.
Size	hash_mask_
	performing y = x & hash_mask_ guarantees that y is a slot index of the hash table
unsigned int	right_shift_
	performing y = x >> right_shift_ guarantees that y is a slot index of the hash table

Detailed Description

Hash function for unsigned long integers.

Definition at line 557 of file hashFunc.h.

Member Function Documentation

castToSize()

Size gum::HashFuncSmallKey< unsigned long >::castToSize ( const unsigned long & key )

staticinherited

Returns the value of a key as a Size.

Parameters

key	The value to return as a Size.

Returns

Returns the value of a key as a Size.

operator()()

virtual Size gum::HashFuncSmallKey< unsigned long >::operator() ( const unsigned long & key ) const

finaloverridevirtualinherited

Computes the hashed value of a key.

The classes inheriting from HashFuncBase should always declare Operator() as follows:

Size operator()(const Key& key) const override final;

and its implementation should be something like:

INLINE Size HashFunc< Key >::operator()(const Key& key) const {
  return (castToSize(key) * HashFuncConst::gold) >> this->right_shift_;
}

By doing this, compilers optimize the code so that it is significantly speeded-up because no virtual table will be used and everything is most certainly inlined. Of course, you need to define a static method castToSize which should take as argument a const Key& and return a Size

Parameters

key	The key to compute the hashed value.

Returns

Returns the hashed value of a key.

Implements gum::HashFuncBase< unsigned long >.

resize()

void gum::HashFuncBase< unsigned long >::resize ( const Size new_size )

inherited

Update the hash function to take into account a resize of the hash table.

When the user wishes to resize the gum::HashTable so that the array is of size s, the gum::HashTable resizes itself to the smallest power of 2 greater than or equal to s. This new size is computed by function gum::HashFuncBase::resize(gum::Size). Hence, s should be the size of the array of lists, not the number of elements stored into the gum::HashTable.

Parameters

new_size

The hashtable's size wished by the user. Actually, a hashtable of size n is an array of n lists.

Exceptions

SizeError

Raised if s is too small.

size()

Size gum::HashFuncBase< unsigned long >::size ( ) const

inherited

Returns the hash table size as known by the hash function.

Returns

Returns the size of the hash table, i.e., the number of slots (lists) it contains.

Member Data Documentation

hash_log2_size_

unsigned int gum::HashFuncBase< unsigned long >::hash_log2_size_

protectedinherited

Log of the number of slots of the hash table in base 2.

Definition at line 224 of file hashFunc.h.

{0};

hash_mask_

Size gum::HashFuncBase< unsigned long >::hash_mask_

protectedinherited

performing y = x & hash_mask_ guarantees that y is a slot index of the hash table

To transform a Size x into a slot index of the hash table, you can either use x & hash_mask_ or x >> right_shift_ depending on whether you want to exploit the least significant bits of x (&) or the most significant one (>>).

Definition at line 235 of file hashFunc.h.

{Size(0)};

hash_size_

Size gum::HashFuncBase< unsigned long >::hash_size_

protectedinherited

The size of the hash table.

Definition at line 221 of file hashFunc.h.

{Size(0)};

right_shift_

unsigned int gum::HashFuncBase< unsigned long >::right_shift_

protectedinherited

performing y = x >> right_shift_ guarantees that y is a slot index of the hash table

To transform a Size x into a slot index of the hash table, you can either use x & hash_mask_ or x >> right_shift_ depending on whether you want to exploit the least significant bits of x (&) or the most significant one (>>).

Definition at line 246 of file hashFunc.h.

{0};

---

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

• agrum/base/core/hashFunc.h