fast-trie-search - npm Package Compare versions

Comparing version 1.1.4 to 1.1.5

lib/cjs/trieSearch.js

@@ -10,4 +10,4 @@ "use strict";
     constructor() {
-        this.map = {};
-        this.words = [];
+        this.m = {};
+        this.w = [];
     }
@@ -48,3 +48,3 @@ }
             if (opts.addKey === true) {
-                nodeObj.key = trieKey++;
+                nodeObj.k = trieKey++;
             }
@@ -62,3 +62,3 @@ if (!opts.excludeNodes.includes(expandedElement[i].toLowerCase())) {
     // empty out the top level array as it serves no purpose and adds to the size
-    root.words = [];
+    root.w = [];
     return root;
@@ -70,10 +70,10 @@ };
     if (startIndex === node.length) {
-        root.words.push(str);
+        root.w.push(str);
         return;
     }
-    if (!root.map[node[startIndex]]) {
-        root.map[node[startIndex]] = new TrieNode();
+    if (!root.m[node[startIndex]]) {
+        root.m[node[startIndex]] = new TrieNode();
     }
-    root.words.push(str);
-    add(str, startIndex + 1, root.map[node[startIndex]]);
+    root.w.push(str);
+    add(str, startIndex + 1, root.m[node[startIndex]]);
 };
@@ -83,8 +83,8 @@ const search = (str, startIndex, root) => {
     if (startIndex === str.length && startIndex !== 0) {
-        return root.words;
+        return root.w;
     }
-    if (!root.map[str[startIndex]])
+    if (!root.m[str[startIndex]])
         return [];
-    return search(str, startIndex + 1, root.map[str[startIndex]]);
+    return search(str, startIndex + 1, root.m[str[startIndex]]);
 };
 exports.search = search;

lib/cjs/types/trieSearch.d.ts

@@ -8,4 +8,4 @@ type Options = {
 declare class TrieNode {
-    map: any;
-    words: any;
+    m: any;
+    w: any;
     constructor();
@@ -12,0 +12,0 @@ }

lib/esm/trieSearch.js

 import parseRegex from "regex-parser";
 class TrieNode {
-    map;
-    words;
+    m; //map
+    w; //words 
     constructor() {
-        this.map = {};
-        this.words = [];
+        this.m = {};
+        this.w = [];
     }
@@ -42,3 +42,3 @@ }
             if (opts.addKey === true) {
-                nodeObj.key = trieKey++;
+                nodeObj.k = trieKey++;
             }
@@ -56,3 +56,3 @@ if (!opts.excludeNodes.includes(expandedElement[i].toLowerCase())) {
     // empty out the top level array as it serves no purpose and adds to the size
-    root.words = [];
+    root.w = [];
     return root;
@@ -63,10 +63,10 @@ };
     if (startIndex === node.length) {
-        root.words.push(str);
+        root.w.push(str);
         return;
     }
-    if (!root.map[node[startIndex]]) {
-        root.map[node[startIndex]] = new TrieNode();
+    if (!root.m[node[startIndex]]) {
+        root.m[node[startIndex]] = new TrieNode();
     }
-    root.words.push(str);
-    add(str, startIndex + 1, root.map[node[startIndex]]);
+    root.w.push(str);
+    add(str, startIndex + 1, root.m[node[startIndex]]);
 };
@@ -76,8 +76,8 @@ const search = (str, startIndex, root) => {
     if (startIndex === str.length && startIndex !== 0) {
-        return root.words;
+        return root.w;
     }
-    if (!root.map[str[startIndex]])
+    if (!root.m[str[startIndex]])
         return [];
-    return search(str, startIndex + 1, root.map[str[startIndex]]);
+    return search(str, startIndex + 1, root.m[str[startIndex]]);
 };
 export { generateTrie, search, TrieNode };

lib/esm/types/trieSearch.d.ts

@@ -8,4 +8,4 @@ type Options = {
 declare class TrieNode {
-    map: any;
-    words: any;
+    m: any;
+    w: any;
     constructor();
@@ -12,0 +12,0 @@ }

package.json

 {
   "name": "fast-trie-search",
-  "version": "1.1.4",
-  "description": "This package can be used to implement a Search-As-You-Type funtionality and uses a Trie data structure",
+  "version": "1.1.5",
+  "description": "This package can be used to implement a Search-As-You-Type funtionality and uses a Trie data structure ",
   "exports": {
@@ -6,0 +6,0 @@ ".": {

No alert changes

Worsened metrics

Total package byte prevSize

18362

-0.38%

No dependency changes