linked-list-typed 2.5.0 → 2.5.1

package/dist/cjs/index.cjs

@@ -740,6 +740,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // basic SinglyLinkedList creation and push operation
   *  // Create a simple SinglyLinkedList with initial values
@@ -783,6 +804,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // SinglyLinkedList pop and shift operations
   *  const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
@@ -831,6 +873,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove from the front
   *  const list = new SinglyLinkedList<number>([10, 20, 30]);
@@ -861,6 +924,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // SinglyLinkedList unshift and forward traversal
   *  const list = new SinglyLinkedList<number>([20, 30, 40]);
@@ -952,6 +1036,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access element by index
   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
@@ -987,6 +1092,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Get node at index
   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
@@ -1011,6 +1137,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove by index
   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
@@ -1041,6 +1188,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove first occurrence
   *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
@@ -1076,6 +1244,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Insert at index
   *  const list = new SinglyLinkedList<number>([1, 3]);
@@ -1119,6 +1308,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check empty
   *  console.log(new SinglyLinkedList().isEmpty()); // true;
@@ -1139,6 +1349,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove all
   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
@@ -1165,6 +1396,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Reverse the list in-place
   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
@@ -1357,10 +1609,31 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
-     * @example
-  * // Deep copy
-  *  const list = new SinglyLinkedList<number>([1, 2, 3]);
-  *     const copy = list.clone();
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+     * @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;
@@ -1387,6 +1660,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // SinglyLinkedList filter and map operations
   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -1445,6 +1739,27 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Transform elements
   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
@@ -1741,6 +2056,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // basic DoublyLinkedList creation and push operation
   *  // Create a simple DoublyLinkedList with initial values
@@ -1786,6 +2122,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // DoublyLinkedList pop and shift operations
   *  const list = new DoublyLinkedList<number>([10, 20, 30, 40, 50]);
@@ -1830,6 +2187,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove from the front
   *  const list = new DoublyLinkedList<number>([10, 20, 30]);
@@ -1865,6 +2243,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Add to the front
   *  const list = new DoublyLinkedList<number>([2, 3]);
@@ -1929,6 +2328,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access by index
   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -1954,6 +2374,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Get node at index
   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -2010,6 +2451,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Insert at position
   *  const list = new DoublyLinkedList<number>([1, 3]);
@@ -2094,6 +2556,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove by index
   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -2125,6 +2608,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove first occurrence
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 2]);
@@ -2158,6 +2662,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check empty
   *  console.log(new DoublyLinkedList().isEmpty()); // true;
@@ -2178,6 +2703,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove all
   *  const list = new DoublyLinkedList<number>([1, 2]);
@@ -2202,6 +2748,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Search with predicate
   *  const list = new DoublyLinkedList<number>([10, 20, 30]);
@@ -2230,6 +2797,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Find value scanning from tail
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
@@ -2261,6 +2849,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Reverse in-place
   *  const list = new DoublyLinkedList<number>([1, 2, 3]);
@@ -2300,6 +2909,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Deep copy
   *  const list = new DoublyLinkedList<number>([1, 2, 3]);
@@ -2329,6 +2959,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Filter elements
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -2377,6 +3028,27 @@ var DoublyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // DoublyLinkedList for...of iteration and map operation
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -2805,6 +3477,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check if empty
   *  const sl = new SkipList<number, string>();
@@ -2823,6 +3516,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove all entries
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -2844,6 +3558,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Create independent copy
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -2873,6 +3608,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // In-memory sorted key-value store
   *  const store = new SkipList<number, string>();
@@ -2927,17 +3683,38 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
-     * @example
-  * // Building a sorted index
-  *  type Product = { id: number; name: string; price: number };
-  *     const products: Product[] = [
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+     * @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>(products as any, {
-  *       toEntryFn: (p: any) => [p.price, p]
+  *     const index = new SkipList<number, Product, Product>(products, {
+  *       toEntryFn: (p: Product) => [p.price, p]
   *     });
   *
   *     // Iterate in sorted order by price
@@ -2966,6 +3743,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check key existence
   *  const sl = new SkipList<number, string>([[1, 'a'], [3, 'c'], [5, 'e']]);
@@ -2988,6 +3786,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Fast lookup with deletion
   *  const cache = new SkipList<string, number>();
@@ -3030,6 +3849,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access the minimum entry
   *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
@@ -3052,6 +3892,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access the maximum entry
   *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
@@ -3076,6 +3937,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove and return smallest
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
@@ -3098,6 +3980,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove and return largest
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
@@ -3123,6 +4026,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Least entry ≥ key
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3153,6 +4077,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Greatest entry ≤ key
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3181,6 +4126,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Strictly greater entry
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3208,6 +4174,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Strictly less entry
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3241,6 +4228,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Find entries in a range
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c'], [4, 'd'], [5, 'e']]);
@@ -3282,6 +4290,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Transform entries
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -3307,6 +4336,27 @@ var SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Filter entries
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);