一个异质堆栈模板

#ifndef STACK_H
#define STACK_H
#include <deque>

using namespace std;

template <typename T ,
    template <typename ELEM , typename = std::allocator<ELEM> > class CONT = std::deque >
class Stack
{
private:
 CONT<T> elems ;
public:
 void push(T const&);
 void pop();
 T top() const;
 bool empty() const
 { return elems.empty(); }
    template <typename T2 ,
        template<typename ELEM2 ,
                typename = std::allocator<ELEM2> > class CONT2 >
    Stack<T2 , CONT2>& operator = (Stack<T2 , CONT2> const&) ;
};
template <typename T ,
    template<typename , typename> class CONT>
void Stack<T , CONT>::push(T const& elem)
{
    elems.push_back(elem);
}

template <typename T ,
    template<typename , typename> class CONT >
void Stack<T , CONT>::pop()
{
    if(elems.empty())
    {
        throw std::out_of_range("Stack<>::pop(): empty stack");
    }
    elems.pop_back();
}
template <typename T ,
    template<typename , typename> class CONT >
T Stack<T , CONT>::top() const
{
    if(elems.empty())
    {
        throw std::out_of_range("Stack<>::top(): empty stack");
    }
    return elems.back();
}
/*template <typename T ,
    template <typename , typename> class CONT >*/
template<typename T2 ,
    template <typename , typename> class CONT2> Stack<T2 , CONT2>&
    Stack<T , CONT>::operator = (Stack<T2 , CONT2> const& op2 )
{
    if((void *)this == (void *)&op2)
        return *this;
    Stack<T2 , CONT2> tep(op2);
    elems.clear();
    while(!tmp.empty())
    {
        elems.push_front(tmp.top());
        tmp.pop();
    }
    return *this;
}
#endif