std::multimap<Key,T,Compare,Allocator>::find
来自 cppreference.com
iterator find( const Key& key ); |
(1) | |
const_iterator find( const Key& key ) const; |
(2) | |
template< class K > iterator find( const K& x ); |
(3) | (自 C++14 起) |
template< class K > const_iterator find( const K& x ) const; |
(4) | (自 C++14 起) |
1,2) 查找键等效于 key 的元素。如果容器中有多个具有请求键的元素,则可以返回其中的任何一个。
3,4) 查找键与值 x 相比等效的元素。仅当限定标识符 Compare::is_transparent 有效并表示类型时,此重载才参与重载解析。它允许在不构造
Key
实例的情况下调用此函数。内容 |
[编辑] 参数
key | - | 要搜索的元素的键值 |
x | - | 任何可以与键透明比较的类型的值 |
[编辑] 返回值
指向请求元素的迭代器。如果未找到此类元素,则返回尾后(请参阅 end())迭代器。
[编辑] 复杂度
容器大小的对数。
备注
特性测试 宏 | 值 | Std | 特性 |
---|---|---|---|
__cpp_lib_generic_associative_lookup |
201304L | (C++14) | 在 关联容器 中的异构比较查找;重载 (3,4) |
[编辑] 示例
运行此代码
#include <iostream> #include <map> struct LightKey { int x; }; struct FatKey { int x; int data[1000]; // a heavy blob }; // As detailed above, the container must use std::less<> (or other transparent // Comparator) to access these overloads. This includes standard overloads, // such as comparison between std::string and std::string_view. bool operator<(const FatKey& fk, const LightKey& lk) { return fk.x < lk.x; } bool operator<(const LightKey& lk, const FatKey& fk) { return lk.x < fk.x; } bool operator<(const FatKey& fk1, const FatKey& fk2) { return fk1.x < fk2.x; } int main() { // Simple comparison demo. std::multimap<int, char> example{{1, 'a'}, {2, 'b'}}; if (auto search = example.find(2); search != example.end()) std::cout << "Found " << search->first << ' ' << search->second << '\n'; else std::cout << "Not found\n"; // Transparent comparison demo. std::multimap<FatKey, char, std::less<>> example2{{{1, {}}, 'a'}, {{2, {}}, 'b'}}; LightKey lk = {2}; if (auto search = example2.find(lk); search != example2.end()) std::cout << "Found " << search->first.x << ' ' << search->second << '\n'; else std::cout << "Not found\n"; // Obtaining const iterators. // Compiler decides whether to return iterator of (non) const type by way of // accessing map; to prevent intentional modification, one of the simplest // options is to access the map via a constant reference. const auto& example2ref = example2; if (auto search = example2ref.find(lk); search != example2.end()) { std::cout << "Found " << search->first.x << ' ' << search->second << '\n'; // search->second = 'c'; // error: assignment of member // 'std::pair<const FatKey, char>::second' // in read-only object } }
输出
Found 2 b Found 2 b Found 2 b
[编辑] 另请参阅
返回与特定键匹配的元素数量 (公共成员函数) | |
返回与特定键匹配的元素范围 (公共成员函数) |