data-structure-typed 2.6.0 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: Deque\<E, R\>
 
-Defined in: [data-structures/queue/deque.ts:85](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L85)
+Defined in: [data-structures/queue/deque.ts:84](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L84)
 
 Deque implemented with circular buckets allowing O(1) amortized push/pop at both ends.
 
@@ -103,7 +103,7 @@ Time O(1), Space O(1)
 new Deque<E, R>(elements?, options?): Deque<E, R>;
 ```
 
-Defined in: [data-structures/queue/deque.ts:96](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L96)
+Defined in: [data-structures/queue/deque.ts:98](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L98)
 
 Create a Deque and optionally bulk-insert elements.
 
@@ -145,7 +145,7 @@ Time O(N), Space O(N)
 get autoCompactRatio(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:145](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L145)
+Defined in: [data-structures/queue/deque.ts:148](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L148)
 
 Get the auto-compaction ratio.
 When `elements / (bucketCount * bucketSize)` drops below this ratio after
@@ -167,7 +167,7 @@ Current ratio threshold. 0 means auto-compact is disabled.
 set autoCompactRatio(value): void;
 ```
 
-Defined in: [data-structures/queue/deque.ts:154](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L154)
+Defined in: [data-structures/queue/deque.ts:157](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L157)
 
 Set the auto-compaction ratio.
 
@@ -197,7 +197,7 @@ Ratio in [0,1]. 0 disables auto-compact.
 get bucketCount(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:220](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L220)
+Defined in: [data-structures/queue/deque.ts:212](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L212)
 
 Get the number of buckets allocated.
 
@@ -221,7 +221,7 @@ Bucket count.
 get bucketFirst(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:172](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L172)
+Defined in: [data-structures/queue/deque.ts:168](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L168)
 
 Get the index of the first bucket in use.
 
@@ -245,7 +245,7 @@ Zero-based bucket index.
 get bucketLast(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:196](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L196)
+Defined in: [data-structures/queue/deque.ts:190](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L190)
 
 Get the index of the last bucket in use.
 
@@ -269,7 +269,7 @@ Zero-based bucket index.
 get buckets(): E[][];
 ```
 
-Defined in: [data-structures/queue/deque.ts:232](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L232)
+Defined in: [data-structures/queue/deque.ts:223](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L223)
 
 Get the internal buckets array.
 
@@ -293,7 +293,7 @@ Array of buckets storing values.
 get bucketSize(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:132](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L132)
+Defined in: [data-structures/queue/deque.ts:135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L135)
 
 Get the current bucket size.
 
@@ -317,7 +317,7 @@ 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:255](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L255)
 
 Deque peek at both ends
 
@@ -353,7 +353,7 @@ Deque peek at both ends
 get firstInBucket(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:184](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L184)
+Defined in: [data-structures/queue/deque.ts:179](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L179)
 
 Get the index inside the first bucket.
 
@@ -377,7 +377,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:270](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L270)
 
 Get the last element without removing it.
 
@@ -400,8 +400,6 @@ Time O(1), Space O(1)
 
 Last element or undefined.
 
- *
-
 ***
 
 ### lastInBucket
@@ -412,7 +410,7 @@ Last element or undefined.
 get lastInBucket(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L208)
+Defined in: [data-structures/queue/deque.ts:201](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L201)
 
 Get the index inside the last bucket.
 
@@ -436,7 +434,7 @@ Zero-based index within the last bucket.
 get length(): number;
 ```
 
-Defined in: [data-structures/queue/deque.ts:244](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L244)
+Defined in: [data-structures/queue/deque.ts:234](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L234)
 
 Get the number of elements in the deque.
 
@@ -555,7 +553,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:570](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L570)
 
 Insert repeated copies of an element at a position.
 
@@ -601,7 +599,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:542](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L542)
 
 Get the element at a given position.
 
