stack
不提供迭代器和遍历
//默认用deque进行适配
template<class T, class Sequence = deque<T>>
class stack {
friend bool operator==__STL_NULL_TMPL_ARGS(const stack&, const stack&);
friend bool operator<__STL_NULL_TMPL_ARGS(const stack&, const stack&);
public:
typedef typename Sequence::value_type value_type;
typedef typename Sequence::size_type size_type;
typedef typename Sequence::reference reference;
typedef typename Sequence::const_reference const_reference;
protected:
Sequence c;
public:
bool empty() const {return c.empty();}
size_type size() const {return c.size();}
reference top() {return c.back();}
const_reference top() const {return c.back();}
void push(const value_type& x) {c.push_back(x);}
void pop() {c.pop_back();}
};
template<class T, class Sequence>
bool operator==(const stack<T, Sequence& x, const stack<T, Sequence> &y)
{
return x.c == y.c;
}
template<class T, class Sequence>
bool operator<(const stack<T, Sequence& x, const stack<T, Sequence> &y)
{
return x.c < y.c;
}
queue
不提供迭代器和遍历
//默认用deque进行适配
template<class T, class Sequence = deque<T>>
class queue {
friend bool operator==__STL_NULL_TMPL_ARGS(const queue&, const queue&);
friend bool operator<__STL_NULL_TMPL_ARGS(const queue&, const queue&);
public:
typedef typename Sequence::value_type value_type;
typedef typename Sequence::size_type size_type;
typedef typename Sequence::reference reference;
typedef typename Sequence::const_reference const_reference;
protected:
Sequence c;
public:
bool empty() const {return c.empty();}
size_type size() const {return c.size();}
reference front() {return c.front();}
const_reference front() const {return c.front();}
reference back() {return c.back();}
const_reference back() const {return c.back();}
void push(const value_type& x) {c.push_back(x);}
void pop() {c.pop_front();}
};
template<class T, class Sequence>
bool operator==(const queue<T, Sequence& x, const queue<T, Sequence> &y)
{
return x.c == y.c;
}
template<class T, class Sequence>
bool operator<(const queue<T, Sequence& x, const queue<T, Sequence> &y)
{
return x.c < y.c;
}