data-structure-typed 2.1.1 → 2.1.2

package/CHANGELOG.md

@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v2.1.1](https://github.com/zrwusa/data-structure-typed/compare/v2.0.4...main) (upcoming)
+## [v2.1.2](https://github.com/zrwusa/data-structure-typed/compare/v2.0.4...main) (upcoming)
 
 ### Changes
 

package/README.md

@@ -32,7 +32,6 @@ yarn add data-structure-typed
 
 [Playground](https://stackblitz.com/edit/data-structure-typed-playground?file=src%2Fmain.ts)
 
-
 ```js
 import {
   Heap, Graph, Queue, Deque, PriorityQueue, BST, Trie, DoublyLinkedList,
@@ -50,7 +49,7 @@ npm i heap-typed --save
 ## Why
 
 Do you envy C++ with [STL]() (std::), Python with [collections](), and Java with [java.util]() ? Well, no need to envy
-anymore! JavaScript and TypeScript now have [data-structure-typed]().**`Benchmark`** compared with C++ STL. 
+anymore! JavaScript and TypeScript now have [data-structure-typed]().**`Benchmark`** compared with C++ STL.
 **`API standards`** aligned with ES6 and Java. **`Usability`** is comparable to Python
 
 
@@ -214,8 +213,6 @@ Performance surpasses that of native JS/TS
   </tr>
 </table>
 
-
-
 ### Conciseness and uniformity
 
 In [java.utils](), you need to memorize a table for all sequential data structures(Queue, Deque, LinkedList),
@@ -801,7 +798,6 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', '
 
 ```
 
-
 [//]: # (No deletion!!! Start of Example Replace Section)
 
 
@@ -832,9 +828,10 @@ macOS Big Sur
 Version 11.7.9
 
 ***Our performance testing is conducted directly on the TypeScript source code. The actual performance of the compiled JavaScript code is generally 3 times higher. We have compared it with C++, and it is only 30% slower than C++.***
-Try it 
+Try it
 
 Just run
+
 ```shell
 pnpm perf:rbtree
 ```
@@ -847,7 +844,8 @@ pnpm perf:rbtree
 ```
 
 [//]: # (No deletion!!! Start of Replace Section)
-<h2>comparison</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>SRC PQ 1,000,000 add</td><td>36.30</td><td>0.04</td><td>0.01</td></tr><tr><td>CJS PQ 100,000 add</td><td>2.76</td><td>0.00</td><td>1.11e-4</td></tr><tr><td>MJS PQ 100,000 add</td><td>14.33</td><td>0.01</td><td>2.60e-4</td></tr><tr><td>CPT PQ 100,000 add</td><td>4.81</td><td>0.00</td><td>1.36e-4</td></tr><tr><td>SRC PQ 100,000 add & poll</td><td>22.57</td><td>0.02</td><td>4.66e-4</td></tr><tr><td>CJS PQ 100,000 add & poll</td><td>22.84</td><td>0.02</td><td>6.65e-4</td></tr><tr><td>MJS PQ 100,000 add & poll</td><td>23.43</td><td>0.02</td><td>0.00</td></tr><tr><td>CPT PQ 1,000,000 add & pop</td><td>181.14</td><td>0.18</td><td>0.03</td></tr><tr><td>CPT OM 100,000 add</td><td>26.64</td><td>0.03</td><td>0.00</td></tr><tr><td>CPT HM 100,000 set</td><td>5.90</td><td>0.01</td><td>8.46e-4</td></tr><tr><td>CPT HM 100,000 set & get</td><td>6.69</td><td>0.01</td><td>7.52e-4</td></tr><tr><td>CPT LL 1,000,000 unshift</td><td>19.78</td><td>0.02</td><td>0.01</td></tr><tr><td>CPT PQ 100,000 add & pop</td><td>14.36</td><td>0.01</td><td>0.00</td></tr><tr><td>CPT DQ 1,000,000 push</td><td>8.11</td><td>0.01</td><td>5.23e-4</td></tr><tr><td>CPT Q 1,000,000 push</td><td>30.25</td><td>0.03</td><td>0.01</td></tr><tr><td>CPT ST 1,000,000 push</td><td>27.10</td><td>0.03</td><td>0.00</td></tr><tr><td>CPT ST 1,000,000 push & pop</td><td>30.19</td><td>0.03</td><td>0.00</td></tr></tbody></table>[//]: # (No deletion!!! End of Replace Section)
+<h2>comparison</h2><table><thead><tr><th>test name</th><th>time taken (ms)</th><th>sample mean (secs)</th><th>sample deviation</th></tr></thead><tbody><tr><td>SRC PQ 1,000,000 add</td><td>36.30</td><td>0.04</td><td>0.01</td></tr><tr><td>CJS PQ 100,000 add</td><td>2.76</td><td>0.00</td><td>1.11e-4</td></tr><tr><td>MJS PQ 100,000 add</td><td>14.33</td><td>0.01</td><td>2.60e-4</td></tr><tr><td>CPT PQ 100,000 add</td><td>4.81</td><td>0.00</td><td>1.36e-4</td></tr><tr><td>SRC PQ 100,000 add & poll</td><td>22.57</td><td>0.02</td><td>4.66e-4</td></tr><tr><td>CJS PQ 100,000 add & poll</td><td>22.84</td><td>0.02</td><td>6.65e-4</td></tr><tr><td>MJS PQ 100,000 add & poll</td><td>23.43</td><td>0.02</td><td>0.00</td></tr><tr><td>CPT PQ 1,000,000 add & pop</td><td>181.14</td><td>0.18</td><td>0.03</td></tr><tr><td>CPT OM 100,000 add</td><td>26.64</td><td>0.03</td><td>0.00</td></tr><tr><td>CPT HM 100,000 set</td><td>5.90</td><td>0.01</td><td>8.46e-4</td></tr><tr><td>CPT HM 100,000 set & get</td><td>
+6.69</td><td>0.01</td><td>7.52e-4</td></tr><tr><td>CPT LL 1,000,000 unshift</td><td>19.78</td><td>0.02</td><td>0.01</td></tr><tr><td>CPT PQ 100,000 add & pop</td><td>14.36</td><td>0.01</td><td>0.00</td></tr><tr><td>CPT DQ 1,000,000 push</td><td>8.11</td><td>0.01</td><td>5.23e-4</td></tr><tr><td>CPT Q 1,000,000 push</td><td>30.25</td><td>0.03</td><td>0.01</td></tr><tr><td>CPT ST 1,000,000 push</td><td>27.10</td><td>0.03</td><td>0.00</td></tr><tr><td>CPT ST 1,000,000 push & pop</td><td>30.19</td><td>0.03</td><td>0.00</td></tr></tbody></table>[//]: # (No deletion!!! End of Replace Section)
 
 ## The corresponding relationships between data structures in different language standard libraries.
 
@@ -1182,6 +1180,20 @@ Copy the line below into the head tag in an HTML document.
 
 #### development
 
+##### ES Module
+
+```html
+
+<script type="module">
+  import { BST } from "https://cdn.jsdelivr.net/npm/data-structure-typed/dist/esm/index.mjs";
+
+  const bst = new BST([2, 1, 6, 7, 5, 3, 4, 8, 9]);
+  bst.print();
+</script>
+```
+
+##### UMD
+
 ```html
 
 <script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.js'></script>

package/dist/cjs/index.cjs

@@ -2059,7 +2059,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @param value - Value to wrap in a node.
    * @returns A new SinglyLinkedListNode instance.
    */
-  _createNode(value) {
+  createNode(value) {
     return new SinglyLinkedListNode(value);
   }
   /**
@@ -2079,7 +2079,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    */
   _ensureNode(elementOrNode) {
     if (this.isNode(elementOrNode)) return elementOrNode;
-    return this._createNode(elementOrNode);
+    return this.createNode(elementOrNode);
   }
   /**
    * (Protected) Normalize input into a node predicate.
@@ -4812,7 +4812,7 @@ var _FibonacciHeap = class _FibonacciHeap {
    * @returns This heap.
    */
   push(element) {
-    const node = this._createNode(element);
+    const node = this.createNode(element);
     node.left = node;
     node.right = node;
     this.mergeWithRoot(node);
@@ -4911,7 +4911,7 @@ var _FibonacciHeap = class _FibonacciHeap {
     this._size += heapToMerge.size;
     heapToMerge.clear();
   }
-  _createNode(element) {
+  createNode(element) {
     return new FibonacciHeapNode(element);
   }
   isEmpty() {
@@ -7071,7 +7071,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
    * @param [value] - The value for the new node (used if not in Map mode).
    * @returns The newly created node.
    */
-  _createNode(key, value) {
+  createNode(key, value) {
     return new BinaryTreeNode(key, this._isMapMode ? void 0 : value);
   }
   /**
@@ -8241,9 +8241,9 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
       if (key === void 0) return [void 0, void 0];
       else if (key === null) return [null, void 0];
       const finalValue = value != null ? value : entryValue;
-      return [this._createNode(key, finalValue), finalValue];
+      return [this.createNode(key, finalValue), finalValue];
     }
-    return [this._createNode(keyNodeOrEntry, value), value];
+    return [this.createNode(keyNodeOrEntry, value), value];
   }
   /**
    * (Protected) Helper for cloning. Performs a BFS and adds all nodes to the new tree.
@@ -8328,7 +8328,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value } = destNode;
-      const tempNode = this._createNode(key, value);
+      const tempNode = this.createNode(key, value);
       if (tempNode) {
         destNode.key = srcNode.key;
         if (!this._isMapMode) destNode.value = srcNode.value;
@@ -8594,7 +8594,7 @@ var _BST = class _BST extends BinaryTree {
    * @param [value] - The value for the new node (used if not in Map mode).
    * @returns The newly created BSTNode.
    */
-  _createNode(key, value) {
+  createNode(key, value) {
     return new BSTNode(key, this._isMapMode ? void 0 : value);
   }
   /**
@@ -9830,7 +9830,7 @@ var _AVLTree = class _AVLTree extends BST {
    * @param [value] - The value for the new node.
    * @returns The newly created AVLTreeNode.
    */
-  _createNode(key, value) {
+  createNode(key, value) {
     return new AVLTreeNode(key, this._isMapMode ? void 0 : value);
   }
   /**
@@ -9961,7 +9961,7 @@ var _AVLTree = class _AVLTree extends BST {
     const destNodeEnsured = this.ensureNode(destNode);
     if (srcNodeEnsured && destNodeEnsured) {
       const { key, value, height } = destNodeEnsured;
-      const tempNode = this._createNode(key, value);
+      const tempNode = this.createNode(key, value);
       if (tempNode) {
         tempNode.height = height;
         destNodeEnsured.key = srcNodeEnsured.key;
@@ -10286,7 +10286,7 @@ var _RedBlackTree = class _RedBlackTree extends BST {
    * @param color - See parameter type for details.
    * @returns A new RedBlackTreeNode instance.
    */
-  _createNode(key, value, color = "BLACK") {
+  createNode(key, value, color = "BLACK") {
     return new RedBlackTreeNode(key, this._isMapMode ? void 0 : value, color);
   }
   /**
@@ -10723,7 +10723,7 @@ var _AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
       this.addMany(keysNodesEntriesOrRaws);
     }
   }
-  _createNode(key, value = []) {
+  createNode(key, value = []) {
     return new AVLTreeMultiMapNode(key, this._isMapMode ? [] : value);
   }
   /**
@@ -10942,7 +10942,7 @@ var _TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
       this.addMany(keysNodesEntriesOrRaws);
     }
   }
-  _createNode(key, value = []) {
+  createNode(key, value = []) {
     return new TreeMultiMapNode(key, this._isMapMode ? [] : value);
   }
   /**
@@ -11153,7 +11153,7 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
     this.dfs((node) => sum += node ? node.count : 0);
     return sum;
   }
-  _createNode(key, value, color = "BLACK", count) {
+  createNode(key, value, color = "BLACK", count) {
     return new TreeCounterNode(key, this._isMapMode ? void 0 : value, count, color);
   }
   /**
@@ -11388,9 +11388,9 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
       const [key, entryValue] = keyNodeOrEntry;
       if (key === void 0 || key === null) return [void 0, void 0];
       const finalValue = value != null ? value : entryValue;
-      return [this._createNode(key, finalValue, "BLACK", count), finalValue];
+      return [this.createNode(key, finalValue, "BLACK", count), finalValue];
     }
-    return [this._createNode(keyNodeOrEntry, value, "BLACK", count), value];
+    return [this.createNode(keyNodeOrEntry, value, "BLACK", count), value];
   }
   /**
    * (Protected) Swap keys/values/counters between the source and destination nodes.
@@ -11404,7 +11404,7 @@ var _TreeCounter = class _TreeCounter extends RedBlackTree {
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value, count, color } = destNode;
-      const tempNode = this._createNode(key, value, color, count);
+      const tempNode = this.createNode(key, value, color, count);
       if (tempNode) {
         tempNode.color = color;
         destNode.key = srcNode.key;
@@ -11521,7 +11521,7 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
     this.dfs((node) => sum += node.count);
     return sum;
   }
-  _createNode(key, value, count) {
+  createNode(key, value, count) {
     return new AVLTreeCounterNode(key, this._isMapMode ? void 0 : value, count);
   }
   /**
@@ -11721,9 +11721,9 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
       const [key, entryValue] = keyNodeOrEntry;
       if (key === void 0 || key === null) return [void 0, void 0];
       const finalValue = value != null ? value : entryValue;
-      return [this._createNode(key, finalValue, count), finalValue];
+      return [this.createNode(key, finalValue, count), finalValue];
     }
-    return [this._createNode(keyNodeOrEntry, value, count), value];
+    return [this.createNode(keyNodeOrEntry, value, count), value];
   }
   /**
    * (Protected) Swap keys/values/counters between the source and destination nodes.
@@ -11737,7 +11737,7 @@ var _AVLTreeCounter = class _AVLTreeCounter extends AVLTree {
     destNode = this.ensureNode(destNode);
     if (srcNode && destNode) {
       const { key, value, count, height } = destNode;
-      const tempNode = this._createNode(key, value, count);
+      const tempNode = this.createNode(key, value, count);
       if (tempNode) {
         tempNode.height = height;
         destNode.key = srcNode.key;