Queue

The Queue data structure is implemented under the classname Queue. It fully works under FIFO (First in First out), which means the API only exposes queuing and dequeuing.
This uses a Doubly Linked List in the background.

Usage

The implementation supports a wide variety of operations. Below are a few use-cases.

Creating a new Queue

// Creating a new Queue
const queue = new Queue<number>();
Copy

Retrieving information about the stack

// Checking if the queue is empty
queue.isEmpty();

// Peeking the first element
queue.peek();
Copy

Mutating the contents of the Queue

// Queuing a new element to the back
queue.enqueue(10);
queue.enqueue(5);

// Dequeuing an element from the front
queue.dequeue(); // 10
Copy

Iterating trough the Queue

The Queue class implements the Streamable interface
Note: Keep in mind that the stack iterates using the dequeue Method. That means that iterating is a destructive action and discards used elements.

// The list supports iteration
for (item in queue) {
    console.log(item);
}

// Alternatively the iterator can be called explicitly
let stream = queue.stream()
stream.next();
stream.next();
Copy