iterator end() noexcept;
(1) (since C++11)const_iterator end() const noexcept;
(2) (since C++11)const_iterator cend() const noexcept;
(3) (since C++11)Returns an iterator past the last element of *this.
This returned iterator only acts as a sentinel. It is not guaranteed to be dereferenceable.
[edit] Return valueIterator past the last element.
[edit] ComplexityConstant.
[edit] Example#include <algorithm> #include <cassert> #include <iostream> #include <string> #include <utility> #include <unordered_map> int main() { auto show_node = [](const std::pair<std::string, std::string>& node) { std::cout << node.first << " : " << node.second << '\n'; }; std::unordered_multimap<std::string, std::string> lemmas; assert(lemmas.begin() == lemmas.end()); assert(lemmas.cbegin() == lemmas.cend()); lemmas.insert({ "1. âx â N ây â N", "x ⤠y" }); show_node(*lemmas.cbegin()); assert(lemmas.begin() != lemmas.end()); assert(lemmas.cbegin() != lemmas.cend()); lemmas.begin()->second = "x < y"; show_node(*lemmas.cbegin()); lemmas.insert({ "2. âx, y â N ", "x = y V x â y" }); show_node(*lemmas.cbegin()); lemmas.insert({ "3. âx â N ây â N", "y = x + 1" }); show_node(*lemmas.cbegin()); std::cout << "Lemmas: \n"; std::for_each(lemmas.cbegin(), lemmas.cend(), [&](const auto& n) { show_node(n); }); std::cout << '\n'; }
Possible output:
1. âx â N ây â N : x ⤠y 1. âx â N ây â N : x < y 2. âx, y â N : x = y V x â y 3. âx â N ây â N : y = x + 1 Lemmas: 3. âx â N ây â N : y = x + 1 1. âx â N ây â N : x < y 2. âx, y â N : x = y V x â y[edit] See also returns an iterator to the beginning
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4