multiset::upper_bound

傳回 Iterator 至多重集的第一個項目將與指定的索引鍵大於的金鑰。

const_iterator upper_bound(
   const Key& _Key
) const;
iterator upper_bound(
   const Key& _Key
);

參數

• _Key
  引數的索引鍵使用一個項目來排序鍵比較從多重集 (Multiset) 的搜尋。

傳回值

處理一個項目位置在多重集具有索引鍵的引數索引鍵大於的 iterator 或 const_iterator 或解決成功最後一個項目的位置在多重集，如果符合沒有索引鍵中找到。

範例

// multiset_upper_bound.cpp
// compile with: /EHsc
#include <set>
#include <iostream>

int main( )
{
   using namespace std;   
   multiset <int> ms1;
   multiset <int> :: const_iterator ms1_AcIter, ms1_RcIter;
   
   ms1.insert( 10 );
   ms1.insert( 20 );
   ms1.insert( 30 );

   ms1_RcIter = ms1.upper_bound( 20 );
   cout << "The first element of multiset ms1 with a key greater "
           << "than 20 is: " << *ms1_RcIter << "." << endl;

   ms1_RcIter = ms1.upper_bound( 30 );

   // If no match is found for the key, end( ) is returned
   if ( ms1_RcIter == ms1.end( ) )
      cout << "The multiset ms1 doesn't have an element "
              << "with a key greater than 30." << endl;
   else
      cout << "The element of multiset ms1 with a key > 40 is: "
           << *ms1_RcIter << "." << endl;

   // The element at a specific location in the multiset can be 
   // found using a dereferenced iterator addressing the location
   ms1_AcIter = ms1.begin( );
   ms1_RcIter = ms1.upper_bound( *ms1_AcIter );
   cout << "The first element of ms1 with a key greater than"
        << endl << "that of the initial element of ms1 is: "
        << *ms1_RcIter << "." << endl;
}

需求

標題: <set>

命名空間: std

請參閱

參考

multiset Class

標準樣板程式庫