STL——算法

for_each.cpp

#include <iostream>
#include <algorithm>
using namespace std;
#include <string>
void add10(int& element)
{
	element += 10;
}
string print(int element)
{
	cout << element << ' ';
	return "furong";
}
class add{//函数对象
	int delta;
public:
	add(int d):delta(d){}
	void operator()(int& element){//重载（）操作符
		element += delta;
	}
};
template <typename Iter, typename Func>
void foreach(Iter ib, Iter ie, Func f)
{
	while(ib!=ie) f(*ib++);
}
int main()
{
	int a[5] = {11,22,33,44,55};
	for_each(a,a+5,add10);
	for_each(a,a+5,print);cout<<endl;
	for_each(a,a+5,add(5));
	for_each(a,a+5,print);cout<<endl;
	for_each(a,a+5,add(1));
	for_each(a,a+5,print);cout<<endl;
}

copy.cpp

#include <algorithm>
#include <iostream>
using namespace std;
#include <vector>
#include "print.h"
#include <deque>
template < class Iter, class Pos >
void co(Iter ib, Iter ie, Pos p)
{	while(ib!=ie) *p++=*ib++;}
template < class Iter, class Pos >
void cb(Iter ib, Iter ie, Pos p)
{	while(ib!=ie) *--p=*--ie;}
int main()
{
	int a[5]={3,9,2,6,8};
	int b[8]={0};
	vector<int> vi(a,a+5);
	sort(vi.begin(),vi.end());
	print(vi.begin(),vi.end());
	print(a,a+5,',');
	copy(vi.begin(),vi.end(),a);
	print(a,a+5,',');
	co(vi.begin(),vi.end(),b);
	print(b,b+8);
	copy_backward(b,b+5,b+8);//倒着复制
	print(b,b+8);
	bool func(int);
	deque<int> v;
	co(a,a+5,back_inserter(v));
	print(v.begin(), v.end());
	co(a,a+5,front_inserter(v));
	print(v.begin(), v.end());
	v.clear();
	remove_copy_if(a,a+5,back_inserter(v),func);
	print(v.begin(), v.end());
}
bool func(int n){return n&1;}//奇数

if.cpp

/*
iterator find(pos_beg, pos_end, data)
iterator find_if(pos_beg, pos_end, cond), bool cond(element)
int count(...), int count_if(...)
*/
#include <algorithm>
#include <iostream>
using namespace std;
#include <cctype>
#include <string>
bool init_upper(const string& str)//大写字母
{return isupper(str[0]);}
bool has_o(const string& str)
{return str.find_first_of("oO")!=string::npos;}//string::npos=-1 
int main()
{
	string a[7]={"abc","good","Day","look","God","OK","bye"};
	string* p = find(a,a+7,"look");
	cout << (p==a+7?"没找到":"找到") << "look" << endl;
	p = find(a,a+7,"book");
	cout << (p==a+7?"没找到":"找到") << "book" << endl;
	p = find_if(a,a+7,init_upper);
	if(p==a+7) cout << "没找到大写字母开头的字符串" << endl;
	else cout << "找到" << *p << endl;
	cout << count_if(a,a+7,init_upper) << endl;
	cout << count_if(a,a+7,has_o) << endl;
}

iterator.cpp

/*迭代器分类（it）：++,*,->,==,!=
输入迭代器：可读*it的值，但不一定能修改（设置）*it的值
输出迭代器：可以设置*it的值，但不一定能读取*it的值
前向迭代器：可以读取也可以设置*it的值
双向迭代器：支持--
随机迭代器：几乎跟指针一样，支持--,+n,-n,比较大小，[下标]
*/
#include <iterator>
#include <iostream>
using namespace std;
#include <algorithm>
#include <vector>
#include "print.h"
#include <fstream>
int main()
{
	istream_iterator<int> in(cin);
	istream_iterator<int> end;
	vector<int> vi;
	copy(in,end,back_inserter(vi));
	print(vi.begin(),vi.end());
	
	ostream_iterator<int> o(cout,"*");
	copy(vi.begin(),vi.end(),o);cout<<endl;
	
	ofstream fo("datafile");
	ostream_iterator<int> fiter(fo," ");
	copy(vi.begin(),vi.end(),fiter);fo<<endl;
	fo.close();
	ifstream fin("datafile");
	istream_iterator<int> fit(fin);
	vector<int> v;
	copy(fit,end,back_inserter(v));
	print(v.begin(), v.end(), ',');
	fin.close();
}