Przejdź do głównej zawartości

std::set end() method

// Non const version
iterator end() noexcept;

// Const version
iterator end() const noexcept;

// Const version
const_iterator cend() const noexcept;

Returns an iterator

to the element past-the-end of the array. If the set is empty, the returned iterator will be equal to begin().

Attempting to dereference a past-the-end iterator is undefined behaviour

.

Parameters

(none)

Return value

Iterator to the first element.

Exceptions

(none)

Complexity

Constant - O(1).

Difference between end and cend

For a const container c, end and cend are the same - c.end() == c.cend()

For non-const container of type c they return different iterators:

#include <set>

int main()
{
std::set<int> set = {1, 2, 3, 4, 5};
auto it = set.begin(); // Type: std::set<int>::iterator
*std::prev(it) = 5; // ✔ Ok
}

Example

Main.cpp
#include <algorithm>
#include <iostream>
#include <set>

int main() {
std::set<int> set = { 3, 1, 4, 1, 5, 9, 2, 6, 5 };
std::for_each(set.cbegin(), set.cend(), [](int x) {
std::cout << x << ' ';
});
std::cout << '\n';
}
Output
1 2 3 4 5 6 9
This article originates from this CppReference page. It was likely altered for improvements or editors' preference. Click "Edit this page" to see all changes made to this document.
Hover to see the original license.

std::set end() method

// Non const version
iterator end() noexcept;

// Const version
iterator end() const noexcept;

// Const version
const_iterator cend() const noexcept;

Returns an iterator

to the element past-the-end of the array. If the set is empty, the returned iterator will be equal to begin().

Attempting to dereference a past-the-end iterator is undefined behaviour

.

Parameters

(none)

Return value

Iterator to the first element.

Exceptions

(none)

Complexity

Constant - O(1).

Difference between end and cend

For a const container c, end and cend are the same - c.end() == c.cend()

For non-const container of type c they return different iterators:

#include <set>

int main()
{
std::set<int> set = {1, 2, 3, 4, 5};
auto it = set.begin(); // Type: std::set<int>::iterator
*std::prev(it) = 5; // ✔ Ok
}

Example

Main.cpp
#include <algorithm>
#include <iostream>
#include <set>

int main() {
std::set<int> set = { 3, 1, 4, 1, 5, 9, 2, 6, 5 };
std::for_each(set.cbegin(), set.cend(), [](int x) {
std::cout << x << ' ';
});
std::cout << '\n';
}
Output
1 2 3 4 5 6 9
This article originates from this CppReference page. It was likely altered for improvements or editors' preference. Click "Edit this page" to see all changes made to this document.
Hover to see the original license.