Data Abstraction and Problem Solving with C++
Walls and Mirrors
by Frank M. Carrano
c07p366.h
Go to the documentation of this file.00001 00014 template <typename T, typename Container = deque <T> > 00015 class queue 00016 { 00017 public: 00021 explicit queue(const Container& cnt = Container()); 00022 00028 bool empty() const; 00029 00036 size_type size() const; 00037 00042 T &front(); 00043 00048 T &back(); 00049 00053 void pop(); 00054 00059 void push(const T& x); 00060 00061 }; // end std::queue
