tree-set-typed 2.3.0 → 2.4.4

package/dist/umd/red-black-tree-typed.js

@@ -1026,8 +1026,9 @@ var redBlackTreeTyped = (() => {
         const cur = node;
         node = node.next;
         if (predicate(cur.key, cur.value, i++, this)) {
-          if (isWeakKey(cur.key)) {
-            this._objMap.delete(cur.key);
+          const keyToCheck = cur.key;
+          if (isWeakKey(keyToCheck)) {
+            this._objMap.delete(keyToCheck);
           } else {
             const hash = this._hashFn(cur.key);
             delete this._noObjMap[hash];
@@ -1540,7 +1541,7 @@ var redBlackTreeTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_length", 0);
@@ -1628,6 +1629,7 @@ var redBlackTreeTyped = (() => {
      * @returns Removed element or undefined.
      */
     pop() {
+      var _a;
       if (!this.head) return void 0;
       if (this.head === this.tail) {
         const value2 = this.head.value;
@@ -1637,8 +1639,8 @@ var redBlackTreeTyped = (() => {
         return value2;
       }
       let current = this.head;
-      while (current.next !== this.tail) current = current.next;
-      const value = this.tail.value;
+      while (current.next && current.next !== this.tail) current = current.next;
+      const value = (_a = this.tail) == null ? void 0 : _a.value;
       current.next = void 0;
       this._tail = current;
       this._length--;
@@ -1726,8 +1728,8 @@ var redBlackTreeTyped = (() => {
     at(index) {
       if (index < 0 || index >= this._length) return void 0;
       let current = this.head;
-      for (let i = 0; i < index; i++) current = current.next;
-      return current.value;
+      for (let i = 0; i < index && current; i++) current = current.next;
+      return current == null ? void 0 : current.value;
     }
     /**
      * Type guard: check whether the input is a SinglyLinkedListNode.
@@ -1747,7 +1749,7 @@ var redBlackTreeTyped = (() => {
     getNodeAt(index) {
       if (index < 0 || index >= this._length) return void 0;
       let current = this.head;
-      for (let i = 0; i < index; i++) current = current.next;
+      for (let i = 0; i < index && current; i++) current = current.next;
       return current;
     }
     /**
@@ -2261,7 +2263,7 @@ var redBlackTreeTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_length", 0);
@@ -2449,8 +2451,8 @@ var redBlackTreeTyped = (() => {
     at(index) {
       if (index < 0 || index >= this._length) return void 0;
       let current = this.head;
-      for (let i = 0; i < index; i++) current = current.next;
-      return current.value;
+      for (let i = 0; i < index && current; i++) current = current.next;
+      return current == null ? void 0 : current.value;
     }
     /**
      * Get the node reference at a given index.
@@ -2461,7 +2463,7 @@ var redBlackTreeTyped = (() => {
     getNodeAt(index) {
       if (index < 0 || index >= this._length) return void 0;
       let current = this.head;
-      for (let i = 0; i < index; i++) current = current.next;
+      for (let i = 0; i < index && current; i++) current = current.next;
       return current;
     }
     /**
@@ -2967,7 +2969,7 @@ var redBlackTreeTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
       __publicField(this, "_elements", []);
       this.pushMany(elements);
     }
@@ -3596,7 +3598,7 @@ var redBlackTreeTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
       __publicField(this, "_bucketSize", 1 << 12);
       __publicField(this, "_bucketFirst", 0);
       __publicField(this, "_firstInBucket", 0);
@@ -4665,11 +4667,6 @@ var redBlackTreeTyped = (() => {
       }
       return out;
     }
-    /**
-    * Get the comparator used to order elements.
-    * @remarks Time O(1), Space O(1)
-    * @returns Comparator function.
-    */
     /**
      * Get the comparator used to order elements.
      * @remarks Time O(1), Space O(1)
@@ -4718,8 +4715,7 @@ var redBlackTreeTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
-      return next;
+      return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
     }
     /**
      * (Protected) Create a like-kind instance seeded by elements.
@@ -5756,8 +5752,8 @@ var redBlackTreeTyped = (() => {
       const Ctor = this.constructor;
       const instance = new Ctor();
       const graph = _options == null ? void 0 : _options.graph;
-      if (graph) instance._options = { ...instance._options, ...graph };
-      else instance._options = { ...instance._options, ...this._options };
+      if (graph) instance["_options"] = { ...instance["_options"], ...graph };
+      else instance["_options"] = { ...instance["_options"], ...this._options };
       return instance;
     }
     /**
@@ -5790,12 +5786,10 @@ var redBlackTreeTyped = (() => {
         const [va, vb] = ends;
         const ka = va.key;
         const kb = vb.key;
-        const hasA = g.hasVertex ? g.hasVertex(ka) : false;
-        const hasB = g.hasVertex ? g.hasVertex(kb) : false;
+        const hasA = typeof g.hasVertex === "function" ? g.hasVertex(ka) : false;
+        const hasB = typeof g.hasVertex === "function" ? g.hasVertex(kb) : false;
         if (hasA && hasB) {
-          const w = e.weight;
-          const val = e.value;
-          const newEdge = g.createEdge(ka, kb, w, val);
+          const newEdge = g.createEdge(ka, kb, e.weight, e.value);
           g._addEdge(newEdge);
         }
       }
@@ -6960,7 +6954,7 @@ var redBlackTreeTyped = (() => {
       __publicField(this, "_size", 0);
       __publicField(this, "_NIL", new BinaryTreeNode(NaN));
       __publicField(this, "_toEntryFn");
-      __publicField(this, "_DEFAULT_NODE_CALLBACK", /* @__PURE__ */ __name((node) => node ? node.key : void 0, "_DEFAULT_NODE_CALLBACK"));
+      __publicField(this, "_DEFAULT_NODE_CALLBACK", /* @__PURE__ */ __name((node) => node == null ? void 0 : node.key, "_DEFAULT_NODE_CALLBACK"));
       if (options) {
         const { iterationType, toEntryFn, isMapMode, isDuplicate } = options;
         if (iterationType) this.iterationType = iterationType;
@@ -13142,7 +13136,7 @@ var redBlackTreeTyped = (() => {
      * @remarks Time O(1), Space O(1)
      */
     get comparator() {
-      return __privateGet(this, _core4)._comparator;
+      return __privateGet(this, _core4).comparator;
     }
     // ━━━ clear ━━━
     /**
@@ -13279,7 +13273,7 @@ var redBlackTreeTyped = (() => {
     filter(predicate) {
       const result = new _TreeMultiSet2([], {
         comparator: __privateGet(this, _isDefaultComparator4) ? void 0 : this.comparator,
-        isMapMode: __privateGet(this, _core4)._isMapMode
+        isMapMode: __privateGet(this, _core4).isMapMode
       });
       for (const [k, c] of this.entries()) {
         if (predicate(k, c)) {
@@ -13319,7 +13313,7 @@ var redBlackTreeTyped = (() => {
     map(mapper, options) {
       const result = new _TreeMultiSet2([], {
         comparator: options == null ? void 0 : options.comparator,
-        isMapMode: __privateGet(this, _core4)._isMapMode
+        isMapMode: __privateGet(this, _core4).isMapMode
       });
       for (const [k, c] of this.entries()) {
         const [newKey, newCount] = mapper(k, c);
@@ -13339,7 +13333,7 @@ var redBlackTreeTyped = (() => {
     clone() {
       const result = new _TreeMultiSet2([], {
         comparator: __privateGet(this, _isDefaultComparator4) ? void 0 : this.comparator,
-        isMapMode: __privateGet(this, _core4)._isMapMode
+        isMapMode: __privateGet(this, _core4).isMapMode
       });
       for (const [k, c] of this.entries()) {
         result.add(k, c);
@@ -14370,12 +14364,11 @@ var redBlackTreeTyped = (() => {
      */
     _createInstance(options) {
       const Ctor = this.constructor;
-      const next = new Ctor([], {
+      return new Ctor([], {
         toElementFn: this.toElementFn,
         caseSensitive: this.caseSensitive,
         ...options != null ? options : {}
       });
-      return next;
     }
     /**
      * (Protected) Create a like-kind trie and seed it from an iterable.