data-structure-typed 2.5.3 → 2.6.1

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

@@ -107,7 +107,7 @@ Time O(n) to iterate, Space O(1)
 ceiling(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:831](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L831)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:867](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L867)
 
 Least entry ≥ key, or `undefined`.
 
@@ -140,7 +140,7 @@ Least entry ≥ key, or `undefined`.
 clear(): void;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:229](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L229)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:235](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L235)
 
 Remove all entries
 
@@ -171,7 +171,7 @@ Remove all entries
 clone(): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:280](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L280)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:289](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L289)
 
 Create independent copy
 
@@ -203,7 +203,7 @@ Create independent copy
 delete(key): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:553](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L553)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:574](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L574)
 
 Delete a key. Returns `true` if the key was found and removed.
 
@@ -309,7 +309,7 @@ Time O(n), Space O(1)
 filter(callbackfn, thisArg?): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1201](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1201)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1255](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1255)
 
 Creates a new SkipList with entries that pass the predicate.
 
@@ -390,7 +390,7 @@ Time O(n), Space O(1)
 first(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:621](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L621)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:645](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L645)
 
 Returns the first (smallest key) entry, or `undefined` if empty.
 
@@ -416,7 +416,7 @@ Returns the first (smallest key) entry, or `undefined` if empty.
 floor(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:890](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L890)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:929](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L929)
 
 Greatest entry ≤ key, or `undefined`.
 
@@ -487,7 +487,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:442](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L442)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:457](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L457)
 
 Get the value for a key, or `undefined` if not found.
 Overrides base O(n) with O(log n) skip-list search.
@@ -540,7 +540,7 @@ Overrides base O(n) with O(log n) skip-list search.
 has(key): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:495](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L495)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:513](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L513)
 
 Check if a key exists.
 Overrides base O(n) with O(log n) skip-list search.
@@ -612,7 +612,7 @@ Time O(n), Space O(1)
 higher(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:949](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L949)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:991](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L991)
 
 Least entry strictly > key, or `undefined`.
 
@@ -645,7 +645,7 @@ Least entry strictly > key, or `undefined`.
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:181](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L181)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:184](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L184)
 
 Check if empty
 
@@ -701,7 +701,7 @@ Time O(n), Space O(1)
 last(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:672](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L672)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:699](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L699)
 
 Returns the last (largest key) entry, or `undefined` if empty.
 
@@ -727,7 +727,7 @@ Returns the last (largest key) entry, or `undefined` if empty.
 lower(key): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1005](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1005)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1050](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1050)
 
 Greatest entry strictly < key, or `undefined`.
 
@@ -760,7 +760,7 @@ Greatest entry strictly < key, or `undefined`.
 map<MK, MV>(callback, options?): SkipList<MK, MV>;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1144](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1144)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1195)
 
 Creates a new SkipList with entries transformed by callback.
 
@@ -811,7 +811,7 @@ Creates a new SkipList with entries transformed by callback.
 pollFirst(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:726](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L726)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:756](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L756)
 
 Remove and return the first (smallest key) entry.
 
@@ -838,7 +838,7 @@ Remove and return the first (smallest key) entry.
 pollLast(): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:777](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L777)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:810](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L810)
 
 Remove and return the last (largest key) entry.
 
@@ -889,7 +889,7 @@ Time O(n), Space O(n)
 rangeSearch(range, options?): [K, V | undefined][];
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1067](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1067)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1115](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1115)
 
 Returns entries within the given key range.
 
@@ -972,7 +972,7 @@ Time O(n), Space O(1)
 set(key, value): this;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:349](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L349)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:361](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L361)
 
 Insert or update a key-value pair. Returns `this` for chaining.
 Unique keys only — if key exists, value is updated in place.
@@ -1164,7 +1164,7 @@ Creates a default comparator supporting number, string, Date, and bigint.
 protected _findNode(key): SkipListNode<K, V> | undefined;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1254](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1254)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1308](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1308)
 
 Finds the node for a given key, or undefined.
 
