// 	Stack di item arbitrari (template)  implementato con un array
// 	Versione 2/2024
//

#include <iostream>
using namespace std;

template<class ITEM>
class StackArray {
protected:
	ITEM *data;
	int len;
	int top;
public:
	StackArray(int);
	virtual ~StackArray();
	bool isEmpty() const;
	bool isFull() const;
	StackArray<ITEM> *push(ITEM);
	ITEM pop();
};

template<class ITEM>
StackArray<ITEM>::StackArray(int l) {
	data=new ITEM[l];
	len=l;
	top=-1;
}

template<class ITEM>
StackArray<ITEM>::~StackArray(){
	delete [] data;
}

template<class ITEM>
bool StackArray<ITEM>::isEmpty() const {
	return top==-1;
}

template<class ITEM>
bool StackArray<ITEM>::isFull() const {
	return top==len-1;
}

template<class ITEM>
StackArray<ITEM> *StackArray<ITEM>::push(ITEM item) {
	if(isFull()) 
		cout << "Stack pieno!"<<endl;
	else
		data[++top]=item;
	return this;
}

template<class ITEM>
ITEM StackArray<ITEM>::pop() {
	int item=0;
	if(isEmpty())
		cout << "Stack vuoto!"<<endl;
	else
		item=data[top--];
	return item;
}

int main() 
{
	StackArray<int> x(10);
	char scelta;
	int item;
	
	do {
		cout << "*** StackArray v1 ***"<<endl;
		cout << "(p)ush, p(o)p, is(e)mpty, is(f)ull, e(x)it" <<endl;
		cin >> scelta;
		switch(scelta) {
			case 'p':
				cout<<" > item? ";
				cin>>item;
				x.push(item);
				break;
			case 'o':
				item=x.pop();
				cout<<" > item="<<item<<endl;
				break;
			case 'f':
				if(x.isFull()) 
					cout << "Stack pieno"<<endl;
				else
					cout << "Stack non pieno"<<endl;
				break;
			case 'e':
				if(x.isEmpty()) 
					cout << "Stack vuoto"<<endl;
				else
					cout << "Stack non vuoto"<<endl;
				break;
			case 'x':
				break;
		}
	} while (scelta!='x');
}