Namespaces
Variants
Views
Actions

std::multiset<Key,Compare,Allocator>::end, std::multiset<Key,Compare,Allocator>::cend

From cppreference.com
< cpp‎ | container‎ | multiset
 
 
Containers library
Sequence
(C++11)
Associative
Unordered associative
Adaptors
Views
(C++20)
 
 
iterator end();
(until C++11)
iterator end() noexcept;
(since C++11)
const_iterator end() const;
(until C++11)
const_iterator end() const noexcept;
(since C++11)
const_iterator cend() const noexcept;
(since C++11)

Returns an iterator to the element following the last element of the multiset.

This element acts as a placeholder; attempting to access it results in undefined behavior.

range-begin-end.svg

Contents

[edit] Parameters

(none)

[edit] Return value

Iterator to the element following the last element.

[edit] Complexity

Constant.

[edit] 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 <set>
#include <string>
 
int main()
{
    const std::multiset<std::string> words = {
        "some", "not", "sorted", "words",
        "will", "come", "out", "sorted",
    };
 
    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
    }
}

Output:

come:	1
not:	1
out:	1
some:	1
sorted:	2
will:	1
words:	1

[edit] See also

returns an iterator to the beginning
(public member function) [edit]