data-structure-typed 2.4.2 → 2.4.4

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

@@ -1,2 +1,2 @@
 import { BSTOptions } from './bst';
-export type AVLTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};
+export type AVLTreeOptions<K, V, R> = BSTOptions<K, V, R>;

package/dist/types/types/data-structures/binary-tree/red-black-tree.d.ts

@@ -1,3 +1,3 @@
 import type { BSTOptions } from './bst';
 export type RBTNColor = 'RED' | 'BLACK';
-export type RedBlackTreeOptions<K, V, R> = BSTOptions<K, V, R> & {};
+export type RedBlackTreeOptions<K, V, R> = BSTOptions<K, V, R>;

package/dist/types/types/data-structures/linked-list/doubly-linked-list.d.ts

@@ -1,2 +1,2 @@
 import { LinearBaseOptions } from '../base';
-export type DoublyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};
+export type DoublyLinkedListOptions<E, R> = LinearBaseOptions<E, R>;

package/dist/types/types/data-structures/linked-list/singly-linked-list.d.ts

@@ -1,2 +1,2 @@
 import { LinearBaseOptions } from '../base';
-export type SinglyLinkedListOptions<E, R> = LinearBaseOptions<E, R> & {};
+export type SinglyLinkedListOptions<E, R> = LinearBaseOptions<E, R>;

package/dist/types/types/data-structures/priority-queue/priority-queue.d.ts

@@ -1,2 +1,2 @@
 import { HeapOptions } from '../heap';
-export type PriorityQueueOptions<E, R> = HeapOptions<E, R> & {};
+export type PriorityQueueOptions<E, R> = HeapOptions<E, R>;

package/dist/types/types/data-structures/stack/stack.d.ts

@@ -1,2 +1,2 @@
 import { IterableElementBaseOptions } from '../base';
-export type StackOptions<E, R> = IterableElementBaseOptions<E, R> & {};
+export type StackOptions<E, R> = IterableElementBaseOptions<E, R>;

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

@@ -1105,8 +1105,9 @@ var dataStructureTyped = (() => {
         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];
@@ -1614,7 +1615,7 @@ var dataStructureTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", (a, b) => Object.is(a, b));
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_length", 0);
@@ -1702,6 +1703,7 @@ var dataStructureTyped = (() => {
      * @returns Removed element or undefined.
      */
     pop() {
+      var _a;
       if (!this.head) return void 0;
       if (this.head === this.tail) {
         const value2 = this.head.value;
@@ -1711,8 +1713,8 @@ var dataStructureTyped = (() => {
         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--;
@@ -1800,8 +1802,8 @@ var dataStructureTyped = (() => {
     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.
@@ -1821,7 +1823,7 @@ var dataStructureTyped = (() => {
     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;
     }
     /**
@@ -2332,7 +2334,7 @@ var dataStructureTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", (a, b) => Object.is(a, b));
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_length", 0);
@@ -2520,8 +2522,8 @@ var dataStructureTyped = (() => {
     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.
@@ -2532,7 +2534,7 @@ var dataStructureTyped = (() => {
     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;
     }
     /**
@@ -3038,7 +3040,7 @@ var dataStructureTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", (a, b) => Object.is(a, b));
       __publicField(this, "_elements", []);
       this.pushMany(elements);
     }
@@ -3667,7 +3669,7 @@ var dataStructureTyped = (() => {
      */
     constructor(elements = [], options) {
       super(options);
-      __publicField(this, "_equals", Object.is);
+      __publicField(this, "_equals", (a, b) => Object.is(a, b));
       __publicField(this, "_bucketSize", 1 << 12);
       __publicField(this, "_bucketFirst", 0);
       __publicField(this, "_firstInBucket", 0);
@@ -4737,11 +4739,6 @@ var dataStructureTyped = (() => {
       }
       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)
@@ -4790,8 +4787,7 @@ var dataStructureTyped = (() => {
      */
     _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.
@@ -5823,8 +5819,8 @@ var dataStructureTyped = (() => {
       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;
     }
     /**
@@ -5857,12 +5853,10 @@ var dataStructureTyped = (() => {
         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);
         }
       }
@@ -7030,7 +7024,7 @@ var dataStructureTyped = (() => {
        * @param node - The node.
        * @returns The node's key or undefined.
        */
-      __publicField(this, "_DEFAULT_NODE_CALLBACK", (node) => node ? node.key : void 0);
+      __publicField(this, "_DEFAULT_NODE_CALLBACK", (node) => node == null ? void 0 : node.key);
       if (options) {
         const { iterationType, toEntryFn, isMapMode, isDuplicate } = options;
         if (iterationType) this.iterationType = iterationType;
@@ -12160,6 +12154,21 @@ var dataStructureTyped = (() => {
       }
       return out;
     }
+    /**
+     * Creates a shallow clone of this set.
+     * @remarks Time O(n log n), Space O(n)
+     * @example
+     * const original = new TreeSet([1, 2, 3]);
+     * const copy = original.clone();
+     * copy.add(4);
+     * original.has(4); // false (original unchanged)
+     */
+    clone() {
+      return new _TreeSet(this, {
+        comparator: __privateGet(this, _isDefaultComparator) ? void 0 : __privateGet(this, _userComparator),
+        isMapMode: __privateGet(this, _core).isMapMode
+      });
+    }
   };
   _core = new WeakMap();
   _isDefaultComparator = new WeakMap();
@@ -12977,6 +12986,21 @@ var dataStructureTyped = (() => {
       }
       return out;
     }
+    /**
+     * Creates a shallow clone of this map.
+     * @remarks Time O(n log n), Space O(n)
+     * @example
+     * const original = new TreeMap([['a', 1], ['b', 2]]);
+     * const copy = original.clone();
+     * copy.set('c', 3);
+     * original.has('c'); // false (original unchanged)
+     */
+    clone() {
+      return new _TreeMap(this, {
+        comparator: __privateGet(this, _isDefaultComparator3) ? void 0 : __privateGet(this, _userComparator2),
+        isMapMode: __privateGet(this, _core3).isMapMode
+      });
+    }
   };
   _core3 = new WeakMap();
   _isDefaultComparator3 = new WeakMap();
@@ -13195,7 +13219,7 @@ var dataStructureTyped = (() => {
      * @remarks Time O(1), Space O(1)
      */
     get comparator() {
-      return __privateGet(this, _core4)._comparator;
+      return __privateGet(this, _core4).comparator;
     }
     // ━━━ clear ━━━
     /**
@@ -13332,7 +13356,7 @@ var dataStructureTyped = (() => {
     filter(predicate) {
       const result = new _TreeMultiSet([], {
         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)) {
@@ -13372,7 +13396,7 @@ var dataStructureTyped = (() => {
     map(mapper, options) {
       const result = new _TreeMultiSet([], {
         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);
@@ -13392,7 +13416,7 @@ var dataStructureTyped = (() => {
     clone() {
       const result = new _TreeMultiSet([], {
         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);
@@ -14425,12 +14449,11 @@ var dataStructureTyped = (() => {
      */
     _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.