@@ -1186,7 +1186,7 @@ Finds the node for a given key, or undefined.
 protected _findUpdate(key): SkipListNode<K, V>[];
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1236](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1236)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1290)
 
 Finds the update array (predecessors at each level) for a given key.
 
@@ -1208,7 +1208,7 @@ Finds the update array (predecessors at each level) for a given key.
 protected _getIterator(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/linked-list/skip-linked-list.ts:1220](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1220)
+Defined in: [data-structures/linked-list/skip-linked-list.ts:1274](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/linked-list/skip-linked-list.ts#L1274)
 
 Underlying iterator for the default iteration protocol.
 

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

@@ -236,7 +236,7 @@ Internal elements array.
 get size(): number;
 ```
 
-Defined in: [data-structures/stack/stack.ts:210](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L210)
+Defined in: [data-structures/stack/stack.ts:213](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L213)
 
 Get the number of stored elements.
 
@@ -330,7 +330,7 @@ Producing the iterator is O(1); consuming the entire iterator is Time O(n) with
 clear(): void;
 ```
 
-Defined in: [data-structures/stack/stack.ts:621](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L621)
+Defined in: [data-structures/stack/stack.ts:642](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L642)
 
 Remove all elements and reset storage.
 
@@ -367,7 +367,7 @@ Time O(1), Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/stack/stack.ts:675](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L675)
+Defined in: [data-structures/stack/stack.ts:699](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L699)
 
 Deep clone this stack.
 
@@ -406,7 +406,7 @@ Time O(N), Space O(N)
 delete(element): boolean;
 ```
 
-Defined in: [data-structures/stack/stack.ts:538](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L538)
+Defined in: [data-structures/stack/stack.ts:556](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L556)
 
 Delete the first occurrence of a specific element.
 
@@ -447,7 +447,7 @@ Time O(N), Space O(1)
 deleteAt(index): E | undefined;
 ```
 
-Defined in: [data-structures/stack/stack.ts:550](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L550)
+Defined in: [data-structures/stack/stack.ts:568](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L568)
 
 Delete the element at an index.
 
@@ -477,7 +477,7 @@ Time O(N), Space O(1)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/stack/stack.ts:563](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L563)
+Defined in: [data-structures/stack/stack.ts:581](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L581)
 
 Delete the first element that satisfies a predicate.
 
@@ -501,6 +501,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
+
+[`IterableElementBase`](IterableElementBase.md).[`entries`](IterableElementBase.md#entries)
+
+***
+
 ### every()
 
 ```ts
@@ -547,7 +571,7 @@ Time O(n) in the worst case; may exit early when the first failure is found. Spa
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/stack/stack.ts:731](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L731)
+Defined in: [data-structures/stack/stack.ts:758](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L758)
 
 Filter elements into a new stack of the same class.
 
@@ -756,13 +780,47 @@ 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
+
+[`IterableElementBase`](IterableElementBase.md).[`includes`](IterableElementBase.md#includes)
+
+***
+
 ### isEmpty()
 
 ```ts
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/stack/stack.ts:284](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L284)
+Defined in: [data-structures/stack/stack.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L290)
 
 Check whether the stack is empty.
 
@@ -794,6 +852,30 @@ Time O(1), Space O(1)
 
 ***
 
