data-structure-typed 1.49.0 → 1.49.2

package/benchmark/report.json

@@ -1,55 +1,490 @@
 {
+  "avl-tree": {
+    "benchmarks": [
+      {
+        "test name": "10,000 add randomly",
+        "time taken (ms)": "50.74",
+        "executions per sec": "19.71",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "10,000 add & delete randomly",
+        "time taken (ms)": "127.76",
+        "executions per sec": "7.83",
+        "sample deviation": "0.02"
+      },
+      {
+        "test name": "10,000 addMany",
+        "time taken (ms)": "57.14",
+        "executions per sec": "17.50",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "10,000 get",
+        "time taken (ms)": "52.22",
+        "executions per sec": "19.15",
+        "sample deviation": "0.01"
+      }
+    ],
+    "testName": "avl-tree"
+  },
   "binary-tree": {
     "benchmarks": [
       {
         "test name": "1,000 add randomly",
-        "time taken (ms)": "17.61",
-        "executions per sec": "56.79",
-        "sample deviation": "4.75e-4"
+        "time taken (ms)": "18.32",
+        "executions per sec": "54.59",
+        "sample deviation": "0.00"
       },
       {
         "test name": "1,000 add & delete randomly",
-        "time taken (ms)": "23.21",
-        "executions per sec": "43.08",
-        "sample deviation": "0.00"
+        "time taken (ms)": "26.54",
+        "executions per sec": "37.69",
+        "sample deviation": "0.01"
       },
       {
         "test name": "1,000 addMany",
-        "time taken (ms)": "17.89",
-        "executions per sec": "55.90",
+        "time taken (ms)": "18.79",
+        "executions per sec": "53.22",
         "sample deviation": "0.00"
       },
       {
         "test name": "1,000 get",
-        "time taken (ms)": "17.71",
-        "executions per sec": "56.47",
+        "time taken (ms)": "18.95",
+        "executions per sec": "52.78",
         "sample deviation": "0.00"
       },
       {
         "test name": "1,000 has",
-        "time taken (ms)": "17.15",
-        "executions per sec": "58.30",
-        "sample deviation": "2.88e-4"
+        "time taken (ms)": "19.76",
+        "executions per sec": "50.60",
+        "sample deviation": "0.01"
       },
       {
         "test name": "1,000 dfs",
-        "time taken (ms)": "161.44",
-        "executions per sec": "6.19",
-        "sample deviation": "0.00"
+        "time taken (ms)": "159.96",
+        "executions per sec": "6.25",
+        "sample deviation": "0.01"
       },
       {
         "test name": "1,000 bfs",
-        "time taken (ms)": "57.53",
-        "executions per sec": "17.38",
-        "sample deviation": "0.00"
+        "time taken (ms)": "73.63",
+        "executions per sec": "13.58",
+        "sample deviation": "0.08"
       },
       {
         "test name": "1,000 morris",
-        "time taken (ms)": "258.22",
-        "executions per sec": "3.87",
-        "sample deviation": "0.00"
+        "time taken (ms)": "225.93",
+        "executions per sec": "4.43",
+        "sample deviation": "0.05"
       }
     ],
     "testName": "binary-tree"
+  },
+  "bst": {
+    "benchmarks": [
+      {
+        "test name": "10,000 add randomly",
+        "time taken (ms)": "48.80",
+        "executions per sec": "20.49",
+        "sample deviation": "2.79e-4"
+      },
+      {
+        "test name": "10,000 add & delete randomly",
+        "time taken (ms)": "110.72",
+        "executions per sec": "9.03",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "10,000 addMany",
+        "time taken (ms)": "46.19",
+        "executions per sec": "21.65",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "10,000 get",
+        "time taken (ms)": "49.28",
+        "executions per sec": "20.29",
+        "sample deviation": "7.92e-4"
+      }
+    ],
+    "testName": "bst"
+  },
+  "rb-tree": {
+    "benchmarks": [
+      {
+        "test name": "100,000 add",
+        "time taken (ms)": "80.84",
+        "executions per sec": "12.37",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "100,000 add & delete randomly",
+        "time taken (ms)": "206.65",
+        "executions per sec": "4.84",
+        "sample deviation": "0.01"
+      },
+      {
+        "test name": "100,000 getNode",
+        "time taken (ms)": "57.42",
+        "executions per sec": "17.42",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "100,000 add & iterator",
+        "time taken (ms)": "109.59",
+        "executions per sec": "9.12",
+        "sample deviation": "0.00"
+      }
+    ],
+    "testName": "rb-tree"
+  },
+  "comparison": {
+    "benchmarks": [
+      {
+        "test name": "SRC PQ 10,000 add",
+        "time taken (ms)": "0.14",
+        "executions per sec": "6917.74",
+        "sample deviation": "1.81e-6"
+      },
+      {
+        "test name": "CJS PQ 10,000 add",
+        "time taken (ms)": "0.15",
+        "executions per sec": "6883.53",
+        "sample deviation": "3.84e-6"
+      },
+      {
+        "test name": "MJS PQ 10,000 add",
+        "time taken (ms)": "0.57",
+        "executions per sec": "1761.70",
+        "sample deviation": "5.07e-6"
+      },
+      {
+        "test name": "SRC PQ 10,000 add & poll",
+        "time taken (ms)": "3.45",
+        "executions per sec": "289.74",
+        "sample deviation": "3.63e-4"
+      },
+      {
+        "test name": "CJS PQ 10,000 add & poll",
+        "time taken (ms)": "3.53",
+        "executions per sec": "283.14",
+        "sample deviation": "4.73e-5"
+      },
+      {
+        "test name": "MJS PQ 10,000 add & poll",
+        "time taken (ms)": "3.31",
+        "executions per sec": "302.38",
+        "sample deviation": "3.64e-5"
+      }
+    ],
+    "testName": "comparison"
+  },
+  "directed-graph": {
+    "benchmarks": [
+      {
+        "test name": "1,000 addVertex",
+        "time taken (ms)": "0.10",
+        "executions per sec": "9860.53",
+        "sample deviation": "9.32e-7"
+      },
+      {
+        "test name": "1,000 addEdge",
+        "time taken (ms)": "6.34",
+        "executions per sec": "157.71",
+        "sample deviation": "8.55e-4"
+      },
+      {
+        "test name": "1,000 getVertex",
+        "time taken (ms)": "0.05",
+        "executions per sec": "2.16e+4",
+        "sample deviation": "4.61e-7"
+      },
+      {
+        "test name": "1,000 getEdge",
+        "time taken (ms)": "22.67",
+        "executions per sec": "44.12",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "tarjan",
+        "time taken (ms)": "217.59",
+        "executions per sec": "4.60",
+        "sample deviation": "0.01"
+      },
+      {
+        "test name": "tarjan all",
+        "time taken (ms)": "6489.86",
+        "executions per sec": "0.15",
+        "sample deviation": "0.09"
+      },
+      {
+        "test name": "topologicalSort",
+        "time taken (ms)": "179.22",
+        "executions per sec": "5.58",
+        "sample deviation": "0.00"
+      }
+    ],
+    "testName": "directed-graph"
+  },
+  "hash-map": {
+    "benchmarks": [
+      {
+        "test name": "1,000,000 set",
+        "time taken (ms)": "108.75",
+        "executions per sec": "9.20",
+        "sample deviation": "0.04"
+      },
+      {
+        "test name": "Native Map 1,000,000 set",
+        "time taken (ms)": "217.55",
+        "executions per sec": "4.60",
+        "sample deviation": "0.02"
+      },
+      {
+        "test name": "Native Set 1,000,000 add",
+        "time taken (ms)": "179.67",
+        "executions per sec": "5.57",
+        "sample deviation": "0.03"
+      },
+      {
+        "test name": "1,000,000 set & get",
+        "time taken (ms)": "122.66",
+        "executions per sec": "8.15",
+        "sample deviation": "0.03"
+      },
+      {
+        "test name": "Native Map 1,000,000 set & get",
+        "time taken (ms)": "282.47",
+        "executions per sec": "3.54",
+        "sample deviation": "0.04"
+      },
+      {
+        "test name": "Native Set 1,000,000 add & has",
+        "time taken (ms)": "174.48",
+        "executions per sec": "5.73",
+        "sample deviation": "0.02"
+      },
+      {
+        "test name": "1,000,000 ObjKey set & get",
+        "time taken (ms)": "336.83",
+        "executions per sec": "2.97",
+        "sample deviation": "0.06"
+      },
+      {
+        "test name": "Native Map 1,000,000 ObjKey set & get",
+        "time taken (ms)": "314.00",
+        "executions per sec": "3.18",
+        "sample deviation": "0.06"
+      },
+      {
+        "test name": "Native Set 1,000,000 ObjKey add & has",
+        "time taken (ms)": "267.84",
+        "executions per sec": "3.73",
+        "sample deviation": "0.03"
+      }
+    ],
+    "testName": "hash-map"
+  },
+  "heap": {
+    "benchmarks": [
+      {
+        "test name": "100,000 add & poll",
+        "time taken (ms)": "80.49",
+        "executions per sec": "12.42",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "100,000 add & dfs",
+        "time taken (ms)": "34.01",
+        "executions per sec": "29.40",
+        "sample deviation": "3.88e-4"
+      },
+      {
+        "test name": "10,000 fib add & pop",
+        "time taken (ms)": "359.70",
+        "executions per sec": "2.78",
+        "sample deviation": "0.00"
+      }
+    ],
+    "testName": "heap"
+  },
+  "doubly-linked-list": {
+    "benchmarks": [
+      {
+        "test name": "1,000,000 push",
+        "time taken (ms)": "229.17",
+        "executions per sec": "4.36",
+        "sample deviation": "0.06"
+      },
+      {
+        "test name": "1,000,000 unshift",
+        "time taken (ms)": "220.53",
+        "executions per sec": "4.53",
+        "sample deviation": "0.06"
+      },
+      {
+        "test name": "1,000,000 unshift & shift",
+        "time taken (ms)": "172.12",
+        "executions per sec": "5.81",
+        "sample deviation": "0.03"
+      },
+      {
+        "test name": "1,000,000 addBefore",
+        "time taken (ms)": "309.58",
+        "executions per sec": "3.23",
+        "sample deviation": "0.06"
+      }
+    ],
+    "testName": "doubly-linked-list"
+  },
+  "singly-linked-list": {
+    "benchmarks": [
+      {
+        "test name": "1,000,000 push & shift",
+        "time taken (ms)": "211.62",
+        "executions per sec": "4.73",
+        "sample deviation": "0.06"
+      },
+      {
+        "test name": "10,000 push & pop",
+        "time taken (ms)": "219.72",
+        "executions per sec": "4.55",
+        "sample deviation": "0.03"
+      },
+      {
+        "test name": "10,000 addBefore",
+        "time taken (ms)": "249.09",
+        "executions per sec": "4.01",
+        "sample deviation": "0.01"
+      }
+    ],
+    "testName": "singly-linked-list"
+  },
+  "max-priority-queue": {
+    "benchmarks": [
+      {
+        "test name": "10,000 refill & poll",
+        "time taken (ms)": "8.96",
+        "executions per sec": "111.61",
+        "sample deviation": "1.80e-4"
+      }
+    ],
+    "testName": "max-priority-queue"
+  },
+  "priority-queue": {
+    "benchmarks": [
+      {
+        "test name": "100,000 add & poll",
+        "time taken (ms)": "106.14",
+        "executions per sec": "9.42",
+        "sample deviation": "0.00"
+      }
+    ],
+    "testName": "priority-queue"
+  },
+  "deque": {
+    "benchmarks": [
+      {
+        "test name": "1,000,000 push",
+        "time taken (ms)": "13.91",
+        "executions per sec": "71.89",
+        "sample deviation": "4.15e-4"
+      },
+      {
+        "test name": "1,000,000 push & pop",
+        "time taken (ms)": "22.82",
+        "executions per sec": "43.83",
+        "sample deviation": "2.45e-4"
+      },
+      {
+        "test name": "100,000 push & shift",
+        "time taken (ms)": "2.38",
+        "executions per sec": "420.49",
+        "sample deviation": "3.61e-5"
+      },
+      {
+        "test name": "Native Array 100,000 push & shift",
+        "time taken (ms)": "2718.62",
+        "executions per sec": "0.37",
+        "sample deviation": "0.35"
+      },
+      {
+        "test name": "100,000 unshift & shift",
+        "time taken (ms)": "2.28",
+        "executions per sec": "438.78",
+        "sample deviation": "4.18e-4"
+      },
+      {
+        "test name": "Native Array 100,000 unshift & shift",
+        "time taken (ms)": "4065.01",
+        "executions per sec": "0.25",
+        "sample deviation": "0.21"
+      }
+    ],
+    "testName": "deque"
+  },
+  "queue": {
+    "benchmarks": [
+      {
+        "test name": "1,000,000 push",
+        "time taken (ms)": "44.46",
+        "executions per sec": "22.49",
+        "sample deviation": "0.01"
+      },
+      {
+        "test name": "100,000 push & shift",
+        "time taken (ms)": "5.16",
+        "executions per sec": "193.83",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "Native Array 100,000 push & shift",
+        "time taken (ms)": "2195.56",
+        "executions per sec": "0.46",
+        "sample deviation": "0.29"
+      },
+      {
+        "test name": "Native Array 100,000 push & pop",
+        "time taken (ms)": "4.40",
+        "executions per sec": "227.04",
+        "sample deviation": "0.00"
+      }
+    ],
+    "testName": "queue"
+  },
+  "stack": {
+    "benchmarks": [
+      {
+        "test name": "1,000,000 push",
+        "time taken (ms)": "44.05",
+        "executions per sec": "22.70",
+        "sample deviation": "0.01"
+      },
+      {
+        "test name": "1,000,000 push & pop",
+        "time taken (ms)": "49.72",
+        "executions per sec": "20.11",
+        "sample deviation": "0.01"
+      }
+    ],
+    "testName": "stack"
+  },
+  "trie": {
+    "benchmarks": [
+      {
+        "test name": "100,000 push",
+        "time taken (ms)": "44.33",
+        "executions per sec": "22.56",
+        "sample deviation": "0.00"
+      },
+      {
+        "test name": "100,000 getWords",
+        "time taken (ms)": "88.47",
+        "executions per sec": "11.30",
+        "sample deviation": "0.01"
+      }
+    ],
+    "testName": "trie"
   }
 }

