###### STL_Algorithm: lower_bound, upper_bound, equal_range

#include<iostream>

#include<iterator>

#include<algorithm>

#include<vector>

using std::cout;

using std::endl;

int main()

{

const int SIZE = 10;

int a1[] = { 2, 2, 4, 4, 4, 6, 6, 6, 6 };

std::vector<int> v( a1, a1 + SIZE );

std::ostream_iterator<int> outputIt( cout, " " );

cout<<"Vector v contains:/n";

std::copy( v.begin(), v.end(), outputIt );

std::vector< int >::iterator lower;

lower = std::lower_bound( v.begin(), v.end(), 6 );

cout<<"/n/nLower bound of 6 is element "

<< (lower - v.begin() ) << " of vector v";

std::vector< int >::iterator upper;

upper = std::upper_bound( v.begin(), v.end(), 6 );

cout<<"/nUpper bound of 6 is element "

<<( upper - v.begin() ) <<" of vector v";

std::pair< std::vector<int>::iterator,

std::vector<int>::iterator> eq;

eq = std::equal_range( v.begin(), v.end(), 6 );

cout<<"/nUsing equal_rang:/n"

<<"   Lower bound of 6 is element "

<<( eq.first - v.begin() ) <<" of vector v";

cout<<"/n   Upper bound of 6 is element "

<<( eq.second - v.begin() )<<" of vector v";

cout<<"/n/nUse lower_bound to locate the first point/n"

<<"at which 5 can be inserted in order";

lower = std::lower_bound( v.begin(), v.end(), 5 );

cout<<"/n   Lower bound of 5 is element "

<< (lower - v.begin() ) <<" of vector v";

cout<<"/n/nUse upper_bound to locate the last point/n"

<<"at which 7 can be inserted in order";

upper = std::upper_bound( v.begin(), v.end(), 7 );

cout<<"/n   Upper bound of 7 is element "

<<( upper - v.begin() )<<" of vector v";

cout<<"/n/nUse equal_range to locate the first and/n"

<<"last point at which 5 can be inserted in order";

eq = std::equal_range( v.begin(), v.end(), 5 );

cout<<"/n   Lower bound of 5 is element "

<<( eq.first - v.begin() )<<" of vector v";

cout<<"/n   Upper bound of 5 is element "

<<( eq.second - v.begin() )<<" of vector v"

<<endl;

return 0;

}

#### multimap使用lower_bound、 upper_bound、 equal_range进行特定key的遍历

2012-09-22 16:29:19

#### C++10.5 multimap和multiset类型---equal_range、lower_bound 和upper_bound函数

2015-06-15 10:54:05

#### 注意count,find,binary_seach,lower_bound,upper_bound和equal_range的区别

2015-03-20 23:08:04

#### STL_算法_查找算法(lower_bound、upper_bound、equal_range)

2016-01-13 13:19:22

#### C++STL算法lower_bound、upper_bound、equal_range

2017-03-12 17:22:04

#### STL里边二分的lower_bound函数与upper_bound函数的最常见的用法

2016-08-01 21:06:29

#### 理解upper_bound()和lower_bound()函数

2017-01-17 15:58:05

#### stlmap中upper_bound和 lower_bound的使用

2014-12-07 20:27:06

#### upper_bound 和lower_bound 的返回值问题

2016-10-24 20:55:55

#### 使用std::lower_bound和std::upper_bound解决常见的二分查找问题

2017-05-01 14:24:50

## 不良信息举报

STL_Algorithm: lower_bound, upper_bound, equal_range