/*
 * stack.cpp
 *
 *  Created on: Apr 2, 2014
 *      Author: carola
 */

#include<iostream>
using namespace std;

#define DEFAULT_CAPACITY 50

template <class T>
class Stack {
    int top;
    T* storage;

    public:
      Stack();
      Stack(int capacity);
      ~Stack();
      void push(T x);
      T pop();
};



template <class T>
Stack<T>::Stack() {
	storage = new T[DEFAULT_CAPACITY];
	top=0; // top points to first empty slot
}



template <class T>
Stack<T>::Stack(int capacity) {
	storage = new T[capacity];
	top=0; // top points to first empty slot

}

template <class T>
Stack<T>::~Stack() {
	delete []storage;
}

template <class T>
void Stack<T>::push(T x) {
	storage[top++]=x; // Assume there is enough capacity
}


template <class T>
T Stack<T>::pop() {
	return storage[--top];
}

struct point{
	double x;
	double y;
};


int main(){

	Stack<double> dstack; //calls default constructor
	dstack.push(4.5);
	dstack.push(3.3);

	Stack<int>* intstack = new Stack<int>();
	intstack->push(5);

	int a = intstack->pop();
	//a = (*intstack).pop();
	cout<<"Popped: "<<a<<endl;

	Stack<point> pstack;
	struct point p = {4.0,2.0};
	pstack.push(p);

	return 0;
}