std::multiset<Key,Compare,Allocator>::begin,std::multiset<Key,Compare,Allocator>::cbegin
From cppreference.com
C++
Containers library
(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::multiset
| Member functions | |||||||
| Non-member functions | |||||||
| |||||||
| Deduction guides(C++17) | |||||||
iterator begin(); | (1) | (noexcept since C++11) (constexpr since C++26) |
const_iterator begin()const; | (2) | (noexcept since C++11) (constexpr since C++26) |
const_iterator cbegin()constnoexcept; | (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 toend().
Contents |
[edit]Return value
Iterator to the first element.
[edit]Complexity
Constant.
Notes
Because bothiterator andconst_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.
libc++ backportscbegin() to C++98 mode.
[edit]Example
Run this code
#include <iostream>#include <iterator>#include <set>#include <string> int main(){conststd::multiset<std::string> words={"some","not","sorted","words","will","come","out","sorted",}; 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}}
Output:
come:1not:1out:1some:1sorted:2will:1words:1
[edit]See also
(C++11) | returns an iterator to the end (public member function)[edit] |
(C++11)(C++14) | returns an iterator to the beginning of a container or array (function template)[edit] |
