clarity-pattern-parser 3.0.7 → 3.0.9

package/dist/index.js

@@ -1430,22 +1430,28 @@ class TextSuggester {
         }
         if (((_c = this.patternMatch) === null || _c === void 0 ? void 0 : _c.astNode) == null) {
             let options = (_d = this.rootPattern) === null || _d === void 0 ? void 0 : _d.getTokens();
-            const parts = this.text.split(" ").filter((part) => {
-                return part.length > 0;
-            });
             options = options === null || options === void 0 ? void 0 : options.filter((option) => {
-                return parts.some((part) => {
-                    return option.indexOf(part) > -1;
-                });
+                return option.indexOf(this.text) > -1;
             });
             if ((options === null || options === void 0 ? void 0 : options.length) === 0) {
                 this.tokens = null;
                 return;
             }
+            const values = options === null || options === void 0 ? void 0 : options.map((option) => {
+                const parts = option.split(this.text);
+                return parts[1];
+            });
             this.tokens = {
                 startIndex: 0,
-                values: options || [],
+                values: values || [],
             };
+            this.matchedText = this.text;
+            this.match = {
+                text: this.text,
+                startIndex: 0,
+                endIndex: this.text.length - 1,
+            };
+            this.error = null;
             return;
         }
         const options = this.options;
@@ -1522,7 +1528,7 @@ class Visitor {
         this.selectedNodes.forEach((node) => {
             if (node.isComposite) {
                 const children = [];
-                this.walkUp(node, (descendant) => {
+                Visitor.walkUp(node, (descendant) => {
                     if (!descendant.isComposite) {
                         children.push(descendant);
                     }
@@ -1567,7 +1573,7 @@ class Visitor {
         if (this.root == null) {
             return this;
         }
-        this.walkDown(this.root, (node, stack) => {
+        Visitor.walkDown(this.root, (node, stack) => {
             if (this.selectedNodes.includes(node)) {
                 const parent = stack[stack.length - 1];
                 const grandParent = stack[stack.length - 2];
@@ -1585,7 +1591,7 @@ class Visitor {
         if (this.root == null) {
             return this;
         }
-        this.walkUp(this.root, (node, stack) => {
+        Visitor.walkUp(this.root, (node, stack) => {
             if (this.selectedNodes.includes(node)) {
                 const parent = stack[stack.length - 1];
                 if (parent != null) {
@@ -1602,7 +1608,7 @@ class Visitor {
         if (this.root == null) {
             return this;
         }
-        this.walkDown(this.root, (node, stack) => {
+        Visitor.walkDown(this.root, (node, stack) => {
             if (this.selectedNodes.includes(node)) {
                 const parent = stack[stack.length - 1];
                 if (parent != null) {
@@ -1630,26 +1636,6 @@ class Visitor {
         }
         return callback(node);
     }
-    walkUp(node, callback, ancestors = []) {
-        ancestors.push(node);
-        if (node.isComposite && Array.isArray(node.children)) {
-            const children = node.children.slice();
-            children.forEach((c) => this.walkUp(c, callback, ancestors));
-        }
-        ancestors.pop();
-        callback(node, ancestors);
-        return this;
-    }
-    walkDown(node, callback, ancestors = []) {
-        callback(node, ancestors);
-        ancestors.push(node);
-        if (node.isComposite && Array.isArray(node.children)) {
-            const children = node.children.slice();
-            children.forEach((c) => this.walkDown(c, callback, ancestors));
-        }
-        ancestors.pop();
-        return this;
-    }
     selectAll() {
         return this.select((n) => true);
     }
@@ -1667,7 +1653,7 @@ class Visitor {
         const node = this.root;
         const selectedNodes = [];
         if (node.isComposite) {
-            this.walkDown(node, (descendant) => {
+            Visitor.walkDown(node, (descendant) => {
                 if (callback(descendant)) {
                     selectedNodes.push(descendant);
                 }
@@ -1720,6 +1706,26 @@ class Visitor {
             return new Visitor(root);
         }
     }
+    static walkUp(node, callback, ancestors = []) {
+        ancestors.push(node);
+        if (node.isComposite && Array.isArray(node.children)) {
+            const children = node.children.slice();
+            children.forEach((c) => this.walkUp(c, callback, ancestors));
+        }
+        ancestors.pop();
+        callback(node, ancestors);
+        return this;
+    }
+    static walkDown(node, callback, ancestors = []) {
+        callback(node, ancestors);
+        ancestors.push(node);
+        if (node.isComposite && Array.isArray(node.children)) {
+            const children = node.children.slice();
+            children.forEach((c) => this.walkDown(c, callback, ancestors));
+        }
+        ancestors.pop();
+        return this;
+    }
 }
 
 exports.AndComposite = AndComposite;