queue.h
void denQueue(struct Queue *queue, float item)
{
	queue->front = (queue->front + 1)%queue->capacity;
	queue->rear = (queue->rear + 1) % queue->capacity;
	queue->array[queue->rear] = item;
}
//less safe but faster implementation of deQueue->enQueue
less safe but faster implementation of deQueue->enQueue
less safe but faster implementation of deQueue - > enQueue
void denQueue(struct Queue *queue, float item)
{
	queue->front = (queue->front + 1)%queue->capacity;
	queue->rear = (queue->rear + 1) % queue->capacity;
	queue->array[queue->rear] = item;
}
void denQueue ( struct Queue * queue , float item ) { queue -> front = ( queue -> front + 1 ) % queue -> capacity ; queue -> rear = ( queue -> rear + 1 ) % queue -> capacity ; queue -> array [ queue -> rear ] = item ; }
less safe but faster implementation of deQueue->enQueue
less safe but faster implementation of deQueue - > enQueue