data-structure-typed 2.6.1 → 2.6.2

package/docs-site-docusaurus/docs/api/classes/Queue.md

@@ -6,7 +6,7 @@
 
 # Class: Queue\<E, R\>
 
-Defined in: [data-structures/queue/queue.ts:91](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L91)
+Defined in: [data-structures/queue/queue.ts:90](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L90)
 
 Array-backed queue with amortized O(1) enqueue/dequeue via an offset pointer and optional auto-compaction.
 
@@ -115,7 +115,7 @@ Time O(1), Space O(1)
 new Queue<E, R>(elements?, options?): Queue<E, R>;
 ```
 
-Defined in: [data-structures/queue/queue.ts:100](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L100)
+Defined in: [data-structures/queue/queue.ts:98](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L98)
 
 Create a Queue and optionally bulk-insert elements.
 
@@ -157,7 +157,7 @@ Time O(N), Space O(N)
 get autoCompactRatio(): number;
 ```
 
-Defined in: [data-structures/queue/queue.ts:141](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L141)
+Defined in: [data-structures/queue/queue.ts:136](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L136)
 
 Get the compaction threshold (offset/size).
 
@@ -177,7 +177,7 @@ Auto-compaction ratio in (0,1].
 set autoCompactRatio(value): void;
 ```
 
-Defined in: [data-structures/queue/queue.ts:152](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L152)
+Defined in: [data-structures/queue/queue.ts:146](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L146)
 
 Set the compaction threshold.
 
@@ -209,7 +209,7 @@ void
 get elements(): E[];
 ```
 
-Defined in: [data-structures/queue/queue.ts:117](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L117)
+Defined in: [data-structures/queue/queue.ts:114](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L114)
 
 Get the underlying array buffer.
 
@@ -233,7 +233,7 @@ Backing array of elements.
 get first(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/queue.ts:268](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L268)
+Defined in: [data-structures/queue/queue.ts:176](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L176)
 
 Get the first element (front) without removing it.
 
@@ -256,8 +256,6 @@ Time O(1), Space O(1)
 
 Front element or undefined.
 
- *
-
 ***
 
 ### last
@@ -268,7 +266,7 @@ Front element or undefined.
 get last(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/queue.ts:287](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L287)
+Defined in: [data-structures/queue/queue.ts:185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L185)
 
 Get the last element (back) without removing it.
 
@@ -292,7 +290,7 @@ Back element or undefined.
 get length(): number;
 ```
 
-Defined in: [data-structures/queue/queue.ts:211](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L211)
+Defined in: [data-structures/queue/queue.ts:162](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L162)
 
 Get the number of elements currently in the queue.
 
@@ -317,8 +315,6 @@ Time O(1), Space O(1)
 
 Current length.
 
- *
-
 #### Overrides
 
 [`LinearBase`](LinearBase.md).[`length`](LinearBase.md#length)
@@ -361,7 +357,7 @@ Maximum allowed length.
 get offset(): number;
 ```
 
-Defined in: [data-structures/queue/queue.ts:129](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L129)
+Defined in: [data-structures/queue/queue.ts:125](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L125)
 
 Get the current start offset into the array.
 
@@ -445,7 +441,7 @@ Producing the iterator is O(1); consuming the entire iterator is Time O(n) with
 addAt(index, newElement): boolean;
 ```
 
-Defined in: [data-structures/queue/queue.ts:663](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L663)
+Defined in: [data-structures/queue/queue.ts:357](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L357)
 
 Insert a new element at a given index.
 
@@ -485,7 +481,7 @@ Time O(N), Space O(1)
 at(index): E | undefined;
 ```
 
-Defined in: [data-structures/queue/queue.ts:636](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L636)
+Defined in: [data-structures/queue/queue.ts:332](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L332)
 
 Get the element at a given logical index.
 
@@ -503,8 +499,6 @@ Zero-based index from the front.
 
 Element or undefined.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -530,7 +524,7 @@ Time O(1), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/queue/queue.ts:762](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L762)
+Defined in: [data-structures/queue/queue.ts:413](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L413)
 
 Remove all elements and reset offset.
 
