data-structure-typed 2.6.0 → 2.6.2

package/dist/esm/linked-list.mjs

@@ -721,7 +721,6 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   static {
     __name(this, "SinglyLinkedList");
   }
-  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -793,68 +792,26 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return list;
   }
   /**
-    * Append an element/node to the tail.
-    * @remarks Time O(1), Space O(1)
-    * @param elementOrNode - Element or node to append.
-    * @returns True when appended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // basic SinglyLinkedList creation and push operation
-  *  // Create a simple SinglyLinkedList with initial values
-  *     const list = new SinglyLinkedList([1, 2, 3, 4, 5]);
-  *
-  *     // Verify the list maintains insertion order
-  *     console.log([...list]); // [1, 2, 3, 4, 5];
-  *
-  *     // Check length
-  *     console.log(list.length); // 5;
-  *
-  *     // Push a new element to the end
-  *     list.push(6);
-  *     console.log(list.length); // 6;
-  *     console.log([...list]); // [1, 2, 3, 4, 5, 6];
-    */
+   * Append an element/node to the tail.
+   * @remarks Time O(1), Space O(1)
+   * @param elementOrNode - Element or node to append.
+   * @returns True when appended.
+   * @example
+   * // basic SinglyLinkedList creation and push operation
+   *  // Create a simple SinglyLinkedList with initial values
+   *     const list = new SinglyLinkedList([1, 2, 3, 4, 5]);
+   *
+   *     // Verify the list maintains insertion order
+   *     console.log([...list]); // [1, 2, 3, 4, 5];
+   *
+   *     // Check length
+   *     console.log(list.length); // 5;
+   *
+   *     // Push a new element to the end
+   *     list.push(6);
+   *     console.log(list.length); // 6;
+   *     console.log([...list]); // [1, 2, 3, 4, 5, 6];
+   */
   push(elementOrNode) {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -868,67 +825,25 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return true;
   }
   /**
-    * Remove and return the tail element.
-    * @remarks Time O(N), Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // SinglyLinkedList pop and shift operations
-  *  const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
-  *
-  *     // Pop removes from the end
-  *     const last = list.pop();
-  *     console.log(last); // 50;
-  *
-  *     // Shift removes from the beginning
-  *     const first = list.shift();
-  *     console.log(first); // 10;
-  *
-  *     // Verify remaining elements
-  *     console.log([...list]); // [20, 30, 40];
-  *     console.log(list.length); // 3;
-    */
+   * Remove and return the tail element.
+   * @remarks Time O(N), Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // SinglyLinkedList pop and shift operations
+   *  const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
+   *
+   *     // Pop removes from the end
+   *     const last = list.pop();
+   *     console.log(last); // 50;
+   *
+   *     // Shift removes from the beginning
+   *     const first = list.shift();
+   *     console.log(first); // 10;
+   *
+   *     // Verify remaining elements
+   *     console.log([...list]); // [20, 30, 40];
+   *     console.log(list.length); // 3;
+   */
   pop() {
     if (!this.head) return void 0;
     if (this.head === this.tail) {
@@ -947,57 +862,15 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return value;
   }
   /**
-    * Remove and return the head element.
-    * @remarks Time O(1), Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove from the front
-  *  const list = new SinglyLinkedList<number>([10, 20, 30]);
-  *     console.log(list.shift()); // 10;
-  *     console.log(list.length); // 2;
-    */
+   * Remove and return the head element.
+   * @remarks Time O(1), Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove from the front
+   *  const list = new SinglyLinkedList<number>([10, 20, 30]);
+   *     console.log(list.shift()); // 10;
+   *     console.log(list.length); // 2;
+   */
   shift() {
     if (!this.head) return void 0;
     const removed = this.head;
@@ -1007,73 +880,31 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return removed.value;
   }
   /**
-    * Prepend an element/node to the head.
-    * @remarks Time O(1), Space O(1)
-    * @param elementOrNode - Element or node to prepend.
-    * @returns True when prepended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // SinglyLinkedList unshift and forward traversal
-  *  const list = new SinglyLinkedList<number>([20, 30, 40]);
-  *
-  *     // Unshift adds to the beginning
-  *     list.unshift(10);
-  *     console.log([...list]); // [10, 20, 30, 40];
-  *
-  *     // Access elements (forward traversal only for singly linked)
-  *     const second = list.at(1);
-  *     console.log(second); // 20;
-  *
-  *     // SinglyLinkedList allows forward iteration only
-  *     const elements: number[] = [];
-  *     for (const item of list) {
-  *       elements.push(item);
-  *     }
-  *     console.log(elements); // [10, 20, 30, 40];
-  *
-  *     console.log(list.length); // 4;
-    */
+   * Prepend an element/node to the head.
+   * @remarks Time O(1), Space O(1)
+   * @param elementOrNode - Element or node to prepend.
+   * @returns True when prepended.
+   * @example
+   * // SinglyLinkedList unshift and forward traversal
+   *  const list = new SinglyLinkedList<number>([20, 30, 40]);
+   *
+   *     // Unshift adds to the beginning
+   *     list.unshift(10);
+   *     console.log([...list]); // [10, 20, 30, 40];
+   *
+   *     // Access elements (forward traversal only for singly linked)
+   *     const second = list.at(1);
+   *     console.log(second); // 20;
+   *
+   *     // SinglyLinkedList allows forward iteration only
+   *     const elements: number[] = [];
+   *     for (const item of list) {
+   *       elements.push(item);
+   *     }
+   *     console.log(elements); // [10, 20, 30, 40];
+   *
+   *     console.log(list.length); // 4;
+   */
   unshift(elementOrNode) {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -1129,59 +960,17 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return void 0;
   }
   /**
-    * Get the element at a given index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Access element by index
-  *  const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
-  *     console.log(list.at(0)); // 'a';
-  *     console.log(list.at(2)); // 'c';
-  *     console.log(list.at(3)); // 'd';
-    */
+   * Get the element at a given index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Element or undefined.
+   * @example
+   * // Access element by index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
+   *     console.log(list.at(0)); // 'a';
+   *     console.log(list.at(2)); // 'c';
+   *     console.log(list.at(3)); // 'd';
+   */
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
@@ -1198,54 +987,15 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return elementNodeOrPredicate instanceof SinglyLinkedListNode;
   }
   /**
-    * Get the node reference at a given index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Node or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Get node at index
-  *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
-  *     console.log(list.getNodeAt(1)?.value); // 'b';
-    */
+   * Get the node reference at a given index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Node or undefined.
+   * @example
+   * // Get node at index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+   *     console.log(list.getNodeAt(1)?.value); // 'b';
+   */
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
@@ -1253,55 +1003,16 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return current;
   }
   /**
-    * Delete the element at an index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove by index
-  *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
-  *     list.deleteAt(1);
-  *     console.log(list.toArray()); // ['a', 'c'];
-    */
+   * Delete the element at an index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove by index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+   *     list.deleteAt(1);
+   *     console.log(list.toArray()); // ['a', 'c'];
+   */
   deleteAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     if (index === 0) return this.shift();
