#include #include #include using namespace std; template void forEach(Collection col, Func func){ for_each(col.begin(),col.end(), func); } template Collection map(Collection col, Func func){ transform(col.begin(),col.end(), col.begin(), func); return col; } template Collection mapWithIndex(Collection col, Func func){ size_t index=0; for(auto it=col.begin();it!=col.end();it++) *it=func(*it,index++); return col; } template Collection filter(Collection col, Predicate predicate){ auto it=copy_if(col.begin(), col.end(), col.begin(), predicate); size_t len=it-col.begin(); col.resize(len); return col; } template T reduce(Collection col, Func func, T accumulator){ for(auto it=col.begin();it!=col.end();it++) accumulator=func(accumulator,*it); return accumulator; } int main() { cout<<"test 1: forEach"< vec{1,2,3,4,5}; auto printVal=[](int x)->void{cout<int{return x+1;}; auto vec2=map(vec, plusOne); forEach(vec2,printVal); cout<int{return x+i;}; auto vec3=mapWithIndex(vec, plusIndex); forEach(vec3,printVal); cout<bool{return x%2;}; auto vec4=filter(vec, isOddNumber); forEach(vec4,printVal); //reduce is already built in the std library but not in current sololearn version. //this is done in a sequential execution but the builtin reduce allows for parallel execution also, which is faster cout<int{return a+b;}; int sum=reduce(vec,summing,0); cout<

forEach map filter reduce - functional programming