unordered_map::bucket
时间: 2023-11-24 07:51:08 浏览: 35
`unordered_map::bucket`是一个函数,它返回一个指向存储桶中第一个元素的迭代器,该存储桶由给定键的哈希值确定。如果没有元素与给定键的哈希值匹配,则返回指向存储桶末尾的迭代器。以下是一个使用`unordered_map::bucket`函数的例子:
```c++
#include <iostream>
#include <unordered_map>
#include <string>
int main() {
std::unordered_map<std::string, int> mymap = {
{"apple", 1},
{"banana", 2},
{"orange", 3}
};
// 获取键"apple"所在的桶
size_t bucket = mymap.bucket("apple");
// 输出桶中的所有元素
std::cout << "bucket #" << bucket << " contains:";
for (auto it = mymap.begin(bucket); it != mymap.end(bucket); ++it) {
std::cout << " [" << it->first << ":" << it->second << "]";
}
std::cout << std::endl;
return 0;
}
```
输出:
```
bucket #1 contains: [apple:1]
```