@@ -619,8 +617,6 @@ Zero-based position from the front.
 
 Element or undefined.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -646,7 +642,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:524](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L524)
 
 Remove all elements and reset structure.
 
@@ -656,8 +652,6 @@ Remove all elements and reset structure.
 
 void
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -683,7 +677,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:934](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L934)
 
 Deep clone this deque, preserving options.
 
@@ -693,8 +687,6 @@ Deep clone this deque, preserving options.
 
 A new deque with the same content and options.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -722,7 +714,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:894](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L894)
 
 Compact the deque by removing unused buckets.
 
@@ -732,8 +724,6 @@ Compact the deque by removing unused buckets.
 
 True if compaction was performed (bucket count reduced).
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -757,7 +747,7 @@ Time O(N), Space O(1)
 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.
 
@@ -791,7 +781,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:597](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L597)
 
 Cut the deque to keep items up to index; optionally mutate in-place.
 
@@ -827,7 +817,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:655](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L655)
 
 Cut the deque to keep items from index onward; optionally mutate in-place.
 
@@ -863,7 +853,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:717](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L717)
 
 Delete the first occurrence of a value.
 
@@ -881,8 +871,6 @@ Element to remove (using the configured equality).
 
 True if an element was removed.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(1)
@@ -908,7 +896,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:683](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L683)
 
 Delete the element at a given position.
 
@@ -942,7 +930,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:740](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L740)
 
 Delete the first element matching a predicate.
 
@@ -966,6 +954,30 @@ Time O(N), Space O(1)
 
 ***
 
+### entries()
+
+```ts
+entries(): IterableIterator<[number, E]>;
+```
+
+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).
+
+#### 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
@@ -1015,7 +1027,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.
 
@@ -1061,7 +1073,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:954](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L954)
 
 Filter elements into a new deque of the same class.
 
@@ -1085,8 +1097,6 @@ Value for `this` inside the predicate.
 
 A new deque with kept elements.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -1202,7 +1212,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.
 
@@ -1236,6 +1246,84 @@ Time O(n), Space O(1)
 
 ***
 
+### findLast()
+
+```ts
+findLast(predicate): E | undefined;
+```
+
+Defined in: [data-structures/queue/deque.ts:796](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L796)
+
+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:815](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L815)
+
+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
@@ -1282,7 +1370,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.
 
@@ -1310,6 +1398,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: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`).
+
+#### 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 +1478,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:510](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L510)
 
 Check whether the deque is empty.
 
@@ -1366,8 +1488,6 @@ Check whether the deque is empty.
 
 True if length is 0.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1392,7 +1512,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.
 
@@ -1420,13 +1540,37 @@ Time O(n), Space O(n)
 
 ***
 
+### keys()
+
+```ts
+keys(): IterableIterator<number>;
+```
+
+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).
+
+#### 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
 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.
 
@@ -1469,7 +1613,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:998](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L998)
 
 Map elements into a new deque (possibly different element type).
 
@@ -1509,8 +1653,6 @@ Value for `this` inside the callback.
 
 A new Deque with mapped elements.
 
- *
-
 #### Remarks
 
 Time O(N), Space O(N)
@@ -1536,7 +1678,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:972](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L972)
 
 Map elements into a new deque of the same element type.
 
@@ -1576,7 +1718,7 @@ Time O(N), Space O(N)
 peek(): E | undefined;
 ```
 
-Defined in: [data-structures/queue/deque.ts:311](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L311)
+Defined in: [data-structures/queue/deque.ts:320](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L320)
 
 Peek at the front element without removing it (alias for `first`).
 
@@ -1598,7 +1740,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:377](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L377)
 
 Remove and return the last element.
 
@@ -1608,8 +1750,6 @@ Remove and return the last element.
 
 Removed element or undefined.
 
- *
-
 #### Remarks
 
 Time O(1), Space O(1)
@@ -1631,7 +1771,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: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.
 
@@ -1657,7 +1797,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:348](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L348)
 
 Append one element at the back.
 
