#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#define SIZE 5

class Queue
{
private:
int queue[SIZE];
int rear;
int front;
int k;
int x;
public:

Queue()
{
rear  = 0;
front = 0;
x = 0;
}

void insert(int item)
{

							 // we are starting value of k with one because in case
k = (rear+1) % SIZE;	 // of 0, queue full message will be displayed, although
							 // the queue would be empty

if(front==k)
{
textcolor(YELLOW+BLINK);
cprintf("Queue full !! can't insert any more values");cout<<endl;
}
else
{
rear = k;             // Every time rear and k will have same values
cout<<"Value = "<<item;
textcolor(YELLOW);
cprintf("   Inserted ");
cout<<" at  queue[";
textcolor(13);
cprintf("rear");
cout<<"]  => queue"<<'[';
textcolor(13);
cprintf("%d",rear);
cout<<']'<<endl;

queue[rear] = item;
}
}

void remove(void)
{
if(front==rear || queue[(front+1)%5]==NULL)
{
textcolor(12+BLINK);
cprintf("Queue Empty !! can't delete any more values");cout<<endl;
}
else
{
x = front;
cout<<"Value     ";
textcolor(12);
cprintf("   Removed ");
cout<<" from queue[";
textcolor(11);
cprintf("front");            // front = front+1;
cout<<"] => queue"<<'[';     // front = front % SIZE;
cprintf("%d",++x%=SIZE);
cout<<']'<<" = "<<queue[++front%SIZE]<<endl;
queue[front] = NULL;
}
}
};

void main(void)
{
clrscr();

textcolor(14);
cprintf("Double Ended Queues or Circular Queues by Osman");cout<<endl;
textcolor(12);cprintf("ÄÄÄÄ-");textcolor(9);cprintf("ÄÄÄÄ-");textcolor(10);cprintf("ÄÄÄÄ-");textcolor(11);cprintf("ÄÄÄÄ-");textcolor(12);cprintf("ÄÄÄÄ-");textcolor(13);cprintf("ÄÄÄÄ-");textcolor(14);cprintf("ÄÄÄÄ-");textcolor(17);cprintf("ÄÄÄÄ-");textcolor(18);cprintf("ÄÄÄÄ-");textcolor(19);cprintf("ÄÄÄÄ");cout<<endl<<endl;


Queue q;

q.remove();           // Calling these functions will insert or remove
q.insert(13);         // elements from the dequeue or double ended queue or
q.insert(14);         // circular queue.
q.insert(15);
q.insert(16);
q.insert(17);


q.remove();
q.remove();

q.insert(16);


q.remove();
q.remove();
q.remove();
q.remove();

q.insert(20);
q.remove();
q.remove();
q.remove();
q.remove();
q.remove();

getch();
}