@tellaro/tql 0.1.10 → 0.1.11

package/dist/src/completionProvider.js

@@ -256,8 +256,8 @@ class q {
   }
   set(t, a) {
     if (this.cache.size >= this.maxSize) {
-      const o = this.cache.keys().next().value;
-      o && this.cache.delete(o);
+      const i = this.cache.keys().next().value;
+      i && this.cache.delete(i);
     }
     this.cache.set(t, { result: a, timestamp: Date.now() });
   }
@@ -267,18 +267,18 @@ class q {
 }
 const v = new q();
 function B(e, t, a) {
-  const o = `${e.substring(0, t)}|${t}`, i = v.get(o);
-  if (i)
-    return i.fieldName && !i.fieldType && a && (i.fieldType = f(i.fieldName, a)), i;
+  const i = `${e.substring(0, t)}|${t}`, o = v.get(i);
+  if (o)
+    return o.fieldName && !o.fieldType && a && (o.fieldType = f(o.fieldName, a)), o;
   const n = G(e, t, a);
-  return v.set(o, n), n;
+  return v.set(i, n), n;
 }
 function G(e, t, a) {
   var u;
-  const i = b(e.substring(0, t)).filter((l) => l.type !== "whitespace");
-  if (i.length === 0)
+  const o = b(e.substring(0, t)).filter((l) => l.type !== "whitespace");
+  if (o.length === 0)
     return { type: "start" };
-  const n = i[i.length - 1], r = i.length > 1 ? i[i.length - 2] : null, d = n.end === t && !((u = e[t - 1]) != null && u.match(/\s/)), s = d ? n.value : void 0;
+  const n = o[o.length - 1], r = o.length > 1 ? o[o.length - 2] : null, d = n.end === t && !((u = e[t - 1]) != null && u.match(/\s/)), s = d ? n.value : void 0;
   if (n.type === "logicalOp")
     return { type: "start" };
   if (n.type === "paren" && n.value === "(")
@@ -347,21 +347,21 @@ function G(e, t, a) {
 function f(e, t) {
   return t ? M().getFieldType(t, e) : void 0;
 }
-function te(e, t = {}) {
-  const { query: a, cursorPosition: o } = e, i = B(a, o, t.fields), n = [];
-  switch (i.type) {
+function ae(e, t = {}) {
+  const { query: a, cursorPosition: i } = e, o = B(a, i, t.fields), n = [];
+  switch (o.type) {
     case "start":
     case "after_paren":
-      n.push(...y(t.fields, i.partialText)), n.push(N("NOT")), t.includeSnippets !== !1 && n.push(...Y(t, i.partialText));
+      n.push(...y(t.fields, o.partialText)), n.push(N("NOT")), t.includeSnippets !== !1 && n.push(...K(t, o.partialText));
       break;
     case "after_field":
-      n.push(...x(i.partialText, i.fieldType));
+      n.push(...x(o.partialText, o.fieldType)), n.push(H());
       break;
     case "after_mutator":
-      n.push(...x(i.partialText, i.mutatorOutputType));
+      n.push(...x(o.partialText, o.mutatorOutputType));
       break;
     case "after_operator":
-      n.push(...H(i.fieldName, t));
+      n.push(...Y(o.fieldName, t));
       break;
     case "after_value":
       n.push(...C());
@@ -369,28 +369,28 @@ function te(e, t = {}) {
     case "at_value_end":
       break;
     case "after_pipe":
-      n.push(...K(i.partialText));
+      n.push(...W(o.partialText));
       break;
     case "after_double_colon":
-      n.push(...W(i.partialText));
+      n.push(...Z(o.partialText));
       break;
     case "after_arrow":
-      n.push(...Z(i.partialText));
+      n.push(...J(o.partialText));
       break;
     case "after_stats":
-      n.push(...O(i.partialText));
+      n.push(...O(o.partialText));
       break;
     case "after_by":
-      n.push(...y(t.fields, i.partialText));
+      n.push(...y(t.fields, o.partialText));
       break;
     default:
-      n.push(...y(t.fields, i.partialText)), n.push(...x(i.partialText)), n.push(...C());
+      n.push(...y(t.fields, o.partialText)), n.push(...x(o.partialText)), n.push(...C());
   }
-  t.includeAggregations && i.type === "start" && n.push(...O(i.partialText));
+  t.includeAggregations && o.type === "start" && n.push(...O(o.partialText));
   let r = n;
   const d = t.fuzzyMatching !== !1, s = t.minFuzzyScore ?? 0;
-  if (i.partialText) {
-    const u = i.partialText.toLowerCase();
+  if (o.partialText) {
+    const u = o.partialText.toLowerCase();
     if (d) {
       const l = [];
       for (const c of n) {
@@ -416,11 +416,11 @@ function y(e, t) {
   if (!e || e.length === 0)
     return V(t);
   const a = [];
-  for (const o of e) {
-    const i = k(o);
-    if (a.push(i), o.nested)
-      for (const n of o.nested) {
-        const r = k(n, o.name);
+  for (const i of e) {
+    const o = k(i);
+    if (a.push(o), i.nested)
+      for (const n of i.nested) {
+        const r = k(n, i.name);
         a.push(r);
       }
   }
@@ -466,18 +466,18 @@ function k(e, t) {
 }
 function x(e, t) {
   let a = [...A];
-  return t && (a = a.filter((o) => {
-    const i = F[o];
-    return !i || i.includes(t);
-  })), e && (a = a.filter((o) => o.toLowerCase().includes(e.toLowerCase()))), a.map((o, i) => {
-    const n = U[o] || { detail: o, documentation: "" }, r = j(o, t);
+  return t && (a = a.filter((i) => {
+    const o = F[i];
+    return !o || o.includes(t);
+  })), e && (a = a.filter((i) => i.toLowerCase().includes(e.toLowerCase()))), a.map((i, o) => {
+    const n = U[i] || { detail: i, documentation: "" }, r = j(i, t);
     return {
-      label: o,
+      label: i,
       insertText: r,
       kind: "operator",
       detail: n.detail,
       documentation: n.documentation,
-      sortOrder: 20 + i
+      sortOrder: 20 + o
     };
   });
 }
@@ -494,14 +494,14 @@ function j(e, t) {
     "not_regexp",
     "matches",
     "not_matches"
-  ], o = ["exists", "not_exists"], i = ["is", "is_not"];
+  ], i = ["exists", "not_exists"], o = ["is", "is_not"];
   if (e === "in" || e === "not_in")
     return T(t) ? `${e} [$1]` : `${e} ["$1"]`;
   if (e === "between" || e === "not_between")
     return T(t) ? `${e} $1 AND $2` : `${e} "$1" AND "$2"`;
-  if (i.includes(e))
-    return `${e} null`;
   if (o.includes(e))
+    return `${e} null`;
+  if (i.includes(e))
     return e;
   if (e === "cidr" || e === "not_cidr")
     return `${e} "$1"`;
@@ -545,10 +545,21 @@ function N(e, t = 0) {
     sortOrder: 30 + t
   };
 }
-function H(e, t) {
-  var o;
+function H() {
+  return {
+    label: "|",
+    insertText: "| ",
+    kind: "operator",
+    detail: "Pipe to mutator",
+    documentation: "Chain field to a mutator function (e.g., hostname | lower)",
+    sortOrder: 19
+    // Just before operators (20+)
+  };
+}
+function Y(e, t) {
+  var i;
   const a = [];
-  return e && ((o = t == null ? void 0 : t.fieldValues) != null && o[e]) && t.fieldValues[e].forEach((n, r) => {
+  return e && ((i = t == null ? void 0 : t.fieldValues) != null && i[e]) && t.fieldValues[e].forEach((n, r) => {
     a.push({
       label: n,
       insertText: `"${n}"`,
@@ -587,26 +598,26 @@ function H(e, t) {
     }
   ), a;
 }
-function Y(e, t) {
-  return E.filter((o) => !t || o.label.toLowerCase().includes(t.toLowerCase())).map((o, i) => ({
-    label: o.label,
-    insertText: o.insertText,
+function K(e, t) {
+  return E.filter((i) => !t || i.label.toLowerCase().includes(t.toLowerCase())).map((i, o) => ({
+    label: i.label,
+    insertText: i.insertText,
     kind: "snippet",
-    detail: o.description,
-    documentation: `Insert: ${o.insertText}`,
-    sortOrder: 100 + i
+    detail: i.description,
+    documentation: `Insert: ${i.insertText}`,
+    sortOrder: 100 + o
   }));
 }
-function K(e) {
+function W(e) {
   return D.filter((t) => !e || t.toLowerCase().includes(e.toLowerCase())).map(
     (t, a) => {
-      const o = z[t] || { detail: "Field mutator", documentation: "" };
+      const i = z[t] || { detail: "Field mutator", documentation: "" };
       return {
         label: t,
         insertText: t,
         kind: "mutator",
-        detail: o.detail,
-        documentation: o.documentation,
+        detail: i.detail,
+        documentation: i.documentation,
         sortOrder: 60 + a
       };
     }
@@ -623,7 +634,7 @@ function O(e) {
     sortOrder: 70 + a
   }));
 }
-function W(e) {
+function Z(e) {
   return P.filter(
     (t) => !e || t.toLowerCase().includes(e.toLowerCase())
   ).map((t, a) => ({
@@ -634,7 +645,7 @@ function W(e) {
     sortOrder: 80 + a
   }));
 }
-function Z(e) {
+function J(e) {
   return $.filter(
     (t) => !e || t.toLowerCase().includes(e.toLowerCase())
   ).map((t, a) => ({
@@ -645,27 +656,27 @@ function Z(e) {
     sortOrder: 90 + a
   }));
 }
-function ae(e, t) {
-  const o = b(e).find(
-    (i) => i.start <= t && i.end >= t && i.type !== "whitespace"
+function ne(e, t) {
+  const i = b(e).find(
+    (o) => o.start <= t && o.end >= t && o.type !== "whitespace"
   );
-  return o ? {
-    word: o.value,
-    start: o.start,
-    end: o.end
+  return i ? {
+    word: i.value,
+    start: i.start,
+    end: i.end
   } : null;
 }
-function ne() {
+function oe() {
   return [" ", "(", ".", '"', "'", "|", ":", "="];
 }
 function ie(e, t, a) {
   if (a === " " || a === "(" || a === "." || a === "|" || a === ":" || a === "=") return !0;
-  const o = b(e.substring(0, t)), i = o[o.length - 1];
-  return !!(i && i.type === "field" && i.value.length >= 2);
+  const i = b(e.substring(0, t)), o = i[i.length - 1];
+  return !!(o && o.type === "field" && o.value.length >= 2);
 }
 export {
-  ne as getCompletionTriggerCharacters,
-  te as getCompletions,
-  ae as getWordAtPosition,
+  oe as getCompletionTriggerCharacters,
+  ae as getCompletions,
+  ne as getWordAtPosition,
   ie as shouldTriggerCompletion
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@tellaro/tql",
-  "version": "0.1.10",
+  "version": "0.1.11",
   "description": "Tellaro Query Language (TQL) parser, validator, and autocomplete for JavaScript/TypeScript",
   "type": "module",
   "main": "./dist/index.js",