Class Dequeue<T>

Class representing a Double Ended Queue (Deque). Allows insertion and removal of elements from both ends of the queue.

Type Parameters

T
The type of elements that the deque will store.

Index

Constructors

Properties

capacity head list tail

Methods

add clear count isEmpty peekFirst peekLast pop shift

Constructors

constructor

new Dequeue<T>(capacity): Dequeue<T>
Creates an instance of the Deque class with a specified capacity. Initializes the deque with an empty list and sets head and tail pointers.
Type Parameters
- T
Parameters
- capacity: number
  The initial capacity of the deque.
Returns Dequeue<T>
- Defined in queue.ts:19

Properties

`Private` capacity

capacity: number

`Private` head

head: number

`Private` list

list: T[]

`Private` tail

tail: number

Methods

add

add(value): boolean
Appends an element at the end of the deque.
Parameters
- value: T
Returns boolean
Returns true if successfully, otherwise (the deque is full) it will returns false.
- Defined in queue.ts:42

clear

clear(): void
Remove all elements of the current deque.

Returns void
- Defined in queue.ts:113

count

count(): number
Returns the current number of elements in the deque.

Returns number
The number of elements currently stored in the deque.
- Defined in queue.ts:106

isEmpty

isEmpty(): boolean
Checks if the deque is full.

Returns boolean
True if the deque has reached its capacity, otherwise false.
- Defined in queue.ts:32

peekFirst

peekFirst(): undefined | T
Returns the element at the front of the deque without removing it.

Returns undefined | T
The element at the front of the deque, or undefined if the deque is empty.
- Defined in queue.ts:58

peekLast

peekLast(): undefined | T
Returns the element at the end of the deque without removing it.

Returns undefined | T
The element at the front of the deque, or undefined if the deque is empty.
- Defined in queue.ts:69

pop

pop(): undefined | T
Removes and returns the element at the end of the deque.

Returns undefined | T
The element at the end of the deque, or undefined if the deque is empty.
- Defined in queue.ts:93

shift

shift(): undefined | T
Removes and returns the element at the front of the deque.

Returns undefined | T
The element at the front of the deque, or undefined if the deque is empty.
- Defined in queue.ts:80

Generated using TypeDoc