Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_unordered_map_begin_container.htm below:

C++ Unordered Map Begin Function

The C++ function std::unordered_map::begin() returns an iterator which refers to the first element of the map.

Following is the declaration for std::unordered_map::begin() function form std::unordered_map header.

iterator begin() noexcept;
const_iterator begin() const noexcept;

None

If object is constant qualified then method returns constant iterator otherwise it returns non-constant reference.

This member function never throws exception.

Constant i.e. O(1)

The following example shows the usage of std::unordered_map::begin() 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}
            };

   cout << "Unordered map contains following elements: " << endl;

   for (auto it = um.begin(); it != um.end(); ++it)
      cout << it->first << " = " << it->second << endl;

   return 0;
}

Let us compile and run the above program, this will produce the following result −

Unordered map contains following elements: 
e = 5
a = 1
b = 2
c = 3
d = 4

unordered_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