C++ unordered_set - bucket_size() Function

The C++ unordered_set::bucket_size function returns the number of elements in the specified bucket of the unordered_set.

As an unordered_set is implemented using hash table where a bucket is a slot in the container's internal hash table to which elements are assigned based on the hash value. The number of buckets directly influences the load_factor of the container's hash table. The container automatically increases the number of buckets to keep the load_factor below its max_load_factor which causes rehash whenever the number of buckets is increased.

Syntax

• C++11

size_type bucket_size ( size_type n ) const;

Parameters

Return Value

Number of elements in the bucket number n of the unordered_set.

Time Complexity

Linear i.e, Θ(n).

Example:

In the example below, the unordered_set::bucket_size function returns the number of elements in the specified bucket of uSet.

#include <iostream>
#include <unordered_set>
using namespace std;
 
int main (){
  unordered_set<int> uSet{55, 25, 128, 5, 72, -500, 45, 24, -20};

  cout<<"uSet contains "<<uSet.bucket_count()<<" buckets:";

  for(unsigned int i = 0; i < uSet.bucket_count(); i++)
    cout<<"\nBucket #"<<i<<" contains: "<<uSet.bucket_size(i)<<" elements.";   

  return 0;
}

The output of the above code will be:

uSet contains 11 buckets:
Bucket #0 contains: 2 elements.
Bucket #1 contains: 1 elements.
Bucket #2 contains: 1 elements.
Bucket #3 contains: 1 elements.
Bucket #4 contains: 0 elements.
Bucket #5 contains: 1 elements.
Bucket #6 contains: 1 elements.
Bucket #7 contains: 2 elements.
Bucket #8 contains: 0 elements.
Bucket #9 contains: 0 elements.
Bucket #10 contains: 0 elements.