#ifndef __T_STACK__
#define __T_STACK__
#include <cassert>
#include <iostream>

const int STACK_SIZE = 1000;

template <typename T>
class Stack
{
private:
	T s[STACK_SIZE];
	int tos;
public:
	Stack();
	bool isEmpty();
	bool isFull();

	void push(T elem);
	T pop();	// to pop out the top element
	T top();	// to peek the top element without popping it out 
};

template <typename T>
Stack<T>::Stack()
{
	tos = -1;	// empty stack
}

template <typename T>
bool Stack<T>::isEmpty()
{
	return (tos == -1);
}

template <typename T>
bool Stack<T>::isFull()
{
	return (tos == STACK_SIZE -1);
}

template <typename T>
void Stack<T>::push(T elem)
{
	//if (isFull())
	//	return;

	assert(!isFull());

	tos++;
	s[tos] = elem;
}

template <typename T>
T Stack<T>::pop()
{
	assert(!isEmpty());

	T rlt = s[tos];
	tos--;

	return rlt;
}

template <typename T>
T Stack<T>::top()
{
	assert(!isEmpty());

	T rlt = s[tos];

	return rlt;
}


#endif