VOOZH about

URL: https://www.geeksforgeeks.org/cpp/unordered_multiset-bucket_count-function-in-c-stl/

⇱ unordered_multiset bucket_count() function in C++ STL - GeeksforGeeks


  • Courses
  • Tutorials
  • Interview Prep

unordered_multiset bucket_count() function in C++ STL

Last Updated : 2 Aug, 2018
The unordered_multiset::bucket_count() is a built-in function in C++ STL which returns the total number of buckets in the unordered_multiset container. A bucket is a slot in the container's internal hash table to which elements are assigned based on their hash value. Syntax:
unordered_multiset_name.bucket_count()
Parameters: The function does not accepts any parameter. Return Value: It returns an unsigned integral type which denotes the total count of buckets. Below programs illustrate the above function: Program 1:
Output:
The total count of buckets: 7
Bucket 0: b b b 
Bucket 1: empty
Bucket 2: empty
Bucket 3: z 
Bucket 4: empty
Bucket 5: empty
Bucket 6: a
Program 2:
Output:
The total count of buckets: 7
Bucket 0: b b b 
Bucket 1: empty
Bucket 2: empty
Bucket 3: z 
Bucket 4: empty
Bucket 5: empty
Bucket 6: a
Comment