unordered_multiset max_bucket_count() function in C++ STL
The unordered_multiset::max_bucket_count() is a built-in function in C++ STL which returns the maximum number of buckets that the unordered multiset container can have. This is the maximum it can have, it cannot exceed despite the collisions due to certain limitations on it.
Syntax:
unordered_multiset_name.max_bucket_count()
Parameter: The function does not accepts anything.
Return Value: The function returns the maximum number of buckets possible.
Below programs illustrate the unordered_multiset::maximum_bucket_count() function:
Program 1:
// C++ program to illustrate the// unordered_multiset::maximum_bucket_count() function#include <bits/stdc++.h>using namespace std; int main(){ // declaration unordered_multiset<char> sample; // inserts element sample.insert('a'); sample.insert('b'); sample.insert('b'); sample.insert('b'); sample.insert('z'); cout << "The maximum bucket count is: " << sample.max_bucket_count(); return 0;} |
Output:
The maximum bucket count is: 1152921504606846975
Program 2:
// C++ program to illustrate the// unordered_multiset::maximum_bucket_count() function#include <bits/stdc++.h>using namespace std; int main(){ // declaration unordered_multiset<int> sample; // inserts element sample.insert(1); sample.insert(2); sample.insert(2); sample.insert(4); sample.insert(4); cout << "The maximum bucket count is: " << sample.max_bucket_count(); return 0;} |
Output:
The maximum bucket count is: 1152921504606846975
Want to learn from the best curated videos and practice problems, check out the C++ Foundation Course for Basic to Advanced C++ and C++ STL Course for foundation plus STL. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.
