std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::begin, std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::cbegin
iterator begin() noexcept; |
(1) | (since C++11) (constexpr since C++26) |
const_iterator begin() const noexcept; |
(2) | (since C++11) (constexpr since C++26) |
const_iterator cbegin() const noexcept; |
(3) | (since C++11) (constexpr since C++26) |
Returns an iterator to the first element of *this.
If *this is empty, the returned iterator will be equal to end().
Contents |
[edit] Return value
Iterator to the first element.
[edit] 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.
[edit] 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 } }
Possible output:
some: 1 words: 2 to: 1 count: 2 these: 1
[edit] See also
| returns an iterator to the end (public member function) | |
| (C++11)(C++14) |
returns an iterator to the beginning of a container or array (function template) |

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
