hash_map::upper_bound
注意事項 |
---|
這個 API 已經過時。這個選項是 unordered_map Class。 |
傳回 Iterator 置於該索引鍵值大於特定索引鍵 hash_map 的第一個項目。
iterator upper_bound(
const Key& _Key
);
const_iterator upper_bound(
const Key& _Key
) const;
參數
- _Key
引數索引鍵值與項目比較的排序鍵值從被搜尋的 hash_map 的。
傳回值
處理一個項目位置 hash_map 與索引鍵比引數索引鍵的 iterator 大於或 const_iterator 或解決成功最後一個項目位置, hash_map If-Match 沒有為索引鍵中找到。
如果的傳回值指派給 const_iterator,無法修改 hash_map 物件。如果的傳回值指派給 iterator,可以修改 hash_map 物件。
備註
在 Visual C++ .NET Pocket PC, <hash_map> 和 <hash_set> 標頭檔 (Header File) 的成員不在 std 命名空間,,而是移至 stdext 命名空間。如需詳細資訊,請參閱 stdext 命名空間。
範例
// hash_map_upper_bound.cpp
// compile with: /EHsc
#include <hash_map>
#include <iostream>
int main( )
{
using namespace std;
using namespace stdext;
hash_map <int, int> hm1;
hash_map <int, int> :: const_iterator hm1_AcIter, hm1_RcIter;
typedef pair <int, int> Int_Pair;
hm1.insert ( Int_Pair ( 1, 10 ) );
hm1.insert ( Int_Pair ( 2, 20 ) );
hm1.insert ( Int_Pair ( 3, 30 ) );
hm1_RcIter = hm1.upper_bound( 2 );
cout << "The first element of hash_map hm1 with a key "
<< "greater than 2 is: "
<< hm1_RcIter -> second << "." << endl;
// If no match is found for the key, end is returned
hm1_RcIter = hm1. upper_bound ( 4 );
if ( hm1_RcIter == hm1.end( ) )
cout << "The hash_map hm1 doesn't have an element "
<< "with a key greater than 4." << endl;
else
cout << "The element of hash_map hm1 with a key > 4 is: "
<< hm1_RcIter -> second << "." << endl;
// The element at a specific location in the hash_map can be found
// using a dereferenced iterator addressing the location
hm1_AcIter = hm1.begin( );
hm1_RcIter = hm1. upper_bound ( hm1_AcIter -> first );
cout << "The 1st element of hm1 with a key greater than "
<< "that\n of the initial element of hm1 is: "
<< hm1_RcIter -> second << "." << endl;
}
需求
標題: <hash_map>
命名空間: stdext