//The utlitiy file is giving me the headahce.  Specifically,
//the line containing the bool statement.  

//Begin utility file:
enum bool {false, true};
enum Error_code {success, overflow, underflow};

#endif

//end utility file

//Lab2.cpp this file's purpose is to act as a simple test driver
#include <iostream>
#include "utility.h"
#include "Queue.h"

using namespace std;

main()
{
	Queue aQueue;
}
//end file Lab2.cpp

// File Queue.h begins here

#ifndef QUEUE_H
#define QUEUE_H

const int maxqueue = 10;
typedef char Queue_entry;

class Queue{
public:
	Queue();
	bool empty()const;
	Error_code serve();
	Error_code append(const Queue_entry &item);
	Error_code retrieve(Queue_entry &item)const;
private:
	int count;
	int front, rear;
	Queue_entry entry[maxqueue];
};

#endif
//end file Queue.h

//File Queue.cpp begins here:

#include "Queue.h"

Queue::Queue()
/*Post: The Queue is initialized to be empty.*/
{
	count = 0;
	rear = maxqueue-1;
	front = 0;
}

bool Queue::empty()  //*******This is the only instance of bool in this file
/*Post: Return true if the Queue is empty, otherwise return false. */
{
	return count == 0;
}

Error_code Queue::append(const Queue_entry &item)
/*Post: item is added to the rear of the Queue.  If the Queue is full return an
		Error_code of overflow and leave the Queue unchanged*/
{
	if(count>=maxqueue) return overflow;
	count++;
	rear =((rear + 1) == maxqueue)? 0 : (rear +1);
	entry[rear] = item;
	return success;
}

Error_code Queue::serve()
/*Post: The front of the Queue is removed.  If the Queue is empty, return an
		Error_code of underflow.*/
{
	if(count<=0) return underflow;
	count--;
	front=((front+1) == maxqueue) ? 0 : (front+1);
	return success;
}

Error_code Queue::retrieve(Queue_entry &item)const
/*Post: The front of the Queue retrieved to the output parameter item.  If the
		Queue is empty return an Error_code of underflow.*/
{
	if(count<=0) return underflow;
	item = entry[front];
	return success;
}
//end of file Queue.cpp