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

Showing content from https://cplusplus.com/unordered_multimap::load_factor below:

public member function

<unordered_map>

float load_factor() const noexcept;

Return load factor

The load factor is the ratio between the number of elements in the container (its size) and the number of buckets (bucket_count):

load_factor = size / bucket_count

The load factor influences the probability of collision in the hash table (i.e., the probability of two elements being located in the same bucket). 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 an expansion is needed.

To retrieve or change this threshold, use member function max_load_factor.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

// unordered_multimap hash table stats
#include <iostream>
#include <unordered_map>

int main ()
{
  std::unordered_multimap<int,int> mymap;

  std::cout << "size = " << mymap.size() << std::endl;
  std::cout << "bucket_count = " << mymap.bucket_count() << std::endl;
  std::cout << "load_factor = " << mymap.load_factor() << std::endl;
  std::cout << "max_load_factor = " << mymap.max_load_factor() << std::endl;

  return 0;
}

size = 0
bucket_count = 11
load_factor = 0
max_load_factor = 1

unordered_multimap::max_load_factor

Get or set maximum load factor (public member function)

unordered_multimap::bucket_size

Return bucket_size (public member type)

unordered_multimap::bucket_count

Return number of buckets (public member function)

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