stack7.hpp

Go to the documentation of this file.

#pragma once

#include <deque>
#include <stdexcept>

template <typename T, typename ALLOC = std::allocator<T>, template <typename, typename> class CONT = std::deque>
class Stack
{
public:
        Stack() : elems(CONT<T, ALLOC>()) {}

        bool empty() const { return elems.empty(); }

        void pop();

        void push(const T& e);

        T top() const;

private:
        CONT<T, ALLOC> elems; 
};

// -------------------- Implementations ----------------------------------------

template <typename T, typename ALLOC, template <typename, typename> class CONT>
void Stack<T, ALLOC, CONT>::pop()
{
        if (elems.empty()) {
                throw std::out_of_range("Stack<>::pop(): empty stack");
        }
        elems.pop_back();
}

template <typename T, typename ALLOC, template <typename, typename> class CONT>
void Stack<T, ALLOC, CONT>::push(T const& elem)
{
        elems.push_back(elem);
}

template <typename T, typename ALLOC, template <typename, typename> class CONT>
T Stack<T, ALLOC, CONT>::top() const
{
        if (elems.empty()) {
                throw std::out_of_range("Stack<>::top(): empty stack");
        }
        return elems.back();
}