学STL谈Deque容器(二)
2012-12-08 12:04
281 查看
Deque容器操作综合实例代码:
#include<iostream>
#include<deque>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
deque<string>coll;
coll.assign(3,string("string"));
coll.push_back("last string");
coll.push_front("first string");
copy(coll.begin(),coll.end(),ostream_iterator<string>(cout,"\n"));
cout<<endl;
coll.pop_front();
coll.pop_back();
for(int i=1;i<coll.size();i++)
{
coll[i]="another"+coll[i];
}
coll.resize(4,"resized string");
copy(coll.begin(),coll.end(),ostream_iterator<string>(cout,"\n"));
}
运行结果:
#include<iostream>
#include<deque>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
deque<string>coll;
coll.assign(3,string("string"));
coll.push_back("last string");
coll.push_front("first string");
copy(coll.begin(),coll.end(),ostream_iterator<string>(cout,"\n"));
cout<<endl;
coll.pop_front();
coll.pop_back();
for(int i=1;i<coll.size();i++)
{
coll[i]="another"+coll[i];
}
coll.resize(4,"resized string");
copy(coll.begin(),coll.end(),ostream_iterator<string>(cout,"\n"));
}
运行结果:
相关文章推荐
- stl容器区别: vector list deque set map-底层实现
- STL容器 vector,list,deque 性能比较
- C++ STL 容器 deque 内部实现原理
- stl 顺序容器vector(priority_queue),顺序容器List,顺序容器deque(queue, stack)详解
- STL顺序容器之deque双端队列
- stl容器区别: vector list deque set map-底层实现
- STL有6种序列容器(vector, list, deque, queue, priority_deque, stack)
- 拇指接龙游戏中的Undo道具与STL容器deque简介
- C++的STL容器之顺序性容器vector、list、deque
- [容器]STL之deque容器详解
- 深入研究 STL Deque 容器-An In-Depth Study of the STL Deque Container (By Nitron)
- C++ STL 容器技术 之 deque双端队列容器
- C++中防止STL中迭代器失效__map/set等关联容器vector/list/deque等序列容器_如何防止迭代器失效_即erase()的使用
- stl 顺序容器vector(priority_queue),顺序容器List,顺序容器deque(queue, stack)详解
- STL容器之deque
- C++ STL容器之 deque
- STL基本容器: string、vector、list、deque、set、map
- STL序列容器 vector, list, deque的比较
- STL提供了三个最基本的容器:vector,list,deque
- STL之Deque容器