tree-multimap-typed 2.4.1 → 2.4.3

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "tree-multimap-typed",
-  "version": "2.4.1",
+  "version": "2.4.3",
   "description": "TreeMultiMap - A sorted map that allows multiple values per key",
   "browser": "dist/umd/tree-multimap-typed.min.js",
   "umd:main": "dist/umd/tree-multimap-typed.min.js",
@@ -217,6 +217,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^2.4.1"
+    "data-structure-typed": "^2.4.3"
   }
 }

package/src/data-structures/binary-tree/tree-map.ts

@@ -436,4 +436,20 @@ export class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | u
 
     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(): TreeMap<K, V> {
+    return new TreeMap<K, V>(this, {
+      comparator: this.#isDefaultComparator ? undefined : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 }

package/src/data-structures/binary-tree/tree-set.ts

@@ -404,4 +404,20 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
 
     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(): TreeSet<K> {
+    return new TreeSet<K>(this, {
+      comparator: this.#isDefaultComparator ? undefined : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 }

package/src/data-structures/trie/trie.ts

@@ -564,19 +564,17 @@ export class Trie<R = any> extends IterableElementBase<string, R> {
     const words: string[] = [];
     let found = 0;
 
-    function dfs(node: TrieNode, word: string) {
-      for (const char of node.children.keys()) {
-        const charNode = node.children.get(char);
-        if (charNode !== undefined) {
-          dfs(charNode, word.concat(char));
-        }
+    const dfs = (node: TrieNode, word: string): void => {
+      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;