// ********************************************************
// Header file QueueA.h for the ADT queue.
// Array-based implementation.
// ********************************************************
const int MAX_QUEUE = maximum-size-of-queue;
typedef desired-type-of-queue-item queueItemType;

class queueClass
{
public:
// constructors and destructor:
   queueClass();  // default constructor
   // copy constructor and destructor are 
   // supplied by the compiler

// queue operations:
   bool QueueIsEmpty() const;
   void QueueInsert(queueItemType NewItem, bool& Success);
   void QueueDelete(bool& Success);
   void QueueDelete(queueItemType& QueueFront, 
                    bool& Success);
   void GetQueueFront(queueItemType& QueueFront, 
                      bool& Success) const;

private:
   queueItemType Items[MAX_QUEUE];
   int           Front;
   int           Back;
   int           Count;
};  // end class
// End of header file.