@@ -540,8 +534,6 @@ Remove all elements and reset offset.
 
 void
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -567,7 +559,7 @@ Time O(1), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/queue/queue.ts:903](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L903)
+Defined in: [data-structures/queue/queue.ts:468](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L468)
 
 Deep clone this queue and its parameters.
 
@@ -577,8 +569,6 @@ Deep clone this queue and its parameters.
 
 A new queue with the same content and options.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -606,7 +596,7 @@ Time O(N), Space O(N)
 compact(): boolean;
 ```
 
-Defined in: [data-structures/queue/queue.ts:819](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L819)
+Defined in: [data-structures/queue/queue.ts:430](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L430)
 
 Compact storage by discarding consumed head elements.
 
@@ -616,8 +606,6 @@ Compact storage by discarding consumed head elements.
 
 True when compaction performed.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -641,7 +629,7 @@ Time O(N), Space O(N)
 concat(...items): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:165](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L165)
+Defined in: [data-structures/base/linear-base.ts:161](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L161)
 
 Concatenate elements and/or containers.
 
@@ -675,7 +663,7 @@ Time O(sum(length)), Space O(sum(length))
 delete(element): boolean;
 ```
 
-Defined in: [data-structures/queue/queue.ts:575](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L575)
+Defined in: [data-structures/queue/queue.ts:311](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L311)
 
 Delete the first occurrence of a specific element.
 
@@ -693,8 +681,6 @@ Element to remove (strict equality via Object.is).
 
 True if an element was removed.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -720,7 +706,7 @@ Time O(N), Space O(1)
 deleteAt(index): E | undefined;
 ```
 
-Defined in: [data-structures/queue/queue.ts:648](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L648)
+Defined in: [data-structures/queue/queue.ts:343](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L343)
 
 Delete the element at a given index.
 
@@ -754,7 +740,7 @@ Time O(N), Space O(1)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/queue/queue.ts:689](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L689)
+Defined in: [data-structures/queue/queue.ts:382](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L382)
 
 Delete the first element that satisfies a predicate.
 
@@ -784,7 +770,7 @@ Time O(N), Space O(N)
 entries(): IterableIterator<[number, E]>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L208)
+Defined in: [data-structures/base/iterable-element-base.ts:207](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L207)
 
 Return an iterator of `[index, value]` pairs (Array-compatible).
 
@@ -851,7 +837,7 @@ fill(
    end?): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:292](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L292)
+Defined in: [data-structures/base/linear-base.ts:279](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L279)
 
 Fill a range with a value.
 
@@ -897,7 +883,7 @@ Time O(n), Space O(1)
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/queue/queue.ts:963](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L963)
+Defined in: [data-structures/queue/queue.ts:487](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L487)
 
 Filter elements into a new queue of the same class.
 
@@ -921,8 +907,6 @@ Value for `this` inside the predicate.
 
 A new queue with kept elements.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -1038,7 +1022,7 @@ Time O(n) in the worst case; may exit early on the first match. Space O(1).
 findIndex(predicate, thisArg?): number;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:151](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L151)
+Defined in: [data-structures/base/linear-base.ts:147](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L147)
 
 Find the first index matching a predicate.
 
@@ -1118,7 +1102,7 @@ Time O(n), Space O(1).
 has(element): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:189](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L189)
+Defined in: [data-structures/base/iterable-element-base.ts:188](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L188)
 
 Checks whether a strictly-equal element exists in the structure.
 
@@ -1152,7 +1136,7 @@ Time O(n) in the worst case. Space O(1).
 includes(element): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L200)
+Defined in: [data-structures/base/iterable-element-base.ts:199](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L199)
 
 Check whether a value exists (Array-compatible alias for `has`).
 
@@ -1226,7 +1210,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/queue/queue.ts:369](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L369)
+Defined in: [data-structures/queue/queue.ts:232](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L232)
 
 Check whether the queue is empty.
 
@@ -1236,8 +1220,6 @@ Check whether the queue is empty.
 
 True if length is 0.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1276,7 +1258,7 @@ Time O(1), Space O(1)
 join(separator?): string;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L228)
+Defined in: [data-structures/base/linear-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L218)
 
 Join all elements into a string.
 
@@ -1310,7 +1292,7 @@ Time O(n), Space O(n)
 keys(): IterableIterator<number>;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L219)
+Defined in: [data-structures/base/iterable-element-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L218)
 
 Return an iterator of numeric indices (Array-compatible).
 
@@ -1334,7 +1316,7 @@ Provided for familiarity when migrating from Array. Time O(n), Space O(1) per st
 lastIndexOf(searchElement, fromIndex?): number;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:131](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L131)
+Defined in: [data-structures/base/linear-base.ts:129](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L129)
 
 Last index of a value from the right.
 
@@ -1377,7 +1359,7 @@ map<EM, RM>(
 thisArg?): Queue<EM, RM>;
 ```
 
