data-structure-typed 2.4.1 → 2.4.3

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.4.1](https://github.com/zrwusa/data-structure-typed/compare/v2.2.3...main) (upcoming)
+## [v2.4.3](https://github.com/zrwusa/data-structure-typed/compare/v2.2.3...main) (upcoming)
 
 ## [v2.2.3](https://github.com/zrwusa/data-structure-typed/compare/v2.2.2...v2.2.3) (6 January 2026)
 

package/dist/cjs/index.cjs

@@ -12175,6 +12175,21 @@ var TreeSet = class _TreeSet {
     }
     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: this.#isDefaultComparator ? void 0 : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 };
 
 // src/data-structures/binary-tree/tree-multi-map.ts
@@ -12989,6 +13004,21 @@ var TreeMap = class _TreeMap {
     }
     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: this.#isDefaultComparator ? void 0 : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 };
 
 // src/data-structures/binary-tree/tree-multi-set.ts
@@ -14359,20 +14389,17 @@ var Trie = class extends IterableElementBase {
     prefix = this._caseProcess(prefix);
     const words = [];
     let found = 0;
-    function dfs(node, word) {
-      for (const char of node.children.keys()) {
-        const charNode = node.children.get(char);
-        if (charNode !== void 0) {
-          dfs(charNode, word.concat(char));
-        }
+    const dfs = /* @__PURE__ */ __name((node, word) => {
+      for (const [char, childNode] of node.children) {
+        if (found >= max) return;
+        dfs(childNode, word + char);
       }
       if (node.isEnd) {
-        if (found > max - 1) return;
+        if (found >= max) return;
         words.push(word);
         found++;
       }
-    }
-    __name(dfs, "dfs");
+    }, "dfs");
     let startNode = this.root;
     if (prefix) {
       for (const c of prefix) {

package/dist/cjs-legacy/index.cjs

@@ -12167,6 +12167,21 @@ var _TreeSet = class _TreeSet {
     }
     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();
@@ -12988,6 +13003,21 @@ var _TreeMap = class _TreeMap {
     }
     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();
@@ -14363,20 +14393,17 @@ var _Trie = class _Trie extends IterableElementBase {
     prefix = this._caseProcess(prefix);
     const words = [];
     let found = 0;
-    function dfs(node, word) {
-      for (const char of node.children.keys()) {
-        const charNode = node.children.get(char);
-        if (charNode !== void 0) {
-          dfs(charNode, word.concat(char));
-        }
+    const dfs = /* @__PURE__ */ __name((node, word) => {
+      for (const [char, childNode] of node.children) {
+        if (found >= max) return;
+        dfs(childNode, word + char);
       }
       if (node.isEnd) {
-        if (found > max - 1) return;
+        if (found >= max) return;
         words.push(word);
         found++;
       }
-    }
-    __name(dfs, "dfs");
+    }, "dfs");
     let startNode = this.root;
     if (prefix) {
       for (const c of prefix) {

package/dist/esm/index.mjs

@@ -12173,6 +12173,21 @@ var TreeSet = class _TreeSet {
     }
     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: this.#isDefaultComparator ? void 0 : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 };
 
 // src/data-structures/binary-tree/tree-multi-map.ts
@@ -12987,6 +13002,21 @@ var TreeMap = class _TreeMap {
     }
     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: this.#isDefaultComparator ? void 0 : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 };
 
 // src/data-structures/binary-tree/tree-multi-set.ts
@@ -14357,20 +14387,17 @@ var Trie = class extends IterableElementBase {
     prefix = this._caseProcess(prefix);
     const words = [];
     let found = 0;
-    function dfs(node, word) {
-      for (const char of node.children.keys()) {
-        const charNode = node.children.get(char);
-        if (charNode !== void 0) {
-          dfs(charNode, word.concat(char));
-        }
+    const dfs = /* @__PURE__ */ __name((node, word) => {
+      for (const [char, childNode] of node.children) {
+        if (found >= max) return;
+        dfs(childNode, word + char);
       }
       if (node.isEnd) {
-        if (found > max - 1) return;
+        if (found >= max) return;
         words.push(word);
         found++;
       }
-    }
-    __name(dfs, "dfs");
+    }, "dfs");
     let startNode = this.root;
     if (prefix) {
       for (const c of prefix) {

package/dist/esm-legacy/index.mjs

@@ -12165,6 +12165,21 @@ var _TreeSet = class _TreeSet {
     }
     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();
@@ -12986,6 +13001,21 @@ var _TreeMap = class _TreeMap {
     }
     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();
@@ -14361,20 +14391,17 @@ var _Trie = class _Trie extends IterableElementBase {
     prefix = this._caseProcess(prefix);
     const words = [];
     let found = 0;
-    function dfs(node, word) {
-      for (const char of node.children.keys()) {
-        const charNode = node.children.get(char);
-        if (charNode !== void 0) {
-          dfs(charNode, word.concat(char));
-        }
+    const dfs = /* @__PURE__ */ __name((node, word) => {
+      for (const [char, childNode] of node.children) {
+        if (found >= max) return;
+        dfs(childNode, word + char);
       }
       if (node.isEnd) {
-        if (found > max - 1) return;
+        if (found >= max) return;
         words.push(word);
         found++;
       }
-    }
-    __name(dfs, "dfs");
+    }, "dfs");
     let startNode = this.root;
     if (prefix) {
       for (const c of prefix) {

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

@@ -185,4 +185,14 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      * @param options Inclusive/exclusive bounds (defaults to inclusive).
      */
     rangeSearch(range: [K, K], options?: TreeMapRangeOptions): Array<[K, V | undefined]>;
+    /**
+     * 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(): TreeMap<K, V>;
 }

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

@@ -178,4 +178,14 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      * @param options Inclusive/exclusive bounds (defaults to inclusive).
      */
     rangeSearch(range: [K, K], options?: TreeSetRangeOptions): K[];
+    /**
+     * 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(): TreeSet<K>;
 }

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

@@ -12160,6 +12160,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 +12992,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();
@@ -14336,19 +14366,17 @@ var dataStructureTyped = (() => {
       prefix = this._caseProcess(prefix);
       const words = [];
       let found = 0;
-      function dfs(node, word) {
-        for (const char of node.children.keys()) {
-          const charNode = node.children.get(char);
-          if (charNode !== void 0) {
-            dfs(charNode, word.concat(char));
-          }
+      const dfs = (node, word) => {
+        for (const [char, childNode] of node.children) {
+          if (found >= max) return;
+          dfs(childNode, word + char);
         }
         if (node.isEnd) {
-          if (found > max - 1) return;
+          if (found >= max) return;
           words.push(word);
           found++;
         }
-      }
+      };
       let startNode = this.root;
       if (prefix) {
         for (const c of prefix) {