package/dist/cjs/data-structures/base/iterable-base.d.ts

@@ -126,6 +126,12 @@ export declare abstract class IterableEntryBase<K = any, V = any> {
      * all the elements in the collection.
      */
     reduce<U>(callbackfn: ReduceEntryCallback<K, V, U>, initialValue: U): U;
+    hasValue(value: V): boolean;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    print(): void;
     protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
 }
 export declare abstract class IterableElementBase<V> {
@@ -228,5 +234,10 @@ export declare abstract class IterableElementBase<V> {
      * all the elements in the array and applying the callback function to each element.
      */
     reduce<U>(callbackfn: ReduceElementCallback<V, U>, initialValue: U): U;
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    print(): void;
     protected abstract _getIterator(...args: any[]): IterableIterator<V>;
 }

package/dist/cjs/data-structures/base/iterable-base.js

@@ -172,6 +172,20 @@ class IterableEntryBase {
         }
         return accumulator;
     }
+    hasValue(value) {
+        for (const [, elementValue] of this) {
+            if (elementValue === value)
+                return true;
+        }
+        return false;
+    }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    print() {
+        console.log([...this]);
+    }
 }
 exports.IterableEntryBase = IterableEntryBase;
 class IterableElementBase {
@@ -308,6 +322,13 @@ class IterableElementBase {
         }
         return accumulator;
     }
