unordered_multimap :: bucket_size()是C++ STL中的内置函数,该函数返回存储区n中的元素数。
句法:
unordered_multimap_name.bucket_size(n)
参数:该函数接受参数n ,该参数指定要返回其计数的存储区编号。
返回值:返回一个无符号整数类型,该整数类型表示存储桶中n为存储桶的元素数。
下面的程序说明了上述函数:
程序1:
// C++ program to illustrate the
// unordered_multimap::bucket_size()
#include
using namespace std;
int main()
{
// declaration
unordered_multimap sample;
// inserts 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 << "\nNumber of elements in Bucket " << i
<< " = " << sample.bucket_size(i);
}
return 0;
}
输出:
The total count of buckets: 7
Number of elements in Bucket 0 = 0
Number of elements in Bucket 1 = 1
Number of elements in Bucket 2 = 1
Number of elements in Bucket 3 = 2
Number of elements in Bucket 4 = 0
Number of elements in Bucket 5 = 0
Number of elements in Bucket 6 = 1
程式2:
// C++ program to illustrate the
// unordered_multimap::bucket_size()
#include
using namespace std;
int main()
{
// declaration
unordered_multimap sample;
// inserts 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 << "\nNumber of elements in Bucket " << i
<< " = " << sample.bucket_size(i);
}
return 0;
}
输出:
The total count of buckets: 7
Number of elements in Bucket 0 = 1
Number of elements in Bucket 1 = 1
Number of elements in Bucket 2 = 1
Number of elements in Bucket 3 = 0
Number of elements in Bucket 4 = 0
Number of elements in Bucket 5 = 0
Number of elements in Bucket 6 = 2
要从最佳影片策划和实践问题去学习,检查了C++基础课程为基础,以先进的C++和C++ STL课程基础加上STL。要完成从学习语言到DS Algo等的更多准备工作,请参阅“完整面试准备课程” 。