lower_bound (STL Samples)
在 Visual C++ 演示如何使用 lower_bound 标准 (STL)模板库函数。
template<class ForwardIterator, class T>
inline ForwardIterator lower_bound(
ForwardIterator First,
ForwardIterator Last,
const T& Value
)
备注
备注
类/参数名在原型不匹配版本在头文件。修改某些提高可读性。
lower_bound 算法返回序列中的第一个位置可以插入此类值序列的顺序维护。 lower_bound 返回迭代器确定在位置值在范围 [First可插入。; 如果该位置不存在,Last),或返回 Last 。 lower_bound 假定该范围 [First。使用 operatorAMP_LT,Last) 排序。
示例
// lower_bound.cpp
// compile with: /EHsc
// Illustrates how to use the lower_bound function.
// disable warning C4786: symbol greater than 255 character,
// okay to ignore this warning
#pragma warning(disable: 4786)
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
int main()
{
const int VECTOR_SIZE = 8 ;
// Define a template class vector of int
typedef vector<int > IntVector ;
//Define an iterator for template class vector of strings
typedef IntVector::iterator IntVectorIt ;
IntVector Numbers(VECTOR_SIZE) ;
IntVectorIt start, end, it, location ;
// Initialize vector Numbers
Numbers[0] = 4 ;
Numbers[1] = 10;
Numbers[2] = 10 ;
Numbers[3] = 30 ;
Numbers[4] = 69 ;
Numbers[5] = 70 ;
Numbers[6] = 96 ;
Numbers[7] = 100;
start = Numbers.begin() ; // location of first
// element of Numbers
end = Numbers.end() ; // one past the location
// last element of Numbers
// print content of Numbers
cout << "Numbers { " ;
for(it = start; it != end; it++)
cout << *it << " " ;
cout << " }\n" << endl ;
// return the first location at which 10 can be inserted
// in Numbers
location = lower_bound(start, end, 10) ;
cout << "First location element 10 can be inserted in Numbers is: "
<< location - start << endl ;
}
Output
Numbers { 4 10 10 30 69 70 96 100 }
First location element 10 can be inserted in Numbers is: 1
要求
**标题:**algorithm