本文地址: http://blog.csdn.net/autophyte/archive/2008/11/08/3256096.aspx
因为工作中遇到要对比较大的vector以及list进行比较频繁的互相复制的动作,为了提高赋值速度,所以对几种赋值方式的耗时进行了一下对比。
测试代码:
- #include "stdafx.h"
- #include <iostream>
- #include <vector>
- #include <list>
- #include <algorithm>
- #include <Windows.h>
- using namespace std;
- typedef vector<int> vType;
- typedef list<int> lType;
- const int TEST_MAX_LEN = 100000;
- int _tmain(int argc, _TCHAR* argv[])
- {
- vType v1, v2;
- lType l1, l2;
- //初始化v1和l1
- for (int i=0; i<TEST_MAX_LEN; i++)
- {
- v1.push_back(i);
- l1.push_back(i);
- }
- //初始化计时器
- LARGE_INTEGER tmp;
- LARGE_INTEGER nSart;
- LARGE_INTEGER nEnd;
- QueryPerformanceFrequency(&tmp);
- int freq = tmp.QuadPart;
- if (0==freq) return -1;
- //用赋值操作符赋值vector
- {
- v2.clear();
- QueryPerformanceCounter(&nSart);
- v2 = v1;
- QueryPerformanceCounter(&nEnd);
- cout << "用赋值操作符赋值vector:/t"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用赋值操作符赋值list
- {
- l2.clear();
- QueryPerformanceCounter(&nSart);
- l2 = l1;
- QueryPerformanceCounter(&nEnd);
- cout << "用赋值操作符赋值list:/t"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用assign给vector赋值
- {
- v2.clear();
- QueryPerformanceCounter(&nSart);
- v2.assign(v1.begin(), v1.end());
- QueryPerformanceCounter(&nEnd);
- cout << "用assign给vector赋值:/t"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用assign给list赋值
- {
- l2.clear();
- QueryPerformanceCounter(&nSart);
- l2.assign(l1.begin(), l1.end());
- QueryPerformanceCounter(&nEnd);
- cout << "用assign给list赋值:/t"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用copy算法给vector赋值(插入迭代器方式)
- {
- v2.clear();
- QueryPerformanceCounter(&nSart);
- copy(v1.begin(), v1.end(), inserter(v2, v2.begin()));
- QueryPerformanceCounter(&nEnd);
- cout << "用copy算法给vector赋值(插入迭代器方式)"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用copy算法给list赋值(插入迭代器方式)
- {
- l2.clear();
- QueryPerformanceCounter(&nSart);
- copy(l1.begin(), l1.end(), inserter(l2, l2.begin()));
- QueryPerformanceCounter(&nEnd);
- cout << "用copy算法给list赋值(插入迭代器方式)"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用copy算法给vector赋值(resize)
- {
- v2.clear();
- QueryPerformanceCounter(&nSart);
- v2.resize(v1.size());
- copy(v1.begin(), v1.end(), v2.begin());
- QueryPerformanceCounter(&nEnd);
- cout << "用copy算法给vector赋值(resize)"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用copy算法给list赋值(resize)
- {
- l2.clear();
- QueryPerformanceCounter(&nSart);
- l2.resize(l1.size());
- copy(l1.begin(), l1.end(), l2.begin());
- QueryPerformanceCounter(&nEnd);
- cout << "用copy算法给list赋值(resize)"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用assign给vector赋值(从list)
- {
- v2.clear();
- QueryPerformanceCounter(&nSart);
- v2.assign(l1.begin(), l1.end());
- QueryPerformanceCounter(&nEnd);
- cout << "用assign给vector赋值(从list):/t"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- //用assign给list赋值(从vector)
- {
- l2.clear();
- QueryPerformanceCounter(&nSart);
- l2.assign(v1.begin(), v1.end());
- QueryPerformanceCounter(&nEnd);
- cout << "用assign给list赋值(从vector):/t"
- << (nEnd.QuadPart-nSart.QuadPart)* 1000000/freq
- << endl;
- }
- getchar();
- return 0;
- }
总结:
vector:对于vector赋值方式中,assign的速度是最快的,其次是resize以后用copy算法赋值,而最先能够想到的赋值操作符,速度却并不快,只能够排名第三,目前还不知道这是为什么,采用插入迭代器再用copy的方式是速度最慢的一种。
list:对于list赋值,赋值操作符的速度是最快的,其次是assign,然后是采用resize的copy,最后一位同样是采用插入迭代子方式的copy。