在C++ STL中的unOrdEdTyBukKeSsie（）-yiteyi-C++库

UnOrdEdTySt::BukKeSsie（）函数是C++ STL中的内置函数，它返回在无序的集合容器中特定桶中存在的元素总数。这个水桶是无序_集的内部哈希表中存储元素的插槽。笔记：无序_集中的桶从0到n-1编号，其中n是桶的总数。语法 :

null

unordered_set.bucket_size(n);

参数：此函数接受单个参数 N 这是强制性的。此参数表示查找元素总数所需的存储桶编号。 返回值 ：此函数返回存储桶中存在的元素总数 N . 下面的程序演示了无序的_set:：bucket_size（）函数： 方案1 :

CPP

                         // CPP program to illustrate the                       
                         // unordered_set::bucket_size() function                       
                         #include <iostream>                       
                         #include <unordered_set>                       
                         using                                     namespace                                     std;                       
           
                         int                                     main()                       
                         {                       
           
                                                 unordered_set<                                     int                                     > sampleSet;                       
           
                                                 // to store number of buckets                       
                                                 int                                     bucketCount;                       
           
                                                 // Inserting elements                       
                                                 sampleSet.insert(5);                       
                                                 sampleSet.insert(10);                       
                                                 sampleSet.insert(15);                       
                                                 sampleSet.insert(20);                       
                                                 sampleSet.insert(25);                       
           
                                                 bucketCount = sampleSet.bucket_count();                       
                                                 // displaying number of buckets                       
                                                 cout <<                                     "sampleSet has "                                     << bucketCount <<                                     " buckets"                                     ;                       
           
                                                 // displaying number of elements in bucket numbered 1                       
                                                 cout <<                                     "Bucket number 3 contains "                       
                                                 << sampleSet.bucket_size(3) <<                                     " elements"                                     ;                       
           
                                                 return                                     0;                       
                         }                       

输出 :

sampleSet has 7 bucketsBucket number 3 contains 1 elements

方案2 :

CPP

                         // CPP program to illustrate the                       
                         // unordered_set::bucket_size() function                       
           
                         #include <iostream>                       
                         #include <unordered_set>                       
           
                         using                                     namespace                                     std;                       
           
                         int                                     main()                       
                         {                       
           
                                                 unordered_set<string> sampleSet;                       
           
                                                 // to store number of buckets                       
                                                 int                                     bucketCount;                       
           
                                                 // Inserting elements                       
                                                 sampleSet.insert(                                     "Welcome"                                     );                       
                                                 sampleSet.insert(                                     "To"                                     );                       
                                                 sampleSet.insert(                                     "GeeksforGeeks"                                     );                       
                                                 sampleSet.insert(                                     "Computer Science Portal"                                     );                       
                                                 sampleSet.insert(                                     "For Geeks"                                     );                       
           
                                                 bucketCount = sampleSet.bucket_count();                       
                                                 // displaying number of buckets                       
                                                 cout <<                                     "sampleSet has "                                     << bucketCount <<                                     " buckets"                                     ;                       
           
                                                 // displaying number of elements in bucket numbered 0                       
                                                 cout <<                                     "Bucket number 0 contains "                       
                                                 << sampleSet.bucket_size(0) <<                                     " elements"                                     ;                       
           
                                                 return                                     0;                       
                         }                       

输出 :

sampleSet has 7 bucketsBucket number 0 contains 0 elements

文章版权归作者所有，未经允许请勿转载。

THE END

技术文章