Use operator of less than (<) : pair « map multimap « 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 » map multimap » pair

23.17.4.Use operator of less than (<)

#include <utility>

#include <string>

#include <iostream>

using namespace std;



int main(int argc, char** argv){

  pair<string, int> myPair("hello", 5), myOtherPair;



  myOtherPair.first = "hello";

  myOtherPair.second = 6;



  pair<string, int> myThirdPair(myOtherPair);



  if (myPair < myOtherPair) {

    cout << "myPair is less than myOtherPair\n";

  } else {

    cout << "myPair is greater than or equal to myOtherPair\n";

  }



  return (0);

}

23.17.pair
	23.17.1.	Assign value directly to first and second
	23.17.2.	Default constructor for pair
	23.17.3.	Using copy constructor to create another pair
	23.17.4.	Use operator of less than (<)
	23.17.5.	Use operator of equal (=)
	23.17.6.	Use make_pair() function to create a pair
	23.17.7.	Create a pair object that will contain the result of a call to insert()
	23.17.8.	Create a pair object that holds the result of insert()
	23.17.9.	Using a Pair to store int and string
	23.17.10.	Vector of pair
	23.17.11.	Sort a vector of pairs

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.