The type of all elements in the queue.
Creates an empty queue.
The type of all elements in the queue.
Private
#headerDummy header node whose successor is the tail node that stores the last queue element when the queue is not empty.
Private
#numNumber of elements in the queue.
Number of elements in the queue.
Private
#headPrivate
#tailIterates over all elements of this queue from the front.
The given operation will be performed on each element iterated.
The operation to be performed on each element.
Generated using TypeDoc
Singly linked list queue -- an implementation of the Queue ADT using a singly, circularly linked list with a dummy header node whose successor is the tail node (last queue element) when the queue is not empty.
Implements