Define multiset< int, less< int > > : multiset « 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

19.10.6.Define multiset< int, less< int > >

#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"



   cout << "There are currently " << intMultiset.count( 15 )

        << " values of 15 in the multiset\n";   

   return 0;

}

19.10.multiset
	19.10.1.	Add elements into an integer set and output all added elements
	19.10.2.	Assign elements to another multiset with ascending order
	19.10.3.	Initializing Associative Containers
	19.10.4.	Modify or Remove a Value in a Set or Multiset
	19.10.5.	Use std::copy to print all elements in a multiset
	19.10.6.	Define multiset< int, less< int > >

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.