set::upper_bound

發行項
06/09/2015

傳回 Iterator 置於與索引鍵大於指定的索引鍵之集合中的第一個項目。

const_iterator upper_bound( 
   const Key& _Key 
) const; 

iterator upper_bound( 
   const Key& _Key 
);

參數

_Key
引數索引鍵與項目的排序鍵會比較搜尋的集合中。

傳回值

處理一個項目在集合中的插入位置與索引鍵大於引數金鑰，或是處理成功最後一個項目的位置。這個集合的 iterator 則為 const_iterator ，如果遊戲不為索引鍵中找到。

範例

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

int main( )
{
   using namespace std;   
   set <int> s1;
   set <int> :: const_iterator s1_AcIter, s1_RcIter;
   
   s1.insert( 10 );
   s1.insert( 20 );
   s1.insert( 30 );

   s1_RcIter = s1.upper_bound( 20 );
   cout << "The first element of set s1 with a key greater "
        << "than 20 is: " << *s1_RcIter << "." << endl;

   s1_RcIter = s1.upper_bound( 30 );

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

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