-Defined in: [data-structures/queue/queue.ts:1029](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L1029)
+Defined in: [data-structures/queue/queue.ts:513](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L513)
 
 Map each element to a new element in a possibly different-typed queue.
 
@@ -1417,8 +1399,6 @@ Value for `this` inside the callback.
 
 A new Queue with mapped elements.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -1444,7 +1424,7 @@ Time O(N), Space O(N)
 mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/queue/queue.ts:1052](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L1052)
+Defined in: [data-structures/queue/queue.ts:535](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L535)
 
 Map each element to a new value of the same type.
 
@@ -1484,7 +1464,7 @@ Time O(N), Space O(N)
 peek(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/queue.ts:277](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L277)
+Defined in: [data-structures/queue/queue.ts:205](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L205)
 
 Peek at the front element without removing it (alias for `first`).
 
@@ -1506,7 +1486,7 @@ Time O(1), Space O(1)
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:301](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L301)
+Defined in: [data-structures/base/iterable-element-base.ts:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L298)
 
 Prints `toVisual()` to the console. Intended for quick debugging.
 
@@ -1532,7 +1512,7 @@ Time O(n) due to materialization, Space O(n) for the intermediate representation
 push(element): boolean;
 ```
 
-Defined in: [data-structures/queue/queue.ts:432](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L432)
+Defined in: [data-structures/queue/queue.ts:252](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L252)
 
 Enqueue one element at the back.
 
@@ -1550,8 +1530,6 @@ Element to enqueue.
 
 True on success.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1582,7 +1560,7 @@ Time O(1), Space O(1)
 pushMany(elements): boolean[];
 ```
 
-Defined in: [data-structures/queue/queue.ts:445](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L445)
+Defined in: [data-structures/queue/queue.ts:264](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L264)
 
 Enqueue many elements from an iterable.
 
@@ -1648,7 +1626,7 @@ Time O(n), Space O(1). Throws if called on an empty structure without `initialVa
 reduce(callbackfn): E;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
+Defined in: [data-structures/base/iterable-element-base.ts:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L225)
 
 ##### Parameters
 
@@ -1670,7 +1648,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.c
 reduce(callbackfn, initialValue): E;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
+Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
 
 ##### Parameters
 
@@ -1696,7 +1674,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.c
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L228)
+Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
 
 ##### Type Parameters
 
@@ -1730,7 +1708,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.c
 reduceRight<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:256](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L256)
+Defined in: [data-structures/base/linear-base.ts:245](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L245)
 
 Right-to-left reduction over elements.
 
@@ -1776,7 +1754,7 @@ Time O(n), Space O(1)
 reverse(): this;
 ```
 
-Defined in: [data-structures/queue/queue.ts:705](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L705)
+Defined in: [data-structures/queue/queue.ts:397](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L397)
 
 Reverse the queue in-place by compacting then reversing.
 