@@ -1675,8 +1815,6 @@ Element to append.
 
 True when appended.
 
- *
-
 #### Remarks
 
 Time O(1) amortized, Space O(1)
@@ -1715,7 +1853,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:471](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L471)
 
 Append a sequence of elements.
 
@@ -1781,7 +1919,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:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L225)
 
 ##### Parameters
 
@@ -1803,7 +1941,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:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
 
 ##### Parameters
 
@@ -1829,7 +1967,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:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
 
 ##### Type Parameters
 
@@ -1863,7 +2001,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:196](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.
 
@@ -1909,22 +2047,14 @@ 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:843](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L843)
 
-Reverse the deque by reversing buckets and pointers.
+Deque for...of iteration and reverse
 
 #### Returns
 
 `this`
 
-This deque.
-
- *
-
-#### Remarks
-
-Time O(N), Space O(N)
-
 #### Example
 
 ```ts
@@ -1959,7 +2089,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:555](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L555)
 
 Replace the element at a given position.
 
@@ -1999,7 +2129,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:757](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L757)
 
 Set the equality comparator used by delete operations.
 
@@ -2029,7 +2159,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:406](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L406)
 
 Remove and return the first element.
 
@@ -2039,8 +2169,6 @@ Remove and return the first element.
 
 Removed element or undefined.
 
- *
-
 #### Remarks
 
 Time O(1) amortized, Space O(1)
@@ -2062,7 +2190,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.
 
@@ -2142,7 +2270,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.
 
@@ -2179,7 +2307,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:627](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L627)
 
 Remove and/or insert elements at a position (array-like behavior).
 
@@ -2225,7 +2353,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: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.
 
@@ -2245,13 +2373,39 @@ Time O(n), Space O(n).
 
 ***
 
+### toReversed()
+
+```ts
+toReversed(): this;
+```
+
+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).
+
+#### 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
 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.
 
@@ -2277,7 +2431,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: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.
@@ -2304,7 +2458,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:860](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L860)
 
 Deduplicate consecutive equal elements in-place.
 
@@ -2326,7 +2480,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:446](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L446)
 
 Prepend one element at the front.
 
@@ -2344,8 +2498,6 @@ Element to prepend.
 
 True when prepended.
 
- *
-
 #### Remarks
 
 Time O(1) amortized, Space O(1)
@@ -2377,7 +2529,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:489](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L489)
 
 Prepend a sequence of elements.
 
@@ -2436,7 +2588,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:285](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L285)
 
 Create a Deque from an array of elements.
 
@@ -2491,7 +2643,7 @@ Time O(N), Space O(N)
 protected _compactCounter: number = 0;
 ```
 
-Defined in: [data-structures/queue/deque.ts:162](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L162)
+Defined in: [data-structures/queue/deque.ts:89](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L89)
 
 Counter for shift/pop operations since last compaction check.
 Only checks ratio every `_bucketSize` operations to minimize overhead.
@@ -2534,7 +2686,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:1029](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1029)
 
 (Protected) Trigger auto-compaction if space utilization drops below threshold.
 Only checks every `_bucketSize` operations to minimize hot-path overhead.
@@ -2552,7 +2704,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:1126](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1126)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -2586,7 +2738,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:1143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1143)
 
 (Protected) Create a like-kind deque seeded by elements.
 
@@ -2632,7 +2784,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:1105](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1105)
 
 (Protected) Translate a logical position to bucket/offset.
 
@@ -2674,7 +2826,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:1064](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1064)
 
 (Protected) Iterate elements from front to back.
 
@@ -2700,7 +2852,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:1159](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1159)
 
 (Protected) Iterate elements from back to front.
 
@@ -2726,7 +2878,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:1077](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1077)
 
 (Protected) Reallocate buckets to make room near the ends.
 
@@ -2756,7 +2908,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:1046](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/queue/deque.ts#L1046)
 
 (Protected) Set the internal bucket size.