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

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

C++ Unordered_multimap Library - unordered_multimap() Function

The C++ function std::unordered_multimap::cend() returns a constant iterator which points to past-the-end element in one of its buckets.

Iterator obtained by this member function can be used to iterate container but cannot be used to modify the content of object to which it is pointing even if object itself is not constant.

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

const_local_iterator cend(size_type n) const;

n − Bucket number.

Returns a constant iterator.

Constant i.e. O(1)

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

#include <iostream>
#include <unordered_map>

using namespace std;

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

   for (int i = 0; i < umm.bucket_count(); ++i) {
      cout << "Bucket " << i << " contains:" << endl;

      for (auto it = umm.cbegin(i); it != umm.cend(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

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