/* 
* Code example for CP264 Data Structures II
* array queue
* HBF 
*/
#include <stdio.h>

#define MAX 10
void enqueue(int queue[], int *front, int *rear, int val);
int dequeue(int queue[], int *front, int *rear);
int peek(int queue[], int front, int rear);
int display(int queue[], int front, int rear);

int main() {
  int queue[MAX];
  int front = -1, rear = -1;
  int i, n=5, val;
  printf("\nEnqueue:\n");
  for (i=0; i<n; i++) {
    enqueue(queue, &front, &rear, i);
  }
  
  printf("\nDisplay all:\n");
  display(queue, front, rear);
  
  val = peek(queue, front, rear);
  printf("\nPeek value: %d", val);

  val = dequeue(queue, &front, &rear);
  printf("\nDequeue value: %d", val);

  val = dequeue(queue, &front, &rear);
  printf("\nDequeue value: %d", val);
  
  printf("\nDisplay all:\n");
  display(queue, front, rear);
  
  return 0;
}

void enqueue(int queue[], int *front, int *rear, int val) {
  if (*rear == MAX - 1)
    printf("\n OVERFLOW");
  else if (*front == -1 && *rear == -1) {
    *front = 0;
    *rear = 0;
  } else {
    *rear = *rear + 1;
  }
  queue[*rear] = val;
}

int dequeue(int queue[], int *front, int *rear) {
  int val = -1;
  if (*front == -1 || *front > *rear) {
    printf("\n UNDERFLOW");
    return val;
  } else {
    val = queue[*front];
    *front = *front + 1;
    if (*front > *rear) {
      *front = -1;
      *rear = -1;
    }
    return val;
  }
}

int peek(int queue[], int front, int rear) {
  if (front == -1 || front > rear) {
    printf("\n QUEUE IS EMPTY");
    return -1;
  } else {
    return queue[front];
  }
}

int display(int queue[], int front, int rear) {
  if (front == -1 || front > rear) {
    printf("\nQUEUE IS EMPTY");
  } else {
	  int i;  
    for (i = front; i <= rear; i++) {
      printf("%d ", queue[i]);
    }
  }
}

/*
Enqueue:

Display all:
0 1 2 3 4
Peek value: 0
Dequeue value: 0
Dequeue value: 1
Display all:
2 3 4
*/