Illustrating the use of an adaptor for pointers to functions : predicate « STL Introduction

Illustrating the use of an adaptor for pointers to functions : predicate « STL Introduction « 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 Introduction » predicate

14.9.4.Illustrating the use of an adaptor for pointers to functions

//Revised from

//STL Tutorial and Reference Guide C++ Programming with the Standard Template L

ibrary, 2nd Edition

//by David R. Musser (Author), Atul Saini (Author)

//# Publisher: Addison-Wesley Pub (Sd) (March 1996)

//# Language: English

//# ISBN-10: 0201633981

//# ISBN-13: 978-0201633986





#include <iostream>

#include <string>

#include <set>

using namespace std; 



bool less1(const string& x, const string& y)

{

  return x < y;

}



bool greater1(const string& x, const string& y)

{

  return x > y;

}



int main()

{

  typedef set<string, pointer_to_binary_function<const string&, const string&,bool> >  set_type1;



  set_type1 set1(ptr_fun(less1));



  set1.insert("the");

  set1.insert("quick");

  set1.insert("brown");

  set1.insert("fox");



  set_type1::iterator i;

  for (i = set1.begin(); i != set1.end(); ++i) 

    cout << *i << " ";

  cout << endl;

  

  set_type1 set2(ptr_fun(greater1));



  set2.insert("the");

  set2.insert("quick");

  set2.insert("brown");

  set2.insert("fox");



  for (i = set2.begin(); i != set2.end(); ++i) 

    cout << *i << " ";

  cout << endl;

  return 0;

}

brown fox quick the
the quick fox brown

14.9.predicate
	14.9.1.	Create your own unary function
	14.9.2.	use generic function as predicate
	14.9.3.	Function object to process the mean value
	14.9.4.	Illustrating the use of an adaptor for pointers to functions
	14.9.5.	Use predicate, which returns whether an integer is a prime number, with a list
	14.9.6.	Convenience function for the compose_f_gx adapter
	14.9.7.	Convenience function for the compose_f_gx_hx adapter
	14.9.8.	Convenience function for the compose_f_gx_hy adapter

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.