+### 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
+
+[`IterableElementBase`](IterableElementBase.md).[`keys`](IterableElementBase.md#keys)
+
+***
+
 ### map()
 
 ```ts
@@ -803,7 +885,7 @@ map<EM, RM>(
 thisArg?): Stack<EM, RM>;
 ```
 
-Defined in: [data-structures/stack/stack.ts:811](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L811)
+Defined in: [data-structures/stack/stack.ts:841](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L841)
 
 Map values into a new stack (possibly different element type).
 
@@ -870,7 +952,7 @@ Time O(N), Space O(N)
 mapSame(callback, thisArg?): this;
 ```
 
-Defined in: [data-structures/stack/stack.ts:749](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L749)
+Defined in: [data-structures/stack/stack.ts:776](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L776)
 
 Map values into a new stack of the same element type.
 
@@ -910,7 +992,7 @@ Time O(N), Space O(N)
 peek(): E | undefined;
 ```
 
-Defined in: [data-structures/stack/stack.ts:338](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L338)
+Defined in: [data-structures/stack/stack.ts:347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L347)
 
 Get the top element without removing it.
 
@@ -943,7 +1025,7 @@ Time O(1), Space O(1)
 pop(): E | undefined;
 ```
 
-Defined in: [data-structures/stack/stack.ts:470](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L470)
+Defined in: [data-structures/stack/stack.ts:485](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L485)
 
 Pop and return the top element.
 
@@ -989,7 +1071,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.
 
@@ -1015,7 +1097,7 @@ Time O(n) due to materialization, Space O(n) for the intermediate representation
 push(element): boolean;
 ```
 
-Defined in: [data-structures/stack/stack.ts:402](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L402)
+Defined in: [data-structures/stack/stack.ts:414](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L414)
 
 Push one element onto the top.
 
@@ -1065,7 +1147,7 @@ Time O(1), Space O(1)
 pushMany(elements): boolean[];
 ```
 
-Defined in: [data-structures/stack/stack.ts:481](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L481)
+Defined in: [data-structures/stack/stack.ts:496](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L496)
 
 Push many elements from an iterable.
 
@@ -1127,7 +1209,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
 
@@ -1149,7 +1231,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
 
@@ -1175,7 +1257,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
 
@@ -1209,7 +1291,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:196](https://github.c
 setEquality(equals): this;
 ```
 
-Defined in: [data-structures/stack/stack.ts:832](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L832)
+Defined in: [data-structures/stack/stack.ts:862](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L862)
 
 Set the equality comparator used by delete/search operations.
 
@@ -1279,7 +1361,7 @@ Time O(n) in the worst case; may exit early on first success. Space O(1).
 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.
 
@@ -1305,7 +1387,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.
@@ -1361,7 +1443,7 @@ static fromArray<E, R>(
    options?): any;
 ```
 
-Defined in: [data-structures/stack/stack.ts:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L225)
+Defined in: [data-structures/stack/stack.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L228)
 
 Create a stack from an array of elements.
 
@@ -1446,7 +1528,7 @@ Time O(1), Space O(1).
 protected _createInstance(options?): this;
 ```
 
-Defined in: [data-structures/stack/stack.ts:856](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L856)
+Defined in: [data-structures/stack/stack.ts:886](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L886)
 
 (Protected) Create an empty instance of the same concrete class.
 
@@ -1476,7 +1558,7 @@ Time O(1), Space O(1)
 protected _createLike<T, RR>(elements?, options?): Stack<T, RR>;
 ```
 
-Defined in: [data-structures/stack/stack.ts:871](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L871)
+Defined in: [data-structures/stack/stack.ts:901](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L901)
 
 (Protected) Create a like-kind stack and seed it from an iterable.
 
@@ -1522,7 +1604,7 @@ Time O(N), Space O(N)
 protected _getIterator(): IterableIterator<E>;
 ```
 
-Defined in: [data-structures/stack/stack.ts:888](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L888)
+Defined in: [data-structures/stack/stack.ts:918](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L918)
 
 (Protected) Iterate elements from bottom to top.
 
@@ -1548,7 +1630,7 @@ Time O(N), Space O(1)
 protected _indexOfByEquals(target): number;
 ```
 
-Defined in: [data-structures/stack/stack.ts:844](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L844)
+Defined in: [data-structures/stack/stack.ts:874](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L874)
 
 (Protected) Find the index of a target element using the equality function.