transform函数原型

1.

template<class _InIt,
class _OutIt,
class _Fn1> inline
_OutIt transform(_InIt _First, _InIt _Last,
_OutIt _Dest, _Fn1 _Func)
{ // transform [_First, _Last) with _Func
_DEPRECATE_UNCHECKED(transform, _Dest);
return (_Transform_no_deprecate(_First, _Last, _Dest, _Func));
}

2.

template<class _InIt1,
class _InIt2,
class _OutIt,
class _Fn2> inline
_OutIt transform(_InIt1 _First1, _InIt1 _Last1,
_InIt2 _First2, _OutIt _Dest, _Fn2 _Func)
{ // transform [_First1, _Last1) and [_First2, ...) with _Func
_DEFINE_DEPRECATE_UNCHECKED(transform);
_USE_DEPRECATE_UNCHECKED(_First2);
_USE_DEPRECATE_UNCHECKED(_Dest);
return (_Transform_no_deprecate(_First1, _Last1, _First2, _Dest, _Func));
}

3.

 #if _ITERATOR_DEBUG_ARRAY_OVERLOADS
template<class _InIt,
class _OutTy,
size_t _OutSize,
class _Fn1> inline
_OutTy *transform(_InIt _First, _InIt _Last,
_OutTy (&_Dest)[_OutSize], _Fn1 _Func)
{ // transform [_First, _Last) with _Func, array dest
return (_Unchecked(
_Transform_no_deprecate(_First, _Last,
_Array_iterator<_OutTy, _OutSize>(_Dest), _Func)));
}
#endif /* _ITERATOR_DEBUG_ARRAY_OVERLOADS */

4-6.

 #if _ITERATOR_DEBUG_ARRAY_OVERLOADS
template<class _InIt1,
class _InTy,
size_t _InSize,
class _OutIt,
class _Fn2> inline
_OutIt transform(_InIt1 _First1, _InIt1 _Last1,
_InTy (&_First2)[_InSize], _OutIt _Dest, _Fn2 _Func)
{ // transform [_First1, _Last1) and [_First2, ...), array input
_DEPRECATE_UNCHECKED(transform, _Dest);
return (_Transform_no_deprecate(_First1, _Last1,
_Array_iterator<_InTy, _InSize>(_First2), _Dest, _Func));
} template<class _InIt1,
class _InIt2,
class _OutTy,
size_t _OutSize,
class _Fn2> inline
_OutTy *transform(_InIt1 _First1, _InIt1 _Last1,
_InIt2 _First2, _OutTy (&_Dest)[_OutSize], _Fn2 _Func)
{ // transform [_First1, _Last1) and [_First2, ...), array dest
_DEPRECATE_UNCHECKED(transform, _First2);
return (_Unchecked(
_Transform_no_deprecate(_First1, _Last1,
_First2, _Array_iterator<_OutTy, _OutSize>(_Dest), _Func)));
} template<class _InIt1,
class _InTy,
size_t _InSize,
class _OutTy,
size_t _OutSize,
class _Fn2> inline
_OutTy *transform(_InIt1 _First1, _InIt1 _Last1,
_InTy (&_First2)[_InSize], _OutTy (&_Dest)[_OutSize], _Fn2 _Func)
{ // transform [_First1, _Last1) and [_First2, ...), array input/dest
return (_Unchecked(
_Transform_no_deprecate(_First1, _Last1,
_Array_iterator<_InTy, _InSize>(_First2),
_Array_iterator<_OutTy, _OutSize>(_Dest), _Func)));
}
#endif /* _ITERATOR_DEBUG_ARRAY_OVERLOADS */

暂时只研究前面2种

1.

#include <iostream>
#include<algorithm>
#include <functional>
#include <vector> using namespace std;
class Ticket
{
public:
Ticket()
{
;
}
int num;
int id;
char zimu;
};
class MyShow_transform
{
public:
Ticket* operator()(Ticket* t)
{
if (t->zimu == 'A')
{
cout << "车号:" << t->num << "座位:" << t->id << "排" << t->zimu << "座" << endl;
return t;
}
t->num = 0;
return t;
}
};
void show(Ticket* t)
{
if(t->num != 0)
cout<< t->num << "车" << t->id << "排" << t->zimu << "座" << endl;
return;
}
void test_transform()
{
vector<Ticket*> v1,v2,v3; for (int num = 0; num < 2; num++)
{
for (int id = 0; id < 5; id++)
{
for (int i = 0; i < 5; i++)
{
Ticket *tmp = new Ticket;
tmp->num = num+1;
tmp->id = id+1;
tmp->zimu = 'A' + i;
v1.push_back(tmp);
}
}
}
v2.resize(v1.size());
transform(v1.begin(), v1.end(), v2.begin(),MyShow_transform() );
cout << "-------------------------------------------------------------------" << endl;
for_each(v2.begin(), v2.end(), show);
for (vector<Ticket*>::iterator it = v1.begin(); it != v1.end(); )
{
delete (*it);
it = v1.erase(it);
it++;
}
}

