@sourcegraph/amp 0.0.1749196899-g16ba82 → 0.0.1749225700-gc8788d

package/dist/fuzzy-server.js

@@ -1,5 +1,5 @@
 #!/usr/bin/env node
-import * as he from "node:readline";
+import * as ae from "node:readline";
 function D(s) {
   return Array.isArray ? Array.isArray(s) : se(s) === "[object Array]";
 }
@@ -86,16 +86,16 @@ function Me(s, e) {
         t.push(i);
       else {
         let o = u[c];
-        const a = i[o];
-        if (!E(a))
+        const h = i[o];
+        if (!E(h))
           return;
-        if (c === u.length - 1 && (M(a) || ee(a) || de(a)))
-          t.push(fe(a));
-        else if (D(a)) {
+        if (c === u.length - 1 && (M(h) || ee(h) || de(h)))
+          t.push(fe(h));
+        else if (D(h)) {
           r = !0;
-          for (let h = 0, f = a.length; h < f; h += 1)
-            n(a[h], u, c + 1);
-        } else u.length && n(a, u, c + 1);
+          for (let a = 0, f = h.length; a < f; a += 1)
+            n(h[a], u, c + 1);
+        } else u.length && n(h, u, c + 1);
       }
   };
   return n(s, M(e) ? e.split(".") : e, 0), r ? t : t[0];