@@ -1314,55 +1025,16 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return value;
   }
   /**
-    * Delete the first match by value/node.
-    * @remarks Time O(N), Space O(1)
-    * @param [elementOrNode] - Element or node to remove; if omitted/undefined, nothing happens.
-    * @returns True if removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove first occurrence
-  *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
-  *     list.delete(2);
-  *     console.log(list.toArray()); // [1, 3, 2];
-    */
+   * Delete the first match by value/node.
+   * @remarks Time O(N), Space O(1)
+   * @param [elementOrNode] - Element or node to remove; if omitted/undefined, nothing happens.
+   * @returns True if removed.
+   * @example
+   * // Remove first occurrence
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
+   *     list.delete(2);
+   *     console.log(list.toArray()); // [1, 3, 2];
+   */
   delete(elementOrNode) {
     if (elementOrNode === void 0 || !this.head) return false;
     const node = this.isNode(elementOrNode) ? elementOrNode : this.getNode(elementOrNode);
@@ -1379,56 +1051,17 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return true;
   }
   /**
-    * Insert a new element/node at an index, shifting following nodes.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @param newElementOrNode - Element or node to insert.
-    * @returns True if inserted.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Insert at index
-  *  const list = new SinglyLinkedList<number>([1, 3]);
-  *     list.addAt(1, 2);
-  *     console.log(list.toArray()); // [1, 2, 3];
-    */
+   * Insert a new element/node at an index, shifting following nodes.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @param newElementOrNode - Element or node to insert.
+   * @returns True if inserted.
+   * @example
+   * // Insert at index
+   *  const list = new SinglyLinkedList<number>([1, 3]);
+   *     list.addAt(1, 2);
+   *     console.log(list.toArray()); // [1, 2, 3];
+   */
   addAt(index, newElementOrNode) {
     if (index < 0 || index > this._length) return false;
     if (index === 0) return this.unshift(newElementOrNode);
@@ -1454,163 +1087,41 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return true;
   }
   /**
-    * Check whether the list is empty.
-    * @remarks Time O(1), Space O(1)
-    * @returns True if length is 0.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check empty
-  *  console.log(new SinglyLinkedList().isEmpty()); // true;
-    */
+   * Check whether the list is empty.
+   * @remarks Time O(1), Space O(1)
+   * @returns True if length is 0.
+   * @example
+   * // Check empty
+   *  console.log(new SinglyLinkedList().isEmpty()); // true;
+   */
   isEmpty() {
     return this._length === 0;
   }
   /**
-    * Remove all nodes and reset length.
-    * @remarks Time O(N), Space O(1)
-    * @returns void
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all
-  *  const list = new SinglyLinkedList<number>([1, 2, 3]);
-  *     list.clear();
-  *     console.log(list.isEmpty()); // true;
-    */
+   * Remove all nodes and reset length.
+   * @remarks Time O(N), Space O(1)
+   * @returns void
+   * @example
+   * // Remove all
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     list.clear();
+   *     console.log(list.isEmpty()); // true;
+   */
   clear() {
     this._head = void 0;
     this._tail = void 0;
     this._length = 0;
   }
   /**
-    * Reverse the list in place.
-    * @remarks Time O(N), Space O(1)
-    * @returns This list.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Reverse the list in-place
-  *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
-  *     list.reverse();
-  *     console.log([...list]); // [4, 3, 2, 1];
-    */
+   * Reverse the list in place.
+   * @remarks Time O(N), Space O(1)
+   * @returns This list.
+   * @example
+   * // Reverse the list in-place
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
+   *     list.reverse();
+   *     console.log([...list]); // [4, 3, 2, 1];
+   */
   reverse() {
     if (!this.head || this.head === this.tail) return this;
     let prev;
@@ -1785,126 +1296,44 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return false;
   }
   /**
-    * Deep clone this list (values are copied by reference).
-    * @remarks Time O(N), Space O(N)
-    * @returns A new list with the same element sequence.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Deep copy
-  *  const list = new SinglyLinkedList<number>([1, 2, 3]);
-  *     const copy = list.clone();
-  *     copy.pop();
-  *     console.log(list.length); // 3;
-  *     console.log(copy.length); // 2;
-    */
+   * Deep clone this list (values are copied by reference).
+   * @remarks Time O(N), Space O(N)
+   * @returns A new list with the same element sequence.
+   * @example
+   * // Deep copy
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     const copy = list.clone();
+   *     copy.pop();
+   *     console.log(list.length); // 3;
+   *     console.log(copy.length); // 2;
+   */
   clone() {
     const out = this._createInstance();
     for (const v of this) out.push(v);
     return out;
   }
   /**
-    * Filter values into a new list of the same class.
-    * @remarks Time O(N), Space O(N)
-    * @param callback - Predicate (value, index, list) → boolean to keep value.
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new list with kept values.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // SinglyLinkedList filter and map operations
-  *  const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
-  *
-  *     // Filter even numbers
-  *     const filtered = list.filter(value => value % 2 === 0);
-  *     console.log(filtered.length); // 2;
-  *
-  *     // Map to double values
-  *     const doubled = list.map(value => value * 2);
-  *     console.log(doubled.length); // 5;
-  *
-  *     // Use reduce to sum
-  *     const sum = list.reduce((acc, value) => acc + value, 0);
-  *     console.log(sum); // 15;
-    */
+   * Filter values into a new list of the same class.
+   * @remarks Time O(N), Space O(N)
+   * @param callback - Predicate (value, index, list) → boolean to keep value.
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new list with kept values.
+   * @example
+   * // SinglyLinkedList filter and map operations
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
+   *
+   *     // Filter even numbers
+   *     const filtered = list.filter(value => value % 2 === 0);
+   *     console.log(filtered.length); // 2;
+   *
+   *     // Map to double values
+   *     const doubled = list.map(value => value * 2);
+   *     console.log(doubled.length); // 5;
+   *
+   *     // Use reduce to sum
+   *     const sum = list.reduce((acc, value) => acc + value, 0);
+   *     console.log(sum); // 15;
+   */
   filter(callback, thisArg) {
     const out = this._createInstance();
     let index = 0;
@@ -1928,68 +1357,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     return out;
   }
   /**
-    * Map values into a new list (possibly different element type).
-    * @remarks Time O(N), Space O(N)
-    * @template EM
-    * @template RM
-    * @param callback - Mapping function (value, index, list) → newElement.
-    * @param [options] - Options for the output list (e.g., maxLen, toElementFn).
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new SinglyLinkedList with mapped values.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Transform elements
-  *  const list = new SinglyLinkedList<number>([1, 2, 3]);
-  *     const doubled = list.map(n => n * 2);
-  *     console.log([...doubled]); // [2, 4, 6];
-    */
+   * Map values into a new list (possibly different element type).
+   * @remarks Time O(N), Space O(N)
+   * @template EM
+   * @template RM
+   * @param callback - Mapping function (value, index, list) → newElement.
+   * @param [options] - Options for the output list (e.g., maxLen, toElementFn).
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new SinglyLinkedList with mapped values.
+   * @example
+   * // Transform elements
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     const doubled = list.map(n => n * 2);
+   *     console.log([...doubled]); // [2, 4, 6];
+   */
   map(callback, options, thisArg) {
     const out = this._createLike([], { ...options ?? {}, maxLen: this._maxLen });
     let index = 0;
     for (const value of this) out.push(callback.call(thisArg, value, index++, this));
     return out;
   }
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * (Protected) Create a node from a value.
    * @remarks Time O(1), Space O(1)
