@arcgis/coding-components 4.33.0-next.132 → 4.33.0-next.134

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

@@ -24,7 +24,7 @@ class Vc {
   }
 }
 const $c = new Vc();
-function bn(t) {
+function pn(t) {
   Wc(t) || $c.onUnexpectedError(t);
 }
 function li(t) {
@@ -136,17 +136,17 @@ var Jn;
       yield y(A, N++);
   }
   t.map = d;
-  function* b(v, y) {
+  function* p(v, y) {
     let N = 0;
     for (const A of v)
       yield* y(A, N++);
   }
-  t.flatMap = b;
-  function* p(...v) {
+  t.flatMap = p;
+  function* b(...v) {
     for (const y of v)
       yield* y;
   }
-  t.concat = p;
+  t.concat = b;
   function x(v, y, N) {
     let A = N;
     for (const R of v)
@@ -465,21 +465,21 @@ var Kn;
     return t.debounce(k, (C, F) => C ? (C.push(F), C) : [F], S, void 0, !0, void 0, M);
   }
   t.accumulate = d;
-  function b(k, S = (C, F) => C === F, M) {
+  function p(k, S = (C, F) => C === F, M) {
     let C = !0, F;
     return a(k, ($) => {
       const Z = C || !S($, F);
       return C = !1, F = $, Z;
     }, M);
   }
-  t.latch = b;
-  function p(k, S, M) {
+  t.latch = p;
+  function b(k, S, M) {
     return [
       t.filter(k, S, M),
       t.filter(k, (C) => !S(C), M)
     ];
   }
-  t.split = p;
+  t.split = b;
   function x(k, S = !1, M = [], C) {
     let F = M.slice(), $ = k((me) => {
       F ? F.push(me) : ce.fire(me);
@@ -722,7 +722,7 @@ class Cr {
 const Jc = 2;
 class Ie {
   constructor(e) {
-    this._size = 0, this._options = e, this._leakageMon = this._options?.leakWarningThreshold ? new zs(e?.onListenerError ?? bn, this._options?.leakWarningThreshold ?? jc) : void 0, this._perfMon = this._options?._profName ? new er(this._options._profName) : void 0, this._deliveryQueue = this._options?.deliveryQueue;
+    this._size = 0, this._options = e, this._leakageMon = this._options?.leakWarningThreshold ? new zs(e?.onListenerError ?? pn, this._options?.leakWarningThreshold ?? jc) : void 0, this._perfMon = this._options?._profName ? new er(this._options._profName) : void 0, this._deliveryQueue = this._options?.deliveryQueue;
   }
   dispose() {
     this._disposed || (this._disposed = !0, this._deliveryQueue?.current === this && this._deliveryQueue.reset(), this._listeners && (this._listeners = void 0, this._size = 0), this._options?.onDidRemoveLastListener?.(), this._leakageMon?.dispose());
@@ -737,7 +737,7 @@ class Ie {
         const o = `[${this._leakageMon.name}] REFUSES to accept new listeners because it exceeded its threshold by far (${this._size} vs ${this._leakageMon.threshold})`;
         console.warn(o);
         const l = this._leakageMon.getMostFrequentStack() ?? ["UNKNOWN stack", -1], c = new Yc(`${o}. HINT: Stack shows most frequent listener (${l[1]}-times)`, l[0]);
-        return (this._options?.onListenerError || bn)(c), Qn.None;
+        return (this._options?.onListenerError || pn)(c), Qn.None;
       }
       if (this._disposed)
         return Qn.None;
@@ -773,7 +773,7 @@ class Ie {
   _deliver(e, n) {
     if (!e)
       return;
-    const r = this._options?.onListenerError || bn;
+    const r = this._options?.onListenerError || pn;
     if (!r) {
       e.value(n);
       return;
@@ -949,7 +949,7 @@ function g1(t) {
   }
   return -1;
 }
-function b1(t, e = t.length - 1) {
+function p1(t, e = t.length - 1) {
   for (let n = e; n >= 0; n--) {
     const r = t.charCodeAt(n);
     if (r !== 32 && r !== 9)
@@ -969,7 +969,7 @@ function Kr(t) {
 function Hl(t, e) {
   return (t - 55296 << 10) + (e - 56320) + 65536;
 }
-function p1(t, e, n) {
+function b1(t, e, n) {
   const r = t.charCodeAt(n);
   if (tr(r) && n + 1 < e) {
     const s = t.charCodeAt(n + 1);
@@ -996,16 +996,16 @@ class dt {
       }
       function r(h, f) {
         const m = new Map(h);
-        for (const [d, b] of f)
-          m.set(d, b);
+        for (const [d, p] of f)
+          m.set(d, p);
         return m;
       }
       function s(h, f) {
         if (!h)
           return f;
         const m = /* @__PURE__ */ new Map();
-        for (const [d, b] of h)
-          f.has(d) && m.set(d, b);
+        for (const [d, p] of h)
+          f.has(d) && m.set(d, p);
         return m;
       }
       const i = this.ambiguousCharacterData.value;
@@ -1109,7 +1109,7 @@ if (typeof Ir < "u" && typeof Ir.process < "u") {
     return "/";
   }
 };
-const nr = qt.cwd, x1 = qt.env, v1 = qt.platform, _1 = 65, N1 = 97, S1 = 90, L1 = 122, bt = 46, fe = 47, Se = 92, nt = 58, E1 = 63;
+const nr = qt.cwd, x1 = qt.env, v1 = qt.platform, _1 = 65, N1 = 97, S1 = 90, L1 = 122, pt = 46, fe = 47, Se = 92, nt = 58, E1 = 63;
 class zl extends Error {
   constructor(e, n, r) {
     let s;
@@ -1149,7 +1149,7 @@ function rr(t, e, n, r) {
     }
     if (r(l)) {
       if (!(a === c - 1 || o === 1)) if (o === 2) {
-        if (s.length < 2 || i !== 2 || s.charCodeAt(s.length - 1) !== bt || s.charCodeAt(s.length - 2) !== bt) {
+        if (s.length < 2 || i !== 2 || s.charCodeAt(s.length - 1) !== pt || s.charCodeAt(s.length - 2) !== pt) {
           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, o = 0;
@@ -1163,7 +1163,7 @@ function rr(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, o = 0;
-    } else l === bt && o !== -1 ? ++o : o = -1;
+    } else l === pt && o !== -1 ? ++o : o = -1;
   }
   return s;
 }
@@ -1312,10 +1312,10 @@ const xe = {
     const c = l - o, h = a < c ? a : c;
     let f = -1, m = 0;
     for (; m < h; m++) {
-      const b = t.charCodeAt(s + m);
-      if (b !== e.charCodeAt(o + m))
+      const p = t.charCodeAt(s + m);
+      if (p !== e.charCodeAt(o + m))
         break;
-      b === Se && (f = m);
+      p === Se && (f = m);
     }
     if (m !== h) {
       if (f === -1)
@@ -1343,7 +1343,7 @@ const xe = {
     if (e.charCodeAt(0) === Se) {
       if (e.charCodeAt(1) === Se) {
         const n = e.charCodeAt(2);
-        if (n !== E1 && n !== bt)
+        if (n !== E1 && n !== pt)
           return `\\\\?\\UNC\\${e.slice(2)}`;
       }
     } else if (rt(e.charCodeAt(0)) && e.charCodeAt(1) === nt && e.charCodeAt(2) === Se)
@@ -1434,7 +1434,7 @@ const xe = {
         }
         continue;
       }
-      s === -1 && (i = !1, s = o + 1), l === bt ? n === -1 ? n = o : a !== 1 && (a = 1) : n !== -1 && (a = -1);
+      s === -1 && (i = !1, s = o + 1), l === pt ? n === -1 ? n = o : 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 '..'
@@ -1484,7 +1484,7 @@ const xe = {
         }
         continue;
       }
-      o === -1 && (l = !1, o = c + 1), s === bt ? i === -1 ? i = c : h !== 1 && (h = 1) : i !== -1 && (h = -1);
+      o === -1 && (l = !1, o = c + 1), s === pt ? i === -1 ? i = c : h !== 1 && (h = 1) : i !== -1 && (h = -1);
     }
     return o !== -1 && (i === -1 || // We saw a non-dot character immediately before the dot
     h === 0 || // The (right-most) trimmed path component is exactly '..'
@@ -1613,7 +1613,7 @@ const xe = {
         }
         continue;
       }
-      r === -1 && (s = !1, r = a + 1), o === bt ? e === -1 ? e = a : i !== 1 && (i = 1) : e !== -1 && (i = -1);
+      r === -1 && (s = !1, r = a + 1), o === pt ? e === -1 ? e = a : i !== 1 && (i = 1) : e !== -1 && (i = -1);
     }
     return e === -1 || r === -1 || // We saw a non-dot character immediately before the dot
     i === 0 || // The (right-most) trimmed path component is exactly '..'
@@ -1638,7 +1638,7 @@ const xe = {
         }
         continue;
       }
-      a === -1 && (o = !1, a = l + 1), h === bt ? s === -1 ? s = l : c !== 1 && (c = 1) : s !== -1 && (c = -1);
+      a === -1 && (o = !1, a = l + 1), h === pt ? s === -1 ? s = l : c !== 1 && (c = 1) : s !== -1 && (c = -1);
     }
     if (a !== -1) {
       const h = i === 0 && n ? 1 : i;
@@ -1950,7 +1950,7 @@ class $1 {
       try {
         return this._delegate(e);
       } catch (o) {
-        return bn(o), e;
+        return pn(o), e;
       }
     const n = e.authority;
     let r = this._hosts[n];
@@ -2259,20 +2259,20 @@ class at {
     return this.modifiedStart + this.modifiedLength;
   }
 }
-function bi(t, e) {
+function pi(t, e) {
   return (e << 5) - e + t | 0;
 }
 function J1(t, e) {
-  e = bi(149417, e);
+  e = pi(149417, e);
   for (let n = 0, r = t.length; n < r; n++)
-    e = bi(t.charCodeAt(n), e);
+    e = pi(t.charCodeAt(n), e);
   return e;
 }
 function Dr(t, e, n = 32) {
   const r = n - e, s = ~((1 << r) - 1);
   return (t << e | (s & t) >>> r) >>> 0;
 }
-function pi(t, e = 0, n = t.byteLength, r = 0) {
+function bi(t, e = 0, n = t.byteLength, r = 0) {
   for (let s = 0; s < n; s++)
     t[e + s] = r;
 }
@@ -2331,7 +2331,7 @@ class Kl {
     )), this._totalLen += this._buffLen, this._wrapUp()), ln(this._h0) + ln(this._h1) + ln(this._h2) + ln(this._h3) + ln(this._h4);
   }
   _wrapUp() {
-    this._buff[this._buffLen++] = 128, pi(this._buff, this._buffLen), this._buffLen > 56 && (this._step(), pi(this._buff));
+    this._buff[this._buffLen++] = 128, bi(this._buff, this._buffLen), this._buffLen > 56 && (this._step(), bi(this._buff));
     const e = 8 * this._totalLen;
     this._buffDV.setUint32(56, Math.floor(e / 4294967296), !1), this._buffDV.setUint32(60, e % 4294967296, !1), this._step();
   }
@@ -2526,11 +2526,11 @@ class ft {
       new at(e, n - e + 1, r, s - r + 1)
     ];
   }
-  WALKTRACE(e, n, r, s, i, a, o, l, c, h, f, m, d, b, p, x, _, E) {
+  WALKTRACE(e, n, r, s, i, a, o, l, c, h, f, m, d, p, b, x, _, E) {
     let L = null, v = null, y = new yi(), N = n, A = r, R = d[0] - x[0] - s, W = -1073741824, K = this.m_forwardHistory.length - 1;
     do {
       const q = R + e;
-      q === N || q < A && c[q - 1] < c[q + 1] ? (f = c[q + 1], b = f - R - s, f < W && y.MarkNextChange(), W = f, y.AddModifiedElement(f + 1, b), R = q + 1 - e) : (f = c[q - 1] + 1, b = f - R - s, f < W && y.MarkNextChange(), W = f - 1, y.AddOriginalElement(f, b + 1), R = q - 1 - e), K >= 0 && (c = this.m_forwardHistory[K], e = c[0], N = 1, A = c.length - 1);
+      q === N || q < A && c[q - 1] < c[q + 1] ? (f = c[q + 1], p = f - R - s, f < W && y.MarkNextChange(), W = f, y.AddModifiedElement(f + 1, p), R = q + 1 - e) : (f = c[q - 1] + 1, p = f - R - s, f < W && y.MarkNextChange(), W = f - 1, y.AddOriginalElement(f, p + 1), R = q - 1 - e), K >= 0 && (c = this.m_forwardHistory[K], e = c[0], N = 1, A = c.length - 1);
     } while (--K >= -1);
     if (L = y.getReverseChanges(), E[0]) {
       let q = d[0] + 1, P = x[0] + 1;
@@ -2539,13 +2539,13 @@ class ft {
         q = Math.max(q, k.getOriginalEnd()), P = Math.max(P, k.getModifiedEnd());
       }
       v = [
-        new at(q, m - q + 1, P, p - P + 1)
+        new at(q, m - q + 1, P, b - P + 1)
       ];
     } else {
       y = new yi(), N = a, A = o, R = d[0] - x[0] - l, W = 1073741824, K = _ ? this.m_reverseHistory.length - 1 : this.m_reverseHistory.length - 2;
       do {
         const q = R + i;
-        q === N || q < A && h[q - 1] >= h[q + 1] ? (f = h[q + 1] - 1, b = f - R - l, f > W && y.MarkNextChange(), W = f + 1, y.AddOriginalElement(f + 1, b + 1), R = q + 1 - i) : (f = h[q - 1], b = f - R - l, f > W && y.MarkNextChange(), W = f, y.AddModifiedElement(f + 1, b + 1), R = q - 1 - i), K >= 0 && (h = this.m_reverseHistory[K], i = h[0], N = 1, A = h.length - 1);
+        q === N || q < A && h[q - 1] >= h[q + 1] ? (f = h[q + 1] - 1, p = f - R - l, f > W && y.MarkNextChange(), W = f + 1, y.AddOriginalElement(f + 1, p + 1), R = q + 1 - i) : (f = h[q - 1], p = f - R - l, f > W && y.MarkNextChange(), W = f, y.AddModifiedElement(f + 1, p + 1), R = q - 1 - i), K >= 0 && (h = this.m_reverseHistory[K], i = h[0], N = 1, A = h.length - 1);
       } while (--K >= -1);
       v = y.getChanges();
     }
@@ -2570,11 +2570,11 @@ class ft {
   ComputeRecursionPoint(e, n, r, s, i, a, o) {
     let l = 0, c = 0, h = 0, f = 0, m = 0, d = 0;
     e--, r--, i[0] = 0, a[0] = 0, this.m_forwardHistory = [], this.m_reverseHistory = [];
-    const b = n - e + (s - r), p = b + 1, x = new Int32Array(p), _ = new Int32Array(p), E = s - r, L = n - e, v = e - r, y = n - s, A = (L - E) % 2 === 0;
+    const p = n - e + (s - r), b = p + 1, x = new Int32Array(b), _ = new Int32Array(b), E = s - r, L = n - e, v = e - r, y = n - s, A = (L - E) % 2 === 0;
     x[E] = e, _[L] = n, o[0] = !1;
-    for (let R = 1; R <= b / 2 + 1; R++) {
+    for (let R = 1; R <= p / 2 + 1; R++) {
       let W = 0, K = 0;
-      h = this.ClipDiagonalBound(E - R, R, E, p), f = this.ClipDiagonalBound(E + R, R, E, p);
+      h = this.ClipDiagonalBound(E - R, R, E, b), f = this.ClipDiagonalBound(E + R, R, E, b);
       for (let P = h; P <= f; P += 2) {
         P === h || P < f && x[P - 1] < x[P + 1] ? l = x[P + 1] : l = x[P - 1] + 1, c = l - (P - E) - v;
         const k = l;
@@ -2588,7 +2588,7 @@ class ft {
         return o[0] = !0, i[0] = W, a[0] = K, q > 0 && R <= 1448 ? this.WALKTRACE(E, h, f, v, L, m, d, y, x, _, l, n, i, c, s, a, A, o) : (e++, r++, [
           new at(e, n - e + 1, r, s - r + 1)
         ]);
-      m = this.ClipDiagonalBound(L - R, R, L, p), d = this.ClipDiagonalBound(L + R, R, L, p);
+      m = this.ClipDiagonalBound(L - R, R, L, b), d = this.ClipDiagonalBound(L + R, R, L, b);
       for (let P = m; P <= d; P += 2) {
         P === m || P < d && _[P - 1] >= _[P + 1] ? l = _[P + 1] - 1 : l = _[P - 1], c = l - (P - L) - y;
         const k = l;
@@ -2640,8 +2640,8 @@ class ft {
         const m = r.originalStart - f, d = r.modifiedStart - f;
         if (m < s || d < i || a && !this.OriginalElementsAreEqual(m, m + r.originalLength) || o && !this.ModifiedElementsAreEqual(d, d + r.modifiedLength))
           break;
-        const p = (m === s && d === i ? 5 : 0) + this._boundaryScore(m, r.originalLength, d, r.modifiedLength);
-        p > c && (c = p, l = f);
+        const b = (m === s && d === i ? 5 : 0) + this._boundaryScore(m, r.originalLength, d, r.modifiedLength);
+        b > c && (c = b, l = f);
       }
       r.originalStart -= l, r.modifiedStart -= l;
       const h = [null];
@@ -2656,8 +2656,8 @@ class ft {
         if (a < 5 && c < 20 && m < 20) {
           const d = this._findBetterContiguousSequence(o, c, h, m, a);
           if (d) {
-            const [b, p] = d;
-            (b !== s.originalStart + s.originalLength || p !== s.modifiedStart + s.modifiedLength) && (s.originalLength = b - s.originalStart, s.modifiedLength = p - s.modifiedStart, i.originalStart = b + a, i.modifiedStart = p + a, i.originalLength = l - i.originalStart, i.modifiedLength = f - i.modifiedStart);
+            const [p, b] = d;
+            (p !== s.originalStart + s.originalLength || b !== s.modifiedStart + s.modifiedLength) && (s.originalLength = p - s.originalStart, s.modifiedLength = b - s.modifiedStart, i.originalStart = p + a, i.modifiedStart = b + a, i.originalLength = l - i.originalStart, i.modifiedLength = f - i.modifiedStart);
           }
         }
       }
@@ -3369,7 +3369,7 @@ class ir {
     const r = nf(), s = [];
     for (let i = 1, a = e.getLineCount(); i <= a; i++) {
       const o = e.getLineContent(i), l = o.length;
-      let c = 0, h = 0, f = 0, m = 1, d = !1, b = !1, p = !1, x = !1;
+      let c = 0, h = 0, f = 0, m = 1, d = !1, p = !1, b = !1, x = !1;
       for (; c < l; ) {
         let _ = !1;
         const E = o.charCodeAt(c);
@@ -3383,10 +3383,10 @@ class ir {
               L = d ? 0 : 1;
               break;
             case 91:
-              p = !0, b = !0, L = 0;
+              b = !0, p = !0, L = 0;
               break;
             case 93:
-              p = !1, L = b ? 0 : 1;
+              b = !1, L = p ? 0 : 1;
               break;
             case 123:
               x = !0, L = 0;
@@ -3408,7 +3408,7 @@ class ir {
               L = f === 124 ? 1 : 0;
               break;
             case 32:
-              L = p ? 0 : 1;
+              L = b ? 0 : 1;
               break;
             default:
               L = r.get(E);
@@ -3416,10 +3416,10 @@ class ir {
           L === 1 && (s.push(ir._createLink(r, o, i, h, c)), _ = !0);
         } else if (m === 12) {
           let L;
-          E === 91 ? (b = !0, L = 0) : L = r.get(E), L === 1 ? _ = !0 : m = 13;
+          E === 91 ? (p = !0, L = 0) : L = r.get(E), L === 1 ? _ = !0 : m = 13;
         } else
           m = n.nextState(m, E), m === 0 && (_ = !0);
-        _ && (m = 1, d = !1, b = !1, x = !1, h = c + 1, f = E), c++;
+        _ && (m = 1, d = !1, p = !1, x = !1, h = c + 1, f = E), c++;
       }
       m === 13 && s.push(ir._createLink(r, o, i, h, l));
     }
@@ -5020,14 +5020,14 @@ var ga;
 (function(t) {
   t.Off = "off", t.OnCode = "onCode", t.On = "on";
 })(ga || (ga = {}));
-var ba;
+var pa;
 (function(t) {
   t[t.Invoke = 1] = "Invoke", t[t.TriggerCharacter = 2] = "TriggerCharacter", t[t.ContentChange = 3] = "ContentChange";
-})(ba || (ba = {}));
-var pa;
+})(pa || (pa = {}));
+var ba;
 (function(t) {
   t[t.File = 0] = "File", t[t.Module = 1] = "Module", t[t.Namespace = 2] = "Namespace", t[t.Package = 3] = "Package", t[t.Class = 4] = "Class", t[t.Method = 5] = "Method", t[t.Property = 6] = "Property", t[t.Field = 7] = "Field", t[t.Constructor = 8] = "Constructor", t[t.Enum = 9] = "Enum", t[t.Interface = 10] = "Interface", t[t.Function = 11] = "Function", t[t.Variable = 12] = "Variable", t[t.Constant = 13] = "Constant", t[t.String = 14] = "String", t[t.Number = 15] = "Number", t[t.Boolean = 16] = "Boolean", t[t.Array = 17] = "Array", t[t.Object = 18] = "Object", t[t.Key = 19] = "Key", t[t.Null = 20] = "Null", t[t.EnumMember = 21] = "EnumMember", t[t.Struct = 22] = "Struct", t[t.Event = 23] = "Event", t[t.Operator = 24] = "Operator", t[t.TypeParameter = 25] = "TypeParameter";
-})(pa || (pa = {}));
+})(ba || (ba = {}));
 var wa;
 (function(t) {
   t[t.Deprecated = 1] = "Deprecated";
@@ -5065,7 +5065,7 @@ class gf {
     return uf(e, n);
   }
 }
-function bf() {
+function pf() {
   return {
     editor: void 0,
     // undefined override expected here
@@ -5097,7 +5097,7 @@ class or {
   }
 }
 var Na;
-class pf {
+class bf {
   constructor() {
     this[Na] = "LinkedMap", this._map = /* @__PURE__ */ new Map(), this._head = void 0, this._tail = void 0, this._size = 0, this._state = 0;
   }
@@ -5322,7 +5322,7 @@ class pf {
       this.set(n, r);
   }
 }
-class wf extends pf {
+class wf extends bf {
   constructor(e, n = 1) {
     super(), this._limit = e, this._ratio = Math.min(Math.max(0, n), 1);
   }
@@ -5465,7 +5465,7 @@ class Ef {
       const s = r.index, i = r[0].length;
       if (s === this._prevMatchStartIndex && i === this._prevMatchLength) {
         if (i === 0) {
-          p1(e, n, this._searchRegex.lastIndex) > 65535 ? this._searchRegex.lastIndex += 2 : this._searchRegex.lastIndex += 1;
+          b1(e, n, this._searchRegex.lastIndex) > 65535 ? this._searchRegex.lastIndex += 2 : this._searchRegex.lastIndex += 1;
           continue;
         }
         return null;
@@ -5482,7 +5482,7 @@ function Tf(t, e = "Unreachable") {
 function lr(t) {
   if (!t()) {
     debugger;
-    t(), bn(new Ce("Assertion Failed"));
+    t(), pn(new Ce("Assertion Failed"));
   }
 }
 function nu(t, e) {
@@ -5562,7 +5562,7 @@ class Rf {
     let l;
     o === "allNonBasicAscii" ? l = new RegExp("[^\\t\\n\\r\\x20-\\x7E]", "g") : l = new RegExp(`${Mf(Array.from(o))}`, "g");
     const c = new Ef(null, l), h = [];
-    let f = !1, m, d = 0, b = 0, p = 0;
+    let f = !1, m, d = 0, p = 0, b = 0;
     e: for (let x = s, _ = i; x <= _; x++) {
       const E = e.getLineContent(x), L = E.length;
       c.reset(0);
@@ -5582,7 +5582,7 @@ class Rf {
           A && A.endColumn <= v + 1 && (A = null);
           const R = a.shouldHighlightNonBasicASCII(N, A ? A.word : null);
           if (R !== 0) {
-            if (R === 3 ? d++ : R === 2 ? b++ : R === 1 ? p++ : Tf(), h.length >= 1e3) {
+            if (R === 3 ? d++ : R === 2 ? p++ : R === 1 ? b++ : Tf(), h.length >= 1e3) {
               f = !0;
               break e;
             }
@@ -5595,8 +5595,8 @@ class Rf {
       ranges: h,
       hasMore: f,
       ambiguousCharacterCount: d,
-      invisibleCharacterCount: b,
-      nonBasicAsciiCharacterCount: p
+      invisibleCharacterCount: p,
+      nonBasicAsciiCharacterCount: b
     };
   }
   static computeUnicodeHighlightReason(e, n) {
@@ -6300,22 +6300,22 @@ function Vf(t) {
   }
   return e;
 }
-class pn {
+class bn {
   constructor(e, n, r, s, i) {
     this.originalStartLineNumber = e, this.originalEndLineNumber = n, this.modifiedStartLineNumber = r, this.modifiedEndLineNumber = s, this.charChanges = i;
   }
   static createFromDiffResult(e, n, r, s, i, a, o) {
     let l, c, h, f, m;
     if (n.originalLength === 0 ? (l = r.getStartLineNumber(n.originalStart) - 1, c = 0) : (l = r.getStartLineNumber(n.originalStart), c = r.getEndLineNumber(n.originalStart + n.originalLength - 1)), n.modifiedLength === 0 ? (h = s.getStartLineNumber(n.modifiedStart) - 1, f = 0) : (h = s.getStartLineNumber(n.modifiedStart), f = s.getEndLineNumber(n.modifiedStart + n.modifiedLength - 1)), a && n.originalLength > 0 && n.originalLength < 20 && n.modifiedLength > 0 && n.modifiedLength < 20 && i()) {
-      const d = r.createCharSequence(e, n.originalStart, n.originalStart + n.originalLength - 1), b = s.createCharSequence(e, n.modifiedStart, n.modifiedStart + n.modifiedLength - 1);
-      if (d.getElements().length > 0 && b.getElements().length > 0) {
-        let p = au(d, b, i, !0).changes;
-        o && (p = Vf(p)), m = [];
-        for (let x = 0, _ = p.length; x < _; x++)
-          m.push(Ht.createFromDiffChange(p[x], d, b));
+      const d = r.createCharSequence(e, n.originalStart, n.originalStart + n.originalLength - 1), p = s.createCharSequence(e, n.modifiedStart, n.modifiedStart + n.modifiedLength - 1);
+      if (d.getElements().length > 0 && p.getElements().length > 0) {
+        let b = au(d, p, i, !0).changes;
+        o && (b = Vf(b)), m = [];
+        for (let x = 0, _ = b.length; x < _; x++)
+          m.push(Ht.createFromDiffChange(b[x], d, p));
       }
     }
-    return new pn(l, c, h, f, m);
+    return new bn(l, c, h, f, m);
   }
 }
 class $f {
@@ -6352,7 +6352,7 @@ class $f {
     if (this.shouldIgnoreTrimWhitespace) {
       const o = [];
       for (let l = 0, c = n.length; l < c; l++)
-        o.push(pn.createFromDiffResult(this.shouldIgnoreTrimWhitespace, n[l], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));
+        o.push(bn.createFromDiffResult(this.shouldIgnoreTrimWhitespace, n[l], this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges));
       return {
         quitEarly: r,
         changes: o
@@ -6366,30 +6366,30 @@ class $f {
         const m = this.originalLines[i], d = this.modifiedLines[a];
         if (m !== d) {
           {
-            let b = cs(m, 1), p = cs(d, 1);
-            for (; b > 1 && p > 1; ) {
-              const x = m.charCodeAt(b - 2), _ = d.charCodeAt(p - 2);
+            let p = cs(m, 1), b = cs(d, 1);
+            for (; p > 1 && b > 1; ) {
+              const x = m.charCodeAt(p - 2), _ = d.charCodeAt(b - 2);
               if (x !== _)
                 break;
-              b--, p--;
+              p--, b--;
             }
-            (b > 1 || p > 1) && this._pushTrimWhitespaceCharChange(s, i + 1, 1, b, a + 1, 1, p);
+            (p > 1 || b > 1) && this._pushTrimWhitespaceCharChange(s, i + 1, 1, p, a + 1, 1, b);
           }
           {
-            let b = fs(m, 1), p = fs(d, 1);
+            let p = fs(m, 1), b = fs(d, 1);
             const x = m.length + 1, _ = d.length + 1;
-            for (; b < x && p < _; ) {
-              const E = m.charCodeAt(b - 1), L = m.charCodeAt(p - 1);
+            for (; p < x && b < _; ) {
+              const E = m.charCodeAt(p - 1), L = m.charCodeAt(b - 1);
               if (E !== L)
                 break;
-              b++, p++;
+              p++, b++;
             }
-            (b < x || p < _) && this._pushTrimWhitespaceCharChange(s, i + 1, b, x, a + 1, p, _);
+            (p < x || b < _) && this._pushTrimWhitespaceCharChange(s, i + 1, p, x, a + 1, b, _);
           }
         }
         i++, a++;
       }
-      c && (s.push(pn.createFromDiffResult(this.shouldIgnoreTrimWhitespace, c, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)), i += c.originalLength, a += c.modifiedLength);
+      c && (s.push(bn.createFromDiffResult(this.shouldIgnoreTrimWhitespace, c, this.original, this.modified, this.continueCharDiff, this.shouldComputeCharChanges, this.shouldPostProcessCharChanges)), i += c.originalLength, a += c.modifiedLength);
     }
     return {
       quitEarly: r,
@@ -6400,7 +6400,7 @@ class $f {
     if (this._mergeTrimWhitespaceCharChange(e, n, r, s, i, a, o))
       return;
     let l;
-    this.shouldComputeCharChanges && (l = [new Ht(n, r, n, s, i, a, i, o)]), e.push(new pn(n, n, i, i, l));
+    this.shouldComputeCharChanges && (l = [new Ht(n, r, n, s, i, a, i, o)]), e.push(new bn(n, n, i, i, l));
   }
   _mergeTrimWhitespaceCharChange(e, n, r, s, i, a, o) {
     const l = e.length;
@@ -6415,7 +6415,7 @@ function cs(t, e) {
   return n === -1 ? e : n + 1;
 }
 function fs(t, e) {
-  const n = b1(t);
+  const n = p1(t);
   return n === -1 ? e : n + 2;
 }
 function Ma(t) {
@@ -6661,24 +6661,24 @@ class Zf {
     if (e.length === 0 || n.length === 0)
       return et.trivial(e, n);
     const i = new Pr(e.length, n.length), a = new Pr(e.length, n.length), o = new Pr(e.length, n.length);
-    for (let b = 0; b < e.length; b++)
-      for (let p = 0; p < n.length; p++) {
+    for (let p = 0; p < e.length; p++)
+      for (let b = 0; b < n.length; b++) {
         if (!r.isValid())
           return et.trivialTimedOut(e, n);
-        const x = b === 0 ? 0 : i.get(b - 1, p), _ = p === 0 ? 0 : i.get(b, p - 1);
+        const x = p === 0 ? 0 : i.get(p - 1, b), _ = b === 0 ? 0 : i.get(p, b - 1);
         let E;
-        e.getElement(b) === n.getElement(p) ? (b === 0 || p === 0 ? E = 0 : E = i.get(b - 1, p - 1), b > 0 && p > 0 && a.get(b - 1, p - 1) === 3 && (E += o.get(b - 1, p - 1)), E += s ? s(b, p) : 1) : E = -1;
+        e.getElement(p) === n.getElement(b) ? (p === 0 || b === 0 ? E = 0 : E = i.get(p - 1, b - 1), p > 0 && b > 0 && a.get(p - 1, b - 1) === 3 && (E += o.get(p - 1, b - 1)), E += s ? s(p, b) : 1) : E = -1;
         const L = Math.max(x, _, E);
         if (L === E) {
-          const v = b > 0 && p > 0 ? o.get(b - 1, p - 1) : 0;
-          o.set(b, p, v + 1), a.set(b, p, 3);
-        } else L === x ? (o.set(b, p, 0), a.set(b, p, 1)) : L === _ && (o.set(b, p, 0), a.set(b, p, 2));
-        i.set(b, p, L);
+          const v = p > 0 && b > 0 ? o.get(p - 1, b - 1) : 0;
+          o.set(p, b, v + 1), a.set(p, b, 3);
+        } else L === x ? (o.set(p, b, 0), a.set(p, b, 1)) : L === _ && (o.set(p, b, 0), a.set(p, b, 2));
+        i.set(p, b, L);
       }
     const l = [];
     let c = e.length, h = n.length;
-    function f(b, p) {
-      (b + 1 !== c || p + 1 !== h) && l.push(new ee(new B(b + 1, c), new B(p + 1, h))), c = b, h = p;
+    function f(p, b) {
+      (p + 1 !== c || b + 1 !== h) && l.push(new ee(new B(p + 1, c), new B(b + 1, h))), c = p, h = b;
     }
     let m = e.length - 1, d = n.length - 1;
     for (; m >= 0 && d >= 0; )
@@ -6691,10 +6691,10 @@ class ou {
     if (e.length === 0 || n.length === 0)
       return et.trivial(e, n);
     const s = e, i = n;
-    function a(p, x) {
-      for (; p < s.length && x < i.length && s.getElement(p) === i.getElement(x); )
-        p++, x++;
-      return p;
+    function a(b, x) {
+      for (; b < s.length && x < i.length && s.getElement(b) === i.getElement(x); )
+        b++, x++;
+      return b;
     }
     let o = 0;
     const l = new Yf();
@@ -6705,9 +6705,9 @@ class ou {
     e: for (; ; ) {
       if (o++, !r.isValid())
         return et.trivialTimedOut(s, i);
-      const p = -Math.min(o, i.length + o % 2), x = Math.min(o, s.length + o % 2);
-      for (h = p; h <= x; h += 2) {
-        const _ = h === x ? -1 : l.get(h + 1), E = h === p ? -1 : l.get(h - 1) + 1, L = Math.min(Math.max(_, E), s.length), v = L - h;
+      const b = -Math.min(o, i.length + o % 2), x = Math.min(o, s.length + o % 2);
+      for (h = b; h <= x; h += 2) {
+        const _ = h === x ? -1 : l.get(h + 1), E = h === b ? -1 : l.get(h - 1) + 1, L = Math.min(Math.max(_, E), s.length), v = L - h;
         if (L > s.length || v > i.length)
           continue;
         const y = a(L, v);
@@ -6719,12 +6719,12 @@ class ou {
     }
     let f = c.get(h);
     const m = [];
-    let d = s.length, b = i.length;
+    let d = s.length, p = i.length;
     for (; ; ) {
-      const p = f ? f.x + f.length : 0, x = f ? f.y + f.length : 0;
-      if ((p !== d || x !== b) && m.push(new ee(new B(p, d), new B(x, b))), !f)
+      const b = f ? f.x + f.length : 0, x = f ? f.y + f.length : 0;
+      if ((b !== d || x !== p) && m.push(new ee(new B(b, d), new B(x, p))), !f)
         break;
-      d = f.x, b = f.y, f = f.prev;
+      d = f.x, p = f.y, f = f.prev;
     }
     return m.reverse(), new et(m, !1);
   }
@@ -6897,16 +6897,16 @@ function th(t, e, n, r, s, i) {
   const a = [], o = new xf();
   for (const m of t)
     for (let d = m.original.startLineNumber; d < m.original.endLineNumberExclusive - 2; d++) {
-      const b = `${e[d - 1]}:${e[d + 1 - 1]}:${e[d + 2 - 1]}`;
-      o.add(b, { range: new U(d, d + 3) });
+      const p = `${e[d - 1]}:${e[d + 1 - 1]}:${e[d + 2 - 1]}`;
+      o.add(p, { range: new U(d, d + 3) });
     }
   const l = [];
   t.sort(zn((m) => m.modified.startLineNumber, Gn));
   for (const m of t) {
     let d = [];
-    for (let b = m.modified.startLineNumber; b < m.modified.endLineNumberExclusive - 2; b++) {
-      const p = `${n[b - 1]}:${n[b + 1 - 1]}:${n[b + 2 - 1]}`, x = new U(b, b + 3), _ = [];
-      o.forEach(p, ({ range: E }) => {
+    for (let p = m.modified.startLineNumber; p < m.modified.endLineNumberExclusive - 2; p++) {
+      const b = `${n[p - 1]}:${n[p + 1 - 1]}:${n[p + 2 - 1]}`, x = new U(p, p + 3), _ = [];
+      o.forEach(b, ({ range: E }) => {
         for (const v of d)
           if (v.originalLineRange.endLineNumberExclusive + 1 === E.endLineNumberExclusive && v.modifiedLineRange.endLineNumberExclusive + 1 === x.endLineNumberExclusive) {
             v.originalLineRange = new U(v.originalLineRange.startLineNumber, E.endLineNumberExclusive), v.modifiedLineRange = new U(v.modifiedLineRange.startLineNumber, x.endLineNumberExclusive), _.push(v);
@@ -6925,7 +6925,7 @@ function th(t, e, n, r, s, i) {
   l.sort(Gf(zn((m) => m.modifiedLineRange.length, Gn)));
   const c = new Ye(), h = new Ye();
   for (const m of l) {
-    const d = m.modifiedLineRange.startLineNumber - m.originalLineRange.startLineNumber, b = c.subtractFrom(m.modifiedLineRange), p = h.subtractFrom(m.originalLineRange).getWithDelta(d), x = b.getIntersection(p);
+    const d = m.modifiedLineRange.startLineNumber - m.originalLineRange.startLineNumber, p = c.subtractFrom(m.modifiedLineRange), b = h.subtractFrom(m.originalLineRange).getWithDelta(d), x = p.getIntersection(b);
     for (const _ of x.ranges) {
       if (_.length < 3)
         continue;
@@ -6936,7 +6936,7 @@ function th(t, e, n, r, s, i) {
   a.sort(zn((m) => m.original.startLineNumber, Gn));
   const f = new Sr(t);
   for (let m = 0; m < a.length; m++) {
-    const d = a[m], b = f.findLastMonotonous((N) => N.original.startLineNumber <= d.original.startLineNumber), p = Yt(t, (N) => N.modified.startLineNumber <= d.modified.startLineNumber), x = Math.max(d.original.startLineNumber - b.original.startLineNumber, d.modified.startLineNumber - p.modified.startLineNumber), _ = f.findLastMonotonous((N) => N.original.startLineNumber < d.original.endLineNumberExclusive), E = Yt(t, (N) => N.modified.startLineNumber < d.modified.endLineNumberExclusive), L = Math.max(_.original.endLineNumberExclusive - d.original.endLineNumberExclusive, E.modified.endLineNumberExclusive - d.modified.endLineNumberExclusive);
+    const d = a[m], p = f.findLastMonotonous((N) => N.original.startLineNumber <= d.original.startLineNumber), b = Yt(t, (N) => N.modified.startLineNumber <= d.modified.startLineNumber), x = Math.max(d.original.startLineNumber - p.original.startLineNumber, d.modified.startLineNumber - b.modified.startLineNumber), _ = f.findLastMonotonous((N) => N.original.startLineNumber < d.original.endLineNumberExclusive), E = Yt(t, (N) => N.modified.startLineNumber < d.modified.endLineNumberExclusive), L = Math.max(_.original.endLineNumberExclusive - d.original.endLineNumberExclusive, E.modified.endLineNumberExclusive - d.modified.endLineNumberExclusive);
     let v;
     for (v = 0; v < x; v++) {
       const N = d.original.startLineNumber - v - 1, A = d.modified.startLineNumber - v - 1;
@@ -7062,8 +7062,8 @@ function Va(t, e, n, r, s) {
     return t;
   let l = 0, c = -1;
   for (let h = -a; h <= o; h++) {
-    const f = t.seq2Range.start + h, m = t.seq2Range.endExclusive + h, d = t.seq1Range.start + h, b = e.getBoundaryScore(d) + n.getBoundaryScore(f) + n.getBoundaryScore(m);
-    b > c && (c = b, l = h);
+    const f = t.seq2Range.start + h, m = t.seq2Range.endExclusive + h, d = t.seq1Range.start + h, p = e.getBoundaryScore(d) + n.getBoundaryScore(f) + n.getBoundaryScore(m);
+    p > c && (c = p, l = h);
   }
   return t.delta(l);
 }
@@ -7090,18 +7090,18 @@ function ah(t, e, n) {
       return;
     let m = new ee(h, f);
     const d = m.intersect(c);
-    let b = d.seq1Range.length, p = d.seq2Range.length;
+    let p = d.seq1Range.length, b = d.seq2Range.length;
     for (; r.length > 0; ) {
       const x = r[0];
       if (!(x.seq1Range.intersects(m.seq1Range) || x.seq2Range.intersects(m.seq2Range)))
         break;
       const E = t.findWordContaining(x.seq1Range.start), L = e.findWordContaining(x.seq2Range.start), v = new ee(E, L), y = v.intersect(x);
-      if (b += y.seq1Range.length, p += y.seq2Range.length, m = m.join(v), m.seq1Range.endExclusive >= x.seq1Range.endExclusive)
+      if (p += y.seq1Range.length, b += y.seq2Range.length, m = m.join(v), m.seq1Range.endExclusive >= x.seq1Range.endExclusive)
         r.shift();
       else
         break;
     }
-    b + p < (m.seq1Range.length + m.seq2Range.length) * 2 / 3 && s.push(m), i = m.getEndExclusives();
+    p + b < (m.seq1Range.length + m.seq2Range.length) * 2 / 3 && s.push(m), i = m.getEndExclusives();
   }
   for (; r.length > 0; ) {
     const l = r.shift();
@@ -7130,8 +7130,8 @@ function lh(t, e, n) {
     ];
     for (let o = 1; o < r.length; o++) {
       let h = function(m, d) {
-        const b = new B(c.seq1Range.endExclusive, l.seq1Range.start);
-        return t.getText(b).replace(/\s/g, "").length <= 4 && (m.seq1Range.length + m.seq2Range.length > 5 || d.seq1Range.length + d.seq2Range.length > 5);
+        const p = new B(c.seq1Range.endExclusive, l.seq1Range.start);
+        return t.getText(p).replace(/\s/g, "").length <= 4 && (m.seq1Range.length + m.seq2Range.length > 5 || d.seq1Range.length + d.seq2Range.length > 5);
       };
       const l = r[o], c = a[a.length - 1];
       h(c, l) ? (i = !0, a[a.length - 1] = a[a.length - 1].join(l)) : a.push(l);
@@ -7151,14 +7151,14 @@ function uh(t, e, n) {
       r[0]
     ];
     for (let l = 1; l < r.length; l++) {
-      let f = function(d, b) {
-        const p = new B(h.seq1Range.endExclusive, c.seq1Range.start);
-        if (t.countLinesIn(p) > 5 || p.length > 500)
+      let f = function(d, p) {
+        const b = new B(h.seq1Range.endExclusive, c.seq1Range.start);
+        if (t.countLinesIn(b) > 5 || b.length > 500)
           return !1;
-        const _ = t.getText(p).trim();
+        const _ = t.getText(b).trim();
         if (_.length > 20 || _.split(/\r\n|\r|\n/).length > 1)
           return !1;
-        const E = t.countLinesIn(d.seq1Range), L = d.seq1Range.length, v = e.countLinesIn(d.seq2Range), y = d.seq2Range.length, N = t.countLinesIn(b.seq1Range), A = b.seq1Range.length, R = e.countLinesIn(b.seq2Range), W = b.seq2Range.length, K = 2 * 40 + 50;
+        const E = t.countLinesIn(d.seq1Range), L = d.seq1Range.length, v = e.countLinesIn(d.seq2Range), y = d.seq2Range.length, N = t.countLinesIn(p.seq1Range), A = p.seq1Range.length, R = e.countLinesIn(p.seq2Range), W = p.seq2Range.length, K = 2 * 40 + 50;
         function q(P) {
           return Math.min(P, K);
         }
@@ -7177,9 +7177,9 @@ function uh(t, e, n) {
     }
     const m = t.extendToFullLines(l.seq1Range), d = t.getText(new B(m.start, l.seq1Range.start));
     f(d) && (h = h.deltaStart(-d.length));
-    const b = t.getText(new B(l.seq1Range.endExclusive, m.endExclusive));
-    f(b) && (h = h.deltaEnd(b.length));
-    const p = ee.fromOffsetPairs(o ? o.getEndExclusives() : qe.zero, c ? c.getStarts() : qe.max), x = h.intersect(p);
+    const p = t.getText(new B(l.seq1Range.endExclusive, m.endExclusive));
+    f(p) && (h = h.deltaEnd(p.length));
+    const b = ee.fromOffsetPairs(o ? o.getEndExclusives() : qe.zero, c ? c.getStarts() : qe.max), x = h.intersect(b);
     a.length > 0 && x.getStarts().equals(a[a.length - 1].getEndExclusives()) ? a[a.length - 1] = a[a.length - 1].join(x) : a.push(x);
   }), a;
 }
@@ -7230,17 +7230,17 @@ class ch {
       return N === void 0 && (N = a.size, a.set(y, N)), N;
     }
     const l = e.map((y) => o(y.trim())), c = n.map((y) => o(y.trim())), h = new $a(l, e), f = new $a(c, n), m = h.length + f.length < 1700 ? this.dynamicProgrammingDiffing.compute(h, f, s, (y, N) => e[y] === n[N] ? n[N].length === 0 ? 0.1 : 1 + Math.log(1 + n[N].length) : 0.99) : this.myersDiffingAlgorithm.compute(h, f, s);
-    let d = m.diffs, b = m.hitTimeout;
+    let d = m.diffs, p = m.hitTimeout;
     d = Pa(h, f, d), d = lh(h, f, d);
-    const p = [], x = (y) => {
+    const b = [], x = (y) => {
       if (i)
         for (let N = 0; N < y; N++) {
           const A = _ + N, R = E + N;
           if (e[A] !== n[R]) {
             const W = this.refineDiff(e, n, new ee(new B(A, A + 1), new B(R, R + 1)), s, i);
             for (const K of W.mappings)
-              p.push(K);
-            W.hitTimeout && (b = !0);
+              b.push(K);
+            W.hitTimeout && (p = !0);
           }
         }
     };
@@ -7250,12 +7250,12 @@ class ch {
       const N = y.seq1Range.start - _;
       x(N), _ = y.seq1Range.endExclusive, E = y.seq2Range.endExclusive;
       const A = this.refineDiff(e, n, y, s, i);
-      A.hitTimeout && (b = !0);
+      A.hitTimeout && (p = !0);
       for (const R of A.mappings)
-        p.push(R);
+        b.push(R);
     }
     x(e.length - _);
-    const L = Ba(p, e, n);
+    const L = Ba(b, e, n);
     let v = [];
     return r.computeMoves && (v = this.computeMoves(L, e, n, l, c, s, i)), lr(() => {
       function y(A, R) {
@@ -7277,7 +7277,7 @@ class ch {
           return !1;
       }
       return !0;
-    }), new Hn(L, v, b);
+    }), new Hn(L, v, p);
   }
   computeMoves(e, n, r, s, i, a, o) {
     return Qf(e, n, r, s, i, a).map((h) => {
@@ -7316,13 +7316,13 @@ const qa = {
   getLegacy: () => new Pf(),
   getDefault: () => new ch()
 };
-function pt(t, e) {
+function bt(t, e) {
   const n = Math.pow(10, e);
   return Math.round(t * n) / n;
 }
 class ue {
   constructor(e, n, r, s = 1) {
-    this._rgbaBrand = void 0, this.r = Math.min(255, Math.max(0, e)) | 0, this.g = Math.min(255, Math.max(0, n)) | 0, this.b = Math.min(255, Math.max(0, r)) | 0, this.a = pt(Math.max(Math.min(1, s), 0), 3);
+    this._rgbaBrand = void 0, this.r = Math.min(255, Math.max(0, e)) | 0, this.g = Math.min(255, Math.max(0, n)) | 0, this.b = Math.min(255, Math.max(0, r)) | 0, this.a = bt(Math.max(Math.min(1, s), 0), 3);
   }
   static equals(e, n) {
     return e.r === n.r && e.g === n.g && e.b === n.b && e.a === n.a;
@@ -7330,7 +7330,7 @@ class ue {
 }
 class Fe {
   constructor(e, n, r, s) {
-    this._hslaBrand = void 0, this.h = Math.max(Math.min(360, e), 0) | 0, this.s = pt(Math.max(Math.min(1, n), 0), 3), this.l = pt(Math.max(Math.min(1, r), 0), 3), this.a = pt(Math.max(Math.min(1, s), 0), 3);
+    this._hslaBrand = void 0, this.h = Math.max(Math.min(360, e), 0) | 0, this.s = bt(Math.max(Math.min(1, n), 0), 3), this.l = bt(Math.max(Math.min(1, r), 0), 3), this.a = bt(Math.max(Math.min(1, s), 0), 3);
   }
   static equals(e, n) {
     return e.h === n.h && e.s === n.s && e.l === n.l && e.a === n.a;
@@ -7384,7 +7384,7 @@ class Fe {
 }
 class Wt {
   constructor(e, n, r, s) {
-    this._hsvaBrand = void 0, this.h = Math.max(Math.min(360, e), 0) | 0, this.s = pt(Math.max(Math.min(1, n), 0), 3), this.v = pt(Math.max(Math.min(1, r), 0), 3), this.a = pt(Math.max(Math.min(1, s), 0), 3);
+    this._hsvaBrand = void 0, this.h = Math.max(Math.min(360, e), 0) | 0, this.s = bt(Math.max(Math.min(1, n), 0), 3), this.v = bt(Math.max(Math.min(1, r), 0), 3), this.a = bt(Math.max(Math.min(1, s), 0), 3);
   }
   static equals(e, n) {
     return e.h === n.h && e.s === n.s && e.v === n.v && e.a === n.a;
@@ -7436,7 +7436,7 @@ let cr = class oe {
    */
   getRelativeLuminance() {
     const e = oe._relativeLuminanceForComponent(this.rgba.r), n = oe._relativeLuminanceForComponent(this.rgba.g), r = oe._relativeLuminanceForComponent(this.rgba.b), s = 0.2126 * e + 0.7152 * n + 0.0722 * r;
-    return pt(s, 4);
+    return bt(s, 4);
   }
   static _relativeLuminanceForComponent(e) {
     const n = e / 255;
@@ -7544,15 +7544,15 @@ let cr = class oe {
       }
       n.formatHSLA = a;
       function o(d) {
-        const b = d.toString(16);
-        return b.length !== 2 ? "0" + b : b;
+        const p = d.toString(16);
+        return p.length !== 2 ? "0" + p : p;
       }
       function l(d) {
         return `#${o(d.rgba.r)}${o(d.rgba.g)}${o(d.rgba.b)}`;
       }
       n.formatHex = l;
-      function c(d, b = !1) {
-        return b && d.rgba.a === 1 ? t.Format.CSS.formatHex(d) : `#${o(d.rgba.r)}${o(d.rgba.g)}${o(d.rgba.b)}${o(Math.round(d.rgba.a * 255))}`;
+      function c(d, p = !1) {
+        return p && d.rgba.a === 1 ? t.Format.CSS.formatHex(d) : `#${o(d.rgba.r)}${o(d.rgba.g)}${o(d.rgba.b)}${o(Math.round(d.rgba.a * 255))}`;
       }
       n.formatHexA = c;
       function h(d) {
@@ -7560,24 +7560,24 @@ let cr = class oe {
       }
       n.format = h;
       function f(d) {
-        const b = d.length;
-        if (b === 0 || d.charCodeAt(0) !== 35)
+        const p = d.length;
+        if (p === 0 || d.charCodeAt(0) !== 35)
           return null;
-        if (b === 7) {
-          const p = 16 * m(d.charCodeAt(1)) + m(d.charCodeAt(2)), x = 16 * m(d.charCodeAt(3)) + m(d.charCodeAt(4)), _ = 16 * m(d.charCodeAt(5)) + m(d.charCodeAt(6));
-          return new t(new ue(p, x, _, 1));
+        if (p === 7) {
+          const b = 16 * m(d.charCodeAt(1)) + m(d.charCodeAt(2)), x = 16 * m(d.charCodeAt(3)) + m(d.charCodeAt(4)), _ = 16 * m(d.charCodeAt(5)) + m(d.charCodeAt(6));
+          return new t(new ue(b, x, _, 1));
         }
-        if (b === 9) {
-          const p = 16 * m(d.charCodeAt(1)) + m(d.charCodeAt(2)), x = 16 * m(d.charCodeAt(3)) + m(d.charCodeAt(4)), _ = 16 * m(d.charCodeAt(5)) + m(d.charCodeAt(6)), E = 16 * m(d.charCodeAt(7)) + m(d.charCodeAt(8));
-          return new t(new ue(p, x, _, E / 255));
+        if (p === 9) {
+          const b = 16 * m(d.charCodeAt(1)) + m(d.charCodeAt(2)), x = 16 * m(d.charCodeAt(3)) + m(d.charCodeAt(4)), _ = 16 * m(d.charCodeAt(5)) + m(d.charCodeAt(6)), E = 16 * m(d.charCodeAt(7)) + m(d.charCodeAt(8));
+          return new t(new ue(b, x, _, E / 255));
         }
-        if (b === 4) {
-          const p = m(d.charCodeAt(1)), x = m(d.charCodeAt(2)), _ = m(d.charCodeAt(3));
-          return new t(new ue(16 * p + p, 16 * x + x, 16 * _ + _));
+        if (p === 4) {
+          const b = m(d.charCodeAt(1)), x = m(d.charCodeAt(2)), _ = m(d.charCodeAt(3));
+          return new t(new ue(16 * b + b, 16 * x + x, 16 * _ + _));
         }
-        if (b === 5) {
-          const p = m(d.charCodeAt(1)), x = m(d.charCodeAt(2)), _ = m(d.charCodeAt(3)), E = m(d.charCodeAt(4));
-          return new t(new ue(16 * p + p, 16 * x + x, 16 * _ + _, (16 * E + E) / 255));
+        if (p === 5) {
+          const b = m(d.charCodeAt(1)), x = m(d.charCodeAt(2)), _ = m(d.charCodeAt(3)), E = m(d.charCodeAt(4));
+          return new t(new ue(16 * b + b, 16 * x + x, 16 * _ + _, (16 * E + E) / 255));
         }
         return null;
       }
@@ -7721,8 +7721,8 @@ function mh(t) {
 function gh(t) {
   return !t || typeof t.getValue != "function" || typeof t.positionAt != "function" ? [] : mh(t);
 }
-const Ga = new RegExp("\\bMARK:\\s*(.*)$", "d"), bh = /^-+|-+$/g;
-function ph(t, e) {
+const Ga = new RegExp("\\bMARK:\\s*(.*)$", "d"), ph = /^-+|-+$/g;
+function bh(t, e) {
   let n = [];
   if (e.findRegionSectionHeaders && e.foldingRules?.markers) {
     const r = wh(t, e);
@@ -7778,7 +7778,7 @@ function xh(t, e, n) {
 function uu(t) {
   t = t.trim();
   const e = t.startsWith("-");
-  return t = t.replace(bh, ""), { text: t, hasSeparatorLine: e };
+  return t = t.replace(ph, ""), { text: t, hasSeparatorLine: e };
 }
 var ja;
 (function(t) {
@@ -8205,7 +8205,7 @@ class Eh {
   }
   async $findSectionHeaders(e, n) {
     const r = this._getModel(e);
-    return r ? ph(r, n) : [];
+    return r ? bh(r, n) : [];
   }
   // ---- BEGIN diff --------------------------------------------------------------------------
   async $computeDiff(e, n, r, s) {
@@ -8280,10 +8280,10 @@ class Eh {
         continue;
       }
       const m = Q1(f, c, r), d = s.offsetAt(H.lift(l).getStartPosition());
-      for (const b of m) {
-        const p = s.positionAt(d + b.originalStart), x = s.positionAt(d + b.originalStart + b.originalLength), _ = {
-          text: c.substr(b.modifiedStart, b.modifiedLength),
-          range: { startLineNumber: p.lineNumber, startColumn: p.column, endLineNumber: x.lineNumber, endColumn: x.column }
+      for (const p of m) {
+        const b = s.positionAt(d + p.originalStart), x = s.positionAt(d + p.originalStart + p.originalLength), _ = {
+          text: c.substr(p.modifiedStart, p.modifiedLength),
+          range: { startLineNumber: b.lineNumber, startColumn: b.column, endLineNumber: x.lineNumber, endColumn: x.column }
         };
         s.getValueInRange(_.range) !== _.text && i.push(_);
       }
@@ -8388,7 +8388,7 @@ class Zn extends Eh {
     }
   }
 }
-typeof importScripts == "function" && (globalThis.monaco = bf());
+typeof importScripts == "function" && (globalThis.monaco = pf());
 let ms = !1;
 function cu(t) {
   if (ms)
@@ -8492,7 +8492,7 @@ let Za = class gs {
     return n != null && typeof n.text == "string" && n.range === void 0 && n.rangeLength === void 0;
   }
 };
-var bs;
+var ps;
 (function(t) {
   function e(s, i, a, o) {
     return new Za(s, i, a, o);
@@ -8505,7 +8505,7 @@ var bs;
   }
   t.update = n;
   function r(s, i) {
-    const a = s.getText(), o = ps(i.map(Th), (h, f) => {
+    const a = s.getText(), o = bs(i.map(Th), (h, f) => {
       const m = h.range.start.line - f.range.start.line;
       return m === 0 ? h.range.start.character - f.range.start.character : m;
     });
@@ -8520,12 +8520,12 @@ var bs;
     return c.push(a.substr(l)), c.join("");
   }
   t.applyEdits = r;
-})(bs || (bs = {}));
-function ps(t, e) {
+})(ps || (ps = {}));
+function bs(t, e) {
   if (t.length <= 1)
     return t;
   const n = t.length / 2 | 0, r = t.slice(0, n), s = t.slice(n);
-  ps(r, e), ps(s, e);
+  bs(r, e), bs(s, e);
   let i = 0, a = 0, o = 0;
   for (; i < r.length && a < s.length; )
     e(r[i], s[a]) <= 0 ? t[o++] = r[i++] : t[o++] = s[a++];
@@ -9007,7 +9007,7 @@ var go;
   }
   t.create = e;
 })(go || (go = {}));
-var br;
+var pr;
 (function(t) {
   function e(r) {
     return r.replace(/[\\`*_{}[\]()#+\-.!]/g, "\\$&");
@@ -9018,22 +9018,22 @@ var br;
     return g.string(s) || g.objectLiteral(s) && g.string(s.language) && g.string(s.value);
   }
   t.is = n;
-})(br || (br = {}));
-var bo;
+})(pr || (pr = {}));
+var po;
 (function(t) {
   function e(n) {
     let r = n;
-    return !!r && g.objectLiteral(r) && (Nn.is(r.contents) || br.is(r.contents) || g.typedArray(r.contents, br.is)) && (n.range === void 0 || ae.is(n.range));
+    return !!r && g.objectLiteral(r) && (Nn.is(r.contents) || pr.is(r.contents) || g.typedArray(r.contents, pr.is)) && (n.range === void 0 || ae.is(n.range));
   }
   t.is = e;
-})(bo || (bo = {}));
-var po;
+})(po || (po = {}));
+var bo;
 (function(t) {
   function e(n, r) {
     return r ? { label: n, documentation: r } : { label: n };
   }
   t.create = e;
-})(po || (po = {}));
+})(bo || (bo = {}));
 var wo;
 (function(t) {
   function e(n, r, ...s) {
@@ -9104,10 +9104,10 @@ var Eo;
 (function(t) {
   t.Empty = "", t.QuickFix = "quickfix", t.Refactor = "refactor", t.RefactorExtract = "refactor.extract", t.RefactorInline = "refactor.inline", t.RefactorRewrite = "refactor.rewrite", t.Source = "source", t.SourceOrganizeImports = "source.organizeImports", t.SourceFixAll = "source.fixAll";
 })(Eo || (Eo = {}));
-var pr;
+var br;
 (function(t) {
   t.Invoked = 1, t.Automatic = 2;
-})(pr || (pr = {}));
+})(br || (br = {}));
 var To;
 (function(t) {
   function e(r, s, i) {
@@ -9117,7 +9117,7 @@ var To;
   t.create = e;
   function n(r) {
     let s = r;
-    return g.defined(s) && g.typedArray(s.diagnostics, dr.is) && (s.only === void 0 || g.typedArray(s.only, g.string)) && (s.triggerKind === void 0 || s.triggerKind === pr.Invoked || s.triggerKind === pr.Automatic);
+    return g.defined(s) && g.typedArray(s.diagnostics, dr.is) && (s.only === void 0 || g.typedArray(s.only, g.string)) && (s.triggerKind === void 0 || s.triggerKind === br.Invoked || s.triggerKind === br.Automatic);
   }
   t.is = n;
 })(To || (To = {}));
@@ -9454,8 +9454,8 @@ var g;
     return e.call(d) === "[object Number]";
   }
   t.number = a;
-  function o(d, b, p) {
-    return e.call(d) === "[object Number]" && b <= d && d <= p;
+  function o(d, p, b) {
+    return e.call(d) === "[object Number]" && p <= d && d <= b;
   }
   t.numberRange = o;
   function l(d) {
@@ -9474,8 +9474,8 @@ var g;
     return d !== null && typeof d == "object";
   }
   t.objectLiteral = f;
-  function m(d, b) {
-    return Array.isArray(d) && d.every(b);
+  function m(d, p) {
+    return Array.isArray(d) && d.every(p);
   }
   t.typedArray = m;
 })(g || (g = {}));
@@ -9588,8 +9588,8 @@ class Fh {
     return n;
   }
 }
-var be = /* @__PURE__ */ ((t) => (t.ARGS = "args", t.CLAUSES = "clauses", t.ELSE = "else", t.END = "end", t.EXPR = "expr", t.LEFT = "left", t.OPERAND = "operand", t.QUALIFIER = "qualifier", t.RIGHT = "right", t.START = "start", t.VALUE = "value", t))(be || {}), Q = /* @__PURE__ */ ((t) => (t.CASE_EXPRESSION = "case-expression", t.EXPRESSION_LIST = "expression-list", t.FUNCTION = "function", t.INTERVAL = "interval", t.INTERVAL_QUALIFIER = "interval-qualifier", t.WHEN_CLAUSE = "when-clause", t.UNARY_EXPRESSION = "unary-expression", t.BINARY_EXPRESSION = "binary-expression", t))(Q || {});
-const pe = {
+var pe = /* @__PURE__ */ ((t) => (t.ARGS = "args", t.CLAUSES = "clauses", t.ELSE = "else", t.END = "end", t.EXPR = "expr", t.LEFT = "left", t.OPERAND = "operand", t.QUALIFIER = "qualifier", t.RIGHT = "right", t.START = "start", t.VALUE = "value", t))(pe || {}), Q = /* @__PURE__ */ ((t) => (t.CASE_EXPRESSION = "case-expression", t.EXPRESSION_LIST = "expression-list", t.FUNCTION = "function", t.INTERVAL = "interval", t.INTERVAL_QUALIFIER = "interval-qualifier", t.WHEN_CLAUSE = "when-clause", t.UNARY_EXPRESSION = "unary-expression", t.BINARY_EXPRESSION = "binary-expression", t))(Q || {});
+const be = {
   "case-expression": [
     "clauses",
     "operand",
@@ -9994,7 +9994,7 @@ const zh = (t) => {
     "real"
   ], a = /* @__PURE__ */ new Set([r, s]);
   return !!(a.size === 2 && a.has("interval") && i.some((o) => a.has(o)));
-}, bu = (t) => {
+}, pu = (t) => {
   switch (t.toLowerCase()) {
     case "integer":
     case "double":
@@ -10079,14 +10079,14 @@ const zh = (t) => {
 }, yt = (t, e, n, r) => {
   const s = Tt(t, r);
   let i = s.toUpperCase() === e;
-  if (e === "NUMBER" && (i = bu(s)), !i) {
+  if (e === "NUMBER" && (i = pu(s)), !i) {
     const a = Le(_e.TypeNotAssignable, {
       providedType: je(s),
       expectedType: je(e.toLowerCase())
     });
     ge(a, t.location, n, !0);
   }
-}, pu = (t) => t.variables ? t.variables.find(
+}, bu = (t) => t.variables ? t.variables.find(
   (n) => n.name === "$layer" && n.type === "dictionary"
 )?.properties ?? [] : [];
 let Vr;
@@ -10275,7 +10275,7 @@ function vu(t, e, n) {
     }) : r[s] = a.slice())) : a && typeof a == "object" ? r[s] = vu(i, a, n) : r.hasOwnProperty(s) && !e.hasOwnProperty(s) || (r[s] = a), r);
   }, t || {}) : t;
 }
-const ld = "20250517", ut = { apiKey: void 0, apiKeys: { scopes: [] }, applicationName: "", applicationUrl: globalThis.location?.href, assetsPath: "", fontsUrl: "https://static.arcgis.com/fonts", geometryServiceUrl: "https://utility.arcgisonline.com/arcgis/rest/services/Geometry/GeometryServer", geoRSSServiceUrl: "https://utility.arcgis.com/sharing/rss", kmlServiceUrl: "https://utility.arcgis.com/sharing/kml", userPrivilegesApplied: !0, portalUrl: "https://www.arcgis.com", respectPrefersReducedMotion: !0, routeServiceUrl: "https://route-api.arcgis.com/arcgis/rest/services/World/Route/NAServer/Route_World", workers: { loaderConfig: { has: {}, paths: {}, map: {}, packages: [] } }, request: { crossOriginNoCorsDomains: null, httpsDomains: ["arcgis.com", "arcgisonline.com", "esrikr.com", "premiumservices.blackbridge.com", "esripremium.accuweather.com", "gbm.digitalglobe.com", "firstlook.digitalglobe.com", "msi.digitalglobe.com"], interceptors: [], internalInterceptors: [], maxUrlLength: 2e3, priority: "high", proxyRules: [], proxyUrl: null, timeout: 62e3, trustedServers: [], useIdentity: !0 }, log: { interceptors: [], level: null } };
+const ld = "20250519", ut = { apiKey: void 0, apiKeys: { scopes: [] }, applicationName: "", applicationUrl: globalThis.location?.href, assetsPath: "", fontsUrl: "https://static.arcgis.com/fonts", geometryServiceUrl: "https://utility.arcgisonline.com/arcgis/rest/services/Geometry/GeometryServer", geoRSSServiceUrl: "https://utility.arcgis.com/sharing/rss", kmlServiceUrl: "https://utility.arcgis.com/sharing/kml", userPrivilegesApplied: !0, portalUrl: "https://www.arcgis.com", respectPrefersReducedMotion: !0, routeServiceUrl: "https://route-api.arcgis.com/arcgis/rest/services/World/Route/NAServer/Route_World", workers: { loaderConfig: { has: {}, paths: {}, map: {}, packages: [] } }, request: { crossOriginNoCorsDomains: null, httpsDomains: ["arcgis.com", "arcgisonline.com", "esrikr.com", "premiumservices.blackbridge.com", "esripremium.accuweather.com", "gbm.digitalglobe.com", "firstlook.digitalglobe.com", "msi.digitalglobe.com"], interceptors: [], internalInterceptors: [], maxUrlLength: 2e3, priority: "high", proxyRules: [], proxyUrl: null, timeout: 62e3, trustedServers: [], useIdentity: !0 }, log: { interceptors: [], level: null } };
 if (globalThis.esriConfig && (od(ut, globalThis.esriConfig, !0), delete ut.has), !ut.assetsPath) {
   {
     const t = "4.33.0";
@@ -10438,12 +10438,12 @@ function gd(t, e, n) {
 }
 class At extends Error {
 }
-class bd extends At {
+class pd extends At {
   constructor(e) {
     super(`Invalid DateTime: ${e.toMessage()}`);
   }
 }
-class pd extends At {
+class bd extends At {
   constructor(e) {
     super(`Invalid Interval: ${e.toMessage()}`);
   }
@@ -10874,8 +10874,8 @@ class Ge extends tn {
       millisecond: 0
     });
     let d = +n;
-    const b = d % 1e3;
-    return d -= b >= 0 ? b : 1e3 + b, (m - d) / (60 * 1e3);
+    const p = d % 1e3;
+    return d -= p >= 0 ? p : 1e3 + p, (m - d) / (60 * 1e3);
   }
   /**
    * Return whether this Zone is equal to another zone
@@ -11746,11 +11746,11 @@ function Tr(t) {
   );
   return t.year < 100 && t.year >= 0 && (e = new Date(e), e.setUTCFullYear(t.year, t.month - 1, t.day)), +e;
 }
-function bl(t, e, n) {
+function pl(t, e, n) {
   return -ti(ei(t, 1, e), n) + e - 1;
 }
 function Sn(t, e = 4, n = 1) {
-  const r = bl(t, e, n), s = bl(t + 1, e, n);
+  const r = pl(t, e, n), s = pl(t + 1, e, n);
   return (zt(t) - r + s) / 7;
 }
 function Bs(t) {
@@ -11923,7 +11923,7 @@ function i0(t, e, n = "always", r = !1) {
   const a = Object.is(e, -0) || e < 0, o = Math.abs(e), l = o === 1, c = s[t], h = r ? l ? c[1] : c[2] || c[1] : l ? s[t][0] : t;
   return a ? `${o} ${h} ago` : `in ${o} ${h}`;
 }
-function pl(t, e) {
+function bl(t, e) {
   let n = "";
   for (const r of t)
     r.literal ? n += r.val : n += e(r.val);
@@ -11995,12 +11995,12 @@ class ye {
     return n > 0 && (r.padTo = n), this.loc.numberFormatter(r).format(e);
   }
   formatDateTimeFromString(e, n) {
-    const r = this.loc.listingMode() === "en", s = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory", i = (d, b) => this.loc.extract(e, d, b), a = (d) => e.isOffsetFixed && e.offset === 0 && d.allowZ ? "Z" : e.isValid ? e.zone.formatOffset(e.ts, d.format) : "", o = () => r ? t0(e) : i({ hour: "numeric", hourCycle: "h12" }, "dayperiod"), l = (d, b) => r ? r0(e, d) : i(b ? { month: d } : { month: d, day: "numeric" }, "month"), c = (d, b) => r ? n0(e, d) : i(
-      b ? { weekday: d } : { weekday: d, month: "long", day: "numeric" },
+    const r = this.loc.listingMode() === "en", s = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory", i = (d, p) => this.loc.extract(e, d, p), a = (d) => e.isOffsetFixed && e.offset === 0 && d.allowZ ? "Z" : e.isValid ? e.zone.formatOffset(e.ts, d.format) : "", o = () => r ? t0(e) : i({ hour: "numeric", hourCycle: "h12" }, "dayperiod"), l = (d, p) => r ? r0(e, d) : i(p ? { month: d } : { month: d, day: "numeric" }, "month"), c = (d, p) => r ? n0(e, d) : i(
+      p ? { weekday: d } : { weekday: d, month: "long", day: "numeric" },
       "weekday"
     ), h = (d) => {
-      const b = ye.macroTokenToFormatOpts(d);
-      return b ? this.formatWithSystemDefault(e, b) : d;
+      const p = ye.macroTokenToFormatOpts(d);
+      return p ? this.formatWithSystemDefault(e, p) : d;
     }, f = (d) => r ? s0(e, d) : i({ era: d }, "era"), m = (d) => {
       switch (d) {
         // ms
@@ -12144,7 +12144,7 @@ class ye {
           return h(d);
       }
     };
-    return pl(ye.parseFormat(n), m);
+    return bl(ye.parseFormat(n), m);
   }
   formatDurationFromString(e, n) {
     const r = (l) => {
@@ -12175,7 +12175,7 @@ class ye {
       (l, { literal: c, val: h }) => c ? l : l.concat(h),
       []
     ), o = e.shiftTo(...a.map(r).filter((l) => l));
-    return pl(i, s(o));
+    return bl(i, s(o));
   }
 }
 const cc = /[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;
@@ -12241,9 +12241,9 @@ function kn(t, e) {
   const n = t[e] ? Ge.create(t[e]) : null;
   return [{}, n, e + 1];
 }
-const b0 = RegExp(`^T?${si.source}$`), p0 = /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
+const p0 = RegExp(`^T?${si.source}$`), b0 = /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
 function w0(t) {
-  const [e, n, r, s, i, a, o, l, c] = t, h = e[0] === "-", f = l && l[0] === "-", m = (d, b = !1) => d !== void 0 && (b || d && h) ? -d : d;
+  const [e, n, r, s, i, a, o, l, c] = t, h = e[0] === "-", f = l && l[0] === "-", m = (d, p = !1) => d !== void 0 && (p || d && h) ? -d : d;
   return [
     {
       years: m(xt(n)),
@@ -12350,11 +12350,11 @@ function O0(t) {
   );
 }
 function P0(t) {
-  return sn(t, [p0, w0]);
+  return sn(t, [b0, w0]);
 }
 const U0 = rn(an);
 function V0(t) {
-  return sn(t, [b0, U0]);
+  return sn(t, [p0, U0]);
 }
 const $0 = nn(d0, m0), W0 = nn(mc), B0 = rn(
   an,
@@ -12368,7 +12368,7 @@ function q0(t) {
     [W0, B0]
   );
 }
-const yl = "Invalid Duration", bc = {
+const yl = "Invalid Duration", pc = {
   weeks: {
     days: 7,
     hours: 7 * 24,
@@ -12413,7 +12413,7 @@ const yl = "Invalid Duration", bc = {
     seconds: 30 * 24 * 60 * 60,
     milliseconds: 30 * 24 * 60 * 60 * 1e3
   },
-  ...bc
+  ...pc
 }, Me = 146097 / 400, Ot = 146097 / 4800, z0 = {
   years: {
     quarters: 4,
@@ -12442,7 +12442,7 @@ const yl = "Invalid Duration", bc = {
     seconds: Ot * 24 * 60 * 60,
     milliseconds: Ot * 24 * 60 * 60 * 1e3
   },
-  ...bc
+  ...pc
 }, Lt = [
   "years",
   "quarters",
@@ -12463,14 +12463,14 @@ function it(t, e, n = !1) {
   };
   return new z(r);
 }
-function pc(t, e) {
+function bc(t, e) {
   let n = e.milliseconds ?? 0;
   for (const r of G0.slice(1))
     e[r] && (n += e[r] * t[r].milliseconds);
   return n;
 }
 function xl(t, e) {
-  const n = pc(t, e) < 0 ? -1 : 1;
+  const n = bc(t, e) < 0 ? -1 : 1;
   Lt.reduceRight((r, s) => {
     if (O(e[s]))
       return r;
@@ -12799,7 +12799,7 @@ class z {
    * @return {number}
    */
   toMillis() {
-    return this.isValid ? pc(this.matrix, this.values) : NaN;
+    return this.isValid ? bc(this.matrix, this.values) : NaN;
   }
   /**
    * Returns an milliseconds value of this Duration. Alias of {@link toMillis}
@@ -13100,7 +13100,7 @@ class te {
       throw new we("need to specify a reason the Interval is invalid");
     const r = e instanceof He ? e : new He(e, n);
     if (re.throwOnInvalid)
-      throw new pd(r);
+      throw new bd(r);
     return new te({ invalid: r });
   }
   /**
@@ -13771,7 +13771,7 @@ function em(t) {
   return t.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");
 }
 function tm(t, e) {
-  const n = Ue(e), r = Ue(e, "{2}"), s = Ue(e, "{3}"), i = Ue(e, "{4}"), a = Ue(e, "{6}"), o = Ue(e, "{1,2}"), l = Ue(e, "{1,3}"), c = Ue(e, "{1,6}"), h = Ue(e, "{1,9}"), f = Ue(e, "{2,4}"), m = Ue(e, "{4,6}"), d = (x) => ({ regex: RegExp(em(x.val)), deser: ([_]) => _, literal: !0 }), p = ((x) => {
+  const n = Ue(e), r = Ue(e, "{2}"), s = Ue(e, "{3}"), i = Ue(e, "{4}"), a = Ue(e, "{6}"), o = Ue(e, "{1,2}"), l = Ue(e, "{1,3}"), c = Ue(e, "{1,6}"), h = Ue(e, "{1,9}"), f = Ue(e, "{2,4}"), m = Ue(e, "{4,6}"), d = (x) => ({ regex: RegExp(em(x.val)), deser: ([_]) => _, literal: !0 }), b = ((x) => {
     if (t.literal)
       return d(x);
     switch (x.val) {
@@ -13894,7 +13894,7 @@ function tm(t, e) {
   })(t) || {
     invalidReason: X0
   };
-  return p.token = t, p;
+  return b.token = t, b;
 }
 const nm = {
   year: {
@@ -14247,7 +14247,7 @@ function El(t) {
       return gm(t);
   }
 }
-function bm(t) {
+function pm(t) {
   if (gn === void 0 && (gn = re.now()), t.type !== "iana")
     return t.offset(gn);
   const e = t.name;
@@ -14268,7 +14268,7 @@ function Tl(t, e) {
     const a = Xu(t) || Qu(t);
     if (a)
       return D.invalid(a);
-    const o = bm(n);
+    const o = pm(n);
     [s, i] = Yn(t, o, n);
   }
   return new D({ ts: s, zone: n, loc: r, o: i });
@@ -14471,25 +14471,25 @@ class D {
     const r = ht(n.zone, re.defaultZone);
     if (!r.isValid)
       return D.invalid(mn(r));
-    const s = j.fromObject(n), i = vr(e, El), { minDaysInFirstWeek: a, startOfWeek: o } = ml(i, s), l = re.now(), c = O(n.specificOffset) ? r.offset(l) : n.specificOffset, h = !O(i.ordinal), f = !O(i.year), m = !O(i.month) || !O(i.day), d = f || m, b = i.weekYear || i.weekNumber;
-    if ((d || h) && b)
+    const s = j.fromObject(n), i = vr(e, El), { minDaysInFirstWeek: a, startOfWeek: o } = ml(i, s), l = re.now(), c = O(n.specificOffset) ? r.offset(l) : n.specificOffset, h = !O(i.ordinal), f = !O(i.year), m = !O(i.month) || !O(i.day), d = f || m, p = i.weekYear || i.weekNumber;
+    if ((d || h) && p)
       throw new Bt(
         "Can't mix weekYear/weekNumber units with year/month/day or ordinals"
       );
     if (m && h)
       throw new Bt("Can't mix ordinal dates with month/day");
-    const p = b || i.weekday && !d;
+    const b = p || i.weekday && !d;
     let x, _, E = Vn(l, c);
-    p ? (x = dm, _ = fm, E = yr(E, a, o)) : h ? (x = mm, _ = hm, E = qr(E)) : (x = Ec, _ = Lc);
+    b ? (x = dm, _ = fm, E = yr(E, a, o)) : h ? (x = mm, _ = hm, E = qr(E)) : (x = Ec, _ = Lc);
     let L = !1;
     for (const K of x) {
       const q = i[K];
       O(q) ? L ? i[K] = _[K] : i[K] = E[K] : L = !0;
     }
-    const v = p ? Bd(i, a, o) : h ? qd(i) : Xu(i), y = v || Qu(i);
+    const v = b ? Bd(i, a, o) : h ? qd(i) : Xu(i), y = v || Qu(i);
     if (y)
       return D.invalid(y);
-    const N = p ? hl(i, a, o) : h ? dl(i) : i, [A, R] = Yn(N, c, r), W = new D({
+    const N = b ? hl(i, a, o) : h ? dl(i) : i, [A, R] = Yn(N, c, r), W = new D({
       ts: A,
       zone: r,
       o: R,
@@ -14626,7 +14626,7 @@ class D {
       throw new we("need to specify a reason the DateTime is invalid");
     const r = e instanceof He ? e : new He(e, n);
     if (re.throwOnInvalid)
-      throw new bd(r);
+      throw new pd(r);
     return new D({ invalid: r });
   }
   /**
@@ -15862,11 +15862,11 @@ class oi {
     this.instance = new Ge("Etc/UTC");
   }
 }
-function pm(t) {
+function bm(t) {
   return t instanceof tn ? t === oi.instance : t?.toString().toLowerCase() === "unknown";
 }
-function bg(t) {
-  return pm(t) ? oi.instance : t;
+function pg(t) {
+  return bm(t) ? oi.instance : t;
 }
 function wm(t) {
   return t && typeof t == "object" && "toJSON" in t && typeof t.toJSON == "function";
@@ -15880,7 +15880,7 @@ function Tc(t, e) {
   const n = /* @__PURE__ */ new Set();
   return Cl(n, t), Cl(n, e), n;
 }
-function pg(t) {
+function bg(t) {
   return typeof t == "number";
 }
 function Ac(t) {
@@ -16133,21 +16133,21 @@ function Qm(t, e) {
     return -1;
   switch (e.type) {
     case Q.CASE_EXPRESSION:
-      return be.ELSE;
+      return pe.ELSE;
     case Q.WHEN_CLAUSE:
-      return t === e.operand ? be.OPERAND : t === e.value ? be.VALUE : -1;
+      return t === e.operand ? pe.OPERAND : t === e.value ? pe.VALUE : -1;
     case Q.UNARY_EXPRESSION:
-      return be.EXPR;
+      return pe.EXPR;
     case Q.BINARY_EXPRESSION:
-      return t === e.left ? be.LEFT : t === e.right ? be.RIGHT : -1;
+      return t === e.left ? pe.LEFT : t === e.right ? pe.RIGHT : -1;
     case Q.FUNCTION:
       return e.args.value.findIndex((n) => n === t);
     case Q.INTERVAL:
-      return t === e.value ? be.VALUE : t === e.qualifier ? be.QUALIFIER : -1;
+      return t === e.value ? pe.VALUE : t === e.qualifier ? pe.QUALIFIER : -1;
     case Q.INTERVAL_QUALIFIER:
-      return t === e.start ? be.START : t === e.end ? be.END : -1;
+      return t === e.start ? pe.START : t === e.end ? pe.END : -1;
     case Q.EXPRESSION_LIST:
-      return be.VALUE;
+      return pe.VALUE;
     default:
       return -1;
   }
@@ -16194,7 +16194,7 @@ const tg = ["+", "-", "*", "/", "||"], ng = [
 class rg {
   // #endregion
   constructor(e, n) {
-    this.callStack = [], this._fields = [], this.markers = [], this._sdkFunctions = e.flatMap((r) => r.items), this._fields = n.profile ? pu(n.profile) : [];
+    this.callStack = [], this._fields = [], this.markers = [], this._sdkFunctions = e.flatMap((r) => r.items), this._fields = n.profile ? bu(n.profile) : [];
   }
   // #region Public Methods
   /**
@@ -16294,7 +16294,7 @@ class rg {
                 ge(o, i.location, this.markers, !0);
                 return;
               }
-              bu(a) && (a = "number"), r.has(a) || r.add(a);
+              pu(a) && (a = "number"), r.has(a) || r.add(a);
             }
           }), r.size > 1) {
             const i = Array.from(r), a = Le(_e.IncompatibleListDataType, {
@@ -16489,14 +16489,14 @@ class rg {
       switch (e.type) {
         case Q.CASE_EXPRESSION:
           {
-            const n = pe[e.type];
+            const n = be[e.type];
             e.format === "simple" ? n.forEach((r) => {
               const s = e[r];
               s && (Array.isArray(s) ? s.forEach((i) => {
                 this.traverse(i);
               }) : this.traverse(s));
             }) : e.format === "searched" && n.forEach((r) => {
-              if (r === be.OPERAND)
+              if (r === pe.OPERAND)
                 return;
               const s = e[r];
               s && (Array.isArray(s) ? s.forEach((i) => {
@@ -16506,13 +16506,13 @@ class rg {
           }
           break;
         case Q.WHEN_CLAUSE:
-          pe[e.type].forEach((r) => {
+          be[e.type].forEach((r) => {
             const s = e[r];
             this.traverse(s);
           });
           break;
         case Q.EXPRESSION_LIST:
-          pe[e.type].forEach((r) => {
+          be[e.type].forEach((r) => {
             const s = e[r];
             Array.isArray(s) ? s.forEach((i) => {
               this.traverse(i);
@@ -16520,31 +16520,31 @@ class rg {
           });
           break;
         case Q.UNARY_EXPRESSION:
-          pe[e.type].forEach((r) => {
+          be[e.type].forEach((r) => {
             const s = e[r];
             Array.isArray(s) && this.traverse(s);
           });
           break;
         case Q.BINARY_EXPRESSION:
-          pe[e.type].forEach((r) => {
+          be[e.type].forEach((r) => {
             const s = e[r];
             this.traverse(s);
           });
           break;
         case Q.FUNCTION:
-          pe[e.type].forEach((r) => {
+          be[e.type].forEach((r) => {
             const s = e[r];
             this.traverse(s);
           });
           break;
         case Q.INTERVAL:
-          pe[e.type].forEach((r) => {
+          be[e.type].forEach((r) => {
             const s = e[r];
             this.traverse(s);
           });
           break;
         case Q.INTERVAL_QUALIFIER:
-          pe[e.type].forEach((r) => {
+          be[e.type].forEach((r) => {
             const s = e[r];
             this.traverse(s);
           });
@@ -16651,10 +16651,10 @@ class ig {
         this._getCompletionsFromFunction(i, a, e);
         break;
       case "interval":
-        if (a === be.QUALIFIER) {
+        if (a === pe.QUALIFIER) {
           this._suggestDatePeriods(e);
           break;
-        } else if (a === be.VALUE)
+        } else if (a === pe.VALUE)
           break;
         break;
       case "binary-expression":
@@ -16927,14 +16927,14 @@ class ig {
       switch (e.type) {
         case Q.CASE_EXPRESSION:
           {
-            const r = pe[e.type];
+            const r = be[e.type];
             e.format === "simple" ? r.forEach((s) => {
               const i = e[s];
               i && (Array.isArray(i) ? i.forEach((a) => {
                 this.traverse(a, n);
               }) : this.traverse(i, n));
             }) : e.format === "searched" && r.forEach((s) => {
-              if (s === be.OPERAND)
+              if (s === pe.OPERAND)
                 return;
               const i = e[s];
               i && (Array.isArray(i) ? i.forEach((a) => {
@@ -16944,44 +16944,44 @@ class ig {
           }
           break;
         case Q.WHEN_CLAUSE:
-          pe[e.type].forEach((s) => {
+          be[e.type].forEach((s) => {
             const i = e[s];
             this.traverse(i, n);
           });
           break;
         case Q.EXPRESSION_LIST:
-          pe[e.type].forEach((s) => {
+          be[e.type].forEach((s) => {
             e[s].forEach((a) => {
               this.traverse(a, n);
             });
           });
           break;
         case Q.UNARY_EXPRESSION:
-          pe[e.type].forEach((s) => {
+          be[e.type].forEach((s) => {
             const i = e[s];
             Array.isArray(i) && this.traverse(i, n);
           });
           break;
         case Q.BINARY_EXPRESSION:
-          pe[e.type].forEach((s) => {
+          be[e.type].forEach((s) => {
             const i = e[s];
             this.traverse(i, n);
           });
           break;
         case Q.FUNCTION:
-          pe[e.type].forEach((s) => {
+          be[e.type].forEach((s) => {
             const i = e[s];
             this.traverse(i, n);
           });
           break;
         case Q.INTERVAL:
-          pe[e.type].forEach((s) => {
+          be[e.type].forEach((s) => {
             const i = e[s];
             this.traverse(i, n);
           });
           break;
         case Q.INTERVAL_QUALIFIER:
-          pe[e.type].forEach((s) => {
+          be[e.type].forEach((s) => {
             const i = e[s];
             this.traverse(i, n);
           });
@@ -17023,7 +17023,7 @@ class ag {
     const i = this._getTextDocument(e);
     if (!i)
       return await Promise.resolve({ suggestions: [] });
-    const a = i.getText(), o = await this.getApiDatabase(s), l = s.profile ? pu(s.profile) : [], h = await new ig(o, l).getCompletions({ range: n, modelContent: a, position: r });
+    const a = i.getText(), o = await this.getApiDatabase(s), l = s.profile ? bu(s.profile) : [], h = await new ig(o, l).getCompletions({ range: n, modelContent: a, position: r });
     return await Promise.resolve({ suggestions: h });
   }
   // async doFormat(modelId: string /*context: ApiContext*/): Promise<TextEdit[]> {
@@ -17044,7 +17044,7 @@ class ag {
     const n = this._ctx.getMirrorModels();
     for (const r of n)
       if (r.uri.toString() === e)
-        return bs.create(e, this._languageId, r.version, r.getValue());
+        return ps.create(e, this._languageId, r.version, r.getValue());
     return null;
   }
 }
@@ -17056,16 +17056,16 @@ export {
   Kt as a,
   hg as b,
   dg as c,
-  bg as d,
+  pg as d,
   md as e,
   Ac as f,
-  pm as g,
+  bm as g,
   w as h,
   _u as i,
   fg as j,
   mg as k,
   wg as l,
-  pg as n,
+  bg as n,
   oi as o,
   ut as r,
   Nu as s,