Use the generic count algorithm with predicate: Determine the number of array elements that are not equal to 1 : bind2nd « STL Algorithms Helper « 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 Helper » bind2nd

32.6.2.Use the generic count algorithm with predicate: Determine the number of array elements that are not equal to 1

#include <iostream>

#include <cassert>

#include <algorithm>

#include <functional>

using namespace std;



int main()

{

  int a[] = {0, 0, 0, 1, 1, 1, 2, 2, 2};



  int final_count = count_if(&a[0], &a[9], bind2nd(not_equal_to<int>(), 1));



  cout << final_count << endl;  

  return 0;

}

32.6.bind2nd
	32.6.1.	Demonstrate bind2nd()
	32.6.2.	Use the generic count algorithm with predicate: Determine the number of array elements that are not equal to 1
	32.6.3.	Use bind2nd() to create a unary function object that will return true when a value is greater than 10.
	32.6.4.	replace_if, bind2nd and less
	32.6.5.	replace_if bind2nd and greater
	32.6.6.	trasform, bind2nd and plus

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.