Use the generic count algorithm with predicate: Determine the number of array elements that are not equal to 1 : bind2nd « STL Algorithms Helper « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » STL Algorithms Helper » bind2ndScreenshots 
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[] {000111222};

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

  cout << final_count << endl;  
  return 0;
}

 /* 
6

 */       
    
  
Related examples in the same category
1.Demonstrate bind2nd()Demonstrate bind2nd()
2.transform, bind2nd and modulus
3.transform, bind2nd and plus
4.multiply by 100 to get a percent
5.Count vowels in a sentence
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.