C++ Standard Library C++ STL Library

C++ unordered_set - load_factor() Function

The C++ unordered_set::load_factor function returns current load_factor of the unordered_set. The load_factor is defined as ratio of number of elements (its size) in the container and number of buckets in the container (its bucket_count).

load_factor = size / bucket_count

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.


float load_factor() const noexcept;


No parameter is required.

Return Value

The current load factor of the unordered_set.

Time Complexity

Constant i.e, Θ(1).


In the example below, the unordered_set::load_factor function is used to find out the current load_factor 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<<"Size = "<<uSet.size()<<"\n";
  cout<<"Bucket count = "<<uSet.bucket_count()<<"\n";
  cout<<"load factor = "<<uSet.load_factor()<<"\n";  
  cout<<"Max load factor = "<<uSet.max_load_factor()<<"\n";

  return 0;

The output of the above code will be:

Size = 9
Bucket count = 11
load factor = 0.818182
Max load factor = 1

❮ C++ <unordered_set> Library