set::upper_bound

返回迭代器对该设置使用比指定的第一个元素键大的密钥。

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;
}

要求

标头: <set>

命名空间: std

请参见

参考

set Class

set::lower_bound, set::upper_bound, 和 set::equal_range

标准模板库