@@ -236,16 +236,16 @@ class J {
           let c = [];
           const o = [{ nestedArrIndex: -1, value: u }];
           for (; o.length; ) {
-            const { nestedArrIndex: a, value: h } = o.pop();
-            if (E(h))
-              if (M(h) && !P(h)) {
+            const { nestedArrIndex: h, value: a } = o.pop();
+            if (E(a))
+              if (M(a) && !P(a)) {
                 let f = {
-                  v: h,
-                  i: a,
-                  n: this.norm.get(h)
+                  v: a,
+                  i: h,
+                  n: this.norm.get(a)
                 };
                 c.push(f);
-              } else D(h) && h.forEach((f, d) => {
+              } else D(a) && a.forEach((f, d) => {
                 o.push({
                   nestedArrIndex: d,
                   value: f
@@ -278,7 +278,7 @@ function Ie(s, { getFn: e = l.getFn, fieldNormWeight: t = l.fieldNormWeight } =
   const { keys: r, records: n } = s, i = new J({ getFn: e, fieldNormWeight: t });
   return i.setKeys(r), i.setIndexRecords(n), i;
 }
-function v(s, {
+function k(s, {
   errors: e = 0,
   currentLocation: t = 0,
   expectedLocation: r = 0,
@@ -307,66 +307,66 @@ function Le(s, e, t, {
   findAllMatches: u = l.findAllMatches,
   minMatchCharLength: c = l.minMatchCharLength,
   includeMatches: o = l.includeMatches,
-  ignoreLocation: a = l.ignoreLocation
+  ignoreLocation: h = l.ignoreLocation
 } = {}) {
   if (e.length > w)
     throw new Error(Ee(w));
-  const h = e.length, f = s.length, d = Math.max(0, Math.min(r, f));
+  const a = e.length, f = s.length, d = Math.max(0, Math.min(r, f));
   let g = i, A = d;
   const p = c > 1 || o, F = p ? Array(f) : [];
   let y;
   for (; (y = s.indexOf(e, A)) > -1; ) {
-    let C = v(e, {
+    let C = k(e, {
       currentLocation: y,
       expectedLocation: d,
       distance: n,
-      ignoreLocation: a
+      ignoreLocation: h
     });
-    if (g = Math.min(C, g), A = y + h, p) {
+    if (g = Math.min(C, g), A = y + a, p) {
       let x = 0;
-      for (; x < h; )
+      for (; x < a; )
         F[y + x] = 1, x += 1;
     }
   }
   A = -1;
-  let B = [], L = 1, I = h + f;
-  const ae = 1 << h - 1;
-  for (let C = 0; C < h; C += 1) {
+  let B = [], L = 1, I = a + f;
+  const he = 1 << a - 1;
+  for (let C = 0; C < a; C += 1) {
     let x = 0, _ = I;
     for (; x < _; )
-      v(e, {
+      k(e, {
         errors: C,
         currentLocation: d + _,
         expectedLocation: d,
         distance: n,
-        ignoreLocation: a
+        ignoreLocation: h
       }) <= g ? x = _ : I = _, _ = Math.floor((I - x) / 2 + x);
     I = _;
-    let Y = Math.max(1, d - _ + 1), T = u ? f : Math.min(d + _, f) + h, b = Array(T + 2);
-    b[T + 1] = (1 << C) - 1;
+    let Y = Math.max(1, d - _ + 1), T = u ? f : Math.min(d + _, f) + a, v = Array(T + 2);
+    v[T + 1] = (1 << C) - 1;
     for (let m = T; m >= Y; m -= 1) {
-      let k = m - 1, V = t[s.charAt(k)];
-      if (p && (F[k] = +!!V), b[m] = (b[m + 1] << 1 | 1) & V, C && (b[m] |= (B[m + 1] | B[m]) << 1 | 1 | B[m + 1]), b[m] & ae && (L = v(e, {
+      let R = m - 1, V = t[s.charAt(R)];
+      if (p && (F[R] = +!!V), v[m] = (v[m + 1] << 1 | 1) & V, C && (v[m] |= (B[m + 1] | B[m]) << 1 | 1 | B[m + 1]), v[m] & he && (L = k(e, {
         errors: C,
-        currentLocation: k,
+        currentLocation: R,
         expectedLocation: d,
         distance: n,
-        ignoreLocation: a
+        ignoreLocation: h
       }), L <= g)) {
-        if (g = L, A = k, A <= d)
+        if (g = L, A = R, A <= d)
           break;
         Y = Math.max(1, 2 * d - A);
       }
     }
-    if (v(e, {
+    if (k(e, {
       errors: C + 1,
       currentLocation: d,
       expectedLocation: d,
       distance: n,
-      ignoreLocation: a
+      ignoreLocation: h
     }) > g)
       break;
-    B = b;
+    B = v;
   }
   const N = {
     isMatch: A >= 0,
@@ -379,7 +379,7 @@ function Le(s, e, t, {
   }
   return N;
 }
-function be(s) {
+function ve(s) {
   let e = {};
   for (let t = 0, r = s.length; t < r; t += 1) {
     const n = s.charAt(t);
@@ -397,8 +397,8 @@ class ie {
     findAllMatches: u = l.findAllMatches,
     minMatchCharLength: c = l.minMatchCharLength,
     isCaseSensitive: o = l.isCaseSensitive,
-    ignoreDiacritics: a = l.ignoreDiacritics,
-    ignoreLocation: h = l.ignoreLocation
+    ignoreDiacritics: h = l.ignoreDiacritics,
+    ignoreLocation: a = l.ignoreLocation
   } = {}) {
     if (this.options = {
       location: t,
@@ -408,14 +408,14 @@ class ie {
       findAllMatches: u,
       minMatchCharLength: c,
       isCaseSensitive: o,
-      ignoreDiacritics: a,
-      ignoreLocation: h
-    }, e = o ? e : e.toLowerCase(), e = a ? O(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length)
+      ignoreDiacritics: h,
+      ignoreLocation: a
+    }, e = o ? e : e.toLowerCase(), e = h ? O(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length)
       return;
     const f = (g, A) => {
       this.chunks.push({
         pattern: g,
-        alphabet: be(g),
+        alphabet: ve(g),
         startIndex: A
       });
     }, d = this.pattern.length;
@@ -445,8 +445,8 @@ class ie {
       distance: u,
       threshold: c,
       findAllMatches: o,
-      minMatchCharLength: a,
-      ignoreLocation: h
+      minMatchCharLength: h,
+      ignoreLocation: a
     } = this.options;
     let f = [], d = 0, g = !1;
     this.chunks.forEach(({ pattern: p, alphabet: F, startIndex: y }) => {
@@ -455,9 +455,9 @@ class ie {
         distance: u,
         threshold: c,
         findAllMatches: o,
-        minMatchCharLength: a,
+        minMatchCharLength: h,
         includeMatches: n,
-        ignoreLocation: h
+        ignoreLocation: a
       });
       B && (g = !0), d += L, B && I && (f = [...f, ...I]);
     });
@@ -485,7 +485,7 @@ function X(s, e) {
   const t = s.match(e);
   return t ? t[1] : null;
 }
-class Re extends S {
+class be extends S {
   constructor(e) {
     super(e);
   }
@@ -507,7 +507,7 @@ class Re extends S {
     };
   }
 }
-class ke extends S {
+class Re extends S {
   constructor(e) {
     super(e);
   }
@@ -529,7 +529,7 @@ class ke extends S {
     };
   }
 }
-class ve extends S {
+class ke extends S {
   constructor(e) {
     super(e);
   }
@@ -626,8 +626,8 @@ class ue extends S {
     findAllMatches: u = l.findAllMatches,
     minMatchCharLength: c = l.minMatchCharLength,
     isCaseSensitive: o = l.isCaseSensitive,
-    ignoreDiacritics: a = l.ignoreDiacritics,
-    ignoreLocation: h = l.ignoreLocation
+    ignoreDiacritics: h = l.ignoreDiacritics,
+    ignoreLocation: a = l.ignoreLocation
   } = {}) {
     super(e), this._bitapSearch = new ie(e, {
       location: t,
@@ -637,8 +637,8 @@ class ue extends S {
       findAllMatches: u,
       minMatchCharLength: c,
       isCaseSensitive: o,
-      ignoreDiacritics: a,
-      ignoreLocation: h
+      ignoreDiacritics: h,
+      ignoreLocation: a
     });
   }
   static get type() {
@@ -681,13 +681,13 @@ class ce extends S {
   }
 }
 const K = [
-  Re,
+  be,
   ce,
-  ve,
+  ke,
   Oe,
   Ne,
   $e,
-  ke,
+  Re,
   ue
 ], Z = K.length, Te = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, Pe = "|";
 function je(s, e = {}) {
@@ -695,18 +695,18 @@ function je(s, e = {}) {
     let r = t.trim().split(Te).filter((i) => i && !!i.trim()), n = [];
     for (let i = 0, u = r.length; i < u; i += 1) {
       const c = r[i];
-      let o = !1, a = -1;
-      for (; !o && ++a < Z; ) {
-        const h = K[a];
-        let f = h.isMultiMatch(c);
-        f && (n.push(new h(f, e)), o = !0);
+      let o = !1, h = -1;
+      for (; !o && ++h < Z; ) {
+        const a = K[h];
+        let f = a.isMultiMatch(c);
+        f && (n.push(new a(f, e)), o = !0);
       }
       if (!o)
-        for (a = -1; ++a < Z; ) {
-          const h = K[a];
-          let f = h.isSingleMatch(c);
+        for (h = -1; ++h < Z; ) {
+          const a = K[h];
+          let f = a.isSingleMatch(c);
           if (f) {
-            n.push(new h(f, e));
+            n.push(new a(f, e));
             break;
           }
         }
@@ -724,8 +724,8 @@ class ze {
     ignoreLocation: u = l.ignoreLocation,
     findAllMatches: c = l.findAllMatches,
     location: o = l.location,
-    threshold: a = l.threshold,
-    distance: h = l.distance
+    threshold: h = l.threshold,
+    distance: a = l.distance
   } = {}) {
     this.query = null, this.options = {
       isCaseSensitive: t,
@@ -735,8 +735,8 @@ class ze {
       findAllMatches: c,
       ignoreLocation: u,
       location: o,
-      threshold: a,
-      distance: h
+      threshold: h,
+      distance: a
     }, e = t ? e : e.toLowerCase(), e = r ? O(e) : e, this.pattern = e, this.query = je(this.pattern, this.options);
   }
   static condition(e, t) {
@@ -752,8 +752,8 @@ class ze {
     const { includeMatches: r, isCaseSensitive: n, ignoreDiacritics: i } = this.options;
     e = n ? e : e.toLowerCase(), e = i ? O(e) : e;
     let u = 0, c = [], o = 0;
-    for (let a = 0, h = t.length; a < h; a += 1) {
-      const f = t[a];
+    for (let h = 0, a = t.length; h < a; h += 1) {
+      const f = t[h];
       c.length = 0, u = 0;
       for (let d = 0, g = f.length; d < g; d += 1) {
         const A = f[d], { isMatch: p, indices: F, score: y } = A.search(e);
@@ -811,23 +811,23 @@ function oe(s, e, { auto: t = !0 } = {}) {
     if (!u && i.length > 1 && !H(n))
       return r(q(n));
     if (He(n)) {
-      const o = u ? n[G.PATH] : i[0], a = u ? n[G.PATTERN] : n[o];
-      if (!M(a))
+      const o = u ? n[G.PATH] : i[0], h = u ? n[G.PATTERN] : n[o];
+      if (!M(h))
         throw new Error(pe(o));
-      const h = {
+      const a = {
         keyId: j(o),
-        pattern: a
+        pattern: h
       };
-      return t && (h.searcher = W(a, e)), h;
+      return t && (a.searcher = W(h, e)), a;
     }
     let c = {
       children: [],
       operator: i[0]
     };
     return i.forEach((o) => {
-      const a = n[o];
-      D(a) && a.forEach((h) => {
-        c.children.push(r(h));
+      const h = n[o];
+      D(h) && h.forEach((a) => {
+        c.children.push(r(a));
       });
     }), c;
   };
@@ -876,7 +876,7 @@ function Qe(s, e, {
     }), c;
   });
 }
-class R {
+class b {
   constructor(e, t = {}, r) {
     this.options = { ...l, ...t }, this.options.useExtendedSearch, this._keyStore = new me(this.options.keys), this.setCollection(e, r);
   }
@@ -924,16 +924,16 @@ class R {
     return r.forEach(({ v: i, i: u, n: c }) => {
       if (!E(i))
         return;
-      const { isMatch: o, score: a, indices: h } = t.searchIn(i);
+      const { isMatch: o, score: h, indices: a } = t.searchIn(i);
       o && n.push({
         item: i,
         idx: u,
-        matches: [{ score: a, value: i, norm: c, indices: h }]
+        matches: [{ score: h, value: i, norm: c, indices: a }]
       });
     }), n;
   }
   _searchLogical(e) {
-    const t = oe(e, this.options), r = (c, o, a) => {
+    const t = oe(e, this.options), r = (c, o, h) => {
       if (!c.children) {
         const { keyId: f, searcher: d } = c, g = this._findMatches({
           key: this._keyStore.get(f),
@@ -942,27 +942,27 @@ class R {
         });
         return g && g.length ? [
           {
-            idx: a,
+            idx: h,
             item: o,
             matches: g
           }
         ] : [];
       }
-      const h = [];
+      const a = [];
       for (let f = 0, d = c.children.length; f < d; f += 1) {
-        const g = c.children[f], A = r(g, o, a);
+        const g = c.children[f], A = r(g, o, h);
         if (A.length)
-          h.push(...A);
+          a.push(...A);
         else if (c.operator === $.AND)
           return [];
       }
-      return h;
+      return a;
     }, n = this._myIndex.records, i = {}, u = [];
     return n.forEach(({ $: c, i: o }) => {
       if (E(c)) {
-        let a = r(t, c, o);
-        a.length && (i[o] || (i[o] = { idx: o, item: c, matches: [] }, u.push(i[o])), a.forEach(({ matches: h }) => {
-          i[o].matches.push(...h);
+        let h = r(t, c, o);
+        h.length && (i[o] || (i[o] = { idx: o, item: c, matches: [] }, u.push(i[o])), h.forEach(({ matches: a }) => {
+          i[o].matches.push(...a);
         }));
       }
     }), u;
@@ -973,11 +973,11 @@ class R {
       if (!E(u))
         return;
       let o = [];
-      r.forEach((a, h) => {
+      r.forEach((h, a) => {
         o.push(
           ...this._findMatches({
-            key: a,
-            value: u[h],
+            key: h,
+            value: u[a],
             searcher: t
           })
         );
@@ -996,33 +996,34 @@ class R {
       t.forEach(({ v: i, i: u, n: c }) => {
         if (!E(i))
           return;
-        const { isMatch: o, score: a, indices: h } = r.searchIn(i);
+        const { isMatch: o, score: h, indices: a } = r.searchIn(i);
         o && n.push({
-          score: a,
+          score: h,
           key: e,
           value: i,
           idx: u,
           norm: c,
-          indices: h
+          indices: a
         });
       });
     else {
-      const { v: i, n: u } = t, { isMatch: c, score: o, indices: a } = r.searchIn(i);
-      c && n.push({ score: o, key: e, value: i, norm: u, indices: a });
+      const { v: i, n: u } = t, { isMatch: c, score: o, indices: h } = r.searchIn(i);
+      c && n.push({ score: o, key: e, value: i, norm: u, indices: h });
     }
     return n;
   }
 }
-R.version = "7.1.0";
-R.createIndex = ne;
-R.parseIndex = Ie;
-R.config = l;
-R.parseQuery = oe;
+b.version = "7.1.0";
+b.createIndex = ne;
+b.parseIndex = Ie;
+b.config = l;
+b.parseQuery = oe;
 We(ze);
 class Ue {
   fuse;
+  rootLevelFiles = [];
   constructor() {
-    this.fuse = new R([], {
+    this.fuse = new b([], {
       keys: ["value"],
       includeScore: !0,
       location: 0,
@@ -1034,15 +1035,17 @@ class Ue {
     });
   }
   addFiles(e) {
-    for (const t of e)
-      this.fuse.add({ value: t.toLowerCase(), original: t });
+    for (const t of e) {
+      const r = { value: t.toLowerCase(), original: t };
+      this.fuse.add(r), t.includes("/") || this.rootLevelFiles.push(t);
+    }
   }
   removeFiles(e) {
     for (const t of e)
-      this.fuse.remove((r) => r.value === t);
+      this.fuse.remove((r) => r.value === t), t.includes("/") || (this.rootLevelFiles = this.rootLevelFiles.filter((r) => r !== t));
   }
   query(e, t = 50) {
-    return this.fuse.search(e, { limit: t }).map((n) => n.item.original);
+    return e.trim() ? this.fuse.search(e, { limit: t }).map((n) => n.item.original) : this.rootLevelFiles.slice(0, t);
   }
   handleMessage(e) {
     try {
@@ -1068,7 +1071,7 @@ class Ue {
     }
   }
   start() {
-    const e = he.createInterface({
+    const e = ae.createInterface({
       input: process.stdin,
       output: process.stdout,
       terminal: !1