C / C++ / MFC

#ifndef STACKA_H<br />
#define STACKA_H<br />
// *********************************************************<br />
// Header file StackA.h for the ADT stack.<br />
// Array-based implementation.<br />
// *********************************************************<br />
#include "StackException.h"<br />
#include <new><br />
const int MAX_STACK = 100;<br />
<br />
template < class StackItemType ><br />
<br />
class Stack<br />
{<br />
public:<br />
// constructors and destructor:<br />
   Stack();  // default constructor<br />
<br />
// stack operations:<br />
   bool isEmpty() const;<br />
   void push(StackItemType newItem) throw(StackException);<br />
   void pop() throw(StackException);<br />
   void pop(StackItemType& stackTop) throw(StackException);<br />
   void getTop(StackItemType& stackTop) const<br />
           throw(StackException);<br />
<br />
private:<br />
   StackItemType items[MAX_STACK];  // array of stack items<br />
   int           top;               // index to top of stack<br />
};  // end class<br />
<br />
#endif

// *********************************************************<br />
// Implementation file StackA.cpp for the ADT stack.<br />
// Array-based implementation.<br />
// *********************************************************<br />
#include "StackA.h"  // Stack class specification file<br />
#include "StackException.h"<br />
<br />
template < class StackItemType ><br />
Stack<StackItemType>::Stack(): top(-1)<br />
{<br />
}  // end default constructor<br />
<br />
template < class StackItemType ><br />
bool Stack<StackItemType>::isEmpty() const<br />
{<br />
   return top < 0;<br />
}  // end isEmpty<br />
<br />
template < class StackItemType ><br />
void Stack<StackItemType>::push(StackItemType newItem) throw(StackException)<br />
{<br />
// if stack has no more room for another item<br />
   if (top >= MAX_STACK-1)<br />
      throw StackException("StackException: stack full on push");<br />
   else<br />
   {  ++top;<br />
      items[top] = newItem;<br />
   }  // end if<br />
}  // end push<br />
<br />
template < class StackItemType ><br />
void Stack<StackItemType>::pop() throw(StackException)<br />
{<br />
   if (isEmpty())<br />
      throw StackException("StackException: stack empty on pop");<br />
   else<br />
      --top;     // stack is not empty; pop top<br />
}  // end pop<br />
<br />
template < class StackItemType ><br />
void Stack<StackItemType>::pop(StackItemType& stackTop) throw(StackException)<br />
{<br />
   if (isEmpty())<br />
      throw StackException("StackException: stack empty on pop");<br />
   else<br />
   {  // stack is not empty; retrieve top<br />
      stackTop = items[top];<br />
      --top;     // pop top<br />
   }  // end if<br />
}  // end pop<br />
<br />
template < class StackItemType ><br />
void Stack<StackItemType>::getTop(StackItemType& stackTop) const throw(StackException)<br />
{<br />
   if (isEmpty())<br />
      throw StackException("StackException: stack empty on getTop");<br />
   else<br />
      // stack is not empty; retrieve top<br />
      stackTop = items[top];<br />
}  // end getTop<br />
// End of implementation file.

char a = '3';<br />
int a = 3;