* Capacity */

* Here to avoid `template<class K> size_type erase(const K& key)` being used * when we use an `iterator` instead of a `const_iterator`. */

* Erase the element at position 'pos'. In contrast to the regular erase() * function, erase_fast() does not return an iterator. This allows it to b

* Observers */

* Observers */

* We don't use `value_type&& value` as last argument due to a bug in MSVC * when `value_type` is a pointer, The compiler is not able to see the

* Hash policy */

* Hash policy */

* Return the maximum number of buckets supported by the policy. */

* Convert a const_iterator to an iterator. */

* Other */

* Return the number of buckets that should be used on next growth. */

* Called on the hash table creation and on rehash. The number of buckets for * the table is passed in parameter. This number is a minimum, the poli

* Grow the table if m_grow_on_next_insert is true or we reached the * max_load_factor. Shrink the table if m_try_shrink_on_next_insert is true *