STL源码剖析——容器适配器stack, queue

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;
}

 

 

 

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值