linked-list-typed 2.5.0 → 2.5.1

package/dist/esm-legacy/index.mjs

@@ -741,6 +741,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // basic SinglyLinkedList creation and push operation
   *  // Create a simple SinglyLinkedList with initial values
@@ -784,6 +805,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // SinglyLinkedList pop and shift operations
   *  const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
@@ -833,6 +875,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove from the front
   *  const list = new SinglyLinkedList<number>([10, 20, 30]);
@@ -863,6 +926,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // SinglyLinkedList unshift and forward traversal
   *  const list = new SinglyLinkedList<number>([20, 30, 40]);
@@ -954,6 +1038,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access element by index
   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
@@ -989,6 +1094,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Get node at index
   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
@@ -1013,6 +1139,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove by index
   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
@@ -1043,6 +1190,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove first occurrence
   *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
@@ -1078,6 +1246,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Insert at index
   *  const list = new SinglyLinkedList<number>([1, 3]);
@@ -1121,6 +1310,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check empty
   *  console.log(new SinglyLinkedList().isEmpty()); // true;
@@ -1141,6 +1351,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove all
   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
@@ -1167,6 +1398,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Reverse the list in-place
   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
@@ -1359,10 +1611,31 @@ var _SinglyLinkedList = class _SinglyLinkedList 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;
@@ -1389,6 +1662,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // SinglyLinkedList filter and map operations
   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -1447,6 +1741,27 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Transform elements
   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
@@ -1743,6 +2058,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // basic DoublyLinkedList creation and push operation
   *  // Create a simple DoublyLinkedList with initial values
@@ -1788,6 +2124,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // DoublyLinkedList pop and shift operations
   *  const list = new DoublyLinkedList<number>([10, 20, 30, 40, 50]);
@@ -1832,6 +2189,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove from the front
   *  const list = new DoublyLinkedList<number>([10, 20, 30]);
@@ -1867,6 +2245,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Add to the front
   *  const list = new DoublyLinkedList<number>([2, 3]);
@@ -1931,6 +2330,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access by index
   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -1956,6 +2376,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Get node at index
   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -2012,6 +2453,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Insert at position
   *  const list = new DoublyLinkedList<number>([1, 3]);
@@ -2096,6 +2558,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove by index
   *  const list = new DoublyLinkedList<string>(['a', 'b', 'c']);
@@ -2127,6 +2610,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove first occurrence
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 2]);
@@ -2160,6 +2664,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check empty
   *  console.log(new DoublyLinkedList().isEmpty()); // true;
@@ -2180,6 +2705,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove all
   *  const list = new DoublyLinkedList<number>([1, 2]);
@@ -2204,6 +2750,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Search with predicate
   *  const list = new DoublyLinkedList<number>([10, 20, 30]);
@@ -2232,6 +2799,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Find value scanning from tail
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
@@ -2263,6 +2851,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Reverse in-place
   *  const list = new DoublyLinkedList<number>([1, 2, 3]);
@@ -2302,6 +2911,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Deep copy
   *  const list = new DoublyLinkedList<number>([1, 2, 3]);
@@ -2331,6 +2961,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Filter elements
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -2379,6 +3030,27 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // DoublyLinkedList for...of iteration and map operation
   *  const list = new DoublyLinkedList<number>([1, 2, 3, 4, 5]);
@@ -2804,6 +3476,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check if empty
   *  const sl = new SkipList<number, string>();
@@ -2822,6 +3515,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove all entries
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -2843,6 +3557,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Create independent copy
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -2872,6 +3607,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // In-memory sorted key-value store
   *  const store = new SkipList<number, string>();
@@ -2926,17 +3682,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
@@ -2965,6 +3742,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Check key existence
   *  const sl = new SkipList<number, string>([[1, 'a'], [3, 'c'], [5, 'e']]);
@@ -2987,6 +3785,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Fast lookup with deletion
   *  const cache = new SkipList<string, number>();
@@ -3029,6 +3848,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access the minimum entry
   *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
@@ -3051,6 +3891,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Access the maximum entry
   *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
@@ -3075,6 +3936,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove and return smallest
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
@@ -3097,6 +3979,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Remove and return largest
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
@@ -3122,6 +4025,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Least entry ≥ key
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3152,6 +4076,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Greatest entry ≤ key
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3180,6 +4125,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Strictly greater entry
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3207,6 +4173,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Strictly less entry
   *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -3240,6 +4227,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']]);
@@ -3281,6 +4289,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Transform entries
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -3306,6 +4335,27 @@ var _SkipList = class _SkipList extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
   * // Filter entries
   *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);