STL之组合型函数适配器f(g(x)),f(g(x1,x2)),f(g(x),h(x)),f(g(x1),h(x2))

组合型函数分成以下几种,自己写函数适配器

f(g(elem))                  ------> compose_f_gx
f(g(elem1,elem2))           ------> compose_f_gxy
f(g(elem),h(elem))          ------> compose_f_gx_hx
f(g(elem),h(elem2))         ------> compose_f_gx_hy
...


下面是具体的例子,慢慢琢磨:

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<iterator>
using namespace std;
template<typename Op1,typename Op2>
class compose_f_gx_t:public unary_function<typename Op2::argument_type,typename Op1::result_type>
{
private:
	Op1 op1;
	Op2 op2;
public:
	compose_f_gx_t(const Op1& o1,const Op2& o2):op1(o1),op2(o2){
	}
	typename Op1::result_type operator()(const typename Op2::argument_type& x)const {
		return op1(op2(x));
	}
};
template<typename Op1,typename Op2>
inline compose_f_gx_t<Op1,Op2>  compose_f_gx(const Op1& o1,const Op2& o2){
	return compose_f_gx_t<Op1,Op2>(o1,o2);
}
int main(){
	vector<int>v;
	for(int i=1;i<=9;++i){
		v.push_back(i);
	}
	for(vector<int>::iterator itera=v.begin();itera!=v.end();++itera){
		cout<<*itera<<" ";
	}
	cout<<endl;
	transform(v.begin(),v.end(),ostream_iterator<int>(cout," "),compose_f_gx(bind2nd(multiplies<int>(),5),bind2nd(plus<int>(),10)));

	cout<<endl;
	system("pause");
	return 0;
}

#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
template<typename Op1,typename Op2,typename Op3>
class compose_f_gx_hx_t:public unary_function<typename Op2::argument_type,typename Op1::result_type>
{
private:
	Op1 op1;
	Op2 op2;
	Op3 op3;
public:
	compose_f_gx_hx_t(const Op1& o1,const Op2& o2,const Op3& o3):op1(o1),op2(o2),op3(o3){
	}
	typename Op1::result_type operator()(const typename Op2::argument_type& x)const{
		return op1(op2(x),op3(x));
	}
};
template<typename Op1,typename Op2,typename Op3>
inline compose_f_gx_hx_t<Op1,Op2,Op3>
compose_f_gx_hx(const Op1& o1,const Op2& o2,const Op3& o3){
	return  compose_f_gx_hx_t<Op1,Op2,Op3>(o1,o2,o3);
}
int main(){
    vector<int>v;
	for(int i=1;i<=9;++i){
		v.push_back (i);
	}
	for(vector<int>::iterator itera=v.begin();itera!=v.end();++itera){
		cout<<*itera<<" ";
		
	}
	cout<<endl;
	vector<int>::iterator it;
	it=remove_if(v.begin(),v.end(),compose_f_gx_hx(logical_and<bool>(),bind2nd(greater<int>(),4),bind2nd(less<int>(),7)));
	v.erase(it,v.end());
	
	for(vector<int>::iterator iterb=v.begin();iterb!=v.end();++iterb){
		cout<<*iterb<<" ";
	}
	cout<<endl;
	system("pause");
	return 0;
}


#include<iostream>
#include<cctype>
#include<algorithm>
#include<string>
#include<vector>
#include<functional>
using namespace std;
template<typename Op1,typename Op2,typename Op3>
class compose_f_gx_hy_t:public binary_function<typename Op2::argument_type,typename Op3::argument_type,typename Op1::result_type>
{
private:
	Op1 op1;
	Op2 op2;
	Op3 op3;
public:
	compose_f_gx_hy_t(const Op1& o1,const Op2& o2,const Op3& o3):op1(o1),op2(o2),op3(o3){

	};
	typename Op1::result_type operator()(const typename Op2::argument_type& x,const typename Op3::argument_type& y)const{
		return op1(op2(x),op3(y));
	}
};
template<typename Op1,typename Op2,typename Op3>
inline compose_f_gx_hy_t<Op1,Op2,Op3>  compose_f_gx_hy(const Op1& o1,const Op2& o2,const Op3& o3){
	return compose_f_gx_hy_t<Op1,Op2,Op3>(o1,o2,o3);
}

int main(){

	string s("Internationalization");
	string sub("Nation");
	string::iterator it;
	it=search(s.begin(),s.end(),sub.begin(),sub.end(),compose_f_gx_hy(equal_to<int>(),ptr_fun(::toupper),ptr_fun(::toupper)));
	if(it!=s.end()){
		cout<<"\""<<sub<<"\" is part of\""<<s<<"\""<<endl;
	}
	system("pause");
	return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值