@@ -1802,7 +1780,7 @@ Time O(N), Space O(N)
 setAt(index, newElement): boolean;
 ```
 
-Defined in: [data-structures/queue/queue.ts:677](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L677)
+Defined in: [data-structures/queue/queue.ts:370](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L370)
 
 Replace the element at a given index.
 
@@ -1842,7 +1820,7 @@ Time O(1), Space O(1)
 shift(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/queue.ts:516](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L516)
+Defined in: [data-structures/queue/queue.ts:292](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L292)
 
 Dequeue one element from the front (amortized via offset).
 
@@ -1852,8 +1830,6 @@ Dequeue one element from the front (amortized via offset).
 
 Removed element or undefined.
 
- *
-
 #### Remarks
 
 Time O(1) amortized, Space O(1)
@@ -1884,7 +1860,7 @@ Time O(1) amortized, Space O(1)
 slice(start?, end?): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:273](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L273)
+Defined in: [data-structures/base/linear-base.ts:261](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L261)
 
 Create a shallow copy of a subrange.
 
@@ -1964,7 +1940,7 @@ Time O(n) in the worst case; may exit early on first success. Space O(1).
 sort(compareFn?): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:185](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L185)
+Defined in: [data-structures/base/linear-base.ts:179](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L179)
 
 In-place stable order via array sort semantics.
 
@@ -2001,7 +1977,7 @@ splice(
    items?): this;
 ```
 
-Defined in: [data-structures/queue/queue.ts:834](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L834)
+Defined in: [data-structures/queue/queue.ts:444](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L444)
 
 Remove and/or insert elements at a position (array-like).
 
@@ -2047,7 +2023,7 @@ Time O(N + M), Space O(M)
 toArray(): E[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L278)
+Defined in: [data-structures/base/iterable-element-base.ts:275](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L275)
 
 Materializes the elements into a new array.
 
@@ -2073,7 +2049,7 @@ Time O(n), Space O(n).
 toReversed(): this;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:335](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L335)
+Defined in: [data-structures/base/linear-base.ts:319](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L319)
 
 Return a new instance of the same type with elements in reverse order (non-mutating).
 
@@ -2099,7 +2075,7 @@ Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O
 toReversedArray(): E[];
 ```
 
-Defined in: [data-structures/base/linear-base.ts:237](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L237)
+Defined in: [data-structures/base/linear-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L227)
 
 Snapshot elements into a reversed array.
 
@@ -2125,7 +2101,7 @@ Time O(n), Space O(n)
 toVisual(): E[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L290)
+Defined in: [data-structures/base/iterable-element-base.ts:287](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L287)
 
 Returns a representation of the structure suitable for quick visualization.
 Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -2178,7 +2154,7 @@ Creating the iterator is O(1); full iteration is Time O(n), Space O(1).
 static fromArray<E>(elements): Queue<E>;
 ```
 
-Defined in: [data-structures/queue/queue.ts:299](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L299)
+Defined in: [data-structures/queue/queue.ts:196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L196)
 
 Create a queue from an array of elements.
 
@@ -2247,7 +2223,7 @@ Time O(1), Space O(1).
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/queue/queue.ts:1112](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L1112)
+Defined in: [data-structures/queue/queue.ts:591](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L591)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -2281,7 +2257,7 @@ Time O(1), Space O(1)
 protected _createLike<EM, RM>(elements?, options?): Queue<EM, RM>;
 ```
 
-Defined in: [data-structures/queue/queue.ts:1127](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L1127)
+Defined in: [data-structures/queue/queue.ts:605](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L605)
 
 (Protected) Create a like-kind queue and seed it from an iterable.
 
@@ -2327,7 +2303,7 @@ Time O(N), Space O(N)
 protected _getIterator(): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/queue/queue.ts:1088](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L1088)
+Defined in: [data-structures/queue/queue.ts:569](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L569)
 
 (Protected) Iterate elements from front to back.
 
@@ -2353,7 +2329,7 @@ Time O(N), Space O(1)
 protected _getReverseIterator(): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/queue/queue.ts:1098](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L1098)
+Defined in: [data-structures/queue/queue.ts:578](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L578)
 
 (Protected) Iterate elements from back to front.
 
@@ -2379,7 +2355,7 @@ Time O(N), Space O(1)
 protected _setAutoCompactRatio(value): void;
 ```
 
-Defined in: [data-structures/queue/queue.ts:1078](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L1078)
+Defined in: [data-structures/queue/queue.ts:560](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/queue.ts#L560)
 
 (Protected) Set the internal auto-compaction ratio.