名稱空間
變體
操作

std::multimap<Key,T,Compare,Allocator>::find

來自 cppreference.com
< cpp‎ | 容器‎ | multimap
 
 
 
 
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 比較等價的元素。此過載僅在限定 ID Compare::is_transparent 有效且表示一個型別時才參與過載決議。它允許不構造 Key 的例項而呼叫此函式。

目錄

[編輯] 引數

key - 要搜尋的元素的鍵值
x - 可與鍵透明比較的任何型別的值

[編輯] 返回值

指向所請求元素的迭代器。若找不到此類元素,則返回尾後(見 end())迭代器。

[編輯] 複雜度

容器大小的對數級別。

注意

特性測試 標準 特性
__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

[編輯] 參閱

返回匹配特定鍵的元素數量
(public 成員函式) [編輯]
返回與特定鍵匹配的元素範圍
(public 成員函式) [編輯]