Class Queue<T>

A queue is a data structure that follows the FIFO (first in, first out) principle.

Type Parameters

T

Index

Constructors

Accessors

Methods

clear dequeue enqueue isEmpty peek remove

Constructors

constructor

new Queue<T>(initialData?: T[]): Queue<T>
Type Parameters
- T
Parameters
- OptionalinitialData: T[]
Returns Queue<T>
- Defined in src/core/data-structures/queue/queue.ts:6

Accessors

length

get length(): number
Returns number
- Defined in src/core/data-structures/queue/queue.ts:54

Methods

clear

clear(): void
Clears the queue

Returns void
- Defined in src/core/data-structures/queue/queue.ts:42

dequeue

dequeue(): undefined | T
Removes the first item in the queue and returns it

Returns undefined | T
The first item in the queue
- Defined in src/core/data-structures/queue/queue.ts:22

enqueue

enqueue(item: T): void
Adds an item to the end of the queue
Parameters
- item: T
  The item to add to the queue
Returns void
- Defined in src/core/data-structures/queue/queue.ts:14

isEmpty

isEmpty(): boolean
Returns boolean
- Defined in src/core/data-structures/queue/queue.ts:58

peek

peek(): undefined | T
Retrieves the first item in the queue without removing it

Returns undefined | T
The first item in the queue
- Defined in src/core/data-structures/queue/queue.ts:50

remove

remove(item: T): undefined | T
Removes an item from the queue
Parameters
- item: T
  The item to remove from the queue
Returns undefined | T
- Defined in src/core/data-structures/queue/queue.ts:30