data-structure-typed 2.5.3 → 2.6.1

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

@@ -317,10 +317,12 @@ Bucket capacity per bucket.
 get first(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/deque.ts:332](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L332)
+Defined in: [data-structures/queue/deque.ts:335](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L335)
 
 Deque peek at both ends
 
+ *
+
 ##### Example
 
 ```ts
@@ -377,7 +379,7 @@ Zero-based index within the first bucket.
 get last(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/deque.ts:387](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L387)
+Defined in: [data-structures/queue/deque.ts:393](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L393)
 
 Get the last element without removing it.
 
@@ -555,7 +557,7 @@ addAt(
    num?): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:937](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L937)
+Defined in: [data-structures/queue/deque.ts:964](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L964)
 
 Insert repeated copies of an element at a position.
 
@@ -601,7 +603,7 @@ Time O(N), Space O(1)
 at(pos): E | undefined;
 ```
 
-Defined in: [data-structures/queue/deque.ts:907](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L907)
+Defined in: [data-structures/queue/deque.ts:934](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L934)
 
 Get the element at a given position.
 
@@ -646,7 +648,7 @@ Time O(1), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/queue/deque.ts:852](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L852)
+Defined in: [data-structures/queue/deque.ts:876](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L876)
 
 Remove all elements and reset structure.
 
@@ -683,7 +685,7 @@ Time O(1), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1435)
+Defined in: [data-structures/queue/deque.ts:1531](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1531)
 
 Deep clone this deque, preserving options.
 
@@ -722,7 +724,7 @@ Time O(N), Space O(N)
 compact(): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1357](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1357)
+Defined in: [data-structures/queue/deque.ts:1450](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1450)
 
 Compact the deque by removing unused buckets.
 
@@ -791,7 +793,7 @@ Time O(sum(length)), Space O(sum(length))
 cut(pos, isCutSelf?): Deque<E>;
 ```
 
-Defined in: [data-structures/queue/deque.ts:965](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L965)
+Defined in: [data-structures/queue/deque.ts:992](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L992)
 
 Cut the deque to keep items up to index; optionally mutate in-place.
 
@@ -827,7 +829,7 @@ Time O(N), Space O(1)
 cutRest(pos, isCutSelf?): Deque<E>;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1032](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1032)
+Defined in: [data-structures/queue/deque.ts:1059](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1059)
 
 Cut the deque to keep items from index onward; optionally mutate in-place.
 
@@ -863,7 +865,7 @@ Time O(N), Space O(1)
 delete(element): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1135)
+Defined in: [data-structures/queue/deque.ts:1165](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1165)
 
 Delete the first occurrence of a value.
 
@@ -908,7 +910,7 @@ Time O(N), Space O(1)
 deleteAt(pos): E | undefined;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1061](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1061)
+Defined in: [data-structures/queue/deque.ts:1088](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1088)
 
 Delete the element at a given position.
 
@@ -942,7 +944,7 @@ Time O(N), Space O(1)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1159](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1159)
+Defined in: [data-structures/queue/deque.ts:1189](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1189)
 
 Delete the first element matching a predicate.
 
@@ -966,6 +968,30 @@ Time O(N), Space O(1)
 
 ***
 
+### entries()
+
+```ts
+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)
+
+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
+
+[`LinearBase`](LinearBase.md).[`entries`](LinearBase.md#entries)
+
+***
+
 ### every()
 
 ```ts
@@ -1061,7 +1087,7 @@ Time O(n), Space O(1)
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1493](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1493)
+Defined in: [data-structures/queue/deque.ts:1592](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1592)
 
 Filter elements into a new deque of the same class.
 
@@ -1236,6 +1262,86 @@ Time O(n), Space O(1)
 
 ***
 
+### findLast()
+
+```ts
+findLast(predicate): E | undefined;
+```
+
+Defined in: [data-structures/queue/deque.ts:1286](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1286)
+
+Find the last value matching a predicate (scans back-to-front).
+
+#### Parameters
+
+##### predicate
+
+(`value`, `index`, `deque`) => `boolean`
+
+Function called with (value, index, deque).
+
+#### Returns
+
+`E` \| `undefined`
+
+Matching value or undefined.
+ *
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+
+#### Example
+
+```ts
+// Find last matching value
+ const d = new Deque([1, 2, 3, 4, 5]);
+    console.log(d.findLast(v => v > 2)); // 5;
+    console.log(d.findLast(v => v % 2 === 0)); // 4;
+```
+
+***
+
+### findLastIndex()
+
+```ts
+findLastIndex(predicate): number;
+```
+
+Defined in: [data-structures/queue/deque.ts:1305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1305)
+
+Find the index of the last value matching a predicate (scans back-to-front).
+
+#### Parameters
+
+##### predicate
+
+(`value`, `index`, `deque`) => `boolean`
+
+Function called with (value, index, deque).
+
+#### Returns
+
+`number`
+
+Matching index, or -1 if not found.
+ *
+
+#### Remarks
+
+Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+
+#### Example
+
+```ts
+// Find last matching index
+ const d = new Deque([10, 20, 30, 20, 10]);
+    console.log(d.findLastIndex(v => v === 20)); // 3;
+    console.log(d.findLastIndex(v => v === 10)); // 4;
+```
+
+***
+
 ### forEach()
 
 ```ts
@@ -1310,6 +1416,40 @@ Time O(n) in the worst case. Space O(1).
 
 ***
 
+### includes()
+
+```ts
+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)
+
+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
+
+[`LinearBase`](LinearBase.md).[`includes`](LinearBase.md#includes)
+
+***
+
 ### indexOf()
 
 ```ts
@@ -1356,7 +1496,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:800](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L800)
+Defined in: [data-structures/queue/deque.ts:821](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L821)
 
 Check whether the deque is empty.
 
