* Observers */

* Iterators */

* Capacity */

* Capacity */

* Bucket interface */

* Lookup */

* Modifiers */

* Hash policy */

* Iterators */

* Modifiers */

* 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

* Bucket interface */

* Modifiers */

* Convert a const_iterator to an iterator. */

* insert */

* We can only use the hash on rehash if the size of the hash type is the same * as the stored one or if we use a power of two modulo. In the case o

* Iterators */

* Bucket interface */

* Return the bucket [0, bucket_count()) to which the hash belongs. * If bucket_count() is 0, it must always return 0. */

* Reset the growth policy as if it was created with a bucket count of 0. * After a clear, the policy must always return 0 when bucket_for_hash is