Hands-On High Performance with Go

Common queuing functions

Very frequently, other small queue operations are added in order to make a queue a little more useful:

• isfull() is commonly implemented to check whether or not a queue is full.
• isempty() is commonly implemented to check whether or not a queue is empty.
• peek() retrieves the element that is ready to be dequeued, but does not dequeue it.

These functions are useful because a normal enqueueing operation goes as follows:

1. Check to see if the queue is full and return an error if the queue is full
2. Increment the rear pointer; return the next empty space
3. Add the data element to the location in which the rear is being pointed at

After these steps are completed, we can enqueue the next item in our queue.

Dequeuing is also ...