C++ unordered_map - load_factor() Function

The C++ unordered_map::load_factor function returns current load_factor of the unordered_map. 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_map 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

float load_factor() const noexcept;

Parameters

No parameter is required.

Return Value

The current load factor of the unordered_map.

Time Complexity

Constant i.e, Θ(1).

Example:

In the example below, the unordered_map::load_factor function is used to find out the current load_factor of uMap.

#include <iostream>
#include <unordered_map>
using namespace std;
 
int main (){
  unordered_map<string, string> uMap;
  uMap = {{"CAN", "Ottawa"}, {"USA", "Washington"}, {"IND", "Delhi"}};

  cout<<"Size = "<<uMap.size()<<"\n";
  cout<<"Bucket count = "<<uMap.bucket_count()<<"\n";
  cout<<"load factor = "<<uMap.load_factor()<<"\n";  
  cout<<"Max load factor = "<<uMap.max_load_factor()<<"\n";

  return 0;
}

The output of the above code will be:

Size = 3
Bucket count = 13
load factor = 0.230769
Max load factor = 1