// Head.h#include 
    
     using namespace std;#ifndef DEFAULT_STACK_SIZE#define DEFAULT_STACK_SIZE 1000#endif// end // iCoding@CodeLab//
    

// Stack.h#include "Head.h"template 
    
     class Stack{	private:		ElemType *data;		int size;		int bottom;		int top;	public:		Stack ();		void push (ElemType elem);		ElemType pop ();		bool is_empty ();		bool is_full ();		int get_size ();		void expand_size ();};// end // iCoding@CodeLab//
    

#include "Stack.h"///// Stacktemplate 
    
     Stack
     
      ::Stack (){	this->size   = DEFAULT_STACK_SIZE;	this->data   = new ElemType[this->size+1];	this->bottom = 0;	this->top    = 0;}///// push template 
      
       void Stack
       
        ::push (ElemType elem){	if (is_full())	{		expand_size ();	}	this->top++;	this->data[this->top] = elem;}///// poptemplate 
        
         ElemType Stack
         
          ::pop (){ ElemType elem_top; elem_top = this->data[this->top]; this->top--; return elem_top;}///// is emptytemplate 
          
           bool Stack
           
            ::is_empty (){ return (this->bottom >= this->top);}///// is fulltemplate 
            
             bool Stack
             
              ::is_full (){ return (this->size <= this->top);}///// get size of Stacktemplate 
              
               int Stack
               
                ::get_size (){ return (this->top - this->bottom);}///// expand_sizetemplate 
                
                  void Stack
                 
                  ::expand_size (){ ElemType* elem_data_tmp; elem_data_tmp = new ElemType[this->size+1]; for (int i = this->bottom + 1; i <= this->top; i++) { elem_data_tmp[i] = this->data[i]; } delete[] this->data; this->size += DEFAULT_STACK_SIZE; this->data = new ElemType[this->size+1]; for (int i = this->bottom + 1; i <= this->top; i++) { this->data[i] = elem_data_tmp[i]; }}// end // iCoding@CodeLab//