@@ -2176,7 +1564,6 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   static {
     __name(this, "DoublyLinkedList");
   }
-  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a DoublyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -2259,68 +1646,26 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return elementNodeOrPredicate instanceof DoublyLinkedListNode;
   }
   /**
-    * Append an element/node to the tail.
-    * @remarks Time O(1), Space O(1)
-    * @param elementOrNode - Element or node to append.
-    * @returns True when appended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // basic DoublyLinkedList creation and push operation
-  *  // Create a simple DoublyLinkedList with initial values
-  *     const list = new DoublyLinkedList([1, 2, 3, 4, 5]);
-  *
-  *     // Verify the list maintains insertion order
-  *     console.log([...list]); // [1, 2, 3, 4, 5];
-  *
-  *     // Check length
-  *     console.log(list.length); // 5;
-  *
-  *     // Push a new element to the end
-  *     list.push(6);
-  *     console.log(list.length); // 6;
-  *     console.log([...list]); // [1, 2, 3, 4, 5, 6];
-    */
+   * Append an element/node to the tail.
+   * @remarks Time O(1), Space O(1)
+   * @param elementOrNode - Element or node to append.
+   * @returns True when appended.
+   * @example
+   * // basic DoublyLinkedList creation and push operation
+   *  // Create a simple DoublyLinkedList with initial values
+   *     const list = new DoublyLinkedList([1, 2, 3, 4, 5]);
+   *
+   *     // Verify the list maintains insertion order
+   *     console.log([...list]); // [1, 2, 3, 4, 5];
+   *
+   *     // Check length
+   *     console.log(list.length); // 5;
+   *
+   *     // Push a new element to the end
+   *     list.push(6);
+   *     console.log(list.length); // 6;
+   *     console.log([...list]); // [1, 2, 3, 4, 5, 6];
+   */
   push(elementOrNode) {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -2336,67 +1681,25 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return true;
   }
   /**
-    * Remove and return the tail element.
-    * @remarks Time O(1), Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // DoublyLinkedList pop and shift operations
-  *  const list = new DoublyLinkedList<number>([10, 20, 30, 40, 50]);
-  *
-  *     // Pop removes from the end
-  *     const last = list.pop();
-  *     console.log(last); // 50;
-  *
-  *     // Shift removes from the beginning
-  *     const first = list.shift();
-  *     console.log(first); // 10;
-  *
-  *     // Verify remaining elements
-  *     console.log([...list]); // [20, 30, 40];
-  *     console.log(list.length); // 3;
-    */
+   * Remove and return the tail element.
+   * @remarks Time O(1), Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // DoublyLinkedList pop and shift operations
+   *  const list = new DoublyLinkedList<number>([10, 20, 30, 40, 50]);
+   *
+   *     // Pop removes from the end
+   *     const last = list.pop();
+   *     console.log(last); // 50;
+   *
+   *     // Shift removes from the beginning
+   *     const first = list.shift();
+   *     console.log(first); // 10;
+   *
+   *     // Verify remaining elements
+   *     console.log([...list]); // [20, 30, 40];
+   *     console.log(list.length); // 3;
+   */
   pop() {
     if (!this.tail) return void 0;
     const removed = this.tail;
@@ -2411,57 +1714,15 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return removed.value;
   }
   /**
-    * Remove and return the head element.
-    * @remarks Time O(1), Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove from the front
-  *  const list = new DoublyLinkedList<number>([10, 20, 30]);
-  *     console.log(list.shift()); // 10;
-  *     console.log(list.first); // 20;
-    */
+   * Remove and return the head element.
+   * @remarks Time O(1), Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove from the front
+   *  const list = new DoublyLinkedList<number>([10, 20, 30]);
+   *     console.log(list.shift()); // 10;
+   *     console.log(list.first); // 20;
+   */
   shift() {
     if (!this.head) return void 0;
     const removed = this.head;
@@ -2476,58 +1737,16 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return removed.value;
   }
   /**
-    * Prepend an element/node to the head.
-    * @remarks Time O(1), Space O(1)
-    * @param elementOrNode - Element or node to prepend.
-    * @returns True when prepended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Add to the front
-  *  const list = new DoublyLinkedList<number>([2, 3]);
-  *     list.unshift(1);
-  *     console.log([...list]); // [1, 2, 3];
-    */
+   * Prepend an element/node to the head.
+   * @remarks Time O(1), Space O(1)
+   * @param elementOrNode - Element or node to prepend.
+   * @returns True when prepended.
+   * @example
+   * // Add to the front
+   *  const list = new DoublyLinkedList<number>([2, 3]);
+   *     list.unshift(1);
+   *     console.log([...list]); // [1, 2, 3];
+   */
   unshift(elementOrNode) {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -2571,58 +1790,16 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return ans;
   }
   /**
-    * Get the element at a given index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Access by index
-  *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
-  *     console.log(list.at(1)); // 'b';
-  *     console.log(list.at(2)); // 'c';
-    */
+   * Get the element at a given index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Element or undefined.
+   * @example
+   * // Access by index
+   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
+   *     console.log(list.at(1)); // 'b';
+   *     console.log(list.at(2)); // 'c';
+   */
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
@@ -2630,54 +1807,15 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return current?.value;
   }
   /**
-    * Get the node reference at a given index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Node or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Get node at index
-  *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
-  *     console.log(list.getNodeAt(1)?.value); // 'b';
-    */
+   * Get the node reference at a given index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Node or undefined.
+   * @example
+   * // Get node at index
+   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
+   *     console.log(list.getNodeAt(1)?.value); // 'b';
+   */
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
@@ -2716,56 +1854,17 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return void 0;
   }
   /**
-    * Insert a new element/node at an index, shifting following nodes.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @param newElementOrNode - Element or node to insert.
-    * @returns True if inserted.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Insert at position
-  *  const list = new DoublyLinkedList<number>([1, 3]);
-  *     list.addAt(1, 2);
-  *     console.log(list.toArray()); // [1, 2, 3];
-    */
+   * Insert a new element/node at an index, shifting following nodes.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @param newElementOrNode - Element or node to insert.
+   * @returns True if inserted.
+   * @example
+   * // Insert at position
+   *  const list = new DoublyLinkedList<number>([1, 3]);
+   *     list.addAt(1, 2);
+   *     console.log(list.toArray()); // [1, 2, 3];
+   */
   addAt(index, newElementOrNode) {
     if (index < 0 || index > this._length) return false;
     if (index === 0) return this.unshift(newElementOrNode);
@@ -2832,55 +1931,16 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return true;
   }
   /**
-    * Delete the element at an index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove by index
-  *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
-  *     list.deleteAt(1);
-  *     console.log(list.toArray()); // ['a', 'c'];
-    */
+   * Delete the element at an index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove by index
+   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
+   *     list.deleteAt(1);
+   *     console.log(list.toArray()); // ['a', 'c'];
+   */
   deleteAt(index) {
     if (index < 0 || index >= this._length) return;
     if (index === 0) return this.shift();
@@ -2894,55 +1954,16 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return removedNode.value;
   }
   /**
-    * Delete the first match by value/node.
-    * @remarks Time O(N), Space O(1)
-    * @param [elementOrNode] - Element or node to remove.
-    * @returns True if removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove first occurrence
-  *  const list = new DoublyLinkedList<number>([1, 2, 3, 2]);
-  *     list.delete(2);
-  *     console.log(list.toArray()); // [1, 3, 2];
-    */
+   * Delete the first match by value/node.
+   * @remarks Time O(N), Space O(1)
+   * @param [elementOrNode] - Element or node to remove.
+   * @returns True if removed.
+   * @example
+   * // Remove first occurrence
+   *  const list = new DoublyLinkedList<number>([1, 2, 3, 2]);
+   *     list.delete(2);
+   *     console.log(list.toArray()); // [1, 3, 2];
+   */
   delete(elementOrNode) {
     const node = this.getNode(elementOrNode);
     if (!node) return false;
@@ -2958,161 +1979,42 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return true;
   }
   /**
-    * Check whether the list is empty.
-    * @remarks Time O(1), Space O(1)
-    * @returns True if length is 0.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check empty
-  *  console.log(new DoublyLinkedList().isEmpty()); // true;
-    */
+   * Check whether the list is empty.
+   * @remarks Time O(1), Space O(1)
+   * @returns True if length is 0.
+   * @example
+   * // Check empty
+   *  console.log(new DoublyLinkedList().isEmpty()); // true;
+   */
   isEmpty() {
     return this._length === 0;
   }
   /**
-    * Remove all nodes and reset length.
-    * @remarks Time O(N), Space O(1)
-    * @returns void
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all
-  *  const list = new DoublyLinkedList<number>([1, 2]);
-  *     list.clear();
-  *     console.log(list.isEmpty()); // true;
-    */
+   * Remove all nodes and reset length.
+   * @remarks Time O(N), Space O(1)
+   * @returns void
+   * @example
+   * // Remove all
+   *  const list = new DoublyLinkedList<number>([1, 2]);
+   *     list.clear();
+   *     console.log(list.isEmpty()); // true;
+   */
   clear() {
     this._head = void 0;
     this._tail = void 0;
     this._length = 0;
   }
   /**
-    * Find the first value matching a predicate scanning forward.
-    * @remarks Time O(N), Space O(1)
-    * @param elementNodeOrPredicate - Element, node, or predicate to match.
-    * @returns Matched value or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Search with predicate
-  *  const list = new DoublyLinkedList<number>([10, 20, 30]);
-  *     const found = list.search(node => node.value > 15);
-  *     console.log(found); // 20;
-    */
+   * Find the first value matching a predicate scanning forward.
+   * @remarks Time O(N), Space O(1)
+   * @param elementNodeOrPredicate - Element, node, or predicate to match.
+   * @returns Matched value or undefined.
+   * @example
+   * // Search with predicate
+   *  const list = new DoublyLinkedList<number>([10, 20, 30]);
+   *     const found = list.search(node => node.value > 15);
+   *     console.log(found); // 20;
+   */
   search(elementNodeOrPredicate) {
     const predicate = this._ensurePredicate(elementNodeOrPredicate);
     let current = this.head;
@@ -3123,53 +2025,17 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return void 0;
   }
   /**
-    * Find the first value matching a predicate scanning backward.
-    * @remarks Time O(N), Space O(1)
-    * @param elementNodeOrPredicate - Element, node, or predicate to match.
-    * @returns Matched value or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Find value scanning from tail
-  *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
-  *     // findLast scans from tail to head, returns first match
-  *     const found = list.findLast(node => node.value < 4);
-  *     console.log(found); // 3;
-    */
+   * Find the first value matching a predicate scanning backward.
+   * @remarks Time O(N), Space O(1)
+   * @param elementNodeOrPredicate - Element, node, or predicate to match.
+   * @returns Matched value or undefined.
+   * @example
+   * // Find value scanning from tail
+   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
+   *     // findLast scans from tail to head, returns first match
+   *     const found = list.findLast(node => node.value < 4);
+   *     console.log(found); // 3;
+   */
   /**
    * @deprecated Use `findLast` instead. Will be removed in a future major version.
    */
