npm - data-structure-typed - Versions diffs - 2.4.1 → 2.4.2 - Mend

data-structure-typed 2.4.1 → 2.4.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (734) hide show

package/CHANGELOG.md CHANGED Viewed

@@ -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.2](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 CHANGED Viewed

@@ -14359,20 +14359,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 CHANGED Viewed

@@ -14363,20 +14363,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 CHANGED Viewed

@@ -14357,20 +14357,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 CHANGED Viewed

@@ -14361,20 +14361,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/umd/data-structure-typed.js CHANGED Viewed

@@ -14336,19 +14336,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) {