gum::HashTable< Key, Val, Alloc > Class Template Reference

The class for generic Hash Tables. More...

#include <agrum/core/hashTable.h>

Collaboration diagram for gum::HashTable< Key, Val, Alloc >:

Public Member Functions
template<typename... Args>
INLINE HashTable< Key, Val, Alloc >::value_type &	emplace (Args &&... args)
template<typename Mount , typename OtherAlloc >
HashTable< Key, Mount, OtherAlloc > INLINE	map (Mount(*f)(Val), Size size, bool resize_pol, bool key_uniqueness_pol) const
template<typename Mount , typename OtherAlloc >
HashTable< Key, Mount, OtherAlloc > INLINE	map (Mount(*f)(Val &), Size size, bool resize_pol, bool key_uniqueness_pol) const
template<typename Mount , typename OtherAlloc >
HashTable< Key, Mount, OtherAlloc > INLINE	map (Mount(*f)(const Val &), Size size, bool resize_pol, bool key_uniqueness_pol) const
template<typename Mount , typename OtherAlloc >
HashTable< Key, Mount, OtherAlloc > INLINE	map (const Mount &val, Size size, bool resize_pol, bool key_uniqueness_pol) const
template<typename OtherAlloc >
INLINE bool	operator!= (const HashTable< Key, Val, OtherAlloc > &from) const
Constructors / Destructors
	HashTable (Size size_param=HashTableConst::default_size, bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy)
	Default constructor. More...
	HashTable (std::initializer_list< std::pair< Key, Val > > list)
	Initializer list constructor. More...
	HashTable (const HashTable< Key, Val, Alloc > &from)
	Copy constructor. More...
template<typename OtherAlloc >
	HashTable (const HashTable< Key, Val, OtherAlloc > &from)
	Generalized copy constructor. More...
	HashTable (HashTable< Key, Val, Alloc > &&from)
	Move constructor. More...
	~HashTable ()
	Class destructor. More...
Operators
HashTable< Key, Val, Alloc > &	operator= (const HashTable< Key, Val, Alloc > &from)
	Copy operator. More...
template<typename OtherAlloc >
HashTable< Key, Val, Alloc > &	operator= (const HashTable< Key, Val, OtherAlloc > &from)
	Generalized copy operator. More...
HashTable< Key, Val, Alloc > &	operator= (HashTable< Key, Val, Alloc > &&from)
	Move operator. More...
Val &	operator[] (const Key &key)
	Returns a reference on the value the key of which is passed in argument. More...
const Val &	operator[] (const Key &key) const
	returns a reference on the value the key of which is passed in argument More...
template<typename OtherAlloc >
bool	operator== (const HashTable< Key, Val, OtherAlloc > &from) const
	Checks whether two hashtables contain the same elements. More...
template<typename OtherAlloc >
bool	operator!= (const HashTable< Key, Val, OtherAlloc > &from) const
	Checks whether two hashtables contain different sets of elements. More...
Fine tuning
Size	capacity () const noexcept
	Returns the number of slots in the 'nodes' vector of the hashtable. More...
void	resize (Size new_size)
	Changes the number of slots in the 'nodes' vector of the hash table. More...
void	setResizePolicy (const bool new_policy) noexcept
	Enables the user to change dynamically the resizing policy. More...
bool	resizePolicy () const noexcept
	Returns the current resizing policy. More...
void	setKeyUniquenessPolicy (const bool new_policy) noexcept
	Enables the user to change dynamically the policy for checking whether there can exist several elements in the table with identical keys. More...
bool	keyUniquenessPolicy () const noexcept
	Returns the current checking policy. More...
Accessors / Modifiers
Size	size () const noexcept
	Returns the number of elements stored into the hashtable. More...
bool	exists (const Key &key) const
	Checks whether there exists an element with a given key in the hashtable. More...
value_type &	insert (const Key &key, const Val &val)
	Adds a new element (actually a copy of this element) into the hash table. More...
value_type &	insert (Key &&key, Val &&val)
	Moves a new element in the hash table. More...
value_type &	insert (const std::pair< Key, Val > &elt)
	Adds a new element (actually a copy of this element) into the hash table. More...
value_type &	insert (std::pair< Key, Val > &&elt)
	Moves a new element in the hash table. More...
template<typename... Args>
value_type &	emplace (Args &&... args)
	Emplace a new element into the hashTable. More...
mapped_type &	getWithDefault (const Key &key, const Val &default_value)
	Returns a reference on the element the key of which is passed in argument. More...
mapped_type &	getWithDefault (Key &&key, Val &&default_value)
	Returns a reference on the element the key of which is passed in argument. More...
void	set (const Key &key, const Val &default_value)
	Add a new property or modify it if it already existed. More...
void	reset (const Key &key)
	Removes a property (i.e., remove an element). More...
void	erase (const Key &key)
	Removes a given element from the hash table. More...
void	erase (const iterator_safe &iter)
	Removes a given element from the hash table. More...
void	erase (const const_iterator_safe &iter)
	Removes a given element from the hash table. More...
void	eraseByVal (const Val &val)
	Removes a given element from the hash table. More...
const Key &	keyByVal (const Val &val) const
	Returns a reference on the key given a value. More...
const Key &	key (const Key &key) const
	Returns a reference on a given key. More...
void	eraseAllVal (const Val &val)
	Removes all the elements having a certain value from the hash table. More...
void	clear ()
	Removes all the elements in the hash table. More...
bool	empty () const noexcept
	Indicates whether the hash table is empty. More...
