data-structure-typed 2.1.1 → 2.1.2

package/dist/esm/index.mjs

@@ -2057,7 +2057,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);
   }
   /**
@@ -2077,7 +2077,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.
@@ -4810,7 +4810,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);
@@ -4909,7 +4909,7 @@ var _FibonacciHeap = class _FibonacciHeap {
     this._size += heapToMerge.size;
     heapToMerge.clear();
   }
-  _createNode(element) {
+  createNode(element) {
     return new FibonacciHeapNode(element);
   }
   isEmpty() {
@@ -7069,7 +7069,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);
   }
   /**
@@ -8239,9 +8239,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.
@@ -8326,7 +8326,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;
@@ -8592,7 +8592,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);
   }
   /**
@@ -9828,7 +9828,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);
   }
   /**
@@ -9959,7 +9959,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;
@@ -10284,7 +10284,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);
   }
   /**
@@ -10721,7 +10721,7 @@ var _AVLTreeMultiMap = class _AVLTreeMultiMap extends AVLTree {
       this.addMany(keysNodesEntriesOrRaws);
     }
   }
-  _createNode(key, value = []) {
+  createNode(key, value = []) {
     return new AVLTreeMultiMapNode(key, this._isMapMode ? [] : value);
   }
   /**
@@ -10940,7 +10940,7 @@ var _TreeMultiMap = class _TreeMultiMap extends RedBlackTree {
       this.addMany(keysNodesEntriesOrRaws);
     }
   }
-  _createNode(key, value = []) {
+  createNode(key, value = []) {
     return new TreeMultiMapNode(key, this._isMapMode ? [] : value);
   }
   /**
@@ -11151,7 +11151,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);
   }
   /**
@@ -11386,9 +11386,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.
@@ -11402,7 +11402,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;
@@ -11519,7 +11519,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);
   }
   /**
@@ -11719,9 +11719,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.
@@ -11735,7 +11735,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;