@@ -1420,6 +1560,30 @@ Time O(n), Space O(n)
 
 ***
 
+### keys()
+
+```ts
+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)
+
+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
+
+[`LinearBase`](LinearBase.md).[`keys`](LinearBase.md#keys)
+
+***
+
 ### lastIndexOf()
 
 ```ts
@@ -1469,7 +1633,7 @@ map<EM, RM>(
 thisArg?): Deque<EM, RM>;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1575](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1575)
+Defined in: [data-structures/queue/deque.ts:1677](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1677)
 
 Map elements into a new deque (possibly different element type).
 
@@ -1536,7 +1700,7 @@ Time O(N), Space O(N)
 mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1512](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1512)
+Defined in: [data-structures/queue/deque.ts:1611](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1611)
 
 Map elements into a new deque of the same element type.
 
@@ -1598,7 +1762,7 @@ Time O(1), Space O(1)
 pop(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/deque.ts:547](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L547)
+Defined in: [data-structures/queue/deque.ts:559](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L559)
 
 Remove and return the last element.
 
@@ -1631,7 +1795,7 @@ Time O(1), Space O(1)
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L269)
+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)
 
 Prints `toVisual()` to the console. Intended for quick debugging.
 
@@ -1657,7 +1821,7 @@ Time O(n) due to materialization, Space O(n) for the intermediate representation
 push(element): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:478](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L478)
+Defined in: [data-structures/queue/deque.ts:487](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L487)
 
 Append one element at the back.
 
@@ -1715,7 +1879,7 @@ Time O(1) amortized, Space O(1)
 pushMany(elements): boolean[];
 ```
 
-Defined in: [data-structures/queue/deque.ts:722](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L722)
+Defined in: [data-structures/queue/deque.ts:740](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L740)
 
 Append a sequence of elements.
 
@@ -1781,7 +1945,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:194](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L194)
+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
 
@@ -1803,7 +1967,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:194](https://github.c
 reduce(callbackfn, initialValue): E;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L195)
+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)
 
 ##### Parameters
 
@@ -1829,7 +1993,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:195](https://github.c
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L196)
+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)
 
 ##### Type Parameters
 
@@ -1909,21 +2073,15 @@ Time O(n), Space O(1)
 reverse(): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1245](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1245)
+Defined in: [data-structures/queue/deque.ts:1335](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1335)
 
-Reverse the deque by reversing buckets and pointers.
-
-#### Returns
-
-`this`
-
-This deque.
+Deque for...of iteration and reverse
 
  *
 
-#### Remarks
+#### Returns
 
-Time O(N), Space O(N)
+`this`
 
 #### Example
 
@@ -1959,7 +2117,7 @@ Time O(N), Space O(N)
 setAt(pos, element): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:921](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L921)
+Defined in: [data-structures/queue/deque.ts:948](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L948)
 
 Replace the element at a given position.
 
@@ -1999,7 +2157,7 @@ Time O(1), Space O(1)
 setEquality(equals): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1177](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1177)
+Defined in: [data-structures/queue/deque.ts:1207](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1207)
 
 Set the equality comparator used by delete operations.
 
@@ -2029,7 +2187,7 @@ Time O(1), Space O(1)
 shift(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/deque.ts:616](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L616)
+Defined in: [data-structures/queue/deque.ts:631](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L631)
 
 Remove and return the first element.
 
@@ -2179,7 +2337,7 @@ splice(
    items?): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:997](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L997)
+Defined in: [data-structures/queue/deque.ts:1024](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1024)
 
 Remove and/or insert elements at a position (array-like behavior).
 
@@ -2225,7 +2383,7 @@ Time O(N + M), Space O(M)
 toArray(): E[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:246](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L246)
+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)
 
 Materializes the elements into a new array.
 
@@ -2245,6 +2403,32 @@ Time O(n), Space O(n).
 
 ***
 
+### toReversed()
+
+```ts
+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)
+
+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
+
+[`LinearBase`](LinearBase.md).[`toReversed`](LinearBase.md#toreversed)
+
+***
+
 ### toReversedArray()
 
 ```ts
@@ -2277,7 +2461,7 @@ Time O(n), Space O(n)
 toVisual(): E[];
 ```
 
-Defined in: [data-structures/base/iterable-element-base.ts:258](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L258)
+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)
 
 Returns a representation of the structure suitable for quick visualization.
 Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -2304,7 +2488,7 @@ Time O(n), Space O(n).
 unique(): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1263](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1263)
