
- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ Unordered_map Library - end() Function
Description
The C++ function std::unordered_map::end() returns an iterator which points to past-the-end element in one of its buckets.
Declaration
Following is the declaration for std::unordered_map::end() function form std::unordered_map header.
C++11
local_iterator end(size_type n); const_local_iterator end(size_type n) const;
Parameters
n − Bucket number
Return value
If object is constant qualified then method returns constant iterator otherwise it returns non-constant reference.
Time complexity
Constant i.e. O(1)
Example
The following example shows the usage of std::unordered_map::end() function.
#include <iostream> #include <unordered_map> using namespace std; int main(void) { unordered_map<char, int> um = { {'a', 1}, {'b', 2}, {'c', 3}, {'d', 4}, {'e', 5} }; for (int i = 0; i < um.bucket_count(); ++i) { cout << "Bucket " << i << " contains:" << endl; for (auto it = um.begin(i); it != um.end(i); ++it) cout << it->first << " = " << it->second << endl; } return 0; }
Let us compile and run the above program, this will produce the following result −
Bucket 0 contains: c = 3 Bucket 1 contains: d = 4 Bucket 2 contains: e = 5 Bucket 3 contains: Bucket 4 contains: Bucket 5 contains: Bucket 6 contains: Bucket 7 contains: Bucket 8 contains: Bucket 9 contains: a = 1 Bucket 10 contains: b = 2
unordered_map.htm
Advertisements