* Capacity */

* Capacity */

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

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

* Return true if the map has been rehashed. */

* Observers */

* Observers */

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

* Hash policy */

* Hash policy */

* Other */

* Convert a const_iterator to an iterator. */

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