15-STL Container stack and queue

[Pin-Jiun]

stack

LIFO stack 相關function

vector<int> myvector (2,200);  
stack<vector<int> > fourth (myvector);

empty() size() top >> 沒有 front() back() push() pop()

---

queue

FIFO queue

創建方式和stack相似

  deque<int> mydeck (3,100);        // deque with 3 elements
  list<int> mylist (2,200);         // list with 2 elements

  queue<int> first;                 // empty queue
  queue<int> second (mydeck);       // queue initialized to copy of deque

  queue<int,list<int> > third; // empty queue with list as underlying container
  queue<int,list<int> > fourth (mylist);

empty() size() front() back() push() pop()