@arcgis/coding-components 5.2.0-next.78 → 5.2.0-next.79

package/dist/cdn/assets/code-editor/sql-layer.worker.js

@@ -2,7 +2,7 @@ class Bi {
   constructor() {
     this.listeners = [], this.unexpectedErrorHandler = function(e) {
       setTimeout(() => {
-        throw e.stack ? it.isErrorNoTelemetry(e) ? new it(e.message + `
+        throw e.stack ? at.isErrorNoTelemetry(e) ? new at(e.message + `
 
 ` + e.stack) : new Error(e.message + `
 
@@ -38,7 +38,7 @@ function pn(t) {
       name: e,
       message: n,
       stack: s,
-      noTelemetry: it.isErrorNoTelemetry(t),
+      noTelemetry: at.isErrorNoTelemetry(t),
       cause: r ? pn(r) : void 0,
       code: t.code
     };
@@ -54,14 +54,14 @@ class ti extends Error {
     super(bn), this.name = this.message;
   }
 }
-class it extends Error {
+class at extends Error {
   constructor(e) {
     super(e), this.name = "CodeExpectedError";
   }
   static fromError(e) {
-    if (e instanceof it)
+    if (e instanceof at)
       return e;
-    const n = new it();
+    const n = new at();
     return n.message = e.message, n.stack = e.stack, n;
   }
   static isErrorNoTelemetry(e) {
@@ -86,7 +86,7 @@ function xt(t) {
     t(), Ft(new K("Assertion Failed"));
   }
 }
-function Hn(t, e) {
+function zn(t, e) {
   let n = 0;
   for (; n < t.length - 1; ) {
     const r = t[n], s = t[n + 1];
@@ -104,8 +104,8 @@ function Wi(t) {
 }
 var Bt;
 (function(t) {
-  function e(y) {
-    return !!y && typeof y == "object" && typeof y[Symbol.iterator] == "function";
+  function e(x) {
+    return !!x && typeof x == "object" && typeof x[Symbol.iterator] == "function";
   }
   t.is = e;
   const n = Object.freeze([]);
@@ -113,99 +113,99 @@ var Bt;
     return n;
   }
   t.empty = r;
-  function* s(y) {
-    yield y;
+  function* s(x) {
+    yield x;
   }
   t.single = s;
-  function i(y) {
-    return e(y) ? y : s(y);
+  function i(x) {
+    return e(x) ? x : s(x);
   }
   t.wrap = i;
-  function a(y) {
-    return y ?? n;
+  function a(x) {
+    return x ?? n;
   }
   t.from = a;
-  function* l(y) {
-    for (let v = y.length - 1; v >= 0; v--)
-      yield y[v];
+  function* l(x) {
+    for (let v = x.length - 1; v >= 0; v--)
+      yield x[v];
   }
   t.reverse = l;
-  function u(y) {
-    return !y || y[Symbol.iterator]().next().done === !0;
+  function u(x) {
+    return !x || x[Symbol.iterator]().next().done === !0;
   }
   t.isEmpty = u;
-  function c(y) {
-    return y[Symbol.iterator]().next().value;
+  function c(x) {
+    return x[Symbol.iterator]().next().value;
   }
   t.first = c;
-  function h(y, v) {
+  function h(x, v) {
     let S = 0;
-    for (const B of y)
+    for (const B of x)
       if (v(B, S++))
         return !0;
     return !1;
   }
   t.some = h;
-  function f(y, v) {
+  function f(x, v) {
     let S = 0;
-    for (const B of y)
+    for (const B of x)
       if (!v(B, S++))
         return !1;
     return !0;
   }
   t.every = f;
-  function m(y, v) {
-    for (const S of y)
+  function m(x, v) {
+    for (const S of x)
       if (v(S))
         return S;
   }
   t.find = m;
-  function* p(y, v) {
-    for (const S of y)
+  function* p(x, v) {
+    for (const S of x)
       v(S) && (yield S);
   }
   t.filter = p;
-  function* d(y, v) {
+  function* d(x, v) {
     let S = 0;
-    for (const B of y)
+    for (const B of x)
       yield v(B, S++);
   }
   t.map = d;
-  function* g(y, v) {
+  function* g(x, v) {
     let S = 0;
-    for (const B of y)
+    for (const B of x)
       yield* v(B, S++);
   }
   t.flatMap = g;
-  function* w(...y) {
-    for (const v of y)
+  function* w(...x) {
+    for (const v of x)
       Wi(v) ? yield* v : yield v;
   }
   t.concat = w;
-  function x(y, v, S) {
+  function y(x, v, S) {
     let B = S;
-    for (const W of y)
+    for (const W of x)
       B = v(B, W);
     return B;
   }
-  t.reduce = x;
-  function _(y) {
+  t.reduce = y;
+  function _(x) {
     let v = 0;
-    for (const S of y)
+    for (const S of x)
       v++;
     return v;
   }
   t.length = _;
-  function* L(y, v, S = y.length) {
-    for (v < -y.length && (v = 0), v < 0 && (v += y.length), S < 0 ? S += y.length : S > y.length && (S = y.length); v < S; v++)
-      yield y[v];
+  function* L(x, v, S = x.length) {
+    for (v < -x.length && (v = 0), v < 0 && (v += x.length), S < 0 ? S += x.length : S > x.length && (S = x.length); v < S; v++)
+      yield x[v];
   }
   t.slice = L;
-  function A(y, v = Number.POSITIVE_INFINITY) {
+  function A(x, v = Number.POSITIVE_INFINITY) {
     const S = [];
     if (v === 0)
-      return [S, y];
-    const B = y[Symbol.iterator]();
+      return [S, x];
+    const B = x[Symbol.iterator]();
     for (let W = 0; W < v; W++) {
       const D = B.next();
       if (D.done)
@@ -217,16 +217,16 @@ var Bt;
     } }];
   }
   t.consume = A;
-  async function I(y) {
+  async function I(x) {
     const v = [];
-    for await (const S of y)
+    for await (const S of x)
       v.push(S);
     return v;
   }
   t.asyncToArray = I;
-  async function O(y) {
+  async function O(x) {
     let v = [];
-    for await (const S of y)
+    for await (const S of x)
       v = v.concat(S);
     return v;
   }
@@ -250,10 +250,10 @@ function ni(t) {
   } else if (t)
     return t.dispose(), t;
 }
-function zi(...t) {
-  return yt(() => ni(t));
+function Hi(...t) {
+  return vt(() => ni(t));
 }
-class Hi {
+class zi {
   constructor(e) {
     this._isDisposed = !1, this._fn = e;
   }
@@ -265,8 +265,8 @@ class Hi {
     }
   }
 }
-function yt(t) {
-  return new Hi(t);
+function vt(t) {
+  return new zi(t);
 }
 class Ct {
   static {
@@ -304,7 +304,7 @@ class Ct {
    * Add a new {@link IDisposable disposable} to the collection.
    */
   add(e) {
-    if (!e || e === vt.None)
+    if (!e || e === Lt.None)
       return e;
     if (e === this)
       throw new Error("Cannot register a disposable on itself!");
@@ -322,7 +322,7 @@ class Ct {
     }
   }
 }
-class vt {
+class Lt {
   static {
     this.None = Object.freeze({ dispose() {
     } });
@@ -443,28 +443,28 @@ function Ji(t, e) {
   }
   return n;
 }
-const Ke = "en";
-let wn = !1, xn = !1, nn = !1, si = !1, jn = !1, kt, rn = Ke, nr = Ke, Xi, Re;
-const ke = globalThis;
-let ce;
-typeof ke.vscode < "u" && typeof ke.vscode.process < "u" ? ce = ke.vscode.process : typeof process < "u" && typeof process?.versions?.node == "string" && (ce = process);
-const Yi = typeof ce?.versions?.electron == "string", Zi = Yi && ce?.type === "renderer";
-if (typeof ce == "object") {
-  wn = ce.platform === "win32", xn = ce.platform === "darwin", nn = ce.platform === "linux", nn && ce.env.SNAP && ce.env.SNAP_REVISION, ce.env.CI || ce.env.BUILD_ARTIFACTSTAGINGDIRECTORY || ce.env.GITHUB_WORKSPACE, kt = Ke, rn = Ke;
-  const t = ce.env.VSCODE_NLS_CONFIG;
+const et = "en";
+let wn = !1, yn = !1, nn = !1, si = !1, jn = !1, kt, rn = et, nr = et, Xi, ke;
+const Ee = globalThis;
+let fe;
+typeof Ee.vscode < "u" && typeof Ee.vscode.process < "u" ? fe = Ee.vscode.process : typeof process < "u" && typeof process?.versions?.node == "string" && (fe = process);
+const Yi = typeof fe?.versions?.electron == "string", Zi = Yi && fe?.type === "renderer";
+if (typeof fe == "object") {
+  wn = fe.platform === "win32", yn = fe.platform === "darwin", nn = fe.platform === "linux", nn && fe.env.SNAP && fe.env.SNAP_REVISION, fe.env.CI || fe.env.BUILD_ARTIFACTSTAGINGDIRECTORY || fe.env.GITHUB_WORKSPACE, kt = et, rn = et;
+  const t = fe.env.VSCODE_NLS_CONFIG;
   if (t)
     try {
       const e = JSON.parse(t);
-      kt = e.userLocale, nr = e.osLocale, rn = e.resolvedLanguage || Ke, Xi = e.languagePack?.translationsConfigFile;
+      kt = e.userLocale, nr = e.osLocale, rn = e.resolvedLanguage || et, Xi = e.languagePack?.translationsConfigFile;
     } catch {
     }
   si = !0;
-} else typeof navigator == "object" && !Zi ? (Re = navigator.userAgent, wn = Re.indexOf("Windows") >= 0, xn = Re.indexOf("Macintosh") >= 0, (Re.indexOf("Macintosh") >= 0 || Re.indexOf("iPad") >= 0 || Re.indexOf("iPhone") >= 0) && navigator.maxTouchPoints && navigator.maxTouchPoints > 0, nn = Re.indexOf("Linux") >= 0, Re?.indexOf("Mobi") >= 0, jn = !0, rn = ri() || Ke, kt = navigator.language.toLowerCase(), nr = kt) : console.error("Unable to resolve platform.");
-const Lt = wn, Ki = xn, ea = si, ta = jn, na = jn && typeof ke.importScripts == "function", ra = na ? ke.origin : void 0, Ne = Re, sa = typeof ke.postMessage == "function" && !ke.importScripts;
+} else typeof navigator == "object" && !Zi ? (ke = navigator.userAgent, wn = ke.indexOf("Windows") >= 0, yn = ke.indexOf("Macintosh") >= 0, (ke.indexOf("Macintosh") >= 0 || ke.indexOf("iPad") >= 0 || ke.indexOf("iPhone") >= 0) && navigator.maxTouchPoints && navigator.maxTouchPoints > 0, nn = ke.indexOf("Linux") >= 0, ke?.indexOf("Mobi") >= 0, jn = !0, rn = ri() || et, kt = navigator.language.toLowerCase(), nr = kt) : console.error("Unable to resolve platform.");
+const _t = wn, Ki = yn, ea = si, ta = jn, na = jn && typeof Ee.importScripts == "function", ra = na ? Ee.origin : void 0, Se = ke, sa = typeof Ee.postMessage == "function" && !Ee.importScripts;
 (() => {
   if (sa) {
     const t = [];
-    ke.addEventListener("message", (n) => {
+    Ee.addEventListener("message", (n) => {
       if (n.data && n.data.vscodeScheduleAsyncWork)
         for (let r = 0, s = t.length; r < s; r++) {
           const i = t[r];
@@ -480,21 +480,21 @@ const Lt = wn, Ki = xn, ea = si, ta = jn, na = jn && typeof ke.importScripts ==
       t.push({
         id: r,
         callback: n
-      }), ke.postMessage({ vscodeScheduleAsyncWork: r }, "*");
+      }), Ee.postMessage({ vscodeScheduleAsyncWork: r }, "*");
     };
   }
   return (t) => setTimeout(t);
 })();
-const ia = !!(Ne && Ne.indexOf("Chrome") >= 0);
-Ne && Ne.indexOf("Firefox") >= 0;
-!ia && Ne && Ne.indexOf("Safari") >= 0;
-Ne && Ne.indexOf("Edg/") >= 0;
-Ne && Ne.indexOf("Android") >= 0;
-let tt;
+const ia = !!(Se && Se.indexOf("Chrome") >= 0);
+Se && Se.indexOf("Firefox") >= 0;
+!ia && Se && Se.indexOf("Safari") >= 0;
+Se && Se.indexOf("Edg/") >= 0;
+Se && Se.indexOf("Android") >= 0;
+let nt;
 const sn = globalThis.vscode;
 if (typeof sn < "u" && typeof sn.process < "u") {
   const t = sn.process;
-  tt = {
+  nt = {
     get platform() {
       return t.platform;
     },
@@ -508,7 +508,7 @@ if (typeof sn < "u" && typeof sn.process < "u") {
       return t.cwd();
     }
   };
-} else typeof process < "u" && typeof process?.versions?.node == "string" ? tt = {
+} else typeof process < "u" && typeof process?.versions?.node == "string" ? nt = {
   get platform() {
     return process.platform;
   },
@@ -521,10 +521,10 @@ if (typeof sn < "u" && typeof sn.process < "u") {
   cwd() {
     return process.env.VSCODE_CWD || process.cwd();
   }
-} : tt = {
+} : nt = {
   // Supported
   get platform() {
-    return Lt ? "win32" : Ki ? "darwin" : "linux";
+    return _t ? "win32" : Ki ? "darwin" : "linux";
   },
   get arch() {
   },
@@ -536,7 +536,7 @@ if (typeof sn < "u" && typeof sn.process < "u") {
     return "/";
   }
 };
-const Vt = tt.cwd, ii = tt.env, aa = tt.platform, oa = globalThis.performance.now.bind(globalThis.performance);
+const Vt = nt.cwd, ii = nt.env, aa = nt.platform, oa = globalThis.performance.now.bind(globalThis.performance);
 class Yt {
   static create(e) {
     return new Yt(e);
@@ -558,9 +558,9 @@ const la = 100, rr = 6e4;
 function sr() {
   return !!ii.VSCODE_DEV;
 }
-var yn;
+var xn;
 (function(t) {
-  t.None = () => vt.None;
+  t.None = () => Lt.None;
   function e(R, N, k) {
     return m(R, () => {
     }, 0, void 0, N ?? !0, void 0, k);
@@ -569,9 +569,9 @@ var yn;
   function n(R) {
     return (N, k = null, M) => {
       let E = !1, $;
-      return $ = R((z) => {
+      return $ = R((H) => {
         if (!E)
-          return $ ? $.dispose() : E = !0, N.call(k, z);
+          return $ ? $.dispose() : E = !0, N.call(k, H);
       }, null, M), E && $.dispose(), $;
     };
   }
@@ -581,17 +581,17 @@ var yn;
   }
   t.onceIf = r;
   function s(R, N, k) {
-    return h((M, E = null, $) => R((z) => M.call(E, N(z)), null, $), k);
+    return h((M, E = null, $) => R((H) => M.call(E, N(H)), null, $), k);
   }
   t.map = s;
   function i(R, N, k) {
-    return h((M, E = null, $) => R((z) => {
-      N(z), M.call(E, z);
+    return h((M, E = null, $) => R((H) => {
+      N(H), M.call(E, H);
     }, null, $), k);
   }
   t.forEach = i;
   function a(R, N, k) {
-    return h((M, E = null, $) => R((z) => N(z) && M.call(E, z), null, $), k);
+    return h((M, E = null, $) => R((H) => N(H) && M.call(E, H), null, $), k);
   }
   t.filter = a;
   function l(R) {
@@ -600,7 +600,7 @@ var yn;
   t.signal = l;
   function u(...R) {
     return (N, k = null, M) => {
-      const E = zi(...R.map(($) => $((z) => N.call(k, z))));
+      const E = Hi(...R.map(($) => $((H) => N.call(k, H))));
       return f(E, M);
     };
   }
@@ -619,63 +619,63 @@ var yn;
       onDidRemoveLastListener() {
         k?.dispose();
       }
-    }, E = new xe(M);
+    }, E = new ye(M);
     return N?.add(E), E.event;
   }
   function f(R, N) {
     return N instanceof Array ? N.push(R) : N && N.add(R), R;
   }
-  function m(R, N, k = 100, M = !1, E = !1, $, z) {
-    let te, Q, re, ne = 0, oe;
+  function m(R, N, k = 100, M = !1, E = !1, $, H) {
+    let te, Q, se, ne = 0, ue;
     const qe = {
       leakWarningThreshold: $,
       onWillAddFirstListener() {
         te = R((Di) => {
-          ne++, Q = N(Q, Di), M && !re && (He.fire(Q), Q = void 0), oe = () => {
+          ne++, Q = N(Q, Di), M && !se && (je.fire(Q), Q = void 0), ue = () => {
             const $i = Q;
-            Q = void 0, re = void 0, (!M || ne > 1) && He.fire($i), ne = 0;
-          }, typeof k == "number" ? (re && clearTimeout(re), re = setTimeout(oe, k)) : re === void 0 && (re = null, queueMicrotask(oe));
+            Q = void 0, se = void 0, (!M || ne > 1) && je.fire($i), ne = 0;
+          }, typeof k == "number" ? (se && clearTimeout(se), se = setTimeout(ue, k)) : se === void 0 && (se = null, queueMicrotask(ue));
         });
       },
       onWillRemoveListener() {
-        E && ne > 0 && oe?.();
+        E && ne > 0 && ue?.();
       },
       onDidRemoveLastListener() {
-        oe = void 0, te.dispose();
+        ue = void 0, te.dispose();
       }
-    }, He = new xe(qe);
-    return z?.add(He), He.event;
+    }, je = new ye(qe);
+    return H?.add(je), je.event;
   }
   t.debounce = m;
   function p(R, N = 0, k, M) {
     return t.debounce(R, (E, $) => E ? (E.push($), E) : [$], N, void 0, k ?? !0, void 0, M);
   }
   t.accumulate = p;
-  function d(R, N, k = 100, M = !0, E = !0, $, z) {
-    let te, Q, re, ne = 0;
-    const oe = {
+  function d(R, N, k = 100, M = !0, E = !0, $, H) {
+    let te, Q, se, ne = 0;
+    const ue = {
       leakWarningThreshold: $,
       onWillAddFirstListener() {
-        te = R((He) => {
-          ne++, Q = N(Q, He), re === void 0 && (M && (qe.fire(Q), Q = void 0, ne = 0), typeof k == "number" ? re = setTimeout(() => {
-            E && ne > 0 && qe.fire(Q), Q = void 0, re = void 0, ne = 0;
-          }, k) : (re = 0, queueMicrotask(() => {
-            E && ne > 0 && qe.fire(Q), Q = void 0, re = void 0, ne = 0;
+        te = R((je) => {
+          ne++, Q = N(Q, je), se === void 0 && (M && (qe.fire(Q), Q = void 0, ne = 0), typeof k == "number" ? se = setTimeout(() => {
+            E && ne > 0 && qe.fire(Q), Q = void 0, se = void 0, ne = 0;
+          }, k) : (se = 0, queueMicrotask(() => {
+            E && ne > 0 && qe.fire(Q), Q = void 0, se = void 0, ne = 0;
           })));
         });
       },
       onDidRemoveLastListener() {
         te.dispose();
       }
-    }, qe = new xe(oe);
-    return z?.add(qe), qe.event;
+    }, qe = new ye(ue);
+    return H?.add(qe), qe.event;
   }
   t.throttle = d;
   function g(R, N = (M, E) => M === E, k) {
     let M = !0, E;
     return a(R, ($) => {
-      const z = M || !N($, E);
-      return M = !1, E = $, z;
+      const H = M || !N($, E);
+      return M = !1, E = $, H;
     }, k);
   }
   t.latch = g;
@@ -686,30 +686,30 @@ var yn;
     ];
   }
   t.split = w;
-  function x(R, N, k = !1, M = [], E) {
-    let $ = M.slice(), z;
-    sr() && (z = {
+  function y(R, N, k = !1, M = [], E) {
+    let $ = M.slice(), H;
+    sr() && (H = {
       stack: Zt.create(),
       timerId: setTimeout(() => {
-        $ && $.length > 0 && z && !z.warned && (z.warned = !0, console.warn(`[Event.buffer][${N}] potential LEAK detected: ${$.length} events buffered for ${rr / 1e3}s without being consumed. Buffered here:`), z.stack.print());
+        $ && $.length > 0 && H && !H.warned && (H.warned = !0, console.warn(`[Event.buffer][${N}] potential LEAK detected: ${$.length} events buffered for ${rr / 1e3}s without being consumed. Buffered here:`), H.stack.print());
       }, rr),
       warned: !1
-    }, E && E.add(yt(() => clearTimeout(z.timerId))));
+    }, E && E.add(vt(() => clearTimeout(H.timerId))));
     const te = () => {
-      z && clearTimeout(z.timerId);
+      H && clearTimeout(H.timerId);
     };
-    let Q = R((oe) => {
-      $ ? ($.push(oe), sr() && z && !z.warned && $.length >= la && (z.warned = !0, console.warn(`[Event.buffer][${N}] potential LEAK detected: ${$.length} events buffered without being consumed. Buffered here:`), z.stack.print())) : ne.fire(oe);
+    let Q = R((ue) => {
+      $ ? ($.push(ue), sr() && H && !H.warned && $.length >= la && (H.warned = !0, console.warn(`[Event.buffer][${N}] potential LEAK detected: ${$.length} events buffered without being consumed. Buffered here:`), H.stack.print())) : ne.fire(ue);
     });
     E && E.add(Q);
-    const re = () => {
-      $?.forEach((oe) => ne.fire(oe)), $ = null, te();
-    }, ne = new xe({
+    const se = () => {
+      $?.forEach((ue) => ne.fire(ue)), $ = null, te();
+    }, ne = new ye({
       onWillAddFirstListener() {
-        Q || (Q = R((oe) => ne.fire(oe)), E && E.add(Q));
+        Q || (Q = R((ue) => ne.fire(ue)), E && E.add(Q));
       },
       onDidAddFirstListener() {
-        $ && (k ? setTimeout(re) : re());
+        $ && (k ? setTimeout(se) : se());
       },
       onDidRemoveLastListener() {
         Q && Q.dispose(), Q = null, te();
@@ -717,12 +717,12 @@ var yn;
     });
     return E && E.add(ne), ne.event;
   }
-  t.buffer = x;
+  t.buffer = y;
   function _(R, N) {
     return (M, E, $) => {
-      const z = N(new A());
+      const H = N(new A());
       return R(function(te) {
-        const Q = z.evaluate(te);
+        const Q = H.evaluate(te);
         Q !== L && M.call(E, Q);
       }, void 0, $);
     };
@@ -761,16 +761,16 @@ var yn;
     }
   }
   function I(R, N, k = (M) => M) {
-    const M = (...te) => z.fire(k(...te)), E = () => R.on(N, M), $ = () => R.removeListener(N, M), z = new xe({ onWillAddFirstListener: E, onDidRemoveLastListener: $ });
-    return z.event;
+    const M = (...te) => H.fire(k(...te)), E = () => R.on(N, M), $ = () => R.removeListener(N, M), H = new ye({ onWillAddFirstListener: E, onDidRemoveLastListener: $ });
+    return H.event;
   }
   t.fromNodeEventEmitter = I;
   function O(R, N, k = (M) => M) {
-    const M = (...te) => z.fire(k(...te)), E = () => R.addEventListener(N, M), $ = () => R.removeEventListener(N, M), z = new xe({ onWillAddFirstListener: E, onDidRemoveLastListener: $ });
-    return z.event;
+    const M = (...te) => H.fire(k(...te)), E = () => R.addEventListener(N, M), $ = () => R.removeEventListener(N, M), H = new ye({ onWillAddFirstListener: E, onDidRemoveLastListener: $ });
+    return H.event;
   }
   t.fromDOMEventEmitter = O;
-  function y(R, N) {
+  function x(R, N) {
     let k, M;
     const E = new Promise(($) => {
       M = n(R)($), vn(M, N), k = () => {
@@ -779,7 +779,7 @@ var yn;
     });
     return E.cancel = k, N && E.finally(() => ir(M, N)), E;
   }
-  t.toPromise = y;
+  t.toPromise = x;
   function v(R, N) {
     return R((k) => N.fire(k));
   }
@@ -799,7 +799,7 @@ var yn;
           N.removeObserver(this);
         }
       };
-      this.emitter = new xe(M), k && k.add(this.emitter);
+      this.emitter = new ye(M), k && k.add(this.emitter);
     }
     beginUpdate(N) {
       this._counter++;
@@ -820,7 +820,7 @@ var yn;
   function D(R) {
     return (N, k, M) => {
       let E = 0, $ = !1;
-      const z = {
+      const H = {
         beginUpdate() {
           E++;
         },
@@ -833,17 +833,17 @@ var yn;
           $ = !0;
         }
       };
-      R.addObserver(z), R.reportChanges();
+      R.addObserver(H), R.reportChanges();
       const te = {
         dispose() {
-          R.removeObserver(z);
+          R.removeObserver(H);
         }
       };
       return vn(te, M), te;
     };
   }
   t.fromObservableLight = D;
-})(yn || (yn = {}));
+})(xn || (xn = {}));
 class qt {
   static {
     this.all = /* @__PURE__ */ new Set();
@@ -935,7 +935,7 @@ class an {
   }
 }
 const ha = 2;
-class xe {
+class ye {
   constructor(e) {
     this._size = 0, this._options = e, this._leakageMon = this._options?.leakWarningThreshold ? new Gn(e?.onListenerError ?? Ft, this._options?.leakWarningThreshold ?? ua, this._options?.leakWarningName) : void 0, this._perfMon = this._options?._profName ? new qt(this._options._profName) : void 0, this._deliveryQueue = this._options?.deliveryQueue;
   }
@@ -952,15 +952,15 @@ class xe {
         const l = `[${this._leakageMon.name}] REFUSES to accept new listeners because it exceeded its threshold by far (${this._size} vs ${this._leakageMon.threshold})`;
         console.warn(l);
         const u = this._leakageMon.getMostFrequentStack() ?? ["UNKNOWN stack", -1], c = u[1] / this._size > 0.3 ? "dominated" : "popular", h = new ca(c, `${l}. HINT: Stack shows most frequent listener (${u[1]}-times)`, u[0], this._size, this._options?.leakWarningName);
-        return (this._options?.onListenerError || Ft)(h), vt.None;
+        return (this._options?.onListenerError || Ft)(h), Lt.None;
       }
       if (this._disposed)
-        return vt.None;
+        return Lt.None;
       n && (e = e.bind(n));
       const s = new an(e);
       let i;
       this._leakageMon && this._size >= Math.ceil(this._leakageMon.threshold * 0.2) && (s.stack = Zt.create(), i = this._leakageMon.check(s.stack, this._size + 1)), this._listeners ? this._listeners instanceof an ? (this._deliveryQueue ??= new fa(), this._listeners = [this._listeners, s]) : this._listeners.push(s) : (this._options?.onWillAddFirstListener?.(this), this._listeners = s, this._options?.onDidAddFirstListener?.(this)), this._options?.onDidAddListener?.(this), this._size++;
-      const a = yt(() => {
+      const a = vt(() => {
         i?.(), this._removeListener(s);
       });
       return vn(a, r), a;
@@ -1112,7 +1112,7 @@ function wa(t) {
   }
   return -1;
 }
-function xa(t, e = t.length - 1) {
+function ya(t, e = t.length - 1) {
   for (let n = e; n >= 0; n--) {
     const r = t.charCodeAt(n);
     if (r !== 32 && r !== 9)
@@ -1143,7 +1143,7 @@ function Nn(t, e) {
 function Sn(t) {
   return 55296 <= t && t <= 56319;
 }
-function ya(t) {
+function xa(t) {
   return 56320 <= t && t <= 57343;
 }
 function va(t, e) {
@@ -1153,7 +1153,7 @@ function La(t, e, n) {
   const r = t.charCodeAt(n);
   if (Sn(r) && n + 1 < e) {
     const s = t.charCodeAt(n + 1);
-    if (ya(s))
+    if (xa(s))
       return va(r, s);
   }
   return r;
@@ -1288,7 +1288,7 @@ class Aa {
   }
   listen(e, n, r) {
     let s = null;
-    const i = new xe({
+    const i = new ye({
       onWillAddFirstListener: () => {
         s = String(++this._lastSentReq), this._pendingEmitters.set(s, i), this._send(new Ra(this._workerId, s, e, n, r));
       },
@@ -1497,13 +1497,13 @@ class ur {
 function Fa(t, e, n) {
   return new Ie(new ur(t), new ur(e)).ComputeDiff(n).changes;
 }
-class je {
+class Ge {
   static Assert(e, n) {
     if (!e)
       throw new Error(n);
   }
 }
-class Ge {
+class Qe {
   /**
    * Copies a range of elements from an Array starting at the specified source index and pastes
    * them to another Array starting at the specified destination index. The length and the indexes
@@ -1642,11 +1642,11 @@ class Ie {
       n--, s--;
     if (e > n || r > s) {
       let f;
-      return r <= s ? (je.Assert(e === n + 1, "originalStart should only be one more than originalEnd"), f = [
+      return r <= s ? (Ge.Assert(e === n + 1, "originalStart should only be one more than originalEnd"), f = [
         new Pe(e, 0, r, s - r + 1)
-      ]) : e <= n ? (je.Assert(r === s + 1, "modifiedStart should only be one more than modifiedEnd"), f = [
+      ]) : e <= n ? (Ge.Assert(r === s + 1, "modifiedStart should only be one more than modifiedEnd"), f = [
         new Pe(e, n - e + 1, r, 0)
-      ]) : (je.Assert(e === n + 1, "originalStart should only be one more than originalEnd"), je.Assert(r === s + 1, "modifiedStart should only be one more than modifiedEnd"), f = []), f;
+      ]) : (Ge.Assert(e === n + 1, "originalStart should only be one more than originalEnd"), Ge.Assert(r === s + 1, "modifiedStart should only be one more than modifiedEnd"), f = []), f;
     }
     const a = [0], l = [0], u = this.ComputeRecursionPoint(e, n, r, s, a, l, i), c = a[0], h = l[0];
     if (u !== null)
@@ -1662,11 +1662,11 @@ class Ie {
       new Pe(e, n - e + 1, r, s - r + 1)
     ];
   }
-  WALKTRACE(e, n, r, s, i, a, l, u, c, h, f, m, p, d, g, w, x, _) {
-    let L = null, A = null, I = new cr(), O = n, y = r, v = p[0] - w[0] - s, S = -1073741824, B = this.m_forwardHistory.length - 1;
+  WALKTRACE(e, n, r, s, i, a, l, u, c, h, f, m, p, d, g, w, y, _) {
+    let L = null, A = null, I = new cr(), O = n, x = r, v = p[0] - w[0] - s, S = -1073741824, B = this.m_forwardHistory.length - 1;
     do {
       const W = v + e;
-      W === O || W < y && c[W - 1] < c[W + 1] ? (f = c[W + 1], d = f - v - s, f < S && I.MarkNextChange(), S = f, I.AddModifiedElement(f + 1, d), v = W + 1 - e) : (f = c[W - 1] + 1, d = f - v - s, f < S && I.MarkNextChange(), S = f - 1, I.AddOriginalElement(f, d + 1), v = W - 1 - e), B >= 0 && (c = this.m_forwardHistory[B], e = c[0], O = 1, y = c.length - 1);
+      W === O || W < x && c[W - 1] < c[W + 1] ? (f = c[W + 1], d = f - v - s, f < S && I.MarkNextChange(), S = f, I.AddModifiedElement(f + 1, d), v = W + 1 - e) : (f = c[W - 1] + 1, d = f - v - s, f < S && I.MarkNextChange(), S = f - 1, I.AddOriginalElement(f, d + 1), v = W - 1 - e), B >= 0 && (c = this.m_forwardHistory[B], e = c[0], O = 1, x = c.length - 1);
     } while (--B >= -1);
     if (L = I.getReverseChanges(), _[0]) {
       let W = p[0] + 1, D = w[0] + 1;
@@ -1678,10 +1678,10 @@ class Ie {
         new Pe(W, m - W + 1, D, g - D + 1)
       ];
     } else {
-      I = new cr(), O = a, y = l, v = p[0] - w[0] - u, S = 1073741824, B = x ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2;
+      I = new cr(), O = a, x = l, v = p[0] - w[0] - u, S = 1073741824, B = y ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2;
       do {
         const W = v + i;
-        W === O || W < y && h[W - 1] >= h[W + 1] ? (f = h[W + 1] - 1, d = f - v - u, f > S && I.MarkNextChange(), S = f + 1, I.AddOriginalElement(f + 1, d + 1), v = W + 1 - i) : (f = h[W - 1], d = f - v - u, f > S && I.MarkNextChange(), S = f, I.AddModifiedElement(f + 1, d + 1), v = W - 1 - i), B >= 0 && (h = this.m_reverseHistory[B], i = h[0], O = 1, y = h.length - 1);
+        W === O || W < x && h[W - 1] >= h[W + 1] ? (f = h[W + 1] - 1, d = f - v - u, f > S && I.MarkNextChange(), S = f + 1, I.AddOriginalElement(f + 1, d + 1), v = W + 1 - i) : (f = h[W - 1], d = f - v - u, f > S && I.MarkNextChange(), S = f, I.AddModifiedElement(f + 1, d + 1), v = W - 1 - i), B >= 0 && (h = this.m_reverseHistory[B], i = h[0], O = 1, x = h.length - 1);
       } while (--B >= -1);
       A = I.getChanges();
     }
@@ -1706,8 +1706,8 @@ class Ie {
   ComputeRecursionPoint(e, n, r, s, i, a, l) {
     let u = 0, c = 0, h = 0, f = 0, m = 0, p = 0;
     e--, r--, i[0] = 0, a[0] = 0, this.m_forwardHistory = [], this.m_reverseHistory = [];
-    const d = n - e + (s - r), g = d + 1, w = new Int32Array(g), x = new Int32Array(g), _ = s - r, L = n - e, A = e - r, I = n - s, y = (L - _) % 2 === 0;
-    w[_] = e, x[L] = n, l[0] = !1;
+    const d = n - e + (s - r), g = d + 1, w = new Int32Array(g), y = new Int32Array(g), _ = s - r, L = n - e, A = e - r, I = n - s, x = (L - _) % 2 === 0;
+    w[_] = e, y[L] = n, l[0] = !1;
     for (let v = 1; v <= d / 2 + 1; v++) {
       let S = 0, B = 0;
       h = this.ClipDiagonalBound(_ - v, v, _, g), f = this.ClipDiagonalBound(_ + v, v, _, g);
@@ -1716,29 +1716,29 @@ class Ie {
         const R = u;
         for (; u < n && c < s && this.ElementsAreEqual(u + 1, c + 1); )
           u++, c++;
-        if (w[D] = u, u + c > S + B && (S = u, B = c), !y && Math.abs(D - L) <= v - 1 && u >= x[D])
-          return i[0] = u, a[0] = c, R <= x[D] && v <= 1448 ? this.WALKTRACE(_, h, f, A, L, m, p, I, w, x, u, n, i, c, s, a, y, l) : null;
+        if (w[D] = u, u + c > S + B && (S = u, B = c), !x && Math.abs(D - L) <= v - 1 && u >= y[D])
+          return i[0] = u, a[0] = c, R <= y[D] && v <= 1448 ? this.WALKTRACE(_, h, f, A, L, m, p, I, w, y, u, n, i, c, s, a, x, l) : null;
       }
       const W = (S - e + (B - r) - v) / 2;
       if (this.ContinueProcessingPredicate !== null && !this.ContinueProcessingPredicate(S, W))
-        return l[0] = !0, i[0] = S, a[0] = B, W > 0 && v <= 1448 ? this.WALKTRACE(_, h, f, A, L, m, p, I, w, x, u, n, i, c, s, a, y, l) : (e++, r++, [
+        return l[0] = !0, i[0] = S, a[0] = B, W > 0 && v <= 1448 ? this.WALKTRACE(_, h, f, A, L, m, p, I, w, y, u, n, i, c, s, a, x, l) : (e++, r++, [
           new Pe(e, n - e + 1, r, s - r + 1)
         ]);
       m = this.ClipDiagonalBound(L - v, v, L, g), p = this.ClipDiagonalBound(L + v, v, L, g);
       for (let D = m; D <= p; D += 2) {
-        D === m || D < p && x[D - 1] >= x[D + 1] ? u = x[D + 1] - 1 : u = x[D - 1], c = u - (D - L) - I;
+        D === m || D < p && y[D - 1] >= y[D + 1] ? u = y[D + 1] - 1 : u = y[D - 1], c = u - (D - L) - I;
         const R = u;
         for (; u > e && c > r && this.ElementsAreEqual(u, c); )
           u--, c--;
-        if (x[D] = u, y && Math.abs(D - _) <= v && u <= w[D])
-          return i[0] = u, a[0] = c, R >= w[D] && v <= 1448 ? this.WALKTRACE(_, h, f, A, L, m, p, I, w, x, u, n, i, c, s, a, y, l) : null;
+        if (y[D] = u, x && Math.abs(D - _) <= v && u <= w[D])
+          return i[0] = u, a[0] = c, R >= w[D] && v <= 1448 ? this.WALKTRACE(_, h, f, A, L, m, p, I, w, y, u, n, i, c, s, a, x, l) : null;
       }
       if (v <= 1447) {
         let D = new Int32Array(f - h + 2);
-        D[0] = _ - h + 1, Ge.Copy2(w, h, D, 1, f - h + 1), this.m_forwardHistory.push(D), D = new Int32Array(p - m + 2), D[0] = L - m + 1, Ge.Copy2(x, m, D, 1, p - m + 1), this.m_reverseHistory.push(D);
+        D[0] = _ - h + 1, Qe.Copy2(w, h, D, 1, f - h + 1), this.m_forwardHistory.push(D), D = new Int32Array(p - m + 2), D[0] = L - m + 1, Qe.Copy2(y, m, D, 1, p - m + 1), this.m_reverseHistory.push(D);
       }
     }
-    return this.WALKTRACE(_, h, f, A, L, m, p, I, w, x, u, n, i, c, s, a, y, l);
+    return this.WALKTRACE(_, h, f, A, L, m, p, I, w, y, u, n, i, c, s, a, x, l);
   }
   /**
    * Shifts the given changes to provide a more intuitive diff.
@@ -1863,10 +1863,10 @@ class Ie {
       return n.length > 0 ? n : e;
     if (this.ChangesOverlap(e[e.length - 1], n[0], r)) {
       const s = new Array(e.length + n.length - 1);
-      return Ge.Copy(e, 0, s, 0, e.length - 1), s[e.length - 1] = r[0], Ge.Copy(n, 1, s, e.length, n.length - 1), s;
+      return Qe.Copy(e, 0, s, 0, e.length - 1), s[e.length - 1] = r[0], Qe.Copy(n, 1, s, e.length, n.length - 1), s;
     } else {
       const s = new Array(e.length + n.length);
-      return Ge.Copy(e, 0, s, 0, e.length), Ge.Copy(n, 0, s, e.length, n.length), s;
+      return Qe.Copy(e, 0, s, 0, e.length), Qe.Copy(n, 0, s, e.length, n.length), s;
     }
   }
   /**
@@ -1878,7 +1878,7 @@ class Ie {
    * @returns True if the two changes overlap
    */
   ChangesOverlap(e, n, r) {
-    if (je.Assert(e.originalStart <= n.originalStart, "Left change is not less than or equal to right change"), je.Assert(e.modifiedStart <= n.modifiedStart, "Left change is not less than or equal to right change"), e.originalStart + e.originalLength >= n.originalStart || e.modifiedStart + e.modifiedLength >= n.modifiedStart) {
+    if (Ge.Assert(e.originalStart <= n.originalStart, "Left change is not less than or equal to right change"), Ge.Assert(e.modifiedStart <= n.modifiedStart, "Left change is not less than or equal to right change"), e.originalStart + e.originalLength >= n.originalStart || e.modifiedStart + e.modifiedLength >= n.modifiedStart) {
       const s = e.originalStart;
       let i = e.originalLength;
       const a = e.modifiedStart;
@@ -2269,7 +2269,7 @@ class C {
 function hr(t) {
   return t < 0 ? 0 : t > 255 ? 255 : t | 0;
 }
-function Qe(t) {
+function Je(t) {
   return t < 0 ? 0 : t > 4294967295 ? 4294967295 : t | 0;
 }
 class Qn {
@@ -2467,29 +2467,29 @@ function $a() {
     ]
   ])), ln;
 }
-let ut = null;
+let ct = null;
 function Ba() {
-  if (ut === null) {
-    ut = new Qn(
+  if (ct === null) {
+    ct = new Qn(
       0
       /* CharacterClass.None */
     );
     const t = ` 	<>'"、。｡､，．：；‘〈「『〔（［｛｢｣｝］）〕』」〉’｀～…|`;
     for (let n = 0; n < t.length; n++)
-      ut.set(
+      ct.set(
         t.charCodeAt(n),
         1
         /* CharacterClass.ForceTermination */
       );
     const e = ".,;:";
     for (let n = 0; n < e.length; n++)
-      ut.set(
+      ct.set(
         e.charCodeAt(n),
         2
         /* CharacterClass.CannotEndIn */
       );
   }
-  return ut;
+  return ct;
 }
 class Ut {
   static _createLink(e, n, r, s, i) {
@@ -2520,7 +2520,7 @@ class Ut {
       const l = e.getLineContent(i), u = l.length;
       let c = 0, h = 0, f = 0, m = 1, p = !1, d = !1, g = !1, w = !1;
       for (; c < u; ) {
-        let x = !1;
+        let y = !1;
         const _ = l.charCodeAt(c);
         if (m === 13) {
           let L;
@@ -2559,13 +2559,13 @@ class Ut {
             default:
               L = r.get(_);
           }
-          L === 1 && (s.push(Ut._createLink(r, l, i, h, c)), x = !0);
+          L === 1 && (s.push(Ut._createLink(r, l, i, h, c)), y = !0);
         } else if (m === 12) {
           let L;
-          _ === 91 ? (d = !0, L = 0) : L = r.get(_), L === 1 ? x = !0 : m = 13;
+          _ === 91 ? (d = !0, L = 0) : L = r.get(_), L === 1 ? y = !0 : m = 13;
         } else
-          m = n.nextState(m, _), m === 0 && (x = !0);
-        x && (m = 1, p = !1, d = !1, w = !1, h = c + 1, f = _), c++;
+          m = n.nextState(m, _), m === 0 && (y = !0);
+        y && (m = 1, p = !1, d = !1, w = !1, h = c + 1, f = _), c++;
       }
       m === 13 && s.push(Ut._createLink(r, l, i, h, u));
     }
@@ -2643,7 +2643,7 @@ var Ot;
   }
   t.isCancellationToken = e, t.None = Object.freeze({
     isCancellationRequested: !1,
-    onCancellationRequested: yn.None
+    onCancellationRequested: xn.None
   }), t.Cancelled = Object.freeze({
     isCancellationRequested: !0,
     onCancellationRequested: ui
@@ -2660,7 +2660,7 @@ class It {
     return this._isCancelled;
   }
   get onCancellationRequested() {
-    return this._isCancelled ? ui : (this._emitter || (this._emitter = new xe()), this._emitter.event);
+    return this._isCancelled ? ui : (this._emitter || (this._emitter = new ye()), this._emitter.event);
   }
   dispose() {
     this._emitter && (this._emitter.dispose(), this._emitter = null);
@@ -2982,11 +2982,11 @@ var fr;
   }
   t.toElectronAccelerator = a;
 })(fr || (fr = {}));
-function za(t, e) {
+function Ha(t, e) {
   const n = (e & 65535) << 16 >>> 0;
   return (t | n) >>> 0;
 }
-const Ha = 65, ja = 97, Ga = 90, Qa = 122, ze = 46, ee = 47, le = 92, Se = 58, Ja = 63;
+const za = 65, ja = 97, Ga = 90, Qa = 122, He = 46, ee = 47, ce = 92, Ce = 58, Ja = 63;
 class ci extends Error {
   constructor(e, n, r) {
     let s;
@@ -3006,13 +3006,13 @@ function Z(t, e) {
 }
 const Te = aa === "win32";
 function U(t) {
-  return t === ee || t === le;
+  return t === ee || t === ce;
 }
 function kn(t) {
   return t === ee;
 }
-function Ce(t) {
-  return t >= Ha && t <= Ga || t >= ja && t <= Qa;
+function Re(t) {
+  return t >= za && t <= Ga || t >= ja && t <= Qa;
 }
 function Wt(t, e, n, r) {
   let s = "", i = 0, a = -1, l = 0, u = 0;
@@ -3026,7 +3026,7 @@ function Wt(t, e, n, r) {
     }
     if (r(u)) {
       if (!(a === c - 1 || l === 1)) if (l === 2) {
-        if (s.length < 2 || i !== 2 || s.charCodeAt(s.length - 1) !== ze || s.charCodeAt(s.length - 2) !== ze) {
+        if (s.length < 2 || i !== 2 || s.charCodeAt(s.length - 1) !== He || s.charCodeAt(s.length - 2) !== He) {
           if (s.length > 2) {
             const h = s.lastIndexOf(n);
             h === -1 ? (s = "", i = 0) : (s = s.slice(0, h), i = s.length - 1 - s.lastIndexOf(n)), a = c, l = 0;
@@ -3040,7 +3040,7 @@ function Wt(t, e, n, r) {
       } else
         s.length > 0 ? s += `${n}${t.slice(a + 1, c)}` : s = t.slice(a + 1, c), i = c - a - 1;
       a = c, l = 0;
-    } else u === ze && l !== -1 ? ++l : l = -1;
+    } else u === He && l !== -1 ? ++l : l = -1;
   }
   return s;
 }
@@ -3052,7 +3052,7 @@ function hi(t, e) {
   const n = e.dir || e.root, r = e.base || `${e.name || ""}${Ya(e.ext)}`;
   return n ? n === e.root ? `${n}${r}` : `${n}${t}${r}` : r;
 }
-const se = {
+const ie = {
   // path.resolve([from ...], to)
   resolve(...t) {
     let e = "", n = "", r = !1;
@@ -3061,7 +3061,7 @@ const se = {
       if (s >= 0) {
         if (i = t[s], Z(i, `paths[${s}]`), i.length === 0)
           continue;
-      } else e.length === 0 ? i = Vt() : (i = ii[`=${e}`] || Vt(), (i === void 0 || i.slice(0, 2).toLowerCase() !== e.toLowerCase() && i.charCodeAt(2) === le) && (i = `${e}\\`));
+      } else e.length === 0 ? i = Vt() : (i = ii[`=${e}`] || Vt(), (i === void 0 || i.slice(0, 2).toLowerCase() !== e.toLowerCase() && i.charCodeAt(2) === ce) && (i = `${e}\\`));
       const a = i.length;
       let l = 0, u = "", c = !1;
       const h = i.charCodeAt(0);
@@ -3084,7 +3084,7 @@ const se = {
           }
         } else
           l = 1;
-      else Ce(h) && i.charCodeAt(1) === Se && (u = i.slice(0, 2), l = 2, a > 2 && U(i.charCodeAt(2)) && (c = !0, l = 3));
+      else Re(h) && i.charCodeAt(1) === Ce && (u = i.slice(0, 2), l = 2, a > 2 && U(i.charCodeAt(2)) && (c = !0, l = 3));
       if (u.length > 0)
         if (e.length > 0) {
           if (u.toLowerCase() !== e.toLowerCase())
@@ -3127,10 +3127,10 @@ const se = {
         }
       } else
         n = 1;
-    else Ce(i) && t.charCodeAt(1) === Se && (r = t.slice(0, 2), n = 2, e > 2 && U(t.charCodeAt(2)) && (s = !0, n = 3));
+    else Re(i) && t.charCodeAt(1) === Ce && (r = t.slice(0, 2), n = 2, e > 2 && U(t.charCodeAt(2)) && (s = !0, n = 3));
     let a = n < e ? Wt(t.slice(n), !s, "\\", U) : "";
     if (a.length === 0 && !s && (a = "."), a.length > 0 && U(t.charCodeAt(e - 1)) && (a += "\\"), !s && r === void 0 && t.includes(":")) {
-      if (a.length >= 2 && Ce(a.charCodeAt(0)) && a.charCodeAt(1) === Se)
+      if (a.length >= 2 && Re(a.charCodeAt(0)) && a.charCodeAt(1) === Ce)
         return `.\\${a}`;
       let l = t.indexOf(":");
       do
@@ -3147,7 +3147,7 @@ const se = {
       return !1;
     const n = t.charCodeAt(0);
     return U(n) || // Possible device root
-    e > 2 && Ce(n) && t.charCodeAt(1) === Se && U(t.charCodeAt(2));
+    e > 2 && Re(n) && t.charCodeAt(1) === Ce && U(t.charCodeAt(2));
   },
   join(...t) {
     if (t.length === 0)
@@ -3170,7 +3170,7 @@ const se = {
         s++;
       s >= 2 && (e = `\\${e.slice(s)}`);
     }
-    return se.normalize(e);
+    return ie.normalize(e);
   },
   // It will solve the relative path from `from` to `to`, for instance:
   //  from = 'C:\\orandea\\test\\aaa'
@@ -3179,30 +3179,30 @@ const se = {
   relative(t, e) {
     if (Z(t, "from"), Z(e, "to"), t === e)
       return "";
-    const n = se.resolve(t), r = se.resolve(e);
+    const n = ie.resolve(t), r = ie.resolve(e);
     if (n === r || (t = n.toLowerCase(), e = r.toLowerCase(), t === e))
       return "";
     if (n.length !== t.length || r.length !== e.length) {
       const d = n.split("\\"), g = r.split("\\");
       d[d.length - 1] === "" && d.pop(), g[g.length - 1] === "" && g.pop();
-      const w = d.length, x = g.length, _ = w < x ? w : x;
+      const w = d.length, y = g.length, _ = w < y ? w : y;
       let L;
       for (L = 0; L < _ && d[L].toLowerCase() === g[L].toLowerCase(); L++)
         ;
-      return L === 0 ? r : L === _ ? x > _ ? g.slice(L).join("\\") : w > _ ? "..\\".repeat(w - 1 - L) + ".." : "" : "..\\".repeat(w - L) + g.slice(L).join("\\");
+      return L === 0 ? r : L === _ ? y > _ ? g.slice(L).join("\\") : w > _ ? "..\\".repeat(w - 1 - L) + ".." : "" : "..\\".repeat(w - L) + g.slice(L).join("\\");
     }
     let s = 0;
-    for (; s < t.length && t.charCodeAt(s) === le; )
+    for (; s < t.length && t.charCodeAt(s) === ce; )
       s++;
     let i = t.length;
-    for (; i - 1 > s && t.charCodeAt(i - 1) === le; )
+    for (; i - 1 > s && t.charCodeAt(i - 1) === ce; )
       i--;
     const a = i - s;
     let l = 0;
-    for (; l < e.length && e.charCodeAt(l) === le; )
+    for (; l < e.length && e.charCodeAt(l) === ce; )
       l++;
     let u = e.length;
-    for (; u - 1 > l && e.charCodeAt(u - 1) === le; )
+    for (; u - 1 > l && e.charCodeAt(u - 1) === ce; )
       u--;
     const c = u - l, h = a < c ? a : c;
     let f = -1, m = 0;
@@ -3210,38 +3210,38 @@ const se = {
       const d = t.charCodeAt(s + m);
       if (d !== e.charCodeAt(l + m))
         break;
-      d === le && (f = m);
+      d === ce && (f = m);
     }
     if (m !== h) {
       if (f === -1)
         return r;
     } else {
       if (c > h) {
-        if (e.charCodeAt(l + m) === le)
+        if (e.charCodeAt(l + m) === ce)
           return r.slice(l + m + 1);
         if (m === 2)
           return r.slice(l + m);
       }
-      a > h && (t.charCodeAt(s + m) === le ? f = m : m === 2 && (f = 3)), f === -1 && (f = 0);
+      a > h && (t.charCodeAt(s + m) === ce ? f = m : m === 2 && (f = 3)), f === -1 && (f = 0);
     }
     let p = "";
     for (m = s + f + 1; m <= i; ++m)
-      (m === i || t.charCodeAt(m) === le) && (p += p.length === 0 ? ".." : "\\..");
-    return l += f, p.length > 0 ? `${p}${r.slice(l, u)}` : (r.charCodeAt(l) === le && ++l, r.slice(l, u));
+      (m === i || t.charCodeAt(m) === ce) && (p += p.length === 0 ? ".." : "\\..");
+    return l += f, p.length > 0 ? `${p}${r.slice(l, u)}` : (r.charCodeAt(l) === ce && ++l, r.slice(l, u));
   },
   toNamespacedPath(t) {
     if (typeof t != "string" || t.length === 0)
       return t;
-    const e = se.resolve(t);
+    const e = ie.resolve(t);
     if (e.length <= 2)
       return t;
-    if (e.charCodeAt(0) === le) {
-      if (e.charCodeAt(1) === le) {
+    if (e.charCodeAt(0) === ce) {
+      if (e.charCodeAt(1) === ce) {
         const n = e.charCodeAt(2);
-        if (n !== Ja && n !== ze)
+        if (n !== Ja && n !== He)
           return `\\\\?\\UNC\\${e.slice(2)}`;
       }
-    } else if (Ce(e.charCodeAt(0)) && e.charCodeAt(1) === Se && e.charCodeAt(2) === le)
+    } else if (Re(e.charCodeAt(0)) && e.charCodeAt(1) === Ce && e.charCodeAt(2) === ce)
       return `\\\\?\\${e}`;
     return e;
   },
@@ -3271,7 +3271,7 @@ const se = {
           }
         }
       }
-    } else Ce(s) && t.charCodeAt(1) === Se && (n = e > 2 && U(t.charCodeAt(2)) ? 3 : 2, r = n);
+    } else Re(s) && t.charCodeAt(1) === Ce && (n = e > 2 && U(t.charCodeAt(2)) ? 3 : 2, r = n);
     let i = -1, a = !0;
     for (let l = e - 1; l >= r; --l)
       if (U(t.charCodeAt(l))) {
@@ -3291,7 +3291,7 @@ const se = {
   basename(t, e) {
     e !== void 0 && Z(e, "suffix"), Z(t, "path");
     let n = 0, r = -1, s = !0, i;
-    if (t.length >= 2 && Ce(t.charCodeAt(0)) && t.charCodeAt(1) === Se && (n = 2), e !== void 0 && e.length > 0 && e.length <= t.length) {
+    if (t.length >= 2 && Re(t.charCodeAt(0)) && t.charCodeAt(1) === Ce && (n = 2), e !== void 0 && e.length > 0 && e.length <= t.length) {
       if (e === t)
         return "";
       let a = e.length - 1, l = -1;
@@ -3319,7 +3319,7 @@ const se = {
   extname(t) {
     Z(t, "path");
     let e = 0, n = -1, r = 0, s = -1, i = !0, a = 0;
-    t.length >= 2 && t.charCodeAt(1) === Se && Ce(t.charCodeAt(0)) && (e = r = 2);
+    t.length >= 2 && t.charCodeAt(1) === Ce && Re(t.charCodeAt(0)) && (e = r = 2);
     for (let l = t.length - 1; l >= e; --l) {
       const u = t.charCodeAt(l);
       if (U(u)) {
@@ -3329,7 +3329,7 @@ const se = {
         }
         continue;
       }
-      s === -1 && (i = !1, s = l + 1), u === ze ? n === -1 ? n = l : a !== 1 && (a = 1) : n !== -1 && (a = -1);
+      s === -1 && (i = !1, s = l + 1), u === He ? n === -1 ? n = l : a !== 1 && (a = 1) : n !== -1 && (a = -1);
     }
     return n === -1 || s === -1 || // We saw a non-dot character immediately before the dot
     a === 0 || // The (right-most) trimmed path component is exactly '..'
@@ -3360,7 +3360,7 @@ const se = {
           }
         }
       }
-    } else if (Ce(s) && t.charCodeAt(1) === Se) {
+    } else if (Re(s) && t.charCodeAt(1) === Ce) {
       if (n <= 2)
         return e.root = e.dir = t, e;
       if (r = 2, U(t.charCodeAt(2))) {
@@ -3379,7 +3379,7 @@ const se = {
         }
         continue;
       }
-      l === -1 && (u = !1, l = c + 1), s === ze ? i === -1 ? i = c : h !== 1 && (h = 1) : i !== -1 && (h = -1);
+      l === -1 && (u = !1, l = c + 1), s === He ? i === -1 ? i = c : h !== 1 && (h = 1) : i !== -1 && (h = -1);
     }
     return l !== -1 && (i === -1 || // We saw a non-dot character immediately before the dot
     h === 0 || // The (right-most) trimmed path component is exactly '..'
@@ -3398,7 +3398,7 @@ const se = {
     };
   }
   return () => Vt();
-})(), ie = {
+})(), ae = {
   // path.resolve([from ...], to)
   resolve(...t) {
     let e = "", n = !1;
@@ -3429,10 +3429,10 @@ const se = {
       const r = t[n];
       Z(r, "path"), r.length > 0 && e.push(r);
     }
-    return e.length === 0 ? "." : ie.normalize(e.join("/"));
+    return e.length === 0 ? "." : ae.normalize(e.join("/"));
   },
   relative(t, e) {
-    if (Z(t, "from"), Z(e, "to"), t === e || (t = ie.resolve(t), e = ie.resolve(e), t === e))
+    if (Z(t, "from"), Z(e, "to"), t === e || (t = ae.resolve(t), e = ae.resolve(e), t === e))
       return "";
     const n = 1, r = t.length, s = r - n, i = 1, a = e.length - i, l = s < a ? s : a;
     let u = -1, c = 0;
@@ -3537,7 +3537,7 @@ const se = {
         }
         continue;
       }
-      a === -1 && (l = !1, a = u + 1), h === ze ? s === -1 ? s = u : c !== 1 && (c = 1) : s !== -1 && (c = -1);
+      a === -1 && (l = !1, a = u + 1), h === He ? s === -1 ? s = u : c !== 1 && (c = 1) : s !== -1 && (c = -1);
     }
     if (a !== -1) {
       const h = i === 0 && n ? 1 : i;
@@ -3552,16 +3552,16 @@ const se = {
   win32: null,
   posix: null
 };
-ie.win32 = se.win32 = se;
-ie.posix = se.posix = ie;
-Te ? se.normalize : ie.normalize;
-const Ka = Te ? se.join : ie.join;
-Te ? se.resolve : ie.resolve;
-Te ? se.relative : ie.relative;
-Te ? se.dirname : ie.dirname;
-Te ? se.basename : ie.basename;
-Te ? se.extname : ie.extname;
-Te ? se.sep : ie.sep;
+ae.win32 = ie.win32 = ie;
+ae.posix = ie.posix = ae;
+Te ? ie.normalize : ae.normalize;
+const Ka = Te ? ie.join : ae.join;
+Te ? ie.resolve : ae.resolve;
+Te ? ie.relative : ae.relative;
+Te ? ie.dirname : ae.dirname;
+Te ? ie.basename : ae.basename;
+Te ? ie.extname : ae.extname;
+Te ? ie.sep : ae.sep;
 const eo = /^\w[\w\d+.-]*$/, to = /^\//, no = /^\/\//;
 function ro(t, e) {
   if (!t.scheme && e)
@@ -3586,15 +3586,15 @@ function io(t, e) {
     case "https":
     case "http":
     case "file":
-      e ? e[0] !== ye && (e = ye + e) : e = ye;
+      e ? e[0] !== xe && (e = xe + e) : e = xe;
       break;
   }
   return e;
 }
-const j = "", ye = "/", ao = /^(([^:/?#]+?):)?(\/\/([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?/;
-class ge {
+const j = "", xe = "/", ao = /^(([^:/?#]+?):)?(\/\/([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?/;
+class be {
   static isUri(e) {
-    return e instanceof ge ? !0 : !e || typeof e != "object" ? !1 : typeof e.authority == "string" && typeof e.fragment == "string" && typeof e.path == "string" && typeof e.query == "string" && typeof e.scheme == "string" && typeof e.fsPath == "string" && typeof e.with == "function" && typeof e.toString == "function";
+    return e instanceof be ? !0 : !e || typeof e != "object" ? !1 : typeof e.authority == "string" && typeof e.fragment == "string" && typeof e.path == "string" && typeof e.query == "string" && typeof e.scheme == "string" && typeof e.fsPath == "string" && typeof e.with == "function" && typeof e.toString == "function";
   }
   /**
    * @internal
@@ -3635,7 +3635,7 @@ class ge {
     if (!e)
       return this;
     let { scheme: n, authority: r, path: s, query: i, fragment: a } = e;
-    return n === void 0 ? n = this.scheme : n === null && (n = j), r === void 0 ? r = this.authority : r === null && (r = j), s === void 0 ? s = this.path : s === null && (s = j), i === void 0 ? i = this.query : i === null && (i = j), a === void 0 ? a = this.fragment : a === null && (a = j), n === this.scheme && r === this.authority && s === this.path && i === this.query && a === this.fragment ? this : new Je(n, r, s, i, a);
+    return n === void 0 ? n = this.scheme : n === null && (n = j), r === void 0 ? r = this.authority : r === null && (r = j), s === void 0 ? s = this.path : s === null && (s = j), i === void 0 ? i = this.query : i === null && (i = j), a === void 0 ? a = this.fragment : a === null && (a = j), n === this.scheme && r === this.authority && s === this.path && i === this.query && a === this.fragment ? this : new Xe(n, r, s, i, a);
   }
   // ---- parse & validate ------------------------
   /**
@@ -3646,7 +3646,7 @@ class ge {
    */
   static parse(e, n = !1) {
     const r = ao.exec(e);
-    return r ? new Je(r[2] || j, Et(r[4] || j), Et(r[5] || j), Et(r[7] || j), Et(r[9] || j), n) : new Je(j, j, j, j, j);
+    return r ? new Xe(r[2] || j, Et(r[4] || j), Et(r[5] || j), Et(r[7] || j), Et(r[9] || j), n) : new Xe(j, j, j, j, j);
   }
   /**
    * Creates a new URI from a file system path, e.g. `c:\my\files`,
@@ -3671,11 +3671,11 @@ class ge {
    */
   static file(e) {
     let n = j;
-    if (Lt && (e = e.replace(/\\/g, ye)), e[0] === ye && e[1] === ye) {
-      const r = e.indexOf(ye, 2);
-      r === -1 ? (n = e.substring(2), e = ye) : (n = e.substring(2, r), e = e.substring(r) || ye);
+    if (_t && (e = e.replace(/\\/g, xe)), e[0] === xe && e[1] === xe) {
+      const r = e.indexOf(xe, 2);
+      r === -1 ? (n = e.substring(2), e = xe) : (n = e.substring(2, r), e = e.substring(r) || xe);
     }
-    return new Je("file", n, e, j, j);
+    return new Xe("file", n, e, j, j);
   }
   /**
    * Creates new URI from uri components.
@@ -3685,7 +3685,7 @@ class ge {
    * user input, command arguments etc
    */
   static from(e, n) {
-    return new Je(e.scheme, e.authority, e.path, e.query, e.fragment, n);
+    return new Xe(e.scheme, e.authority, e.path, e.query, e.fragment, n);
   }
   /**
    * Join a URI path with path fragments and normalizes the resulting path.
@@ -3698,7 +3698,7 @@ class ge {
     if (!e.path)
       throw new Error(`[UriError]: cannot call joinPath on URI without path: ${e.toString()}`);
     let r;
-    return Lt && e.scheme === "file" ? r = ge.file(se.join(En(e, !0), ...n)).path : r = ie.join(e.path, ...n), e.with({ path: r });
+    return _t && e.scheme === "file" ? r = be.file(ie.join(En(e, !0), ...n)).path : r = ae.join(e.path, ...n), e.with({ path: r });
   }
   // ---- printing/externalize ---------------------------
   /**
@@ -3720,17 +3720,17 @@ class ge {
   }
   static revive(e) {
     if (e) {
-      if (e instanceof ge)
+      if (e instanceof be)
         return e;
       {
-        const n = new Je(e);
+        const n = new Xe(e);
         return n._formatted = e.external ?? null, n._fsPath = e._sep === fi ? e.fsPath ?? null : null, n;
       }
     } else return e;
   }
 }
-const fi = Lt ? 1 : void 0;
-class Je extends ge {
+const fi = _t ? 1 : void 0;
+class Xe extends be {
   constructor() {
     super(...arguments), this._formatted = null, this._fsPath = null;
   }
@@ -3795,12 +3795,12 @@ function oo(t) {
 }
 function En(t, e) {
   let n;
-  return t.authority && t.path.length > 1 && t.scheme === "file" ? n = `//${t.authority}${t.path}` : t.path.charCodeAt(0) === 47 && (t.path.charCodeAt(1) >= 65 && t.path.charCodeAt(1) <= 90 || t.path.charCodeAt(1) >= 97 && t.path.charCodeAt(1) <= 122) && t.path.charCodeAt(2) === 58 ? e ? n = t.path.substr(1) : n = t.path[1].toLowerCase() + t.path.substr(2) : n = t.path, Lt && (n = n.replace(/\//g, "\\")), n;
+  return t.authority && t.path.length > 1 && t.scheme === "file" ? n = `//${t.authority}${t.path}` : t.path.charCodeAt(0) === 47 && (t.path.charCodeAt(1) >= 65 && t.path.charCodeAt(1) <= 90 || t.path.charCodeAt(1) >= 97 && t.path.charCodeAt(1) <= 122) && t.path.charCodeAt(2) === 58 ? e ? n = t.path.substr(1) : n = t.path[1].toLowerCase() + t.path.substr(2) : n = t.path, _t && (n = n.replace(/\//g, "\\")), n;
 }
 function An(t, e) {
   const n = e ? oo : mr;
   let r = "", { scheme: s, authority: i, path: a, query: l, fragment: u } = t;
-  if (s && (r += s, r += ":"), (i || s === "file") && (r += ye, r += ye), i) {
+  if (s && (r += s, r += ":"), (i || s === "file") && (r += xe, r += xe), i) {
     let c = i.indexOf("@");
     if (c !== -1) {
       const h = i.substr(0, c);
@@ -3831,7 +3831,7 @@ const dr = /(%[0-9A-Za-z][0-9A-Za-z])+/g;
 function Et(t) {
   return t.match(dr) ? t.replace(dr, (e) => di(e)) : t;
 }
-class fe extends C {
+class me extends C {
   constructor(e, n, r, s) {
     super(e, n, r, s), this.selectionStartLineNumber = e, this.selectionStartColumn = n, this.positionLineNumber = r, this.positionColumn = s;
   }
@@ -3845,7 +3845,7 @@ class fe extends C {
    * Test if equals other selection.
    */
   equalsSelection(e) {
-    return fe.selectionsEqual(this, e);
+    return me.selectionsEqual(this, e);
   }
   /**
    * Test if the two selections are equal.
@@ -3863,7 +3863,7 @@ class fe extends C {
    * Create a new selection with a different `positionLineNumber` and `positionColumn`.
    */
   setEndPosition(e, n) {
-    return this.getDirection() === 0 ? new fe(this.startLineNumber, this.startColumn, e, n) : new fe(e, n, this.startLineNumber, this.startColumn);
+    return this.getDirection() === 0 ? new me(this.startLineNumber, this.startColumn, e, n) : new me(e, n, this.startLineNumber, this.startColumn);
   }
   /**
    * Get the position at `positionLineNumber` and `positionColumn`.
@@ -3881,26 +3881,26 @@ class fe extends C {
    * Create a new selection with a different `selectionStartLineNumber` and `selectionStartColumn`.
    */
   setStartPosition(e, n) {
-    return this.getDirection() === 0 ? new fe(e, n, this.endLineNumber, this.endColumn) : new fe(this.endLineNumber, this.endColumn, e, n);
+    return this.getDirection() === 0 ? new me(e, n, this.endLineNumber, this.endColumn) : new me(this.endLineNumber, this.endColumn, e, n);
   }
   // ----
   /**
    * Create a `Selection` from one or two positions
    */
   static fromPositions(e, n = e) {
-    return new fe(e.lineNumber, e.column, n.lineNumber, n.column);
+    return new me(e.lineNumber, e.column, n.lineNumber, n.column);
   }
   /**
    * Creates a `Selection` from a range, given a direction.
    */
   static fromRange(e, n) {
-    return n === 0 ? new fe(e.startLineNumber, e.startColumn, e.endLineNumber, e.endColumn) : new fe(e.endLineNumber, e.endColumn, e.startLineNumber, e.startColumn);
+    return n === 0 ? new me(e.startLineNumber, e.startColumn, e.endLineNumber, e.endColumn) : new me(e.endLineNumber, e.endColumn, e.startLineNumber, e.startColumn);
   }
   /**
    * Create a `Selection` from an `ISelection`.
    */
   static liftSelection(e) {
-    return new fe(e.selectionStartLineNumber, e.selectionStartColumn, e.positionLineNumber, e.positionColumn);
+    return new me(e.selectionStartLineNumber, e.selectionStartColumn, e.positionLineNumber, e.positionColumn);
   }
   /**
    * `a` equals `b`.
@@ -3927,7 +3927,7 @@ class fe extends C {
    * Create with a direction.
    */
   static createWithDirection(e, n, r, s, i) {
-    return i === 0 ? new fe(e, n, r, s) : new fe(r, s, e, n);
+    return i === 0 ? new me(e, n, r, s) : new me(r, s, e, n);
   }
 }
 const gr = /* @__PURE__ */ Object.create(null);
@@ -4698,7 +4698,7 @@ const lo = {
 };
 class co {
   constructor() {
-    this._tokenizationSupports = /* @__PURE__ */ new Map(), this._factories = /* @__PURE__ */ new Map(), this._onDidChange = new xe(), this.onDidChange = this._onDidChange.event, this._colorMap = null;
+    this._tokenizationSupports = /* @__PURE__ */ new Map(), this._factories = /* @__PURE__ */ new Map(), this._onDidChange = new ye(), this.onDidChange = this._onDidChange.event, this._colorMap = null;
   }
   handleChange(e) {
     this._onDidChange.fire({
@@ -4707,7 +4707,7 @@ class co {
     });
   }
   register(e, n) {
-    return this._tokenizationSupports.set(e, n), this.handleChange([e]), yt(() => {
+    return this._tokenizationSupports.set(e, n), this.handleChange([e]), vt(() => {
       this._tokenizationSupports.get(e) === n && (this._tokenizationSupports.delete(e), this.handleChange([e]));
     });
   }
@@ -4717,7 +4717,7 @@ class co {
   registerFactory(e, n) {
     this._factories.get(e)?.dispose();
     const r = new ho(this, e, n);
-    return this._factories.set(e, r), yt(() => {
+    return this._factories.set(e, r), vt(() => {
       const s = this._factories.get(e);
       !s || s !== r || (this._factories.delete(e), s.dispose());
     });
@@ -4751,7 +4751,7 @@ class co {
     ] : null;
   }
 }
-class ho extends vt {
+class ho extends Lt {
   get isResolved() {
     return this._isResolved;
   }
@@ -4991,14 +4991,14 @@ var wr;
 (function(t) {
   t[t.Automatic = 0] = "Automatic", t[t.Explicit = 1] = "Explicit";
 })(wr || (wr = {}));
-var xr;
+var yr;
 (function(t) {
   t[t.Code = 1] = "Code", t[t.Label = 2] = "Label";
-})(xr || (xr = {}));
-var yr;
+})(yr || (yr = {}));
+var xr;
 (function(t) {
   t[t.Accepted = 0] = "Accepted", t[t.Rejected = 1] = "Rejected", t[t.Ignored = 2] = "Ignored";
-})(yr || (yr = {}));
+})(xr || (xr = {}));
 var vr;
 (function(t) {
   t[t.Automatic = 0] = "Automatic", t[t.PasteAs = 1] = "PasteAs";
@@ -5248,14 +5248,14 @@ var Wr;
 (function(t) {
   t[t.Left = 1] = "Left", t[t.Center = 2] = "Center", t[t.Right = 3] = "Right";
 })(Wr || (Wr = {}));
-var zr;
+var Hr;
 (function(t) {
   t[t.Increase = 0] = "Increase", t[t.Decrease = 1] = "Decrease";
-})(zr || (zr = {}));
-var Hr;
+})(Hr || (Hr = {}));
+var zr;
 (function(t) {
   t[t.None = 0] = "None", t[t.Indent = 1] = "Indent", t[t.IndentOutdent = 2] = "IndentOutdent", t[t.Outdent = 3] = "Outdent";
-})(Hr || (Hr = {}));
+})(zr || (zr = {}));
 var jr;
 (function(t) {
   t[t.Both = 0] = "Both", t[t.Right = 1] = "Right", t[t.Left = 2] = "Left", t[t.None = 3] = "None";
@@ -5394,7 +5394,7 @@ class mo {
     this.WinCtrl = 256;
   }
   static chord(e, n) {
-    return za(e, n);
+    return Ha(e, n);
   }
 }
 function go() {
@@ -5404,23 +5404,23 @@ function go() {
     languages: void 0,
     // undefined override expected here
     CancellationTokenSource: qa,
-    Emitter: xe,
+    Emitter: ye,
     KeyCode: Mn,
     KeyMod: mo,
     Position: q,
     Range: C,
-    Selection: fe,
+    Selection: me,
     SelectionDirection: Fn,
     MarkerSeverity: Tn,
     MarkerTag: Pn,
-    Uri: ge,
+    Uri: be,
     Token: fo
   };
 }
-var xs;
+var ys;
 class po {
   constructor() {
-    this[xs] = "LinkedMap", this._map = /* @__PURE__ */ new Map(), this._head = void 0, this._tail = void 0, this._size = 0, this._state = 0;
+    this[ys] = "LinkedMap", this._map = /* @__PURE__ */ new Map(), this._head = void 0, this._tail = void 0, this._size = 0, this._state = 0;
   }
   clear() {
     this._map.clear(), this._head = void 0, this._tail = void 0, this._size = 0, this._state++;
@@ -5556,7 +5556,7 @@ class po {
     };
     return s;
   }
-  [(xs = Symbol.toStringTag, Symbol.iterator)]() {
+  [(ys = Symbol.toStringTag, Symbol.iterator)]() {
     return this.entries();
   }
   trimOld(e) {
@@ -5692,7 +5692,7 @@ class wo extends bo {
     return super.set(e, n), this.checkTrim(), this;
   }
 }
-class xo {
+class yo {
   constructor() {
     this.map = /* @__PURE__ */ new Map();
   }
@@ -5710,10 +5710,10 @@ class xo {
   }
 }
 new wo(10);
-var ys;
+var xs;
 (function(t) {
   t[t.Left = 1] = "Left", t[t.Center = 2] = "Center", t[t.Right = 4] = "Right", t[t.Full = 7] = "Full";
-})(ys || (ys = {}));
+})(xs || (xs = {}));
 var vs;
 (function(t) {
   t[t.Left = 1] = "Left", t[t.Center = 2] = "Center", t[t.Right = 3] = "Right";
@@ -5726,7 +5726,7 @@ var _s;
 (function(t) {
   t[t.Both = 0] = "Both", t[t.Right = 1] = "Right", t[t.Left = 2] = "Left", t[t.None = 3] = "None";
 })(_s || (_s = {}));
-function yo(t) {
+function xo(t) {
   if (!t || t.length === 0)
     return !1;
   for (let e = 0, n = t.length; e < n; e++) {
@@ -5867,7 +5867,7 @@ class ko {
     l === "allNonBasicAscii" ? u = new RegExp("[^\\t\\n\\r\\x20-\\x7E]", "g") : u = new RegExp(`${Eo(Array.from(l))}`, "g");
     const c = new No(null, u), h = [];
     let f = !1, m, p = 0, d = 0, g = 0;
-    e: for (let w = s, x = i; w <= x; w++) {
+    e: for (let w = s, y = i; w <= y; w++) {
       const _ = e.getLineContent(w), L = _.length;
       c.reset(0);
       do
@@ -5882,9 +5882,9 @@ class ko {
             Sn(S) && I++;
           }
           const O = _.substring(A, I);
-          let y = Yn(A + 1, gi, _, 0);
-          y && y.endColumn <= A + 1 && (y = null);
-          const v = a.shouldHighlightNonBasicASCII(O, y ? y.word : null);
+          let x = Yn(A + 1, gi, _, 0);
+          x && x.endColumn <= A + 1 && (x = null);
+          const v = a.shouldHighlightNonBasicASCII(O, x ? x.word : null);
           if (v !== 0) {
             if (v === 3 ? p++ : v === 2 ? d++ : v === 1 ? g++ : qi(), h.length >= 1e3) {
               f = !0;
@@ -5969,7 +5969,7 @@ function Ss(t) {
   return t === " " || t === `
 ` || t === "	";
 }
-class ft {
+class mt {
   constructor(e, n, r) {
     this.changes = e, this.moves = n, this.hitTimeout = r;
   }
@@ -6026,10 +6026,10 @@ var In;
   }
   t.isNeitherLessOrGreaterThan = s, t.greaterThan = 1, t.lessThan = -1, t.neitherLessOrGreaterThan = 0;
 })(In || (In = {}));
-function nt(t, e) {
+function rt(t, e) {
   return (n, r) => e(t(n), t(r));
 }
-const mt = (t, e) => t - e;
+const dt = (t, e) => t - e;
 function Io(t) {
   return (e, n) => -t(e, n);
 }
@@ -6205,11 +6205,11 @@ class P {
     return n === void 0 && (n = e), new P(this.start - e, this.endExclusive + n);
   }
 }
-function at(t, e) {
-  const n = ot(t, e);
+function ot(t, e) {
+  const n = lt(t, e);
   return n === -1 ? void 0 : t[n];
 }
-function ot(t, e, n = 0, r = t.length) {
+function lt(t, e, n = 0, r = t.length) {
   let s = n, i = r;
   for (; s < i; ) {
     const a = Math.floor((s + i) / 2);
@@ -6249,7 +6249,7 @@ class en {
       }
       this._prevFindLastPredicate = e;
     }
-    const n = ot(this._array, e, this._findLastMonotonousLastIdx);
+    const n = lt(this._array, e, this._findLastMonotonousLastIdx);
     return this._findLastMonotonousLastIdx = n + 1, n === -1 ? void 0 : this._array[n];
   }
 }
@@ -6264,7 +6264,7 @@ class V {
     return new V(e.startLineNumber, e.endLineNumber + 1);
   }
   static {
-    this.compareByStart = nt((e) => e.startLineNumber, mt);
+    this.compareByStart = rt((e) => e.startLineNumber, dt);
   }
   /**
    * @param lineRanges An array of arrays of of sorted line ranges.
@@ -6396,7 +6396,7 @@ class _e {
   addRange(e) {
     if (e.length === 0)
       return;
-    const n = Dn(this._normalizedRanges, (s) => s.endLineNumberExclusive >= e.startLineNumber), r = ot(this._normalizedRanges, (s) => s.startLineNumber <= e.endLineNumberExclusive) + 1;
+    const n = Dn(this._normalizedRanges, (s) => s.endLineNumberExclusive >= e.startLineNumber), r = lt(this._normalizedRanges, (s) => s.startLineNumber <= e.endLineNumberExclusive) + 1;
     if (n === r)
       this._normalizedRanges.splice(n, 0, e);
     else if (n === r - 1) {
@@ -6408,11 +6408,11 @@ class _e {
     }
   }
   contains(e) {
-    const n = at(this._normalizedRanges, (r) => r.startLineNumber <= e);
+    const n = ot(this._normalizedRanges, (r) => r.startLineNumber <= e);
     return !!n && n.endLineNumberExclusive > e;
   }
   intersects(e) {
-    const n = at(this._normalizedRanges, (r) => r.startLineNumber < e.endLineNumberExclusive);
+    const n = ot(this._normalizedRanges, (r) => r.startLineNumber < e.endLineNumberExclusive);
     return !!n && n.endLineNumberExclusive > e.startLineNumber;
   }
   getUnion(e) {
@@ -6436,7 +6436,7 @@ class _e {
    * Subtracts all ranges in this set from `range` and returns the result.
    */
   subtractFrom(e) {
-    const n = Dn(this._normalizedRanges, (a) => a.endLineNumberExclusive >= e.startLineNumber), r = ot(this._normalizedRanges, (a) => a.startLineNumber <= e.endLineNumberExclusive) + 1;
+    const n = Dn(this._normalizedRanges, (a) => a.endLineNumberExclusive >= e.startLineNumber), r = lt(this._normalizedRanges, (a) => a.startLineNumber <= e.endLineNumberExclusive) + 1;
     if (n === r)
       return new _e([e]);
     const s = [];
@@ -6463,25 +6463,25 @@ class _e {
     return new _e(this._normalizedRanges.map((n) => n.delta(e)));
   }
 }
-class ae {
+class oe {
   static {
-    this.zero = new ae(0, 0);
+    this.zero = new oe(0, 0);
   }
   static betweenPositions(e, n) {
-    return e.lineNumber === n.lineNumber ? new ae(0, n.column - e.column) : new ae(n.lineNumber - e.lineNumber, n.column - 1);
+    return e.lineNumber === n.lineNumber ? new oe(0, n.column - e.column) : new oe(n.lineNumber - e.lineNumber, n.column - 1);
   }
   static fromPosition(e) {
-    return new ae(e.lineNumber - 1, e.column - 1);
+    return new oe(e.lineNumber - 1, e.column - 1);
   }
   static ofRange(e) {
-    return ae.betweenPositions(e.getStartPosition(), e.getEndPosition());
+    return oe.betweenPositions(e.getStartPosition(), e.getEndPosition());
   }
   static ofText(e) {
     let n = 0, r = 0;
     for (const s of e)
       s === `
 ` ? (n++, r = 0) : r++;
-    return new ae(n, r);
+    return new oe(n, r);
   }
   constructor(e, n) {
     this.lineCount = e, this.columnCount = n;
@@ -6490,7 +6490,7 @@ class ae {
     return this.lineCount !== e.lineCount ? this.lineCount > e.lineCount : this.columnCount >= e.columnCount;
   }
   add(e) {
-    return e.lineCount === 0 ? new ae(this.lineCount, this.columnCount + e.columnCount) : new ae(this.lineCount + e.lineCount, e.columnCount);
+    return e.lineCount === 0 ? new oe(this.lineCount, this.columnCount + e.columnCount) : new oe(this.lineCount + e.lineCount, e.columnCount);
   }
   createRange(e) {
     return this.lineCount === 0 ? new C(e.lineNumber, e.column, e.lineNumber, e.column + this.columnCount) : new C(e.lineNumber, e.column, e.lineNumber + this.lineCount, this.columnCount + 1);
@@ -6516,17 +6516,17 @@ class $o {
     return C.fromPositions(this.getPosition(e.start), this.getPosition(e.endExclusive));
   }
   getStringReplacement(e) {
-    return new dt.deps.StringReplacement(this.getOffsetRange(e.range), e.text);
+    return new gt.deps.StringReplacement(this.getOffsetRange(e.range), e.text);
   }
   getTextReplacement(e) {
-    return new dt.deps.TextReplacement(this.getRange(e.replaceRange), e.newText);
+    return new gt.deps.TextReplacement(this.getRange(e.replaceRange), e.newText);
   }
   getTextEdit(e) {
     const n = e.replacements.map((r) => this.getTextReplacement(r));
-    return new dt.deps.TextEdit(n);
+    return new gt.deps.TextEdit(n);
   }
 }
-class dt {
+class gt {
   static {
     this._deps = void 0;
   }
@@ -6537,9 +6537,9 @@ class dt {
   }
 }
 function Bo(t) {
-  dt._deps = t;
+  gt._deps = t;
 }
-class xi extends $o {
+class yi extends $o {
   constructor(e) {
     super(), this.text = e;
   }
@@ -6574,18 +6574,18 @@ class xi extends $o {
     return e.column - 1 > r ? new q(e.lineNumber, r + 1) : e;
   }
   getPosition(e) {
-    const n = ot(this.lineStartOffsetByLineIdx, (i) => i <= e), r = n + 1, s = e - this.lineStartOffsetByLineIdx[n] + 1;
+    const n = lt(this.lineStartOffsetByLineIdx, (i) => i <= e), r = n + 1, s = e - this.lineStartOffsetByLineIdx[n] + 1;
     return new q(r, s);
   }
   get textLength() {
     const e = this.lineStartOffsetByLineIdx.length - 1;
-    return new dt.deps.TextLength(e, this.text.length - this.lineStartOffsetByLineIdx[e]);
+    return new gt.deps.TextLength(e, this.text.length - this.lineStartOffsetByLineIdx[e]);
   }
   getLineLength(e) {
     return this.lineEndOffsetByLineIdx[e - 1] - this.lineStartOffsetByLineIdx[e - 1];
   }
 }
-class yi {
+class xi {
   constructor() {
     this._transformer = void 0;
   }
@@ -6605,13 +6605,13 @@ class yi {
     return this.getValueOfRange(new C(e, 1, e, Number.MAX_SAFE_INTEGER)).length;
   }
   getTransformer() {
-    return this._transformer || (this._transformer = new xi(this.getValue())), this._transformer;
+    return this._transformer || (this._transformer = new yi(this.getValue())), this._transformer;
   }
   getLineAt(e) {
     return this.getValueOfRange(new C(e, 1, e, Number.MAX_SAFE_INTEGER));
   }
 }
-class Vo extends yi {
+class Vo extends xi {
   constructor(e, n) {
     Ui(n >= 1), super(), this._getLineContent = e, this._lineCount = n;
   }
@@ -6630,7 +6630,7 @@ class Vo extends yi {
   }
   get length() {
     const e = this._getLineContent(this._lineCount);
-    return new ae(this._lineCount - 1, e.length);
+    return new oe(this._lineCount - 1, e.length);
   }
 }
 class At extends Vo {
@@ -6638,9 +6638,9 @@ class At extends Vo {
     super((n) => e[n - 1], e.length);
   }
 }
-class zt extends yi {
+class Ht extends xi {
   constructor(e) {
-    super(), this.value = e, this._t = new xi(this.value);
+    super(), this.value = e, this._t = new yi(this.value);
   }
   getValueOfRange(e) {
     return this._t.getOffsetRange(e).substring(this.value);
@@ -6653,17 +6653,17 @@ class zt extends yi {
     return this._t;
   }
 }
-class Ht {
+class zt {
   static fromStringEdit(e, n) {
     const r = e.replacements.map((s) => ve.fromStringReplacement(s, n));
-    return new Ht(r);
+    return new zt(r);
   }
   static fromParallelReplacementsUnsorted(e) {
-    const n = e.slice().sort(nt((r) => r.range, C.compareRangesUsingStarts));
-    return new Ht(n);
+    const n = e.slice().sort(rt((r) => r.range, C.compareRangesUsingStarts));
+    return new zt(n);
   }
   constructor(e) {
-    this.replacements = e, xt(() => Hn(e, (n, r) => n.range.getEndPosition().isBeforeOrEqual(r.range.getStartPosition())));
+    this.replacements = e, xt(() => zn(e, (n, r) => n.range.getEndPosition().isBeforeOrEqual(r.range.getStartPosition())));
   }
   mapPosition(e) {
     let n = 0, r = 0, s = 0;
@@ -6671,7 +6671,7 @@ class Ht {
       const a = i.range.getStartPosition();
       if (e.isBeforeOrEqual(a))
         break;
-      const l = i.range.getEndPosition(), u = ae.ofText(i.text);
+      const l = i.range.getEndPosition(), u = oe.ofText(i.text);
       if (e.isBefore(l)) {
         const c = new q(a.lineNumber + n, a.column + (a.lineNumber + n === r ? s : 0)), h = u.addToPosition(c);
         return Mt(c, h);
@@ -6700,14 +6700,14 @@ class Ht {
     return s.isEmpty() || (n += e.getValueOfRange(s)), n;
   }
   applyToString(e) {
-    const n = new zt(e);
+    const n = new Ht(e);
     return this.apply(n);
   }
   getNewRanges() {
     const e = [];
     let n = 0, r = 0, s = 0;
     for (const i of this.replacements) {
-      const a = ae.ofText(i.text), l = q.lift({
+      const a = oe.ofText(i.text), l = q.lift({
         lineNumber: i.range.startLineNumber + r,
         column: i.range.startColumn + (i.range.startLineNumber === n ? s : 0)
       }), u = a.createRange(l);
@@ -6733,7 +6733,7 @@ class Ht {
   }
   toString(e) {
     return e === void 0 ? this.replacements.map((n) => n.toString()).join(`
-`) : typeof e == "string" ? this.toString(new zt(e)) : this.replacements.length === 0 ? "" : this.replacements.map((n) => {
+`) : typeof e == "string" ? this.toString(new Ht(e)) : this.replacements.length === 0 ? "" : this.replacements.map((n) => {
       const s = e.getValueOfRange(n.range), i = C.fromPositions(new q(Math.max(1, n.range.startLineNumber - 1), 1), n.range.getStartPosition());
       let a = e.getValueOfRange(i);
       a.length > 10 && (a = "..." + a.substring(a.length - 10));
@@ -6798,7 +6798,7 @@ class ve {
 `, `
 `), r = this.text.replaceAll(`\r
 `, `
-`), s = _n(n, r), i = ae.ofText(n.substring(0, s)).addToPosition(this.range.getStartPosition()), a = r.substring(s), l = C.fromPositions(i, this.range.getEndPosition());
+`), s = _n(n, r), i = oe.ofText(n.substring(0, s)).addToPosition(this.range.getStartPosition()), a = r.substring(s), l = C.fromPositions(i, this.range.getEndPosition());
     return new ve(l, a);
   }
   removeCommonSuffix(e) {
@@ -6806,7 +6806,7 @@ class ve {
 `, `
 `), r = this.text.replaceAll(`\r
 `, `
-`), s = Nn(n, r), i = ae.ofText(n.substring(0, n.length - s)).addToPosition(this.range.getStartPosition()), a = r.substring(0, r.length - s), l = C.fromPositions(this.range.getStartPosition(), i);
+`), s = Nn(n, r), i = oe.ofText(n.substring(0, n.length - s)).addToPosition(this.range.getStartPosition()), a = r.substring(0, r.length - s), l = C.fromPositions(this.range.getStartPosition(), i);
     return new ve(l, a);
   }
   toString() {
@@ -6821,22 +6821,22 @@ function Mt(t, e) {
     throw new K("start must be before end");
   return new C(t.lineNumber, t.column, e.lineNumber, e.column);
 }
-class de {
+class pe {
   static inverse(e, n, r) {
     const s = [];
     let i = 1, a = 1;
     for (const u of e) {
-      const c = new de(new V(i, u.original.startLineNumber), new V(a, u.modified.startLineNumber));
+      const c = new pe(new V(i, u.original.startLineNumber), new V(a, u.modified.startLineNumber));
       c.modified.isEmpty || s.push(c), i = u.original.endLineNumberExclusive, a = u.modified.endLineNumberExclusive;
     }
-    const l = new de(new V(i, n + 1), new V(a, r + 1));
+    const l = new pe(new V(i, n + 1), new V(a, r + 1));
     return l.modified.isEmpty || s.push(l), s;
   }
   static clip(e, n, r) {
     const s = [];
     for (const i of e) {
       const a = i.original.intersect(n), l = i.modified.intersect(r);
-      a && !a.isEmpty && l && !l.isEmpty && s.push(new de(a, l));
+      a && !a.isEmpty && l && !l.isEmpty && s.push(new pe(a, l));
     }
     return s;
   }
@@ -6847,10 +6847,10 @@ class de {
     return `{${this.original.toString()}->${this.modified.toString()}}`;
   }
   flip() {
-    return new de(this.modified, this.original);
+    return new pe(this.modified, this.original);
   }
   join(e) {
-    return new de(this.original.join(e.original), this.modified.join(e.modified));
+    return new pe(this.original.join(e.original), this.modified.join(e.modified));
   }
   /**
    * This method assumes that the LineRangeMapping describes a valid diff!
@@ -6860,13 +6860,13 @@ class de {
   toRangeMapping() {
     const e = this.original.toInclusiveRange(), n = this.modified.toInclusiveRange();
     if (e && n)
-      return new me(e, n);
+      return new ge(e, n);
     if (this.original.startLineNumber === 1 || this.modified.startLineNumber === 1) {
       if (!(this.modified.startLineNumber === 1 && this.original.startLineNumber === 1))
         throw new K("not a valid diff");
-      return new me(new C(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1), new C(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1));
+      return new ge(new C(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1), new C(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1));
     } else
-      return new me(new C(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), new C(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER));
+      return new ge(new C(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), new C(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER, this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER));
   }
   /**
    * This method assumes that the LineRangeMapping describes a valid diff!
@@ -6875,15 +6875,15 @@ class de {
   */
   toRangeMapping2(e, n) {
     if (Cs(this.original.endLineNumberExclusive, e) && Cs(this.modified.endLineNumberExclusive, n))
-      return new me(new C(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1), new C(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1));
+      return new ge(new C(this.original.startLineNumber, 1, this.original.endLineNumberExclusive, 1), new C(this.modified.startLineNumber, 1, this.modified.endLineNumberExclusive, 1));
     if (!this.original.isEmpty && !this.modified.isEmpty)
-      return new me(C.fromPositions(new q(this.original.startLineNumber, 1), Xe(new q(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), e)), C.fromPositions(new q(this.modified.startLineNumber, 1), Xe(new q(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), n)));
+      return new ge(C.fromPositions(new q(this.original.startLineNumber, 1), Ye(new q(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), e)), C.fromPositions(new q(this.modified.startLineNumber, 1), Ye(new q(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), n)));
     if (this.original.startLineNumber > 1 && this.modified.startLineNumber > 1)
-      return new me(C.fromPositions(Xe(new q(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER), e), Xe(new q(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), e)), C.fromPositions(Xe(new q(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER), n), Xe(new q(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), n)));
+      return new ge(C.fromPositions(Ye(new q(this.original.startLineNumber - 1, Number.MAX_SAFE_INTEGER), e), Ye(new q(this.original.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), e)), C.fromPositions(Ye(new q(this.modified.startLineNumber - 1, Number.MAX_SAFE_INTEGER), n), Ye(new q(this.modified.endLineNumberExclusive - 1, Number.MAX_SAFE_INTEGER), n)));
     throw new K();
   }
 }
-function Xe(t, e) {
+function Ye(t, e) {
   if (t.lineNumber < 1)
     return new q(1, 1);
   if (t.lineNumber > e.length)
@@ -6894,25 +6894,25 @@ function Xe(t, e) {
 function Cs(t, e) {
   return t >= 1 && t <= e.length;
 }
-class Ee extends de {
+class Ae extends pe {
   static fromRangeMappings(e) {
     const n = V.join(e.map((s) => V.fromRangeInclusive(s.originalRange))), r = V.join(e.map((s) => V.fromRangeInclusive(s.modifiedRange)));
-    return new Ee(n, r, e);
+    return new Ae(n, r, e);
   }
   constructor(e, n, r) {
     super(e, n), this.innerChanges = r;
   }
   flip() {
-    return new Ee(this.modified, this.original, this.innerChanges?.map((e) => e.flip()));
+    return new Ae(this.modified, this.original, this.innerChanges?.map((e) => e.flip()));
   }
   withInnerChangesFromLineRanges() {
-    return new Ee(this.original, this.modified, [this.toRangeMapping()]);
+    return new Ae(this.original, this.modified, [this.toRangeMapping()]);
   }
 }
-class me {
+class ge {
   static fromEdit(e) {
     const n = e.getNewRanges();
-    return e.replacements.map((s, i) => new me(s.range, n[i]));
+    return e.replacements.map((s, i) => new ge(s.range, n[i]));
   }
   static assertSorted(e) {
     for (let n = 1; n < e.length; n++) {
@@ -6928,7 +6928,7 @@ class me {
     return `{${this.originalRange.toString()}->${this.modifiedRange.toString()}}`;
   }
   flip() {
-    return new me(this.modifiedRange, this.originalRange);
+    return new ge(this.modifiedRange, this.originalRange);
   }
   /**
    * Creates a single text edit that describes the change from the original to the modified text.
@@ -6942,21 +6942,21 @@ function $n(t, e, n, r = !1) {
   const s = [];
   for (const i of Mo(t.map((a) => qo(a, e, n)), (a, l) => a.original.intersectsOrTouches(l.original) || a.modified.intersectsOrTouches(l.modified))) {
     const a = i[0], l = i[i.length - 1];
-    s.push(new Ee(a.original.join(l.original), a.modified.join(l.modified), i.map((u) => u.innerChanges[0])));
+    s.push(new Ae(a.original.join(l.original), a.modified.join(l.modified), i.map((u) => u.innerChanges[0])));
   }
-  return xt(() => !r && s.length > 0 && (s[0].modified.startLineNumber !== s[0].original.startLineNumber || n.length.lineCount - s[s.length - 1].modified.endLineNumberExclusive !== e.length.lineCount - s[s.length - 1].original.endLineNumberExclusive) ? !1 : Hn(s, (i, a) => a.original.startLineNumber - i.original.endLineNumberExclusive === a.modified.startLineNumber - i.modified.endLineNumberExclusive && // There has to be an unchanged line in between (otherwise both diffs should have been joined)
+  return xt(() => !r && s.length > 0 && (s[0].modified.startLineNumber !== s[0].original.startLineNumber || n.length.lineCount - s[s.length - 1].modified.endLineNumberExclusive !== e.length.lineCount - s[s.length - 1].original.endLineNumberExclusive) ? !1 : zn(s, (i, a) => a.original.startLineNumber - i.original.endLineNumberExclusive === a.modified.startLineNumber - i.modified.endLineNumberExclusive && // There has to be an unchanged line in between (otherwise both diffs should have been joined)
   i.original.endLineNumberExclusive < a.original.startLineNumber && i.modified.endLineNumberExclusive < a.modified.startLineNumber)), s;
 }
 function qo(t, e, n) {
   let r = 0, s = 0;
   t.modifiedRange.endColumn === 1 && t.originalRange.endColumn === 1 && t.originalRange.startLineNumber + r <= t.originalRange.endLineNumber && t.modifiedRange.startLineNumber + r <= t.modifiedRange.endLineNumber && (s = -1), t.modifiedRange.startColumn - 1 >= n.getLineLength(t.modifiedRange.startLineNumber) && t.originalRange.startColumn - 1 >= e.getLineLength(t.originalRange.startLineNumber) && t.originalRange.startLineNumber <= t.originalRange.endLineNumber + s && t.modifiedRange.startLineNumber <= t.modifiedRange.endLineNumber + s && (r = 1);
   const i = new V(t.originalRange.startLineNumber + r, t.originalRange.endLineNumber + 1 + s), a = new V(t.modifiedRange.startLineNumber + r, t.modifiedRange.endLineNumber + 1 + s);
-  return new Ee(i, a, [t]);
+  return new Ae(i, a, [t]);
 }
 const Uo = 3;
 class Oo {
   computeDiff(e, n, r) {
-    const i = new Ho(e, n, {
+    const i = new zo(e, n, {
       maxComputationTime: r.maxComputationTimeMs,
       shouldIgnoreTrimWhitespace: r.ignoreTrimWhitespace,
       shouldComputeCharChanges: !0,
@@ -6969,11 +6969,11 @@ class Oo {
       u.originalEndLineNumber === 0 ? c = new V(u.originalStartLineNumber + 1, u.originalStartLineNumber + 1) : c = new V(u.originalStartLineNumber, u.originalEndLineNumber + 1);
       let h;
       u.modifiedEndLineNumber === 0 ? h = new V(u.modifiedStartLineNumber + 1, u.modifiedStartLineNumber + 1) : h = new V(u.modifiedStartLineNumber, u.modifiedEndLineNumber + 1);
-      let f = new Ee(c, h, u.charChanges?.map((m) => new me(new C(m.originalStartLineNumber, m.originalStartColumn, m.originalEndLineNumber, m.originalEndColumn), new C(m.modifiedStartLineNumber, m.modifiedStartColumn, m.modifiedEndLineNumber, m.modifiedEndColumn))));
-      l && (l.modified.endLineNumberExclusive === f.modified.startLineNumber || l.original.endLineNumberExclusive === f.original.startLineNumber) && (f = new Ee(l.original.join(f.original), l.modified.join(f.modified), l.innerChanges && f.innerChanges ? l.innerChanges.concat(f.innerChanges) : void 0), a.pop()), a.push(f), l = f;
+      let f = new Ae(c, h, u.charChanges?.map((m) => new ge(new C(m.originalStartLineNumber, m.originalStartColumn, m.originalEndLineNumber, m.originalEndColumn), new C(m.modifiedStartLineNumber, m.modifiedStartColumn, m.modifiedEndLineNumber, m.modifiedEndColumn))));
+      l && (l.modified.endLineNumberExclusive === f.modified.startLineNumber || l.original.endLineNumberExclusive === f.original.startLineNumber) && (f = new Ae(l.original.join(f.original), l.modified.join(f.modified), l.innerChanges && f.innerChanges ? l.innerChanges.concat(f.innerChanges) : void 0), a.pop()), a.push(f), l = f;
     }
-    return xt(() => Hn(a, (u, c) => c.original.startLineNumber - u.original.endLineNumberExclusive === c.modified.startLineNumber - u.modified.endLineNumberExclusive && // There has to be an unchanged line in between (otherwise both diffs should have been joined)
-    u.original.endLineNumberExclusive < c.original.startLineNumber && u.modified.endLineNumberExclusive < c.modified.startLineNumber)), new ft(a, [], i.quitEarly);
+    return xt(() => zn(a, (u, c) => c.original.startLineNumber - u.original.endLineNumberExclusive === c.modified.startLineNumber - u.modified.endLineNumberExclusive && // There has to be an unchanged line in between (otherwise both diffs should have been joined)
+    u.original.endLineNumberExclusive < c.original.startLineNumber && u.modified.endLineNumberExclusive < c.modified.startLineNumber)), new mt(a, [], i.quitEarly);
   }
 }
 function vi(t, e, n, r) {
@@ -7040,16 +7040,16 @@ class Wo {
     return e === -1 ? this.getStartColumn(e + 1) : (this._assertIndex(e, this._columns), this._charCodes[e] === 10 ? 1 : this._columns[e] + 1);
   }
 }
-class rt {
+class st {
   constructor(e, n, r, s, i, a, l, u) {
     this.originalStartLineNumber = e, this.originalStartColumn = n, this.originalEndLineNumber = r, this.originalEndColumn = s, this.modifiedStartLineNumber = i, this.modifiedStartColumn = a, this.modifiedEndLineNumber = l, this.modifiedEndColumn = u;
   }
   static createFromDiffChange(e, n, r) {
     const s = n.getStartLineNumber(e.originalStart), i = n.getStartColumn(e.originalStart), a = n.getEndLineNumber(e.originalStart + e.originalLength - 1), l = n.getEndColumn(e.originalStart + e.originalLength - 1), u = r.getStartLineNumber(e.modifiedStart), c = r.getStartColumn(e.modifiedStart), h = r.getEndLineNumber(e.modifiedStart + e.modifiedLength - 1), f = r.getEndColumn(e.modifiedStart + e.modifiedLength - 1);
-    return new rt(s, i, a, l, u, c, h, f);
+    return new st(s, i, a, l, u, c, h, f);
   }
 }
-function zo(t) {
+function Ho(t) {
   if (t.length <= 1)
     return t;
   const e = [t[0]];
@@ -7060,7 +7060,7 @@ function zo(t) {
   }
   return e;
 }
-class gt {
+class pt {
   constructor(e, n, r, s, i) {
     this.originalStartLineNumber = e, this.originalEndLineNumber = n, this.modifiedStartLineNumber = r, this.modifiedEndLineNumber = s, this.charChanges = i;
   }
@@ -7070,15 +7070,15 @@ class gt {
       const p = r.createCharSequence(e, n.originalStart, n.originalStart + n.originalLength - 1), d = s.createCharSequence(e, n.modifiedStart, n.modifiedStart + n.modifiedLength - 1);
       if (p.getElements().length > 0 && d.getElements().length > 0) {
         let g = vi(p, d, i, !0).changes;
-        l && (g = zo(g)), m = [];
-        for (let w = 0, x = g.length; w < x; w++)
-          m.push(rt.createFromDiffChange(g[w], p, d));
+        l && (g = Ho(g)), m = [];
+        for (let w = 0, y = g.length; w < y; w++)
+          m.push(st.createFromDiffChange(g[w], p, d));
       }
     }
-    return new gt(u, c, h, f, m);
+    return new pt(u, c, h, f, m);
   }
 }
-class Ho {
+class zo {
   constructor(e, n, r) {
     this.shouldComputeCharChanges = r.shouldComputeCharChanges, this.shouldPostProcessCharChanges = r.shouldPostProcessCharChanges, this.shouldIgnoreTrimWhitespace = r.shouldIgnoreTrimWhitespace, this.shouldMakePrettyDiff = r.shouldMakePrettyDiff, this.originalLines = e, this.modifiedLines = n, this.original = new Rs(e), this.modified = new Rs(n), this.continueLineDiff = ks(r.maxComputationTime), this.continueCharDiff = ks(r.maxComputationTime === 0 ? 0 : Math.min(r.maxComputationTime, 5e3));
   }
@@ -7112,7 +7112,7 @@ class Ho {
     if (this.shouldIgnoreTrimWhitespace) {
       const l = [];
       for (let u = 0, c = n.length; u < c; u++)
-        l.push(gt.createFromDiffResult(this.shouldIgnoreTrimWhitespace, n[u], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));
+        l.push(pt.createFromDiffResult(this.shouldIgnoreTrimWhitespace, n[u], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));
       return {
         quitEarly: r,
         changes: l
@@ -7128,8 +7128,8 @@ class Ho {
           {
             let d = Bn(m, 1), g = Bn(p, 1);
             for (; d > 1 && g > 1; ) {
-              const w = m.charCodeAt(d - 2), x = p.charCodeAt(g - 2);
-              if (w !== x)
+              const w = m.charCodeAt(d - 2), y = p.charCodeAt(g - 2);
+              if (w !== y)
                 break;
               d--, g--;
             }
@@ -7137,19 +7137,19 @@ class Ho {
           }
           {
             let d = Vn(m, 1), g = Vn(p, 1);
-            const w = m.length + 1, x = p.length + 1;
-            for (; d < w && g < x; ) {
+            const w = m.length + 1, y = p.length + 1;
+            for (; d < w && g < y; ) {
               const _ = m.charCodeAt(d - 1), L = m.charCodeAt(g - 1);
               if (_ !== L)
                 break;
               d++, g++;
             }
-            (d < w || g < x) && this._pushTrimWhitespaceCharChange(s, i + 1, d, w, a + 1, g, x);
+            (d < w || g < y) && this._pushTrimWhitespaceCharChange(s, i + 1, d, w, a + 1, g, y);
           }
         }
         i++, a++;
       }
-      c && (s.push(gt.createFromDiffResult(this.shouldIgnoreTrimWhitespace, c, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)), i += c.originalLength, a += c.modifiedLength);
+      c && (s.push(pt.createFromDiffResult(this.shouldIgnoreTrimWhitespace, c, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)), i += c.originalLength, a += c.modifiedLength);
     }
     return {
       quitEarly: r,
@@ -7160,14 +7160,14 @@ class Ho {
     if (this._mergeTrimWhitespaceCharChange(e, n, r, s, i, a, l))
       return;
     let u;
-    this.shouldComputeCharChanges && (u = [new rt(n, r, n, s, i, a, i, l)]), e.push(new gt(n, n, i, i, u));
+    this.shouldComputeCharChanges && (u = [new st(n, r, n, s, i, a, i, l)]), e.push(new pt(n, n, i, i, u));
   }
   _mergeTrimWhitespaceCharChange(e, n, r, s, i, a, l) {
     const u = e.length;
     if (u === 0)
       return !1;
     const c = e[u - 1];
-    return c.originalEndLineNumber === 0 || c.modifiedEndLineNumber === 0 ? !1 : c.originalEndLineNumber === n && c.modifiedEndLineNumber === i ? (this.shouldComputeCharChanges && c.charChanges && c.charChanges.push(new rt(n, r, n, s, i, a, i, l)), !0) : c.originalEndLineNumber + 1 === n && c.modifiedEndLineNumber + 1 === i ? (c.originalEndLineNumber = n, c.modifiedEndLineNumber = i, this.shouldComputeCharChanges && c.charChanges && c.charChanges.push(new rt(n, r, n, s, i, a, i, l)), !0) : !1;
+    return c.originalEndLineNumber === 0 || c.modifiedEndLineNumber === 0 ? !1 : c.originalEndLineNumber === n && c.modifiedEndLineNumber === i ? (this.shouldComputeCharChanges && c.charChanges && c.charChanges.push(new st(n, r, n, s, i, a, i, l)), !0) : c.originalEndLineNumber + 1 === n && c.modifiedEndLineNumber + 1 === i ? (c.originalEndLineNumber = n, c.modifiedEndLineNumber = i, this.shouldComputeCharChanges && c.charChanges && c.charChanges.push(new st(n, r, n, s, i, a, i, l)), !0) : !1;
   }
 }
 function Bn(t, e) {
@@ -7175,7 +7175,7 @@ function Bn(t, e) {
   return n === -1 ? e : n + 1;
 }
 function Vn(t, e) {
-  const n = xa(t);
+  const n = ya(t);
   return n === -1 ? e : n + 2;
 }
 function ks(t) {
@@ -7184,12 +7184,12 @@ function ks(t) {
   const e = Date.now();
   return () => Date.now() - e < t;
 }
-class Ae {
+class Me {
   static trivial(e, n) {
-    return new Ae([new Y(P.ofLength(e.length), P.ofLength(n.length))], !1);
+    return new Me([new Y(P.ofLength(e.length), P.ofLength(n.length))], !1);
   }
   static trivialTimedOut(e, n) {
-    return new Ae([new Y(P.ofLength(e.length), P.ofLength(n.length))], !0);
+    return new Me([new Y(P.ofLength(e.length), P.ofLength(n.length))], !0);
   }
   constructor(e, n) {
     this.diffs = e, this.hitTimeout = n;
@@ -7298,7 +7298,7 @@ class un {
 function qn(t) {
   return t === 32 || t === 9;
 }
-class _t {
+class Nt {
   static {
     this.chrKeys = /* @__PURE__ */ new Map();
   }
@@ -7313,11 +7313,11 @@ class _t {
       const a = n[i];
       for (let u = 0; u < a.length; u++) {
         s++;
-        const c = a[u], h = _t.getKey(c);
+        const c = a[u], h = Nt.getKey(c);
         this.histogram[h] = (this.histogram[h] || 0) + 1;
       }
       s++;
-      const l = _t.getKey(`
+      const l = Nt.getKey(`
 `);
       this.histogram[l] = (this.histogram[l] || 0) + 1;
     }
@@ -7334,20 +7334,20 @@ class _t {
 class Go {
   compute(e, n, r = Rt.instance, s) {
     if (e.length === 0 || n.length === 0)
-      return Ae.trivial(e, n);
+      return Me.trivial(e, n);
     const i = new un(e.length, n.length), a = new un(e.length, n.length), l = new un(e.length, n.length);
     for (let d = 0; d < e.length; d++)
       for (let g = 0; g < n.length; g++) {
         if (!r.isValid())
-          return Ae.trivialTimedOut(e, n);
-        const w = d === 0 ? 0 : i.get(d - 1, g), x = g === 0 ? 0 : i.get(d, g - 1);
+          return Me.trivialTimedOut(e, n);
+        const w = d === 0 ? 0 : i.get(d - 1, g), y = g === 0 ? 0 : i.get(d, g - 1);
         let _;
         e.getElement(d) === n.getElement(g) ? (d === 0 || g === 0 ? _ = 0 : _ = i.get(d - 1, g - 1), d > 0 && g > 0 && a.get(d - 1, g - 1) === 3 && (_ += l.get(d - 1, g - 1)), _ += s ? s(d, g) : 1) : _ = -1;
-        const L = Math.max(w, x, _);
+        const L = Math.max(w, y, _);
         if (L === _) {
           const A = d > 0 && g > 0 ? l.get(d - 1, g - 1) : 0;
           l.set(d, g, A + 1), a.set(d, g, 3);
-        } else L === w ? (l.set(d, g, 0), a.set(d, g, 1)) : L === x && (l.set(d, g, 0), a.set(d, g, 2));
+        } else L === w ? (l.set(d, g, 0), a.set(d, g, 1)) : L === y && (l.set(d, g, 0), a.set(d, g, 2));
         i.set(d, g, L);
       }
     const u = [];
@@ -7358,13 +7358,13 @@ class Go {
     let m = e.length - 1, p = n.length - 1;
     for (; m >= 0 && p >= 0; )
       a.get(m, p) === 3 ? (f(m, p), m--, p--) : a.get(m, p) === 1 ? m-- : p--;
-    return f(-1, -1), u.reverse(), new Ae(u, !1);
+    return f(-1, -1), u.reverse(), new Me(u, !1);
   }
 }
 class Li {
   compute(e, n, r = Rt.instance) {
     if (e.length === 0 || n.length === 0)
-      return Ae.trivial(e, n);
+      return Me.trivial(e, n);
     const s = e, i = n;
     function a(g, w) {
       for (; g < s.length && w < i.length && s.getElement(g) === i.getElement(w); )
@@ -7379,15 +7379,15 @@ class Li {
     let h = 0;
     e: for (; ; ) {
       if (l++, !r.isValid())
-        return Ae.trivialTimedOut(s, i);
+        return Me.trivialTimedOut(s, i);
       const g = -Math.min(l, i.length + l % 2), w = Math.min(l, s.length + l % 2);
       for (h = g; h <= w; h += 2) {
-        const x = h === w ? -1 : u.get(h + 1), _ = h === g ? -1 : u.get(h - 1) + 1, L = Math.min(Math.max(x, _), s.length), A = L - h;
+        const y = h === w ? -1 : u.get(h + 1), _ = h === g ? -1 : u.get(h - 1) + 1, L = Math.min(Math.max(y, _), s.length), A = L - h;
         if (L > s.length || A > i.length)
           continue;
         const I = a(L, A);
         u.set(h, I);
-        const O = L === x ? c.get(h + 1) : c.get(h - 1);
+        const O = L === y ? c.get(h + 1) : c.get(h - 1);
         if (c.set(h, I !== L ? new Es(O, L, A, I - L) : O), u.get(h) === s.length && u.get(h) - h === i.length)
           break e;
       }
@@ -7401,7 +7401,7 @@ class Li {
         break;
       p = f.x, d = f.y, f = f.prev;
     }
-    return m.reverse(), new Ae(m, !1);
+    return m.reverse(), new Me(m, !1);
   }
 }
 class Es {
@@ -7486,7 +7486,7 @@ class jt {
     return n !== r && (s += 10, n === 0 && r === 1 && (s += 1)), s += Ms(n), s += Ms(r), s;
   }
   translateOffset(e, n = "right") {
-    const r = ot(this.firstElementOffsetByLineIdx, (i) => i <= e), s = e - this.firstElementOffsetByLineIdx[r];
+    const r = lt(this.firstElementOffsetByLineIdx, (i) => i <= e), s = e - this.firstElementOffsetByLineIdx[r];
     return new q(this.range.startLineNumber + r, 1 + this.lineStartOffsets[r] + s + (s === 0 && n === "left" ? 0 : this.trimmedWsLengthsByLineIdx[r]));
   }
   translateRange(e) {
@@ -7497,25 +7497,25 @@ class jt {
    * Finds the word that contains the character at the given offset
    */
   findWordContaining(e) {
-    if (e < 0 || e >= this.elements.length || !Ye(this.elements[e]))
+    if (e < 0 || e >= this.elements.length || !Ze(this.elements[e]))
       return;
     let n = e;
-    for (; n > 0 && Ye(this.elements[n - 1]); )
+    for (; n > 0 && Ze(this.elements[n - 1]); )
       n--;
     let r = e;
-    for (; r < this.elements.length && Ye(this.elements[r]); )
+    for (; r < this.elements.length && Ze(this.elements[r]); )
       r++;
     return new P(n, r);
   }
   /** fooBar has the two sub-words foo and bar */
   findSubWordContaining(e) {
-    if (e < 0 || e >= this.elements.length || !Ye(this.elements[e]))
+    if (e < 0 || e >= this.elements.length || !Ze(this.elements[e]))
       return;
     let n = e;
-    for (; n > 0 && Ye(this.elements[n - 1]) && !As(this.elements[n]); )
+    for (; n > 0 && Ze(this.elements[n - 1]) && !As(this.elements[n]); )
       n--;
     let r = e;
-    for (; r < this.elements.length && Ye(this.elements[r]) && !As(this.elements[r]); )
+    for (; r < this.elements.length && Ze(this.elements[r]) && !As(this.elements[r]); )
       r++;
     return new P(n, r);
   }
@@ -7526,11 +7526,11 @@ class jt {
     return this.elements[e] === this.elements[n];
   }
   extendToFullLines(e) {
-    const n = at(this.firstElementOffsetByLineIdx, (s) => s <= e.start) ?? 0, r = Do(this.firstElementOffsetByLineIdx, (s) => e.endExclusive <= s) ?? this.elements.length;
+    const n = ot(this.firstElementOffsetByLineIdx, (s) => s <= e.start) ?? 0, r = Do(this.firstElementOffsetByLineIdx, (s) => e.endExclusive <= s) ?? this.elements.length;
     return new P(n, r);
   }
 }
-function Ye(t) {
+function Ze(t) {
   return t >= 97 && t <= 122 || t >= 65 && t <= 90 || t >= 48 && t <= 57;
 }
 function As(t) {
@@ -7571,76 +7571,76 @@ function Zo(t, e) {
   return n;
 }
 function Ko(t, e, n, r) {
-  const s = [], i = t.filter((u) => u.modified.isEmpty && u.original.length >= 3).map((u) => new _t(u.original, e, u)), a = new Set(t.filter((u) => u.original.isEmpty && u.modified.length >= 3).map((u) => new _t(u.modified, n, u))), l = /* @__PURE__ */ new Set();
+  const s = [], i = t.filter((u) => u.modified.isEmpty && u.original.length >= 3).map((u) => new Nt(u.original, e, u)), a = new Set(t.filter((u) => u.original.isEmpty && u.modified.length >= 3).map((u) => new Nt(u.modified, n, u))), l = /* @__PURE__ */ new Set();
   for (const u of i) {
     let c = -1, h;
     for (const f of a) {
       const m = u.computeSimilarity(f);
       m > c && (c = m, h = f);
     }
-    if (c > 0.9 && h && (a.delete(h), s.push(new de(u.range, h.range)), l.add(u.source), l.add(h.source)), !r.isValid())
+    if (c > 0.9 && h && (a.delete(h), s.push(new pe(u.range, h.range)), l.add(u.source), l.add(h.source)), !r.isValid())
       return { moves: s, excludedChanges: l };
   }
   return { moves: s, excludedChanges: l };
 }
 function el(t, e, n, r, s, i) {
-  const a = [], l = new xo();
+  const a = [], l = new yo();
   for (const m of t)
     for (let p = m.original.startLineNumber; p < m.original.endLineNumberExclusive - 2; p++) {
       const d = `${e[p - 1]}:${e[p + 1 - 1]}:${e[p + 2 - 1]}`;
       l.add(d, { range: new V(p, p + 3) });
     }
   const u = [];
-  t.sort(nt((m) => m.modified.startLineNumber, mt));
+  t.sort(rt((m) => m.modified.startLineNumber, dt));
   for (const m of t) {
     let p = [];
     for (let d = m.modified.startLineNumber; d < m.modified.endLineNumberExclusive - 2; d++) {
-      const g = `${n[d - 1]}:${n[d + 1 - 1]}:${n[d + 2 - 1]}`, w = new V(d, d + 3), x = [];
+      const g = `${n[d - 1]}:${n[d + 1 - 1]}:${n[d + 2 - 1]}`, w = new V(d, d + 3), y = [];
       l.forEach(g, ({ range: _ }) => {
         for (const A of p)
           if (A.originalLineRange.endLineNumberExclusive + 1 === _.endLineNumberExclusive && A.modifiedLineRange.endLineNumberExclusive + 1 === w.endLineNumberExclusive) {
-            A.originalLineRange = new V(A.originalLineRange.startLineNumber, _.endLineNumberExclusive), A.modifiedLineRange = new V(A.modifiedLineRange.startLineNumber, w.endLineNumberExclusive), x.push(A);
+            A.originalLineRange = new V(A.originalLineRange.startLineNumber, _.endLineNumberExclusive), A.modifiedLineRange = new V(A.modifiedLineRange.startLineNumber, w.endLineNumberExclusive), y.push(A);
             return;
           }
         const L = {
           modifiedLineRange: w,
           originalLineRange: _
         };
-        u.push(L), x.push(L);
-      }), p = x;
+        u.push(L), y.push(L);
+      }), p = y;
     }
     if (!i.isValid())
       return [];
   }
-  u.sort(Io(nt((m) => m.modifiedLineRange.length, mt)));
+  u.sort(Io(rt((m) => m.modifiedLineRange.length, dt)));
   const c = new _e(), h = new _e();
   for (const m of u) {
     const p = m.modifiedLineRange.startLineNumber - m.originalLineRange.startLineNumber, d = c.subtractFrom(m.modifiedLineRange), g = h.subtractFrom(m.originalLineRange).getWithDelta(p), w = d.getIntersection(g);
-    for (const x of w.ranges) {
-      if (x.length < 3)
+    for (const y of w.ranges) {
+      if (y.length < 3)
         continue;
-      const _ = x, L = x.delta(-p);
-      a.push(new de(L, _)), c.addRange(_), h.addRange(L);
+      const _ = y, L = y.delta(-p);
+      a.push(new pe(L, _)), c.addRange(_), h.addRange(L);
     }
   }
-  a.sort(nt((m) => m.original.startLineNumber, mt));
+  a.sort(rt((m) => m.original.startLineNumber, dt));
   const f = new en(t);
   for (let m = 0; m < a.length; m++) {
-    const p = a[m], d = f.findLastMonotonous((O) => O.original.startLineNumber <= p.original.startLineNumber), g = at(t, (O) => O.modified.startLineNumber <= p.modified.startLineNumber), w = Math.max(p.original.startLineNumber - d.original.startLineNumber, p.modified.startLineNumber - g.modified.startLineNumber), x = f.findLastMonotonous((O) => O.original.startLineNumber < p.original.endLineNumberExclusive), _ = at(t, (O) => O.modified.startLineNumber < p.modified.endLineNumberExclusive), L = Math.max(x.original.endLineNumberExclusive - p.original.endLineNumberExclusive, _.modified.endLineNumberExclusive - p.modified.endLineNumberExclusive);
+    const p = a[m], d = f.findLastMonotonous((O) => O.original.startLineNumber <= p.original.startLineNumber), g = ot(t, (O) => O.modified.startLineNumber <= p.modified.startLineNumber), w = Math.max(p.original.startLineNumber - d.original.startLineNumber, p.modified.startLineNumber - g.modified.startLineNumber), y = f.findLastMonotonous((O) => O.original.startLineNumber < p.original.endLineNumberExclusive), _ = ot(t, (O) => O.modified.startLineNumber < p.modified.endLineNumberExclusive), L = Math.max(y.original.endLineNumberExclusive - p.original.endLineNumberExclusive, _.modified.endLineNumberExclusive - p.modified.endLineNumberExclusive);
     let A;
     for (A = 0; A < w; A++) {
-      const O = p.original.startLineNumber - A - 1, y = p.modified.startLineNumber - A - 1;
-      if (O > r.length || y > s.length || c.contains(y) || h.contains(O) || !Ps(r[O - 1], s[y - 1], i))
+      const O = p.original.startLineNumber - A - 1, x = p.modified.startLineNumber - A - 1;
+      if (O > r.length || x > s.length || c.contains(x) || h.contains(O) || !Ps(r[O - 1], s[x - 1], i))
         break;
     }
     A > 0 && (h.addRange(new V(p.original.startLineNumber - A, p.original.startLineNumber)), c.addRange(new V(p.modified.startLineNumber - A, p.modified.startLineNumber)));
     let I;
     for (I = 0; I < L; I++) {
-      const O = p.original.endLineNumberExclusive + I, y = p.modified.endLineNumberExclusive + I;
-      if (O > r.length || y > s.length || c.contains(y) || h.contains(O) || !Ps(r[O - 1], s[y - 1], i))
+      const O = p.original.endLineNumberExclusive + I, x = p.modified.endLineNumberExclusive + I;
+      if (O > r.length || x > s.length || c.contains(x) || h.contains(O) || !Ps(r[O - 1], s[x - 1], i))
         break;
     }
-    I > 0 && (h.addRange(new V(p.original.endLineNumberExclusive, p.original.endLineNumberExclusive + I)), c.addRange(new V(p.modified.endLineNumberExclusive, p.modified.endLineNumberExclusive + I))), (A > 0 || I > 0) && (a[m] = new de(new V(p.original.startLineNumber - A, p.original.endLineNumberExclusive + I), new V(p.modified.startLineNumber - A, p.modified.endLineNumberExclusive + I)));
+    I > 0 && (h.addRange(new V(p.original.endLineNumberExclusive, p.original.endLineNumberExclusive + I)), c.addRange(new V(p.modified.endLineNumberExclusive, p.modified.endLineNumberExclusive + I))), (A > 0 || I > 0) && (a[m] = new pe(new V(p.original.startLineNumber - A, p.original.endLineNumberExclusive + I), new V(p.modified.startLineNumber - A, p.modified.endLineNumberExclusive + I)));
   }
   return a;
 }
@@ -7668,7 +7668,7 @@ function Ps(t, e, n) {
 function tl(t) {
   if (t.length === 0)
     return t;
-  t.sort(nt((n) => n.original.startLineNumber, mt));
+  t.sort(rt((n) => n.original.startLineNumber, dt));
   const e = [t[0]];
   for (let n = 1; n < t.length; n++) {
     const r = e[e.length - 1], s = t[n], i = s.original.startLineNumber - r.original.endLineNumberExclusive, a = s.modified.startLineNumber - r.modified.endLineNumberExclusive;
@@ -7683,7 +7683,7 @@ function tl(t) {
 function nl(t, e) {
   const n = new en(t);
   return e = e.filter((r) => {
-    const s = n.findLastMonotonous((l) => l.original.startLineNumber < r.original.endLineNumberExclusive) || new de(new V(1, 1), new V(1, 1)), i = at(t, (l) => l.modified.startLineNumber < r.modified.endLineNumberExclusive);
+    const s = n.findLastMonotonous((l) => l.original.startLineNumber < r.original.endLineNumberExclusive) || new pe(new V(1, 1), new V(1, 1)), i = ot(t, (l) => l.modified.startLineNumber < r.modified.endLineNumberExclusive);
     return s !== i;
   }), e;
 }
@@ -7780,18 +7780,18 @@ function $s(t, e, n, r, s = !1) {
       return;
     let d = new Y(m, p);
     const g = d.intersect(f);
-    let w = g.seq1Range.length, x = g.seq2Range.length;
+    let w = g.seq1Range.length, y = g.seq2Range.length;
     for (; i.length > 0; ) {
       const _ = i[0];
       if (!(_.seq1Range.intersects(d.seq1Range) || _.seq2Range.intersects(d.seq2Range)))
         break;
-      const A = r(t, _.seq1Range.start), I = r(e, _.seq2Range.start), O = new Y(A, I), y = O.intersect(_);
-      if (w += y.seq1Range.length, x += y.seq2Range.length, d = d.join(O), d.seq1Range.endExclusive >= _.seq1Range.endExclusive)
+      const A = r(t, _.seq1Range.start), I = r(e, _.seq2Range.start), O = new Y(A, I), x = O.intersect(_);
+      if (w += x.seq1Range.length, y += x.seq2Range.length, d = d.join(O), d.seq1Range.endExclusive >= _.seq1Range.endExclusive)
         i.shift();
       else
         break;
     }
-    (s && w + x < d.seq1Range.length + d.seq2Range.length || w + x < (d.seq1Range.length + d.seq2Range.length) * 2 / 3) && a.push(d), l = d.getEndExclusives();
+    (s && w + y < d.seq1Range.length + d.seq2Range.length || w + y < (d.seq1Range.length + d.seq2Range.length) * 2 / 3) && a.push(d), l = d.getEndExclusives();
   }
   for (; i.length > 0; ) {
     const h = i.shift();
@@ -7849,11 +7849,11 @@ function ol(t, e, n) {
         const _ = t.getText(w).trim();
         if (_.length > 20 || _.split(/\r\n|\r|\n/).length > 1)
           return !1;
-        const L = t.countLinesIn(d.seq1Range), A = d.seq1Range.length, I = e.countLinesIn(d.seq2Range), O = d.seq2Range.length, y = t.countLinesIn(g.seq1Range), v = g.seq1Range.length, S = e.countLinesIn(g.seq2Range), B = g.seq2Range.length, W = 130;
+        const L = t.countLinesIn(d.seq1Range), A = d.seq1Range.length, I = e.countLinesIn(d.seq2Range), O = d.seq2Range.length, x = t.countLinesIn(g.seq1Range), v = g.seq1Range.length, S = e.countLinesIn(g.seq2Range), B = g.seq2Range.length, W = 130;
         function D(R) {
           return Math.min(R, W);
         }
-        return Math.pow(Math.pow(D(L * 40 + A), 1.5) + Math.pow(D(I * 40 + O), 1.5), 1.5) + Math.pow(Math.pow(D(y * 40 + v), 1.5) + Math.pow(D(S * 40 + B), 1.5), 1.5) > (W ** 1.5) ** 1.5 * 1.3;
+        return Math.pow(Math.pow(D(L * 40 + A), 1.5) + Math.pow(D(I * 40 + O), 1.5), 1.5) + Math.pow(Math.pow(D(x * 40 + v), 1.5) + Math.pow(D(S * 40 + B), 1.5), 1.5) > (W ** 1.5) ** 1.5 * 1.3;
       };
       var l = m;
       const h = r[c], f = u[u.length - 1];
@@ -7871,8 +7871,8 @@ function ol(t, e, n) {
     m(d) && (f = f.deltaStart(-d.length));
     const g = t.getText(new P(c.seq1Range.endExclusive, p.endExclusive));
     m(g) && (f = f.deltaEnd(g.length));
-    const w = Y.fromOffsetPairs(u ? u.getEndExclusives() : Le.zero, h ? h.getStarts() : Le.max), x = f.intersect(w);
-    a.length > 0 && x.getStarts().equals(a[a.length - 1].getEndExclusives()) ? a[a.length - 1] = a[a.length - 1].join(x) : a.push(x);
+    const w = Y.fromOffsetPairs(u ? u.getEndExclusives() : Le.zero, h ? h.getStarts() : Le.max), y = f.intersect(w);
+    a.length > 0 && y.getStarts().equals(a[a.length - 1].getEndExclusives()) ? a[a.length - 1] = a[a.length - 1].join(y) : a.push(y);
   }), a;
 }
 class Bs {
@@ -7908,26 +7908,26 @@ class ll {
     this.dynamicProgrammingDiffing = new Go(), this.myersDiffingAlgorithm = new Li();
   }
   computeDiff(e, n, r) {
-    if (e.length <= 1 && Ao(e, n, (y, v) => y === v))
-      return new ft([], [], !1);
+    if (e.length <= 1 && Ao(e, n, (x, v) => x === v))
+      return new mt([], [], !1);
     if (e.length === 1 && e[0].length === 0 || n.length === 1 && n[0].length === 0)
-      return new ft([
-        new Ee(new V(1, e.length + 1), new V(1, n.length + 1), [
-          new me(new C(1, 1, e.length, e[e.length - 1].length + 1), new C(1, 1, n.length, n[n.length - 1].length + 1))
+      return new mt([
+        new Ae(new V(1, e.length + 1), new V(1, n.length + 1), [
+          new ge(new C(1, 1, e.length, e[e.length - 1].length + 1), new C(1, 1, n.length, n[n.length - 1].length + 1))
         ])
       ], [], !1);
     const s = r.maxComputationTimeMs === 0 ? Rt.instance : new jo(r.maxComputationTimeMs), i = !r.ignoreTrimWhitespace, a = /* @__PURE__ */ new Map();
-    function l(y) {
-      let v = a.get(y);
-      return v === void 0 && (v = a.size, a.set(y, v)), v;
+    function l(x) {
+      let v = a.get(x);
+      return v === void 0 && (v = a.size, a.set(x, v)), v;
     }
-    const u = e.map((y) => l(y.trim())), c = n.map((y) => l(y.trim())), h = new Bs(u, e), f = new Bs(c, n), m = h.length + f.length < 1700 ? this.dynamicProgrammingDiffing.compute(h, f, s, (y, v) => e[y] === n[v] ? n[v].length === 0 ? 0.1 : 1 + Math.log(1 + n[v].length) : 0.99) : this.myersDiffingAlgorithm.compute(h, f, s);
+    const u = e.map((x) => l(x.trim())), c = n.map((x) => l(x.trim())), h = new Bs(u, e), f = new Bs(c, n), m = h.length + f.length < 1700 ? this.dynamicProgrammingDiffing.compute(h, f, s, (x, v) => e[x] === n[v] ? n[v].length === 0 ? 0.1 : 1 + Math.log(1 + n[v].length) : 0.99) : this.myersDiffingAlgorithm.compute(h, f, s);
     let p = m.diffs, d = m.hitTimeout;
     p = Fs(h, f, p), p = al(h, f, p);
-    const g = [], w = (y) => {
+    const g = [], w = (x) => {
       if (i)
-        for (let v = 0; v < y; v++) {
-          const S = x + v, B = _ + v;
+        for (let v = 0; v < x; v++) {
+          const S = y + v, B = _ + v;
           if (e[S] !== n[B]) {
             const W = this.refineDiff(e, n, new Y(new P(S, S + 1), new P(B, B + 1)), s, i, r);
             for (const D of W.mappings)
@@ -7936,21 +7936,21 @@ class ll {
           }
         }
     };
-    let x = 0, _ = 0;
-    for (const y of p) {
-      xt(() => y.seq1Range.start - x === y.seq2Range.start - _);
-      const v = y.seq1Range.start - x;
-      w(v), x = y.seq1Range.endExclusive, _ = y.seq2Range.endExclusive;
-      const S = this.refineDiff(e, n, y, s, i, r);
+    let y = 0, _ = 0;
+    for (const x of p) {
+      xt(() => x.seq1Range.start - y === x.seq2Range.start - _);
+      const v = x.seq1Range.start - y;
+      w(v), y = x.seq1Range.endExclusive, _ = x.seq2Range.endExclusive;
+      const S = this.refineDiff(e, n, x, s, i, r);
       S.hitTimeout && (d = !0);
       for (const B of S.mappings)
         g.push(B);
     }
-    w(e.length - x);
+    w(e.length - y);
     const L = new At(e), A = new At(n), I = $n(g, L, A);
     let O = [];
     return r.computeMoves && (O = this.computeMoves(I, e, n, u, c, s, i, r)), xt(() => {
-      function y(S, B) {
+      function x(S, B) {
         if (S.lineNumber < 1 || S.lineNumber > B.length)
           return !1;
         const W = B[S.lineNumber - 1];
@@ -7963,13 +7963,13 @@ class ll {
         if (!S.innerChanges)
           return !1;
         for (const B of S.innerChanges)
-          if (!(y(B.modifiedRange.getStartPosition(), n) && y(B.modifiedRange.getEndPosition(), n) && y(B.originalRange.getStartPosition(), e) && y(B.originalRange.getEndPosition(), e)))
+          if (!(x(B.modifiedRange.getStartPosition(), n) && x(B.modifiedRange.getEndPosition(), n) && x(B.originalRange.getStartPosition(), e) && x(B.originalRange.getEndPosition(), e)))
             return !1;
         if (!v(S.modified, n) || !v(S.original, e))
           return !1;
       }
       return !0;
-    }), new ft(I, O, d);
+    }), new mt(I, O, d);
   }
   computeMoves(e, n, r, s, i, a, l, u) {
     return Yo(e, n, r, s, i, a).map((f) => {
@@ -7981,13 +7981,13 @@ class ll {
     const u = ul(r).toRangeMapping2(e, n), c = new jt(e, u.originalRange, i), h = new jt(n, u.modifiedRange, i), f = c.length + h.length < 500 ? this.dynamicProgrammingDiffing.compute(c, h, s) : this.myersDiffingAlgorithm.compute(c, h, s);
     let m = f.diffs;
     return m = Fs(c, h, m), m = $s(c, h, m, (d, g) => d.findWordContaining(g)), a.extendToSubwords && (m = $s(c, h, m, (d, g) => d.findSubWordContaining(g), !0)), m = sl(c, h, m), m = ol(c, h, m), {
-      mappings: m.map((d) => new me(c.translateRange(d.seq1Range), h.translateRange(d.seq2Range))),
+      mappings: m.map((d) => new ge(c.translateRange(d.seq1Range), h.translateRange(d.seq2Range))),
       hitTimeout: f.hitTimeout
     };
   }
 }
 function ul(t) {
-  return new de(new V(t.seq1Range.start + 1, t.seq1Range.endExclusive + 1), new V(t.seq2Range.start + 1, t.seq2Range.endExclusive + 1));
+  return new pe(new V(t.seq1Range.start + 1, t.seq1Range.endExclusive + 1), new V(t.seq2Range.start + 1, t.seq2Range.endExclusive + 1));
 }
 var $e;
 (function(t) {
@@ -8002,7 +8002,7 @@ class hl {
     this._preferredWebSchema = e;
   }
   get _remoteResourcesPath() {
-    return ie.join(this._serverRootPath, $e.vscodeRemoteResource);
+    return ae.join(this._serverRootPath, $e.vscodeRemoteResource);
   }
   rewrite(e) {
     if (this._delegate)
@@ -8016,7 +8016,7 @@ class hl {
     r && r.indexOf(":") !== -1 && r.indexOf("[") === -1 && (r = `[${r}]`);
     const s = this._ports[n], i = this._connectionTokens[n];
     let a = `path=${encodeURIComponent(e.path)}`;
-    return typeof i == "string" && (a += `&${cl}=${encodeURIComponent(i)}`), ge.from({
+    return typeof i == "string" && (a += `&${cl}=${encodeURIComponent(i)}`), be.from({
       scheme: ta ? this._preferredWebSchema : $e.vscodeRemoteResource,
       authority: `${r}:${s}`,
       path: this._remoteResourcesPath,
@@ -8063,14 +8063,14 @@ class Gt {
     );
   }
   toUri(e) {
-    if (ge.isUri(e))
+    if (be.isUri(e))
       return e;
     if (globalThis._VSCODE_FILE_ROOT) {
       const n = globalThis._VSCODE_FILE_ROOT;
       if (/^\w[\w\d+.-]*:\/\//.test(n))
-        return ge.joinPath(ge.parse(n, !0), e);
+        return be.joinPath(be.parse(n, !0), e);
       const r = Ka(n, e);
-      return ge.file(r);
+      return be.file(r);
     }
     throw new Error("Cannot determine URI for module id!");
   }
@@ -8087,7 +8087,7 @@ var qs;
   const n = "vscode-coi";
   function r(i) {
     let a;
-    typeof i == "string" ? a = new URL(i).searchParams : i instanceof URL ? a = i.searchParams : ge.isUri(i) && (a = new URL(i.toString(!0)).searchParams);
+    typeof i == "string" ? a = new URL(i).searchParams : i instanceof URL ? a = i.searchParams : be.isUri(i) && (a = new URL(i.toString(!0)).searchParams);
     const l = a?.get(n);
     if (l)
       return e.get(l);
@@ -8259,7 +8259,7 @@ class wl {
     return new P(this.replaceRange.start, this.replaceRange.start + this.getNewLength());
   }
 }
-class xl extends bl {
+class yl extends bl {
   apply(e) {
     const n = [];
     let r = 0;
@@ -8276,7 +8276,7 @@ class xl extends bl {
     return new Oe(n);
   }
 }
-class yl extends wl {
+class xl extends wl {
   constructor(e, n) {
     super(e), this.newText = n;
   }
@@ -8312,7 +8312,7 @@ class yl extends wl {
     };
   }
 }
-class Oe extends xl {
+class Oe extends yl {
   static {
     this.empty = new Oe([]);
   }
@@ -8334,7 +8334,7 @@ class Oe extends xl {
     return new Oe(e);
   }
 }
-class Be extends yl {
+class Be extends xl {
   static insert(e, n) {
     return new Be(P.emptyAt(e), n);
   }
@@ -8355,8 +8355,8 @@ Bo({
   StringEdit: Oe,
   StringReplacement: Be,
   TextReplacement: ve,
-  TextEdit: Ht,
-  TextLength: ae
+  TextEdit: zt,
+  TextLength: oe
 });
 let cn, hn, fn;
 function Us() {
@@ -8378,8 +8378,8 @@ class Ll {
     this._computer = e;
   }
   computeDiff(e, n, r) {
-    const s = new zt(e.join(`
-`)), i = new zt(n.join(`
+    const s = new Ht(e.join(`
+`)), i = new Ht(n.join(`
 `)), a = this._computer.computeDiff(s.value, i.value, {
       // TODO: this currently throws
       ignoreTrimWhitespace: !0,
@@ -8391,16 +8391,16 @@ class Ll {
     }), l = s.getTransformer(), u = i.getTransformer(), c = [];
     let h = 0;
     for (const p of a.edits.replacements) {
-      const d = p.range.start + h, g = d + p.newText.length, w = l.getRange(new P(p.range.start, p.range.endExclusive)), x = u.getRange(new P(d, g));
-      c.push(new me(w, x)), h += p.newText.length - (p.range.endExclusive - p.range.start);
+      const d = p.range.start + h, g = d + p.newText.length, w = l.getRange(new P(p.range.start, p.range.endExclusive)), y = u.getRange(new P(d, g));
+      c.push(new ge(w, y)), h += p.newText.length - (p.range.endExclusive - p.range.start);
     }
     const f = $n(c, s, i), m = [];
     if (r.computeMoves)
       for (const p of a.moves) {
-        const d = l.getPosition(p.range.original.start), g = l.getPosition(p.range.original.endExclusive), w = u.getPosition(p.range.modified.start), x = u.getPosition(p.range.modified.endExclusive), _ = new V(d.lineNumber, g.lineNumber), L = new V(w.lineNumber, x.lineNumber);
-        m.push(new wi(new de(_, L), []));
+        const d = l.getPosition(p.range.original.start), g = l.getPosition(p.range.original.endExclusive), w = u.getPosition(p.range.modified.start), y = u.getPosition(p.range.modified.endExclusive), _ = new V(d.lineNumber, g.lineNumber), L = new V(w.lineNumber, y.lineNumber);
+        m.push(new wi(new pe(_, L), []));
       }
-    return new ft(f, m, a.hitTimeout);
+    return new mt(f, m, a.hitTimeout);
   }
 }
 const Tt = {
@@ -8475,7 +8475,7 @@ class we {
     return new b(Math.round(a * 255), Math.round(l * 255), Math.round(u * 255), i);
   }
 }
-class et {
+class tt {
   constructor(e, n, r, s) {
     this._hsvaBrand = void 0, this.h = Math.max(Math.min(360, e), 0) | 0, this.s = Ve(Math.max(Math.min(1, n), 0), 3), this.v = Ve(Math.max(Math.min(1, r), 0), 3), this.a = Ve(Math.max(Math.min(1, s), 0), 3);
   }
@@ -8486,7 +8486,7 @@ class et {
   static fromRGBA(e) {
     const n = e.r / 255, r = e.g / 255, s = e.b / 255, i = Math.max(n, r, s), a = Math.min(n, r, s), l = i - a, u = i === 0 ? 0 : l / i;
     let c;
-    return l === 0 ? c = 0 : i === n ? c = ((r - s) / l % 6 + 6) % 6 : i === r ? c = (s - n) / l + 2 : c = (n - r) / l + 4, new et(Math.round(c * 60), u, i, e.a);
+    return l === 0 ? c = 0 : i === n ? c = ((r - s) / l % 6 + 6) % 6 : i === r ? c = (s - n) / l + 2 : c = (n - r) / l + 4, new tt(Math.round(c * 60), u, i, e.a);
   }
   // from http://www.rapidtables.com/convert/color/hsv-to-rgb.htm
   static toRGBA(e) {
@@ -8506,7 +8506,7 @@ class J {
     return this._hsla ? this._hsla : we.fromRGBA(this.rgba);
   }
   get hsva() {
-    return this._hsva ? this._hsva : et.fromRGBA(this.rgba);
+    return this._hsva ? this._hsva : tt.fromRGBA(this.rgba);
   }
   constructor(e) {
     if (e)
@@ -8514,14 +8514,14 @@ class J {
         this.rgba = e;
       else if (e instanceof we)
         this._hsla = e, this.rgba = we.toRGBA(e);
-      else if (e instanceof et)
-        this._hsva = e, this.rgba = et.toRGBA(e);
+      else if (e instanceof tt)
+        this._hsva = e, this.rgba = tt.toRGBA(e);
       else
         throw new Error("Invalid color ctor argument");
     else throw new Error("Color needs a value");
   }
   equals(e) {
-    return !!e && b.equals(this.rgba, e.rgba) && we.equals(this.hsla, e.hsla) && et.equals(this.hsva, e.hsva);
+    return !!e && b.equals(this.rgba, e.rgba) && we.equals(this.hsla, e.hsla) && tt.equals(this.hsva, e.hsva);
   }
   /**
    * http://www.w3.org/TR/WCAG20/#relativeluminancedef
@@ -8674,15 +8674,15 @@ class J {
           const w = g.match(/rgba\((?<r>(?:\+|-)?\d+), *(?<g>(?:\+|-)?\d+), *(?<b>(?:\+|-)?\d+), *(?<a>(?:\+|-)?\d+(\.\d+)?)\)/);
           if (!w)
             throw new Error("Invalid color format " + g);
-          const x = parseInt(w.groups?.r ?? "0"), _ = parseInt(w.groups?.g ?? "0"), L = parseInt(w.groups?.b ?? "0"), A = parseFloat(w.groups?.a ?? "0");
-          return new t(new b(x, _, L, A));
+          const y = parseInt(w.groups?.r ?? "0"), _ = parseInt(w.groups?.g ?? "0"), L = parseInt(w.groups?.b ?? "0"), A = parseFloat(w.groups?.a ?? "0");
+          return new t(new b(y, _, L, A));
         }
         if (g.startsWith("rgb(")) {
           const w = g.match(/rgb\((?<r>(?:\+|-)?\d+), *(?<g>(?:\+|-)?\d+), *(?<b>(?:\+|-)?\d+)\)/);
           if (!w)
             throw new Error("Invalid color format " + g);
-          const x = parseInt(w.groups?.r ?? "0"), _ = parseInt(w.groups?.g ?? "0"), L = parseInt(w.groups?.b ?? "0");
-          return new t(new b(x, _, L));
+          const y = parseInt(w.groups?.r ?? "0"), _ = parseInt(w.groups?.g ?? "0"), L = parseInt(w.groups?.b ?? "0");
+          return new t(new b(y, _, L));
         }
         return m(g);
       }
@@ -8994,20 +8994,20 @@ class J {
         if (w === 0 || g.charCodeAt(0) !== 35)
           return null;
         if (w === 7) {
-          const x = 16 * d(g.charCodeAt(1)) + d(g.charCodeAt(2)), _ = 16 * d(g.charCodeAt(3)) + d(g.charCodeAt(4)), L = 16 * d(g.charCodeAt(5)) + d(g.charCodeAt(6));
-          return new t(new b(x, _, L, 1));
+          const y = 16 * d(g.charCodeAt(1)) + d(g.charCodeAt(2)), _ = 16 * d(g.charCodeAt(3)) + d(g.charCodeAt(4)), L = 16 * d(g.charCodeAt(5)) + d(g.charCodeAt(6));
+          return new t(new b(y, _, L, 1));
         }
         if (w === 9) {
-          const x = 16 * d(g.charCodeAt(1)) + d(g.charCodeAt(2)), _ = 16 * d(g.charCodeAt(3)) + d(g.charCodeAt(4)), L = 16 * d(g.charCodeAt(5)) + d(g.charCodeAt(6)), A = 16 * d(g.charCodeAt(7)) + d(g.charCodeAt(8));
-          return new t(new b(x, _, L, A / 255));
+          const y = 16 * d(g.charCodeAt(1)) + d(g.charCodeAt(2)), _ = 16 * d(g.charCodeAt(3)) + d(g.charCodeAt(4)), L = 16 * d(g.charCodeAt(5)) + d(g.charCodeAt(6)), A = 16 * d(g.charCodeAt(7)) + d(g.charCodeAt(8));
+          return new t(new b(y, _, L, A / 255));
         }
         if (w === 4) {
-          const x = d(g.charCodeAt(1)), _ = d(g.charCodeAt(2)), L = d(g.charCodeAt(3));
-          return new t(new b(16 * x + x, 16 * _ + _, 16 * L + L));
+          const y = d(g.charCodeAt(1)), _ = d(g.charCodeAt(2)), L = d(g.charCodeAt(3));
+          return new t(new b(16 * y + y, 16 * _ + _, 16 * L + L));
         }
         if (w === 5) {
-          const x = d(g.charCodeAt(1)), _ = d(g.charCodeAt(2)), L = d(g.charCodeAt(3)), A = d(g.charCodeAt(4));
-          return new t(new b(16 * x + x, 16 * _ + _, 16 * L + L, (16 * A + A) / 255));
+          const y = d(g.charCodeAt(1)), _ = d(g.charCodeAt(2)), L = d(g.charCodeAt(3)), A = d(g.charCodeAt(4));
+          return new t(new b(16 * y + y, 16 * _ + _, 16 * L + L, (16 * A + A) / 255));
         }
         return null;
       }
@@ -9080,7 +9080,7 @@ function Zn(t, e, n, r) {
     alpha: r
   };
 }
-function ct(t, e) {
+function ht(t, e) {
   const n = e.index, r = e[0].length;
   if (n === void 0)
     return;
@@ -9111,7 +9111,7 @@ function Ws(t, e, n) {
     color: Zn(i[0], i[1], i[2], n ? i[3] : 1)
   };
 }
-function zs(t, e, n) {
+function Hs(t, e, n) {
   if (!t || e.length !== 1)
     return;
   const s = e[0].values(), i = _i(s), a = new J(new we(i[0], i[1] / 100, i[2] / 100, n ? i[3] : 1));
@@ -9120,11 +9120,11 @@ function zs(t, e, n) {
     color: Zn(a.rgba.r, a.rgba.g, a.rgba.b, a.rgba.a)
   };
 }
-function ht(t, e) {
+function ft(t, e) {
   return typeof t == "string" ? [...t.matchAll(e)] : t.findMatches(e);
 }
 function Nl(t) {
-  const e = [], r = ht(t, /\b(rgb|rgba|hsl|hsla)(\([0-9\s,.\%\/]*\))|^(#)([A-Fa-f0-9]{3})\b|^(#)([A-Fa-f0-9]{4})\b|^(#)([A-Fa-f0-9]{6})\b|^(#)([A-Fa-f0-9]{8})\b|(?<=['"\s])(#)([A-Fa-f0-9]{3})\b|(?<=['"\s])(#)([A-Fa-f0-9]{4})\b|(?<=['"\s])(#)([A-Fa-f0-9]{6})\b|(?<=['"\s])(#)([A-Fa-f0-9]{8})\b/gm);
+  const e = [], r = ft(t, /\b(rgb|rgba|hsl|hsla)(\([0-9\s,.\%\/]*\))|^(#)([A-Fa-f0-9]{3})\b|^(#)([A-Fa-f0-9]{4})\b|^(#)([A-Fa-f0-9]{6})\b|^(#)([A-Fa-f0-9]{8})\b|(?<=['"\s])(#)([A-Fa-f0-9]{3})\b|(?<=['"\s])(#)([A-Fa-f0-9]{4})\b|(?<=['"\s])(#)([A-Fa-f0-9]{6})\b|(?<=['"\s])(#)([A-Fa-f0-9]{8})\b/gm);
   if (r.length > 0)
     for (const s of r) {
       const i = s.filter((c) => c !== void 0), a = i[1], l = i[2];
@@ -9133,17 +9133,17 @@ function Nl(t) {
       let u;
       if (a === "rgb") {
         const c = /^\(\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*[\s,]\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*[\s,]\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*\)$/gm;
-        u = Ws(ct(t, s), ht(l, c), !1);
+        u = Ws(ht(t, s), ft(l, c), !1);
       } else if (a === "rgba") {
         const c = /^\(\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*[\s,]\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*[\s,]\s*(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]|[0-9])\s*(?:[\s,]|[\s]*\/)\s*(0[.][0-9]+|[.][0-9]+|[01][.]|[01])\s*\)$/gm;
-        u = Ws(ct(t, s), ht(l, c), !0);
+        u = Ws(ht(t, s), ft(l, c), !0);
       } else if (a === "hsl") {
         const c = /^\(\s*((?:360(?:\.0+)?|(?:36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])(?:\.\d+)?))\s*[\s,]\s*(100(?:\.0+)?|\d{1,2}[.]\d*|\d{1,2})%\s*[\s,]\s*(100(?:\.0+)?|\d{1,2}[.]\d*|\d{1,2})%\s*\)$/gm;
-        u = zs(ct(t, s), ht(l, c), !1);
+        u = Hs(ht(t, s), ft(l, c), !1);
       } else if (a === "hsla") {
         const c = /^\(\s*((?:360(?:\.0+)?|(?:36[0]|3[0-5][0-9]|[12][0-9][0-9]|[1-9]?[0-9])(?:\.\d+)?))\s*[\s,]\s*(100(?:\.0+)?|\d{1,2}[.]\d*|\d{1,2})%\s*[\s,]\s*(100(?:\.0+)?|\d{1,2}[.]\d*|\d{1,2})%\s*(?:[\s,]|[\s]*\/)\s*(0[.][0-9]+|[.][0-9]+|[01][.]0*|[01])\s*\)$/gm;
-        u = zs(ct(t, s), ht(l, c), !0);
-      } else a === "#" && (u = _l(ct(t, s), a + l));
+        u = Hs(ht(t, s), ft(l, c), !0);
+      } else a === "#" && (u = _l(ht(t, s), a + l));
       u && e.push(u);
     }
   return e;
@@ -9151,7 +9151,7 @@ function Nl(t) {
 function Sl(t) {
   return !t || typeof t.getValue != "function" || typeof t.positionAt != "function" ? [] : Nl(t);
 }
-const Cl = /^-+|-+$/g, Hs = 100, Rl = 5;
+const Cl = /^-+|-+$/g, zs = 100, Rl = 5;
 function kl(t, e) {
   let n = [];
   if (e.findRegionSectionHeaders && e.foldingRules?.markers) {
@@ -9186,11 +9186,11 @@ function Al(t, e) {
   const n = [], r = t.getLineCount();
   if (!e.markSectionHeaderRegex || e.markSectionHeaderRegex.trim() === "")
     return n;
-  const s = yo(e.markSectionHeaderRegex), i = new RegExp(e.markSectionHeaderRegex, `gdm${s ? "s" : ""}`);
+  const s = xo(e.markSectionHeaderRegex), i = new RegExp(e.markSectionHeaderRegex, `gdm${s ? "s" : ""}`);
   if (pa(i))
     return n;
-  for (let a = 1; a <= r; a += Hs - Rl) {
-    const l = Math.min(a + Hs - 1, r), u = [];
+  for (let a = 1; a <= r; a += zs - Rl) {
+    const l = Math.min(a + zs - 1, r), u = [];
     for (let f = a; f <= l; f++)
       u.push(t.getLineContent(f));
     const c = u.join(`
@@ -9199,16 +9199,16 @@ function Al(t, e) {
     let h;
     for (; (h = i.exec(c)) !== null; ) {
       const f = c.substring(0, h.index), m = (f.match(/\n/g) || []).length, p = a + m, d = h[0].split(`
-`), g = d.length, w = p + g - 1, x = f.lastIndexOf(`
-`) + 1, _ = h.index - x + 1, L = d[d.length - 1], A = g === 1 ? _ + h[0].length : L.length + 1, I = {
+`), g = d.length, w = p + g - 1, y = f.lastIndexOf(`
+`) + 1, _ = h.index - y + 1, L = d[d.length - 1], A = g === 1 ? _ + h[0].length : L.length + 1, I = {
         startLineNumber: p,
         startColumn: _,
         endLineNumber: w,
         endColumn: A
-      }, O = (h.groups ?? {}).label ?? "", y = ((h.groups ?? {}).separator ?? "") !== "", v = {
+      }, O = (h.groups ?? {}).label ?? "", x = ((h.groups ?? {}).separator ?? "") !== "", v = {
         range: I,
         text: O,
-        hasSeparatorLine: y,
+        hasSeparatorLine: x,
         shouldBeInComments: !0
       };
       (v.text || v.hasSeparatorLine) && (n.length === 0 || n[n.length - 1].range.endLineNumber < v.range.startLineNumber) && n.push(v), i.lastIndex = h.index + h[0].length;
@@ -9307,7 +9307,7 @@ class Tl {
     }
   }
 }
-class ue {
+class he {
   constructor(e, n) {
     this._onReturn = n, this._producerConsumer = new Tl(), this._iterator = {
       next: () => this._producerConsumer.consume(),
@@ -9331,22 +9331,22 @@ class ue {
     });
   }
   static fromArray(e) {
-    return new ue((n) => {
+    return new he((n) => {
       n.emitMany(e);
     });
   }
   static fromPromise(e) {
-    return new ue(async (n) => {
+    return new he(async (n) => {
       n.emitMany(await e);
     });
   }
   static fromPromisesResolveOrder(e) {
-    return new ue(async (n) => {
+    return new he(async (n) => {
       await Promise.all(e.map(async (r) => n.emitOne(await r)));
     });
   }
   static merge(e) {
-    return new ue(async (n) => {
+    return new he(async (n) => {
       await Promise.all(e.map(async (r) => {
         for await (const s of r)
           n.emitOne(s);
@@ -9354,10 +9354,10 @@ class ue {
     });
   }
   static {
-    this.EMPTY = ue.fromArray([]);
+    this.EMPTY = he.fromArray([]);
   }
   static map(e, n) {
-    return new ue(async (r) => {
+    return new he(async (r) => {
       for await (const s of e)
         r.emitOne(n(s));
     });
@@ -9374,26 +9374,26 @@ class ue {
         } finally {
           s.complete();
         }
-    }, a = new ue(async (u) => (n = u, i(), s.p)), l = new ue(async (u) => (r = u, i(), s.p));
+    }, a = new he(async (u) => (n = u, i(), s.p)), l = new he(async (u) => (r = u, i(), s.p));
     return [a, l];
   }
   map(e) {
-    return ue.map(this, e);
+    return he.map(this, e);
   }
   static coalesce(e) {
-    return ue.filter(e, (n) => !!n);
+    return he.filter(e, (n) => !!n);
   }
   coalesce() {
-    return ue.coalesce(this);
+    return he.coalesce(this);
   }
   static filter(e, n) {
-    return new ue(async (r) => {
+    return new he(async (r) => {
       for await (const s of e)
         n(s) && r.emitOne(s);
     });
   }
   filter(e) {
-    return ue.filter(this, e);
+    return he.filter(this, e);
   }
   _finishOk() {
     this._producerConsumer.hasFinalValue || this._producerConsumer.produceFinal({ ok: !0, value: { done: !0, value: void 0 } });
@@ -9410,15 +9410,15 @@ class Pl {
     this.values = e, this.prefixSum = new Uint32Array(e.length), this.prefixSumValidIndex = new Int32Array(1), this.prefixSumValidIndex[0] = -1;
   }
   insertValues(e, n) {
-    e = Qe(e);
+    e = Je(e);
     const r = this.values, s = this.prefixSum, i = n.length;
     return i === 0 ? !1 : (this.values = new Uint32Array(r.length + i), this.values.set(r.subarray(0, e), 0), this.values.set(r.subarray(e), e + i), this.values.set(n, e), e - 1 < this.prefixSumValidIndex[0] && (this.prefixSumValidIndex[0] = e - 1), this.prefixSum = new Uint32Array(this.values.length), this.prefixSumValidIndex[0] >= 0 && this.prefixSum.set(s.subarray(0, this.prefixSumValidIndex[0] + 1)), !0);
   }
   setValue(e, n) {
-    return e = Qe(e), n = Qe(n), this.values[e] === n ? !1 : (this.values[e] = n, e - 1 < this.prefixSumValidIndex[0] && (this.prefixSumValidIndex[0] = e - 1), !0);
+    return e = Je(e), n = Je(n), this.values[e] === n ? !1 : (this.values[e] = n, e - 1 < this.prefixSumValidIndex[0] && (this.prefixSumValidIndex[0] = e - 1), !0);
   }
   removeValues(e, n) {
-    e = Qe(e), n = Qe(n);
+    e = Je(e), n = Je(n);
     const r = this.values, s = this.prefixSum;
     if (e >= r.length)
       return !1;
@@ -9433,7 +9433,7 @@ class Pl {
    * @returns `SUM(0 <= j <= index, values[j])`.
    */
   getPrefixSum(e) {
-    return e < 0 ? 0 : (e = Qe(e), this._getPrefixSum(e));
+    return e < 0 ? 0 : (e = Je(e), this._getPrefixSum(e));
   }
   _getPrefixSum(e) {
     if (e <= this.prefixSumValidIndex[0])
@@ -9532,7 +9532,7 @@ class Dl {
     return Object.keys(this._models).forEach((n) => e.push(this._models[n])), e;
   }
   $acceptNewModel(e) {
-    this._models[e.url] = new $l(ge.parse(e.url), e.lines, e.EOL, e.versionId);
+    this._models[e.url] = new $l(be.parse(e.url), e.lines, e.EOL, e.versionId);
   }
   $acceptModelChanged(e, n) {
     if (!this._models[e])
@@ -9652,7 +9652,7 @@ class $l extends Il {
     return s ? { lineNumber: n, column: r } : e;
   }
 }
-class pt {
+class bt {
   constructor(e = null) {
     this._foreignModule = e, this._requestHandlerBrand = void 0, this._workerTextModelSyncServer = new Dl();
   }
@@ -9690,7 +9690,7 @@ class pt {
     if (!i || !a)
       return null;
     const l = await Bl(s);
-    return pt.computeDiff(i, a, r, l);
+    return bt.computeDiff(i, a, r, l);
   }
   static computeDiff(e, n, r, s) {
     const i = e.getLinesContent(), a = n.getLinesContent(), l = s.computeDiff(i, a, r), u = l.changes.length > 0 ? !1 : this._modelsAreIdentical(e, n);
@@ -9755,17 +9755,17 @@ class pt {
       const f = s.getValueInRange(u);
       if (c = c.replace(/\r\n|\n|\r/g, s.eol), f === c)
         continue;
-      if (Math.max(c.length, f.length) > pt._diffLimit) {
+      if (Math.max(c.length, f.length) > bt._diffLimit) {
         i.push({ range: u, text: c });
         continue;
       }
       const m = Fa(f, c, r), p = s.offsetAt(C.lift(u).getStartPosition());
       for (const d of m) {
-        const g = s.positionAt(p + d.originalStart), w = s.positionAt(p + d.originalStart + d.originalLength), x = {
+        const g = s.positionAt(p + d.originalStart), w = s.positionAt(p + d.originalStart + d.originalLength), y = {
           text: c.substr(d.modifiedStart, d.modifiedLength),
           range: { startLineNumber: g.lineNumber, startColumn: g.column, endLineNumber: w.lineNumber, endColumn: w.column }
         };
-        s.getValueInRange(x.range) !== x.text && i.push(x);
+        s.getValueInRange(y.range) !== y.text && i.push(y);
       }
     }
     return typeof a == "number" && i.push({ eol: a, text: "", range: { startLineNumber: 0, startColumn: 0, endLineNumber: 0, endColumn: 0 } }), i;
@@ -9789,7 +9789,7 @@ class pt {
       const c = this._getModel(u);
       if (c) {
         for (const h of c.words(a))
-          if (!(h === n || !isNaN(Number(h))) && (l.add(h), l.size > pt._suggestionsLimit))
+          if (!(h === n || !isNaN(Number(h))) && (l.add(h), l.size > bt._suggestionsLimit))
             break e;
       }
     }
@@ -9887,7 +9887,7 @@ function Si(t) {
       }),
       getMirrorModels: () => n.requestHandler.getModels()
     };
-    return e = t(a), new pt(e);
+    return e = t(a), new bt(e);
   });
   return e;
 }
@@ -9903,7 +9903,7 @@ function ql(t) {
 self.onmessage = () => {
   Vl() || Si(() => ({}));
 };
-class Nt {
+class St {
   constructor(e, n, r, s) {
     this._uri = e, this._languageId = n, this._version = r, this._content = s, this._lineOffsets = void 0;
   }
@@ -9925,7 +9925,7 @@ class Nt {
   }
   update(e, n) {
     for (const r of e)
-      if (Nt.isIncremental(r)) {
+      if (St.isIncremental(r)) {
         const s = ki(r.range), i = this.offsetAt(s.start), a = this.offsetAt(s.end);
         this._content = this._content.substring(0, i) + r.text + this._content.substring(a, this._content.length);
         const l = Math.max(s.start.line, 0), u = Math.max(s.end.line, 0);
@@ -9940,7 +9940,7 @@ class Nt {
         if (f !== 0)
           for (let m = l + 1 + h.length, p = c.length; m < p; m++)
             c[m] = c[m] + f;
-      } else if (Nt.isFull(r))
+      } else if (St.isFull(r))
         this._content = r.text, this._lineOffsets = void 0;
       else
         throw new Error("Unknown change event received");
@@ -9994,11 +9994,11 @@ class Nt {
 var Un;
 (function(t) {
   function e(s, i, a, l) {
-    return new Nt(s, i, a, l);
+    return new St(s, i, a, l);
   }
   t.create = e;
   function n(s, i, a) {
-    if (s instanceof Nt)
+    if (s instanceof St)
       return s.update(i, a), s;
     throw new Error("TextDocument.update: document must be created by TextDocument.create");
   }
@@ -10053,13 +10053,13 @@ function Ul(t) {
   const e = ki(t.range);
   return e !== t.range ? { newText: t.newText, range: e } : t;
 }
-class pe extends Error {
+class de extends Error {
   constructor(e, n, r, s = {}) {
     super(e), this.name = "SqlParseError", this.start = n, this.end = r, this.expected = s.expected, this.found = s.found;
   }
 }
 function Ei(t) {
-  return t instanceof pe;
+  return t instanceof de;
 }
 const Ai = /* @__PURE__ */ Symbol("sqlNodeSpan"), Ol = (t) => {
   const e = /* @__PURE__ */ new Set();
@@ -10071,15 +10071,15 @@ const Ai = /* @__PURE__ */ Symbol("sqlNodeSpan"), Ol = (t) => {
   for (const n of t.operators)
     e.add(n);
   return Array.from(e).sort((n, r) => r.length - n.length);
-}, zl = (t, e) => {
+}, Hl = (t, e) => {
   const n = [], r = [], s = Ol(e), i = Wl(e), a = e.specialChars.identifierQuote;
   let l = 0;
   const u = t.length, c = (d) => {
     const g = Math.max(t.lastIndexOf(`
 `, d - 1), t.lastIndexOf("\r", d - 1));
     return g === -1 ? 0 : g + 1;
-  }, h = (d, g, w, x) => {
-    n.push({ kind: d, value: g, start: w, end: x });
+  }, h = (d, g, w, y) => {
+    n.push({ kind: d, value: g, start: w, end: y });
   }, f = (d) => /[A-Za-z_]/u.test(d), m = (d) => /[A-Za-z0-9_\$]/u.test(d), p = (d) => /[0-9]/u.test(d);
   for (; l < u; ) {
     const d = t[l];
@@ -10097,7 +10097,7 @@ const Ai = /* @__PURE__ */ Symbol("sqlNodeSpan"), Ol = (t) => {
       continue;
     }
     if (d === "-" && t[l + 1] === "-") {
-      const w = l, x = c(w);
+      const w = l, y = c(w);
       for (l += 2; l < u && t[l] !== `
 `; )
         l += 1;
@@ -10106,12 +10106,12 @@ const Ai = /* @__PURE__ */ Symbol("sqlNodeSpan"), Ol = (t) => {
         text: t.slice(w, l),
         start: w,
         end: l,
-        codeBefore: t.slice(x, w)
+        codeBefore: t.slice(y, w)
       });
       continue;
     }
     if (d === "/" && t[l + 1] === "*") {
-      const w = l, x = c(w);
+      const w = l, y = c(w);
       for (l += 2; l < u && !(t[l] === "*" && t[l + 1] === "/"); )
         l += 1;
       l < u && (l += 2), r.push({
@@ -10119,85 +10119,85 @@ const Ai = /* @__PURE__ */ Symbol("sqlNodeSpan"), Ol = (t) => {
         text: t.slice(w, l),
         start: w,
         end: l,
-        codeBefore: t.slice(x, w)
+        codeBefore: t.slice(y, w)
       });
       continue;
     }
     if (d === "'") {
       const w = l;
       l += 1;
-      let x = "";
+      let y = "";
       for (; l < u; ) {
         if (t[l] === "'" && t[l + 1] === "'") {
-          x += "'", l += 2;
+          y += "'", l += 2;
           continue;
         }
         if (t[l] === "'") {
           l += 1;
           break;
         }
-        x += t[l], l += 1;
+        y += t[l], l += 1;
       }
-      h("string", x, w, l);
+      h("string", y, w, l);
       continue;
     }
     if (d === a.start) {
       const w = l;
       l += 1;
-      let x = "";
+      let y = "";
       for (; l < u; ) {
         if (t[l] === a.end) {
           if (t[l + 1] === a.end) {
-            x += a.end, l += 2;
+            y += a.end, l += 2;
             continue;
           }
           l += 1;
           break;
         }
-        x += t[l], l += 1;
+        y += t[l], l += 1;
       }
-      h("identifier", x, w, l);
+      h("identifier", y, w, l);
       continue;
     }
     if (p(d)) {
       const w = l;
-      let x = "";
+      let y = "";
       for (; l < u && p(t[l]); )
-        x += t[l], l += 1;
+        y += t[l], l += 1;
       if (t[l] === ".")
-        for (x += t[l], l += 1; l < u && p(t[l]); )
-          x += t[l], l += 1;
-      h("number", x, w, l);
+        for (y += t[l], l += 1; l < u && p(t[l]); )
+          y += t[l], l += 1;
+      h("number", y, w, l);
       continue;
     }
     if (f(d)) {
       const w = l;
-      let x = "";
+      let y = "";
       for (; l < u && m(t[l]); )
-        x += t[l], l += 1;
-      const _ = x.toUpperCase();
-      s.has(_) ? h("keyword", _, w, l) : h("identifier", x, w, l);
+        y += t[l], l += 1;
+      const _ = y.toUpperCase();
+      s.has(_) ? h("keyword", _, w, l) : h("identifier", y, w, l);
       continue;
     }
     if (d === ":" || d === "@") {
       const w = l;
       l += 1;
-      let x = d;
+      let y = d;
       if (l >= u)
-        throw new pe(`Unexpected character '${d}' at ${w}.`, w, Math.min(w + 1, u), {
+        throw new de(`Unexpected character '${d}' at ${w}.`, w, Math.min(w + 1, u), {
           found: { kind: "punctuation", value: d }
         });
       if (p(t[l]))
         for (; l < u && p(t[l]); )
-          x += t[l], l += 1;
+          y += t[l], l += 1;
       else if (f(t[l]))
         for (; l < u && m(t[l]); )
-          x += t[l], l += 1;
+          y += t[l], l += 1;
       else
-        throw new pe(`Unexpected character '${d}' at ${w}.`, w, Math.min(w + 1, u), {
+        throw new de(`Unexpected character '${d}' at ${w}.`, w, Math.min(w + 1, u), {
           found: { kind: "punctuation", value: d }
         });
-      h("identifier", x, w, l);
+      h("identifier", y, w, l);
       continue;
     }
     const g = i.find((w) => t.startsWith(w, l));
@@ -10211,14 +10211,14 @@ const Ai = /* @__PURE__ */ Symbol("sqlNodeSpan"), Ol = (t) => {
       l += 1, h("punctuation", d, w, l);
       continue;
     }
-    throw new pe(`Unexpected character '${d}' at ${l}.`, l, Math.min(l + 1, u), {
+    throw new de(`Unexpected character '${d}' at ${l}.`, l, Math.min(l + 1, u), {
       found: { kind: "punctuation", value: d }
     });
   }
   return n.push({ kind: "eof", value: "", start: l, end: l }), { tokens: n, trivia: r };
 }, Kn = (t, e) => {
-  const { tokens: n, trivia: r } = zl(t, e), i = new Kl(n).parseProgram(r);
-  return Hl(i, r), i;
+  const { tokens: n, trivia: r } = Hl(t, e), i = new Kl(n).parseProgram(r);
+  return zl(i, r), i;
 };
 function Qs(t, e, n) {
   return Object.defineProperty(t, Ai, {
@@ -10231,11 +10231,11 @@ function Qs(t, e, n) {
 function X(t) {
   return t[Ai] ?? null;
 }
-function Ze(t, e, n) {
+function Ke(t, e, n) {
   const r = t[e] ?? [];
   r.push(n), t[e] = r;
 }
-function Hl(t, e) {
+function zl(t, e) {
   if (e.length === 0 || t.body.length === 0)
     return;
   const n = Gl(t.body);
@@ -10245,27 +10245,27 @@ function Hl(t, e) {
   for (const i of [...e].sort((a, l) => a.start - l.start)) {
     const a = Ql(s, i.start), l = Jl(r, i.end), u = Xl(n, i), c = i.codeBefore.trim().length > 0;
     if (c && a) {
-      Ze(a.node, "trailingTrivia", i);
+      Ke(a.node, "trailingTrivia", i);
       continue;
     }
     if (!c && a && l) {
-      Ze(a.node, "trailingTrivia", i);
+      Ke(a.node, "trailingTrivia", i);
       continue;
     }
     if (!c && l) {
-      Ze(jl(n, l).node, "leadingTrivia", i);
+      Ke(jl(n, l).node, "leadingTrivia", i);
       continue;
     }
     if (!c && a) {
-      Ze(a.node, "trailingTrivia", i);
+      Ke(a.node, "trailingTrivia", i);
       continue;
     }
     const h = Yl(a, l, i);
     if (h) {
-      Ze(h.node, "trailingTrivia", i);
+      Ke(h.node, "trailingTrivia", i);
       continue;
     }
-    u && Ze(u.node, "danglingTrivia", i);
+    u && Ke(u.node, "danglingTrivia", i);
   }
 }
 function jl(t, e) {
@@ -10283,11 +10283,17 @@ function Gl(t) {
       case "binary":
         n(a.left), n(a.right);
         return;
+      case "case":
+        a.operand && n(a.operand);
+        for (const l of a.when)
+          i(l), n(l.when), n(l.then);
+        a.else && n(a.else);
+        return;
       case "cast":
         n(a.expression);
         return;
       case "functionCall":
-        a.args.forEach(n);
+        n(a.name), a.args.forEach(n);
         return;
       case "grouped":
         n(a.expression);
@@ -10418,7 +10424,7 @@ class Kl {
     if (this.matchWord("FETCH")) {
       if (!this.matchWord("FIRST") && !this.matchWord("NEXT")) {
         const p = this.peek(), d = this.getErrorRangeForToken(p);
-        throw new pe(`Expected keyword FIRST at ${p.start}.`, d.start, d.end, {
+        throw new de(`Expected keyword FIRST at ${p.start}.`, d.start, d.end, {
           expected: { kind: "keyword", value: "FIRST" },
           found: { kind: p.kind, value: p.value }
         });
@@ -10427,7 +10433,7 @@ class Kl {
         this.advance();
       else {
         const p = this.peek(), d = this.getErrorRangeForToken(p);
-        throw new pe(`Expected keyword ROWS at ${p.start}.`, d.start, d.end, {
+        throw new de(`Expected keyword ROWS at ${p.start}.`, d.start, d.end, {
           expected: { kind: "keyword", value: "ROWS" },
           found: { kind: p.kind, value: p.value }
         });
@@ -10505,7 +10511,7 @@ class Kl {
     if (this.matchPunctuation("(")) {
       if (this.tokens[this.index - 1], !this.peekKeyword("SELECT")) {
         const i = this.peek(), a = this.getErrorRangeForToken(i);
-        throw new pe(`Expected keyword SELECT at ${i.start}.`, a.start, a.end, {
+        throw new de(`Expected keyword SELECT at ${i.start}.`, a.start, a.end, {
           expected: { kind: "keyword", value: "SELECT" },
           found: { kind: i.kind, value: i.value }
         });
@@ -10654,70 +10660,95 @@ class Kl {
         e.end
       );
     if ((this.peekWord("DATE") || this.peekWord("TIMESTAMP")) && this.tokens[this.index + 1]?.kind === "string") {
-      const i = this.advance(), a = this.expect("string"), l = i.value.toUpperCase();
+      const s = this.advance(), i = this.expect("string"), a = s.value.toUpperCase();
       return this.markNode(
-        { type: "typedLiteral", dataType: l, value: a.value },
-        i.start,
-        a.end
+        { type: "typedLiteral", dataType: a, value: i.value },
+        s.start,
+        i.end
       );
     }
     if (e.kind === "identifier" && (e.value.startsWith(":") || e.value.startsWith("@")))
       return this.advance(), this.markNode({ type: "bindParameter", token: e.value }, e.start, e.end);
     if (this.matchOperator(["*"])) {
-      const i = this.tokens[this.index - 1];
-      return this.markNode({ type: "wildcard" }, i.start, i.end);
+      const s = this.tokens[this.index - 1];
+      return this.markNode({ type: "wildcard" }, s.start, s.end);
     }
+    if (this.matchKeyword("CASE"))
+      return this.parseCaseExpression(e.start);
     if (e.kind === "punctuation" && e.value === "(") {
-      const i = this.advance();
+      const s = this.advance();
       if (this.peekKeyword("SELECT")) {
-        const l = this.parseSelectStatement();
-        return this.expectPunctuation(")"), this.markNode({ type: "subquery", query: l }, i.start, this.lastConsumedEnd(i.start));
+        const a = this.parseSelectStatement();
+        return this.expectPunctuation(")"), this.markNode({ type: "subquery", query: a }, s.start, this.lastConsumedEnd(s.start));
       }
-      const a = this.parseExpression();
-      return this.expectPunctuation(")"), this.markNode({ type: "grouped", expression: a }, i.start, this.lastConsumedEnd(i.start));
+      const i = this.parseExpression();
+      return this.expectPunctuation(")"), this.markNode({ type: "grouped", expression: i }, s.start, this.lastConsumedEnd(s.start));
     }
-    const n = this.peek().start, r = this.parseIdentifier();
+    const n = this.peek().start, r = this.parseQualifiedIdentifierExpression();
+    if (r.type === "wildcard")
+      return r;
     if (this.matchPunctuation("(")) {
-      if (r.toUpperCase() === "CAST") {
-        const l = this.parseExpression();
+      if ((r.type === "identifier" ? r.name.toUpperCase() : void 0) === "CAST") {
+        const a = this.parseExpression();
         this.expectKeyword("AS");
-        const u = this.parseIdentifier();
-        let c;
+        const l = this.parseIdentifier();
+        let u;
         if (this.matchPunctuation("(")) {
-          c = [];
+          u = [];
           do {
-            const h = this.expect("number");
-            c.push(Number(h.value));
+            const c = this.expect("number");
+            u.push(Number(c.value));
           } while (this.matchPunctuation(","));
           this.expectPunctuation(")");
         }
         return this.expectPunctuation(")"), this.markNode(
-          { type: "cast", expression: l, dataType: u, dataTypeParams: c },
+          { type: "cast", expression: a, dataType: l, dataTypeParams: u },
           n,
           this.lastConsumedEnd(n)
         );
       }
-      const a = [];
+      const i = [];
       if (!this.matchPunctuation(")")) {
         do
           if (this.matchOperator(["*"])) {
-            const l = this.tokens[this.index - 1];
-            a.push(this.markNode({ type: "wildcard" }, l.start, l.end));
+            const a = this.tokens[this.index - 1];
+            i.push(this.markNode({ type: "wildcard" }, a.start, a.end));
           } else
-            a.push(this.parseExpression());
+            i.push(this.parseExpression());
         while (this.matchPunctuation(","));
         this.expectPunctuation(")");
       }
-      return this.markNode({ type: "functionCall", name: r, args: a }, n, this.lastConsumedEnd(n));
+      return this.markNode({ type: "functionCall", name: r, args: i }, n, this.lastConsumedEnd(n));
     }
-    const s = [r];
-    for (; this.matchPunctuation("."); )
-      s.push(this.parseIdentifier());
-    return s.length > 1 ? this.markNode(
-      { type: "qualifiedIdentifier", parts: s },
-      n,
-      this.lastConsumedEnd(n)
-    ) : this.markNode({ type: "identifier", name: r }, n, this.lastConsumedEnd(n));
+    return r;
+  }
+  parseQualifiedIdentifierExpression() {
+    const e = this.peek().start, n = [this.parseIdentifier()];
+    for (; this.matchPunctuation("."); ) {
+      if (this.matchOperator(["*"]))
+        return this.markNode({ type: "wildcard", qualifier: n }, e, this.lastConsumedEnd(e));
+      n.push(this.parseIdentifier());
+    }
+    const r = this.lastConsumedEnd(e);
+    return n.length === 1 ? this.markNode({ type: "identifier", name: n[0] }, e, r) : this.markNode({ type: "qualifiedIdentifier", parts: n }, e, r);
+  }
+  parseCaseExpression(e) {
+    const n = this.peekKeyword("WHEN") ? void 0 : this.parseExpression(), r = [];
+    for (; this.matchKeyword("WHEN"); ) {
+      const i = this.tokens[this.index - 1].start, a = this.parseExpression();
+      this.expectKeyword("THEN");
+      const l = this.parseExpression();
+      r.push(this.markNode({ when: a, then: l }, i, this.lastConsumedEnd(i)));
+    }
+    if (r.length === 0) {
+      const i = this.peek(), a = this.getErrorRangeForToken(i);
+      throw new de(`Expected keyword WHEN at ${i.start}.`, a.start, a.end, {
+        expected: { kind: "keyword", value: "WHEN" },
+        found: { kind: i.kind, value: i.value }
+      });
+    }
+    const s = this.matchKeyword("ELSE") ? this.parseExpression() : void 0;
+    return this.expectKeyword("END"), this.markNode({ type: "case", operand: n, when: r, else: s }, e, this.lastConsumedEnd(e));
   }
   parseInList() {
     const e = this.peek().start;
@@ -10736,7 +10767,7 @@ class Kl {
     if (e.kind === "identifier" || e.kind === "keyword")
       return this.advance(), e.value;
     const n = this.getErrorRangeForToken(e);
-    throw new pe(`Expected identifier at ${e.start}.`, n.start, n.end, {
+    throw new de(`Expected identifier at ${e.start}.`, n.start, n.end, {
       expected: { kind: "identifier" },
       found: { kind: e.kind, value: e.value }
     });
@@ -10803,7 +10834,7 @@ class Kl {
     const n = this.peek();
     if (n.kind !== e) {
       const r = this.getErrorRangeForToken(n);
-      throw new pe(`Expected ${e} at ${n.start}.`, r.start, r.end, {
+      throw new de(`Expected ${e} at ${n.start}.`, r.start, r.end, {
         expected: { kind: e },
         found: { kind: n.kind, value: n.value }
       });
@@ -10820,7 +10851,7 @@ class Kl {
   expectKeyword(e) {
     if (!this.matchKeyword(e)) {
       const n = this.peek(), r = this.getErrorRangeForToken(n);
-      throw new pe(`Expected keyword ${e} at ${n.start}.`, r.start, r.end, {
+      throw new de(`Expected keyword ${e} at ${n.start}.`, r.start, r.end, {
         expected: { kind: "keyword", value: e },
         found: { kind: n.kind, value: n.value }
       });
@@ -10829,7 +10860,7 @@ class Kl {
   expectWord(e) {
     if (!this.matchWord(e)) {
       const n = this.peek(), r = this.getErrorRangeForToken(n);
-      throw new pe(`Expected keyword ${e} at ${n.start}.`, r.start, r.end, {
+      throw new de(`Expected keyword ${e} at ${n.start}.`, r.start, r.end, {
         expected: { kind: "keyword", value: e },
         found: { kind: n.kind, value: n.value }
       });
@@ -10846,7 +10877,7 @@ class Kl {
   expectPunctuation(e) {
     if (!this.matchPunctuation(e)) {
       const n = this.peek(), r = this.getErrorRangeForToken(n);
-      throw new pe(`Expected '${e}' at ${n.start}.`, r.start, r.end, {
+      throw new de(`Expected '${e}' at ${n.start}.`, r.start, r.end, {
         expected: { kind: "punctuation", value: e },
         found: { kind: n.kind, value: n.value }
       });
@@ -10959,7 +10990,7 @@ const su = (t, e) => {
 }, Ti = {
   Error: 8
 };
-function st(t) {
+function it(t) {
   return t.trim().toLowerCase();
 }
 function Js(t) {
@@ -10989,7 +11020,7 @@ const hu = /^[A-Za-z_][A-Za-z0-9_$]*$/u, fu = {
 }, mu = {
   indent: "  ",
   keywordCase: "upper"
-}, he = `
+}, le = `
 `;
 function du(t, e, n = {}) {
   return gu(Kn(t, e), e, n);
@@ -11000,53 +11031,53 @@ function gu(t, e, n = {}) {
     keywordSet: new Set(e.keywords.map((i) => i.toUpperCase())),
     options: r
   };
-  return t.body.map((i) => tn(i, s)).join(`;${he}${he}`);
+  return t.body.map((i) => tn(i, s)).join(`;${le}${le}`);
 }
 function tn(t, e) {
   const n = [];
-  t.with && t.with.length > 0 && (n.push(H("WITH", e)), n.push(
+  t.with && t.with.length > 0 && (n.push(z("WITH", e)), n.push(
     ...Pt(
       t.with.map((s) => pu(s, e)),
       e
     )
   ));
-  const r = H("SELECT", e);
-  return n.push(t.distinct ? `${r} ${H("DISTINCT", e)}` : r), n.push(
+  const r = z("SELECT", e);
+  return n.push(t.distinct ? `${r} ${z("DISTINCT", e)}` : r), n.push(
     ...Pt(
       t.columns.map((s) => bu(s, e)),
       e
     )
-  ), t.from && t.from.length > 0 && (n.push(H("FROM", e)), n.push(...wu(t.from, e))), t.where && n.push(...Ys("WHERE", t.where, e)), t.groupBy && t.groupBy.length > 0 && (n.push(`${H("GROUP", e)} ${H("BY", e)}`), n.push(
+  ), t.from && t.from.length > 0 && (n.push(z("FROM", e)), n.push(...wu(t.from, e))), t.where && n.push(...Ys("WHERE", t.where, e)), t.groupBy && t.groupBy.length > 0 && (n.push(`${z("GROUP", e)} ${z("BY", e)}`), n.push(
     ...Pt(
-      t.groupBy.map((s) => be(s, e)),
+      t.groupBy.map((s) => re(s, e)),
       e
     )
-  )), t.having && n.push(...Ys("HAVING", t.having, e)), t.orderBy && t.orderBy.length > 0 && (n.push(`${H("ORDER", e)} ${H("BY", e)}`), n.push(
+  )), t.having && n.push(...Ys("HAVING", t.having, e)), t.orderBy && t.orderBy.length > 0 && (n.push(`${z("ORDER", e)} ${z("BY", e)}`), n.push(
     ...Pt(
       t.orderBy.map(
-        (s) => `${be(s.expression, e)} ${H(s.direction, e)}`
+        (s) => `${re(s.expression, e)} ${z(s.direction, e)}`
       ),
       e
     )
-  )), typeof t.offset == "number" && n.push(`${H("OFFSET", e)} ${String(t.offset)} ${H("ROWS", e)}`), typeof t.fetchFirst == "number" && n.push(
-    `${H("FETCH", e)} ${H("FIRST", e)} ${String(t.fetchFirst)} ${H("ROWS", e)} ${H("ONLY", e)}`
-  ), typeof t.limit == "number" && n.push(`${H("LIMIT", e)} ${String(t.limit)}`), lt(n.join(he), t, e);
+  )), typeof t.offset == "number" && n.push(`${z("OFFSET", e)} ${String(t.offset)} ${z("ROWS", e)}`), typeof t.fetchFirst == "number" && n.push(
+    `${z("FETCH", e)} ${z("FIRST", e)} ${String(t.fetchFirst)} ${z("ROWS", e)} ${z("ONLY", e)}`
+  ), typeof t.limit == "number" && n.push(`${z("LIMIT", e)} ${String(t.limit)}`), ut(n.join(le), t, e);
 }
 function pu(t, e) {
-  const n = t.columns?.length ? `(${t.columns.map((s) => Me(s, e)).join(", ")})` : "", r = Xt(tn(t.query, e), e, !0);
-  return lt(
-    `${Me(t.name, e)}${n} ${H("AS", e)} ${r}`,
+  const n = t.columns?.length ? `(${t.columns.map((s) => Ne(s, e)).join(", ")})` : "", r = Xt(tn(t.query, e), e, !0);
+  return ut(
+    `${Ne(t.name, e)}${n} ${z("AS", e)} ${r}`,
     t,
     e
   );
 }
 function bu(t, e) {
-  const n = be(t.expression, e), r = _u(n), s = n.slice(r.length);
-  return t.alias ? lt(
-    `${r} ${H("AS", e)} ${Me(t.alias, e)}${s}`,
+  const n = re(t.expression, e), r = _u(n), s = n.slice(r.length);
+  return t.alias ? ut(
+    `${r} ${z("AS", e)} ${Ne(t.alias, e)}${s}`,
     t,
     e
-  ) : lt(n, t, e);
+  ) : ut(n, t, e);
 }
 function wu(t, e) {
   const n = [];
@@ -11055,24 +11086,24 @@ function wu(t, e) {
       const i = n[n.length - 1];
       n[n.length - 1] = `${i},`;
     }
-    n.push(...xu(s, e));
+    n.push(...yu(s, e));
   }
   return n;
 }
-function xu(t, e) {
+function yu(t, e) {
   const n = [];
-  n.push(St(Pi(t, e), e.options.indent));
+  n.push(ze(Pi(t, e), e.options.indent));
   for (const r of t.joins ?? [])
-    n.push(St(yu(r, e), e.options.indent));
-  return lt(n.join(he), t, e, e.options.indent).split(he);
+    n.push(ze(xu(r, e), e.options.indent));
+  return ut(n.join(le), t, e, e.options.indent).split(le);
 }
-function yu(t, e) {
-  const n = H("JOIN", e), s = `${H(t.type, e)} ${n} `, i = Pi(t.table, e), a = `${s}${i}`;
+function xu(t, e) {
+  const n = z("JOIN", e), s = `${z(t.type, e)} ${n} `, i = Pi(t.table, e), a = `${s}${i}`;
   if (t.on)
-    return `${a} ${H("ON", e)} ${be(t.on, e)}`;
+    return `${a} ${z("ON", e)} ${re(t.on, e)}`;
   if (t.using && t.using.length > 0) {
-    const l = t.using.map((u) => Me(u, e)).join(", ");
-    return `${a} ${H("USING", e)} (${l})`;
+    const l = t.using.map((u) => Ne(u, e)).join(", ");
+    return `${a} ${z("USING", e)} (${l})`;
   }
   return a;
 }
@@ -11083,44 +11114,51 @@ function Pi(t, e) {
     return `${Nu(t.name, e)}${Xs(t.alias, e)}`;
   throw new Error("Invalid table reference: expected table name or subquery");
 }
-function be(t, e, n = 0) {
-  const r = vu(t, e), i = zn(t) < n ? `(${r})` : r;
-  return lt(i, t, e);
+function re(t, e, n = 0) {
+  const r = vu(t, e), i = Hn(t) < n ? `(${r})` : r;
+  return ut(i, t, e);
 }
 function vu(t, e) {
   switch (t.type) {
     case "identifier":
-      return Me(t.name, e);
+      return Ne(t.name, e);
     case "qualifiedIdentifier":
-      return t.parts.map((n) => Me(n, e)).join(".");
+      return t.parts.map((n) => Ne(n, e)).join(".");
     case "literal":
       return mn(t.value, e);
     case "typedLiteral":
-      return `${H(t.dataType, e)} ${mn(t.value, e)}`;
+      return `${z(t.dataType, e)} ${mn(t.value, e)}`;
     case "bindParameter":
       return t.token;
     case "wildcard":
-      return "*";
+      return t.qualifier ? `${t.qualifier.map((n) => Ne(n, e)).join(".")}.*` : "*";
+    case "case": {
+      const n = z("CASE", e), r = z("WHEN", e), s = z("THEN", e), i = z("ELSE", e), a = z("END", e), l = t.operand ? `${n} ${re(t.operand, e)}` : n, u = t.when.map((h) => {
+        const f = re(h.when, e), m = re(h.then, e);
+        return ze(`${r} ${f} ${s} ${m}`, e.options.indent);
+      }), c = t.else ? [ze(`${i} ${re(t.else, e)}`, e.options.indent)] : [];
+      return [l, ...u, ...c, a].join(le);
+    }
     case "grouped":
-      return Xt(be(t.expression, e), e);
+      return Xt(re(t.expression, e), e);
     case "subquery":
       return Xt(tn(t.query, e), e, !0);
     case "functionCall": {
-      const n = t.args.map((r) => be(r, e)).join(", ");
-      return `${t.name}(${n})`;
+      const n = re(t.name, e), r = t.args.map((s) => re(s, e)).join(", ");
+      return `${n}(${r})`;
     }
     case "cast": {
       const n = t.dataTypeParams ? `(${t.dataTypeParams.map((r) => String(r)).join(", ")})` : "";
-      return `${H("CAST", e)}(${be(t.expression, e)} ${H("AS", e)} ${Me(t.dataType, e)}${n})`;
+      return `${z("CAST", e)}(${re(t.expression, e)} ${z("AS", e)} ${Ne(t.dataType, e)}${n})`;
     }
     case "inList":
-      return `(${t.values.map((r) => be(r, e)).join(", ")})`;
+      return `(${t.values.map((r) => re(r, e)).join(", ")})`;
     case "unary": {
-      const n = be(t.operand, e, zn(t)), r = dn(t.operator) ? H(t.operator, e) : t.operator;
+      const n = re(t.operand, e, Hn(t)), r = dn(t.operator) ? z(t.operator, e) : t.operator;
       return dn(t.operator) ? `${r} ${n}` : `${r}${n}`;
     }
     case "binary": {
-      const n = zn(t), r = be(t.left, e, n), s = be(t.right, e, n + 1), i = dn(t.operator) ? t.operator.split(" ").map((l) => H(l, e)).join(" ") : t.operator, a = t.operator === "LIKE" && t.escape ? ` ${H("ESCAPE", e)} ${mn(t.escape, e)}` : "";
+      const n = Hn(t), r = re(t.left, e, n), s = re(t.right, e, n + 1), i = dn(t.operator) ? t.operator.split(" ").map((l) => z(l, e)).join(" ") : t.operator, a = t.operator === "LIKE" && t.escape ? ` ${z("ESCAPE", e)} ${mn(t.escape, e)}` : "";
       return `${r} ${i} ${s}${a}`;
     }
     default:
@@ -11128,28 +11166,28 @@ function vu(t, e) {
   }
 }
 function mn(t, e) {
-  return t === null ? H("NULL", e) : typeof t == "boolean" ? H(t ? "TRUE" : "FALSE", e) : typeof t == "number" ? String(t) : `'${t.replaceAll("'", "''")}'`;
+  return t === null ? z("NULL", e) : typeof t == "boolean" ? z(t ? "TRUE" : "FALSE", e) : typeof t == "number" ? String(t) : `'${t.replaceAll("'", "''")}'`;
 }
 function Xs(t, e) {
-  return t ? ` ${H("AS", e)} ${Me(t, e)}` : "";
+  return t ? ` ${z("AS", e)} ${Ne(t, e)}` : "";
 }
 function Pt(t, e) {
   return t.map((n, r) => {
     const s = r < t.length - 1 ? "," : "";
-    return `${St(n, e.options.indent)}${s}`;
+    return `${ze(n, e.options.indent)}${s}`;
   });
 }
 function Ys(t, e, n) {
-  const r = H(t, n), s = be(e, n);
-  return [r, St(s, n.options.indent)];
+  const r = z(t, n), s = re(e, n);
+  return [r, ze(s, n.options.indent)];
 }
-function St(t, e) {
-  return t.split(he).map((n) => `${e}${n}`).join(he);
+function ze(t, e) {
+  return t.split(le).map((n) => `${e}${n}`).join(le);
 }
 function Xt(t, e, n = !1) {
-  return !n && !t.includes(he) ? `(${t})` : ["(", St(t, e.options.indent), ")"].join(he);
+  return !n && !t.includes(le) ? `(${t})` : ["(", ze(t, e.options.indent), ")"].join(le);
 }
-function lt(t, e, n, r = "") {
+function ut(t, e, n, r = "") {
   if (!e)
     return t;
   const s = Wn(e.leadingTrivia, n, r), i = Wn(e.danglingTrivia, n, r), { contentWithInlineTrailing: a, trailingBlocks: l } = Lu(
@@ -11158,7 +11196,7 @@ function lt(t, e, n, r = "") {
     n,
     r
   );
-  return [...s, a, ...l, ...i].join(he);
+  return [...s, a, ...l, ...i].join(le);
 }
 function Lu(t, e, n, r) {
   if (!e || e.length === 0)
@@ -11166,7 +11204,7 @@ function Lu(t, e, n, r) {
   let s = t;
   const i = [];
   for (const a of e) {
-    if (a.codeBefore.trim().length > 0 && (a.kind === "lineComment" || !a.text.includes(he))) {
+    if (a.codeBefore.trim().length > 0 && (a.kind === "lineComment" || !a.text.includes(le))) {
       s += ` ${a.text}`;
       continue;
     }
@@ -11175,10 +11213,10 @@ function Lu(t, e, n, r) {
   return { contentWithInlineTrailing: s, trailingBlocks: i };
 }
 function Wn(t, e, n) {
-  return !t || t.length === 0 ? [] : t.flatMap((r) => r.text.split(he).map((s) => `${n}${s}`));
+  return !t || t.length === 0 ? [] : t.flatMap((r) => r.text.split(le).map((s) => `${n}${s}`));
 }
 function _u(t) {
-  const e = t.split(he);
+  const e = t.split(le);
   for (let n = e.length - 1; n >= 0; n -= 1) {
     const r = e[n], s = r.indexOf("--");
     if (s === -1)
@@ -11193,12 +11231,12 @@ function _u(t) {
     e[n] = i.trimEnd();
     break;
   }
-  return e.join(he);
+  return e.join(le);
 }
 function Nu(t, e) {
-  return t.split(".").map((n) => Me(n, e)).join(".");
+  return t.split(".").map((n) => Ne(n, e)).join(".");
 }
-function Me(t, e) {
+function Ne(t, e) {
   const n = t.trim();
   if (!n || !Su(n, e))
     return n;
@@ -11208,13 +11246,13 @@ function Me(t, e) {
 function Su(t, e) {
   return hu.test(t) ? e.keywordSet.has(t.toUpperCase()) : !0;
 }
-function H(t, e) {
+function z(t, e) {
   return e.options.keywordCase === "lower" ? t.toLowerCase() : t.toUpperCase();
 }
 function dn(t) {
   return /^[A-Za-z ]+$/u.test(t);
 }
-function zn(t) {
+function Hn(t) {
   switch (t.type) {
     case "binary":
       return fu[t.operator];
@@ -11222,6 +11260,7 @@ function zn(t) {
       return 6;
     case "identifier":
     case "bindParameter":
+    case "case":
     case "qualifiedIdentifier":
     case "literal":
     case "typedLiteral":
@@ -11318,11 +11357,11 @@ class Cu {
 }
 const Ru = /((?:[A-Za-z_][A-Za-z0-9_$]*\.)*[A-Za-z_][A-Za-z0-9_$]*)\.[A-Za-z0-9_$]*$/u, ku = (t, e, n, r) => {
   const s = gn(e.keywords).map(
-    (c) => bt(c, wt.Keyword, t, { sortText: `3-${c}` })
+    (c) => wt(c, yt.Keyword, t, { sortText: `3-${c}` })
   ), i = gn(e.functions).map(
-    (c) => bt(c, wt.Function, t, { sortText: `4-${c}` })
+    (c) => wt(c, yt.Function, t, { sortText: `4-${c}` })
   ), a = gn(e.operators).map(
-    (c) => bt(c, wt.Operator, t, { sortText: `5-${c}` })
+    (c) => wt(c, yt.Operator, t, { sortText: `5-${c}` })
   );
   if (!n)
     return [...s, ...i, ...a];
@@ -11364,7 +11403,7 @@ function Eu(t) {
       return !1;
   }
 }
-const bt = (t, e, n, r = {}) => ({
+const wt = (t, e, n, r = {}) => ({
   label: t,
   kind: e,
   insertText: t,
@@ -11374,7 +11413,7 @@ const bt = (t, e, n, r = {}) => ({
 function Au(t, e, n) {
   const r = n === "from" || n === "join" ? "1" : "9";
   return t.map(
-    (s) => bt(s.completionLabel, wt.Table, e, {
+    (s) => wt(s.completionLabel, yt.Table, e, {
       insertText: s.insertText,
       detail: s.detail,
       documentation: s.documentation,
@@ -11387,7 +11426,7 @@ function Mu(t, e, n) {
   return t.tables.forEach((i) => {
     i.columns.forEach((a) => {
       s.push(
-        bt(a.completionLabel, wt.Field, e, {
+        wt(a.completionLabel, yt.Field, e, {
           insertText: a.insertText,
           detail: [i.name, a.detail].filter(Boolean).join(" | "),
           documentation: a.documentation,
@@ -11401,7 +11440,7 @@ function Tu(t, e) {
   const n = Pu(t);
   if (!n)
     return { tables: e.tables };
-  const r = st(n), s = e.aliases.get(r);
+  const r = it(n), s = e.aliases.get(r);
   if (s)
     return { qualifier: n, tables: [s] };
   const i = er(n, e.tables);
@@ -11448,7 +11487,7 @@ function Bu(t, e) {
     if (!i.name)
       return;
     const a = er(i.name, e.tables);
-    a && (r.push(a), i.alias && s.set(st(i.alias), a));
+    a && (r.push(a), i.alias && s.set(it(i.alias), a));
   }), { tables: Ii(r), aliases: s };
 }
 function Vu(t, e) {
@@ -11458,7 +11497,7 @@ function Vu(t, e) {
   const r = [], s = /* @__PURE__ */ new Map();
   return n.forEach((i) => {
     const a = er(i.name, e.tables);
-    a && (r.push(a), i.alias && s.set(st(i.alias), a));
+    a && (r.push(a), i.alias && s.set(it(i.alias), a));
   }), r.length ? { tables: Ii(r), aliases: s } : null;
 }
 function qu(t) {
@@ -11479,16 +11518,16 @@ function Uu(t) {
   return e;
 }
 function er(t, e) {
-  const n = st(t), r = st(Js(t));
+  const n = it(t), r = it(Js(t));
   return e.find(
-    (s) => s.normalizedName === n || st(Js(s.name)) === r
+    (s) => s.normalizedName === n || it(Js(s.name)) === r
   );
 }
 function Ii(t) {
   const e = /* @__PURE__ */ new Set();
   return t.filter((n) => e.has(n.id) ? !1 : (e.add(n.id), !0));
 }
-const gn = (t) => Array.from(new Set(t)), wt = {
+const gn = (t) => Array.from(new Set(t)), yt = {
   Field: 5,
   Function: 3,
   Keyword: 14,