+Defined in: [data-structures/queue/deque.ts:1353](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1353)
 
 Deduplicate consecutive equal elements in-place.
 
@@ -2326,7 +2510,7 @@ Time O(N), Space O(1)
 unshift(element): boolean;
 ```
 
-Defined in: [data-structures/queue/deque.ts:696](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L696)
+Defined in: [data-structures/queue/deque.ts:714](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L714)
 
 Prepend one element at the front.
 
@@ -2377,7 +2561,7 @@ Time O(1) amortized, Space O(1)
 unshiftMany(elements?): boolean[];
 ```
 
-Defined in: [data-structures/queue/deque.ts:741](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L741)
+Defined in: [data-structures/queue/deque.ts:759](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L759)
 
 Prepend a sequence of elements.
 
@@ -2436,7 +2620,7 @@ static fromArray<E, R>(
    options?): any;
 ```
 
-Defined in: [data-structures/queue/deque.ts:403](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L403)
+Defined in: [data-structures/queue/deque.ts:409](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L409)
 
 Create a Deque from an array of elements.
 
@@ -2534,7 +2718,7 @@ Time O(1), Space O(1).
 protected _autoCompact(): void;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1291](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1291)
+Defined in: [data-structures/queue/deque.ts:1381](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1381)
 
 (Protected) Trigger auto-compaction if space utilization drops below threshold.
 Only checks every `_bucketSize` operations to minimize hot-path overhead.
@@ -2552,7 +2736,7 @@ Uses element-based ratio: `elements / (bucketCount * bucketSize)`.
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1690](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1690)
+Defined in: [data-structures/queue/deque.ts:1792](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1792)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -2586,7 +2770,7 @@ Time O(1), Space O(1)
 protected _createLike<T, RR>(elements?, options?): Deque<T, RR>;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1708](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1708)
+Defined in: [data-structures/queue/deque.ts:1810](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1810)
 
 (Protected) Create a like-kind deque seeded by elements.
 
@@ -2632,7 +2816,7 @@ Time O(N), Space O(N)
 protected _getBucketAndPosition(pos): object;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1664](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1664)
+Defined in: [data-structures/queue/deque.ts:1766](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1766)
 
 (Protected) Translate a logical position to bucket/offset.
 
@@ -2674,7 +2858,7 @@ Time O(1), Space O(1)
 protected _getIterator(): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1621](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1621)
+Defined in: [data-structures/queue/deque.ts:1723](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1723)
 
 (Protected) Iterate elements from front to back.
 
@@ -2700,7 +2884,7 @@ Time O(N), Space O(1)
 protected _getReverseIterator(): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1725](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1725)
+Defined in: [data-structures/queue/deque.ts:1827](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1827)
 
 (Protected) Iterate elements from back to front.
 
@@ -2726,7 +2910,7 @@ Time O(N), Space O(1)
 protected _reallocate(needBucketNum?): void;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1635](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1635)
+Defined in: [data-structures/queue/deque.ts:1737](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1737)
 
 (Protected) Reallocate buckets to make room near the ends.
 
@@ -2756,7 +2940,7 @@ Time O(N), Space O(N)
 protected _setBucketSize(size): void;
 ```
 
-Defined in: [data-structures/queue/deque.ts:1601](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1601)
+Defined in: [data-structures/queue/deque.ts:1703](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1703)
 
 (Protected) Set the internal bucket size.