A RetroSearch Logo

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

Search Query:

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

C++ Unordered Multimap Copy Constructor

C++ Unordered_multimap Library - unordered_multimap() Function Description

The C++ function std::unordered_multimap::unordered_multimap() constructs an unordered_multimap with copy of each elements present in existing unordered_multimap.

Declaration

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

C++11
unordered_multimap (const unordered_multimap& umm);
Parameters

umm − Another unordered_multimap object.

Return value

Constructor never returns value.

Time complexity

Linear i.e. O(n) in average case.

Quadratic i.e. O(n2) in worst case.

Example

The following example shows the usage of std::unordered_multimap::unordered_multimap() function.

#include <iostream>
#include <unordered_map>

using namespace std;

int main(void) {
   unordered_multimap<char, int> umm1 = {
            {'a', 1},
            {'b', 2},
            {'c', 3},
            {'d', 4},
            {'e', 5}
            };
   unordered_multimap<char, int> umm2(umm1);

   cout << "Unordered multimap contains following elements" << endl;

   for (auto it = umm2.begin(); it != umm2.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 multimap 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