//Stack //by baptiste prunier #include #include using namespace std; template class Pile; template ostream& operator<<(ostream& os,const Pile& p); template class Pile{ public: Pile(); Pile(unsigned int size,unsigned int inc=50); ~Pile(); void push(T value); T pop(); T head(); bool isEmpty(); private: T *values; unsigned int size; int curr=-1; const int incSize; friend ostream& operator<< <> (ostream& os, const Pile& p); }; int main() { int value; Pile p(1); p.push(1); p.push(2); p.push(3); cout<<"Stack : "< Pile::Pile():incSize(50){ size=50; values=(T*)malloc(size*sizeof(*values)); } template Pile::Pile(unsigned int size,unsigned int inc):incSize(inc),size(size),values(new T[size]){} template Pile::~Pile(){ delete[] values; } template void Pile::push(T value){ T *tab; ++curr; if(curr==size){ tab=new T[size+incSize]; copy(values,values+size,tab); delete[] values; values=tab; } values[curr]=value; } template T Pile::pop(){ return values[curr--]; } template T Pile::head(){ return values[curr]; } template bool Pile::isEmpty(){ return curr>=0; } template ostream& operator<<(ostream& os,const Pile& p){ for(int i=0;i

Stack LIFO