The C++ function std::map::end() returns an iterator which points to past-the-end element in the map.
The past-the-end element is the theoretical element that would follow the last element in the map.
DeclarationFollowing is the declaration for std::map::end() function form std::map header.
C++98iterator end(); const_iterator end() const;C++11
iterator end() noexcept; const_iterator end() const noexcept;Parameters
None
Return valueIf object is constant qualified then method returns constant iterator otherwise non-constant iterator.
ExceptionsThis member function never throws exception.
Time complexityConstant i.e. O(1)
ExampleThe following example shows the usage of std::map::end() function.
#include <iostream> #include <map> using namespace std; int main(void) { /* Initializer_list constructor */ map<char, int> m = { {'a', 1}, {'b', 2}, {'c', 3}, {'d', 4}, {'e', 5}, }; cout << "Map contains following elements" << endl; for (auto it = m.begin(); it != m.end(); ++it) cout << it->first << " = " << it->second << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Map contains following elements a = 1 b = 2 c = 3 d = 4 e = 5
map.htm
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