/* The following code example is taken from the book * "C++ Templates - The Complete Guide" * by David Vandevoorde and Nicolai M. Josuttis, Addison-Wesley, 2002 * * (C) Copyright David Vandevoorde and Nicolai M. Josuttis 2002. * Permission to copy, use, modify, sell and distribute this software * is granted provided this copyright notice appears in all copies. * This software is provided "as is" without express or implied * warranty, and with no claim as to its suitability for any purpose. */#include <stdexcept>template <typename T, int MAXSIZE>class Stack {  private:    T elems[MAXSIZE];        // elements    int numElems;            // current number of elements  public:    Stack();                  // constructor    void push(T const&);      // push element    void pop();               // pop element    T top() const;            // return top element    bool empty() const {      // return whether the stack is empty        return numElems == 0;    }    bool full() const {       // return whether the stack is full        return numElems == MAXSIZE;    }};// constructortemplate <typename T, int MAXSIZE>Stack<T,MAXSIZE>::Stack ()  : numElems(0)               // start with no elements{    // nothing else to do}template <typename T, int MAXSIZE>void Stack<T,MAXSIZE>::push (T const& elem){    if (numElems == MAXSIZE) {        throw std::out_of_range("Stack<>::push(): stack is full");    }    elems[numElems] = elem;   // append element    ++numElems;               // increment number of elements}template<typename T, int MAXSIZE>void Stack<T,MAXSIZE>::pop (){    if (numElems <= 0) {        throw std::out_of_range("Stack<>::pop(): empty stack");    }    --numElems;               // decrement number of elements}template <typename T, int MAXSIZE>T Stack<T,MAXSIZE>::top () const{    if (numElems <= 0) {        throw std::out_of_range("Stack<>::top(): empty stack");    }    return elems[numElems-1];  // return last element}