Function to remove an item from queue. It changes front and size
| 56 | // Function to remove an item from queue. |
| 57 | // It changes front and size |
| 58 | int dequeue(struct Queue* queue) |
| 59 | { |
| 60 | if (isEmpty(queue)) |
| 61 | return INT_MIN; |
| 62 | int item = queue->array[queue->front]; |
| 63 | queue->front = (queue->front + 1) |
| 64 | % queue->capacity; |
| 65 | queue->size = queue->size - 1; |
| 66 | return item; |
| 67 | } |
| 68 | |
| 69 | // Function to get front of queue |
| 70 | int front(struct Queue* queue) |
no test coverage detected