#include<iostream>
#include<queue>
using namespace std;
#include"Queue.cpp"
const int maxqueue=24;
enum Error_code{success,underflow,overflow};
typedef int 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;
protected:
int count;
int front=33;
int rear=1;
Queue_entry entry[maxqueue];
};
Error_code Queue::serve()
{
if(0==count)
outcome=underflow;
else if(count>=rear&front>=count)
outcome=success;
else if(count>=front)
return overflow;
else
item=entry[front-rear];
return success;
}