+    /**
+     * Time Complexity: O(n)
+     * Space Complexity: O(n)
+     */
+    print() {
+        console.log([...this]);
+    }
 }
 exports.IterableElementBase = IterableElementBase;
 //# sourceMappingURL=iterable-base.js.map

package/dist/cjs/data-structures/base/iterable-base.js.map

@@ -1 +1 @@
-{"version":3,"file":"iterable-base.js","sourceRoot":"","sources":["../../../../src/data-structures/base/iterable-base.ts"],"names":[],"mappings":";;;AAEA,MAAsB,iBAAiB;IAErC;;;OAGG;IAEH;;;;;;;;OAQG;IACH,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAW;QAChC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH;;;;;;OAMG;IACH,CAAE,OAAO;QACP,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;OAKG;IACH,CAAE,IAAI;QACJ,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;OAKG;IACH,CAAE,MAAM;QACN,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,SAAuC,EAAE,OAAa;QAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC9D,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;;OAcG;IACH,IAAI,CAAC,SAAuC,EAAE,OAAa;QACzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC7D,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,UAAqC,EAAE,OAAa;QAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAI,UAAwC,EAAE,YAAe;QACjE,IAAI,WAAW,GAAG,YAAY,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QAClE,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;CAGF;AAtLD,8CAsLC;AAED,MAAsB,mBAAmB;IAEvC;;;OAGG;IACH;;;;;;;;OAQG;IACH,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAW;QAChC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH;;;;;OAKG;IACH,CAAE,MAAM;QACN,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,SAAsC,EAAE,OAAa;QACzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;OAaG;IACH,IAAI,CAAC,SAAsC,EAAE,OAAa;QACxD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACtD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,UAAoC,EAAE,OAAa;QACzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QACpD,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;OAYG;IACH,MAAM,CAAI,UAAuC,EAAE,YAAe;QAChE,IAAI,WAAW,GAAG,YAAY,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QACjE,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;CAGF;AA9ID,kDA8IC"}
+{"version":3,"file":"iterable-base.js","sourceRoot":"","sources":["../../../../src/data-structures/base/iterable-base.ts"],"names":[],"mappings":";;;AAEA,MAAsB,iBAAiB;IAErC;;;OAGG;IAEH;;;;;;;;OAQG;IACH,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAW;QAChC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH;;;;;;OAMG;IACH,CAAE,OAAO;QACP,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;OAKG;IACH,CAAE,IAAI;QACJ,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;OAKG;IACH,CAAE,MAAM;QACN,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,SAAuC,EAAE,OAAa;QAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC9D,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;;OAcG;IACH,IAAI,CAAC,SAAuC,EAAE,OAAa;QACzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC7D,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,UAAqC,EAAE,OAAa;QAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QACrD,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAI,UAAwC,EAAE,YAAe;QACjE,IAAI,WAAW,GAAG,YAAY,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QAClE,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,IAAI,EAAE,CAAC;YACpC,IAAI,YAAY,KAAK,KAAK;gBAAE,OAAO,IAAI,CAAC;QAC1C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;IACxB,CAAC;CAGF;AArMD,8CAqMC;AAED,MAAsB,mBAAmB;IAEvC;;;OAGG;IACH;;;;;;;;OAQG;IACH,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAW;QAChC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH;;;;;OAKG;IACH,CAAE,MAAM;QACN,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,SAAsC,EAAE,OAAa;QACzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvD,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;;OAaG;IACH,IAAI,CAAC,SAAsC,EAAE,OAAa;QACxD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBACtD,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,UAAoC,EAAE,OAAa;QACzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QACpD,CAAC;IACH,CAAC;IAED;;;OAGG;IACH;;;;;;;;;;;;OAYG;IACH,MAAM,CAAI,UAAuC,EAAE,YAAe;QAChE,IAAI,WAAW,GAAG,YAAY,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,IAAS,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;QACjE,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAGD;;;OAGG;IACH,KAAK;QACH,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAA;IACxB,CAAC;CAGF;AAvJD,kDAuJC"}

