node-data-structure • Docs
node-data-structure / deque / Deque
Implementation of a Deque (Double-ended Queue)
const deque = new Deque<number>()
deque.addFront(10)
deque.addBack(20)
deque.size() //Outputs:2
deque.peekFront() // Outputs: 10
deque.peekBack() // Outputs: 20
• T
The type of elements in the deque
new Deque<
T
>():Deque
<T
>
Deque
<T
>
addBack(
value
):void
Adds an element to the back of the deque.
• value: T
The value to be added to the back
void
const deque = new Deque<number>()
deque.addBack(10)
deque.size() // Outputs: 1
deque.peekFront() // Outputs: 10
deque.peekBack() // Outputs: 10
addFront(
value
):void
Adds an element to the front of the deque.
• value: T
= The value to be added to the front
void
const deque = new Deque<number>()
deque.addFront(10)
deque.size() // Outputs: 1
deque.peekFront() // Outputs: 10
deque.peekBack() // Outputs: 10
isEmpty():
boolean
Checks if the deque is empty.
boolean
true
if the deque is empty, false
otherwise
const deque = new Deque<number>()
deque.isEmpty() // Outputs: true
deque.size() // Outputs: 0
deque.addBack(10)
deque.peekFront() // Outputs: 10
deque.isEmpty() // Outputs: false
deque.size() // Outputs: 1
deque.peekBack() // Outputs: 10
deque.isEmpty() // Outputs: false
deque.size() // Outputs: 2
peekBack():
null
|T
Returns the element at the back of the deque without removing it
null
| T
The element at the back, or null
if the deque is empty
const deque = new Deque<number>()
deque.addBack(10)
deque.peekBack() // Outputs: 10
deque.addBack(20)
deque.peekBack() // Outputs: 20
peekFront():
null
|T
Returns the element at the front of the deque without removing it.
null
| T
The element at the front, or null
if the deque is empty
const deque = new Deque<number>()
deque.addFront(10)
deque.peekFront() // Outputs: 10
deque.addFront(20)
deque.peekFront() // Outputs: 20
removeBack():
null
|T
Removes and returns the element from the back of the deque.
null
| T
The element at the back, or null
if the deque
const deque = new Deque<number>()
deque.addBack(10)
deque.addBack(20)
deque.removeBack() // Outputs: 10
deque.size() // Outputs: 1
deque.removeBack() // Outputs: 20
deque.size() // Outputs: 0
deque.isEmpty() // Outputs: true
deque.removeBack() // Outputs: null
removeFront():
null
|T
Removes and returns the element from the front of the deque.
null
| T
The element at the front, or null
if the deque is empty
const deque = new Deque<number>()
deque.addBack(10)
deque.addBack(20)
deque.removeFront() // Outputs: 10
deque.size() // Outputs: 1
deque.removeFront() // Outputs: 20
deque.size() // Outputs: 0
deque.isEmpty() // Outputs: true
deque.removeFront() // Outputs: null
size():
number
number of elements in the deque
number
number of elements in the deque
const deque = new Deque<number>()
deque.size() // Outputs: 0
deque.addBack(10)
deque.size() // Outputs: 1
deque.peekBack() // Outputs: 10
deque.size() // Outputs: 2
toArray():
T
[]
T
[]