@@ -3177,19 +2043,17 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return this.findLast(elementNodeOrPredicate);
   }
   /**
-    * Find the first value matching a predicate scanning backward (tail → head).
-    * @remarks Time O(N), Space O(1)
-    * @param elementNodeOrPredicate - Element, node, or predicate to match.
-    * @returns Matching value or undefined.
-    
-    
-     * @example
-  * // Find value scanning from tail
-  *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
-  *     // findLast scans from tail to head, returns first match
-  *     const found = list.findLast(node => node.value < 4);
-  *     console.log(found); // 3;
-    */
+   * Find the first value matching a predicate scanning backward (tail → head).
+   * @remarks Time O(N), Space O(1)
+   * @param elementNodeOrPredicate - Element, node, or predicate to match.
+   * @returns Matching value or undefined.
+   * @example
+   * // Find value scanning from tail
+   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
+   *     // findLast scans from tail to head, returns first match
+   *     const found = list.findLast(node => node.value < 4);
+   *     console.log(found); // 3;
+   */
   findLast(elementNodeOrPredicate) {
     const predicate = this._ensurePredicate(elementNodeOrPredicate);
     let current = this.tail;
@@ -3216,57 +2080,15 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return -1;
   }
   /**
-    * Reverse the list in place.
-    * @remarks Time O(N), Space O(1)
-    * @returns This list.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Reverse in-place
-  *  const list = new DoublyLinkedList<number>([1, 2, 3]);
-  *     list.reverse();
-  *     console.log([...list]); // [3, 2, 1];
-    */
+   * Reverse the list in place.
+   * @remarks Time O(N), Space O(1)
+   * @returns This list.
+   * @example
+   * // Reverse in-place
+   *  const list = new DoublyLinkedList<number>([1, 2, 3]);
+   *     list.reverse();
+   *     console.log([...list]); // [3, 2, 1];
+   */
   reverse() {
     let current = this.head;
     [this._head, this._tail] = [this.tail, this.head];
@@ -3307,115 +2129,33 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return this;
   }
   /**
-    * Deep clone this list (values are copied by reference).
-    * @remarks Time O(N), Space O(N)
-    * @returns A new list with the same element sequence.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Deep copy
-  *  const list = new DoublyLinkedList<number>([1, 2, 3]);
-  *     const copy = list.clone();
-  *     copy.pop();
-  *     console.log(list.length); // 3;
-    */
+   * Deep clone this list (values are copied by reference).
+   * @remarks Time O(N), Space O(N)
+   * @returns A new list with the same element sequence.
+   * @example
+   * // Deep copy
+   *  const list = new DoublyLinkedList<number>([1, 2, 3]);
+   *     const copy = list.clone();
+   *     copy.pop();
+   *     console.log(list.length); // 3;
+   */
   clone() {
     const out = this._createInstance({ toElementFn: this._toElementFn, maxLen: this._maxLen });
     for (const v of this) out.push(v);
     return out;
   }
   /**
-    * Filter values into a new list of the same class.
-    * @remarks Time O(N), Space O(N)
-    * @param callback - Predicate (value, index, list) → boolean to keep value.
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new list with kept values.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Filter elements
-  *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
-  *     const evens = list.filter(n => n % 2 === 0);
-  *     console.log([...evens]); // [2, 4];
-    */
+   * Filter values into a new list of the same class.
+   * @remarks Time O(N), Space O(N)
+   * @param callback - Predicate (value, index, list) → boolean to keep value.
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new list with kept values.
+   * @example
+   * // Filter elements
+   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
+   *     const evens = list.filter(n => n % 2 === 0);
+   *     console.log([...evens]); // [2, 4];
+   */
   filter(callback, thisArg) {
     const out = this._createInstance({ toElementFn: this._toElementFn, maxLen: this._maxLen });
     let index = 0;
@@ -3439,77 +2179,36 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     return out;
   }
   /**
-    * Map values into a new list (possibly different element type).
-    * @remarks Time O(N), Space O(N)
-    * @template EM
-    * @template RM
-    * @param callback - Mapping function (value, index, list) → newElement.
-    * @param [options] - Options for the output list (e.g., maxLen, toElementFn).
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new DoublyLinkedList with mapped values.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // DoublyLinkedList for...of iteration and map operation
-  *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
-  *
-  *     // Iterate through list
-  *     const doubled = list.map(value => value * 2);
-  *     console.log(doubled.length); // 5;
-  *
-  *     // Use for...of loop
-  *     const result: number[] = [];
-  *     for (const item of list) {
-  *       result.push(item);
-  *     }
-  *     console.log(result); // [1, 2, 3, 4, 5];
-    */
+   * Map values into a new list (possibly different element type).
+   * @remarks Time O(N), Space O(N)
+   * @template EM
+   * @template RM
+   * @param callback - Mapping function (value, index, list) → newElement.
+   * @param [options] - Options for the output list (e.g., maxLen, toElementFn).
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new DoublyLinkedList with mapped values.
+   * @example
+   * // DoublyLinkedList for...of iteration and map operation
+   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
+   *
+   *     // Iterate through list
+   *     const doubled = list.map(value => value * 2);
+   *     console.log(doubled.length); // 5;
+   *
+   *     // Use for...of loop
+   *     const result: number[] = [];
+   *     for (const item of list) {
+   *       result.push(item);
+   *     }
+   *     console.log(result); // [1, 2, 3, 4, 5];
+   */
   map(callback, options, thisArg) {
     const out = this._createLike([], { ...options ?? {}, maxLen: this._maxLen });
     let index = 0;
     for (const v of this) out.push(callback.call(thisArg, v, index++, this));
     return out;
   }
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * (Protected) Create or return a node for the given input (node or raw element).
    * @remarks Time O(1), Space O(1)
