Transform a vector with bind1st and divides : divides « 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 » dividesScreenshots 
Transform a vector with bind1st and divides
  
#include <algorithm>
#include <functional>
#include <iomanip>
#include <numeric>
#include <string>
#include <vector>
#include <iostream>

using namespace std;

template <class T>
void print(T& c){
   fortypename T::iterator i = c.begin(); i != c.end(); i++ ){
      std::cout << *i << endl;
   }
}

bool in_stringchar c, const string target ){ 
   return target.find!= string::npos; 
}

int main( ){
   vector<float> v5);
   partial_sumv.begin(), v.end(), v.begin() );
   printv);

   transformv.begin(), v.end(), v.begin(),bind1stdivides<float>()) );
   cout << fixed << setprecision);
   printv);

   // convert to percentages
   transformv.begin(), v.end(), v.begin(),bind1stmultiplies<float>()100 ) );
   printv);

   // make a sequence starting at -10 and increasing by 100
   v.assignv.size()100 );
   v[0= -10;
   partial_sumv.begin(), v.end(), v.begin() );
   print);

   // truncate numbers to fall between 0 and 255 inclusive
   replace_ifv.begin(), v.end(),bind2ndgreater<float>()255 )255 );
   replace_ifv.begin(), v.end(), bind2ndless<float>()));
   printv);

}
  
    
  
Related examples in the same category
1.Use a binary function object divides
2.Divided contents of a list with transform() and divides()
3.Transform with divides
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.