package/dist/cjs/data-structures/binary-tree/avl-tree.d.ts

@@ -6,8 +6,7 @@
  * @license MIT License
  */
 import { BST, BSTNode } from './bst';
-import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BiTreeDeleteResult, BSTNodeKeyOrNode, BTNodeExemplar } from '../../types';
-import { BTNCallback, BTNodeKeyOrNode } from '../../types';
+import type { AVLTreeNested, AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeleteResult, BSTNKeyOrNode, BTNCallback, BTNExemplar, BTNKeyOrNode } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 export declare class AVLTreeNode<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeNodeNested<K, V>> extends BSTNode<K, V, N> {
     height: number;
@@ -21,19 +20,18 @@ export declare class AVLTreeNode<K = any, V = any, N extends AVLTreeNode<K, V, N
  * 5. Efficient Lookups: Offers O(log n) search time, where 'n' is the number of nodes, due to its balanced nature.
  * 6. Complex Insertions and Deletions: Due to rebalancing, these operations are more complex than in a regular BST.
  * 7. Path Length: The path length from the root to any leaf is longer compared to an unbalanced BST, but shorter than a linear chain of nodes.
- * 8. Memory Overhead: Stores balance factors (or heights) at each node, leading to slightly higher memory usage compared to a regular BST.
  */
 export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, N, TREE> = AVLTree<K, V, N, AVLTreeNested<K, V, N>>> extends BST<K, V, N, TREE> implements IBinaryTree<K, V, N, TREE> {
     /**
      * The constructor function initializes an AVLTree object with optional elements and options.
-     * @param [elements] - The `elements` parameter is an optional iterable of `BTNodeExemplar<K, V, N>`
+     * @param [elements] - The `elements` parameter is an optional iterable of `BTNExemplar<K, V, N>`
      * objects. It represents a collection of elements that will be added to the AVL tree during
      * initialization.
      * @param [options] - The `options` parameter is an optional object that allows you to customize the
      * behavior of the AVL tree. It is of type `Partial<AVLTreeOptions>`, which means that you can
      * provide only a subset of the properties defined in the `AVLTreeOptions` interface.
      */
-    constructor(elements?: Iterable<BTNodeExemplar<K, V, N>>, options?: Partial<AVLTreeOptions<K>>);
+    constructor(elements?: Iterable<BTNExemplar<K, V, N>>, options?: Partial<AVLTreeOptions<K>>);
     /**
      * The function creates a new AVL tree node with the specified key and value.
      * @param {K} key - The key parameter is the key value that will be associated with
@@ -54,17 +52,17 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
     createTree(options?: AVLTreeOptions<K>): TREE;
     /**
      * The function checks if an exemplar is an instance of AVLTreeNode.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
+     * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`.
      * @returns a boolean value indicating whether the exemplar is an instance of the AVLTreeNode class.
      */
-    isNode(exemplar: BTNodeExemplar<K, V, N>): exemplar is N;
+    isNode(exemplar: BTNExemplar<K, V, N>): exemplar is N;
     /**
      * The function "isNotNodeInstance" checks if a potential key is a K.
      * @param {any} potentialKey - The potentialKey parameter is of type any, which means it can be any
      * data type.
      * @returns a boolean value indicating whether the potentialKey is of type number or not.
      */
-    isNotNodeInstance(potentialKey: BTNodeKeyOrNode<K, N>): potentialKey is K;
+    isNotNodeInstance(potentialKey: BTNKeyOrNode<K, N>): potentialKey is K;
     /**
      * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
      * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
@@ -81,7 +79,7 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      * being added to the binary tree.
      * @returns The method is returning either the inserted node or undefined.
      */
-    add(keyOrNodeOrEntry: BTNodeExemplar<K, V, N>, value?: V): N | undefined;
+    add(keyOrNodeOrEntry: BTNExemplar<K, V, N>, value?: V): N | undefined;
     /**
      * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
      * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
@@ -99,9 +97,9 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      * that is deleted from the binary tree. It is an optional parameter and if not provided, it will
      * default to the `_defaultOneParamCallback` function. The `callback` function should have a single
      * parameter of type `N
-     * @returns The method is returning an array of `BiTreeDeleteResult<N>`.
+     * @returns The method is returning an array of `BinaryTreeDeleteResult<N>`.
      */
-    delete<C extends BTNCallback<N>>(identifier: ReturnType<C>, callback?: C): BiTreeDeleteResult<N>[];
+    delete<C extends BTNCallback<N>>(identifier: ReturnType<C>, callback?: C): BinaryTreeDeleteResult<N>[];
     /**
      * The `_swapProperties` function swaps the key, value, and height properties between two nodes in a binary
      * tree.
@@ -112,7 +110,7 @@ export declare class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> =
      * @returns either the `destNode` object if both `srcNode` and `destNode` are defined, or `undefined`
      * if either `srcNode` or `destNode` is undefined.
      */
-    protected _swapProperties(srcNode: BSTNodeKeyOrNode<K, N>, destNode: BSTNodeKeyOrNode<K, N>): N | undefined;
+    protected _swapProperties(srcNode: BSTNKeyOrNode<K, N>, destNode: BSTNKeyOrNode<K, N>): N | undefined;
     /**
      * Time Complexity: O(1) - constant time, as it performs a fixed number of operations.
      * Space Complexity: O(1) - constant space, as it only uses a constant amount of memory.