//stackt.inl
//methods for class Stack template implemented using array

#include <iostream.h>

#define  BOS  -1

template <class Type>
Stack<Type>::Stack() {
	top = BOS;
}

template <class Type>
void Stack<Type>::push(Type x) {
	if (isfull())
		throw "overflow";
	val[++top] = x;
}

template <class Type>
Type Stack<Type>::pop() {
	if (isempty())
		throw "underflow";
	return val[top--];
}

template <class Type>
Type Stack<Type>::topval() {
	if (isempty())
		throw "underflow";
	return val[top];
}

template <class Type>
int Stack<Type>::isempty() {
	return top == BOS;
}

template <class Type>
int Stack<Type>::isfull() {
	return top == TOS-1;
}

template <class Type>
void Stack<Type>::print() {
	int i;

	for (i = top; i >= 0; i--)
		cout<<val[i]<<' ';
	cout<<endl;
}