C++ unordered_set::bucket_size() 函数

C++ 的 unordered_set::bucket_size() 函数用于返回第 n 个桶中存在的元素数量。桶是 unordered_set 容器内部哈希表中的一个槽，元素根据哈希值分配到该槽中。桶的编号范围从 0 到 (bucket_count - 1)。

语法

以下是 std::unordered_set::bucket_size() 函数的语法。

size_type bucket_size ( size_type n ) const;

参数

• n − 它表示桶的编号，必须小于 bucket_count。

返回值

此函数返回桶中元素的数量。

示例 1

让我们看下面的例子，我们将演示 unordered_set::bucket_size() 函数的使用。

#include <iostream>
#include <string>
#include <unordered_set>

int main () {
   std::unordered_set<std::string> myUset = { "sai", "ram", "krishna", "prasad", "tutorials", "point" };
   unsigned nbuckets = myUset.bucket_count();

   std::cout << "myset has " << nbuckets << " buckets:\n";
   for (unsigned i = 0; i < nbuckets; ++i) {
      std::cout << "bucket #" << i << " has " << myUset.bucket_size(i) << " elements.\n";
   }
   return 0;
}

输出

如果我们运行上面的代码，它将生成以下输出：

myset has 13 buckets:
bucket #0 has 0 elements.
bucket #1 has 0 elements.
bucket #2 has 0 elements.
bucket #3 has 1 elements.
bucket #4 has 0 elements.
bucket #5 has 1 elements.
bucket #6 has 0 elements.
bucket #7 has 0 elements.
bucket #8 has 1 elements.
bucket #9 has 2 elements.
bucket #10 has 0 elements.
bucket #11 has 1 elements.
bucket #12 has 0 elements.

示例 2

考虑下面的例子，我们将查找指定桶包含的元素数量。

#include <iostream>
#include <string>
#include <unordered_set>
using namespace std;

int main () {
   unordered_set<string> myUset = { "sai", "ram", "krishna", "prasad", "tutorials", "point" };
   unsigned nbuckets = myUset.bucket_count();

   cout << "myUset has " << nbuckets << " buckets:\n";
   cout<<"bucket 5 contains: "<<myUset.bucket_size(5);
   return 0;
}

输出

以下是上面代码的输出：

myUset has 13 buckets:
bucket 5 contains: 1

示例 3

在下面的示例中，我们将考虑字符串类型的 unordered_set 并应用 bucket_size() 函数来计算每个桶中元素的数量并显示它们。

#include <iostream>
#include <string>
#include <unordered_set>
using namespace std;

int main () {
   unordered_set<string> uSet = { "red", "green", "blue", "yellow", "purple", "pink" };

   unsigned nbuckets = uSet.bucket_count();

   cout << "uSet has " << nbuckets << " buckets:\n";

   for (unsigned i=0; i<nbuckets; ++i) {
      cout << "bucket #" << i << " has " << uSet.bucket_size(i) << " elements: ";
      for (auto it = uSet.begin(i); it!=uSet.end(i); ++it)
         cout << "[" << *it<< "] ";
      cout << "\n";
   }

   return 0;
}

输出

上面代码的输出如下：

uSet has 13 buckets:
bucket #0 has 2 elements: [purple] [red] 
bucket #1 has 0 elements: 
bucket #2 has 1 elements: [blue] 
bucket #3 has 1 elements: [green] 
bucket #4 has 0 elements: 
bucket #5 has 0 elements: 
bucket #6 has 1 elements: [yellow] 
bucket #7 has 0 elements: 
bucket #8 has 0 elements: 
bucket #9 has 0 elements: 
bucket #10 has 1 elements: [pink] 
bucket #11 has 0 elements: 
bucket #12 has 0 elements: