* Observers */

* Iterators */

* When erasing an element, the insert order will be preserved and no holes * will be present in the container returned by 'values_container()'.

* Capacity */

* Iterators */

* Requires index <= size(). * * Return an iterator to the element at index. Return end() if index == * size(). */

* Lookup */

* Bucket interface */

* Modifiers */

* Insert the value before pos shifting all the elements on the right of pos * (including pos) one position to the right. * * O(bucket_count()

* Iterators */

* Faster erase operation with an O(1) average complexity but it doesn't * preserve the insertion order. * * If an erasure occurs, the last el

* Return const_reference to the last element. Requires the container to not * be empty. */

* Return const_reference to the first element. Requires the container to not * be empty. */

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

* Bucket interface */

* Modifiers */

* Hash policy */

* Convert a const_iterator to an iterator. */

* Release the container in which the values are stored. * * The set is empty after this operation. */

* insert */

* insert */

* Return const_reference to the last element. Requires the container to not * be empty. */

* Swap the empty bucket with the values on its right until we cross another * empty bucket or if the other bucket has a distance_from_ideal_bucket

* Bucket interface */

* Modifiers */