Extends a unary_function : for_each « STL Algorithms Non modifying sequence operations « 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 Non modifying sequence operations » for_eachScreenshots 
Extends a unary_function
  
#include <algorithm>
#include <functional>
#include <vector>
#include <iostream>
using namespace std;

class MinMax : public unary_function<int, void>{
public:
  MinMax();
  void operator()(int elem);
  int min, max;

protected:
  bool first;
};

MinMax::MinMax() : min(-1), max(-1), first(true){}

void MinMax::operator()(int elem){
  if (first) {
    min = max = elem;
  else if (elem < min) {
    min = elem;
  else if (elem > max) {
    max = elem;
  }
  first = false;
}

int main(int argc, char** argv){
  vector<int> myVector;

  myVector.push_back(1);
  myVector.push_back(2);
  myVector.push_back(3);

  MinMax func;
  func = for_each(myVector.begin(), myVector.end(), func);
  cout << "The max is " << func.max << endl;
  cout << "The min is " << func.min << endl;

  return (0);
}
  
    
  
Related examples in the same category
1.Use for_each with predicate
2.Use for_each function to add value for each element
3.Use for_each function to add first element to each element in the list
4.Use for_each function to print all elements in a vector
5.Call custom function in for_each
6.Use custom function and for_each to calculate mean value
7.Extends unary_function to do sum
8.A function object that computes an integer sum.
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.