@@ -3792,6 +2491,9 @@ var SkipList = class _SkipList extends IterableEntryBase {
   static {
     __name(this, "SkipList");
   }
+  // ─── Internal state ──────────────────────────────────────────
+  _head;
+  _level = 0;
   #comparator;
   #isDefaultComparator;
   constructor(entries = [], options = {}) {
@@ -3816,6 +2518,22 @@ var SkipList = class _SkipList extends IterableEntryBase {
       this.set(k, v);
     }
   }
+  _size = 0;
+  // ─── Size & lifecycle ────────────────────────────────────────
+  get size() {
+    return this._size;
+  }
+  _maxLevel = 16;
+  get maxLevel() {
+    return this._maxLevel;
+  }
+  _probability = 0.5;
+  get probability() {
+    return this._probability;
+  }
+  get comparator() {
+    return this.#comparator;
+  }
   /**
    * Creates a default comparator supporting number, string, Date, and bigint.
    */
@@ -3839,174 +2557,44 @@ var SkipList = class _SkipList extends IterableEntryBase {
       raise(TypeError, ERR.comparatorRequired("SkipList"));
     };
   }
-  // ─── Internal state ──────────────────────────────────────────
-  _head;
-  _level = 0;
-  _size = 0;
-  _maxLevel = 16;
-  _probability = 0.5;
-  // ─── Size & lifecycle ────────────────────────────────────────
-  get size() {
-    return this._size;
-  }
-  get maxLevel() {
-    return this._maxLevel;
-  }
-  get probability() {
-    return this._probability;
-  }
-  get comparator() {
-    return this.#comparator;
-  }
   /**
-    * Check if empty
-   
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check if empty
-  *  const sl = new SkipList<number, string>();
-  *     console.log(sl.isEmpty()); // true;
-    */
+   * Check if empty
+   * @example
+   * // Check if empty
+   *  const sl = new SkipList<number, string>();
+   *     console.log(sl.isEmpty()); // true;
+   */
   isEmpty() {
     return this._size === 0;
   }
   /**
-    * Remove all entries
-   
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all entries
-  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
-  *     sl.clear();
-  *     console.log(sl.isEmpty()); // true;
-    */
+   * Remove all entries
+   * @example
+   * // Remove all entries
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [2, 'b']
+   *     ]);
+   *     sl.clear();
+   *     console.log(sl.isEmpty()); // true;
+   */
   clear() {
     this._head = new SkipListNode(void 0, void 0, this._maxLevel);
     this._level = 0;
     this._size = 0;
   }
   /**
-    * Create independent copy
-   
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Create independent copy
-  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
-  *     const copy = sl.clone();
-  *     copy.delete(1);
-  *     console.log(sl.has(1)); // true;
-    */
+   * Create independent copy
+   * @example
+   * // Create independent copy
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [2, 'b']
+   *     ]);
+   *     const copy = sl.clone();
+   *     copy.delete(1);
+   *     console.log(sl.has(1)); // true;
+   */
   clone() {
     return new _SkipList(this, {
       comparator: this.#isDefaultComparator ? void 0 : this.#comparator,
@@ -4016,67 +2604,25 @@ var SkipList = class _SkipList extends IterableEntryBase {
   }
   // ─── Core CRUD ───────────────────────────────────────────────
   /**
-    * Insert or update a key-value pair. Returns `this` for chaining.
-    * Unique keys only — if key exists, value is updated in place.
-   
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // In-memory sorted key-value store
-  *  const store = new SkipList<number, string>();
-  *
-  *     store.set(3, 'three');
-  *     store.set(1, 'one');
-  *     store.set(5, 'five');
-  *     store.set(2, 'two');
-  *
-  *     console.log(store.get(3)); // 'three';
-  *     console.log(store.get(1)); // 'one';
-  *     console.log(store.get(5)); // 'five';
-  *
-  *     // Update existing key
-  *     store.set(3, 'THREE');
-  *     console.log(store.get(3)); // 'THREE';
-    */
+   * Insert or update a key-value pair. Returns `this` for chaining.
+   * Unique keys only — if key exists, value is updated in place.
+   * @example
+   * // In-memory sorted key-value store
+   *  const store = new SkipList<number, string>();
+   *
+   *     store.set(3, 'three');
+   *     store.set(1, 'one');
+   *     store.set(5, 'five');
+   *     store.set(2, 'two');
+   *
+   *     console.log(store.get(3)); // 'three';
+   *     console.log(store.get(1)); // 'one';
+   *     console.log(store.get(5)); // 'five';
+   *
+   *     // Update existing key
+   *     store.set(3, 'THREE');
+   *     console.log(store.get(3)); // 'THREE';
+   */
   set(key, value) {
     const cmp = this.#comparator;
     const update = this._findUpdate(key);
@@ -4101,186 +2647,64 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return this;
   }
   /**
-    * Get the value for a key, or `undefined` if not found.
-    * Overrides base O(n) with O(log n) skip-list search.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Building a sorted index
-  *  type Product = { id: number; name: string; price: number };
-  *     const products: Product[] = [
-  *       { id: 1, name: 'Widget', price: 25 },
-  *       { id: 2, name: 'Gadget', price: 50 },
-  *       { id: 3, name: 'Doohickey', price: 15 }
-  *     ];
-  *
-  *     const index = new SkipList<number, Product, Product>(products, {
-  *       toEntryFn: (p: Product) => [p.price, p]
-  *     });
-  *
-  *     // Iterate in sorted order by price
-  *     const names = [...index.values()].map(p => p!.name);
-  *     console.log(names); // ['Doohickey', 'Widget', 'Gadget'];
-  *
-  *     // Range search: products between $20 and $60
-  *     const range = index.rangeSearch([20, 60]);
-  *     console.log(range.map(([, p]) => p!.name)); // ['Widget', 'Gadget'];
-    */
+   * Get the value for a key, or `undefined` if not found.
+   * Overrides base O(n) with O(log n) skip-list search.
+   * @example
+   * // Building a sorted index
+   *  type Product = { id: number; name: string; price: number };
+   *     const products: Product[] = [
+   *       { id: 1, name: 'Widget', price: 25 },
+   *       { id: 2, name: 'Gadget', price: 50 },
+   *       { id: 3, name: 'Doohickey', price: 15 }
+   *     ];
+   *
+   *     const index = new SkipList<number, Product, Product>(products, {
+   *       toEntryFn: (p: Product) => [p.price, p]
+   *     });
+   *
+   *     // Iterate in sorted order by price
+   *     const names = [...index.values()].map(p => p!.name);
+   *     console.log(names); // ['Doohickey', 'Widget', 'Gadget'];
+   *
+   *     // Range search: products between $20 and $60
+   *     const range = index.rangeSearch([20, 60]);
+   *     console.log(range.map(([, p]) => p!.name)); // ['Widget', 'Gadget'];
+   */
   get(key) {
     const node = this._findNode(key);
     return node ? node.value : void 0;
   }
   /**
-    * Check if a key exists.
-    * Overrides base O(n) with O(log n) skip-list search.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check key existence
-  *  const sl = new SkipList<number, string>([[1, 'a'], [3, 'c'], [5, 'e']]);
-  *     console.log(sl.has(3)); // true;
-  *     console.log(sl.has(4)); // false;
-    */
+   * Check if a key exists.
+   * Overrides base O(n) with O(log n) skip-list search.
+   * @example
+   * // Check key existence
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [3, 'c'],
+   *       [5, 'e']
+   *     ]);
+   *     console.log(sl.has(3)); // true;
+   *     console.log(sl.has(4)); // false;
+   */
   has(key) {
     return this._findNode(key) !== void 0;
   }
   /**
-    * Delete a key. Returns `true` if the key was found and removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Fast lookup with deletion
-  *  const cache = new SkipList<string, number>();
-  *
-  *     cache.set('alpha', 1);
-  *     cache.set('beta', 2);
-  *     cache.set('gamma', 3);
-  *
-  *     console.log(cache.has('beta')); // true;
-  *     cache.delete('beta');
-  *     console.log(cache.has('beta')); // false;
-  *     console.log(cache.size); // 2;
-    */
+   * Delete a key. Returns `true` if the key was found and removed.
+   * @example
+   * // Fast lookup with deletion
+   *  const cache = new SkipList<string, number>();
+   *
+   *     cache.set('alpha', 1);
+   *     cache.set('beta', 2);
+   *     cache.set('gamma', 3);
+   *
+   *     console.log(cache.has('beta')); // true;
+   *     cache.delete('beta');
+   *     console.log(cache.has('beta')); // false;
+   *     console.log(cache.size); // 2;
+   */
   delete(key) {
     const cmp = this.#comparator;
     const update = this._findUpdate(key);
@@ -4298,107 +2722,31 @@ var SkipList = class _SkipList extends IterableEntryBase {
   }
   // ─── Navigation ──────────────────────────────────────────────
   /**
-    * Returns the first (smallest key) entry, or `undefined` if empty.
-   
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Access the minimum entry
-  *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
-  *     console.log(sl.first()); // [1, 'a'];
-    */
+   * Returns the first (smallest key) entry, or `undefined` if empty.
+   * @example
+   * // Access the minimum entry
+   *  const sl = new SkipList<number, string>([
+   *       [5, 'e'],
+   *       [1, 'a'],
+   *       [3, 'c']
+   *     ]);
+   *     console.log(sl.first()); // [1, 'a'];
+   */
   first() {
     const node = this._head.forward[0];
     return node ? [node.key, node.value] : void 0;
   }
   /**
-    * Returns the last (largest key) entry, or `undefined` if empty.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Access the maximum entry
-  *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
-  *     console.log(sl.last()); // [5, 'e'];
-    */
+   * Returns the last (largest key) entry, or `undefined` if empty.
+   * @example
+   * // Access the maximum entry
+   *  const sl = new SkipList<number, string>([
+   *       [5, 'e'],
+   *       [1, 'a'],
+   *       [3, 'c']
+   *     ]);
+   *     console.log(sl.last()); // [5, 'e'];
+   */
   last() {
     let current = this._head;
     for (let i = this._level - 1; i >= 0; i--) {
@@ -4409,52 +2757,17 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return current === this._head ? void 0 : [current.key, current.value];
   }
   /**
-    * Remove and return the first (smallest key) entry.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove and return smallest
-  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
-  *     console.log(sl.pollFirst()); // [1, 'a'];
-  *     console.log(sl.size); // 2;
-    */
+   * Remove and return the first (smallest key) entry.
+   * @example
+   * // Remove and return smallest
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [2, 'b'],
+   *       [3, 'c']
+   *     ]);
+   *     console.log(sl.pollFirst()); // [1, 'a'];
+   *     console.log(sl.size); // 2;
+   */
   pollFirst() {
     const entry = this.first();
     if (!entry) return void 0;
@@ -4462,52 +2775,17 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return entry;
   }
   /**
-    * Remove and return the last (largest key) entry.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove and return largest
-  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
-  *     console.log(sl.pollLast()); // [3, 'c'];
-  *     console.log(sl.size); // 2;
-    */
+   * Remove and return the last (largest key) entry.
+   * @example
+   * // Remove and return largest
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [2, 'b'],
+   *       [3, 'c']
+   *     ]);
+   *     console.log(sl.pollLast()); // [3, 'c'];
+   *     console.log(sl.size); // 2;
+   */
   pollLast() {
     const entry = this.last();
     if (!entry) return void 0;
@@ -4515,55 +2793,17 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return entry;
   }
   /**
-    * Least entry ≥ key, or `undefined`.
-   
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Least entry ≥ key
-  *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
-  *     console.log(sl.ceiling(15)); // [20, 'b'];
-  *     console.log(sl.ceiling(20)); // [20, 'b'];
-    */
+   * Least entry ≥ key, or `undefined`.
+   * @example
+   * // Least entry ≥ key
+   *  const sl = new SkipList<number, string>([
+   *       [10, 'a'],
+   *       [20, 'b'],
+   *       [30, 'c']
+   *     ]);
+   *     console.log(sl.ceiling(15)); // [20, 'b'];
+   *     console.log(sl.ceiling(20)); // [20, 'b'];
+   */
   ceiling(key) {
     const cmp = this.#comparator;
     let current = this._head;
@@ -4576,55 +2816,17 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return node ? [node.key, node.value] : void 0;
   }
   /**
-    * Greatest entry ≤ key, or `undefined`.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Greatest entry ≤ key
-  *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
-  *     console.log(sl.floor(25)); // [20, 'b'];
-  *     console.log(sl.floor(5)); // undefined;
-    */
+   * Greatest entry ≤ key, or `undefined`.
+   * @example
+   * // Greatest entry ≤ key
+   *  const sl = new SkipList<number, string>([
+   *       [10, 'a'],
+   *       [20, 'b'],
+   *       [30, 'c']
+   *     ]);
+   *     console.log(sl.floor(25)); // [20, 'b'];
+   *     console.log(sl.floor(5)); // undefined;
+   */
   floor(key) {
     const cmp = this.#comparator;
     let current = this._head;
@@ -4638,52 +2840,17 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return void 0;
   }
   /**
-    * Least entry strictly > key, or `undefined`.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Strictly greater entry
-  *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
-  *     console.log(sl.higher(15)); // [20, 'b'];
-  *     console.log(sl.higher(30)); // undefined;
-    */
+   * Least entry strictly > key, or `undefined`.
+   * @example
+   * // Strictly greater entry
+   *  const sl = new SkipList<number, string>([
+   *       [10, 'a'],
+   *       [20, 'b'],
+   *       [30, 'c']
+   *     ]);
+   *     console.log(sl.higher(15)); // [20, 'b'];
+   *     console.log(sl.higher(30)); // undefined;
+   */
   higher(key) {
     const cmp = this.#comparator;
     let current = this._head;
@@ -4696,52 +2863,17 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return node ? [node.key, node.value] : void 0;
   }
   /**
-    * Greatest entry strictly < key, or `undefined`.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Strictly less entry
-  *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
-  *     console.log(sl.lower(25)); // [20, 'b'];
-  *     console.log(sl.lower(10)); // undefined;
-    */
+   * Greatest entry strictly < key, or `undefined`.
+   * @example
+   * // Strictly less entry
+   *  const sl = new SkipList<number, string>([
+   *       [10, 'a'],
+   *       [20, 'b'],
+   *       [30, 'c']
+   *     ]);
+   *     console.log(sl.lower(25)); // [20, 'b'];
+   *     console.log(sl.lower(10)); // undefined;
+   */
   lower(key) {
     const cmp = this.#comparator;
     let current = this._head;
@@ -4757,55 +2889,23 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return result ? [result.key, result.value] : void 0;
   }
   /**
-    * Returns entries within the given key range.
-   
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Find entries in a range
-  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c'], [4, 'd'], [5, 'e']]);
-  *     const result = sl.rangeSearch([2, 4]);
-  *     console.log(result); // [[2, 'b'], [3, 'c'], [4, 'd']];
-    */
+   * Returns entries within the given key range.
+   * @example
+   * // Find entries in a range
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [2, 'b'],
+   *       [3, 'c'],
+   *       [4, 'd'],
+   *       [5, 'e']
+   *     ]);
+   *     const result = sl.rangeSearch([2, 4]);
+   *     console.log(result); // [
+   *  //      [2, 'b'],
+   *  //      [3, 'c'],
+   *  //      [4, 'd']
+   *  //    ];
+   */
   rangeSearch(range, options = {}) {
     const { lowInclusive = true, highInclusive = true } = options;
     const [low, high] = range;
@@ -4832,52 +2932,16 @@ var SkipList = class _SkipList extends IterableEntryBase {
   }
   // ─── Functional (overrides) ──────────────────────────────────
   /**
-    * Creates a new SkipList with entries transformed by callback.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Transform entries
-  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
-  *     const mapped = sl.map((v, k) => [k, v?.toUpperCase()] as [number, string]);
-  *     console.log([...mapped.values()]); // ['A', 'B'];
-    */
+   * Creates a new SkipList with entries transformed by callback.
+   * @example
+   * // Transform entries
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [2, 'b']
+   *     ]);
+   *     const mapped = sl.map((v, k) => [k, v?.toUpperCase()] as [number, string]);
+   *     console.log([...mapped.values()]); // ['A', 'B'];
+   */
   map(callback, options) {
     const out = new _SkipList([], options ?? {});
     let i = 0;
@@ -4888,52 +2952,17 @@ var SkipList = class _SkipList extends IterableEntryBase {
     return out;
   }
   /**
-    * Creates a new SkipList with entries that pass the predicate.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Filter entries
-  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
-  *     const result = sl.filter((v, k) => k > 1);
-  *     console.log(result.size); // 2;
-    */
+   * Creates a new SkipList with entries that pass the predicate.
+   * @example
+   * // Filter entries
+   *  const sl = new SkipList<number, string>([
+   *       [1, 'a'],
+   *       [2, 'b'],
+   *       [3, 'c']
+   *     ]);
+   *     const result = sl.filter((v, k) => k > 1);
+   *     console.log(result.size); // 2;
+   */
   filter(callbackfn, thisArg) {
     const out = new _SkipList([], {
       comparator: this.#isDefaultComparator ? void 0 : this.#comparator,