public member function
<unordered_set>
std::unordered_set::bucket_countsize_type bucket_count() const noexcept;
Return number of buckets
Returns the number of buckets in the unordered_set 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.
Member type size_type is an unsigned integral type.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
// unordered_set::bucket_count
#include <iostream>
#include <string>
#include <unordered_set>
int main ()
{
std::unordered_set<std::string> myset =
{"Mercury","Venus","Earth","Mars","Jupiter","Saturn","Uranus","Neptune"};
unsigned n = myset.bucket_count();
std::cout << "myset has " << n << " buckets.\n";
for (unsigned i=0; i<n; ++i) {
std::cout << "bucket #" << i << " contains:";
for (auto it = myset.begin(i); it!=myset.end(i); ++it)
std::cout << " " << *it;
std::cout << "\n";
}
return 0;
}
myset has 11 buckets. bucket #0 contains: bucket #1 contains: Venus bucket #2 contains: Jupiter bucket #3 contains: bucket #4 contains: Neptune Mercury bucket #5 contains: bucket #6 contains: Earth bucket #7 contains: Uranus Saturn bucket #8 contains: Mars bucket #9 contains: bucket #10 contains:
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