Class: Queue<T>
Defined in: queue.ts:32 A generic FIFO (First In, First Out) queue data structure. Implements queue operations using a linked list for efficient O(1) enqueue and dequeue. QueueType Parameters
T
T
The type of elements stored in the queue
Constructors
Constructor
new Queue<T>():Queue<T>
Returns
Queue<T>
Methods
dequeue()
dequeue():Defined in: queue.ts:73 Remove and return the item at the front of the queue. O(1).T|null
Returns
T | null
The dequeued value, or null if the queue is empty.
enqueue()
enqueue(Defined in: queue.ts:52 Append an item to the back of the queue. O(1).item):void
Parameters
item
T
Value to store. The queue does not copy or freeze it.
Returns
void
getSize()
getSize(): number
Defined in: queue.ts:38
Returns
number
The number of items currently in the queue.
isEmpty()
isEmpty(): boolean
Defined in: queue.ts:43
Returns
boolean
true if the queue contains no items.