Class Deque<T>

Deque (Double-ended Queue) data structure A deque is a linear data structure that allows insertion and deletion at both ends.

Example

const deque = new Deque();
deque.pushFront(1);
deque.pushBack(2);
deque.peekFront(); // 1
deque.peekBack(); // 2
deque.popFront(); // 1
deque.popBack(); // 2

Type Parameters

  • T

Hierarchy

  • Deque

Constructors

constructor

Properties

data

Methods

clear isEmpty peekBack peekFront popBack popFront pushBack pushFront size toArray toString

Constructors

constructor

Properties

Private data

data: T[]

Methods

clear

isEmpty

peekBack

peekFront

  • Returns the element at the front without removing it

    Returns null | T

popBack

  • Removes and returns the element at the back of the deque

    Returns null | T

popFront

  • Removes and returns the element at the front of the deque

    Returns null | T

pushBack

  • Adds an element to the back of the deque

    Parameters

    • value: T

    Returns void

pushFront

  • Adds an element to the front of the deque

    Parameters

    • value: T

    Returns void

size

toArray

toString

  • Returns a string representation of the deque

    Parameters

    • Optional stringify: ((value) => string)
        • (value): string

        • Parameters

          • value: T

          Returns string

    Returns string

Settings

Member Visibility

Theme

On This Page

Generated using TypeDoc