C++ STL学习（3）--Deque

#include<deque>
#include<iostream>
#include<algorithm>

using namespace std;

void showDeque(deque<int> iDeque, int showTimes)
{
	cout << "This is " << showTimes << " deque's contents is: ";
	for (auto x : iDeque)
		cout << x<<" ";
	cout << endl <<"size :"<< iDeque.size()<<endl<<endl;


}

int main()
{
	cout << "This is deque tutorials " << endl<<endl;

	deque<int> iDeque(20, 9);   //初始化为20个9的双端队列
	showDeque(iDeque, 1);

	for (int i = 0; i < iDeque.size(); ++i)   //重新赋值
		iDeque[i] = i;
	showDeque(iDeque, 2);

	for (int i = 0; i < 3; ++i)
		iDeque.push_back(i);        //push_back(A) 末端添加A
	showDeque(iDeque, 3);

	iDeque.push_front(111);        //push_front(B) 首端添加B
	showDeque(iDeque, 4);

	iDeque.pop_back();            //pop_back() 删除末端
	showDeque(iDeque, 5);     
	iDeque.pop_front();           //pop_front() 删除首端
	iDeque.push_back(99);         //加一个末尾标志
	showDeque(iDeque, 6);

	deque<int>::iterator curent;
	curent = find(iDeque.begin(), iDeque.end(), 1);    //找到的依旧是前面的第一个1   如果没有找到返回end()迭代器
	cout << *curent++ << endl;
	cout<<*curent<<endl;

	iDeque.erase(curent);                     //erase（it） 删除it迭代器所指内容
	showDeque(iDeque, 7);

	curent = find(iDeque.begin(), iDeque.end(), 10);
	iDeque.erase(curent,curent+3);             //erase(curent,curent+3) 删除迭代器[curent,curent+3)所指内容
	showDeque(iDeque, 8);


	curent = find(iDeque.begin(), iDeque.end(), 9); 
	iDeque.insert(curent, 88);         //insert(curent, 88)  在迭代器所指位置插入值88
	showDeque(iDeque, 9);

	curent = find(iDeque.begin(), iDeque.end(), 9);   //插入完之后迭代器无效了
	iDeque.insert(curent,5,55);         //insert(curent,n, 88)  在迭代器所指位置插入值n个88
	showDeque(iDeque, 10);

	curent = find(iDeque.begin(), iDeque.end(), 9);   //插入完之后迭代器无效了
	int a[] = { 1,2,3,4,5 };
	std::deque<int>t(a, a + 5);
	iDeque.insert(curent, t.begin(),t.end());        //insert(pos,beg,end)插入区间[beg,end)到pos
	showDeque(iDeque, 11);


	iDeque.clear();        //清空双向队列
	showDeque(iDeque, 12);

}