template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>
HashTable< Key, Mount, OtherAlloc >	map (Mount(*f)(Val), Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const
	Transforms a hashtable of vals into a hashtable of mountains. More...
template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>
HashTable< Key, Mount, OtherAlloc >	map (Mount(*f)(Val &), Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const
	Transforms a hashtable of vals into a hashtable of mountains. More...
template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>
HashTable< Key, Mount, OtherAlloc >	map (Mount(*f)(const Val &), Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const
	Transforms a hashtable of vals into a hashtable of mountains. More...
template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>
HashTable< Key, Mount, OtherAlloc >	map (const Mount &val, Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const
	Creates a hashtable of mounts with a given value from a hashtable of vals. More...

Public Types
using	Bucket = HashTableBucket< Key, Val >
	The buckets where data are stored. More...
using	BucketAllocator = typename Alloc::template rebind< Bucket >::other
	The Bucket allocator. More...
using	key_type = Key
	Types for STL compliance. More...
using	mapped_type = Val
	Types for STL compliance. More...
using	value_type = std::pair< const Key, Val >
	Types for STL compliance. More...
using	reference = value_type &
	Types for STL compliance. More...
using	const_reference = const value_type &
	Types for STL compliance. More...
using	pointer = value_type *
	Types for STL compliance. More...
using	const_pointer = const value_type *
	Types for STL compliance. More...
using	size_type = Size
	Types for STL compliance. More...
using	difference_type = std::ptrdiff_t
	Types for STL compliance. More...
using	allocator_type = Alloc
	Types for STL compliance. More...
using	iterator = HashTableIterator< Key, Val >
	Types for STL compliance. More...
using	const_iterator = HashTableConstIterator< Key, Val >
	Types for STL compliance. More...
using	iterator_safe = HashTableIteratorSafe< Key, Val >
	Types for STL compliance. More...
using	const_iterator_safe = HashTableConstIteratorSafe< Key, Val >
	Types for STL compliance. More...

Friends
template<typename K , typename V , typename A >
class	HashTable
	Friends to optimize the access to data, iterators must be friends. More...
class	HashTableIterator< Key, Val >
	Friends to optimize the access to data, iterators must be friends. More...
class	HashTableConstIterator< Key, Val >
	Friends to optimize the access to data, iterators must be friends. More...
class	HashTableIteratorSafe< Key, Val >
	Friends to optimize the access to data, iterators must be friends. More...
class	HashTableConstIteratorSafe< Key, Val >
	Friends to optimize the access to data, iterators must be friends. More...
template<typename T1 , typename T2 , typename A >
class	Bijection
	For bijections to quickly access data. More...
std::ostream &	operator<< (std::ostream &, const HashTable< Key, Val, Alloc > &)
	Prints the content of a gum::HashTable in the stream. More...
std::ostream &	operator<< (std::ostream &s, const HashTable< Key *, Val, Alloc > &table)
	Prints the content of a gum::HashTable with pointers key in the stream. More...

Iterators
const iterator &	end () noexcept
	Returns the unsafe iterator pointing to the end of the hashtable. More...
const const_iterator &	end () const noexcept
	Returns the unsafe const_iterator pointing to the end of the hashtable. More...
const const_iterator &	cend () const noexcept
	Returns the unsafe const_iterator pointing to the end of the hashtable. More...
iterator	begin ()
	Returns an unsafe iterator pointing to the beginning of the hashtable. More...
const_iterator	begin () const
	Returns an unsafe const_iterator pointing to the beginning of the hashtable. More...
const_iterator	cbegin () const
	Returns an unsafe const_iterator pointing to the beginning of the hashtable. More...
const iterator_safe &	endSafe () noexcept
	Returns the safe iterator pointing to the end of the hashtable. More...
const const_iterator_safe &	endSafe () const noexcept
	Returns the safe const_iterator pointing to the end of the hashtable. More...
const const_iterator_safe &	cendSafe () const noexcept
	Returns the safe const_iterator pointing to the end of the hashtable. More...
iterator_safe	beginSafe ()
	Returns the safe iterator pointing to the beginning of the hashtable. More...
const_iterator_safe	beginSafe () const
	Returns the safe const_iterator pointing to the beginning of the hashtable. More...
const_iterator_safe	cbeginSafe () const
	Returns the safe const_iterator pointing to the beginning of the hashtable. More...
static const iterator &	end4Statics ()
	Returns the end iterator for other classes' statics (read the detailed description of this method). More...
static const const_iterator &	constEnd4Statics ()
	Returns the end iterator for other classes' statics (read the detailed description of this method). More...
static const iterator_safe &	endSafe4Statics ()
	Returns the end iterator for other classes' statics (read the detailed description of this method). More...
static const const_iterator_safe &	constEndSafe4Statics ()
	Returns the end iterator for other classes' statics (read the detailed description of this method). More...

Detailed Description

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>
class gum::HashTable< Key, Val, Alloc >

The class for generic Hash Tables.

In aGrUM, a hashtable is a vector of chained lists (collision problems are fixed by chaining). Each slot of the vector contains a list of elements sharing the same hashed value. To be computationally efficient, the hash table should not contain too many elements as compared to its number of slots. Therefore, it is sometimes useful to resize the chained lists vector. aGrUM's hash tables are designed to automatically double their size when there is in average more than 3 elements per slot. However, when memory consumption is a concern, this feature can be turned off either by passing false as an optional resize_pol argument to the constructor of the hash table or by using method setResizePolicy when the instance of the class has already been constructed. Similarly, the default number of slots of the hash table may be parameterized as an optional argument of the constructor (size_param). Beware: when inserting elements of a given class into a hash table, unless the element is an r-value, only a copy of this element is stored into the table (this is compulsory if the hashtable is to be generic and can be used to store both complex classes and built-in types like integers). HashTable have different kinds of iterators: HashTableIteratorSafe and HashTableConstIteratorSafe (a.k.a. HashTable<>::iterator_safe and HashTable<>::const_iterator_safe) allow safe parsing of the hash tables. By safe, we mean that whenever the element pointed to by such an iterator is removed from the hashtable, accessing it through the iterator (*iter) does not result in a segmentation fault but rather in an exception being thrown. This safety is ensured at a very low cost (actually, our experiments show that our HashTables and HashTable's safe iterators significantly outperform the standard library unordered_maps). Of course, if there is no possibility for an iterator to point to a deleted element, the user can use "unsafe" iterators HashTableIterator and HashTableConstIterator (a.k.a. HashTable<>::iterator and HashTable<>::const_iterator). These iterators are slightly faster than their safe counterparts. However, as in the standard library, accessing through them a deleted element usually results in a mess (most probably a segfault).

Warning

HashTables guarantee that any element stored within them will have the same location in memory until it is removed from the hashtable (and this holds whatever operation is performed on the hashtable like new insertions, deletions, resizing, etc.).

Usage example:

// creation of an empty hash table
HashTable<int,string> table1;

// insert two elements into the hash table
table1.insert (10,"xxx");
table1.insert (20,"yyy");
table1.emplace (30,"zzz");

// creation of a nonempty hashtable using initializer lists
HashTable<int,bool> table { std::make_pair(3,true), std::make_pair(2,false)
};

// display the content of the hash table
cerr << table1;

// get the number of elements stored into the hash table
cerr << "number of elements in table1 = " << table1.size () << endl;

// create two copies of the hash table
HashTable<int,string> table2, table3 = table1;
table2 = table3;

// get the element whose key is 10
cerr << table1[10] << " = xxx" << endl;

// check whether there exists an element with key 20
if (table1.exists (20)) cerr << "element found" << endl;

// transform the hashtable of string into a hashtable of int assuming f is
// defined as: int f (const string& str) { return str.size (); }
HashTable<int,int> table = table1.map (f);

// remove two elements from table1 and table2
table1.erase (10);         // key = 10
table1.eraseByVal ("yyy"); // val = "yyy"
table2.clear ();

// check whether the hash table is empty
if (!table1.empty ()) cerr << "table not empty" << endl;

// check wether hashtables contain the same elements
if ((table1 == table2) && (table1 != table3))
  cerr << "check for equality/inequality" << endl;

// parse the content of a hashtable using an unsafe iterator
for (HashTable<int,string>::const_iterator iter = table1.cbegin();
      iter != table1.cend(); ++iter)
  cerr << *iter;
HashTable<int,string>::iterator iter = table1.begin();
iter += 2;
cerr << iter.key () << " " << iter.val ();

// use an iterator to point the element we wish to erase
HashTable<int,string>::iterator_safe iterS = table1.beginSafe ();
table1.erase ( table1.beginSafe () + 4 );
table1.erase ( iterS ); // this is safe because the iterator is safe

// check for iterator's safety
for (HashTable<int,string>::iterator_safe iter = table1.beginSafe ();
      iter != table1.endSafe (); ++iter )
  table1.eraseByVal ( *iter );

Template Parameters

Key	The type for keys in a gum::HashTable.
Val	The type for values in a gum::HashTable.
Alloc	The gum::HashTable allocator.

Definition at line 679 of file hashTable.h.

Member Typedef Documentation

allocator_type

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::allocator_type = Alloc

Types for STL compliance.

Definition at line 692 of file hashTable.h.

Bucket

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::Bucket = HashTableBucket< Key, Val >

The buckets where data are stored.

Definition at line 700 of file hashTable.h.

BucketAllocator

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::BucketAllocator = typename Alloc::template rebind< Bucket >::other

The Bucket allocator.

Definition at line 703 of file hashTable.h.

const_iterator

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::const_iterator = HashTableConstIterator< Key, Val >

Types for STL compliance.

Definition at line 694 of file hashTable.h.

const_iterator_safe

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::const_iterator_safe = HashTableConstIteratorSafe< Key, Val >

Types for STL compliance.

Definition at line 696 of file hashTable.h.

const_pointer

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::const_pointer = const value_type*

Types for STL compliance.

Definition at line 689 of file hashTable.h.

const_reference

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::const_reference = const value_type&

Types for STL compliance.

Definition at line 687 of file hashTable.h.

difference_type

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::difference_type = std::ptrdiff_t

Types for STL compliance.

Definition at line 691 of file hashTable.h.

iterator

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::iterator = HashTableIterator< Key, Val >

Types for STL compliance.

Definition at line 693 of file hashTable.h.

iterator_safe

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::iterator_safe = HashTableIteratorSafe< Key, Val >

Types for STL compliance.

Definition at line 695 of file hashTable.h.

key_type

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::key_type = Key

Types for STL compliance.

Definition at line 683 of file hashTable.h.

mapped_type

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::mapped_type = Val

Types for STL compliance.

Definition at line 684 of file hashTable.h.

pointer

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::pointer = value_type*

Types for STL compliance.

Definition at line 688 of file hashTable.h.

reference

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::reference = value_type&

Types for STL compliance.

Definition at line 686 of file hashTable.h.

size_type

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::size_type = Size

Types for STL compliance.

Definition at line 690 of file hashTable.h.

value_type

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

using gum::HashTable< Key, Val, Alloc >::value_type = std::pair< const Key, Val >

Types for STL compliance.

Definition at line 685 of file hashTable.h.

Constructor & Destructor Documentation

HashTable() [1/5]

template<typename Key , typename Val , typename Alloc >

gum::HashTable< Key, Val, Alloc >::HashTable ( Size  size_param = HashTableConst::default_size, bool  resize_pol = HashTableConst::default_resize_policy, bool  key_uniqueness_pol = HashTableConst::default_uniqueness_policy  )

explicit

Default constructor.

The true capacity (vector's size) of the hashtable will be the lowest number greater than or equal to size_param that is also a power of 2. The second optional argument is the resizing policy. By default, each time there is an average of 3 elements by node, the size of the hashtable is automatically multiplied by 2. But the user may pass false as argument to resize_pol to disable this feature.

Parameters

size_param	The initial size of the gum::HashTable.
resize_pol	The policy for resizing the hashtable when new elements are added (possible values: true = automatic resize and false = manual resize).
key_uniqueness_pol	Uniqueness policy : should we prevent inserting the same key more than once in the table?

Definition at line 383 of file hashTable_tpl.h.

                                                                   :
      // size must be >= 2 else we lose all the bits of the hash function
      __size{Size(1) << __hashTableLog2(std::max(Size(2), size_param))},
      __resize_policy{resize_pol}, __key_uniqueness_policy{key_uniqueness_pol} {
    // for debugging purposes
    GUM_CONSTRUCTOR(HashTable);

    // finalize the creation
    __create(__size);
  }

HashTable() [2/5]

template<typename Key, typename Val, typename Alloc >

gum::HashTable< Key, Val, Alloc >::HashTable ( std::initializer_list< std::pair< Key, Val > >  list )

explicit

Initializer list constructor.

Parameters

list	The initialized list.

Definition at line 397 of file hashTable_tpl.h.

                                                      :
      // size must be >= 2 else we lose all the bits of the hash function
      __size{Size(1) << __hashTableLog2(
                std::max< Size >(Size(2), Size(list.size()) / 2))} {
    // for debugging purposes
    GUM_CONSTRUCTOR(HashTable);

    // setup the __nodes vector (contains only empty lists)
    __create(__size);

    // insert all the elements
    for (const auto& elt : list) {
      insert(elt);
    }
  }

HashTable() [3/5]

template<typename Key, typename Val, typename Alloc>

gum::HashTable< Key, Val, Alloc >::HashTable

(

const HashTable< Key, Val, Alloc > &

from

)

Copy constructor.

This creates a new hashtable the content of which is similar to that of the table passed in argument. Beware: similar does not mean that both tables share the same objects, but rather that the objects stored in the newly created table are copies of those of the table passed in argument. In particular, the new hash table inherits the parameters (resize policy, uniqueness policy) of table 'from'.

Parameters

from	The gum::HashTable to copy.

Definition at line 415 of file hashTable_tpl.h.

                                                :
      __size{table.__size},
      __resize_policy{table.__resize_policy},
      __key_uniqueness_policy{table.__key_uniqueness_policy},
      __begin_index{table.__begin_index} {
    // for debugging purposes
    GUM_CONS_CPY(HashTable);

    // setup the __nodes vector (contains only empty lists)
    __create(__size);

    // fill with the content of table
    __copy(table);
  }

HashTable() [4/5]

template<typename Key, typename Val, typename Alloc >

template<typename OtherAlloc >

gum::HashTable< Key, Val, Alloc >::HashTable

(

const HashTable< Key, Val, OtherAlloc > &

from

)

Generalized copy constructor.

This creates a new hashtable the content of which is similar to that of the table passed in argument. Beware: similar does not mean that both tables share the same objects, but rather that the objects stored in the newly created table are copies of those of the table passed in argument. In particular, the new hash table inherits the parameters (resize policy, uniqueness policy) of table 'table'

Parameters

from	The gum::HashTable to copy.

Definition at line 433 of file hashTable_tpl.h.

                                                     :
      __size{table.__size},
      __resize_policy{table.__resize_policy},
      __key_uniqueness_policy{table.__key_uniqueness_policy},
      __begin_index{table.__begin_index} {
    // for debugging purposes
    GUM_CONS_CPY(HashTable);

    // setup the __nodes vector (contains only empty lists)
    __create(__size);

    // fill with the content of table
    __copy(table);
  }

HashTable() [5/5]

template<typename Key, typename Val, typename Alloc>

gum::HashTable< Key, Val, Alloc >::HashTable

(

HashTable< Key, Val, Alloc > &&

from

)

Move constructor.

Parameters

from	The gum::HashTable to move.

Definition at line 450 of file hashTable_tpl.h.

                                                                              :
      __nodes(std::move(table.__nodes)), __size{table.__size},
      __nb_elements{table.__nb_elements}, __hash_func{table.__hash_func},
      __resize_policy{table.__resize_policy},
      __key_uniqueness_policy{table.__key_uniqueness_policy},
      __begin_index{table.__begin_index},
      __safe_iterators(std::move(table.__safe_iterators)),
      __alloc(std::move(table.__alloc)) {
    // for debugging purposes
    table.__size = 0;
    GUM_CONS_MOV(HashTable);
  }

~HashTable()

template<typename Key , typename Val , typename Alloc >

INLINE gum::HashTable< Key, Val, Alloc >::~HashTable

(

)

Class destructor.

Definition at line 485 of file hashTable_tpl.h.

                                                  {
    // for debugging purposes
    GUM_DESTRUCTOR(HashTable);

    // update all the registered iterators: they should now point to nullptr
    // and their hashtable should be set to nullptr
    __clearIterators();
  }

Member Function Documentation

__clearIterators()

template<typename Key , typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::__clearIterators ( )

private

Clear all the safe iterators.

Definition at line 464 of file hashTable_tpl.h.

                                                             {
    const Size len = __safe_iterators.size();
    for (Size i = Size(0); i < len; ++i)
      __safe_iterators[i]->clear();
  }

__copy()

template<typename Key, typename Val, typename Alloc >

template<typename OtherAlloc >

void gum::HashTable< Key, Val, Alloc >::__copy ( const HashTable< Key, Val, OtherAlloc > &  table )

private

A function used to perform copies of HashTables.

This code is shared by the copy constructor and the copy operator. The function ensures that when a memory allocation problem occurs:

• no memory leak occurs
• the hashtable returned is empty but in a coherent state
• an exception is thrown

The function assumes that both this and table have arrays '__nodes' of the same size.

Parameters

table

The gum::HashTable to copy.

Template Parameters

OtherAlloc

The other gum::HashTable allocator.

Definition at line 311 of file hashTable_tpl.h.

                                                     {
    // in debug mode, check that this and table have '__nodes' arrays of the
    // same size
    GUM_ASSERT(table.__size == __size);

    // try to fill the array of chained lists
    for (Size i = 0; i < table.__size; ++i) {
      try {
        __nodes[i] = table.__nodes[i];
      } catch (...) {
        // here we could allocate the __nodes[j], j=0..i-1, so we should
        // deallocate them
        for (Size j = 0; j < __size; ++j)
          __nodes[j].clear();

        __nb_elements = Size(0);

        // propagate the exception
        throw;
      }
    }

    __nb_elements = table.__nb_elements;
  }

__create()

template<typename Key , typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::__create ( Size  size )

private

Used by all default constructors (general and specialized).

Parameters

size	The size of the gum::HashTable to create.

Definition at line 366 of file hashTable_tpl.h.

                                                              {
    // setup the __nodes vector (contains only empty lists)
    __nodes.resize(size);

    for (auto& list : __nodes) {
      list.setAllocator(__alloc);
    }

    // set up properly the hash function
    __hash_func.resize(size);

    // make sure the end() iterator is constructed properly
    end4Statics();
    endSafe4Statics();
  }

__erase()

template<typename Key, typename Val, typename Alloc >

void gum::HashTable< Key, Val, Alloc >::__erase ( HashTableBucket< Key, Val > *  bucket, Size  index  )

private

Erases a given bucket.

Definition at line 992 of file hashTable_tpl.h.

                                                                                 {
    if (bucket == nullptr) return;

    // update the registered iterators pointing to this bucket
    for (auto iter : __safe_iterators) {
      if (iter->__bucket == bucket) {
        iter->operator++();
        iter->__next_bucket = iter->__bucket;
        iter->__bucket = nullptr;
      } else if (iter->__next_bucket == bucket) {
        iter->__bucket = bucket;
        iter->operator++();
        iter->__next_bucket = iter->__bucket;
        iter->__bucket = nullptr;
      }
    }

    // remove the element from the __nodes vector
    __nodes[index].erase(bucket);

    --__nb_elements;

    if ((index == __begin_index) && __nodes[index].empty()) {
      __begin_index = std::numeric_limits< Size >::max();
    }
  }

__insert()

template<typename Key , typename Val , typename Alloc >

void gum::HashTable< Key, Val, Alloc >::__insert ( Bucket *  bucket )

private

Adds a new element (actually a copy of this element) in the hash table.

If there already exists an element with the same key in the list and the uniqueness policy prevents multiple identical keys to belong to the same hashtable, an exception DuplicateElement is thrown. If the uniqueness policy is not set, the method runs in the worst case in constant time, else if the automatic resizing policy is set, it runs in constant time in average linear in the number of elements by slot.

Parameters

bucket

The bucket inserted in the hash table.

Exceptions

DuplicateElement

is thrown when attempting to insert a pair (key,val) in a hash table containing already a pair with the same key and when the hash table's uniqueness policy is set.

Definition at line 841 of file hashTable_tpl.h.

                                                                               {
    Size hash_key = __hash_func(bucket->key());

    // check that there does not already exist an element with the same key
    if (__key_uniqueness_policy && __nodes[hash_key].exists(bucket->key())) {
      // remove the bucket from memory
      Key k = bucket->key();
      __alloc.destroy(bucket);
      __alloc.deallocate(bucket, 1);
      GUM_ERROR(DuplicateElement,
                "the hashtable contains an element with the same key (" << k
                                                                        << ")");
    }

    // check whether there is sufficient space to insert the new pair
    // if not, resize the current hashtable
    if (__resize_policy
        && (__nb_elements >= __size * HashTableConst::default_mean_val_by_slot)) {
      resize(__size << 1);
      hash_key = __hash_func(bucket->key());
    }

    // add the new pair
    __nodes[hash_key].insert(bucket);
    ++__nb_elements;

    // recompute the index of the beginning of the hashtable if possible
    // WARNING: if __begin_index = std::numeric_limits<Size>::max (), we CANNOT
    // recompute the index because we cannot know whether the current index is
    // equal to max because there was no element in the hashtable or whether a
    // previous __erase() has set the index to max.
    if (__begin_index < hash_key) { __begin_index = hash_key; }
  }

begin() [1/2]

template<typename Key , typename Val , typename Alloc >

INLINE HashTable< Key, Val, Alloc >::iterator gum::HashTable< Key, Val, Alloc >::begin

(

)

Returns an unsafe iterator pointing to the beginning of the hashtable.

Unsafe iterators are slightly faster than safe iterators. However, BE CAREFUL when using them: they should ONLY be used when you have the guarantee that they will never point to a deleted element. If unsure, prefer using the safe iterators (those are only slightly slower).

Returns

Returns an unsafe iterator pointing to the beginning of the hashtable.

Definition at line 636 of file hashTable_tpl.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::learning::Miic::_orientation_3off2(), gum::learning::Miic::_orientation_miic(), gum::Estimator< GUM_SCALAR >::confidence(), and gum::SmallObjectAllocator::~SmallObjectAllocator().

                                         {
    // if the table is empty, make the begin and end point to the same element
    if (__nb_elements == Size(0))
      return iterator{end()};
    else
      return iterator{*this};
  }

Here is the caller graph for this function:

begin() [2/2]

template<typename Key , typename Val , typename Alloc >

INLINE HashTable< Key, Val, Alloc >::const_iterator gum::HashTable< Key, Val, Alloc >::begin

(

)

const

Returns an unsafe const_iterator pointing to the beginning of the hashtable.

Unsafe iterators are slightly faster than safe iterators. However, BE CAREFUL when using them: they should ONLY be used when you have the guarantee that they will never point to a deleted element. If unsure, prefer using the safe iterators (those are only slightly slower).

Returns

Returns an unsafe const_iterator pointing to the beginning of the hashtable.

Definition at line 646 of file hashTable_tpl.h.

                                               {
    // if the table is empty, make the begin and end point to the same element
    if (__nb_elements == Size(0))
      return const_iterator{end()};
    else
      return const_iterator{*this};
  }

beginSafe() [1/2]

template<typename Key , typename Val , typename Alloc >

INLINE HashTable< Key, Val, Alloc >::iterator_safe gum::HashTable< Key, Val, Alloc >::beginSafe

(

)

Returns the safe iterator pointing to the beginning of the hashtable.

Safe iterators are slightly slower than unsafe ones but they guarantee that you will never get a segfault if they try to access to a deleted element or if they try a ++ operation from a deleted element.

Returns

Returns the safe iterator pointing to the beginning of the hashtable.

Definition at line 696 of file hashTable_tpl.h.

Referenced by gum::SetTerminalNodePolicy< GUM_SCALAR >::clearAllTerminalNodes(), gum::DAGCycleDetector::hasCycleFromModifications(), gum::LeafAggregator::leavesMap(), gum::StructuredPlaner< double >::optimalPolicy2String(), gum::SetTerminalNodePolicy< GUM_SCALAR >::terminalNodeId(), gum::MultiDimFunctionGraph< bool, ExactTerminalNodePolicy >::toDot(), gum::ITI< AttributeSelection, isScalar >::updateGraph(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::~IncrementalGraphLearner(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::~MultiDimFunctionGraphOperator(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

                                             {
    // if the table is empty, make the begin and end point to the same element
    if (__nb_elements == Size(0))
      return iterator_safe{endSafe()};
    else
      return iterator_safe{*this};
  }

Here is the caller graph for this function:

beginSafe() [2/2]

template<typename Key , typename Val , typename Alloc >

INLINE HashTable< Key, Val, Alloc >::const_iterator_safe gum::HashTable< Key, Val, Alloc >::beginSafe

(

)

const

Returns the safe const_iterator pointing to the beginning of the hashtable.

Safe iterators are slightly slower than unsafe ones but they guarantee that you will never get a segfault if they try to access to a deleted element or if they try a ++ operation from a deleted element.

Returns

Returns the safe const_iterator pointing to the beginning of the hashtable.

Definition at line 706 of file hashTable_tpl.h.

                                                   {
    // if the table is empty, make the begin and end point to the same element
    if (__nb_elements == Size(0))
      return const_iterator_safe{endSafe()};
    else
      return const_iterator_safe{*this};
  }

capacity()

template<typename Key , typename Val , typename Alloc >

INLINE Size gum::HashTable< Key, Val, Alloc >::capacity ( ) const

noexcept

Returns the number of slots in the 'nodes' vector of the hashtable.

The method runs in constant time.

Returns

Returns the number of slots in the 'nodes' vector of the hashtable.

Definition at line 741 of file hashTable_tpl.h.

Referenced by gum::ArcGraphPart::ArcGraphPart().

                                                                    {
    return __size;
  }

Here is the caller graph for this function:

cbegin()

template<typename Key , typename Val , typename Alloc >

INLINE HashTable< Key, Val, Alloc >::const_iterator gum::HashTable< Key, Val, Alloc >::cbegin

(

)

const

Returns an unsafe const_iterator pointing to the beginning of the hashtable.

Unsafe iterators are slightly faster than safe iterators. However, BE CAREFUL when using them: they should ONLY be used when you have the guarantee that they will never point to a deleted element. If unsure, prefer using the safe iterators (those are only slightly slower).

Returns

Returns an unsafe const_iterator pointing to the beginning of the hashtable.

Definition at line 656 of file hashTable_tpl.h.

Referenced by gum::DAGCycleDetector::__addWeightedSet(), gum::BijectionImplementation< Idx, const std::string *, std::allocator< const std::string * >, std::is_scalar< Idx >::value &&std::is_scalar< const std::string * >::value >::__copy(), gum::DAGCycleDetector::__delWeightedSet(), gum::DAGCycleDetector::__restrictWeightedSet(), gum::credal::InferenceEngine< GUM_SCALAR >::_updateCredalSets(), gum::DAGCycleDetector::addArc(), gum::DAGCycleDetector::eraseArc(), gum::DAGCycleDetector::hasCycleFromModifications(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator*(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator+(), and gum::learning::StructuralConstraintSliceOrder::StructuralConstraintSliceOrder().

                                                {
    // if the table is empty, make the begin and end point to the same element
    if (__nb_elements == Size(0))
      return const_iterator{cend()};
    else
      return const_iterator{*this};
  }

Here is the caller graph for this function:

cbeginSafe()

template<typename Key , typename Val , typename Alloc >

INLINE HashTable< Key, Val, Alloc >::const_iterator_safe gum::HashTable< Key, Val, Alloc >::cbeginSafe

(

)

const

Returns the safe const_iterator pointing to the beginning of the hashtable.

Safe iterators are slightly slower than unsafe ones but they guarantee that you will never get a segfault if they try to access to a deleted element or if they try a ++ operation from a deleted element.

Returns

Returns the safe const_iterator pointing to the beginning of the hashtable.

Definition at line 716 of file hashTable_tpl.h.

Referenced by gum::IMDDI< AttributeSelection, isScalar >::__rebuildFunctionGraph(), gum::LeastSquareTestPolicy< GUM_SCALAR >::add(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrABeginSafe(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrBBeginSafe(), and gum::SetTerminalNodePolicy< GUM_SCALAR >::beginValues().

                                                    {
    // if the table is empty, make the begin and end point to the same element
    if (__nb_elements == Size(0))
      return const_iterator_safe{cendSafe()};
    else
      return const_iterator_safe{*this};
  }

Here is the caller graph for this function:

cend()

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::const_iterator & gum::HashTable< Key, Val, Alloc >::cend ( ) const

noexcept

Returns the unsafe const_iterator pointing to the end of the hashtable.

Unsafe iterators are slightly faster than safe iterators. However, BE CAREFUL when using them: they should ONLY be used when you have the guarantee that they will never point to a deleted element. If unsure, prefer using the safe iterators (those are only slightly slower).

Returns

Returns the unsafe const_iterator pointing to the end of the hashtable.

Definition at line 626 of file hashTable_tpl.h.

Referenced by gum::DAGCycleDetector::__addWeightedSet(), gum::BijectionImplementation< Idx, const std::string *, std::allocator< const std::string * >, std::is_scalar< Idx >::value &&std::is_scalar< const std::string * >::value >::__copy(), gum::DAGCycleDetector::__delWeightedSet(), gum::DAGCycleDetector::__restrictWeightedSet(), gum::credal::InferenceEngine< GUM_SCALAR >::_updateCredalSets(), gum::DAGCycleDetector::addArc(), gum::DAGCycleDetector::eraseArc(), gum::DAGCycleDetector::hasCycleFromModifications(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator*(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator+(), and gum::learning::StructuralConstraintSliceOrder::StructuralConstraintSliceOrder().

                                                       {
    // note that, here, we know for sure that HashTableIterEnd has been properly
    // initialized as it is initialized by end4Statics, which is called by
    // all hashtables' constructors
    return *(reinterpret_cast< const const_iterator* >(
       HashTableIteratorStaticEnd::__HashTableIterEnd));
  }

Here is the caller graph for this function:

cendSafe()

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::const_iterator_safe & gum::HashTable< Key, Val, Alloc >::cendSafe ( ) const

noexcept

Returns the safe const_iterator pointing to the end of the hashtable.

Safe iterators are slightly slower than unsafe ones but they guarantee that you will never get a segfault if they try to access to a deleted element or if they try a ++ operation from a deleted element.

Returns

Returns the safe const_iterator pointing to the end of the hashtable.

Definition at line 686 of file hashTable_tpl.h.

Referenced by gum::IMDDI< AttributeSelection, isScalar >::__rebuildFunctionGraph(), gum::LeastSquareTestPolicy< GUM_SCALAR >::add(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrAEndSafe(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrBEndSafe(), gum::SetTerminalNodePolicy< GUM_SCALAR >::hasValue(), and gum::ITI< AttributeSelection, isScalar >::updateGraph().

                                                           {
    // note that, here, we know for sure that HashTableIterEnd has been properly
    // initialized as it is initialized by end4Statics, which is called by
    // all hashtables' constructors
    return *(reinterpret_cast< const const_iterator_safe* >(
       HashTableIteratorStaticEnd::__HashTableIterEndSafe));
  }

Here is the caller graph for this function:

clear()

template<typename Key , typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::clear

(

)

Removes all the elements in the hash table.

The function does not resize the nodes vector (even if the size of this one has been increased after the creation of the hash table) and it resets the iterators on the hash table to end. The method runs in linear time w.r.t. the number of iterators pointing to the hash table.

Definition at line 471 of file hashTable_tpl.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::credal::InferenceEngine< GUM_SCALAR >::_initExpectations(), gum::credal::InferenceEngine< GUM_SCALAR >::_initMarginals(), gum::credal::InferenceEngine< GUM_SCALAR >::_initMarginalSets(), gum::credal::MultipleInferenceEngine< GUM_SCALAR, BNInferenceEngine >::_initThreadsData(), gum::credal::InferenceEngine< GUM_SCALAR >::_repetitiveInit(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::Estimator< GUM_SCALAR >::clear(), gum::SetTerminalNodePolicy< GUM_SCALAR >::clearAllTerminalNodes(), gum::credal::InferenceEngine< GUM_SCALAR >::eraseAllEvidence(), gum::MultiDimSparse< GUM_SCALAR >::fill(), gum::credal::InferenceEngine< GUM_SCALAR >::insertEvidence(), gum::credal::InferenceEngine< GUM_SCALAR >::insertEvidenceFile(), gum::credal::InferenceEngine< GUM_SCALAR >::insertQuery(), gum::credal::InferenceEngine< GUM_SCALAR >::insertQueryFile(), and gum::Chi2::setConfidenceProba().

                                                  {
    // update all the registered iterators: they should now point to nullptr
    // and they are positioned to the end of the hashtable.
    __clearIterators();

    // remove the buckets
    for (Size i = Size(0); i < __size; ++i)
      __nodes[i].clear();

    __nb_elements = Size(0);
    __begin_index = std::numeric_limits< Size >::max();
  }

Here is the caller graph for this function:

constEnd4Statics()

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::const_iterator & gum::HashTable< Key, Val, Alloc >::constEnd4Statics ( )

static

Returns the end iterator for other classes' statics (read the detailed description of this method).

To reduce memory consumption of hash tables (which are heavily used in aGrUM) while allowing fast for(iter=begin(); iter!=end();++iter) loops, end iterators are created just once as a static member of a non-template hashtable. While this scheme is efficient and it works quite effectively when manipulating hashtables, it has a drawback: other classes with static members using the HashTable's end() iterator may fail to work due to the well known "static initialization order fiasco" (see Marshall Cline's C++ FAQ for more details about this C++ feature). OK, so what is the problem? Consider for instance class Set. A Set contains a hashtable that stores all its elements in a convenient way. To reduce memory consumption, Set::end iterator is a static member that is initialized with a HashTable's end iterator. If the compiler decides to initialize Set::end before initializing HashTable::end, then Set::end will be in an incoherent state. Unfortunately, we cannot know for sure in which order static members will be initialized (the order is a compiler's decision). Hence, we shall enforce the fact that HashTable::end is initialized before Set::end. Using method HashTable::end4Statics will ensure this fact: it uses the C++ "construct on first use" idiom (see the C++ FAQ) that ensures that the order fiasco is avoided. More precisely, end4Statics initializes a global variable that is the very end iterator used by all hashtables. Now, this induces a small overhead. So, we also provide a HashTable::end() method that returns the end iterator without this small overhead, but assuming that function end4Statics has already been called once (which is always the case) when a hashtable has been created.

So, to summarize: when initializing static members, use constEnd4Statics() rather than cend(). In all the other cases, use simply the usual method cend().

Returns

Returns the end iterator for other classes' statics (read the detailed description of this method).

Definition at line 346 of file hashTable_tpl.h.

                                                    {
    return *(reinterpret_cast< const const_iterator* >(
       HashTableIteratorStaticEnd::constEnd4Statics()));
  }

constEndSafe4Statics()

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::const_iterator_safe & gum::HashTable< Key, Val, Alloc >::constEndSafe4Statics ( )

static

Returns the end iterator for other classes' statics (read the detailed description of this method).

To reduce memory consumption of hash tables (which are heavily used in aGrUM) while allowing fast for(iter=begin(); iter!=end();++iter) loops, end iterators are created just once as a static member of a non-template hashtable. While this scheme is efficient and it works quite effectively when manipulating hashtables, it has a drawback: other classes with static members using the HashTable's end() iterator may fail to work due to the well known "static initialization order fiasco" (see Marshall Cline's C++ FAQ for more details about this C++ feature). OK, so what is the problem? Consider for instance class Set. A Set contains a hashtable that stores all its elements in a convenient way. To reduce memory consumption, Set::end iterator is a static member that is initialized with a HashTable's end iterator. If the compiler decides to initialize Set::end before initializing HashTable::end, then Set::end will be in an incoherent state. Unfortunately, we cannot know for sure in which order static members will be initialized (the order is a compiler's decision). Hence, we shall enforce the fact that HashTable::end is initialized before Set::end. Using method HashTable::end4Statics will ensure this fact: it uses the C++ "construct on first use" idiom (see the C++ FAQ) that ensures that the order fiasco is avoided. More precisely, end4Statics initializes a global variable that is the very end iterator used by all hashtables. Now, this induces a small overhead. So, we also provide a HashTable::end() method that returns the end iterator without this small overhead, but assuming that function end4Statics has already been called once (which is always the case) when a hashtable has been created.

So, to summarize: when initializing static members, use constEndSafe4Statics() rather than cendSafe(). In all the other cases, use simply the usual method cendSafe().

Returns

Returns the end iterator for other classes' statics (read the detailed description of this method).

Definition at line 360 of file hashTable_tpl.h.

                                                        {
    return *(reinterpret_cast< const const_iterator_safe* >(
       HashTableIteratorStaticEnd::constEndSafe4Statics()));
  }

emplace() [1/2]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename... Args>

INLINE HashTable< Key, Val, Alloc >::value_type& gum::HashTable< Key, Val, Alloc >::emplace

(

Args &&...

args

)

Definition at line 942 of file hashTable_tpl.h.

                                                         {
    Bucket* bucket = __alloc.allocate(1);

    try {
      __alloc.construct(bucket,
                        HashTableBucket< Key, Val >::Emplace::EMPLACE,
                        std::forward< Args >(args)...);
    } catch (...) {
      __alloc.deallocate(bucket, 1);
      throw;
    }

    __insert(bucket);
    return bucket->elt();
  }

emplace() [2/2]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename... Args>

value_type& gum::HashTable< Key, Val, Alloc >::emplace

(

Args &&...

args

)

Emplace a new element into the hashTable.

If there already exists an element with the same key in the list and the uniqueness policy prevents multiple identical keys to belong to the same hashtable, an exception DuplicateElement is thrown. If the uniqueness policy is not set, the method runs in the worst case in constant time, else if the automatic resizing policy is set, it runs in constant time in average linear in the number of elements by slot.

Returns

a reference to the pair (key,val) inserted in the hash table.

Exceptions

DuplicateElement

is thrown when attempting to insert a pair (key,val) in a hash table containing already a pair with the same key and when the hash table's uniqueness policy is set.

Parameters

args	The element to emplace.

empty()

template<typename Key , typename Val , typename Alloc >

INLINE bool gum::HashTable< Key, Val, Alloc >::empty ( ) const

noexcept

Indicates whether the hash table is empty.

Returns

Returns true if the gum::HashTable is empty.

Definition at line 1086 of file hashTable_tpl.h.

Referenced by gum::credal::InferenceEngine< GUM_SCALAR >::_dynamicExpectations(), gum::prm::PRMFactory< GUM_SCALAR >::addInstance(), gum::credal::InferenceEngine< GUM_SCALAR >::insertEvidence(), gum::credal::InferenceEngine< GUM_SCALAR >::insertEvidenceFile(), gum::credal::InferenceEngine< GUM_SCALAR >::insertQuery(), gum::credal::InferenceEngine< GUM_SCALAR >::insertQueryFile(), gum::MultiDimFunctionGraphProjector< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::project(), gum::BayesBall::relevantPotentials(), and gum::credal::InferenceEngine< GUM_SCALAR >::toString().

                                                                 {
    return (__nb_elements == Size(0));
  }

Here is the caller graph for this function:

end() [1/2]

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::iterator & gum::HashTable< Key, Val, Alloc >::end ( )

noexcept

Returns the unsafe iterator pointing to the end of the hashtable.

Unsafe iterators are slightly faster than safe iterators. However, BE CAREFUL when using them: they should ONLY be used when you have the guarantee that they will never point to a deleted element. If unsure, prefer using the safe iterators (those are only slightly slower).

Returns

Returns the unsafe iterator pointing to the end of the hashtable.

Definition at line 606 of file hashTable_tpl.h.

Referenced by gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::learning::Miic::_orientation_3off2(), gum::learning::Miic::_orientation_miic(), gum::Estimator< GUM_SCALAR >::confidence(), and gum::SmallObjectAllocator::~SmallObjectAllocator().

                                                {
    // note that, here, we know for sure that HashTableIterEnd has been properly
    // initialized as it is initialized by end4Statics, which is called by
    // all hashtables' constructors
    return *(reinterpret_cast< const iterator* >(
       HashTableIteratorStaticEnd::__HashTableIterEnd));
  }

Here is the caller graph for this function:

end() [2/2]

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::const_iterator & gum::HashTable< Key, Val, Alloc >::end ( ) const

noexcept

Returns the unsafe const_iterator pointing to the end of the hashtable.

Unsafe iterators are slightly faster than safe iterators. However, BE CAREFUL when using them: they should ONLY be used when you have the guarantee that they will never point to a deleted element. If unsure, prefer using the safe iterators (those are only slightly slower).

Returns

Returns the unsafe const_iterator pointing to the end of the hashtable.

Definition at line 616 of file hashTable_tpl.h.

                                                      {
    // note that, here, we know for sure that HashTableIterEnd has been properly
    // initialized as it is initialized by end4Statics, which is called by
    // all hashtables' constructors
    return *(reinterpret_cast< const const_iterator* >(
       HashTableIteratorStaticEnd::__HashTableIterEnd));
  }

end4Statics()

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::iterator & gum::HashTable< Key, Val, Alloc >::end4Statics ( )

static

Returns the end iterator for other classes' statics (read the detailed description of this method).

To reduce memory consumption of hash tables (which are heavily used in aGrUM) while allowing fast for(iter=begin(); iter!=end();++iter) loops, end iterators are created just once as a static member of a non-template hashtable. While this scheme is efficient and it works quite effectively when manipulating hashtables, it has a drawback: other classes with static members using the HashTable's end() iterator may fail to work due to the well known "static initialization order fiasco" (see Marshall Cline's C++ FAQ for more details about this C++ feature). OK, so what is the problem? Consider for instance class Set. A Set contains a hashtable that stores all its elements in a convenient way. To reduce memory consumption, Set::end iterator is a static member that is initialized with a HashTable's end iterator. If the compiler decides to initialize Set::end before initializing HashTable::end, then Set::end will be in an incoherent state. Unfortunately, we cannot know for sure in which order static members will be initialized (the order is a compiler's decision). Hence, we shall enforce the fact that HashTable::end is initialized before Set::end. Using method HashTable::end4Statics will ensure this fact: it uses the C++ "construct on first use" idiom (see the C++ FAQ) that ensures that the order fiasco is avoided. More precisely, end4Statics initializes a global variable that is the very end iterator used by all hashtables. Now, this induces a small overhead. So, we also provide a HashTable::end() method that returns the end iterator without this small overhead, but assuming that function end4Statics has already been called once (which is always the case) when a hashtable has been created.

So, to summarize: when initializing static members, use end4Statics() rather than end(). In all the other cases, use simply the usual method end().

Returns

Returns the end iterator for other classes' statics (read the detailed description of this method).

Definition at line 339 of file hashTable_tpl.h.

                                               {
    return *(reinterpret_cast< const iterator* >(
       HashTableIteratorStaticEnd::end4Statics()));
  }

endSafe() [1/2]

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::iterator_safe & gum::HashTable< Key, Val, Alloc >::endSafe ( )

noexcept

Returns the safe iterator pointing to the end of the hashtable.

Safe iterators are slightly slower than unsafe ones but they guarantee that you will never get a segfault if they try to access to a deleted element or if they try a ++ operation from a deleted element.

Returns

Returns the safe iterator pointing to the end of the hashtable.

Definition at line 666 of file hashTable_tpl.h.

Referenced by gum::SetTerminalNodePolicy< GUM_SCALAR >::clearAllTerminalNodes(), gum::DAGCycleDetector::hasCycleFromModifications(), gum::LeafAggregator::leavesMap(), gum::StructuredPlaner< double >::optimalPolicy2String(), gum::SetTerminalNodePolicy< GUM_SCALAR >::terminalNodeId(), gum::MultiDimFunctionGraph< bool, ExactTerminalNodePolicy >::toDot(), gum::ITI< AttributeSelection, isScalar >::updateGraph(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::~IncrementalGraphLearner(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::~MultiDimFunctionGraphOperator(), and gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::~Regress().

                                                    {
    // note that, here, we know for sure that HashTableIterEnd has been properly
    // initialized as it is initialized by end4Statics, which is called by
    // all hashtables' constructors
    return *(reinterpret_cast< const iterator_safe* >(
       HashTableIteratorStaticEnd::__HashTableIterEndSafe));
  }

Here is the caller graph for this function:

endSafe() [2/2]

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::const_iterator_safe & gum::HashTable< Key, Val, Alloc >::endSafe ( ) const

noexcept

Returns the safe const_iterator pointing to the end of the hashtable.

Safe iterators are slightly slower than unsafe ones but they guarantee that you will never get a segfault if they try to access to a deleted element or if they try a ++ operation from a deleted element.

Returns

Returns the safe const_iterator pointing to the end of the hashtable.

Definition at line 676 of file hashTable_tpl.h.

                                                          {
    // note that, here, we know for sure that HashTableIterEnd has been properly
    // initialized as it is initialized by end4Statics, which is called by
    // all hashtables' constructors
    return *(reinterpret_cast< const const_iterator_safe* >(
       HashTableIteratorStaticEnd::__HashTableIterEndSafe));
  }

endSafe4Statics()

template<typename Key , typename Val , typename Alloc >

INLINE const HashTable< Key, Val, Alloc >::iterator_safe & gum::HashTable< Key, Val, Alloc >::endSafe4Statics ( )

static

Returns the end iterator for other classes' statics (read the detailed description of this method).

To reduce memory consumption of hash tables (which are heavily used in aGrUM) while allowing fast for(iter=begin(); iter!=end();++iter) loops, end iterators are created just once as a static member of a non-template hashtable. While this scheme is efficient and it works quite effectively when manipulating hashtables, it has a drawback: other classes with static members using the HashTable's end() iterator may fail to work due to the well known "static initialization order fiasco" (see Marshall Cline's C++ FAQ for more details about this C++ feature). OK, so what is the problem? Consider for instance class Set. A Set contains a hashtable that stores all its elements in a convenient way. To reduce memory consumption, Set::end iterator is a static member that is initialized with a HashTable's end iterator. If the compiler decides to initialize Set::end before initializing HashTable::end, then Set::end will be in an incoherent state. Unfortunately, we cannot know for sure in which order static members will be initialized (the order is a compiler's decision). Hence, we shall enforce the fact that HashTable::end is initialized before Set::end. Using method HashTable::end4Statics will ensure this fact: it uses the C++ "construct on first use" idiom (see the C++ FAQ) that ensures that the order fiasco is avoided. More precisely, end4Statics initializes a global variable that is the very end iterator used by all hashtables. Now, this induces a small overhead. So, we also provide a HashTable::end() method that returns the end iterator without this small overhead, but assuming that function end4Statics has already been called once (which is always the case) when a hashtable has been created.

So, to summarize: when initializing static members, use endSafe4Statics() rather than endSafe(). In all the other cases, use simply the usual method endSafe().

Returns

Returns the end iterator for other classes' statics (read the detailed description of this method).

Definition at line 353 of file hashTable_tpl.h.

                                                   {
    return *(reinterpret_cast< const iterator_safe* >(
       HashTableIteratorStaticEnd::endSafe4Statics()));
  }

erase() [1/3]

template<typename Key, typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::erase

(

const Key &

key

)

Removes a given element from the hash table.

The element is the first one encountered in the list (from begin() to end()) having the specified key. If no such element can be found, nothing is done (in particular, it does not throw any exception). The function never resizes the nodes vector (even if the resizing policy would enable to decrease this size). The method runs in average in time linear to the number of iterators pointing to the table if the automatic resizing policy is set (else it is in linear time in the number of elements of the hash table plus the number of iterators).

Parameters

key	The key of the element to remove.

Definition at line 1021 of file hashTable_tpl.h.

Referenced by gum::DAGCycleDetector::__delWeightedSet(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::_convertNode2Leaf(), gum::ITI< AttributeSelection, isScalar >::_removeNode(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::_removeNode(), gum::SetTerminalNodePolicy< GUM_SCALAR >::eraseTerminalNode(), gum::DAGCycleDetector::hasCycleFromModifications(), and gum::BayesBall::relevantPotentials().

                                                                {
    // get the hashed key
    Size hash = __hash_func(key);

    // get the bucket containing the element to erase
    HashTableBucket< Key, Val >* bucket = __nodes[hash].bucket(key);

    __erase(bucket, hash);
  }

Here is the caller graph for this function:

erase() [2/3]

template<typename Key, typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::erase

(

const iterator_safe &

iter

)

Removes a given element from the hash table.

This method updates all the safe iterators pointing to the deleted element, i.e., when trying to dereference those iterators, an exception will be raised because they will know that the element they point to no longer exists.

Parameters

iter	An iterator over the element to remove.

Definition at line 1032 of file hashTable_tpl.h.

                                                                           {
    __erase(iter.__getBucket(), iter.__getIndex());
  }

erase() [3/3]

template<typename Key, typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::erase

(

const const_iterator_safe &

iter

)

Removes a given element from the hash table.

This method updates all the safe iterators pointing to the deleted element, i.e., when trying to dereference those iterators, an exception will be raised because they will know that the element they point to no longer exists.

Parameters

iter	An iterator over the element to remove.

Definition at line 1038 of file hashTable_tpl.h.

                                                                        {
    __erase(iter.__getBucket(), iter.__getIndex());
  }

eraseAllVal()

template<typename Key , typename Val, typename Alloc >

void gum::HashTable< Key, Val, Alloc >::eraseAllVal

(

const Val &

val

)

Removes all the elements having a certain value from the hash table.

If no such element can be found, nothing is done (in particular, it does not throw any exception). The function never resizes the nodes vector (even if the resizing policy would enable to decrease this size). Comparisons between Val instances are performed through == operators.

Parameters

val	The value to remove.

Definition at line 1077 of file hashTable_tpl.h.

                                                               {
    for (auto iterAll = cbeginSafe(); iterAll != cendSafe(); ++iterAll) {
      if (iterAll.__bucket->val() == val) {
        __erase(iterAll.__bucket, iterAll.__index);
      }
    }
  }

eraseByVal()

template<typename Key , typename Val, typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::eraseByVal

(

const Val &

val

)

Removes a given element from the hash table.

The element is the first one encountered in the list (from begin() to end()) having the specified value. If no such element can be found, nothing is done (in particular, it does not throw any exception). The function never resizes the nodes vector (even if the resizing policy would enable to decrease this size). Comparisons between Val instances are performed through == operators. Logically, this method should have been named "erase", however, this would have prevented creating hash tables where both keys and vals have the same type. Hence we chose to add "ByVal" after erase to make a difference between erasing by key and erasing by val.

Parameters

val	The value to remove.

Definition at line 1043 of file hashTable_tpl.h.

                                                                     {
    for (auto iter = cbegin(); iter != cend(); ++iter)
      if (iter.__bucket->val() == val) {
        __erase(iter.__getBucket(), iter.__getIndex());
        return;
      }
  }

exists()

template<typename Key, typename Val , typename Alloc >

INLINE bool gum::HashTable< Key, Val, Alloc >::exists

(

const Key &

key

)

const

Checks whether there exists an element with a given key in the hashtable.

The method runs in average in constant time if the resizing policy is set.

Parameters

key	The key to test for existence.

Returns

True if key is in this gum::HashTable.

Definition at line 746 of file hashTable_tpl.h.

Referenced by gum::DAGCycleDetector::__addWeightedSet(), gum::prm::o3prm::O3ClassFactory< GUM_SCALAR >::__checkImplementation(), gum::BayesNetFactory< GUM_SCALAR >::__checkVariableName(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::__compute(), gum::DAGCycleDetector::__delWeightedSet(), gum::learning::Miic::__existsDirectedPath(), gum::prm::StructuredBayesBall< GUM_SCALAR >::__fromChild(), gum::prm::StructuredBayesBall< GUM_SCALAR >::__fromParent(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label(), gum::IMDDI< AttributeSelection, isScalar >::__rebuildFunctionGraph(), gum::StructuredPlaner< double >::__recurArgMaxCopy(), gum::StructuredPlaner< double >::__recurExtractOptPol(), gum::prm::PRMFactory< GUM_SCALAR >::__retrieveCommonType(), gum::credal::CredalNet< GUM_SCALAR >::__sort_varType(), gum::learning::Miic::_orientation_3off2(), gum::learning::Miic::_propagatesHead(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::_removeNode(), gum::prm::PRMInference< double >::addEvidence(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::addObservation(), gum::SetTerminalNodePolicy< GUM_SCALAR >::addTerminalNode(), gum::SmallObjectAllocator::allocate(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrAMarginal(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrBMarginal(), gum::BayesNetFactory< GUM_SCALAR >::BayesNetFactory(), gum::MultiDimFunctionGraph< bool, ExactTerminalNodePolicy >::copyAndMultiplyByScalar(), gum::ArcGraphPart::directedPath(), gum::ArcGraphPart::directedUnorientedPath(), gum::SetTerminalNodePolicy< GUM_SCALAR >::eraseTerminalNode(), gum::HashTable< Val, Size, IndexAllocator >::exists(), gum::SetTerminalNodePolicy< GUM_SCALAR >::existsTerminalNodeWithId(), gum::MultiDimSparse< GUM_SCALAR >::get(), gum::DAGCycleDetector::hasCycleFromModifications(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::isTerminal(), gum::ContingencyTable< Idx, GUM_SCALAR >::joint(), gum::LeafAggregator::leavesMap(), gum::MixedGraph::mixedOrientedPath(), gum::MixedGraph::mixedUnorientedPath(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator*(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator*=(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator+(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator-(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator==(), gum::StructuredPlaner< double >::optimalPolicy2String(), gum::Estimator< GUM_SCALAR >::posterior(), gum::BayesBall::relevantPotentials(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveClass(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveClassElement(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveInterface(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveSlotType(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveType(), gum::Estimator< GUM_SCALAR >::setFromBN(), gum::EliminationSequenceStrategy::setGraph(), gum::MultiDimFunctionGraph< bool, ExactTerminalNodePolicy >::toDot(), gum::credal::InferenceEngine< GUM_SCALAR >::toString(), gum::EdgeGraphPart::undirectedPath(), gum::Estimator< GUM_SCALAR >::update(), and gum::BayesNetFactory< GUM_SCALAR >::variableName().

                                                                       {
    return __nodes[__hash_func(key)].exists(key);
  }

getWithDefault() [1/2]

template<typename Key, typename Val, typename Alloc >

INLINE HashTable< Key, Val, Alloc >::mapped_type & gum::HashTable< Key, Val, Alloc >::getWithDefault	(	const Key &	key,
		const Val &	default_value
	)

Returns a reference on the element the key of which is passed in argument.

In case of multiple identical keys in the hash table, the first value encountered is returned. The method runs in constant time. In case of not found key, (key,default_value) is inserted in *this.

Parameters

key	The key for wich we want the value.
default_value	The default value to return if key does not match any value.

Returns

Returns a reference on the element the key of which is passed in argument.

Definition at line 960 of file hashTable_tpl.h.

                                                                            {
    Bucket* bucket = __nodes[__hash_func(key)].bucket(key);

    if (bucket == nullptr)
      return insert(key, default_value).second;
    else
      return bucket->val();
  }

getWithDefault() [2/2]

template<typename Key, typename Val, typename Alloc >

INLINE HashTable< Key, Val, Alloc >::mapped_type & gum::HashTable< Key, Val, Alloc >::getWithDefault	(	Key &&	key,
		Val &&	default_value
	)

Returns a reference on the element the key of which is passed in argument.

In case of multiple identical keys in the hash table, the first value encountered is returned. The method runs in constant time. In case of not found key, (key,default_value) is inserted in *this.

Parameters

key	The key for wich we want the value.
default_value	The default value to return if key does not match any value.

Returns

Returns a reference on the element the key of which is passed in argument.

Definition at line 972 of file hashTable_tpl.h.

                                                                                {
    Bucket* bucket = __nodes[__hash_func(key)].bucket(key);

    if (bucket == nullptr)
      return insert(std::move(key), std::move(default_value)).second;
    else
      return bucket->val();
  }

insert() [1/4]

template<typename Key, typename Val, typename Alloc >

INLINE HashTable< Key, Val, Alloc >::value_type & gum::HashTable< Key, Val, Alloc >::insert	(	const Key &	key,
		const Val &	val
	)

Adds a new element (actually a copy of this element) into the hash table.

If there already exists an element with the same key in the table and the uniqueness policy prevents multiple identical keys to belong to the same hashtable, an exception DuplicateElement is thrown. If the uniqueness policy is not set, the method runs in the worst case in constant time, else if the automatic resizing policy is set, it runs in constant time in average linear in the number of elements by slot.

Returns

As only a copy of val is inserted into the hashtable, the method returns a reference on a copy of the pair (key,val).

Exceptions

DuplicateElement

is thrown when attempting to insert a pair (key,val) in a hash table containing already a pair with the same key and when the hash table's uniqueness policy is set.

Parameters

key	The key to add.
val	The value to add.

Returns

The value added by copy to this gum::HashTable.

Definition at line 877 of file hashTable_tpl.h.

Referenced by gum::prm::SVE< GUM_SCALAR >::__addDelayedVariable(), gum::prm::o3prm::O3SystemFactory< GUM_SCALAR >::__addInstances(), gum::prm::o3prm::O3InterfaceFactory< GUM_SCALAR >::__addInterface2Dag(), gum::prm::ClassDependencyGraph< GUM_SCALAR >::__addNode(), gum::prm::o3prm::O3TypeFactory< GUM_SCALAR >::__addTypes2Dag(), gum::DAGCycleDetector::__addWeightedSet(), gum::prm::o3prm::O3ClassFactory< GUM_SCALAR >::__checkAndAddNodesToDag(), gum::MaxInducedWidthMCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::__checkConditions(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__compute(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::__compute(), gum::DefaultJunctionTreeStrategy::__computeJunctionTree(), gum::StaticTriangulation::__computeMaxPrimeJunctionTree(), gum::StaticTriangulation::__computeRecursiveThinning(), gum::learning::Miic::__existsDirectedPath(), gum::prm::PRMFormAttribute< GUM_SCALAR >::__fillCpf(), gum::prm::StructuredBayesBall< GUM_SCALAR >::__fillMaps(), gum::Regress< GUM_SCALAR, COMBINEOPERATOR, PROJECTOPERATOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::MultiDimFunctionGraphOperator< GUM_SCALAR, FUNCTOR, TerminalNodePolicy >::__findRetrogradeVariables(), gum::prm::StructuredBayesBall< GUM_SCALAR >::__fromChild(), gum::prm::StructuredBayesBall< GUM_SCALAR >::__fromParent(), gum::prm::gspan::InterfaceGraph< GUM_SCALAR >::__label(), gum::learning::genericBNLearner::__prepare_miic_3off2(), gum::IMDDI< AttributeSelection, isScalar >::__rebuildFunctionGraph(), gum::StructuredPlaner< double >::__recurArgMaxCopy(), gum::StructuredPlaner< double >::__recurExtractOptPol(), gum::DAGCycleDetector::__restrictWeightedSet(), gum::prm::PRMFactory< GUM_SCALAR >::__retrieveCommonType(), gum::credal::CredalNet< GUM_SCALAR >::__sort_varType(), gum::prm::GSpan< GUM_SCALAR >::__subgraph_mining(), gum::ExactBNdistance< GUM_SCALAR >::_computeKL(), gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), gum::credal::InferenceEngine< GUM_SCALAR >::_initExpectations(), gum::credal::InferenceEngine< GUM_SCALAR >::_initMarginals(), gum::credal::InferenceEngine< GUM_SCALAR >::_initMarginalSets(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::_insertInternalNode(), gum::ITI< AttributeSelection, isScalar >::_insertNode(), gum::credal::InferenceEngine< GUM_SCALAR >::_repetitiveInit(), gum::IncrementalGraphLearner< AttributeSelection, isScalar >::_transpose(), gum::DAGCycleDetector::addArc(), gum::prm::PRMInference< double >::addEvidence(), gum::prm::PRMFactory< GUM_SCALAR >::addInstance(), gum::prm::gspan::DFSTree< GUM_SCALAR >::addRoot(), gum::SetTerminalNodePolicy< GUM_SCALAR >::addTerminalNode(), gum::BarrenNodesFinder::barrenNodes(), gum::BarrenNodesFinder::barrenPotentials(), gum::BayesNetFactory< GUM_SCALAR >::BayesNetFactory(), gum::prm::ClassDependencyGraph< GUM_SCALAR >::ClassDependencyGraph(), gum::MultiDimFunctionGraph< bool, ExactTerminalNodePolicy >::copyAndMultiplyByScalar(), gum::Chi2::criticalValue(), gum::learning::genericBNLearner::Database::Database(), gum::ArcGraphPart::directedPath(), gum::ArcGraphPart::directedUnorientedPath(), gum::BayesNetFactory< GUM_SCALAR >::endVariableDeclaration(), gum::DAGCycleDetector::eraseArc(), gum::Estimator< GUM_SCALAR >::Estimator(), gum::MultiDimFunctionGraphGenerator::generate(), gum::SimpleBayesNetGenerator< GUM_SCALAR, ICPTGenerator >::generateBN(), gum::DAGCycleDetector::hasCycleFromModifications(), gum::AdaptiveRMaxPlaner::initialize(), gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::insert(), gum::credal::InferenceEngine< GUM_SCALAR >::insertEvidence(), gum::credal::InferenceEngine< GUM_SCALAR >::insertEvidenceFile(), gum::credal::InferenceEngine< GUM_SCALAR >::insertQuery(), gum::credal::InferenceEngine< GUM_SCALAR >::insertQueryFile(), gum::ITI< AttributeSelection, isScalar >::ITI(), gum::LeafAggregator::leavesMap(), gum::HashTable< Val, Size, IndexAllocator >::map(), gum::MultiDimFunctionGraphManager< bool, ExactTerminalNodePolicy >::minimizeSize(), gum::MixedGraph::mixedOrientedPath(), gum::MixedGraph::mixedUnorientedPath(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator*(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator+(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator-(), gum::PriorityQueueImplementation< NodeId, double, std::greater< double >, std::allocator< NodeId >, std::is_scalar< NodeId >::value >::operator=(), gum::StructuredPlaner< double >::optimalPolicy2String(), gum::prm::gspan::Pattern::Pattern(), gum::BayesBall::relevantPotentials(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveClass(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveClassElement(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveInterface(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveSlotType(), gum::prm::o3prm::O3NameSolver< GUM_SCALAR >::resolveType(), gum::prm::PRMClass< double >::scope(), gum::DAGCycleDetector::setDAG(), gum::Estimator< GUM_SCALAR >::setFromBN(), gum::Estimator< GUM_SCALAR >::setFromLBP(), gum::DAGmodel::setProperty(), gum::learning::genericBNLearner::setSliceOrder(), gum::BayesNetFactory< GUM_SCALAR >::setVariable(), gum::TaxiSimulator::TaxiSimulator(), gum::MultiDimFunctionGraph< bool, ExactTerminalNodePolicy >::toDot(), gum::EdgeGraphPart::undirectedPath(), and gum::ITI< AttributeSelection, isScalar >::updateGraph().

                                                                              {
    Bucket* bucket = __alloc.allocate(1);

    try {
      __alloc.construct(bucket, thekey, theval);
    } catch (...) {
      __alloc.deallocate(bucket, 1);
      throw;
    }

    __insert(bucket);
    return bucket->elt();
  }

insert() [2/4]

template<typename Key, typename Val, typename Alloc >

INLINE HashTable< Key, Val, Alloc >::value_type & gum::HashTable< Key, Val, Alloc >::insert	(	Key &&	key,
		Val &&	val
	)

Moves a new element in the hash table.

If there already exists an element with the same key in the table and the uniqueness policy prevents multiple identical keys to belong to the same hashtable, an exception DuplicateElement is thrown. If the uniqueness policy is not set, the method runs in the worst case in constant time, else if the automatic resizing policy is set, it runs in constant time in average linear in the number of elements by slot.

Returns

a reference to the pair (key,val) in the hashtable.

Exceptions

DuplicateElement

is thrown when attempting to insert a pair (key,val) in a hash table containing already a pair with the same key and when the hash table's uniqueness policy is set.

Parameters

key	The key to move.
val	The value to move.

Returns

The value moved to this gum::HashTable.

Definition at line 893 of file hashTable_tpl.h.

                                                                    {
    Bucket* bucket = __alloc.allocate(1);

    try {
      __alloc.construct(bucket, std::move(thekey), std::move(theval));
    } catch (...) {
      __alloc.deallocate(bucket, 1);
      throw;
    }

    __insert(bucket);
    return bucket->elt();
  }

insert() [3/4]

template<typename Key, typename Val, typename Alloc >

INLINE HashTable< Key, Val, Alloc >::value_type & gum::HashTable< Key, Val, Alloc >::insert

(

const std::pair< Key, Val > &

elt

)

Adds a new element (actually a copy of this element) into the hash table.

If there already exists an element with the same key in the table and the uniqueness policy prevents multiple identical keys to belong to the same hashtable, an exception DuplicateElement is thrown. If the uniqueness policy is not set, the method runs in the worst case in constant time, else if the automatic resizing policy is set, it runs in constant time in average linear in the number of elements by slot.

Returns

As only a copy of val is inserted into the hashtable, the method returns a reference on a copy of the pair (key,val).

Exceptions

DuplicateElement

is thrown when attempting to insert a pair (key,val) in a hash table containing already a pair with the same key and when the hash table's uniqueness policy is set.

Parameters

elt	The pair of key value to add.

Returns

The value added by copy to this gum::HashTable.

Definition at line 909 of file hashTable_tpl.h.

                                                                        {
    Bucket* bucket = __alloc.allocate(1);

    try {
      __alloc.construct(bucket, reinterpret_cast< const value_type& >(elt));
    } catch (...) {
      __alloc.deallocate(bucket, 1);
      throw;
    }

    __insert(bucket);
    return bucket->elt();
  }

insert() [4/4]

template<typename Key, typename Val, typename Alloc >

INLINE HashTable< Key, Val, Alloc >::value_type & gum::HashTable< Key, Val, Alloc >::insert

(

std::pair< Key, Val > &&

elt

)

Moves a new element in the hash table.

If there already exists an element with the same key in the table and the uniqueness policy prevents multiple identical keys to belong to the same hashtable, an exception DuplicateElement is thrown. If the uniqueness policy is not set, the method runs in the worst case in constant time, else if the automatic resizing policy is set, it runs in constant time in average linear in the number of elements by slot.

Returns

a reference to the pair (key,val) in the hashtable.

Exceptions

DuplicateElement

is thrown when attempting to insert a pair (key,val) in a hash table containing already a pair with the same key and when the hash table's uniqueness policy is set.

Parameters

elt	The pair of key value to move in this gum::HashTable.

Returns

The value moved to this gum::HashTable.

Definition at line 925 of file hashTable_tpl.h.

                                                                   {
    Bucket* bucket = __alloc.allocate(1);

    try {
      __alloc.construct(bucket, std::move(reinterpret_cast< value_type& >(elt)));
    } catch (...) {
      __alloc.deallocate(bucket, 1);
      throw;
    }

    __insert(bucket);
    return bucket->elt();
  }

key()

template<typename Key, typename Val , typename Alloc >

INLINE const Key & gum::HashTable< Key, Val, Alloc >::key

(

const Key &

key

)

const

Returns a reference on a given key.

Some complex structures use pointers on keys of hashtables. These structures thus require that we do not only get a copy of a given key, but the key stored in the hashtable itself. This is the very purpose of this function.

Parameters

key	The key to return.

Returns

Returns a reference on a given key.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 1065 of file hashTable_tpl.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::keyByVal(), gum::StructuredPlaner< double >::optimalPolicy2String(), and gum::MultiDimFunctionGraph< bool, ExactTerminalNodePolicy >::toDot().

                                                                          {
    // get the bucket corresponding to the key
    Bucket* bucket = __nodes[__hash_func(key)].bucket(key);

    if (bucket == nullptr) {
      GUM_ERROR(NotFound, "key does not belong to the hashtable");
    }

    return bucket->key();
  }

Here is the caller graph for this function:

keyByVal()

template<typename Key , typename Val, typename Alloc >

INLINE const Key & gum::HashTable< Key, Val, Alloc >::keyByVal

(

const Val &

val

)

const

Returns a reference on the key given a value.

In case of multiple identical values in the hash table, the first key encountered is returned. The method runs in linear time.

Parameters

val	The value for which the key is returned.

Returns

Returns a reference on the key given a value.

Exceptions

NotFound

Raised if the element cannot be found.

Definition at line 1057 of file hashTable_tpl.h.

                                                                               {
    for (auto iter = begin(); iter != end(); ++iter)
      if (iter.__bucket->val() == val) return iter.key();

    GUM_ERROR(NotFound, "not enough elements in the chained list");
  }

keyUniquenessPolicy()

template<typename Key , typename Val , typename Alloc >

INLINE bool gum::HashTable< Key, Val, Alloc >::keyUniquenessPolicy ( ) const

noexcept

Returns the current checking policy.

Returns

Returns the current checking policy.

Definition at line 768 of file hashTable_tpl.h.

                                                                               {
    return __key_uniqueness_policy;
  }

map() [1/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc >

HashTable< Key, Mount, OtherAlloc > INLINE gum::HashTable< Key, Val, Alloc >::map	(	Mount(*)(Val)	f,
		Size	size,
		bool	resize_pol,
		bool	key_uniqueness_pol
	)		const

Definition at line 1092 of file hashTable_tpl.h.

                                                                                 {
    // determine the proper size of the hashtable
    // by default, the size of the table is set so that the table does not take
    // too much space while allowing to add a few elements without needing to
    // resize in autmatic resizing mode
    if (size == 0) size = std::max(Size(2), __nb_elements / 2);

    // create a new table
    HashTable< Key, Mount, OtherAlloc > table(
       size, resize_pol, key_uniqueness_pol);

    // fill the new hash table
    for (auto iter = begin(); iter != end(); ++iter) {
      table.insert(iter.key(), f(iter.val()));
    }

    return table;
  }

map() [2/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc >

HashTable< Key, Mount, OtherAlloc > INLINE gum::HashTable< Key, Val, Alloc >::map	(	Mount(*)(Val &)	f,
		Size	size,
		bool	resize_pol,
		bool	key_uniqueness_pol
	)		const

Definition at line 1114 of file hashTable_tpl.h.

                                                                                  {
    // determine the proper size of the hashtable
    // by default, the size of the table is set so that the table does not take
    // too much space while allowing to add a few elements without needing to
    // resize in autmatic resizing mode
    if (size == Size(0)) size = std::max(Size(2), __nb_elements / 2);

    // create a new table
    HashTable< Key, Mount, OtherAlloc > table(
       size, resize_pol, key_uniqueness_pol);

    // fill the new hash table
    for (auto iter = begin(); iter != end(); ++iter) {
      table.insert(iter.key(), f(const_cast< Val& >(iter.val())));
    }

    return table;
  }

map() [3/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc >

HashTable< Key, Mount, OtherAlloc > INLINE gum::HashTable< Key, Val, Alloc >::map	(	Mount(*)(const Val &)	f,
		Size	size,
		bool	resize_pol,
		bool	key_uniqueness_pol
	)		const

Definition at line 1137 of file hashTable_tpl.h.

                                                                             {
    // determine the proper size of the hashtable
    // by default, the size of the table is set so that the table does not take
    // too much space while allowing to add a few elements without needing to
    // resize in autmatic resizing mode
    if (size == Size(0)) size = std::max(Size(2), __nb_elements / 2);

    // create a new table
    HashTable< Key, Mount, OtherAlloc > table(
       size, resize_pol, key_uniqueness_pol);

    // fill the new hash table
    for (auto iter = begin(); iter != end(); ++iter) {
      table.insert(iter.key(), f(iter.val()));
    }

    return table;
  }

map() [4/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc >

HashTable< Key, Mount, OtherAlloc > INLINE gum::HashTable< Key, Val, Alloc >::map	(	const Mount &	val,
		Size	size,
		bool	resize_pol,
		bool	key_uniqueness_pol
	)		const

Definition at line 1161 of file hashTable_tpl.h.

                                                                                  {
    // determine the proper size of the hashtable
    // by default, the size of the table is set so that the table does not take
    // too much space while allowing to add a few elements without needing to
    // resize in autmatic resizing mode
    if (size == Size(0)) size = std::max(Size(2), __nb_elements / 2);

    // create a new table
    HashTable< Key, Mount, OtherAlloc > table(
       size, resize_pol, key_uniqueness_pol);

    // fill the new hash table
    for (auto iter = begin(); iter != end(); ++iter) {
      table.insert(iter.key(), val);
    }

    return table;
  }

map() [5/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>

HashTable< Key, Mount, OtherAlloc > gum::HashTable< Key, Val, Alloc >::map	(	Mount(*)(Val)	f,
		Size	size = Size(0),
		bool	resize_pol = HashTableConst::default_resize_policy,
		bool	key_uniqueness_pol = HashTableConst::default_uniqueness_policy
	)		const

Transforms a hashtable of vals into a hashtable of mountains.

Warning

Although the resulting hashtable has the same number of elements as the original hashtable, by default, the size of the former may not be equal to that of the latter. Hence iterators on the original hashtable may not parse it in the same order as iterators on the resulting hashtable. To guarrantee that both hashtables have the same size (and thus have the elements in the same order), set the size argument to the size of the original hashtable.

Parameters

f	A function that maps any Val element into a Mount.
size	The size of the resulting hashtable. When equal to 0, a default size is computed that is a good trade-off between space consumption and efficiency of new elements insertions
resize_pol	the resizing policy (automatic or manual resizing)
key_uniqueness_pol	uniqueness policy

Returns

Returns the gum::HashTable of mountains.

map() [6/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>

HashTable< Key, Mount, OtherAlloc > gum::HashTable< Key, Val, Alloc >::map	(	Mount(*)(Val &)	f,
		Size	size = Size(0),
		bool	resize_pol = HashTableConst::default_resize_policy,
		bool	key_uniqueness_pol = HashTableConst::default_uniqueness_policy
	)		const

Transforms a hashtable of vals into a hashtable of mountains.

Warning

Although the resulting hashtable has the same number of elements as the original hashtable, by default, the size of the former may not be equal to that of the latter. Hence iterators on the original hashtable may not parse it in the same order as iterators on the resulting hashtable. To guarrantee that both hashtables have the same size (and thus have the elements in the same order), set the size argument to the size of the original hashtable.

Parameters

f	A function that maps any Val element into a Mount.
size	The size of the resulting hashtable. When equal to 0, a default size is computed that is a good trade-off between space consumption and efficiency of new elements insertions
resize_pol	the resizing policy (automatic or manual resizing)
key_uniqueness_pol	uniqueness policy

Returns

Returns the gum::HashTable of mountains.

map() [7/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>

HashTable< Key, Mount, OtherAlloc > gum::HashTable< Key, Val, Alloc >::map	(	Mount(*)(const Val &)	f,
		Size	size = Size(0),
		bool	resize_pol = HashTableConst::default_resize_policy,
		bool	key_uniqueness_pol = HashTableConst::default_uniqueness_policy
	)		const

Transforms a hashtable of vals into a hashtable of mountains.

Warning

Although the resulting hashtable has the same number of elements as the original hashtable, by default, the size of the former may not be equal to that of the latter. Hence iterators on the original hashtable may not parse it in the same order as iterators on the resulting hashtable. To guarrantee that both hashtables have the same size (and thus have the elements in the same order), set the size argument to the size of the original hashtable.

Parameters

f	A function that maps any Val element into a Mount.
size	The size of the resulting hashtable. When equal to 0, a default size is computed that is a good trade-off between space consumption and efficiency of new elements insertions
resize_pol	the resizing policy (automatic or manual resizing)
key_uniqueness_pol	uniqueness policy

Returns

Returns the gum::HashTable of mountains.

map() [8/8]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename Mount , typename OtherAlloc = typename Alloc::template rebind< std::pair< Key, Mount > >::other>

HashTable< Key, Mount, OtherAlloc > gum::HashTable< Key, Val, Alloc >::map	(	const Mount &	val,
		Size	size = Size(0),
		bool	resize_pol = HashTableConst::default_resize_policy,
		bool	key_uniqueness_pol = HashTableConst::default_uniqueness_policy
	)		const

Creates a hashtable of mounts with a given value from a hashtable of vals.

Warning

Although the resulting hashtable has the same number of elements as the original hashtable, by default, the size of the former may not be equal to that of the latter. Hence iterators on the original hashtable may not parse it in the same order as iterators on the resulting hashtable. To guarrantee that both hashtables have the same size (and thus have the elements in the same order), set the size argument to the size of the original hashtable.

Parameters

val	The value taken by all the elements of the resulting hashtable.
size	The size of the resulting hashtable. When equal to 0, a default size is computed that is a good trade-off between space consumption and efficiency of new elements insertions
resize_pol	the resizing policy (automatic or manual resizing)
key_uniqueness_pol	uniqueness policy

Returns

Returns the gum::HashTable of mountains.

operator!=() [1/2]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename OtherAlloc >

bool gum::HashTable< Key, Val, Alloc >::operator!=

(

const HashTable< Key, Val, OtherAlloc > &

from

)

const

Checks whether two hashtables contain different sets of elements.

Two hashtables are considered different if they contain different pairs (key,val). Two pairs are different if their keys have different hashed values, or if they are different in the sense of !=, or if their val's are different in the sense of !=.

Parameters

from	The gum::HashTable to test for inequality.

Returns

True if this and from are not equal.

operator!=() [2/2]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename OtherAlloc >

INLINE bool gum::HashTable< Key, Val, Alloc >::operator!=

(

const HashTable< Key, Val, OtherAlloc > &

from

)

const

Definition at line 1201 of file hashTable_tpl.h.

                                                                              {
    return !operator==(from);
  }

operator=() [1/3]

template<typename Key, typename Val, typename Alloc>

HashTable< Key, Val, Alloc > & gum::HashTable< Key, Val, Alloc >::operator=

(

const HashTable< Key, Val, Alloc > &

from

)

Copy operator.

The copy operators ensures that whenever a memory allocation problem occurs, no memory leak occurs as well and it also guarantees that in this case the hashtable returned is in a coherent state (it is an empty hashtable). Note that the copy not only involves copying pairs (key,value) but also the copy of the resize and key uniqueness policies.

Parameters

from	The gum::HashTable to copy.

Returns

Returns this gum::HashTable.

Definition at line 496 of file hashTable_tpl.h.

                                                                                    {
    // avoid self assignment
    if (this != &from) {
      // for debugging purposes
      GUM_OP_CPY(HashTable);

      // first remove the current content of the hashtable and make
      // the iterators point to end
      clear();

      // if sizes of from's and this' __nodes vectors are not the same,
      // we need to remove the current __nodes' array and to create a
      // new array with the correct size
      if (__size != from.__size) {
        __nodes.resize(from.__size);

        for (Size i = Size(0); i < from.__size; ++i) {
          __nodes[i].setAllocator(__alloc);
        }

        __size = from.__size;

        // update the hash function : this is important as the computation of
        // the hash values heavily depends on the size of the hash table
        __hash_func.resize(__size);
      }

      __resize_policy = from.__resize_policy;
      __key_uniqueness_policy = from.__key_uniqueness_policy;
      __begin_index = from.__begin_index;

      // perform the copy
      __copy(from);
    }

    return *this;
  }

operator=() [2/3]

template<typename Key, typename Val, typename Alloc >

template<typename OtherAlloc >

HashTable< Key, Val, Alloc > & gum::HashTable< Key, Val, Alloc >::operator=

(

const HashTable< Key, Val, OtherAlloc > &

from

)

Generalized copy operator.

The copy operators ensures that whenever a memory allocation problem occurs, no memory leak occurs as well and it also guarantees that in this case the hashtable returned is in a coherent state (it is an empty hashtable). Note that the copy not only involves copying pairs (key,value) but also the copy of the resize and key uniqueness policies.

Parameters

from	The gum::HashTable to copy.

Returns

Returns this gum::HashTable.

Definition at line 537 of file hashTable_tpl.h.

                                                                                         {
    // avoid self assignment
    if (this != reinterpret_cast< const HashTable< Key, Val, Alloc >* >(&from)) {
      // for debugging purposes
      GUM_OP_CPY(HashTable);

      // first remove the current content of the hashtable and make
      // the iterators point to end
      clear();

      // if sizes of from's and this' __nodes vectors are not the same,
      // we need to remove the current __nodes' array and to create a
      // new array with the correct size
      if (__size != from.__size) {
        __nodes.resize(from.__size);

        for (Size i = 0; i < from.__size; ++i) {
          __nodes[i].setAllocator(__alloc);
        }

        __size = from.__size;

        // update the hash function : this is important as the computation of
        // the hash values heavily depends on the size of the hash table
        __hash_func.resize(__size);
      }

      __resize_policy = from.__resize_policy;
      __key_uniqueness_policy = from.__key_uniqueness_policy;
      __begin_index = from.__begin_index;

      // perform the copy
      __copy(from);
    }

    return *this;
  }

operator=() [3/3]

template<typename Key, typename Val, typename Alloc>

HashTable< Key, Val, Alloc > & gum::HashTable< Key, Val, Alloc >::operator=

(

HashTable< Key, Val, Alloc > &&

from

)

Move operator.

Parameters

from	The gum::HashTable to move.

Returns

Returns this gum::HashTable.

Definition at line 577 of file hashTable_tpl.h.

                                                                                {
    // avoid self assignment
    if (this != &table) {
      // for debugging purposes
      GUM_OP_MOV(HashTable);

      // first remove the current content of the hashtable and make
      // the iterators point to end
      clear();

      __nodes = std::move(table.__nodes);
      __safe_iterators = std::move(table.__safe_iterators);
      __alloc = std::move(table.__alloc);
      __size = table.__size;
      __nb_elements = table.__nb_elements;
      __hash_func = table.__hash_func;
      __resize_policy = table.__resize_policy;
      __key_uniqueness_policy = table.__key_uniqueness_policy;
      __begin_index = table.__begin_index;

      table.__size = 0;   // necessary if we wish to perform moves iteratively,
                          // i.e. x = std::move ( y ); y = std::move ( z ); ...
    }

    return *this;
  }

operator==()

template<typename Key, typename Val, typename Alloc >

template<typename OtherAlloc >

bool gum::HashTable< Key, Val, Alloc >::operator==

(

const HashTable< Key, Val, OtherAlloc > &

from

)

const

Checks whether two hashtables contain the same elements.

Two hashtables are considered equal if they contain the identical pairs (key,val). Two pairs are identical if their keys have the same hashed value, these two keys are equal in the sense of ==, and their val's are also equal in the sense of ==.

Parameters

from	The gum::HashTable to test for equality.

Returns

True if this and from are equal.

Definition at line 1184 of file hashTable_tpl.h.

                                                                       {
    // checks whether the two hashtables contain the same number of elements
    if (from.__nb_elements != __nb_elements) return false;

    // parse this and check that each element also belongs to from
    for (auto iter = begin(); iter != end(); ++iter) {
      try {
        if (iter.val() != from[iter.key()]) return false;
      } catch (NotFound&) { return false; }
    }

    return true;
  }

operator[]() [1/2]

template<typename Key, typename Val , typename Alloc >

INLINE Val & gum::HashTable< Key, Val, Alloc >::operator[]

(

const Key &

key

)

Returns a reference on the value the key of which is passed in argument.

In case of multiple identical keys in the hash table, the first value encountered is returned. The method runs in constant time.

Parameters

key	The key of the value to return.

Returns

Returns the value matching the given key.

Exceptions

NotFound

exception is thrown if the element cannot be found.

Definition at line 725 of file hashTable_tpl.h.

                                                                     {
    return __nodes[__hash_func(key)][key];
  }

operator[]() [2/2]

template<typename Key, typename Val , typename Alloc >

INLINE const Val & gum::HashTable< Key, Val, Alloc >::operator[]

(

const Key &

key

)

const

returns a reference on the value the key of which is passed in argument

In case of multiple identical keys in the hash table, the first value encountered is returned. The method runs in constant time.

Exceptions

NotFound

exception is thrown if the element cannot be found.

Definition at line 731 of file hashTable_tpl.h.

                                                     {
    return __nodes[__hash_func(key)][key];
  }

reset()

template<typename Key, typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::reset

(

const Key &

key

)

Removes a property (i.e., remove an element).

Reset removes a property (i.e., a pair (key,val)) if it exists. This is an alias for erase but it is quite convenient when dealing with "dynamic property lists".

Parameters

key	The property to remove.

Definition at line 1052 of file hashTable_tpl.h.

Referenced by gum::MultiDimSparse< GUM_SCALAR >::set().

                                                                {
    erase(key);
  }

Here is the caller graph for this function:

resize()

template<typename Key , typename Val , typename Alloc >

void gum::HashTable< Key, Val, Alloc >::resize

(

Size

new_size

)

Changes the number of slots in the 'nodes' vector of the hash table.

Usually, method resize enables the user to resize manually the hashtable. When in automatic resize mode, the function will actually resize the table only if resizing policy is compatible with the new size, i.e., the new size is not so small that there would be too many elements per slot in the table (this would lead to a significant loss in performance). However, the resizing policy may be changed by using method setResizePolicy. The method runs in linear time in the size of the hashtable. Upon memory allocation problem, the fuction guarantees that no data is lost and that the hash table and its iterators are in a coherent state. In such a case, a bad_alloc exception is thrown.

Parameters

new_size

The new number of slots in the gum::HashTable.

Definition at line 773 of file hashTable_tpl.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::__create(), and gum::BayesBall::relevantPotentials().

                                                         {
    // new_size must be >= 2 else all the bits of the hash function are lost
    new_size = std::max(Size(2), new_size);

    // find the real size for allocation (the smallest power of 2 greater
    // than or equal to new_size) and get its base-2 logarithm
    int log_size = __hashTableLog2(new_size);
    new_size = Size(1) << log_size;

    // check if the new size is different from the actual size
    // if not, nothing else need be done

    if (new_size != __size) {
      // under automatic resize policy, check if the new size leaves
      // enough space for storing all the current elements
      if (!__resize_policy
          || (__nb_elements
              <= new_size * HashTableConst::default_mean_val_by_slot)) {
        // create a new array of __nodes to store the elements
        std::vector< HashTableList< Key, Val, Alloc > > new_nodes(new_size);

        for (auto& list : new_nodes) {
          list.setAllocator(__alloc);
        }

        // set the new hash function
        __hash_func.resize(new_size);

        // put all the elements of the current __nodes array into the new one
        Bucket* bucket;
        Size    new_hashed_key;

        for (Size i = Size(0); i < __size; ++i) {
          while ((bucket = __nodes[i].__deb_list) != nullptr) {
            // compute the new hashed key
            new_hashed_key = __hash_func(bucket->key());

            // remove the bucket from the list of buckets of the current
            // node vector
            __nodes[i].__deb_list = bucket->next;

            // put the bucket into the new __nodes vector
            new_nodes[new_hashed_key].insert(bucket);
          }
        }

        // update the size of the hash table
        __size = new_size;
        __begin_index = std::numeric_limits< Size >::max();

        // substitute the current __nodes array by the new one
        std::swap(__nodes, new_nodes);

        // update the iterators
        for (auto iter : __safe_iterators) {
          if (iter->__bucket)
            iter->__index = __hash_func(iter->__bucket->key());
          else {
            iter->__next_bucket = nullptr;
            iter->__index = 0;
          }
        }
      }
    }
  }

Here is the caller graph for this function:

resizePolicy()

template<typename Key , typename Val , typename Alloc >

INLINE bool gum::HashTable< Key, Val, Alloc >::resizePolicy ( ) const

noexcept

Returns the current resizing policy.

Returns

Returns the current resizing policy.

Definition at line 757 of file hashTable_tpl.h.

                                                                        {
    return __resize_policy;
  }

set()

template<typename Key, typename Val, typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::set	(	const Key &	key,
		const Val &	default_value
	)

Add a new property or modify it if it already existed.

When used as a "dynamic property list", it may be convenient to use this function. Function set inserts a new pair (key,val) if the key does not already exists, or it changes the value associated with key if a pair (key,val) already exists in the hash table.

Parameters

key	The key of the value to add or set.
default_value	The value to set or add.

Definition at line 982 of file hashTable_tpl.h.

Referenced by gum::SmallObjectAllocator::allocate(), and gum::MultiDimSparse< GUM_SCALAR >::set().

                                                                                {
    Bucket* bucket = __nodes[__hash_func(key)].bucket(key);

    if (bucket == nullptr)
      insert(key, value);
    else
      bucket->val() = value;
  }

Here is the caller graph for this function:

setKeyUniquenessPolicy()

template<typename Key , typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::setKeyUniquenessPolicy ( const bool  new_policy )

noexcept

Enables the user to change dynamically the policy for checking whether there can exist several elements in the table with identical keys.

By default, we should always check that there does not exist duplicate keys. However, this test slows the insertion of elements in the table. So, when we know for sure that no duplicate key will be entered into the table, we may avoid uniqueness checks.

Warning

When setting the key policy to "uniqueness", the function does not check whether there are already different elements with identical keys in the table. It thus only ensures that elements inserted from now on will have unique keys.

Definition at line 762 of file hashTable_tpl.h.

Referenced by gum::SmallObjectAllocator::SmallObjectAllocator().

                                     {
    __key_uniqueness_policy = new_policy;
  }

Here is the caller graph for this function:

setResizePolicy()

template<typename Key , typename Val , typename Alloc >

INLINE void gum::HashTable< Key, Val, Alloc >::setResizePolicy ( const bool  new_policy )

noexcept

Enables the user to change dynamically the resizing policy.

In most cases, this should be useless. However, when available memory becomes rare, avoiding automatic resizing may speed-up new insertions in the table.

Warning

This function never resizes the hashtable by itself: even if you set the new policy to be an automatic resizing and the number of elements in the table is sufficiently high that we should resize the table, function setResizePolicy won't perform this resizing. The resizing will happen only if you insert a new element or if use method resize.

Parameters

new_policy

The new resizing policy, true implies automatic resizing.

Definition at line 751 of file hashTable_tpl.h.

                                     {
    __resize_policy = new_policy;
  }

size()

template<typename Key , typename Val , typename Alloc >

INLINE Size gum::HashTable< Key, Val, Alloc >::size ( ) const

noexcept

Returns the number of elements stored into the hashtable.

The method runs in constant time.

Returns

Returns the number of elements stored into the hashtable.

Definition at line 736 of file hashTable_tpl.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::__clearIterators(), gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__insertEvidence(), gum::credal::CredalNet< GUM_SCALAR >::__sort_varType(), gum::credal::InferenceEngine< GUM_SCALAR >::_computeEpsilon(), gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrASize(), gum::ContingencyTable< Idx, GUM_SCALAR >::attrBSize(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator*(), gum::Set< gum::Potential< GUM_SCALAR > * >::operator==(), gum::MultiDimSparse< GUM_SCALAR >::realSize(), and gum::DAGCycleDetector::setDAG().

                                                                {
    return __nb_elements;
  }

Here is the caller graph for this function:

Friends And Related Function Documentation

HashTable

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename K , typename V , typename A >

friend class HashTable

friend

Friends to optimize the access to data, iterators must be friends.

Definition at line 1698 of file hashTable.h.

Bijection

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

template<typename T1 , typename T2 , typename A >

friend class Bijection

friend

For bijections to quickly access data.

Definition at line 1711 of file hashTable.h.

HashTableConstIterator< Key, Val >

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

friend class HashTableConstIterator< Key, Val >

friend

Friends to optimize the access to data, iterators must be friends.

Definition at line 1700 of file hashTable.h.

HashTableConstIteratorSafe< Key, Val >

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

friend class HashTableConstIteratorSafe< Key, Val >

friend

Friends to optimize the access to data, iterators must be friends.

Definition at line 1702 of file hashTable.h.

HashTableIterator< Key, Val >

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

friend class HashTableIterator< Key, Val >

friend

Friends to optimize the access to data, iterators must be friends.

Definition at line 1699 of file hashTable.h.

HashTableIteratorSafe< Key, Val >

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

friend class HashTableIteratorSafe< Key, Val >

friend

Friends to optimize the access to data, iterators must be friends.

Definition at line 1701 of file hashTable.h.

operator<< [1/2]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

std::ostream& operator<< ( std::ostream &  s, const HashTable< Key, Val, Alloc > &  table  )

friend

Prints the content of a gum::HashTable in the stream.

Definition at line 1242 of file hashTable_tpl.h.

                                                                      {
    bool deja = false;
    stream << "{";

    for (Size i = Size(0); i < table.__size; ++i)
      for (auto ptr = table.__nodes[i].__deb_list; ptr; ptr = ptr->next) {
        if (deja) stream << " , ";

        stream << ptr->key() << "=>" << ptr->val();

        deja = true;
      }

    stream << "}";

    return stream;
  }

operator<< [2/2]

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

std::ostream& operator<< ( std::ostream &  s, const HashTable< Key *, Val, Alloc > &  table  )

friend

Prints the content of a gum::HashTable with pointers key in the stream.

Definition at line 1262 of file hashTable_tpl.h.

                                                                       {
    bool deja = false;
    stream << "{";

    for (Size i = Size(0); i < table.__size; ++i)
      for (auto ptr = table.__nodes[i].__deb_list; ptr; ptr = ptr->next) {
        if (deja) stream << " , ";

        stream << ptr->key() << "=>" << ptr->val();

        deja = true;
      }

    stream << "}";

    return stream;
  }

Member Data Documentation

__alloc

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

BucketAllocator gum::HashTable< Key, Val, Alloc >::__alloc

private

The allocator for the buckets.

Warning

the allocator field should compulsorily be the last of field of the class. As such, for K and V fixed, all hashTable<K,V,A> are the same (up to the allocator) for all allocators A. This feature proves useful to avoid passing the allocator as a template parameter to iterators.

Definition at line 1763 of file hashTable.h.

__begin_index

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

Size gum::HashTable< Key, Val, Alloc >::__begin_index {std::numeric_limits< Size >::max()}

mutableprivate

Returns where the begin index should be.

Beware: the beginning of a HashTable is the end of its __nodes vector, i.e., the Bucket at the highest index in __nodes. This enables a slightly faster parsing than if it were the lowest index.

Warning

std::numeric_limits<Size>::max() means that we do not know where the beginning of the table really is (this can mean either that there is not yet any element in the hash table or that an erase operation has been performed and that we lost track of the element that should correspond to the begin().

Returns

Returns where the begin index should be.

Definition at line 1749 of file hashTable.h.

Referenced by gum::HashTableConstIterator< Key, bool >::HashTableConstIterator(), gum::HashTableConstIteratorSafe< const gum::DiscreteVariable *, Idx >::HashTableConstIteratorSafe(), and gum::HashTable< Val, Size, IndexAllocator >::operator=().

__hash_func

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

HashFunc< Key > gum::HashTable< Key, Val, Alloc >::__hash_func

private

The function used to hash keys (may change when the table is resized).

Definition at line 1727 of file hashTable.h.

__key_uniqueness_policy

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

bool gum::HashTable< Key, Val, Alloc >::__key_uniqueness_policy {true}

private

Shall we check for key uniqueness in the table?

Definition at line 1733 of file hashTable.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::operator=().

__nb_elements

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

Size gum::HashTable< Key, Val, Alloc >::__nb_elements {Size(0)}

private

Number of elements of type Val stored in the hash table.

Definition at line 1724 of file hashTable.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::__copy(), and gum::HashTable< Val, Size, IndexAllocator >::operator==().

__nodes

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

std::vector< HashTableList< Key, Val, Alloc > > gum::HashTable< Key, Val, Alloc >::__nodes

private

The hash table is represented as a vector of chained lists.

'__nodes' is this very vector.

Definition at line 1718 of file hashTable.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::__copy(), and gum::operator<<().

__resize_policy

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

bool gum::HashTable< Key, Val, Alloc >::__resize_policy {true}

private

Is resizing performed automatically?

Definition at line 1730 of file hashTable.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::operator=().

__safe_iterators

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

std::vector< HashTableConstIteratorSafe< Key, Val >* > gum::HashTable< Key, Val, Alloc >::__safe_iterators

mutableprivate

The list of safe iterators pointing to the hash table.

Definition at line 1753 of file hashTable.h.

__size

template<typename Key, typename Val, typename Alloc = std::allocator< std::pair< Key, Val > >>

Size gum::HashTable< Key, Val, Alloc >::__size

private

The number of nodes in vector '__nodes'.

Definition at line 1721 of file hashTable.h.

Referenced by gum::HashTable< Val, Size, IndexAllocator >::__copy(), gum::HashTable< Val, Size, IndexAllocator >::HashTable(), gum::operator<<(), and gum::HashTable< Val, Size, IndexAllocator >::operator=().

---

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

• agrum/core/hashTable.h
• agrum/core/hashTable_tpl.h