Class DualStackDeque<T>

A dual stack based double-ended queue.

Type Parameters

T

Implements

MaybeAsyncReadonlyMap<number, T>
PeekableDeque<T>
SyncDeque<T>
Iterable<T>
KeyValueIterable<number, T>

Index

Constructors

Properties

backOffset backStack frontOffset frontStack minLoadFactor

Accessors

[toStringTag] size

Methods

[iterator] back clear entries front get has keys pop push set shift unshift values

Constructors

constructor

new DualStackDeque<T>(minLoadFactor?): DualStackDeque<T>
Type Parameters
- T
Parameters
- minLoadFactor: number = 0.5
Returns DualStackDeque<T>
- Defined in collections/src/impl/dsdeque.ts:15

Properties

`Private` backOffset

backOffset: number = 0

`Private` `Readonly` backStack

backStack: (undefined | T)[] = []

`Private` frontOffset

frontOffset: number = 0

`Private` `Readonly` frontStack

frontStack: (undefined | T)[] = []

`Private` `Readonly` minLoadFactor

minLoadFactor: number

Accessors

[toStringTag]

get [toStringTag](): string
Returns string
- Defined in collections/src/impl/dsdeque.ts:147

size

get size(): number
Returns number
- Defined in collections/src/impl/dsdeque.ts:19

Methods

[iterator]

[iterator](): IterableIterator<T>
Returns IterableIterator<T>
Implementation of Iterable.[iterator]
- Defined in collections/src/impl/dsdeque.ts:143

back

back(): undefined | T
Returns the top element of this Stack, or undefined if empty.

Returns undefined | T
Implementation of SyncDeque.back
- Defined in collections/src/impl/dsdeque.ts:35

clear

clear(): void
Clears this deque.

Returns void
- Defined in collections/src/impl/dsdeque.ts:47

entries

entries(): IterableIterator<[number, T]>
Queries key-value pairs by given criteria.

Returns IterableIterator<[number, T]>
Implementation of KeyValueIterable.entries
- Defined in collections/src/impl/dsdeque.ts:118

front

front(): undefined | T
Returns the first item of this Queue, or undefined if empty.

Returns undefined | T
Implementation of SyncDeque.front
- Defined in collections/src/impl/dsdeque.ts:23

get

get(index): undefined | T
Gets a value by key from the map.
Parameters
- index: number
Returns undefined | T
Implementation of MaybeAsyncReadonlyMap.get
- Defined in collections/src/impl/dsdeque.ts:52

has

has(index): boolean
Returns whether a key exists in the map.
Parameters
- index: number
Returns boolean
Implementation of MaybeAsyncReadonlyMap.has
- Defined in collections/src/impl/dsdeque.ts:61

keys

keys(): IterableIterator<number>
Queries keys by given criteria.

Returns IterableIterator<number>
Implementation of KeyValueIterable.keys
- Defined in collections/src/impl/dsdeque.ts:125

pop

pop(): undefined | T
Removes and returns the top element of this Stack, or undefined if empty.

Returns undefined | T
Implementation of SyncDeque.pop
- Defined in collections/src/impl/dsdeque.ts:104

push

push(value): void
Adds an item to this Queue.
Parameters
- value: T
Returns void
Implementation of SyncDeque.push
- Defined in collections/src/impl/dsdeque.ts:96

set

set(index, value): void
Parameters
- index: number
- value: T
Returns void
- Defined in collections/src/impl/dsdeque.ts:65

shift

shift(): undefined | T
Removes and returns the first item of this Queue, or undefined if empty.

Returns undefined | T
Implementation of SyncDeque.shift
- Defined in collections/src/impl/dsdeque.ts:82

unshift

unshift(value): void
Adds an element to the front of this Deque.
Parameters
- value: T
Returns void
Implementation of SyncDeque.unshift
- Defined in collections/src/impl/dsdeque.ts:74

values

values(): IterableIterator<T>
Queries values by given criteria.

Returns IterableIterator<T>
Implementation of KeyValueIterable.values
- Defined in collections/src/impl/dsdeque.ts:132

Generated using TypeDoc