std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::begin, std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::cbegin

iterator begin() noexcept;

const_iterator begin() const noexcept;

const_iterator cbegin() const noexcept;

Returns an iterator to the first element of the unordered_multiset.

If the unordered_multiset is empty, the returned iterator will be equal to end().

Parameters

(none).

Return value

Iterator to the first element.

Complexity

Constant.

Notes

Because both iterator and const_iterator are constant iterators (and may in fact be the same type), it is not possible to mutate the elements of the container through an iterator returned by any of these member functions.

Example

#include <iostream>
#include <iterator>
#include <string>
#include <unordered_set>
 
int main()
{
    const std::unordered_multiset<std::string> words =
    {
        "some", "words", "to", "count",
        "count", "these", "words"
    };
 
    for (auto it = words.begin(); it != words.end(); )
    {
        auto count = words.count(*it);
        std::cout << *it << ":\t" << count << '\n';
        std::advance(it, count); // all count elements have equivalent keys
    }
}

some:   1
words:  2
to:     1
count:  2
these:  1

See also