增加函数适配器

#include <iostream>
#include<algorithm>
#include <functional>
#include <vector> using namespace std;
class Ticket
{
public:
Ticket()
{
;
}
int num;
int id;
char zimu;
};
class MyShow_transform : public std::binary_function<Ticket*, char, Ticket*>
{
public:
Ticket* operator()(const Ticket* t, const char c)const
{
Ticket* p = nullptr;
if (t->zimu == c)
{
cout << "车号:" << t->num << "座位:" << t->id << "排" << t->zimu << "座" << endl;
p = const_cast<Ticket *>(t);
return p;
}
if(p != nullptr)
p->num = 0;
return p;
}
};
void show(Ticket* t)
{
if (t == nullptr)
return;
if(t->num != 0)
cout<< t->num << "车" << t->id << "排" << t->zimu << "座" << endl;
return;
}
void test_transform()
{
vector<Ticket*> v1,v2,v3; for (int num = 0; num < 2; num++)
{
for (int id = 0; id < 5; id++)
{
for (int i = 0; i < 5; i++)
{
Ticket *tmp = new Ticket;
tmp->num = num+1;
tmp->id = id+1;
tmp->zimu = 'A' + i;
v1.push_back(tmp);
}
}
}
v2.resize(v1.size());
transform(v1.begin(), v1.end(), v2.begin(),bind2nd( MyShow_transform(),'A' ));
cout << "-------------------------------------------------------------------" << endl;
for_each(v2.begin(), v2.end(), show);
for (vector<Ticket*>::iterator it = v1.begin(); it != v1.end(); )
{
delete (*it);
it = v1.erase(it);
it++;
}
} void main()
{
test_transform();
cout << endl;
cout << "hello" << endl;
system("pause");
}

  

2.增加一个vector

#include <iostream>
#include<algorithm>
#include <functional>
#include <vector> using namespace std;
class Ticket
{
public:
Ticket()
{
;
}
int num;
int id;
char zimu;
};
class MyShow_transform : public std::binary_function<Ticket*, char, Ticket*>
{
public:
Ticket* operator()(const Ticket* t, const char c)const
{
Ticket* p = nullptr;
if (t->zimu == c)
{
cout << "车号:" << t->num << "座位:" << t->id << "排" << t->zimu << "座" << endl;
p = const_cast<Ticket *>(t);
return p;
}
if(p != nullptr)
p->num = 0;
return p;
}
};
class MyShow_transformadv : public std::binary_function<Ticket*, Ticket*, Ticket*>
{
public:
Ticket* operator()(const Ticket* t1, const Ticket* t2)const
{
Ticket* p = nullptr;
p = const_cast<Ticket *>(t1);
if (t2 == nullptr)
return p;
if (t1->num == t2->num)
{
cout << "车号:" << t1->num << "座位:" << t1->id << "排" << t1->zimu << "座" << endl;
return p;
}
if (p != nullptr)
p->num = 0;
return p;
}
};
void show(Ticket* t)
{
if (t == nullptr)
return;
if(t->num != 0)
cout<< t->num << "车" << t->id << "排" << t->zimu << "座" << endl;
return;
}
void test_transform()
{
vector<Ticket*> v1,v2,v3; for (int num = 0; num < 2; num++)
{
for (int id = 0; id < 5; id++)
{
for (int i = 0; i < 5; i++)
{
Ticket *tmp = new Ticket;
tmp->num = num+1;
tmp->id = id+1;
tmp->zimu = 'A' + i;
v1.push_back(tmp);
}
}
}
v2.resize(v1.size());
cout << "v2-------------------------------------------------------------------" << endl;
transform(v1.begin(), v1.end(), v2.begin(),bind2nd( MyShow_transform(),'A' ));
v3.resize(v1.size());
cout << "v3-------------------------------------------------------------------" << endl;
transform(v1.begin(), v1.end(), v2.begin(),v3.begin(), MyShow_transformadv());
cout << "-------------------------------------------------------------------" << endl; for (vector<Ticket*>::iterator it = v1.begin(); it != v1.end(); )
{
delete (*it);
it = v1.erase(it);
it++;
}
} void main()
{
test_transform();
cout << endl;
cout << "hello" << endl;
system("pause");
}

