std::unordered_multiset::begin, std::unordered_multiset::cbegin
From cppreference.com
< cpp | container | unordered multiset
iterator begin();
|
(since C++11) | |
const_iterator begin() const;
|
(since C++11) | |
const_iterator cbegin() const;
|
(since C++11) | |
Returns an iterator to the first element of the container.
If the container is empty, the returned iterator will be equal to end().
Contents |
[edit] Parameters
(none)
[edit] Return value
Iterator to the first element
[edit] Exceptions
noexcept specification:
noexcept
[edit] Complexity
Constant
[edit] Example
Run this code
#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 cnt = words.count(*it); std::cout << *it << ":\t" << cnt << '\n'; std::advance(it, cnt); // all cnt elements have equivalent keys } }
Possible output:
some: 1 words: 2 to: 1 count: 2 these: 1
[edit] See also
returns an iterator to the end (public member function) |