Queue
Stack: FIFO data structure Usage: let queue = new Queue(); queue.enqueue('A'); queue.enqueue('B'); queue.dequeue(); => A'
Constructor Summary
Public Constructor | ||
public |
|
Method Summary
Public Methods | ||
public |
clear(): void Clears all items currently in the queue |
|
public |
Returns the current count of the items in the Queue. |
|
public |
dequeue(): <Item> Dequeues the oldest item enqueued into the queue. |
|
public |
Enqueues an item to the front of the Queue. |
|
public |
Returns true if the Queue contains no items, otherwise false. |