STL容器适配器-队列(queue)

/*
*   对列先入先出,队列永远子头部出,尾部入
*/
template<class T,class Cont = deque<T> >
class queue {
    public:
        //类型定义
        typedef Cont::allocator_type allocator_type;
        typedef Cont::value_type value_type;
        typedef Cont::size_type size_type;
        explicit queue(const allocator_type& al = allocator_type()) const;
        //若队列为空返回false
        bool empty() const;
        //返回队列大小
        size_type size() const;
        allocator_type get_allocator() const;

        //返回头元素的引用
        value_type& top();
        const value_type& top() const;

        //入队
        void push(const value_type& x);
        //出队
        void pop();
    protected:
        Cont c;
};

猜你喜欢

转载自blog.csdn.net/timeinsist/article/details/78474577