A FIFO implementation using a doubly linked list.
Creates a new Queue instance optionally initialized with items.
Optional
Optional array of items to enqueue at construction.
Returns an iterator for the queue, iterating from front to end.
Iterator for the queue values.
Removes and returns the item at the front of the queue.
The dequeued value, or undefined if the queue is empty.
Adds an item to the end of the queue.
The value to enqueue.
A FIFO implementation using a doubly linked list.