equal_range : multiset find « set multiset « 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 » set multiset » multiset find

19.15.4.equal_range

#include <iostream>

#include <set>

#include <algorithm>



using namespace std;



int main()

{

   const int SIZE = 10;

   int a[ SIZE ] = { 7, 22, 9, 1, 18, 30, 100, 22, 85, 13 };

   typedef multiset< int, less< int > > ims;

   ims intMultiset;    // ims for "integer multiset"



   pair< ims::const_iterator, ims::const_iterator > p;



   p = intMultiset.equal_range( 22 );

   cout << "\nUsing equal_range of 22"

        << "\n   Lower bound: " << *( p.first )

        << "\n   Upper bound: " << *( p.second );

   cout << endl;

   return 0;

}

19.15.multiset find
	19.15.1.	multiset::iterator from find() method
	19.15.2.	Demonstrating multiset search member functions
	19.15.3.	find returns iterator
	19.15.4.	equal_range

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.