C++探究transform算法的更多相关文章

  1. C++探究foreach算法

    for_each在algorithm.h 中 template<class _InIt, class _Fn1> inline _Fn1 for_each(_InIt _First, _I ...

  2. A*寻路算法探究

    A*寻路算法探究 A*算法常用在游戏的寻路,是一种静态网路中求解最短路径的搜索方法,也是解决很多搜索问题的算法.相对于Dijkstra,BFS这些算法在复杂的搜索更有效率.本文在U3D中进行代码的测试 ...

  3. STL常用遍历算法for_each和transform的比较

    for_each()和transform()算法比较 1)STL 算法 – 修改性算法  for_each()  copy()  copy_backward()  transform()  merge ...

  4. STL经常使用遍历算法for_each和transform的比較

    for_each()和transform()算法比較 1)STL 算法 – 改动性算法  for_each()  copy()  copy_backward()  transform()  merge ...

  5. z-index和transform

    z-index和transform是CSS中的属性,但很少同学将二者联系到一起,感觉他们八杆子打不上.事实真的是这样吗?如果你也不能确认,这篇文章就值得你花点时间阅读.因为阅读完了,你会有所收获的. ...

  6. 4_STL设计理念_算法

    STL算法,容器,迭代器的设计理念1.STL容器通过 类模板 技术,实现 数据类型 和 容器模型的分离:2.迭代器技术 实现了 遍历和操作容器的统一方法3.STL算法设计理念:通过预定义的函数对象和函 ...

  7. 3_STL算法

    1.常用遍历算法1.1 for_each for_each(v1.begin(),v1.end(),show); void show(int &n) //回调函数的入口地址 { cout &l ...

  8. 关于统计变换(CT/MCT/RMCT)算法的学习和实现

    原文地址http://blog.sina.com.cn/s/blog_684c8d630100turx.html 刚开会每周的例会,最讨厌开会了,不过为了能顺利毕业,只能忍了.闲话不多说了,下面把上周 ...

  9. STL的容器算法迭代器的设计理念

    1) STL的容器通过类模板技术,实现数据类型和容器模型的分离. 2) STL的迭代器技术实现了遍历容器的统一方法:也为STL的算法提供了统一性. 3) STL的函数对象实现了自定义数据类型的算法运算 ...

随机推荐

  1. Linux安装rz/sz,htop插件

    Linux下rz/sz安装及使用方法 sz: 将选定的文件发送(send)到本地机器; rz:运行该命令会弹出 一个文件选择窗口, 从本地选择文件上传到服务器(receive). 下载安装包 lrzs ...

  2. OpenStack Trove组件WSGI和RPC调用流程(参考调用的整个过程)

    参考博文:https://blog.csdn.net/bill_xiang_/article/details/72909927

  3. Maven下CXF的wsdl2java生成客户端代码

    <plugin> <groupId>org.apache.cxf</groupId> <artifactId>cxf-codegen-plugin< ...

  4. leetcode104

    /** * Definition for a binary tree node. * public class TreeNode { * public int val; * public TreeNo ...

  5. django毕设之路1.0

    Django的核心理念 1.更python化 2.DRY:(don't repeat yourself),不做重复的工作 3.松耦合和灵活 4.快速开发 2.Django的MTV概 M:Model模型 ...

  6. Win32API标准模板

    #include<Windows.h> LRESULT CALLBACK WndProc //处理发送到窗口的消息的应用程序定义的函数.wndproc类型定义指向此回调函数的指针. //W ...

  7. 关于Bootstrap的入门知识

    问:Bootstrap是什么? 答:开源的前端框架,就是一些事先写好的css.js等. 问:Bootstrap在哪儿下载? 答:官方(https://getbootstrap.com/),中文(htt ...

  8. Android Studio模拟器磁盘空间不足(Not enough disk space to run AVD)

    在Android Studio中运行模拟器时,提示Error: Not enough disk space to run AVD '....'. Exiting.是说安装模拟的磁盘空间不足,导致无法运 ...

  9. 关于Encode in UTF-8 without BOM

    定义BOM(Byte Order Mark),字节顺序标记,出现在文本文件头部,Unicode编码标准中用于标识文件是采用哪种格式的编码.它的编码是FEFF. 说明 在 UTF-8 文件中放置 BOM ...

  10. cut命令详解

    1.简介:cut:以某种方式按照文件的行进行分割 2.参数列表: -b:仅显示行中指定直接范围的内容: -c:仅显示行中指定范围的字符: -d:指定字段的分隔符,默认的字段分隔符为“TAB”: -f: ...