/**********************************
dyStack.h
Matt Silvernail Aug 11 2002
Dynamic Stack class
Linked list implementation of a Stack
**********************************/
#ifndef DYSTACK_H_
#define DYSTACK_H_
#include<stdlib.h>

template <class type>
class dyStack
{
	public: 
		dyStack();
		bool push(const type& x);
		bool pop(type& x);
		bool get_top(type& x)const;
		inline bool is_empty()const
		{
			return m_top == NULL;
		}
		inline bool is_full()const
		{
			node *x = new node;
			return (x == NULL);
		}

		bool m_return;
	private:
		struct node
		{
			type item;
			node *next;
		};
		node *m_top;
};
#include"dyStack.cpp"
#endif  

  
template <class type>
dyStack<type>::dyStack()
{
	m_top = NULL;
	m_return = false;
}

template <class type>
bool dyStack<type>::push(const type& x)
{
	node *m_old;
	bool success;
	m_old = m_top;
	m_top = new node;
	if(m_top == NULL)
	{
		m_top = m_old;
		success = false;
	}
	else
	{
		m_top->next = m_old;
		m_top->item = x;
		success = true;
	}
	return success;
}

template <class type>
bool dyStack<type>::pop(type& x)
{
	node *m_old;
	bool success = false;
	if(m_top != NULL)
	{
		x = m_top->item;
		m_old = m_top;
		m_top = m_old->next;
	}
	return success;
}
template <class type>
bool dyStack<type>::get_top(type& x)const
{
	bool success = false;
	if(m_top != NULL)
	{
		x = m_top->item;
		success = true;
	}
	return success;
}