std::unordered_map::find
构成:
iterator find(const Key& key); (1)
const_iterator find(const Key& key) const; (2)
1.2) Finds an element with key equivalent to key.
即在一个map中,按照键(key)的值寻找对应的值(value),返回一个iterator类型。示例:
#include <iostream>
#include <unordered_map>
int main()
{
std::unordered_map<int,char> example = {{1,'a'},{2,'b'}};
auto search = example.find(2);
if(search != example.end()) {
std::cout << "Found " << search->first << " " << search->second << '\n';
}
else {
std::cout << "Not found\n";
}
}
若存在的话,则可以按照.first和.second获得相关信息.不存在的话,则等同于遇到了.end()
参考:http://en.cppreference.com/w/cpp/container/unordered_map/find