aGrUM  0.20.3
a C++ library for (probabilistic) graphical models
gum::HashFunc< learning::EdgeDeletion > Class Template Reference

the hash function for Edge Deletions More...

#include <graphChange.h>

+ Inheritance diagram for gum::HashFunc< learning::EdgeDeletion >:
+ Collaboration diagram for gum::HashFunc< learning::EdgeDeletion >:

Public Member Functions

virtual Size operator() (const learning::EdgeDeletion &key) const override final
 computes the hashed value of a key More...
 
void resize (const Size new_size)
 Update the hash function to take into account a resize of the hash table. More...
 
Size size () const
 Returns the hash table size as known by the hash function. More...
 

Static Public Member Functions

static Size castToSize (const learning::EdgeDeletion &key)
 Returns the value of a key as a Size. More...
 

Protected Attributes

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

Detailed Description

template<>
class gum::HashFunc< learning::EdgeDeletion >

the hash function for Edge Deletions

Definition at line 561 of file graphChange.h.

Member Function Documentation

◆ castToSize()

static Size gum::HashFunc< learning::EdgeDeletion >::castToSize ( const learning::EdgeDeletion key)
static

Returns the value of a key as a Size.

Parameters
keyThe value to return as a Size.
Returns
Returns the value of a key as a Size.

◆ operator()()

virtual Size gum::HashFunc< learning::EdgeDeletion >::operator() ( const learning::EdgeDeletion key) const
finaloverridevirtual

computes the hashed value of a key

Implements gum::HashFuncBase< learning::EdgeDeletion >.

◆ resize()

void gum::HashFuncBase< learning::EdgeDeletion >::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_sizeThe hashtable's size wished by the user. Actually, a hashtable of size n is an array of n lists.
Exceptions
SizeErrorRaised if s is too small.

◆ size()

Size gum::HashFuncBase< learning::EdgeDeletion >::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< learning::EdgeDeletion >::hash_log2_size_
protectedinherited

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

Definition at line 203 of file hashFunc.h.

◆ hash_mask_

Size gum::HashFuncBase< learning::EdgeDeletion >::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 214 of file hashFunc.h.

◆ hash_size_

Size gum::HashFuncBase< learning::EdgeDeletion >::hash_size_
protectedinherited

The size of the hash table.

Definition at line 200 of file hashFunc.h.

◆ right_shift_

unsigned int gum::HashFuncBase< learning::EdgeDeletion >::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 225 of file hashFunc.h.


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