Class Queue<T>

Standard Queue based on Single Linked List

Type parameters

T

Hierarchy

Queue

Implements

IQueue<T>

Index

Constructors

constructor

Properties

_list

Accessors

isEmpty
size

Methods

Constructors

constructor

new Queue(): Queue

- Defined in Queue/Queue.ts:18
Returns Queue

Properties

Private _list

_list: LinkedList<T>

Accessors

isEmpty

get isEmpty(): boolean

- Defined in Queue/Queue.ts:52
Returns boolean

Determine if the queue is empty or not

size

get size(): number

- Defined in Queue/Queue.ts:59
Returns number

Returns the size of the queue

Methods

[Symbol.iterator]

[Symbol.iterator](): Iterator<T, any, undefined>

Implementation of IQueue.[Symbol.iterator]
- Defined in Queue/Queue.ts:66
Foreach Iterator

Returns Iterator<T, any, undefined>

dequeue

dequeue(): T

Implementation of IQueue.dequeue
- Defined in Queue/Queue.ts:36
Gets and remove next item in queue.

Returns T

enqueue

enqueue(item: T): void

Implementation of IQueue.enqueue
- Defined in Queue/Queue.ts:28
Adds a new item to queue.

Parameters
- item: T
Returns void

peek

peek(): T

Implementation of IQueue.peek
- Defined in Queue/Queue.ts:45
Gets next item in queue.

Returns T

Generated using TypeDoc