data-structure-typed 1.53.0 → 1.53.1

package/dist/umd/data-structure-typed.js

@@ -6955,7 +6955,7 @@ var dataStructureTyped = (() => {
     constructor(keysNodesEntriesOrRaws = [], options) {
       super();
       __publicField(this, "iterationType", "ITERATIVE");
-      __publicField(this, "_isMapMode", false);
+      __publicField(this, "_isMapMode", true);
       __publicField(this, "_store", /* @__PURE__ */ new Map());
       __publicField(this, "_root");
       __publicField(this, "_size", 0);
@@ -6999,7 +6999,7 @@ var dataStructureTyped = (() => {
      * as NODE.
      */
     createNode(key, value) {
-      return new BinaryTreeNode(key, value);
+      return new BinaryTreeNode(key, this._isMapMode ? void 0 : value);
     }
     /**
      * The function creates a binary tree with the specified options.
@@ -8811,7 +8811,7 @@ var dataStructureTyped = (() => {
      * @returns The method is returning a new instance of the BSTNode class, casted as the NODE type.
      */
     createNode(key, value) {
-      return new BSTNode(key, value);
+      return new BSTNode(key, this._isMapMode ? void 0 : value);
     }
     /**
      * The function creates a new binary search tree with the specified options.
@@ -8838,9 +8838,9 @@ var dataStructureTyped = (() => {
      * @returns either a NODE object or undefined.
      */
     keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value) {
-      const [node, tValue] = super.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
+      const [node, entryValue] = super.keyValueNodeEntryRawToNodeAndValue(keyNodeEntryOrRaw, value);
       if (node === null) return [void 0, void 0];
-      return [node, tValue != null ? tValue : value];
+      return [node, value != null ? value : entryValue];
     }
     /**
      * Time Complexity: O(log n)
@@ -8906,6 +8906,7 @@ var dataStructureTyped = (() => {
       while (current !== void 0) {
         if (this.comparator(current.key, newNode.key) === 0) {
           this._replaceNode(current, newNode);
+          if (this._isMapMode) this._setValue(current.key, newValue);
           return true;
         } else if (this.comparator(current.key, newNode.key) > 0) {
           if (current.left === void 0) {
@@ -9982,7 +9983,7 @@ var dataStructureTyped = (() => {
      * type NODE.
      */
     createNode(key, value) {
-      return new AVLTreeNode(key, value);
+      return new AVLTreeNode(key, this._isMapMode ? void 0 : value);
     }
     /**
      * The function creates a new AVL tree with the specified options and returns it.
@@ -10402,7 +10403,7 @@ var dataStructureTyped = (() => {
      * returned.
      */
     createNode(key, value, color = "BLACK") {
-      return new RedBlackTreeNode(key, value, color);
+      return new RedBlackTreeNode(key, this._isMapMode ? void 0 : value, color);
     }
     /**
      * The function creates a new Red-Black Tree with the specified options.
@@ -10505,7 +10506,12 @@ var dataStructureTyped = (() => {
         if (this._isMapMode) this._setValue(newNode.key, newValue);
         this._size++;
         return true;
-      } else return insertStatus === "UPDATED";
+      }
+      if (insertStatus === "UPDATED") {
+        if (this._isMapMode) this._setValue(newNode.key, newValue);
+        return true;
+      }
+      return false;
     }
     /**
      * Time Complexity: O(log n)
@@ -10920,7 +10926,7 @@ var dataStructureTyped = (() => {
      * @returns a new instance of the AVLTreeMultiMapNode class, casted as NODE.
      */
     createNode(key, value, count) {
-      return new AVLTreeMultiMapNode(key, value, count);
+      return new AVLTreeMultiMapNode(key, this._isMapMode ? void 0 : value, count);
     }
     /**
      * The function creates a new AVLTreeMultiMap object with the specified options and returns it.
@@ -11281,7 +11287,7 @@ var dataStructureTyped = (() => {
      * @returns A new instance of the TreeMultiMapNode class, casted as NODE.
      */
     createNode(key, value, color = "BLACK", count) {
-      return new TreeMultiMapNode(key, value, count, color);
+      return new TreeMultiMapNode(key, this._isMapMode ? void 0 : value, count, color);
     }
     /**
      * The function creates a new instance of a TreeMultiMap with the specified options and returns it.