Class Queue<T>

Queue; FIFO (First In First Out).

author: Jeongho Nam - https://github.com/samchon

Type parameters

T

Hierarchy

AdaptorContainer<T, List<T>, Queue<T>>
- Queue

Implements

IEmpty
ISize
IPush<T>

Index

Constructors

constructor

Methods

Constructors

constructor

new Queue(): Queue
new Queue(obj: Queue<T>): Queue

- Defined in container/Queue.ts:17
Default Constructor.

Returns Queue
- Defined in container/Queue.ts:24
Copy Constructor.

Parameters
- obj: Queue<T>
  
  Object to copy.
Returns Queue

Methods

back

back(): T

- Defined in container/Queue.ts:59
Get the last element.

Returns T

The last element.

empty

empty(): boolean

Inherited from AdaptorContainer.empty
- Defined in internal/container/linear/AdaptorContainer.ts:42
inheritdoc

Returns boolean

front

front(): T

- Defined in container/Queue.ts:49
Get the first element.

Returns T

The first element.

pop

pop(): void

Overrides AdaptorContainer.pop
- Defined in container/Queue.ts:67
inheritdoc

Returns void

push

push(...elems: T[]): number

Inherited from AdaptorContainer.push
- Defined in internal/container/linear/AdaptorContainer.ts:53
inheritdoc

Parameters
- Rest ...elems: T[]
Returns number

size

size(): number

Inherited from AdaptorContainer.size
- Defined in internal/container/linear/AdaptorContainer.ts:34
inheritdoc

Returns number

swap

swap(obj: Queue<T>): void

Inherited from AdaptorContainer.swap
- Defined in internal/container/linear/AdaptorContainer.ts:68
Swap elements.

Parameters
- obj: Queue<T>
  
  Target container to swap.
Returns void

Generated using TypeDoc