Queue
data-structure-typed / Queue
Class: Queue<E, R>
Defined in: data-structures/queue/queue.ts:90
Array-backed queue with amortized O(1) enqueue/dequeue via an offset pointer and optional auto-compaction.
Remarks
Time O(1), Space O(1)
Examples
// Queue as message broker for event processing
interface Message {
id: string;
type: 'email' | 'sms' | 'push';
recipient: string;
content: string;
timestamp: Date;
}
// Create a message queue for real-time event processing
const messageQueue = new Queue<Message>([
{
id: 'msg-001',
type: 'email',
recipient: 'user@example.com',
content: 'Welcome!',
timestamp: new Date()
},
{
id: 'msg-002',
type: 'sms',
recipient: '+1234567890',
content: 'OTP: 123456',
timestamp: new Date()
},
{
id: 'msg-003',
type: 'push',
recipient: 'device-token-xyz',
content: 'New notification',
timestamp: new Date()
},
{
id: 'msg-004',
type: 'email',
recipient: 'admin@example.com',
content: 'Daily report',
timestamp: new Date()
}
]);
// Process messages in FIFO order (first message first)
const processedMessages: string[] = [];
while (messageQueue.length > 0) {
const message = messageQueue.shift();
if (message) {
processedMessages.push(`${message.type}:${message.recipient}`);
}
}
// Verify messages were processed in order
console.log(processedMessages); // [
// 'email:user@example.com',
// 'sms:+1234567890',
// 'push:device-token-xyz',
// 'email:admin@example.com'
// ];
// Queue should be empty after processing all messages
console.log(messageQueue.length); // 0;
// Convert queue to array
const q = new Queue<number>([10, 20, 30]);
console.log(q.toArray()); // [10, 20, 30];
Extends
LinearBase<E,R>
Type Parameters
E
E = any
R
R = any
- First In, First Out (FIFO): The core feature of a queue is its first in, first out nature. The element added to the queue first will be the one to be removed first.
- Operations: The main operations include enqueue (adding an element to the end of the queue) and dequeue (removing and returning the element at the front of the queue). Typically, there is also a peek operation (looking at the front element without removing it).
- Uses: Queues are commonly used to manage a series of tasks or elements that need to be processed in order. For example, managing task queues in a multi-threaded environment, or in algorithms for data structures like trees and graphs for breadth-first search.
- Task Scheduling: Managing the order of task execution in operating systems or applications.
- Data Buffering: Acting as a buffer for data packets in network communication.
- Breadth-First Search (BFS): In traversal algorithms for graphs and trees, queues store elements that are to be visited.
- Real-time Queuing: Like queuing systems in banks or supermarkets.
Constructors
Constructor
new Queue<E, R>(elements?, options?): Queue<E, R>;
Defined in: data-structures/queue/queue.ts:98
Create a Queue and optionally bulk-insert elements.
Parameters
elements?
Iterable<E, any, any> | Iterable<R, any, any>
Iterable of elements (or raw records if toElementFn is set).
options?
QueueOptions<E, R>
Options such as toElementFn, maxLen, and autoCompactRatio.
Returns
Queue<E, R>
New Queue instance.
Remarks
Time O(N), Space O(N)
Overrides
Properties
autoCompactRatio
Get Signature
get autoCompactRatio(): number;
Defined in: data-structures/queue/queue.ts:136
Get the compaction threshold (offset/size).
Remarks
Time O(1), Space O(1)
Returns
number
Auto-compaction ratio in (0,1].
Set Signature
set autoCompactRatio(value): void;
Defined in: data-structures/queue/queue.ts:146
Set the compaction threshold.
Remarks
Time O(1), Space O(1)
Parameters
value
number
New ratio; compacts when offset/size exceeds this value.
Returns
void
void
elements
Get Signature
get elements(): E[];
Defined in: data-structures/queue/queue.ts:114
Get the underlying array buffer.
Remarks
Time O(1), Space O(1)
Returns
E[]
Backing array of elements.
first
Get Signature
get first(): E | undefined;
Defined in: data-structures/queue/queue.ts:176
Get the first element (front) without removing it.
Remarks
Time O(1), Space O(1)
Example
// View the front element
const q = new Queue<string>(['first', 'second', 'third']);
console.log(q.first); // 'first';
console.log(q.length); // 3;
Returns
E | undefined
Front element or undefined.
last
Get Signature
get last(): E | undefined;
Defined in: data-structures/queue/queue.ts:185
Get the last element (back) without removing it.
Remarks
Time O(1), Space O(1)
Returns
E | undefined
Back element or undefined.
length
Get Signature
get length(): number;
Defined in: data-structures/queue/queue.ts:162
Get the number of elements currently in the queue.
Remarks
Time O(1), Space O(1)
Example
// Track queue length
const q = new Queue<number>();
console.log(q.length); // 0;
q.push(1);
q.push(2);
console.log(q.length); // 2;
Returns
number
Current length.
Overrides
maxLen
Get Signature
get maxLen(): number;
Defined in: data-structures/base/linear-base.ts:100
Upper bound for length (if positive), or -1 when unbounded.
Remarks
Time O(1), Space O(1)
Returns
number
Maximum allowed length.
Inherited from
offset
Get Signature
get offset(): number;
Defined in: data-structures/queue/queue.ts:125
Get the current start offset into the array.
Remarks
Time O(1), Space O(1)
Returns
number
Zero-based offset.
toElementFn
Get Signature
get toElementFn(): ((rawElement) => E) | undefined;
Defined in: data-structures/base/iterable-element-base.ts:48
Exposes the current toElementFn, if configured.
Remarks
Time O(1), Space O(1).
Returns
((rawElement) => E) | undefined
The converter function or undefined when not set.
Inherited from
Methods
[iterator]()
iterator: IterableIterator<E>;
Defined in: data-structures/base/iterable-element-base.ts:61
Returns an iterator over the structure's elements.
Parameters
args
...unknown[]
Optional iterator arguments forwarded to the internal iterator.
Returns
IterableIterator<E>
An IterableIterator<E> that yields the elements in traversal order.
Remarks
Producing the iterator is O(1); consuming the entire iterator is Time O(n) with O(1) extra space.
Inherited from
addAt()
addAt(index, newElement): boolean;
Defined in: data-structures/queue/queue.ts:357
Insert a new element at a given index.
Parameters
index
number
Zero-based index from the front.
newElement
E
Element to insert.
Returns
boolean
True if inserted.
Remarks
Time O(N), Space O(1)
Overrides
at()
at(index): E | undefined;
Defined in: data-structures/queue/queue.ts:332
Get the element at a given logical index.
Parameters
index
number
Zero-based index from the front.
Returns
E | undefined
Element or undefined.
Remarks
Time O(1), Space O(1)
Example
// Access element by index
const q = new Queue<string>(['a', 'b', 'c']);
console.log(q.at(0)); // 'a';
console.log(q.at(2)); // 'c';
Overrides
clear()
clear(): void;
Defined in: data-structures/queue/queue.ts:413
Remove all elements and reset offset.
Returns
void
void
Remarks
Time O(1), Space O(1)
Example
// Remove all elements
const q = new Queue<number>([1, 2, 3]);
q.clear();
console.log(q.length); // 0;
Overrides
clone()
clone(): this;
Defined in: data-structures/queue/queue.ts:468
Deep clone this queue and its parameters.
Returns
this
A new queue with the same content and options.
Remarks
Time O(N), Space O(N)
Example
// Create independent copy
const q = new Queue<number>([1, 2, 3]);
const copy = q.clone();
copy.shift();
console.log(q.length); // 3;
console.log(copy.length); // 2;
Overrides
compact()
compact(): boolean;
Defined in: data-structures/queue/queue.ts:430
Compact storage by discarding consumed head elements.
Returns
boolean
True when compaction performed.
Remarks
Time O(N), Space O(N)
Example
// Reclaim unused memory
const q = new Queue<number>([1, 2, 3, 4, 5]);
q.shift();
q.shift();
q.compact();
console.log(q.length); // 3;
concat()
concat(...items): this;
Defined in: data-structures/base/linear-base.ts:161
Concatenate elements and/or containers.
Parameters
items
...(E | Queue<E, R>)[]
Elements or other containers.
Returns
this
New container with combined elements (this type).
Remarks
Time O(sum(length)), Space O(sum(length))
Inherited from
delete()
delete(element): boolean;
Defined in: data-structures/queue/queue.ts:311
Delete the first occurrence of a specific element.
Parameters
element
E
Element to remove (strict equality via Object.is).
Returns
boolean
True if an element was removed.
Remarks
Time O(N), Space O(1)
Example
// Remove specific element
const q = new Queue<number>([1, 2, 3, 2]);
q.delete(2);
console.log(q.length); // 3;
Overrides
deleteAt()
deleteAt(index): E | undefined;
Defined in: data-structures/queue/queue.ts:343
Delete the element at a given index.
Parameters
index
number
Zero-based index from the front.
Returns
E | undefined
Removed element or undefined.
Remarks
Time O(N), Space O(1)
Overrides
deleteWhere()
deleteWhere(predicate): boolean;
Defined in: data-structures/queue/queue.ts:382
Delete the first element that satisfies a predicate.
Parameters
predicate
(value, index, queue) => boolean
Function (value, index, queue) → boolean to decide deletion.
Returns
boolean
True if a match was removed.
Remarks
Time O(N), Space O(N)
entries()
entries(): IterableIterator<[number, E]>;
Defined in: data-structures/base/iterable-element-base.ts:207
Return an iterator of [index, value] pairs (Array-compatible).
Returns
IterableIterator<[number, E]>
Remarks
Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
Inherited from
every()
every(predicate, thisArg?): boolean;
Defined in: data-structures/base/iterable-element-base.ts:87
Tests whether all elements satisfy the predicate.
Parameters
predicate
ElementCallback<E, R, boolean>
Function invoked for each element with signature (value, index, self).
thisArg?
unknown
Optional this binding for the predicate.
Returns
boolean
true if every element passes; otherwise false.
Remarks
Time O(n) in the worst case; may exit early when the first failure is found. Space O(1).
Inherited from
fill()
fill(
value,
start?,
end?): this;
Defined in: data-structures/base/linear-base.ts:279
Fill a range with a value.
Parameters
value
E
Value to set.
start?
number = 0
Inclusive start.
end?
number = ...
Exclusive end.
Returns
this
This list.
Remarks
Time O(n), Space O(1)
Inherited from
filter()
filter(predicate, thisArg?): this;
Defined in: data-structures/queue/queue.ts:487
Filter elements into a new queue of the same class.
Parameters
predicate
ElementCallback<E, R, boolean>
Predicate (element, index, queue) → boolean to keep element.
thisArg?
unknown
Value for this inside the predicate.
Returns
this
A new queue with kept elements.
Remarks
Time O(N), Space O(N)
Example
// Filter elements
const q = new Queue<number>([1, 2, 3, 4, 5]);
const evens = q.filter(x => x % 2 === 0);
console.log(evens.length); // 2;
Overrides
find()
Call Signature
find<S>(predicate, thisArg?): S | undefined;
Defined in: data-structures/base/iterable-element-base.ts:163
Finds the first element that satisfies the predicate and returns it.
Finds the first element of type S (a subtype of E) that satisfies the predicate and returns it.
Type Parameters
S
S
Parameters
predicate
ElementCallback<E, R, S>
Type-guard predicate: (value, index, self) => value is S.
thisArg?
unknown
Optional this binding for the predicate.
Returns
S | undefined
The matched element typed as S, or undefined if not found.
Remarks
Time O(n) in the worst case; may exit early on the first match. Space O(1).
Inherited from
Call Signature
find(predicate, thisArg?): E | undefined;
Defined in: data-structures/base/iterable-element-base.ts:164
Finds the first element that satisfies the predicate and returns it.
Finds the first element of type S (a subtype of E) that satisfies the predicate and returns it.
Parameters
predicate
ElementCallback<E, R, unknown>
Type-guard predicate: (value, index, self) => value is S.
thisArg?
unknown
Optional this binding for the predicate.
Returns
E | undefined
The matched element typed as S, or undefined if not found.
Remarks
Time O(n) in the worst case; may exit early on the first match. Space O(1).
Inherited from
findIndex()
findIndex(predicate, thisArg?): number;
Defined in: data-structures/base/linear-base.ts:147
Find the first index matching a predicate.
Parameters
predicate
ElementCallback<E, R, boolean>
(element, index, self) => boolean.
thisArg?
unknown
Optional this for callback.
Returns
number
Index or -1.
Remarks
Time O(n), Space O(1)
Inherited from
forEach()
forEach(callbackfn, thisArg?): void;
Defined in: data-structures/base/iterable-element-base.ts:133
Invokes a callback for each element in iteration order.
Parameters
callbackfn
ElementCallback<E, R, void>
Function invoked per element with signature (value, index, self).
thisArg?
unknown
Optional this binding for the callback.
Returns
void
void.
Remarks
Time O(n), Space O(1).
Inherited from
has()
has(element): boolean;
Defined in: data-structures/base/iterable-element-base.ts:188
Checks whether a strictly-equal element exists in the structure.
Parameters
element
E
The element to test with === equality.
Returns
boolean
true if an equal element is found; otherwise false.
Remarks
Time O(n) in the worst case. Space O(1).
Inherited from
includes()
includes(element): boolean;
Defined in: data-structures/base/iterable-element-base.ts:199
Check whether a value exists (Array-compatible alias for has).
Parameters
element
E
Element to search for (uses ===).
Returns
boolean
true if found.
Remarks
Provided for familiarity when migrating from Array. Time O(n), Space O(1).
Inherited from
indexOf()
indexOf(searchElement, fromIndex?): number;
Defined in: data-structures/base/linear-base.ts:111
First index of a value from the left.
Parameters
searchElement
E
Value to match.
fromIndex?
number = 0
Start position (supports negative index).
Returns
number
Index or -1 if not found.
Remarks
Time O(n), Space O(1)
Inherited from
isEmpty()
isEmpty(): boolean;
Defined in: data-structures/queue/queue.ts:232
Check whether the queue is empty.
Returns
boolean
True if length is 0.
Remarks
Time O(1), Space O(1)
Example
// Queue for...of iteration and isEmpty check
const queue = new Queue<string>(['A', 'B', 'C', 'D']);
const elements: string[] = [];
for (const item of queue) {
elements.push(item);
}
// Verify all elements are iterated in order
console.log(elements); // ['A', 'B', 'C', 'D'];
// Process all elements
while (queue.length > 0) {
queue.shift();
}
console.log(queue.length); // 0;
Overrides
join()
join(separator?): string;
Defined in: data-structures/base/linear-base.ts:218
Join all elements into a string.
Parameters
separator?
string = ','
Separator string.
Returns
string
Concatenated string.
Remarks
Time O(n), Space O(n)
Inherited from
keys()
keys(): IterableIterator<number>;
Defined in: data-structures/base/iterable-element-base.ts:218
Return an iterator of numeric indices (Array-compatible).
Returns
IterableIterator<number>
Remarks
Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
Inherited from
lastIndexOf()
lastIndexOf(searchElement, fromIndex?): number;
Defined in: data-structures/base/linear-base.ts:129
Last index of a value from the right.
Parameters
searchElement
E
Value to match.
fromIndex?
number = ...
Start position (supports negative index).
Returns
number
Index or -1 if not found.
Remarks
Time O(n), Space O(1)
Inherited from
map()
map<EM, RM>(
callback,
options?,
thisArg?): Queue<EM, RM>;
Defined in: data-structures/queue/queue.ts:513
Map each element to a new element in a possibly different-typed queue.
Type Parameters
EM
EM
RM
RM
Parameters
callback
ElementCallback<E, R, EM>
Mapping function (element, index, queue) → newElement.
options?
QueueOptions<EM, RM>
Options for the output queue (e.g., toElementFn, maxLen, autoCompactRatio).
thisArg?
unknown
Value for this inside the callback.
Returns
Queue<EM, RM>
A new Queue with mapped elements.
Remarks
Time O(N), Space O(N)
Example
// Transform elements
const q = new Queue<number>([1, 2, 3]);
const doubled = q.map(x => x * 2);
console.log(doubled.toArray()); // [2, 4, 6];
Overrides
mapSame()
mapSame(callback, thisArg?): this;
Defined in: data-structures/queue/queue.ts:535
Map each element to a new value of the same type.
Parameters
callback
ElementCallback<E, R, E>
Mapping function (element, index, queue) → element.
thisArg?
unknown
Value for this inside the callback.
Returns
this
A new queue with mapped elements (same element type).
Remarks
Time O(N), Space O(N)
Overrides
peek()
peek(): E | undefined;
Defined in: data-structures/queue/queue.ts:205
Peek at the front element without removing it (alias for first).
Returns
E | undefined
Front element or undefined.
Remarks
Time O(1), Space O(1)
print()
print(): void;
Defined in: data-structures/base/iterable-element-base.ts:298
Prints toVisual() to the console. Intended for quick debugging.
Returns
void
void.
Remarks
Time O(n) due to materialization, Space O(n) for the intermediate representation.
Inherited from
push()
push(element): boolean;
Defined in: data-structures/queue/queue.ts:252
Enqueue one element at the back.
Parameters
element
E
Element to enqueue.
Returns
boolean
True on success.
Remarks
Time O(1), Space O(1)
Example
// basic Queue creation and push operation
// Create a simple Queue with initial values
const queue = new Queue([1, 2, 3, 4, 5]);
// Verify the queue maintains insertion order
console.log([...queue]); // [1, 2, 3, 4, 5];
// Check length
console.log(queue.length); // 5;
Overrides
pushMany()
pushMany(elements): boolean[];
Defined in: data-structures/queue/queue.ts:264
Enqueue many elements from an iterable.
Parameters
elements
Iterable<E, any, any> | Iterable<R, any, any>
Iterable of elements (or raw records if toElementFn is set).
Returns
boolean[]
Array of per-element success flags.
Remarks
Time O(N), Space O(1)
Overrides
reduce()
Reduces all elements to a single accumulated value.
Param
Reducer of signature (acc, value, index, self) => nextAcc. The first element is used as the initial accumulator.
Param
Reducer of signature (acc, value, index, self) => nextAcc.
Param
The initial accumulator value of type E.
Template
The accumulator type when it differs from E.
Param
Reducer of signature (acc: U, value, index, self) => U.
Param
The initial accumulator value of type U.
Remarks
Time O(n), Space O(1). Throws if called on an empty structure without initialValue.
Call Signature
reduce(callbackfn): E;
Defined in: data-structures/base/iterable-element-base.ts:225
Parameters
callbackfn
ReduceElementCallback<E, R>
Returns
E
Inherited from
Call Signature
reduce(callbackfn, initialValue): E;
Defined in: data-structures/base/iterable-element-base.ts:226
Parameters
callbackfn
ReduceElementCallback<E, R>
initialValue
E
Returns
E
Inherited from
Call Signature
reduce<U>(callbackfn, initialValue): U;
Defined in: data-structures/base/iterable-element-base.ts:227
Type Parameters
U
U
Parameters
callbackfn
ReduceElementCallback<E, R, U>
initialValue
U
Returns
U
Inherited from
reduceRight()
reduceRight<U>(callbackfn, initialValue): U;
Defined in: data-structures/base/linear-base.ts:245
Right-to-left reduction over elements.
Type Parameters
U
U
Parameters
callbackfn
ReduceLinearCallback<E, U>
(acc, element, index, self) => acc.
initialValue
U
Initial accumulator (optional generic overloads supported).
Returns
U
Final accumulator.
Remarks
Time O(n), Space O(1)
Inherited from
reverse()
reverse(): this;
Defined in: data-structures/queue/queue.ts:397
Reverse the queue in-place by compacting then reversing.
Returns
this
This queue.
Remarks
Time O(N), Space O(N)
Overrides
setAt()
setAt(index, newElement): boolean;
Defined in: data-structures/queue/queue.ts:370
Replace the element at a given index.
Parameters
index
number
Zero-based index from the front.
newElement
E
New element to set.
Returns
boolean
True if updated.
Remarks
Time O(1), Space O(1)
Overrides
shift()
shift(): E | undefined;
Defined in: data-structures/queue/queue.ts:292
Dequeue one element from the front (amortized via offset).
Returns
E | undefined
Removed element or undefined.
Remarks
Time O(1) amortized, Space O(1)
Example
// Queue shift and peek operations
const queue = new Queue<number>([10, 20, 30, 40]);
// Peek at the front element without removing it
console.log(queue.first); // 10;
// Remove and get the first element (FIFO)
const first = queue.shift();
console.log(first); // 10;
// Verify remaining elements and length decreased
console.log([...queue]); // [20, 30, 40];
console.log(queue.length); // 3;
slice()
slice(start?, end?): this;
Defined in: data-structures/base/linear-base.ts:261
Create a shallow copy of a subrange.
Parameters
start?
number = 0
Inclusive start (supports negative index).
end?
number = ...
Exclusive end (supports negative index).
Returns
this
New list with the range (this type).
Remarks
Time O(n), Space O(n)
Inherited from
some()
some(predicate, thisArg?): boolean;
Defined in: data-structures/base/iterable-element-base.ts:110
Tests whether at least one element satisfies the predicate.
Parameters
predicate
ElementCallback<E, R, boolean>
Function invoked for each element with signature (value, index, self).
thisArg?
unknown
Optional this binding for the predicate.
Returns
boolean
true if any element passes; otherwise false.
Remarks
Time O(n) in the worst case; may exit early on first success. Space O(1).
Inherited from
sort()
sort(compareFn?): this;
Defined in: data-structures/base/linear-base.ts:179
In-place stable order via array sort semantics.
Parameters
compareFn?
(a, b) => number
Comparator (a, b) => number.
Returns
this
This container.
Remarks
Time O(n log n), Space O(n) (materializes to array temporarily)
Inherited from
splice()
splice(
start,
deleteCount?, ...
items?): this;
Defined in: data-structures/queue/queue.ts:444
Remove and/or insert elements at a position (array-like).
Parameters
start
number
Start index (clamped to [0, length]).
deleteCount?
number = 0
Number of elements to remove (default 0).
items?
...E[]
Elements to insert after start.
Returns
this
A new queue containing the removed elements (typed as this).
Remarks
Time O(N + M), Space O(M)
Overrides
toArray()
toArray(): E[];
Defined in: data-structures/base/iterable-element-base.ts:275
Materializes the elements into a new array.
Returns
E[]
A shallow array copy of the iteration order.
Remarks
Time O(n), Space O(n).
Inherited from
toReversed()
toReversed(): this;
Defined in: data-structures/base/linear-base.ts:319
Return a new instance of the same type with elements in reverse order (non-mutating).
Returns
this
A new reversed instance.
Remarks
Provided for familiarity when migrating from Array (ES2023 toReversed). Time O(n), Space O(n).
Inherited from
toReversedArray()
toReversedArray(): E[];
Defined in: data-structures/base/linear-base.ts:227
Snapshot elements into a reversed array.
Returns
E[]
New reversed array.
Remarks
Time O(n), Space O(n)
Inherited from
toVisual()
toVisual(): E[];
Defined in: data-structures/base/iterable-element-base.ts:287
Returns a representation of the structure suitable for quick visualization. Defaults to an array of elements; subclasses may override to provide richer visuals.
Returns
E[]
A visual representation (array by default).
Remarks
Time O(n), Space O(n).
Inherited from
values()
values(): IterableIterator<E>;
Defined in: data-structures/base/iterable-element-base.ts:72
Returns an iterator over the values (alias of the default iterator).
Returns
IterableIterator<E>
An IterableIterator<E> over all elements.
Remarks
Creating the iterator is O(1); full iteration is Time O(n), Space O(1).
Inherited from
fromArray()
static fromArray<E>(elements): Queue<E>;
Defined in: data-structures/queue/queue.ts:196
Create a queue from an array of elements.
Type Parameters
E
E
Parameters
elements
E[]
Array of elements to enqueue in order.
Returns
Queue<E>
A new queue populated from the array.
Remarks
Time O(N), Space O(N)
Protected Members
_toElementFn?
protected optional _toElementFn?: (rawElement) => E;
Defined in: data-structures/base/iterable-element-base.ts:39
The converter used to transform a raw element (R) into a public element (E).
Parameters
rawElement
R
Returns
E
Remarks
Time O(1), Space O(1).
Inherited from
Accessors
_createInstance()
protected _createInstance(options?): this;
Defined in: data-structures/queue/queue.ts:591
(Protected) Create an empty instance of the same concrete class.
Parameters
options?
LinearBaseOptions<E, R>
Options forwarded to the constructor.
Returns
this
An empty like-kind queue instance.
Remarks
Time O(1), Space O(1)
Overrides
_createLike()
protected _createLike<EM, RM>(elements?, options?): Queue<EM, RM>;
Defined in: data-structures/queue/queue.ts:605
(Protected) Create a like-kind queue and seed it from an iterable.
Type Parameters
EM
EM = E
RM
RM = R
Parameters
elements?
Iterable<EM, any, any> | Iterable<RM, any, any>
Iterable used to seed the new queue.
options?
QueueOptions<EM, RM>
Options forwarded to the constructor.
Returns
Queue<EM, RM>
A like-kind Queue instance.
Remarks
Time O(N), Space O(N)
_getIterator()
protected _getIterator(): IterableIterator<E>;
Defined in: data-structures/queue/queue.ts:569
(Protected) Iterate elements from front to back.
Returns
IterableIterator<E>
Iterator of E.
Remarks
Time O(N), Space O(1)
Overrides
_getReverseIterator()
protected _getReverseIterator(): IterableIterator<E>;
Defined in: data-structures/queue/queue.ts:578
(Protected) Iterate elements from back to front.
Returns
IterableIterator<E>
Iterator of E.
Remarks
Time O(N), Space O(1)
Overrides
LinearBase._getReverseIterator
_setAutoCompactRatio()
protected _setAutoCompactRatio(value): void;
Defined in: data-structures/queue/queue.ts:560
(Protected) Set the internal auto-compaction ratio.
Parameters
value
number
New ratio to assign.
Returns
void
void
Remarks
Time O(1), Space O(1)