public member function
<unordered_set>

std::unordered_multiset::bucket_count

size_type bucket_count() const noexcept;
Return number of buckets
Returns the number of buckets in the unordered_multiset container.

A bucket is a slot in the container's internal hash table to which elements are assigned based on their hash value.

The number of buckets influences directly the load factor of the container's hash table (and thus the probability of collision). The container automatically increases the number of buckets to keep the load factor below a specific threshold (its max_load_factor), causing a rehash each time the number of buckets needs to be increased.

Parameters

none

Return Value

The current amount of buckets.

Member type size_type is an unsigned integral type.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
 
// unordered_multiset::bucket_count
#include <iostream>
#include <string>
#include <unordered_set>

int main ()
{
  std::unordered_multiset<std::string> myums =
  {"Klingon","Vulcan","Klingon","Cardassian","Vulcan","Human"};

  unsigned n = myums.bucket_count();

  std::cout << "myums has " << n << " buckets.\n";

  for (unsigned i=0; i<n; ++i) {
    std::cout << "bucket #" << i << " contains:";
    for (auto it = myums.begin(i); it!=myums.end(i); ++it)
      std::cout << " " << *it;
    std::cout << "\n";
  }

  return 0;
}


Possible output:
myums has 7 buckets.
bucket #0 contains: Vulcan Vulcan
bucket #1 contains: 
bucket #2 contains: 
bucket #3 contains: Cardassian
bucket #4 contains: 
bucket #5 contains: Human Klingon Klingon
bucket #6 contains:

Complexity

Constant.

Iterator validity

No changes.

See also

unordered_multiset::bucket
Locate element's bucket (public member function)
unordered_multiset::bucket_size
Return bucket size (public member type )
unordered_multiset::load_factor
Return load factor (public member function)
unordered_multiset::max_bucket_count
Return maximum number of buckets (public member function)

C++