C + + STL deque detailed

Deque container

The Deque container is the content in C + + STL. Deque is similar to vectors and supports random access and quick insert deletions. Deque also supports adding data from the start: Push_front ()

constructor function

deque<Elem> d;//创建一个空的dequedeque<Elem> d1(d2);//复制一个deque~deque<Elem>();//销毁所有数据，释放内存

member functions

deque.begin();//返回指向第一个元素的迭代器deque.end();//返回指向最后一个元素下一个位置的迭代器deque.rbegin();deque.rend();//反向迭代器

#include <cstdio>#include <deque>using namespace STD;intMain () { deque<int>D D.push_back (1);d. Push_front (2); deque<int>:: Iterator it; for(it = D.begin (); It! = D.end (); it + +) {printf("%d\n", *it); }//Output 2 1    return 0;}

d.at(pos);//返回索引为pos的位置的元素d[pos];//或者直接这样

 deque     <int ;  D;    D.push_back (1 );d. Push_front (2 ); printf  ( "%d\n" , d.at (1 ));    //output 1  printf  ( "%d\n" , D[1 ]); //output 1   

deque.empty();//判断deque是否空deque.front();//返回第一个元素deque.back();//返回最后一个元素deque.size();//返回容器大小deque.clear();//清除deque

Inserting and deleting

deque.erase(pos);//删除pos位置的元素deque.push_back(num);//在末尾插入元素deque.pop_back();//弹出末尾的元素deque.pop_front();//删除开头位置的元素

C + + STL deque detailed