Unordered_multimap ::bucket_count() es una función integrada en C++ STL que devuelve el número total de cubos en el contenedor unordered_multimap. Un cubo es una ranura en la tabla hash interna del contenedor a la que se asignan elementos en función de su valor hash.
Sintaxis:
unordered_multimap_name.bucket_count()
Parámetros: La función no acepta ningún parámetro.
Valor devuelto: Devuelve un tipo integral sin signo que denota el recuento total de cubos.
Los siguientes programas ilustran la función anterior:
Programa 1:
// C++ program to illustrate the
// unordered_multimap::bucket_count()
#include <bits/stdc++.h>
using namespace std;
int main()
{
// declaration
unordered_multimap<int, int> sample;
// inserts key and element
sample.insert({ 10, 100 });
sample.insert({ 10, 100 });
sample.insert({ 20, 200 });
sample.insert({ 30, 300 });
sample.insert({ 15, 150 });
cout << "The total count of buckets: "
<< sample.bucket_count();
// prints all element bucket wise
for (int i = 0; i < sample.bucket_count(); i++) {
cout << "\nBucket " << i << ": ";
// if bucket is empty
if (sample.bucket_size(i) == 0)
cout << "empty";
for (auto it = sample.cbegin(i);
it != sample.cend(i); it++)
cout << "{" << it->first << ", "
<< it->second << "}, ";
}
return 0;
}
Producción:
The total count of buckets: 7
Bucket 0: empty
Bucket 1: {15, 150},
Bucket 2: {30, 300},
Bucket 3: {10, 100}, {10, 100},
Bucket 4: empty
Bucket 5: empty
Bucket 6: {20, 200},
Programa 2:
// C++ program to illustrate the
// unordered_multimap::bucket_count()
#include <bits/stdc++.h>
using namespace std;
int main()
{
// declaration
unordered_multimap<char, char> sample;
// inserts key and element
sample.insert({ 'a', 'b' });
sample.insert({ 'a', 'b' });
sample.insert({ 'b', 'c' });
sample.insert({ 'r', 'a' });
sample.insert({ 'c', 'b' });
cout << "The total count of buckets: "
<< sample.bucket_count();
// prints all element bucket wise
for (int i = 0; i < sample.bucket_count(); i++) {
cout << "\nBucket " << i << ": ";
// if bucket is empty
if (sample.bucket_size(i) == 0)
cout << "empty";
for (auto it = sample.cbegin(i);
it != sample.cend(i); it++)
cout << "{" << it->first << ", "
<< it->second << "}, ";
}
return 0;
}
Producción:
The total count of buckets: 7
Bucket 0: {b, c},
Bucket 1: {c, b},
Bucket 2: {r, a},
Bucket 3: empty
Bucket 4: empty
Bucket 5: empty
Bucket 6: {a, b}, {a, b},