Skip to content

Class.Deque

github-actions[bot] edited this page Nov 18, 2026 · 13 revisions

umt / Deque

Class: Deque<T>

Defined in: DataStructure/deque.ts:40

A double-ended queue backed by a growable circular buffer. Elements can be added and removed at both ends.

Features

  • pushFront(value): Add element to the front
  • pushBack(value): Add element to the back
  • popFront(): Remove and return the front element
  • popBack(): Remove and return the back element
  • peekFront(): View the front element without removing
  • peekBack(): View the back element without removing
  • size: Get number of elements
  • isEmpty: Check if deque is empty
  • clear(): Remove all elements
  • [Symbol.iterator]: Iterate from front to back

Time Complexity

  • pushFront / pushBack: O(1) amortized
  • popFront / popBack: O(1)
  • peekFront / peekBack: O(1)
  • size / isEmpty: O(1)

Example

const deque = new Deque<number>();
deque.pushBack(2);
deque.pushBack(3);
deque.pushFront(1);

console.log([...deque]); // [1, 2, 3]
console.log(deque.popFront()); // 1
console.log(deque.popBack()); // 3
console.log(deque.size); // 1

Type Parameters

T

T

The type of elements stored in the deque

Constructors

Constructor

new Deque<T>(): Deque<T>

Returns

Deque<T>

Accessors

isEmpty

Get Signature

get isEmpty(): boolean

Defined in: DataStructure/deque.ts:84

Checks if the deque is empty.

Example
const deque = new Deque<string>();
console.log(deque.isEmpty); // true
deque.pushBack("a");
console.log(deque.isEmpty); // false
Returns

boolean

True if the deque is empty, false otherwise


size

Get Signature

get size(): number

Defined in: DataStructure/deque.ts:69

Returns the number of elements in the deque.

Example
const deque = new Deque<string>();
deque.pushBack("a");
console.log(deque.size); // 1
Returns

number

The number of elements in the deque

Methods

[iterator]()

[iterator](): IterableIterator<T>

Defined in: DataStructure/deque.ts:236

Iterates over the elements from front to back.

Returns

IterableIterator<T>

An iterator over the elements

Example

const deque = new Deque<number>();
deque.pushBack(2);
deque.pushFront(1);
console.log([...deque]); // [1, 2]

clear()

clear(): void

Defined in: DataStructure/deque.ts:219

Removes all elements from the deque.

Returns

void

Example

const deque = new Deque<number>();
deque.pushBack(1);
deque.clear();
console.log(deque.size); // 0

peekBack()

peekBack(): T | undefined

Defined in: DataStructure/deque.ts:203

Returns the back element without removing it.

Returns

T | undefined

The back element, or undefined if the deque is empty

Example

const deque = new Deque<number>();
deque.pushBack(1);
deque.pushBack(2);
console.log(deque.peekBack()); // 2
console.log(deque.size); // 2

peekFront()

peekFront(): T | undefined

Defined in: DataStructure/deque.ts:187

Returns the front element without removing it.

Returns

T | undefined

The front element, or undefined if the deque is empty

Example

const deque = new Deque<number>();
deque.pushBack(1);
deque.pushBack(2);
console.log(deque.peekFront()); // 1
console.log(deque.size); // 2

popBack()

popBack(): T | undefined

Defined in: DataStructure/deque.ts:164

Removes and returns the back element.

Returns

T | undefined

The back element, or undefined if the deque is empty

Example

const deque = new Deque<number>();
deque.pushBack(1);
deque.pushBack(2);
console.log(deque.popBack()); // 2
console.log(deque.popBack()); // 1
console.log(deque.popBack()); // undefined

popFront()

popFront(): T | undefined

Defined in: DataStructure/deque.ts:140

Removes and returns the front element.

Returns

T | undefined

The front element, or undefined if the deque is empty

Example

const deque = new Deque<number>();
deque.pushBack(1);
deque.pushBack(2);
console.log(deque.popFront()); // 1
console.log(deque.popFront()); // 2
console.log(deque.popFront()); // undefined

pushBack()

pushBack(value): void

Defined in: DataStructure/deque.ts:119

Adds an element to the back of the deque.

Parameters

value

T

The value to add

Returns

void

Example

const deque = new Deque<number>();
deque.pushBack(1);
deque.pushBack(2);
console.log(deque.peekBack()); // 2

pushFront()

pushFront(value): void

Defined in: DataStructure/deque.ts:99

Adds an element to the front of the deque.

Parameters

value

T

The value to add

Returns

void

Example

const deque = new Deque<number>();
deque.pushFront(2);
deque.pushFront(1);
console.log(deque.peekFront()); // 1

API

Classes

Interfaces

Type Aliases

Variables

Functions

Clone this wiki locally