STM——遍历算法（for_each、transform）

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

struct myPrint
{
public:
	myPrint()
	{
		a = 0;
	}
	void operator()(const int &val)
	{
		cout << val << " ";
		a++;
	}
public:
	int a;
};
void test01()
{
	vector<int> v;
	v.push_back(10);
	v.push_back(20);
	v.push_back(30);
	v.push_back(40);
	v.push_back(50);
	/*
	void _For_each(_InIt _First, _InIt _Last, _Fn1& _Func)
	{	// perform function for each element
		for (; _First != _Last; ++_First)
			_Func(*_First);
	}
	*/
	myPrint m;
	myPrint m2=for_each(v.begin(), v.end(), myPrint());
	cout << endl;
	cout << m2.a << endl;
	cout << m.a << endl;
}
/*
/*
transform算法 将指定容器区间元素搬运到另一容器中
注意 : transform 不会给目标容器分配内存，所以需要我们提前分配好内存
@param beg1 源容器开始迭代器
@param end1 源容器结束迭代器
@param beg2 目标容器开始迭代器
@param _cakkback 回调函数或者函数对象
@return 返回目标容器迭代器

transform(iterator beg1, iterator end1, iterator beg2, _callbakc)
*/

struct MyAdd
{
	int operator()(int v1)
	{
		return v1 + 100;
	}
};
void test02()
{
	vector<int> v;
	v.push_back(10);
	v.push_back(20);
	v.push_back(30);
	v.push_back(40);
	v.push_back(50);

	vector<int> v2;
	//要手动分配空间
	v2.resize(v.size());
	/*
	_OutIt _Transform(_InIt _First, _InIt _Last,_OutIt _Dest, _Fn1 _Func)
	{	
		for (; _First != _Last; ++_First, ++_Dest)
			*_Dest = _Func(*_First);
		return (_Dest);
	}
	*/
	transform(v.begin(), v.end(), v2.begin(), MyAdd());
	for_each(v2.begin(), v2.end(), [](int val)->void{cout << val << " "; });
}
/*
把两个容器中的元素处理后放入第三个容器中
_OutIt _Transform(_InIt1 _First1, _InIt1 _Last1,_InIt2 _First2, _OutIt _Dest, _Fn2 _Func)
{
	for (; _First1 != _Last1; ++_First1, ++_First2, ++_Dest)
		*_Dest = _Func(*_First1, *_First2);
	return (_Dest);
}
*/
struct MyAdd2
{
	int operator()(int v1, int v2)
	{
		return v1 + v2;
	}
};
void test03()
{
	vector<int> v;
	v.push_back(10);
	v.push_back(20);
	v.push_back(30);
	v.push_back(40);
	v.push_back(50);

	vector<int> v2;
	v2.push_back(100);
	v2.push_back(200);
	v2.push_back(300);
	v2.push_back(400);
	v2.push_back(500);

	vector<int> v3;
	int a = 0;
	if (v.size() > v2.size())
	{
		a = v.size();
	}
	else
	{
		a = v2.size();
	}
	v3.resize(a);
	transform(v.begin(), v.end(), v2.begin(), v3.begin(), MyAdd2());
	for_each(v3.begin(), v3.end(), [](int val)->void{cout << val << " "; });
}

int main()
{
	test03();
	system("pause");
	return EXIT_SUCCESS;
}