equal_range( v.begin(), v.end(), 6 ) : equal_range « STL Algorithms Binary search « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Algorithms Binary search » equal_range

26.2.6.equal_range( v.begin(), v.end(), 6 )

#include <iostream>

#include <algorithm>

#include <vector>



using namespace std;



int main()

{

   const int SIZE = 10;

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

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



   pair< vector< int >::iterator, vector< int >::iterator > eq;

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

   cout << "\nUsing equal_range:\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";



   return 0;

}

26.2.equal_range
	26.2.1.	Use equal_range to determine both the lower- and upper-bound insertion points
	26.2.2.	equal_range and distance
	26.2.3.	Use equal function to check whether both collections are equal
	26.2.4.	Use equal function to check for corresponding even and odd elements
	26.2.5.	Use equal_range to locate the first and last point at which 5 can be inserted in order
	26.2.6.	equal_range( v.begin(), v.end(), 6 )

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.