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






#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;
}
6








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