#ifndef STACK_H_
#define STACK_H_
#include "node.h";
using namespace std;

template <typename T>
class Stack {
 public:
  // create an empty stack
  Stack<T>(): head(NULL),theSize(0){ }

  // copy constructor for a stack
  Stack<T>(const Stack<T> & orig) {
     *this = orig;
  }
		
  // still must insert copy constructor and assignment operator
		
  // destroy nodes in stack
  ~Stack<T>() {
    clear();
  }

  Stack<T> & operator= (const Stack<T> & rhs) {
    if (this != &rhs) {
      clear();
      head = NULL;
      Node<T> *temp = rhs.head;
      if (temp != NULL) {
	head = new Node<T>(temp->getValue());
      cout << "head value: " << head->getValue() << endl;
	Node<T> * current = head;
	temp = temp->getNext();
	while (temp != NULL) {
	cout << "temp value: " << temp->getValue() << endl;
	  current->setNext(new Node<T>(temp->getValue()));
	  current = current->getNext();
	  temp = temp->getNext();
	}
      }
      theSize = rhs.size();
    }
    return *this;
  }
				
  // push elt on the stack
  void push(T elt) {
    head = new Node<T>(elt,head);
    theSize++;
  }
			
  // pop elt from the stack
  T pop() {
    Node<T> *temp = head;
    T topValue = temp->getValue();
    head = head->getNext();
    theSize--;
    delete temp;
    return topValue;
  }
		
  // return top element from the stack
  T top() const {
    return head->getValue();
  }
		
  bool isEmpty() const {
    return theSize == 0;
  }

  void clear() {
    while (head != NULL) {
      pop();
    }
  }

  int size() const {
    return theSize;
  }

  void printString() const {
    Node<T> *temp = head;
    cout << "Stack: " << endl;
    while (temp != NULL) {
      cout << temp->getValue() << endl;
      temp = temp->getNext();
    }
    cout << "End of stack" << endl;

  }
		
 private:
  Node<T> *head;
  int theSize;
};

#endif /*STACK_H_*/