eddyter 1.3.60 → 1.3.62

package/dist/{standalone-2029bc8b.js → standalone-C0qguT38.js}

@@ -1,75 +1,63 @@
-var vt = Object.defineProperty;
-var Bt = (e, u, t) => u in e ? vt(e, u, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[u] = t;
-var fe = (e, u, t) => (Bt(e, typeof u != "symbol" ? u + "" : u, t), t);
-var bt = Object.create, Ve = Object.defineProperty, At = Object.getOwnPropertyDescriptor, wt = Object.getOwnPropertyNames, kt = Object.getPrototypeOf, St = Object.prototype.hasOwnProperty, Tu = (e) => {
+var yt = Object.create, Me = Object.defineProperty, vt = Object.getOwnPropertyDescriptor, Bt = Object.getOwnPropertyNames, bt = Object.getPrototypeOf, At = Object.prototype.hasOwnProperty, ju = (e) => {
   throw TypeError(e);
-}, xt = (e, u) => () => (u || e((u = { exports: {} }).exports, u), u.exports), ze = (e, u) => {
-  for (var t in u)
-    Ve(e, t, { get: u[t], enumerable: !0 });
-}, Nt = (e, u, t, r) => {
-  if (u && typeof u == "object" || typeof u == "function")
-    for (let n of wt(u))
-      !St.call(e, n) && n !== t && Ve(e, n, { get: () => u[n], enumerable: !(r = At(u, n)) || r.enumerable });
+}, wt = (e, u) => () => (u || e((u = { exports: {} }).exports, u), u.exports), Ve = (e, u) => {
+  for (var t in u) Me(e, t, { get: u[t], enumerable: !0 });
+}, kt = (e, u, t, r) => {
+  if (u && typeof u == "object" || typeof u == "function") for (let n of Bt(u)) !At.call(e, n) && n !== t && Me(e, n, { get: () => u[n], enumerable: !(r = vt(u, n)) || r.enumerable });
   return e;
-}, Ot = (e, u, t) => (t = e != null ? bt(kt(e)) : {}, Nt(u || !e || !e.__esModule ? Ve(t, "default", { value: e, enumerable: !0 }) : t, e)), _t = (e, u, t) => u.has(e) || Tu("Cannot " + t), jt = (e, u, t) => u.has(e) ? Tu("Cannot add the same private member more than once") : u instanceof WeakSet ? u.add(e) : u.set(e, t), De = (e, u, t) => (_t(e, u, "access private method"), t), Tt = xt((e) => {
+}, St = (e, u, t) => (t = e != null ? yt(bt(e)) : {}, kt(Me(t, "default", { value: e, enumerable: !0 }), e)), xt = (e, u, t) => u.has(e) || ju("Cannot " + t), Nt = (e, u, t) => u.has(e) ? ju("Cannot add the same private member more than once") : u instanceof WeakSet ? u.add(e) : u.set(e, t), De = (e, u, t) => (xt(e, u, "access private method"), t), Ot = wt((e) => {
   Object.defineProperty(e, "__esModule", { value: !0 });
   function u() {
     return new Proxy({}, { get: () => (D) => D });
   }
   var t = /\r\n|[\n\r\u2028\u2029]/;
-  function r(D, i, o) {
-    let a = Object.assign({ column: 0, line: -1 }, D.start), s = Object.assign({}, a, D.end), { linesAbove: c = 2, linesBelow: F = 3 } = o || {}, l = a.line, d = a.column, f = s.line, h = s.column, p = Math.max(l - (c + 1), 0), C = Math.min(i.length, f + F);
-    l === -1 && (p = 0), f === -1 && (C = i.length);
+  function r(D, a, i) {
+    let o = Object.assign({ column: 0, line: -1 }, D.start), s = Object.assign({}, o, D.end), { linesAbove: c = 2, linesBelow: F = 3 } = i || {}, l = o.line, d = o.column, f = s.line, h = s.column, p = Math.max(l - (c + 1), 0), C = Math.min(a.length, f + F);
+    l === -1 && (p = 0), f === -1 && (C = a.length);
     let E = f - l, m = {};
-    if (E)
-      for (let y = 0; y <= E; y++) {
-        let g = y + l;
-        if (!d)
-          m[g] = !0;
-        else if (y === 0) {
-          let B = i[g - 1].length;
-          m[g] = [d, B - d + 1];
-        } else if (y === E)
-          m[g] = [0, h];
-        else {
-          let B = i[g - y].length;
-          m[g] = [0, B];
-        }
+    if (E) for (let y = 0; y <= E; y++) {
+      let g = y + l;
+      if (!d) m[g] = !0;
+      else if (y === 0) {
+        let B = a[g - 1].length;
+        m[g] = [d, B - d + 1];
+      } else if (y === E) m[g] = [0, h];
+      else {
+        let B = a[g - y].length;
+        m[g] = [0, B];
       }
-    else
-      d === h ? d ? m[l] = [d, 0] : m[l] = !0 : m[l] = [d, h - d];
+    }
+    else d === h ? d ? m[l] = [d, 0] : m[l] = !0 : m[l] = [d, h - d];
     return { start: p, end: C, markerLines: m };
   }
-  function n(D, i, o = {}) {
-    let a = u(), s = D.split(t), { start: c, end: F, markerLines: l } = r(i, s, o), d = i.start && typeof i.start.column == "number", f = String(F).length, h = D.split(t, F).slice(c, F).map((p, C) => {
+  function n(D, a, i = {}) {
+    let o = u(), s = D.split(t), { start: c, end: F, markerLines: l } = r(a, s, i), d = a.start && typeof a.start.column == "number", f = String(F).length, h = D.split(t, F).slice(c, F).map((p, C) => {
       let E = c + 1 + C, m = ` ${` ${E}`.slice(-f)} |`, y = l[E], g = !l[E + 1];
       if (y) {
         let B = "";
         if (Array.isArray(y)) {
-          let W = p.slice(0, Math.max(y[0] - 1, 0)).replace(/[^\t]/g, " "), ce = y[1] || 1;
+          let M = p.slice(0, Math.max(y[0] - 1, 0)).replace(/[^\t]/g, " "), ce = y[1] || 1;
           B = [`
- `, a.gutter(m.replace(/\d/g, " ")), " ", W, a.marker("^").repeat(ce)].join(""), g && o.message && (B += " " + a.message(o.message));
+ `, o.gutter(m.replace(/\d/g, " ")), " ", M, o.marker("^").repeat(ce)].join(""), g && i.message && (B += " " + o.message(i.message));
         }
-        return [a.marker(">"), a.gutter(m), p.length > 0 ? ` ${p}` : "", B].join("");
-      } else
-        return ` ${a.gutter(m)}${p.length > 0 ? ` ${p}` : ""}`;
+        return [o.marker(">"), o.gutter(m), p.length > 0 ? ` ${p}` : "", B].join("");
+      } else return ` ${o.gutter(m)}${p.length > 0 ? ` ${p}` : ""}`;
     }).join(`
 `);
-    return o.message && !d && (h = `${" ".repeat(f + 1)}${o.message}
+    return i.message && !d && (h = `${" ".repeat(f + 1)}${i.message}
 ${h}`), h;
   }
   e.codeFrameColumns = n;
-}), It = {};
-ze(It, { __debug: () => KD, check: () => GD, doc: () => Ct, format: () => gt, formatWithCursor: () => Et, getSupportInfo: () => HD, util: () => mt, version: () => yD });
-var Pt = (e, u, t, r) => {
-  if (!(e && u == null))
-    return u.replaceAll ? u.replaceAll(t, r) : t.global ? u.replace(t, r) : u.split(t).join(r);
-}, Ee = Pt, $t = class {
+}), _t = {};
+Ve(_t, { __debug: () => JD, check: () => qD, doc: () => ht, format: () => Et, formatWithCursor: () => mt, getSupportInfo: () => UD, util: () => Ct, version: () => mD });
+var jt = (e, u, t, r) => {
+  if (!(e && u == null)) return u.replaceAll ? u.replaceAll(t, r) : t.global ? u.replace(t, r) : u.split(t).join(r);
+}, me = jt, Tt = class {
   diff(e, u, t = {}) {
     let r;
     typeof t == "function" ? (r = t, t = {}) : "callback" in t && (r = t.callback);
-    let n = this.castInput(e, t), D = this.castInput(u, t), i = this.removeEmpty(this.tokenize(n, t)), o = this.removeEmpty(this.tokenize(D, t));
-    return this.diffWithOptionsObj(i, o, t, r);
+    let n = this.castInput(e, t), D = this.castInput(u, t), a = this.removeEmpty(this.tokenize(n, t)), i = this.removeEmpty(this.tokenize(D, t));
+    return this.diffWithOptionsObj(a, i, t, r);
   }
   diffWithOptionsObj(e, u, t, r) {
     var n;
@@ -79,65 +67,56 @@ var Pt = (e, u, t, r) => {
           r(C);
         }, 0);
         return;
-      } else
-        return C;
-    }, i = u.length, o = e.length, a = 1, s = i + o;
+      } else return C;
+    }, a = u.length, i = e.length, o = 1, s = a + i;
     t.maxEditLength != null && (s = Math.min(s, t.maxEditLength));
     let c = (n = t.timeout) !== null && n !== void 0 ? n : 1 / 0, F = Date.now() + c, l = [{ oldPos: -1, lastComponent: void 0 }], d = this.extractCommon(l[0], u, e, 0, t);
-    if (l[0].oldPos + 1 >= o && d + 1 >= i)
-      return D(this.buildValues(l[0].lastComponent, u, e));
+    if (l[0].oldPos + 1 >= i && d + 1 >= a) return D(this.buildValues(l[0].lastComponent, u, e));
     let f = -1 / 0, h = 1 / 0, p = () => {
-      for (let C = Math.max(f, -a); C <= Math.min(h, a); C += 2) {
+      for (let C = Math.max(f, -o); C <= Math.min(h, o); C += 2) {
         let E, m = l[C - 1], y = l[C + 1];
         m && (l[C - 1] = void 0);
         let g = !1;
         if (y) {
-          let W = y.oldPos - C;
-          g = y && 0 <= W && W < i;
+          let M = y.oldPos - C;
+          g = y && 0 <= M && M < a;
         }
-        let B = m && m.oldPos + 1 < o;
+        let B = m && m.oldPos + 1 < i;
         if (!g && !B) {
           l[C] = void 0;
           continue;
         }
-        if (!B || g && m.oldPos < y.oldPos ? E = this.addToPath(y, !0, !1, 0, t) : E = this.addToPath(m, !1, !0, 1, t), d = this.extractCommon(E, u, e, C, t), E.oldPos + 1 >= o && d + 1 >= i)
-          return D(this.buildValues(E.lastComponent, u, e)) || !0;
-        l[C] = E, E.oldPos + 1 >= o && (h = Math.min(h, C - 1)), d + 1 >= i && (f = Math.max(f, C + 1));
+        if (!B || g && m.oldPos < y.oldPos ? E = this.addToPath(y, !0, !1, 0, t) : E = this.addToPath(m, !1, !0, 1, t), d = this.extractCommon(E, u, e, C, t), E.oldPos + 1 >= i && d + 1 >= a) return D(this.buildValues(E.lastComponent, u, e)) || !0;
+        l[C] = E, E.oldPos + 1 >= i && (h = Math.min(h, C - 1)), d + 1 >= a && (f = Math.max(f, C + 1));
       }
-      a++;
+      o++;
     };
-    if (r)
-      (function C() {
-        setTimeout(function() {
-          if (a > s || Date.now() > F)
-            return r(void 0);
-          p() || C();
-        }, 0);
-      })();
-    else
-      for (; a <= s && Date.now() <= F; ) {
-        let C = p();
-        if (C)
-          return C;
-      }
+    if (r) (function C() {
+      setTimeout(function() {
+        if (o > s || Date.now() > F) return r(void 0);
+        p() || C();
+      }, 0);
+    })();
+    else for (; o <= s && Date.now() <= F; ) {
+      let C = p();
+      if (C) return C;
+    }
   }
   addToPath(e, u, t, r, n) {
     let D = e.lastComponent;
     return D && !n.oneChangePerToken && D.added === u && D.removed === t ? { oldPos: e.oldPos + r, lastComponent: { count: D.count + 1, added: u, removed: t, previousComponent: D.previousComponent } } : { oldPos: e.oldPos + r, lastComponent: { count: 1, added: u, removed: t, previousComponent: D } };
   }
   extractCommon(e, u, t, r, n) {
-    let D = u.length, i = t.length, o = e.oldPos, a = o - r, s = 0;
-    for (; a + 1 < D && o + 1 < i && this.equals(t[o + 1], u[a + 1], n); )
-      a++, o++, s++, n.oneChangePerToken && (e.lastComponent = { count: 1, previousComponent: e.lastComponent, added: !1, removed: !1 });
-    return s && !n.oneChangePerToken && (e.lastComponent = { count: s, previousComponent: e.lastComponent, added: !1, removed: !1 }), e.oldPos = o, a;
+    let D = u.length, a = t.length, i = e.oldPos, o = i - r, s = 0;
+    for (; o + 1 < D && i + 1 < a && this.equals(t[i + 1], u[o + 1], n); ) o++, i++, s++, n.oneChangePerToken && (e.lastComponent = { count: 1, previousComponent: e.lastComponent, added: !1, removed: !1 });
+    return s && !n.oneChangePerToken && (e.lastComponent = { count: s, previousComponent: e.lastComponent, added: !1, removed: !1 }), e.oldPos = i, o;
   }
   equals(e, u, t) {
     return t.comparator ? t.comparator(e, u) : e === u || !!t.ignoreCase && e.toLowerCase() === u.toLowerCase();
   }
   removeEmpty(e) {
     let u = [];
-    for (let t = 0; t < e.length; t++)
-      e[t] && u.push(e[t]);
+    for (let t = 0; t < e.length; t++) e[t] && u.push(e[t]);
     return u;
   }
   castInput(e, u) {
@@ -157,29 +136,26 @@ var Pt = (e, u, t, r) => {
   }
   buildValues(e, u, t) {
     let r = [], n;
-    for (; e; )
-      r.push(e), n = e.previousComponent, delete e.previousComponent, e = n;
+    for (; e; ) r.push(e), n = e.previousComponent, delete e.previousComponent, e = n;
     r.reverse();
-    let D = r.length, i = 0, o = 0, a = 0;
-    for (; i < D; i++) {
-      let s = r[i];
-      if (s.removed)
-        s.value = this.join(t.slice(a, a + s.count)), a += s.count;
+    let D = r.length, a = 0, i = 0, o = 0;
+    for (; a < D; a++) {
+      let s = r[a];
+      if (s.removed) s.value = this.join(t.slice(o, o + s.count)), o += s.count;
       else {
         if (!s.added && this.useLongestToken) {
-          let c = u.slice(o, o + s.count);
+          let c = u.slice(i, i + s.count);
           c = c.map(function(F, l) {
-            let d = t[a + l];
+            let d = t[o + l];
             return d.length > F.length ? d : F;
           }), s.value = this.join(c);
-        } else
-          s.value = this.join(u.slice(o, o + s.count));
-        o += s.count, s.added || (a += s.count);
+        } else s.value = this.join(u.slice(i, i + s.count));
+        i += s.count, s.added || (o += s.count);
       }
     }
     return r;
   }
-}, Lt = class extends $t {
+}, It = class extends Tt {
   tokenize(e) {
     return e.slice();
   }
@@ -189,16 +165,16 @@ var Pt = (e, u, t, r) => {
   removeEmpty(e) {
     return e;
   }
-}, Rt = new Lt();
-function Mt(e, u, t) {
-  return Rt.diff(e, u, t);
+}, Pt = new It();
+function $t(e, u, t) {
+  return Pt.diff(e, u, t);
 }
-function Wt(e) {
+function Lt(e) {
   let u = e.indexOf("\r");
   return u !== -1 ? e.charAt(u + 1) === `
 ` ? "crlf" : "cr" : "lf";
 }
-function qe(e) {
+function ze(e) {
   switch (e) {
     case "cr":
       return "\r";
@@ -210,7 +186,7 @@ function qe(e) {
 `;
   }
 }
-function Iu(e, u) {
+function Tu(e, u) {
   let t;
   switch (u) {
     case `
@@ -230,115 +206,97 @@ function Iu(e, u) {
   let r = e.match(t);
   return r ? r.length : 0;
 }
-function Vt(e) {
-  return Ee(!1, e, /\r\n?/gu, `
+function Rt(e) {
+  return me(!1, e, /\r\n?/gu, `
 `);
 }
-var Q = "string", T = "array", q = "cursor", I = "indent", P = "align", $ = "trim", w = "group", O = "fill", k = "if-break", L = "indent-if-break", R = "line-suffix", M = "line-suffix-boundary", b = "line", _ = "label", S = "break-parent", Pu = /* @__PURE__ */ new Set([q, I, P, $, w, O, k, L, R, M, b, _, S]), zt = (e, u, t) => {
-  if (!(e && u == null))
-    return Array.isArray(u) || typeof u == "string" ? u[t < 0 ? u.length + t : t] : u.at(t);
-}, v = zt;
-function qt(e) {
+var Q = "string", T = "array", q = "cursor", I = "indent", P = "align", $ = "trim", w = "group", O = "fill", k = "if-break", L = "indent-if-break", R = "line-suffix", W = "line-suffix-boundary", b = "line", _ = "label", S = "break-parent", Iu = /* @__PURE__ */ new Set([q, I, P, $, w, O, k, L, R, W, b, _, S]), Wt = (e, u, t) => {
+  if (!(e && u == null)) return Array.isArray(u) || typeof u == "string" ? u[t < 0 ? u.length + t : t] : u.at(t);
+}, v = Wt;
+function Mt(e) {
   let u = e.length;
   for (; u > 0 && (e[u - 1] === "\r" || e[u - 1] === `
-`); )
-    u--;
+`); ) u--;
   return u < e.length ? e.slice(0, u) : e;
 }
-function Ut(e) {
-  if (typeof e == "string")
-    return Q;
-  if (Array.isArray(e))
-    return T;
-  if (!e)
-    return;
+function Vt(e) {
+  if (typeof e == "string") return Q;
+  if (Array.isArray(e)) return T;
+  if (!e) return;
   let { type: u } = e;
-  if (Pu.has(u))
-    return u;
+  if (Iu.has(u)) return u;
 }
-var X = Ut, Jt = (e) => new Intl.ListFormat("en-US", { type: "disjunction" }).format(e);
-function Gt(e) {
+var X = Vt, zt = (e) => new Intl.ListFormat("en-US", { type: "disjunction" }).format(e);
+function qt(e) {
   let u = e === null ? "null" : typeof e;
-  if (u !== "string" && u !== "object")
-    return `Unexpected doc '${u}', 
+  if (u !== "string" && u !== "object") return `Unexpected doc '${u}', 
 Expected it to be 'string' or 'object'.`;
-  if (X(e))
-    throw new Error("doc is valid.");
+  if (X(e)) throw new Error("doc is valid.");
   let t = Object.prototype.toString.call(e);
-  if (t !== "[object Object]")
-    return `Unexpected doc '${t}'.`;
-  let r = Jt([...Pu].map((n) => `'${n}'`));
+  if (t !== "[object Object]") return `Unexpected doc '${t}'.`;
+  let r = zt([...Iu].map((n) => `'${n}'`));
   return `Unexpected doc.type '${e.type}'.
 Expected it to be ${r}.`;
 }
-var Ht = class extends Error {
-  constructor(u) {
-    super(Gt(u));
-    fe(this, "name", "InvalidDocError");
-    this.doc = u;
+var Ut = class extends Error {
+  name = "InvalidDocError";
+  constructor(e) {
+    super(qt(e)), this.doc = e;
   }
-}, te = Ht, nu = {};
-function Kt(e, u, t, r) {
+}, te = Ut, ru = {};
+function Jt(e, u, t, r) {
   let n = [e];
   for (; n.length > 0; ) {
     let D = n.pop();
-    if (D === nu) {
+    if (D === ru) {
       t(n.pop());
       continue;
     }
-    t && n.push(D, nu);
-    let i = X(D);
-    if (!i)
-      throw new te(D);
-    if ((u == null ? void 0 : u(D)) !== !1)
-      switch (i) {
-        case T:
-        case O: {
-          let o = i === T ? D : D.parts;
-          for (let a = o.length, s = a - 1; s >= 0; --s)
-            n.push(o[s]);
-          break;
-        }
-        case k:
-          n.push(D.flatContents, D.breakContents);
-          break;
-        case w:
-          if (r && D.expandedStates)
-            for (let o = D.expandedStates.length, a = o - 1; a >= 0; --a)
-              n.push(D.expandedStates[a]);
-          else
-            n.push(D.contents);
-          break;
-        case P:
-        case I:
-        case L:
-        case _:
-        case R:
-          n.push(D.contents);
-          break;
-        case Q:
-        case q:
-        case $:
-        case M:
-        case b:
-        case S:
-          break;
-        default:
-          throw new te(D);
+    t && n.push(D, ru);
+    let a = X(D);
+    if (!a) throw new te(D);
+    if (u?.(D) !== !1) switch (a) {
+      case T:
+      case O: {
+        let i = a === T ? D : D.parts;
+        for (let o = i.length, s = o - 1; s >= 0; --s) n.push(i[s]);
+        break;
       }
+      case k:
+        n.push(D.flatContents, D.breakContents);
+        break;
+      case w:
+        if (r && D.expandedStates) for (let i = D.expandedStates.length, o = i - 1; o >= 0; --o) n.push(D.expandedStates[o]);
+        else n.push(D.contents);
+        break;
+      case P:
+      case I:
+      case L:
+      case _:
+      case R:
+        n.push(D.contents);
+        break;
+      case Q:
+      case q:
+      case $:
+      case W:
+      case b:
+      case S:
+        break;
+      default:
+        throw new te(D);
+    }
   }
 }
-var Ue = Kt;
-function ge(e, u) {
-  if (typeof e == "string")
-    return u(e);
+var qe = Jt;
+function Ee(e, u) {
+  if (typeof e == "string") return u(e);
   let t = /* @__PURE__ */ new Map();
   return r(e);
   function r(D) {
-    if (t.has(D))
-      return t.get(D);
-    let i = n(D);
-    return t.set(D, i), i;
+    if (t.has(D)) return t.get(D);
+    let a = n(D);
+    return t.set(D, a), a;
   }
   function n(D) {
     switch (X(D)) {
@@ -349,8 +307,8 @@ function ge(e, u) {
       case k:
         return u({ ...D, breakContents: r(D.breakContents), flatContents: r(D.flatContents) });
       case w: {
-        let { expandedStates: i, contents: o } = D;
-        return i ? (i = i.map(r), o = i[0]) : o = r(o), u({ ...D, contents: o, expandedStates: i });
+        let { expandedStates: a, contents: i } = D;
+        return a ? (a = a.map(r), i = a[0]) : i = r(i), u({ ...D, contents: i, expandedStates: a });
       }
       case P:
       case I:
@@ -361,7 +319,7 @@ function ge(e, u) {
       case Q:
       case q:
       case $:
-      case M:
+      case W:
       case b:
       case S:
         return u(D);
@@ -370,81 +328,77 @@ function ge(e, u) {
     }
   }
 }
-function Je(e, u, t) {
+function Ue(e, u, t) {
   let r = t, n = !1;
-  function D(i) {
-    if (n)
-      return !1;
-    let o = u(i);
-    o !== void 0 && (n = !0, r = o);
+  function D(a) {
+    if (n) return !1;
+    let i = u(a);
+    i !== void 0 && (n = !0, r = i);
   }
-  return Ue(e, D), r;
+  return qe(e, D), r;
 }
-function Yt(e) {
-  if (e.type === w && e.break || e.type === b && e.hard || e.type === S)
-    return !0;
+function Gt(e) {
+  if (e.type === w && e.break || e.type === b && e.hard || e.type === S) return !0;
 }
-function Zt(e) {
-  return Je(e, Yt, !1);
+function Ht(e) {
+  return Ue(e, Gt, !1);
 }
-function Du(e) {
+function nu(e) {
   if (e.length > 0) {
     let u = v(!1, e, -1);
     !u.expandedStates && !u.break && (u.break = "propagated");
   }
   return null;
 }
-function Qt(e) {
+function Kt(e) {
   let u = /* @__PURE__ */ new Set(), t = [];
   function r(D) {
-    if (D.type === S && Du(t), D.type === w) {
-      if (t.push(D), u.has(D))
-        return !1;
+    if (D.type === S && nu(t), D.type === w) {
+      if (t.push(D), u.has(D)) return !1;
       u.add(D);
     }
   }
   function n(D) {
-    D.type === w && t.pop().break && Du(t);
+    D.type === w && t.pop().break && nu(t);
   }
-  Ue(e, r, n, !0);
+  qe(e, r, n, !0);
 }
-function Xt(e) {
+function Yt(e) {
   return e.type === b && !e.hard ? e.soft ? "" : " " : e.type === k ? e.flatContents : e;
 }
-function er(e) {
-  return ge(e, Xt);
+function Zt(e) {
+  return Ee(e, Yt);
 }
-function iu(e) {
-  for (e = [...e]; e.length >= 2 && v(!1, e, -2).type === b && v(!1, e, -1).type === S; )
-    e.length -= 2;
+function Du(e) {
+  for (e = [...e]; e.length >= 2 && v(!1, e, -2).type === b && v(!1, e, -1).type === S; ) e.length -= 2;
   if (e.length > 0) {
-    let u = ie(v(!1, e, -1));
+    let u = ae(v(!1, e, -1));
     e[e.length - 1] = u;
   }
   return e;
 }
-function ie(e) {
+function ae(e) {
   switch (X(e)) {
     case I:
     case L:
     case w:
     case R:
     case _: {
-      let u = ie(e.contents);
+      let u = ae(e.contents);
       return { ...e, contents: u };
     }
     case k:
-      return { ...e, breakContents: ie(e.breakContents), flatContents: ie(e.flatContents) };
+      return { ...e, breakContents: ae(e.breakContents), flatContents: ae(e.flatContents) };
     case O:
-      return { ...e, parts: iu(e.parts) };
+      return { ...e, parts: Du(e.parts) };
     case T:
-      return iu(e);
+      return Du(e);
     case Q:
-      return qt(e);
+      return Mt(e);
     case P:
     case q:
     case $:
-    case M:
+    case W:
     case b:
     case S:
       break;
@@ -453,37 +407,31 @@ function ie(e) {
   }
   return e;
 }
-function $u(e) {
-  return ie(tr(e));
+function Pu(e) {
+  return ae(Xt(e));
 }
-function ur(e) {
+function Qt(e) {
   switch (X(e)) {
     case O:
-      if (e.parts.every((u) => u === ""))
-        return "";
+      if (e.parts.every((u) => u === "")) return "";
       break;
     case w:
-      if (!e.contents && !e.id && !e.break && !e.expandedStates)
-        return "";
-      if (e.contents.type === w && e.contents.id === e.id && e.contents.break === e.break && e.contents.expandedStates === e.expandedStates)
-        return e.contents;
+      if (!e.contents && !e.id && !e.break && !e.expandedStates) return "";
+      if (e.contents.type === w && e.contents.id === e.id && e.contents.break === e.break && e.contents.expandedStates === e.expandedStates) return e.contents;
       break;
     case P:
     case I:
     case L:
     case R:
-      if (!e.contents)
-        return "";
+      if (!e.contents) return "";
       break;
     case k:
-      if (!e.flatContents && !e.breakContents)
-        return "";
+      if (!e.flatContents && !e.breakContents) return "";
       break;
     case T: {
       let u = [];
       for (let t of e) {
-        if (!t)
-          continue;
+        if (!t) continue;
         let [r, ...n] = Array.isArray(t) ? t : [t];
         typeof r == "string" && typeof v(!1, u, -1) == "string" ? u[u.length - 1] += r : u.push(r), u.push(...n);
       }
@@ -492,7 +440,7 @@ function ur(e) {
     case Q:
     case q:
     case $:
-    case M:
+    case W:
     case b:
     case _:
     case S:
@@ -502,119 +450,107 @@ function ur(e) {
   }
   return e;
 }
-function tr(e) {
-  return ge(e, (u) => ur(u));
+function Xt(e) {
+  return Ee(e, (u) => Qt(u));
 }
-function rr(e, u = Wu) {
-  return ge(e, (t) => typeof t == "string" ? Vu(u, t.split(`
+function er(e, u = Wu) {
+  return Ee(e, (t) => typeof t == "string" ? Mu(u, t.split(`
 `)) : t);
 }
-function nr(e) {
-  if (e.type === b)
-    return !0;
+function ur(e) {
+  if (e.type === b) return !0;
 }
-function Dr(e) {
-  return Je(e, nr, !1);
+function tr(e) {
+  return Ue(e, ur, !1);
 }
-function pe(e, u) {
+function Fe(e, u) {
   return e.type === _ ? { ...e, contents: u(e.contents) } : u(e);
 }
-var ir = () => {
-}, or = ir;
-function me(e) {
+var rr = () => {
+}, nr = rr;
+function Ce(e) {
   return { type: I, contents: e };
 }
 function re(e, u) {
   return { type: P, contents: u, n: e };
 }
-function Lu(e, u = {}) {
-  return or(u.expandedStates), { type: w, id: u.id, contents: e, break: !!u.shouldBreak, expandedStates: u.expandedStates };
+function $u(e, u = {}) {
+  return nr(u.expandedStates), { type: w, id: u.id, contents: e, break: !!u.shouldBreak, expandedStates: u.expandedStates };
 }
-function ar(e) {
+function Dr(e) {
   return re(Number.NEGATIVE_INFINITY, e);
 }
-function sr(e) {
+function ar(e) {
   return re({ type: "root" }, e);
 }
-function lr(e) {
+function ir(e) {
   return re(-1, e);
 }
-function cr(e, u) {
-  return Lu(e[0], { ...u, expandedStates: e });
+function or(e, u) {
+  return $u(e[0], { ...u, expandedStates: e });
 }
-function fr(e) {
+function sr(e) {
   return { type: O, parts: e };
 }
-function dr(e, u = "", t = {}) {
+function lr(e, u = "", t = {}) {
   return { type: k, breakContents: e, flatContents: u, groupId: t.groupId };
 }
-function Fr(e, u) {
+function cr(e, u) {
   return { type: L, contents: e, groupId: u.groupId, negate: u.negate };
 }
-function Te(e) {
+function je(e) {
   return { type: R, contents: e };
 }
-var pr = { type: M }, ye = { type: S }, hr = { type: $ }, Ge = { type: b, hard: !0 }, Ru = { type: b, hard: !0, literal: !0 }, Mu = { type: b }, Cr = { type: b, soft: !0 }, Y = [Ge, ye], Wu = [Ru, ye], K = { type: q };
-function Vu(e, u) {
+var fr = { type: W }, ge = { type: S }, dr = { type: $ }, Je = { type: b, hard: !0 }, Lu = { type: b, hard: !0, literal: !0 }, Ru = { type: b }, Fr = { type: b, soft: !0 }, Y = [Je, ge], Wu = [Lu, ge], K = { type: q };
+function Mu(e, u) {
   let t = [];
-  for (let r = 0; r < u.length; r++)
-    r !== 0 && t.push(e), t.push(u[r]);
+  for (let r = 0; r < u.length; r++) r !== 0 && t.push(e), t.push(u[r]);
   return t;
 }
-function zu(e, u, t) {
+function Vu(e, u, t) {
   let r = e;
   if (u > 0) {
-    for (let n = 0; n < Math.floor(u / t); ++n)
-      r = me(r);
+    for (let n = 0; n < Math.floor(u / t); ++n) r = Ce(r);
     r = re(u % t, r), r = re(Number.NEGATIVE_INFINITY, r);
   }
   return r;
 }
-function mr(e, u) {
+function pr(e, u) {
   return e ? { type: _, label: e, contents: u } : u;
 }
 function j(e) {
   var u;
-  if (!e)
-    return "";
+  if (!e) return "";
   if (Array.isArray(e)) {
     let t = [];
-    for (let r of e)
-      if (Array.isArray(r))
-        t.push(...j(r));
-      else {
-        let n = j(r);
-        n !== "" && t.push(n);
-      }
+    for (let r of e) if (Array.isArray(r)) t.push(...j(r));
+    else {
+      let n = j(r);
+      n !== "" && t.push(n);
+    }
     return t;
   }
   return e.type === k ? { ...e, breakContents: j(e.breakContents), flatContents: j(e.flatContents) } : e.type === w ? { ...e, contents: j(e.contents), expandedStates: (u = e.expandedStates) == null ? void 0 : u.map(j) } : e.type === O ? { type: "fill", parts: e.parts.map(j) } : e.contents ? { ...e, contents: j(e.contents) } : e;
 }
-function Er(e) {
+function hr(e) {
   let u = /* @__PURE__ */ Object.create(null), t = /* @__PURE__ */ new Set();
   return r(j(e));
-  function r(D, i, o) {
-    var a, s;
-    if (typeof D == "string")
-      return JSON.stringify(D);
+  function r(D, a, i) {
+    var o, s;
+    if (typeof D == "string") return JSON.stringify(D);
     if (Array.isArray(D)) {
       let c = D.map(r).filter(Boolean);
       return c.length === 1 ? c[0] : `[${c.join(", ")}]`;
     }
     if (D.type === b) {
-      let c = ((a = o == null ? void 0 : o[i + 1]) == null ? void 0 : a.type) === S;
+      let c = ((o = i?.[a + 1]) == null ? void 0 : o.type) === S;
       return D.literal ? c ? "literalline" : "literallineWithoutBreakParent" : D.hard ? c ? "hardline" : "hardlineWithoutBreakParent" : D.soft ? "softline" : "line";
     }
-    if (D.type === S)
-      return ((s = o == null ? void 0 : o[i - 1]) == null ? void 0 : s.type) === b && o[i - 1].hard ? void 0 : "breakParent";
-    if (D.type === $)
-      return "trim";
-    if (D.type === I)
-      return "indent(" + r(D.contents) + ")";
-    if (D.type === P)
-      return D.n === Number.NEGATIVE_INFINITY ? "dedentToRoot(" + r(D.contents) + ")" : D.n < 0 ? "dedent(" + r(D.contents) + ")" : D.n.type === "root" ? "markAsRoot(" + r(D.contents) + ")" : "align(" + JSON.stringify(D.n) + ", " + r(D.contents) + ")";
-    if (D.type === k)
-      return "ifBreak(" + r(D.breakContents) + (D.flatContents ? ", " + r(D.flatContents) : "") + (D.groupId ? (D.flatContents ? "" : ', ""') + `, { groupId: ${n(D.groupId)} }` : "") + ")";
+    if (D.type === S) return ((s = i?.[a - 1]) == null ? void 0 : s.type) === b && i[a - 1].hard ? void 0 : "breakParent";
+    if (D.type === $) return "trim";
+    if (D.type === I) return "indent(" + r(D.contents) + ")";
+    if (D.type === P) return D.n === Number.NEGATIVE_INFINITY ? "dedentToRoot(" + r(D.contents) + ")" : D.n < 0 ? "dedent(" + r(D.contents) + ")" : D.n.type === "root" ? "markAsRoot(" + r(D.contents) + ")" : "align(" + JSON.stringify(D.n) + ", " + r(D.contents) + ")";
+    if (D.type === k) return "ifBreak(" + r(D.breakContents) + (D.flatContents ? ", " + r(D.flatContents) : "") + (D.groupId ? (D.flatContents ? "" : ', ""') + `, { groupId: ${n(D.groupId)} }` : "") + ")";
     if (D.type === L) {
       let c = [];
       D.negate && c.push("negate: true"), D.groupId && c.push(`groupId: ${n(D.groupId)}`);
@@ -627,80 +563,69 @@ function Er(e) {
       let F = c.length > 0 ? `, { ${c.join(", ")} }` : "";
       return D.expandedStates ? `conditionalGroup([${D.expandedStates.map((l) => r(l)).join(",")}]${F})` : `group(${r(D.contents)}${F})`;
     }
-    if (D.type === O)
-      return `fill([${D.parts.map((c) => r(c)).join(", ")}])`;
-    if (D.type === R)
-      return "lineSuffix(" + r(D.contents) + ")";
-    if (D.type === M)
-      return "lineSuffixBoundary";
-    if (D.type === _)
-      return `label(${JSON.stringify(D.label)}, ${r(D.contents)})`;
-    if (D.type === q)
-      return "cursor";
+    if (D.type === O) return `fill([${D.parts.map((c) => r(c)).join(", ")}])`;
+    if (D.type === R) return "lineSuffix(" + r(D.contents) + ")";
+    if (D.type === W) return "lineSuffixBoundary";
+    if (D.type === _) return `label(${JSON.stringify(D.label)}, ${r(D.contents)})`;
+    if (D.type === q) return "cursor";
     throw new Error("Unknown doc type " + D.type);
   }
   function n(D) {
-    if (typeof D != "symbol")
-      return JSON.stringify(String(D));
-    if (D in u)
-      return u[D];
-    let i = D.description || "symbol";
-    for (let o = 0; ; o++) {
-      let a = i + (o > 0 ? ` #${o}` : "");
-      if (!t.has(a))
-        return t.add(a), u[D] = `Symbol.for(${JSON.stringify(a)})`;
+    if (typeof D != "symbol") return JSON.stringify(String(D));
+    if (D in u) return u[D];
+    let a = D.description || "symbol";
+    for (let i = 0; ; i++) {
+      let o = a + (i > 0 ? ` #${i}` : "");
+      if (!t.has(o)) return t.add(o), u[D] = `Symbol.for(${JSON.stringify(o)})`;
     }
   }
 }
-var gr = () => /[#*0-9]\uFE0F?\u20E3|[\xA9\xAE\u203C\u2049\u2122\u2139\u2194-\u2199\u21A9\u21AA\u231A\u231B\u2328\u23CF\u23ED-\u23EF\u23F1\u23F2\u23F8-\u23FA\u24C2\u25AA\u25AB\u25B6\u25C0\u25FB\u25FC\u25FE\u2600-\u2604\u260E\u2611\u2614\u2615\u2618\u2620\u2622\u2623\u2626\u262A\u262E\u262F\u2638-\u263A\u2640\u2642\u2648-\u2653\u265F\u2660\u2663\u2665\u2666\u2668\u267B\u267E\u267F\u2692\u2694-\u2697\u2699\u269B\u269C\u26A0\u26A7\u26AA\u26B0\u26B1\u26BD\u26BE\u26C4\u26C8\u26CF\u26D1\u26E9\u26F0-\u26F5\u26F7\u26F8\u26FA\u2702\u2708\u2709\u270F\u2712\u2714\u2716\u271D\u2721\u2733\u2734\u2744\u2747\u2757\u2763\u27A1\u2934\u2935\u2B05-\u2B07\u2B1B\u2B1C\u2B55\u3030\u303D\u3297\u3299]\uFE0F?|[\u261D\u270C\u270D](?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?|[\u270A\u270B](?:\uD83C[\uDFFB-\uDFFF])?|[\u23E9-\u23EC\u23F0\u23F3\u25FD\u2693\u26A1\u26AB\u26C5\u26CE\u26D4\u26EA\u26FD\u2705\u2728\u274C\u274E\u2753-\u2755\u2795-\u2797\u27B0\u27BF\u2B50]|\u26D3\uFE0F?(?:\u200D\uD83D\uDCA5)?|\u26F9(?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?(?:\u200D[\u2640\u2642]\uFE0F?)?|\u2764\uFE0F?(?:\u200D(?:\uD83D\uDD25|\uD83E\uDE79))?|\uD83C(?:[\uDC04\uDD70\uDD71\uDD7E\uDD7F\uDE02\uDE37\uDF21\uDF24-\uDF2C\uDF36\uDF7D\uDF96\uDF97\uDF99-\uDF9B\uDF9E\uDF9F\uDFCD\uDFCE\uDFD4-\uDFDF\uDFF5\uDFF7]\uFE0F?|[\uDF85\uDFC2\uDFC7](?:\uD83C[\uDFFB-\uDFFF])?|[\uDFC4\uDFCA](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDFCB\uDFCC](?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDCCF\uDD8E\uDD91-\uDD9A\uDE01\uDE1A\uDE2F\uDE32-\uDE36\uDE38-\uDE3A\uDE50\uDE51\uDF00-\uDF20\uDF2D-\uDF35\uDF37-\uDF43\uDF45-\uDF4A\uDF4C-\uDF7C\uDF7E-\uDF84\uDF86-\uDF93\uDFA0-\uDFC1\uDFC5\uDFC6\uDFC8\uDFC9\uDFCF-\uDFD3\uDFE0-\uDFF0\uDFF8-\uDFFF]|\uDDE6\uD83C[\uDDE8-\uDDEC\uDDEE\uDDF1\uDDF2\uDDF4\uDDF6-\uDDFA\uDDFC\uDDFD\uDDFF]|\uDDE7\uD83C[\uDDE6\uDDE7\uDDE9-\uDDEF\uDDF1-\uDDF4\uDDF6-\uDDF9\uDDFB\uDDFC\uDDFE\uDDFF]|\uDDE8\uD83C[\uDDE6\uDDE8\uDDE9\uDDEB-\uDDEE\uDDF0-\uDDF7\uDDFA-\uDDFF]|\uDDE9\uD83C[\uDDEA\uDDEC\uDDEF\uDDF0\uDDF2\uDDF4\uDDFF]|\uDDEA\uD83C[\uDDE6\uDDE8\uDDEA\uDDEC\uDDED\uDDF7-\uDDFA]|\uDDEB\uD83C[\uDDEE-\uDDF0\uDDF2\uDDF4\uDDF7]|\uDDEC\uD83C[\uDDE6\uDDE7\uDDE9-\uDDEE\uDDF1-\uDDF3\uDDF5-\uDDFA\uDDFC\uDDFE]|\uDDED\uD83C[\uDDF0\uDDF2\uDDF3\uDDF7\uDDF9\uDDFA]|\uDDEE\uD83C[\uDDE8-\uDDEA\uDDF1-\uDDF4\uDDF6-\uDDF9]|\uDDEF\uD83C[\uDDEA\uDDF2\uDDF4\uDDF5]|\uDDF0\uD83C[\uDDEA\uDDEC-\uDDEE\uDDF2\uDDF3\uDDF5\uDDF7\uDDFC\uDDFE\uDDFF]|\uDDF1\uD83C[\uDDE6-\uDDE8\uDDEE\uDDF0\uDDF7-\uDDFB\uDDFE]|\uDDF2\uD83C[\uDDE6\uDDE8-\uDDED\uDDF0-\uDDFF]|\uDDF3\uD83C[\uDDE6\uDDE8\uDDEA-\uDDEC\uDDEE\uDDF1\uDDF4\uDDF5\uDDF7\uDDFA\uDDFF]|\uDDF4\uD83C\uDDF2|\uDDF5\uD83C[\uDDE6\uDDEA-\uDDED\uDDF0-\uDDF3\uDDF7-\uDDF9\uDDFC\uDDFE]|\uDDF6\uD83C\uDDE6|\uDDF7\uD83C[\uDDEA\uDDF4\uDDF8\uDDFA\uDDFC]|\uDDF8\uD83C[\uDDE6-\uDDEA\uDDEC-\uDDF4\uDDF7-\uDDF9\uDDFB\uDDFD-\uDDFF]|\uDDF9\uD83C[\uDDE6\uDDE8\uDDE9\uDDEB-\uDDED\uDDEF-\uDDF4\uDDF7\uDDF9\uDDFB\uDDFC\uDDFF]|\uDDFA\uD83C[\uDDE6\uDDEC\uDDF2\uDDF3\uDDF8\uDDFE\uDDFF]|\uDDFB\uD83C[\uDDE6\uDDE8\uDDEA\uDDEC\uDDEE\uDDF3\uDDFA]|\uDDFC\uD83C[\uDDEB\uDDF8]|\uDDFD\uD83C\uDDF0|\uDDFE\uD83C[\uDDEA\uDDF9]|\uDDFF\uD83C[\uDDE6\uDDF2\uDDFC]|\uDF44(?:\u200D\uD83D\uDFEB)?|\uDF4B(?:\u200D\uD83D\uDFE9)?|\uDFC3(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?|\uDFF3\uFE0F?(?:\u200D(?:\u26A7\uFE0F?|\uD83C\uDF08))?|\uDFF4(?:\u200D\u2620\uFE0F?|\uDB40\uDC67\uDB40\uDC62\uDB40(?:\uDC65\uDB40\uDC6E\uDB40\uDC67|\uDC73\uDB40\uDC63\uDB40\uDC74|\uDC77\uDB40\uDC6C\uDB40\uDC73)\uDB40\uDC7F)?)|\uD83D(?:[\uDC3F\uDCFD\uDD49\uDD4A\uDD6F\uDD70\uDD73\uDD76-\uDD79\uDD87\uDD8A-\uDD8D\uDDA5\uDDA8\uDDB1\uDDB2\uDDBC\uDDC2-\uDDC4\uDDD1-\uDDD3\uDDDC-\uDDDE\uDDE1\uDDE3\uDDE8\uDDEF\uDDF3\uDDFA\uDECB\uDECD-\uDECF\uDEE0-\uDEE5\uDEE9\uDEF0\uDEF3]\uFE0F?|[\uDC42\uDC43\uDC46-\uDC50\uDC66\uDC67\uDC6B-\uDC6D\uDC72\uDC74-\uDC76\uDC78\uDC7C\uDC83\uDC85\uDC8F\uDC91\uDCAA\uDD7A\uDD95\uDD96\uDE4C\uDE4F\uDEC0\uDECC](?:\uD83C[\uDFFB-\uDFFF])?|[\uDC6E\uDC70\uDC71\uDC73\uDC77\uDC81\uDC82\uDC86\uDC87\uDE45-\uDE47\uDE4B\uDE4D\uDE4E\uDEA3\uDEB4\uDEB5](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDD74\uDD90](?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?|[\uDC00-\uDC07\uDC09-\uDC14\uDC16-\uDC25\uDC27-\uDC3A\uDC3C-\uDC3E\uDC40\uDC44\uDC45\uDC51-\uDC65\uDC6A\uDC79-\uDC7B\uDC7D-\uDC80\uDC84\uDC88-\uDC8E\uDC90\uDC92-\uDCA9\uDCAB-\uDCFC\uDCFF-\uDD3D\uDD4B-\uDD4E\uDD50-\uDD67\uDDA4\uDDFB-\uDE2D\uDE2F-\uDE34\uDE37-\uDE41\uDE43\uDE44\uDE48-\uDE4A\uDE80-\uDEA2\uDEA4-\uDEB3\uDEB7-\uDEBF\uDEC1-\uDEC5\uDED0-\uDED2\uDED5-\uDED7\uDEDC-\uDEDF\uDEEB\uDEEC\uDEF4-\uDEFC\uDFE0-\uDFEB\uDFF0]|\uDC08(?:\u200D\u2B1B)?|\uDC15(?:\u200D\uD83E\uDDBA)?|\uDC26(?:\u200D(?:\u2B1B|\uD83D\uDD25))?|\uDC3B(?:\u200D\u2744\uFE0F?)?|\uDC41\uFE0F?(?:\u200D\uD83D\uDDE8\uFE0F?)?|\uDC68(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D(?:[\uDC68\uDC69]\u200D\uD83D(?:\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?)|[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?)|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFC-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFD-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFD\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFE])))?))?|\uDC69(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?[\uDC68\uDC69]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D(?:[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?|\uDC69\u200D\uD83D(?:\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?))|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFC-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFD-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFD\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFE])))?))?|\uDC6F(?:\u200D[\u2640\u2642]\uFE0F?)?|\uDD75(?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?(?:\u200D[\u2640\u2642]\uFE0F?)?|\uDE2E(?:\u200D\uD83D\uDCA8)?|\uDE35(?:\u200D\uD83D\uDCAB)?|\uDE36(?:\u200D\uD83C\uDF2B\uFE0F?)?|\uDE42(?:\u200D[\u2194\u2195]\uFE0F?)?|\uDEB6(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?)|\uD83E(?:[\uDD0C\uDD0F\uDD18-\uDD1F\uDD30-\uDD34\uDD36\uDD77\uDDB5\uDDB6\uDDBB\uDDD2\uDDD3\uDDD5\uDEC3-\uDEC5\uDEF0\uDEF2-\uDEF8](?:\uD83C[\uDFFB-\uDFFF])?|[\uDD26\uDD35\uDD37-\uDD39\uDD3D\uDD3E\uDDB8\uDDB9\uDDCD\uDDCF\uDDD4\uDDD6-\uDDDD](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDDDE\uDDDF](?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDD0D\uDD0E\uDD10-\uDD17\uDD20-\uDD25\uDD27-\uDD2F\uDD3A\uDD3F-\uDD45\uDD47-\uDD76\uDD78-\uDDB4\uDDB7\uDDBA\uDDBC-\uDDCC\uDDD0\uDDE0-\uDDFF\uDE70-\uDE7C\uDE80-\uDE89\uDE8F-\uDEC2\uDEC6\uDECE-\uDEDC\uDEDF-\uDEE9]|\uDD3C(?:\u200D[\u2640\u2642]\uFE0F?|\uD83C[\uDFFB-\uDFFF])?|\uDDCE(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?|\uDDD1(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1|\uDDD1\u200D\uD83E\uDDD2(?:\u200D\uD83E\uDDD2)?|\uDDD2(?:\u200D\uD83E\uDDD2)?))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFC-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB\uDFFD-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB-\uDFFD\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB-\uDFFE]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?))?|\uDEF1(?:\uD83C(?:\uDFFB(?:\u200D\uD83E\uDEF2\uD83C[\uDFFC-\uDFFF])?|\uDFFC(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB\uDFFD-\uDFFF])?|\uDFFD(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])?|\uDFFE(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB-\uDFFD\uDFFF])?|\uDFFF(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB-\uDFFE])?))?)/g;
-function yr(e) {
+var Cr = () => /[#*0-9]\uFE0F?\u20E3|[\xA9\xAE\u203C\u2049\u2122\u2139\u2194-\u2199\u21A9\u21AA\u231A\u231B\u2328\u23CF\u23ED-\u23EF\u23F1\u23F2\u23F8-\u23FA\u24C2\u25AA\u25AB\u25B6\u25C0\u25FB\u25FC\u25FE\u2600-\u2604\u260E\u2611\u2614\u2615\u2618\u2620\u2622\u2623\u2626\u262A\u262E\u262F\u2638-\u263A\u2640\u2642\u2648-\u2653\u265F\u2660\u2663\u2665\u2666\u2668\u267B\u267E\u267F\u2692\u2694-\u2697\u2699\u269B\u269C\u26A0\u26A7\u26AA\u26B0\u26B1\u26BD\u26BE\u26C4\u26C8\u26CF\u26D1\u26E9\u26F0-\u26F5\u26F7\u26F8\u26FA\u2702\u2708\u2709\u270F\u2712\u2714\u2716\u271D\u2721\u2733\u2734\u2744\u2747\u2757\u2763\u27A1\u2934\u2935\u2B05-\u2B07\u2B1B\u2B1C\u2B55\u3030\u303D\u3297\u3299]\uFE0F?|[\u261D\u270C\u270D](?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?|[\u270A\u270B](?:\uD83C[\uDFFB-\uDFFF])?|[\u23E9-\u23EC\u23F0\u23F3\u25FD\u2693\u26A1\u26AB\u26C5\u26CE\u26D4\u26EA\u26FD\u2705\u2728\u274C\u274E\u2753-\u2755\u2795-\u2797\u27B0\u27BF\u2B50]|\u26D3\uFE0F?(?:\u200D\uD83D\uDCA5)?|\u26F9(?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?(?:\u200D[\u2640\u2642]\uFE0F?)?|\u2764\uFE0F?(?:\u200D(?:\uD83D\uDD25|\uD83E\uDE79))?|\uD83C(?:[\uDC04\uDD70\uDD71\uDD7E\uDD7F\uDE02\uDE37\uDF21\uDF24-\uDF2C\uDF36\uDF7D\uDF96\uDF97\uDF99-\uDF9B\uDF9E\uDF9F\uDFCD\uDFCE\uDFD4-\uDFDF\uDFF5\uDFF7]\uFE0F?|[\uDF85\uDFC2\uDFC7](?:\uD83C[\uDFFB-\uDFFF])?|[\uDFC4\uDFCA](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDFCB\uDFCC](?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDCCF\uDD8E\uDD91-\uDD9A\uDE01\uDE1A\uDE2F\uDE32-\uDE36\uDE38-\uDE3A\uDE50\uDE51\uDF00-\uDF20\uDF2D-\uDF35\uDF37-\uDF43\uDF45-\uDF4A\uDF4C-\uDF7C\uDF7E-\uDF84\uDF86-\uDF93\uDFA0-\uDFC1\uDFC5\uDFC6\uDFC8\uDFC9\uDFCF-\uDFD3\uDFE0-\uDFF0\uDFF8-\uDFFF]|\uDDE6\uD83C[\uDDE8-\uDDEC\uDDEE\uDDF1\uDDF2\uDDF4\uDDF6-\uDDFA\uDDFC\uDDFD\uDDFF]|\uDDE7\uD83C[\uDDE6\uDDE7\uDDE9-\uDDEF\uDDF1-\uDDF4\uDDF6-\uDDF9\uDDFB\uDDFC\uDDFE\uDDFF]|\uDDE8\uD83C[\uDDE6\uDDE8\uDDE9\uDDEB-\uDDEE\uDDF0-\uDDF7\uDDFA-\uDDFF]|\uDDE9\uD83C[\uDDEA\uDDEC\uDDEF\uDDF0\uDDF2\uDDF4\uDDFF]|\uDDEA\uD83C[\uDDE6\uDDE8\uDDEA\uDDEC\uDDED\uDDF7-\uDDFA]|\uDDEB\uD83C[\uDDEE-\uDDF0\uDDF2\uDDF4\uDDF7]|\uDDEC\uD83C[\uDDE6\uDDE7\uDDE9-\uDDEE\uDDF1-\uDDF3\uDDF5-\uDDFA\uDDFC\uDDFE]|\uDDED\uD83C[\uDDF0\uDDF2\uDDF3\uDDF7\uDDF9\uDDFA]|\uDDEE\uD83C[\uDDE8-\uDDEA\uDDF1-\uDDF4\uDDF6-\uDDF9]|\uDDEF\uD83C[\uDDEA\uDDF2\uDDF4\uDDF5]|\uDDF0\uD83C[\uDDEA\uDDEC-\uDDEE\uDDF2\uDDF3\uDDF5\uDDF7\uDDFC\uDDFE\uDDFF]|\uDDF1\uD83C[\uDDE6-\uDDE8\uDDEE\uDDF0\uDDF7-\uDDFB\uDDFE]|\uDDF2\uD83C[\uDDE6\uDDE8-\uDDED\uDDF0-\uDDFF]|\uDDF3\uD83C[\uDDE6\uDDE8\uDDEA-\uDDEC\uDDEE\uDDF1\uDDF4\uDDF5\uDDF7\uDDFA\uDDFF]|\uDDF4\uD83C\uDDF2|\uDDF5\uD83C[\uDDE6\uDDEA-\uDDED\uDDF0-\uDDF3\uDDF7-\uDDF9\uDDFC\uDDFE]|\uDDF6\uD83C\uDDE6|\uDDF7\uD83C[\uDDEA\uDDF4\uDDF8\uDDFA\uDDFC]|\uDDF8\uD83C[\uDDE6-\uDDEA\uDDEC-\uDDF4\uDDF7-\uDDF9\uDDFB\uDDFD-\uDDFF]|\uDDF9\uD83C[\uDDE6\uDDE8\uDDE9\uDDEB-\uDDED\uDDEF-\uDDF4\uDDF7\uDDF9\uDDFB\uDDFC\uDDFF]|\uDDFA\uD83C[\uDDE6\uDDEC\uDDF2\uDDF3\uDDF8\uDDFE\uDDFF]|\uDDFB\uD83C[\uDDE6\uDDE8\uDDEA\uDDEC\uDDEE\uDDF3\uDDFA]|\uDDFC\uD83C[\uDDEB\uDDF8]|\uDDFD\uD83C\uDDF0|\uDDFE\uD83C[\uDDEA\uDDF9]|\uDDFF\uD83C[\uDDE6\uDDF2\uDDFC]|\uDF44(?:\u200D\uD83D\uDFEB)?|\uDF4B(?:\u200D\uD83D\uDFE9)?|\uDFC3(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?|\uDFF3\uFE0F?(?:\u200D(?:\u26A7\uFE0F?|\uD83C\uDF08))?|\uDFF4(?:\u200D\u2620\uFE0F?|\uDB40\uDC67\uDB40\uDC62\uDB40(?:\uDC65\uDB40\uDC6E\uDB40\uDC67|\uDC73\uDB40\uDC63\uDB40\uDC74|\uDC77\uDB40\uDC6C\uDB40\uDC73)\uDB40\uDC7F)?)|\uD83D(?:[\uDC3F\uDCFD\uDD49\uDD4A\uDD6F\uDD70\uDD73\uDD76-\uDD79\uDD87\uDD8A-\uDD8D\uDDA5\uDDA8\uDDB1\uDDB2\uDDBC\uDDC2-\uDDC4\uDDD1-\uDDD3\uDDDC-\uDDDE\uDDE1\uDDE3\uDDE8\uDDEF\uDDF3\uDDFA\uDECB\uDECD-\uDECF\uDEE0-\uDEE5\uDEE9\uDEF0\uDEF3]\uFE0F?|[\uDC42\uDC43\uDC46-\uDC50\uDC66\uDC67\uDC6B-\uDC6D\uDC72\uDC74-\uDC76\uDC78\uDC7C\uDC83\uDC85\uDC8F\uDC91\uDCAA\uDD7A\uDD95\uDD96\uDE4C\uDE4F\uDEC0\uDECC](?:\uD83C[\uDFFB-\uDFFF])?|[\uDC6E\uDC70\uDC71\uDC73\uDC77\uDC81\uDC82\uDC86\uDC87\uDE45-\uDE47\uDE4B\uDE4D\uDE4E\uDEA3\uDEB4\uDEB5](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDD74\uDD90](?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?|[\uDC00-\uDC07\uDC09-\uDC14\uDC16-\uDC25\uDC27-\uDC3A\uDC3C-\uDC3E\uDC40\uDC44\uDC45\uDC51-\uDC65\uDC6A\uDC79-\uDC7B\uDC7D-\uDC80\uDC84\uDC88-\uDC8E\uDC90\uDC92-\uDCA9\uDCAB-\uDCFC\uDCFF-\uDD3D\uDD4B-\uDD4E\uDD50-\uDD67\uDDA4\uDDFB-\uDE2D\uDE2F-\uDE34\uDE37-\uDE41\uDE43\uDE44\uDE48-\uDE4A\uDE80-\uDEA2\uDEA4-\uDEB3\uDEB7-\uDEBF\uDEC1-\uDEC5\uDED0-\uDED2\uDED5-\uDED7\uDEDC-\uDEDF\uDEEB\uDEEC\uDEF4-\uDEFC\uDFE0-\uDFEB\uDFF0]|\uDC08(?:\u200D\u2B1B)?|\uDC15(?:\u200D\uD83E\uDDBA)?|\uDC26(?:\u200D(?:\u2B1B|\uD83D\uDD25))?|\uDC3B(?:\u200D\u2744\uFE0F?)?|\uDC41\uFE0F?(?:\u200D\uD83D\uDDE8\uFE0F?)?|\uDC68(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D(?:[\uDC68\uDC69]\u200D\uD83D(?:\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?)|[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?)|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFC-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFD-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFD\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFE])))?))?|\uDC69(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?[\uDC68\uDC69]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D(?:[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?|\uDC69\u200D\uD83D(?:\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?))|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFC-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFD-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFD\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFE])))?))?|\uDC6F(?:\u200D[\u2640\u2642]\uFE0F?)?|\uDD75(?:\uD83C[\uDFFB-\uDFFF]|\uFE0F)?(?:\u200D[\u2640\u2642]\uFE0F?)?|\uDE2E(?:\u200D\uD83D\uDCA8)?|\uDE35(?:\u200D\uD83D\uDCAB)?|\uDE36(?:\u200D\uD83C\uDF2B\uFE0F?)?|\uDE42(?:\u200D[\u2194\u2195]\uFE0F?)?|\uDEB6(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?)|\uD83E(?:[\uDD0C\uDD0F\uDD18-\uDD1F\uDD30-\uDD34\uDD36\uDD77\uDDB5\uDDB6\uDDBB\uDDD2\uDDD3\uDDD5\uDEC3-\uDEC5\uDEF0\uDEF2-\uDEF8](?:\uD83C[\uDFFB-\uDFFF])?|[\uDD26\uDD35\uDD37-\uDD39\uDD3D\uDD3E\uDDB8\uDDB9\uDDCD\uDDCF\uDDD4\uDDD6-\uDDDD](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDDDE\uDDDF](?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDD0D\uDD0E\uDD10-\uDD17\uDD20-\uDD25\uDD27-\uDD2F\uDD3A\uDD3F-\uDD45\uDD47-\uDD76\uDD78-\uDDB4\uDDB7\uDDBA\uDDBC-\uDDCC\uDDD0\uDDE0-\uDDFF\uDE70-\uDE7C\uDE80-\uDE89\uDE8F-\uDEC2\uDEC6\uDECE-\uDEDC\uDEDF-\uDEE9]|\uDD3C(?:\u200D[\u2640\u2642]\uFE0F?|\uD83C[\uDFFB-\uDFFF])?|\uDDCE(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?|\uDDD1(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1|\uDDD1\u200D\uD83E\uDDD2(?:\u200D\uD83E\uDDD2)?|\uDDD2(?:\u200D\uD83E\uDDD2)?))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFC-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB\uDFFD-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB-\uDFFD\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB-\uDFFE]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?))?|\uDEF1(?:\uD83C(?:\uDFFB(?:\u200D\uD83E\uDEF2\uD83C[\uDFFC-\uDFFF])?|\uDFFC(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB\uDFFD-\uDFFF])?|\uDFFD(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])?|\uDFFE(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB-\uDFFD\uDFFF])?|\uDFFF(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB-\uDFFE])?))?)/g;
+function mr(e) {
   return e === 12288 || e >= 65281 && e <= 65376 || e >= 65504 && e <= 65510;
 }
-function vr(e) {
+function Er(e) {
   return e >= 4352 && e <= 4447 || e === 8986 || e === 8987 || e === 9001 || e === 9002 || e >= 9193 && e <= 9196 || e === 9200 || e === 9203 || e === 9725 || e === 9726 || e === 9748 || e === 9749 || e >= 9776 && e <= 9783 || e >= 9800 && e <= 9811 || e === 9855 || e >= 9866 && e <= 9871 || e === 9875 || e === 9889 || e === 9898 || e === 9899 || e === 9917 || e === 9918 || e === 9924 || e === 9925 || e === 9934 || e === 9940 || e === 9962 || e === 9970 || e === 9971 || e === 9973 || e === 9978 || e === 9981 || e === 9989 || e === 9994 || e === 9995 || e === 10024 || e === 10060 || e === 10062 || e >= 10067 && e <= 10069 || e === 10071 || e >= 10133 && e <= 10135 || e === 10160 || e === 10175 || e === 11035 || e === 11036 || e === 11088 || e === 11093 || e >= 11904 && e <= 11929 || e >= 11931 && e <= 12019 || e >= 12032 && e <= 12245 || e >= 12272 && e <= 12287 || e >= 12289 && e <= 12350 || e >= 12353 && e <= 12438 || e >= 12441 && e <= 12543 || e >= 12549 && e <= 12591 || e >= 12593 && e <= 12686 || e >= 12688 && e <= 12773 || e >= 12783 && e <= 12830 || e >= 12832 && e <= 12871 || e >= 12880 && e <= 42124 || e >= 42128 && e <= 42182 || e >= 43360 && e <= 43388 || e >= 44032 && e <= 55203 || e >= 63744 && e <= 64255 || e >= 65040 && e <= 65049 || e >= 65072 && e <= 65106 || e >= 65108 && e <= 65126 || e >= 65128 && e <= 65131 || e >= 94176 && e <= 94180 || e === 94192 || e === 94193 || e >= 94208 && e <= 100343 || e >= 100352 && e <= 101589 || e >= 101631 && e <= 101640 || e >= 110576 && e <= 110579 || e >= 110581 && e <= 110587 || e === 110589 || e === 110590 || e >= 110592 && e <= 110882 || e === 110898 || e >= 110928 && e <= 110930 || e === 110933 || e >= 110948 && e <= 110951 || e >= 110960 && e <= 111355 || e >= 119552 && e <= 119638 || e >= 119648 && e <= 119670 || e === 126980 || e === 127183 || e === 127374 || e >= 127377 && e <= 127386 || e >= 127488 && e <= 127490 || e >= 127504 && e <= 127547 || e >= 127552 && e <= 127560 || e === 127568 || e === 127569 || e >= 127584 && e <= 127589 || e >= 127744 && e <= 127776 || e >= 127789 && e <= 127797 || e >= 127799 && e <= 127868 || e >= 127870 && e <= 127891 || e >= 127904 && e <= 127946 || e >= 127951 && e <= 127955 || e >= 127968 && e <= 127984 || e === 127988 || e >= 127992 && e <= 128062 || e === 128064 || e >= 128066 && e <= 128252 || e >= 128255 && e <= 128317 || e >= 128331 && e <= 128334 || e >= 128336 && e <= 128359 || e === 128378 || e === 128405 || e === 128406 || e === 128420 || e >= 128507 && e <= 128591 || e >= 128640 && e <= 128709 || e === 128716 || e >= 128720 && e <= 128722 || e >= 128725 && e <= 128727 || e >= 128732 && e <= 128735 || e === 128747 || e === 128748 || e >= 128756 && e <= 128764 || e >= 128992 && e <= 129003 || e === 129008 || e >= 129292 && e <= 129338 || e >= 129340 && e <= 129349 || e >= 129351 && e <= 129535 || e >= 129648 && e <= 129660 || e >= 129664 && e <= 129673 || e >= 129679 && e <= 129734 || e >= 129742 && e <= 129756 || e >= 129759 && e <= 129769 || e >= 129776 && e <= 129784 || e >= 131072 && e <= 196605 || e >= 196608 && e <= 262141;
 }
-var Br = (e) => !(yr(e) || vr(e)), br = /[^\x20-\x7F]/u;
-function Ar(e) {
-  if (!e)
-    return 0;
-  if (!br.test(e))
-    return e.length;
-  e = e.replace(gr(), "  ");
+var gr = (e) => !(mr(e) || Er(e)), yr = /[^\x20-\x7F]/u;
+function vr(e) {
+  if (!e) return 0;
+  if (!yr.test(e)) return e.length;
+  e = e.replace(Cr(), "  ");
   let u = 0;
   for (let t of e) {
     let r = t.codePointAt(0);
-    r <= 31 || r >= 127 && r <= 159 || r >= 768 && r <= 879 || (u += Br(r) ? 1 : 2);
+    r <= 31 || r >= 127 && r <= 159 || r >= 768 && r <= 879 || (u += gr(r) ? 1 : 2);
   }
   return u;
 }
-var He = Ar, A = Symbol("MODE_BREAK"), x = Symbol("MODE_FLAT"), ee = Symbol("cursor"), Ie = Symbol("DOC_FILL_PRINTED_LENGTH");
-function qu() {
+var Ge = vr, A = /* @__PURE__ */ Symbol("MODE_BREAK"), x = /* @__PURE__ */ Symbol("MODE_FLAT"), ee = /* @__PURE__ */ Symbol("cursor"), Te = /* @__PURE__ */ Symbol("DOC_FILL_PRINTED_LENGTH");
+function zu() {
   return { value: "", length: 0, queue: [] };
 }
-function wr(e, u) {
-  return Pe(e, { type: "indent" }, u);
+function Br(e, u) {
+  return Ie(e, { type: "indent" }, u);
 }
-function kr(e, u, t) {
-  return u === Number.NEGATIVE_INFINITY ? e.root || qu() : u < 0 ? Pe(e, { type: "dedent" }, t) : u ? u.type === "root" ? { ...e, root: e } : Pe(e, { type: typeof u == "string" ? "stringAlign" : "numberAlign", n: u }, t) : e;
+function br(e, u, t) {
+  return u === Number.NEGATIVE_INFINITY ? e.root || zu() : u < 0 ? Ie(e, { type: "dedent" }, t) : u ? u.type === "root" ? { ...e, root: e } : Ie(e, { type: typeof u == "string" ? "stringAlign" : "numberAlign", n: u }, t) : e;
 }
-function Pe(e, u, t) {
-  let r = u.type === "dedent" ? e.queue.slice(0, -1) : [...e.queue, u], n = "", D = 0, i = 0, o = 0;
-  for (let f of r)
-    switch (f.type) {
-      case "indent":
-        c(), t.useTabs ? a(1) : s(t.tabWidth);
-        break;
-      case "stringAlign":
-        c(), n += f.n, D += f.n.length;
-        break;
-      case "numberAlign":
-        i += 1, o += f.n;
-        break;
-      default:
-        throw new Error(`Unexpected type '${f.type}'`);
-    }
+function Ie(e, u, t) {
+  let r = u.type === "dedent" ? e.queue.slice(0, -1) : [...e.queue, u], n = "", D = 0, a = 0, i = 0;
+  for (let f of r) switch (f.type) {
+    case "indent":
+      c(), t.useTabs ? o(1) : s(t.tabWidth);
+      break;
+    case "stringAlign":
+      c(), n += f.n, D += f.n.length;
+      break;
+    case "numberAlign":
+      a += 1, i += f.n;
+      break;
+    default:
+      throw new Error(`Unexpected type '${f.type}'`);
+  }
   return l(), { ...e, value: n, length: D, queue: r };
-  function a(f) {
+  function o(f) {
     n += "	".repeat(f), D += t.tabWidth * f;
   }
   function s(f) {
@@ -710,249 +635,229 @@ function Pe(e, u, t) {
     t.useTabs ? F() : l();
   }
   function F() {
-    i > 0 && a(i), d();
+    a > 0 && o(a), d();
   }
   function l() {
-    o > 0 && s(o), d();
+    i > 0 && s(i), d();
   }
   function d() {
-    i = 0, o = 0;
+    a = 0, i = 0;
   }
 }
-function $e(e) {
+function Pe(e) {
   let u = 0, t = 0, r = e.length;
-  e:
-    for (; r--; ) {
-      let n = e[r];
-      if (n === ee) {
-        t++;
-        continue;
-      }
-      for (let D = n.length - 1; D >= 0; D--) {
-        let i = n[D];
-        if (i === " " || i === "	")
-          u++;
-        else {
-          e[r] = n.slice(0, D + 1);
-          break e;
-        }
+  e: for (; r--; ) {
+    let n = e[r];
+    if (n === ee) {
+      t++;
+      continue;
+    }
+    for (let D = n.length - 1; D >= 0; D--) {
+      let a = n[D];
+      if (a === " " || a === "	") u++;
+      else {
+        e[r] = n.slice(0, D + 1);
+        break e;
       }
     }
-  if (u > 0 || t > 0)
-    for (e.length = r + 1; t-- > 0; )
-      e.push(ee);
+  }
+  if (u > 0 || t > 0) for (e.length = r + 1; t-- > 0; ) e.push(ee);
   return u;
 }
-function de(e, u, t, r, n, D) {
-  if (t === Number.POSITIVE_INFINITY)
-    return !0;
-  let i = u.length, o = [e], a = [];
+function fe(e, u, t, r, n, D) {
+  if (t === Number.POSITIVE_INFINITY) return !0;
+  let a = u.length, i = [e], o = [];
   for (; t >= 0; ) {
-    if (o.length === 0) {
-      if (i === 0)
-        return !0;
-      o.push(u[--i]);
+    if (i.length === 0) {
+      if (a === 0) return !0;
+      i.push(u[--a]);
       continue;
     }
-    let { mode: s, doc: c } = o.pop(), F = X(c);
+    let { mode: s, doc: c } = i.pop(), F = X(c);
     switch (F) {
       case Q:
-        a.push(c), t -= He(c);
+        o.push(c), t -= Ge(c);
         break;
       case T:
       case O: {
-        let l = F === T ? c : c.parts, d = c[Ie] ?? 0;
-        for (let f = l.length - 1; f >= d; f--)
-          o.push({ mode: s, doc: l[f] });
+        let l = F === T ? c : c.parts, d = c[Te] ?? 0;
+        for (let f = l.length - 1; f >= d; f--) i.push({ mode: s, doc: l[f] });
         break;
       }
       case I:
       case P:
       case L:
       case _:
-        o.push({ mode: s, doc: c.contents });
+        i.push({ mode: s, doc: c.contents });
         break;
       case $:
-        t += $e(a);
+        t += Pe(o);
         break;
       case w: {
-        if (D && c.break)
-          return !1;
+        if (D && c.break) return !1;
         let l = c.break ? A : s, d = c.expandedStates && l === A ? v(!1, c.expandedStates, -1) : c.contents;
-        o.push({ mode: l, doc: d });
+        i.push({ mode: l, doc: d });
         break;
       }
       case k: {
         let l = (c.groupId ? n[c.groupId] || x : s) === A ? c.breakContents : c.flatContents;
-        l && o.push({ mode: s, doc: l });
+        l && i.push({ mode: s, doc: l });
         break;
       }
       case b:
-        if (s === A || c.hard)
-          return !0;
-        c.soft || (a.push(" "), t--);
+        if (s === A || c.hard) return !0;
+        c.soft || (o.push(" "), t--);
         break;
       case R:
         r = !0;
         break;
-      case M:
-        if (r)
-          return !1;
+      case W:
+        if (r) return !1;
         break;
     }
   }
   return !1;
 }
-function ve(e, u) {
-  let t = {}, r = u.printWidth, n = qe(u.endOfLine), D = 0, i = [{ ind: qu(), mode: A, doc: e }], o = [], a = !1, s = [], c = 0;
-  for (Qt(e); i.length > 0; ) {
-    let { ind: l, mode: d, doc: f } = i.pop();
+function ye(e, u) {
+  let t = {}, r = u.printWidth, n = ze(u.endOfLine), D = 0, a = [{ ind: zu(), mode: A, doc: e }], i = [], o = !1, s = [], c = 0;
+  for (Kt(e); a.length > 0; ) {
+    let { ind: l, mode: d, doc: f } = a.pop();
     switch (X(f)) {
       case Q: {
         let h = n !== `
-` ? Ee(!1, f, `
+` ? me(!1, f, `
 `, n) : f;
-        o.push(h), i.length > 0 && (D += He(h));
+        i.push(h), a.length > 0 && (D += Ge(h));
         break;
       }
       case T:
-        for (let h = f.length - 1; h >= 0; h--)
-          i.push({ ind: l, mode: d, doc: f[h] });
+        for (let h = f.length - 1; h >= 0; h--) a.push({ ind: l, mode: d, doc: f[h] });
         break;
       case q:
-        if (c >= 2)
-          throw new Error("There are too many 'cursor' in doc.");
-        o.push(ee), c++;
+        if (c >= 2) throw new Error("There are too many 'cursor' in doc.");
+        i.push(ee), c++;
         break;
       case I:
-        i.push({ ind: wr(l, u), mode: d, doc: f.contents });
+        a.push({ ind: Br(l, u), mode: d, doc: f.contents });
         break;
       case P:
-        i.push({ ind: kr(l, f.n, u), mode: d, doc: f.contents });
+        a.push({ ind: br(l, f.n, u), mode: d, doc: f.contents });
         break;
       case $:
-        D -= $e(o);
+        D -= Pe(i);
         break;
       case w:
         switch (d) {
           case x:
-            if (!a) {
-              i.push({ ind: l, mode: f.break ? A : x, doc: f.contents });
+            if (!o) {
+              a.push({ ind: l, mode: f.break ? A : x, doc: f.contents });
               break;
             }
           case A: {
-            a = !1;
+            o = !1;
             let h = { ind: l, mode: x, doc: f.contents }, p = r - D, C = s.length > 0;
-            if (!f.break && de(h, i, p, C, t))
-              i.push(h);
+            if (!f.break && fe(h, a, p, C, t)) a.push(h);
             else if (f.expandedStates) {
               let E = v(!1, f.expandedStates, -1);
               if (f.break) {
-                i.push({ ind: l, mode: A, doc: E });
+                a.push({ ind: l, mode: A, doc: E });
                 break;
-              } else
-                for (let m = 1; m < f.expandedStates.length + 1; m++)
-                  if (m >= f.expandedStates.length) {
-                    i.push({ ind: l, mode: A, doc: E });
-                    break;
-                  } else {
-                    let y = f.expandedStates[m], g = { ind: l, mode: x, doc: y };
-                    if (de(g, i, p, C, t)) {
-                      i.push(g);
-                      break;
-                    }
-                  }
-            } else
-              i.push({ ind: l, mode: A, doc: f.contents });
+              } else for (let m = 1; m < f.expandedStates.length + 1; m++) if (m >= f.expandedStates.length) {
+                a.push({ ind: l, mode: A, doc: E });
+                break;
+              } else {
+                let y = f.expandedStates[m], g = { ind: l, mode: x, doc: y };
+                if (fe(g, a, p, C, t)) {
+                  a.push(g);
+                  break;
+                }
+              }
+            } else a.push({ ind: l, mode: A, doc: f.contents });
             break;
           }
         }
-        f.id && (t[f.id] = v(!1, i, -1).mode);
+        f.id && (t[f.id] = v(!1, a, -1).mode);
         break;
       case O: {
-        let h = r - D, p = f[Ie] ?? 0, { parts: C } = f, E = C.length - p;
-        if (E === 0)
-          break;
-        let m = C[p + 0], y = C[p + 1], g = { ind: l, mode: x, doc: m }, B = { ind: l, mode: A, doc: m }, W = de(g, [], h, s.length > 0, t, !0);
+        let h = r - D, p = f[Te] ?? 0, { parts: C } = f, E = C.length - p;
+        if (E === 0) break;
+        let m = C[p + 0], y = C[p + 1], g = { ind: l, mode: x, doc: m }, B = { ind: l, mode: A, doc: m }, M = fe(g, [], h, s.length > 0, t, !0);
         if (E === 1) {
-          W ? i.push(g) : i.push(B);
+          M ? a.push(g) : a.push(B);
           break;
         }
-        let ce = { ind: l, mode: x, doc: y }, we = { ind: l, mode: A, doc: y };
+        let ce = { ind: l, mode: x, doc: y }, Ae = { ind: l, mode: A, doc: y };
         if (E === 2) {
-          W ? i.push(ce, g) : i.push(we, B);
+          M ? a.push(ce, g) : a.push(Ae, B);
           break;
         }
-        let yt = C[p + 2], ke = { ind: l, mode: d, doc: { ...f, [Ie]: p + 2 } };
-        de({ ind: l, mode: x, doc: [m, y, yt] }, [], h, s.length > 0, t, !0) ? i.push(ke, ce, g) : W ? i.push(ke, we, g) : i.push(ke, we, B);
+        let gt = C[p + 2], we = { ind: l, mode: d, doc: { ...f, [Te]: p + 2 } };
+        fe({ ind: l, mode: x, doc: [m, y, gt] }, [], h, s.length > 0, t, !0) ? a.push(we, ce, g) : M ? a.push(we, Ae, g) : a.push(we, Ae, B);
         break;
       }
       case k:
       case L: {
         let h = f.groupId ? t[f.groupId] : d;
         if (h === A) {
-          let p = f.type === k ? f.breakContents : f.negate ? f.contents : me(f.contents);
-          p && i.push({ ind: l, mode: d, doc: p });
+          let p = f.type === k ? f.breakContents : f.negate ? f.contents : Ce(f.contents);
+          p && a.push({ ind: l, mode: d, doc: p });
         }
         if (h === x) {
-          let p = f.type === k ? f.flatContents : f.negate ? me(f.contents) : f.contents;
-          p && i.push({ ind: l, mode: d, doc: p });
+          let p = f.type === k ? f.flatContents : f.negate ? Ce(f.contents) : f.contents;
+          p && a.push({ ind: l, mode: d, doc: p });
         }
         break;
       }
       case R:
         s.push({ ind: l, mode: d, doc: f.contents });
         break;
-      case M:
-        s.length > 0 && i.push({ ind: l, mode: d, doc: Ge });
+      case W:
+        s.length > 0 && a.push({ ind: l, mode: d, doc: Je });
         break;
       case b:
         switch (d) {
           case x:
-            if (f.hard)
-              a = !0;
+            if (f.hard) o = !0;
             else {
-              f.soft || (o.push(" "), D += 1);
+              f.soft || (i.push(" "), D += 1);
               break;
             }
           case A:
             if (s.length > 0) {
-              i.push({ ind: l, mode: d, doc: f }, ...s.reverse()), s.length = 0;
+              a.push({ ind: l, mode: d, doc: f }, ...s.reverse()), s.length = 0;
               break;
             }
-            f.literal ? l.root ? (o.push(n, l.root.value), D = l.root.length) : (o.push(n), D = 0) : (D -= $e(o), o.push(n + l.value), D = l.length);
+            f.literal ? l.root ? (i.push(n, l.root.value), D = l.root.length) : (i.push(n), D = 0) : (D -= Pe(i), i.push(n + l.value), D = l.length);
             break;
         }
         break;
       case _:
-        i.push({ ind: l, mode: d, doc: f.contents });
+        a.push({ ind: l, mode: d, doc: f.contents });
         break;
       case S:
         break;
       default:
         throw new te(f);
     }
-    i.length === 0 && s.length > 0 && (i.push(...s.reverse()), s.length = 0);
+    a.length === 0 && s.length > 0 && (a.push(...s.reverse()), s.length = 0);
   }
-  let F = o.indexOf(ee);
+  let F = i.indexOf(ee);
   if (F !== -1) {
-    let l = o.indexOf(ee, F + 1);
-    if (l === -1)
-      return { formatted: o.filter((p) => p !== ee).join("") };
-    let d = o.slice(0, F).join(""), f = o.slice(F + 1, l).join(""), h = o.slice(l + 1).join("");
+    let l = i.indexOf(ee, F + 1);
+    if (l === -1) return { formatted: i.filter((p) => p !== ee).join("") };
+    let d = i.slice(0, F).join(""), f = i.slice(F + 1, l).join(""), h = i.slice(l + 1).join("");
     return { formatted: d + f + h, cursorNodeStart: d.length, cursorNodeText: f };
   }
-  return { formatted: o.join("") };
+  return { formatted: i.join("") };
 }
-function Sr(e, u, t = 0) {
+function Ar(e, u, t = 0) {
   let r = 0;
-  for (let n = t; n < e.length; ++n)
-    e[n] === "	" ? r = r + u - r % u : r++;
+  for (let n = t; n < e.length; ++n) e[n] === "	" ? r = r + u - r % u : r++;
   return r;
 }
-var Ke = Sr, J, Le, he, xr = class {
+var He = Ar, J, $e, pe, wr = class {
   constructor(e) {
-    jt(this, J), this.stack = [e];
+    Nt(this, J), this.stack = [e];
   }
   get key() {
     let { stack: e, siblings: u } = this;
@@ -999,7 +904,7 @@ var Ke = Sr, J, Le, he, xr = class {
     return this.stack[0];
   }
   get ancestors() {
-    return [...De(this, J, he).call(this)];
+    return [...De(this, J, pe).call(this)];
   }
   getName() {
     let { stack: e } = this, { length: u } = e;
@@ -1009,7 +914,7 @@ var Ke = Sr, J, Le, he, xr = class {
     return v(!1, this.stack, -1);
   }
   getNode(e = 0) {
-    let u = De(this, J, Le).call(this, e);
+    let u = De(this, J, $e).call(this, e);
     return u === -1 ? null : this.stack[u];
   }
   getParentNode(e = 0) {
@@ -1017,8 +922,7 @@ var Ke = Sr, J, Le, he, xr = class {
   }
   call(e, ...u) {
     let { stack: t } = this, { length: r } = t, n = v(!1, t, -1);
-    for (let D of u)
-      n = n[D], t.push(D, n);
+    for (let D of u) n = n[D], t.push(D, n);
     try {
       return e(this);
     } finally {
@@ -1026,7 +930,7 @@ var Ke = Sr, J, Le, he, xr = class {
     }
   }
   callParent(e, u = 0) {
-    let t = De(this, J, Le).call(this, u + 1), r = this.stack.splice(t + 1);
+    let t = De(this, J, $e).call(this, u + 1), r = this.stack.splice(t + 1);
     try {
       return e(this);
     } finally {
@@ -1035,11 +939,9 @@ var Ke = Sr, J, Le, he, xr = class {
   }
   each(e, ...u) {
     let { stack: t } = this, { length: r } = t, n = v(!1, t, -1);
-    for (let D of u)
-      n = n[D], t.push(D, n);
+    for (let D of u) n = n[D], t.push(D, n);
     try {
-      for (let D = 0; D < n.length; ++D)
-        t.push(D, n[D]), e(this, D, n), t.length -= 2;
+      for (let D = 0; D < n.length; ++D) t.push(D, n[D]), e(this, D, n), t.length -= 2;
     } finally {
       t.length = r;
     }
@@ -1053,340 +955,285 @@ var Ke = Sr, J, Le, he, xr = class {
   match(...e) {
     let u = this.stack.length - 1, t = null, r = this.stack[u--];
     for (let n of e) {
-      if (r === void 0)
-        return !1;
+      if (r === void 0) return !1;
       let D = null;
-      if (typeof t == "number" && (D = t, t = this.stack[u--], r = this.stack[u--]), n && !n(r, t, D))
-        return !1;
+      if (typeof t == "number" && (D = t, t = this.stack[u--], r = this.stack[u--]), n && !n(r, t, D)) return !1;
       t = this.stack[u--], r = this.stack[u--];
     }
     return !0;
   }
   findAncestor(e) {
-    for (let u of De(this, J, he).call(this))
-      if (e(u))
-        return u;
+    for (let u of De(this, J, pe).call(this)) if (e(u)) return u;
   }
   hasAncestor(e) {
-    for (let u of De(this, J, he).call(this))
-      if (e(u))
-        return !0;
+    for (let u of De(this, J, pe).call(this)) if (e(u)) return !0;
     return !1;
   }
 };
-J = /* @__PURE__ */ new WeakSet(), Le = function(e) {
+J = /* @__PURE__ */ new WeakSet(), $e = function(e) {
   let { stack: u } = this;
-  for (let t = u.length - 1; t >= 0; t -= 2)
-    if (!Array.isArray(u[t]) && --e < 0)
-      return t;
+  for (let t = u.length - 1; t >= 0; t -= 2) if (!Array.isArray(u[t]) && --e < 0) return t;
   return -1;
-}, he = function* () {
+}, pe = function* () {
   let { stack: e } = this;
   for (let u = e.length - 3; u >= 0; u -= 2) {
     let t = e[u];
     Array.isArray(t) || (yield t);
   }
 };
-var Nr = xr, Uu = new Proxy(() => {
-}, { get: () => Uu }), Re = Uu;
-function Or(e) {
+var kr = wr, qu = new Proxy(() => {
+}, { get: () => qu }), Le = qu;
+function Sr(e) {
   return e !== null && typeof e == "object";
 }
-var _r = Or;
-function* Be(e, u) {
-  let { getVisitorKeys: t, filter: r = () => !0 } = u, n = (D) => _r(D) && r(D);
+var xr = Sr;
+function* ve(e, u) {
+  let { getVisitorKeys: t, filter: r = () => !0 } = u, n = (D) => xr(D) && r(D);
   for (let D of t(e)) {
-    let i = e[D];
-    if (Array.isArray(i))
-      for (let o of i)
-        n(o) && (yield o);
-    else
-      n(i) && (yield i);
+    let a = e[D];
+    if (Array.isArray(a)) for (let i of a) n(i) && (yield i);
+    else n(a) && (yield a);
   }
 }
-function* jr(e, u) {
+function* Nr(e, u) {
   let t = [e];
   for (let r = 0; r < t.length; r++) {
     let n = t[r];
-    for (let D of Be(n, u))
-      yield D, t.push(D);
+    for (let D of ve(n, u)) yield D, t.push(D);
   }
 }
-function Tr(e, u) {
-  return Be(e, u).next().done;
+function Or(e, u) {
+  return ve(e, u).next().done;
 }
 function se(e) {
   return (u, t, r) => {
     let n = !!(r != null && r.backwards);
-    if (t === !1)
-      return !1;
-    let { length: D } = u, i = t;
-    for (; i >= 0 && i < D; ) {
-      let o = u.charAt(i);
+    if (t === !1) return !1;
+    let { length: D } = u, a = t;
+    for (; a >= 0 && a < D; ) {
+      let i = u.charAt(a);
       if (e instanceof RegExp) {
-        if (!e.test(o))
-          return i;
-      } else if (!e.includes(o))
-        return i;
-      n ? i-- : i++;
+        if (!e.test(i)) return a;
+      } else if (!e.includes(i)) return a;
+      n ? a-- : a++;
     }
-    return i === -1 || i === D ? i : !1;
+    return a === -1 || a === D ? a : !1;
   };
 }
-var Ir = se(/\s/u), z = se(" 	"), Ju = se(",; 	"), Gu = se(/[^\n\r]/u);
-function Pr(e, u, t) {
+var _r = se(/\s/u), z = se(" 	"), Uu = se(",; 	"), Ju = se(/[^\n\r]/u);
+function jr(e, u, t) {
   let r = !!(t != null && t.backwards);
-  if (u === !1)
-    return !1;
+  if (u === !1) return !1;
   let n = e.charAt(u);
   if (r) {
     if (e.charAt(u - 1) === "\r" && n === `
-`)
-      return u - 2;
+`) return u - 2;
     if (n === `
-` || n === "\r" || n === "\u2028" || n === "\u2029")
-      return u - 1;
+` || n === "\r" || n === "\u2028" || n === "\u2029") return u - 1;
   } else {
     if (n === "\r" && e.charAt(u + 1) === `
-`)
-      return u + 2;
+`) return u + 2;
     if (n === `
-` || n === "\r" || n === "\u2028" || n === "\u2029")
-      return u + 1;
+` || n === "\r" || n === "\u2028" || n === "\u2029") return u + 1;
   }
   return u;
 }
-var Z = Pr;
-function $r(e, u, t = {}) {
+var Z = jr;
+function Tr(e, u, t = {}) {
   let r = z(e, t.backwards ? u - 1 : u, t), n = Z(e, r, t);
   return r !== n;
 }
-var V = $r;
-function Lr(e) {
+var V = Tr;
+function Ir(e) {
   return Array.isArray(e) && e.length > 0;
 }
-var Rr = Lr, Hu = /* @__PURE__ */ new Set(["tokens", "comments", "parent", "enclosingNode", "precedingNode", "followingNode"]), Mr = (e) => Object.keys(e).filter((u) => !Hu.has(u));
-function Wr(e) {
-  return e ? (u) => e(u, Hu) : Mr;
+var Pr = Ir, Gu = /* @__PURE__ */ new Set(["tokens", "comments", "parent", "enclosingNode", "precedingNode", "followingNode"]), $r = (e) => Object.keys(e).filter((u) => !Gu.has(u));
+function Lr(e) {
+  return e ? (u) => e(u, Gu) : $r;
 }
-var be = Wr;
-function Vr(e) {
+var Be = Lr;
+function Rr(e) {
   let u = e.type || e.kind || "(unknown type)", t = String(e.name || e.id && (typeof e.id == "object" ? e.id.name : e.id) || e.key && (typeof e.key == "object" ? e.key.name : e.key) || e.value && (typeof e.value == "object" ? "" : String(e.value)) || e.operator || "");
   return t.length > 20 && (t = t.slice(0, 19) + "…"), u + (t ? " " + t : "");
 }
-function Ye(e, u) {
-  (e.comments ?? (e.comments = [])).push(u), u.printed = !1, u.nodeDescription = Vr(e);
+function Ke(e, u) {
+  (e.comments ?? (e.comments = [])).push(u), u.printed = !1, u.nodeDescription = Rr(e);
 }
-function oe(e, u) {
-  u.leading = !0, u.trailing = !1, Ye(e, u);
+function ie(e, u) {
+  u.leading = !0, u.trailing = !1, Ke(e, u);
 }
 function G(e, u, t) {
-  u.leading = !1, u.trailing = !1, t && (u.marker = t), Ye(e, u);
-}
-function ae(e, u) {
-  u.leading = !1, u.trailing = !0, Ye(e, u);
-}
-var Se = /* @__PURE__ */ new WeakMap();
-function Ze(e, u) {
-  if (Se.has(e))
-    return Se.get(e);
-  let { printer: { getCommentChildNodes: t, canAttachComment: r, getVisitorKeys: n }, locStart: D, locEnd: i } = u;
-  if (!r)
-    return [];
-  let o = ((t == null ? void 0 : t(e, u)) ?? [...Be(e, { getVisitorKeys: be(n) })]).flatMap((a) => r(a) ? [a] : Ze(a, u));
-  return o.sort((a, s) => D(a) - D(s) || i(a) - i(s)), Se.set(e, o), o;
-}
-function Ku(e, u, t, r) {
-  let { locStart: n, locEnd: D } = t, i = n(u), o = D(u), a = Ze(e, t), s, c, F = 0, l = a.length;
+  u.leading = !1, u.trailing = !1, t && (u.marker = t), Ke(e, u);
+}
+function oe(e, u) {
+  u.leading = !1, u.trailing = !0, Ke(e, u);
+}
+var ke = /* @__PURE__ */ new WeakMap();
+function Ye(e, u) {
+  if (ke.has(e)) return ke.get(e);
+  let { printer: { getCommentChildNodes: t, canAttachComment: r, getVisitorKeys: n }, locStart: D, locEnd: a } = u;
+  if (!r) return [];
+  let i = (t?.(e, u) ?? [...ve(e, { getVisitorKeys: Be(n) })]).flatMap((o) => r(o) ? [o] : Ye(o, u));
+  return i.sort((o, s) => D(o) - D(s) || a(o) - a(s)), ke.set(e, i), i;
+}
+function Hu(e, u, t, r) {
+  let { locStart: n, locEnd: D } = t, a = n(u), i = D(u), o = Ye(e, t), s, c, F = 0, l = o.length;
   for (; F < l; ) {
-    let d = F + l >> 1, f = a[d], h = n(f), p = D(f);
-    if (h <= i && o <= p)
-      return Ku(f, u, t, f);
-    if (p <= i) {
+    let d = F + l >> 1, f = o[d], h = n(f), p = D(f);
+    if (h <= a && i <= p) return Hu(f, u, t, f);
+    if (p <= a) {
       s = f, F = d + 1;
       continue;
     }
-    if (o <= h) {
+    if (i <= h) {
       c = f, l = d;
       continue;
     }
     throw new Error("Comment location overlaps with node location");
   }
-  if ((r == null ? void 0 : r.type) === "TemplateLiteral") {
-    let { quasis: d } = r, f = Ne(d, u, t);
-    s && Ne(d, s, t) !== f && (s = null), c && Ne(d, c, t) !== f && (c = null);
+  if (r?.type === "TemplateLiteral") {
+    let { quasis: d } = r, f = xe(d, u, t);
+    s && xe(d, s, t) !== f && (s = null), c && xe(d, c, t) !== f && (c = null);
   }
   return { enclosingNode: r, precedingNode: s, followingNode: c };
 }
-var xe = () => !1;
-function zr(e, u) {
+var Se = () => !1;
+function Wr(e, u) {
   let { comments: t } = e;
-  if (delete e.comments, !Rr(t) || !u.printer.canAttachComment)
-    return;
-  let r = [], { printer: { experimentalFeatures: { avoidAstMutation: n = !1 } = {}, handleComments: D = {} }, originalText: i } = u, { ownLine: o = xe, endOfLine: a = xe, remaining: s = xe } = D, c = t.map((F, l) => ({ ...Ku(e, F, u), comment: F, text: i, options: u, ast: e, isLastComment: t.length - 1 === l }));
+  if (delete e.comments, !Pr(t) || !u.printer.canAttachComment) return;
+  let r = [], { printer: { experimentalFeatures: { avoidAstMutation: n = !1 } = {}, handleComments: D = {} }, originalText: a } = u, { ownLine: i = Se, endOfLine: o = Se, remaining: s = Se } = D, c = t.map((F, l) => ({ ...Hu(e, F, u), comment: F, text: a, options: u, ast: e, isLastComment: t.length - 1 === l }));
   for (let [F, l] of c.entries()) {
     let { comment: d, precedingNode: f, enclosingNode: h, followingNode: p, text: C, options: E, ast: m, isLastComment: y } = l, g;
-    if (n ? g = [l] : (d.enclosingNode = h, d.precedingNode = f, d.followingNode = p, g = [d, C, E, m, y]), qr(C, E, c, F))
-      d.placement = "ownLine", o(...g) || (p ? oe(p, d) : f ? ae(f, d) : G(h || m, d));
-    else if (Ur(C, E, c, F))
-      d.placement = "endOfLine", a(...g) || (f ? ae(f, d) : p ? oe(p, d) : G(h || m, d));
-    else if (d.placement = "remaining", !s(...g))
-      if (f && p) {
-        let B = r.length;
-        B > 0 && r[B - 1].followingNode !== p && ou(r, E), r.push(l);
-      } else
-        f ? ae(f, d) : p ? oe(p, d) : G(h || m, d);
-  }
-  if (ou(r, u), !n)
-    for (let F of t)
-      delete F.precedingNode, delete F.enclosingNode, delete F.followingNode;
-}
-var Yu = (e) => !/[\S\n\u2028\u2029]/u.test(e);
-function qr(e, u, t, r) {
-  let { comment: n, precedingNode: D } = t[r], { locStart: i, locEnd: o } = u, a = i(n);
-  if (D)
-    for (let s = r - 1; s >= 0; s--) {
-      let { comment: c, precedingNode: F } = t[s];
-      if (F !== D || !Yu(e.slice(o(c), a)))
-        break;
-      a = i(c);
-    }
-  return V(e, a, { backwards: !0 });
-}
-function Ur(e, u, t, r) {
-  let { comment: n, followingNode: D } = t[r], { locStart: i, locEnd: o } = u, a = o(n);
-  if (D)
-    for (let s = r + 1; s < t.length; s++) {
-      let { comment: c, followingNode: F } = t[s];
-      if (F !== D || !Yu(e.slice(a, i(c))))
-        break;
-      a = o(c);
-    }
-  return V(e, a);
-}
-function ou(e, u) {
+    if (n ? g = [l] : (d.enclosingNode = h, d.precedingNode = f, d.followingNode = p, g = [d, C, E, m, y]), Mr(C, E, c, F)) d.placement = "ownLine", i(...g) || (p ? ie(p, d) : f ? oe(f, d) : G(h || m, d));
+    else if (Vr(C, E, c, F)) d.placement = "endOfLine", o(...g) || (f ? oe(f, d) : p ? ie(p, d) : G(h || m, d));
+    else if (d.placement = "remaining", !s(...g)) if (f && p) {
+      let B = r.length;
+      B > 0 && r[B - 1].followingNode !== p && au(r, E), r.push(l);
+    } else f ? oe(f, d) : p ? ie(p, d) : G(h || m, d);
+  }
+  if (au(r, u), !n) for (let F of t) delete F.precedingNode, delete F.enclosingNode, delete F.followingNode;
+}
+var Ku = (e) => !/[\S\n\u2028\u2029]/u.test(e);
+function Mr(e, u, t, r) {
+  let { comment: n, precedingNode: D } = t[r], { locStart: a, locEnd: i } = u, o = a(n);
+  if (D) for (let s = r - 1; s >= 0; s--) {
+    let { comment: c, precedingNode: F } = t[s];
+    if (F !== D || !Ku(e.slice(i(c), o))) break;
+    o = a(c);
+  }
+  return V(e, o, { backwards: !0 });
+}
+function Vr(e, u, t, r) {
+  let { comment: n, followingNode: D } = t[r], { locStart: a, locEnd: i } = u, o = i(n);
+  if (D) for (let s = r + 1; s < t.length; s++) {
+    let { comment: c, followingNode: F } = t[s];
+    if (F !== D || !Ku(e.slice(o, a(c)))) break;
+    o = i(c);
+  }
+  return V(e, o);
+}
+function au(e, u) {
   var t, r;
   let n = e.length;
-  if (n === 0)
-    return;
-  let { precedingNode: D, followingNode: i } = e[0], o = u.locStart(i), a;
-  for (a = n; a > 0; --a) {
-    let { comment: s, precedingNode: c, followingNode: F } = e[a - 1];
-    Re.strictEqual(c, D), Re.strictEqual(F, i);
-    let l = u.originalText.slice(u.locEnd(s), o);
-    if (((r = (t = u.printer).isGap) == null ? void 0 : r.call(t, l, u)) ?? /^[\s(]*$/u.test(l))
-      o = u.locStart(s);
-    else
-      break;
-  }
-  for (let [s, { comment: c }] of e.entries())
-    s < a ? ae(D, c) : oe(i, c);
-  for (let s of [D, i])
-    s.comments && s.comments.length > 1 && s.comments.sort((c, F) => u.locStart(c) - u.locStart(F));
+  if (n === 0) return;
+  let { precedingNode: D, followingNode: a } = e[0], i = u.locStart(a), o;
+  for (o = n; o > 0; --o) {
+    let { comment: s, precedingNode: c, followingNode: F } = e[o - 1];
+    Le.strictEqual(c, D), Le.strictEqual(F, a);
+    let l = u.originalText.slice(u.locEnd(s), i);
+    if (((r = (t = u.printer).isGap) == null ? void 0 : r.call(t, l, u)) ?? /^[\s(]*$/u.test(l)) i = u.locStart(s);
+    else break;
+  }
+  for (let [s, { comment: c }] of e.entries()) s < o ? oe(D, c) : ie(a, c);
+  for (let s of [D, a]) s.comments && s.comments.length > 1 && s.comments.sort((c, F) => u.locStart(c) - u.locStart(F));
   e.length = 0;
 }
-function Ne(e, u, t) {
+function xe(e, u, t) {
   let r = t.locStart(u) - 1;
-  for (let n = 1; n < e.length; ++n)
-    if (r < t.locStart(e[n]))
-      return n - 1;
+  for (let n = 1; n < e.length; ++n) if (r < t.locStart(e[n])) return n - 1;
   return 0;
 }
-function Jr(e, u) {
+function zr(e, u) {
   let t = u - 1;
   t = z(e, t, { backwards: !0 }), t = Z(e, t, { backwards: !0 }), t = z(e, t, { backwards: !0 });
   let r = Z(e, t, { backwards: !0 });
   return t !== r;
 }
-var Qe = Jr;
-function Zu(e, u) {
+var Ze = zr;
+function Yu(e, u) {
   let t = e.node;
   return t.printed = !0, u.printer.printComment(e, u);
 }
-function Gr(e, u) {
+function qr(e, u) {
   var t;
-  let r = e.node, n = [Zu(e, u)], { printer: D, originalText: i, locStart: o, locEnd: a } = u;
+  let r = e.node, n = [Yu(e, u)], { printer: D, originalText: a, locStart: i, locEnd: o } = u;
   if ((t = D.isBlockComment) != null && t.call(D, r)) {
-    let c = V(i, a(r)) ? V(i, o(r), { backwards: !0 }) ? Y : Mu : " ";
+    let c = V(a, o(r)) ? V(a, i(r), { backwards: !0 }) ? Y : Ru : " ";
     n.push(c);
-  } else
-    n.push(Y);
-  let s = Z(i, z(i, a(r)));
-  return s !== !1 && V(i, s) && n.push(Y), n;
+  } else n.push(Y);
+  let s = Z(a, z(a, o(r)));
+  return s !== !1 && V(a, s) && n.push(Y), n;
 }
-function Hr(e, u, t) {
+function Ur(e, u, t) {
   var r;
-  let n = e.node, D = Zu(e, u), { printer: i, originalText: o, locStart: a } = u, s = (r = i.isBlockComment) == null ? void 0 : r.call(i, n);
-  if (t != null && t.hasLineSuffix && !(t != null && t.isBlock) || V(o, a(n), { backwards: !0 })) {
-    let c = Qe(o, a(n));
-    return { doc: Te([Y, c ? Y : "", D]), isBlock: s, hasLineSuffix: !0 };
+  let n = e.node, D = Yu(e, u), { printer: a, originalText: i, locStart: o } = u, s = (r = a.isBlockComment) == null ? void 0 : r.call(a, n);
+  if (t != null && t.hasLineSuffix && !(t != null && t.isBlock) || V(i, o(n), { backwards: !0 })) {
+    let c = Ze(i, o(n));
+    return { doc: je([Y, c ? Y : "", D]), isBlock: s, hasLineSuffix: !0 };
   }
-  return !s || t != null && t.hasLineSuffix ? { doc: [Te([" ", D]), ye], isBlock: s, hasLineSuffix: !0 } : { doc: [" ", D], isBlock: s, hasLineSuffix: !1 };
+  return !s || t != null && t.hasLineSuffix ? { doc: [je([" ", D]), ge], isBlock: s, hasLineSuffix: !0 } : { doc: [" ", D], isBlock: s, hasLineSuffix: !1 };
 }
-function Kr(e, u) {
+function Jr(e, u) {
   let t = e.node;
-  if (!t)
-    return {};
-  let r = u[Symbol.for("printedComments")];
-  if ((t.comments || []).filter((o) => !r.has(o)).length === 0)
-    return { leading: "", trailing: "" };
-  let n = [], D = [], i;
+  if (!t) return {};
+  let r = u[/* @__PURE__ */ Symbol.for("printedComments")];
+  if ((t.comments || []).filter((i) => !r.has(i)).length === 0) return { leading: "", trailing: "" };
+  let n = [], D = [], a;
   return e.each(() => {
-    let o = e.node;
-    if (r != null && r.has(o))
-      return;
-    let { leading: a, trailing: s } = o;
-    a ? n.push(Gr(e, u)) : s && (i = Hr(e, u, i), D.push(i.doc));
+    let i = e.node;
+    if (r != null && r.has(i)) return;
+    let { leading: o, trailing: s } = i;
+    o ? n.push(qr(e, u)) : s && (a = Ur(e, u, a), D.push(a.doc));
   }, "comments"), { leading: n, trailing: D };
 }
-function Yr(e, u, t) {
-  let { leading: r, trailing: n } = Kr(e, t);
-  return !r && !n ? u : pe(u, (D) => [r, D, n]);
+function Gr(e, u, t) {
+  let { leading: r, trailing: n } = Jr(e, t);
+  return !r && !n ? u : Fe(u, (D) => [r, D, n]);
 }
-function Zr(e) {
-  let { [Symbol.for("comments")]: u, [Symbol.for("printedComments")]: t } = e;
+function Hr(e) {
+  let { [/* @__PURE__ */ Symbol.for("comments")]: u, [/* @__PURE__ */ Symbol.for("printedComments")]: t } = e;
   for (let r of u) {
-    if (!r.printed && !t.has(r))
-      throw new Error('Comment "' + r.value.trim() + '" was not printed. Please report this error!');
+    if (!r.printed && !t.has(r)) throw new Error('Comment "' + r.value.trim() + '" was not printed. Please report this error!');
     delete r.printed;
   }
 }
-var Qu = class extends Error {
-  constructor() {
-    super(...arguments);
-    fe(this, "name", "ConfigError");
-  }
-}, au = class extends Error {
-  constructor() {
-    super(...arguments);
-    fe(this, "name", "UndefinedParserError");
-  }
-}, Qr = { checkIgnorePragma: { category: "Special", type: "boolean", default: !1, description: "Check whether the file's first docblock comment contains '@noprettier' or '@noformat' to determine if it should be formatted.", cliCategory: "Other" }, cursorOffset: { category: "Special", type: "int", default: -1, range: { start: -1, end: 1 / 0, step: 1 }, description: "Print (to stderr) where a cursor at the given position would move to after formatting.", cliCategory: "Editor" }, endOfLine: { category: "Global", type: "choice", default: "lf", description: "Which end of line characters to apply.", choices: [{ value: "lf", description: "Line Feed only (\\n), common on Linux and macOS as well as inside git repos" }, { value: "crlf", description: "Carriage Return + Line Feed characters (\\r\\n), common on Windows" }, { value: "cr", description: "Carriage Return character only (\\r), used very rarely" }, { value: "auto", description: `Maintain existing
+var Zu = class extends Error {
+  name = "ConfigError";
+}, iu = class extends Error {
+  name = "UndefinedParserError";
+}, Kr = { checkIgnorePragma: { category: "Special", type: "boolean", default: !1, description: "Check whether the file's first docblock comment contains '@noprettier' or '@noformat' to determine if it should be formatted.", cliCategory: "Other" }, cursorOffset: { category: "Special", type: "int", default: -1, range: { start: -1, end: 1 / 0, step: 1 }, description: "Print (to stderr) where a cursor at the given position would move to after formatting.", cliCategory: "Editor" }, endOfLine: { category: "Global", type: "choice", default: "lf", description: "Which end of line characters to apply.", choices: [{ value: "lf", description: "Line Feed only (\\n), common on Linux and macOS as well as inside git repos" }, { value: "crlf", description: "Carriage Return + Line Feed characters (\\r\\n), common on Windows" }, { value: "cr", description: "Carriage Return character only (\\r), used very rarely" }, { value: "auto", description: `Maintain existing
 (mixed values within one file are normalised by looking at what's used after the first line)` }] }, filepath: { category: "Special", type: "path", description: "Specify the input filepath. This will be used to do parser inference.", cliName: "stdin-filepath", cliCategory: "Other", cliDescription: "Path to the file to pretend that stdin comes from." }, insertPragma: { category: "Special", type: "boolean", default: !1, description: "Insert @format pragma into file's first docblock comment.", cliCategory: "Other" }, parser: { category: "Global", type: "choice", default: void 0, description: "Which parser to use.", exception: (e) => typeof e == "string" || typeof e == "function", choices: [{ value: "flow", description: "Flow" }, { value: "babel", description: "JavaScript" }, { value: "babel-flow", description: "Flow" }, { value: "babel-ts", description: "TypeScript" }, { value: "typescript", description: "TypeScript" }, { value: "acorn", description: "JavaScript" }, { value: "espree", description: "JavaScript" }, { value: "meriyah", description: "JavaScript" }, { value: "css", description: "CSS" }, { value: "less", description: "Less" }, { value: "scss", description: "SCSS" }, { value: "json", description: "JSON" }, { value: "json5", description: "JSON5" }, { value: "jsonc", description: "JSON with Comments" }, { value: "json-stringify", description: "JSON.stringify" }, { value: "graphql", description: "GraphQL" }, { value: "markdown", description: "Markdown" }, { value: "mdx", description: "MDX" }, { value: "vue", description: "Vue" }, { value: "yaml", description: "YAML" }, { value: "glimmer", description: "Ember / Handlebars" }, { value: "html", description: "HTML" }, { value: "angular", description: "Angular" }, { value: "lwc", description: "Lightning Web Components" }, { value: "mjml", description: "MJML" }] }, plugins: { type: "path", array: !0, default: [{ value: [] }], category: "Global", description: "Add a plugin. Multiple plugins can be passed as separate `--plugin`s.", exception: (e) => typeof e == "string" || typeof e == "object", cliName: "plugin", cliCategory: "Config" }, printWidth: { category: "Global", type: "int", default: 80, description: "The line length where Prettier will try wrap.", range: { start: 0, end: 1 / 0, step: 1 } }, rangeEnd: { category: "Special", type: "int", default: 1 / 0, range: { start: 0, end: 1 / 0, step: 1 }, description: `Format code ending at a given character offset (exclusive).
 The range will extend forwards to the end of the selected statement.`, cliCategory: "Editor" }, rangeStart: { category: "Special", type: "int", default: 0, range: { start: 0, end: 1 / 0, step: 1 }, description: `Format code starting at a given character offset.
 The range will extend backwards to the start of the first line containing the selected statement.`, cliCategory: "Editor" }, requirePragma: { category: "Special", type: "boolean", default: !1, description: "Require either '@prettier' or '@format' to be present in the file's first docblock comment in order for it to be formatted.", cliCategory: "Other" }, tabWidth: { type: "int", category: "Global", default: 2, description: "Number of spaces per indentation level.", range: { start: 0, end: 1 / 0, step: 1 } }, useTabs: { category: "Global", type: "boolean", default: !1, description: "Indent with tabs instead of spaces." }, embeddedLanguageFormatting: { category: "Global", type: "choice", default: "auto", description: "Control how Prettier formats quoted code embedded in the file.", choices: [{ value: "auto", description: "Format embedded code if Prettier can automatically identify it." }, { value: "off", description: "Never automatically format embedded code." }] } };
-function Xu({ plugins: e = [], showDeprecated: u = !1 } = {}) {
+function Qu({ plugins: e = [], showDeprecated: u = !1 } = {}) {
   let t = e.flatMap((n) => n.languages ?? []), r = [];
-  for (let n of en(Object.assign({}, ...e.map(({ options: D }) => D), Qr)))
-    !u && n.deprecated || (Array.isArray(n.choices) && (u || (n.choices = n.choices.filter((D) => !D.deprecated)), n.name === "parser" && (n.choices = [...n.choices, ...Xr(n.choices, t, e)])), n.pluginDefaults = Object.fromEntries(e.filter((D) => {
-      var i;
-      return ((i = D.defaultOptions) == null ? void 0 : i[n.name]) !== void 0;
-    }).map((D) => [D.name, D.defaultOptions[n.name]])), r.push(n));
+  for (let n of Zr(Object.assign({}, ...e.map(({ options: D }) => D), Kr))) !u && n.deprecated || (Array.isArray(n.choices) && (u || (n.choices = n.choices.filter((D) => !D.deprecated)), n.name === "parser" && (n.choices = [...n.choices, ...Yr(n.choices, t, e)])), n.pluginDefaults = Object.fromEntries(e.filter((D) => {
+    var a;
+    return ((a = D.defaultOptions) == null ? void 0 : a[n.name]) !== void 0;
+  }).map((D) => [D.name, D.defaultOptions[n.name]])), r.push(n));
   return { languages: t, options: r };
 }
-function* Xr(e, u, t) {
+function* Yr(e, u, t) {
   let r = new Set(e.map((n) => n.value));
-  for (let n of u)
-    if (n.parsers) {
-      for (let D of n.parsers)
-        if (!r.has(D)) {
-          r.add(D);
-          let i = t.find((a) => a.parsers && Object.prototype.hasOwnProperty.call(a.parsers, D)), o = n.name;
-          i != null && i.name && (o += ` (plugin: ${i.name})`), yield { value: D, description: o };
-        }
+  for (let n of u) if (n.parsers) {
+    for (let D of n.parsers) if (!r.has(D)) {
+      r.add(D);
+      let a = t.find((o) => o.parsers && Object.prototype.hasOwnProperty.call(o.parsers, D)), i = n.name;
+      a != null && a.name && (i += ` (plugin: ${a.name})`), yield { value: D, description: i };
     }
+  }
 }
-function en(e) {
+function Zr(e) {
   let u = [];
   for (let [t, r] of Object.entries(e)) {
     let n = { name: t, ...r };
@@ -1394,118 +1241,101 @@ function en(e) {
   }
   return u;
 }
-var un = (e, u) => {
-  if (!(e && u == null))
-    return u.toReversed || !Array.isArray(u) ? u.toReversed() : [...u].reverse();
-}, tn = un, su, lu, cu, fu, du, rn = ((su = globalThis.Deno) == null ? void 0 : su.build.os) === "windows" || ((cu = (lu = globalThis.navigator) == null ? void 0 : lu.platform) == null ? void 0 : cu.startsWith("Win")) || ((du = (fu = globalThis.process) == null ? void 0 : fu.platform) == null ? void 0 : du.startsWith("win")) || !1;
-function et(e) {
-  if (e = e instanceof URL ? e : new URL(e), e.protocol !== "file:")
-    throw new TypeError(`URL must be a file URL: received "${e.protocol}"`);
+var Qr = (e, u) => {
+  if (!(e && u == null)) return u.toReversed || !Array.isArray(u) ? u.toReversed() : [...u].reverse();
+}, Xr = Qr, ou, su, lu, cu, fu, en = ((ou = globalThis.Deno) == null ? void 0 : ou.build.os) === "windows" || ((lu = (su = globalThis.navigator) == null ? void 0 : su.platform) == null ? void 0 : lu.startsWith("Win")) || ((fu = (cu = globalThis.process) == null ? void 0 : cu.platform) == null ? void 0 : fu.startsWith("win")) || !1;
+function Xu(e) {
+  if (e = e instanceof URL ? e : new URL(e), e.protocol !== "file:") throw new TypeError(`URL must be a file URL: received "${e.protocol}"`);
   return e;
 }
-function nn(e) {
-  return e = et(e), decodeURIComponent(e.pathname.replace(/%(?![0-9A-Fa-f]{2})/g, "%25"));
+function un(e) {
+  return e = Xu(e), decodeURIComponent(e.pathname.replace(/%(?![0-9A-Fa-f]{2})/g, "%25"));
 }
-function Dn(e) {
-  e = et(e);
+function tn(e) {
+  e = Xu(e);
   let u = decodeURIComponent(e.pathname.replace(/\//g, "\\").replace(/%(?![0-9A-Fa-f]{2})/g, "%25")).replace(/^\\*([A-Za-z]:)(\\|$)/, "$1\\");
   return e.hostname !== "" && (u = `\\\\${e.hostname}${u}`), u;
 }
-function on(e) {
-  return rn ? Dn(e) : nn(e);
+function rn(e) {
+  return en ? tn(e) : un(e);
 }
-var an = on, sn = (e) => String(e).split(/[/\\]/u).pop();
-function Fu(e, u) {
-  if (!u)
-    return;
-  let t = sn(u).toLowerCase();
-  return e.find(({ filenames: r }) => r == null ? void 0 : r.some((n) => n.toLowerCase() === t)) ?? e.find(({ extensions: r }) => r == null ? void 0 : r.some((n) => t.endsWith(n)));
+var nn = rn, Dn = (e) => String(e).split(/[/\\]/u).pop();
+function du(e, u) {
+  if (!u) return;
+  let t = Dn(u).toLowerCase();
+  return e.find(({ filenames: r }) => r?.some((n) => n.toLowerCase() === t)) ?? e.find(({ extensions: r }) => r?.some((n) => t.endsWith(n)));
 }
-function ln(e, u) {
-  if (u)
-    return e.find(({ name: t }) => t.toLowerCase() === u) ?? e.find(({ aliases: t }) => t == null ? void 0 : t.includes(u)) ?? e.find(({ extensions: t }) => t == null ? void 0 : t.includes(`.${u}`));
+function an(e, u) {
+  if (u) return e.find(({ name: t }) => t.toLowerCase() === u) ?? e.find(({ aliases: t }) => t?.includes(u)) ?? e.find(({ extensions: t }) => t?.includes(`.${u}`));
 }
-function pu(e, u) {
+function Fu(e, u) {
   if (u) {
-    if (String(u).startsWith("file:"))
-      try {
-        u = an(u);
-      } catch {
-        return;
-      }
-    if (typeof u == "string")
-      return e.find(({ isSupported: t }) => t == null ? void 0 : t({ filepath: u }));
+    if (String(u).startsWith("file:")) try {
+      u = nn(u);
+    } catch {
+      return;
+    }
+    if (typeof u == "string") return e.find(({ isSupported: t }) => t?.({ filepath: u }));
   }
 }
-function cn(e, u) {
-  let t = tn(!1, e.plugins).flatMap((n) => n.languages ?? []), r = ln(t, u.language) ?? Fu(t, u.physicalFile) ?? Fu(t, u.file) ?? pu(t, u.physicalFile) ?? pu(t, u.file) ?? (u.physicalFile, void 0);
-  return r == null ? void 0 : r.parsers[0];
+function on(e, u) {
+  let t = Xr(!1, e.plugins).flatMap((n) => n.languages ?? []), r = an(t, u.language) ?? du(t, u.physicalFile) ?? du(t, u.file) ?? Fu(t, u.physicalFile) ?? Fu(t, u.file) ?? (u.physicalFile, void 0);
+  return r?.parsers[0];
 }
-var fn = cn, ue = { key: (e) => /^[$_a-zA-Z][$_a-zA-Z0-9]*$/.test(e) ? e : JSON.stringify(e), value(e) {
-  if (e === null || typeof e != "object")
-    return JSON.stringify(e);
-  if (Array.isArray(e))
-    return `[${e.map((t) => ue.value(t)).join(", ")}]`;
+var sn = on, ue = { key: (e) => /^[$_a-zA-Z][$_a-zA-Z0-9]*$/.test(e) ? e : JSON.stringify(e), value(e) {
+  if (e === null || typeof e != "object") return JSON.stringify(e);
+  if (Array.isArray(e)) return `[${e.map((t) => ue.value(t)).join(", ")}]`;
   let u = Object.keys(e);
   return u.length === 0 ? "{}" : `{ ${u.map((t) => `${ue.key(t)}: ${ue.value(e[t])}`).join(", ")} }`;
-}, pair: ({ key: e, value: u }) => ue.value({ [e]: u }) }, ut = new Proxy(String, { get: () => ut }), N = ut, dn = (e, u, { descriptor: t }) => {
+}, pair: ({ key: e, value: u }) => ue.value({ [e]: u }) }, et = new Proxy(String, { get: () => et }), N = et, ln = (e, u, { descriptor: t }) => {
   let r = [`${N.yellow(typeof e == "string" ? t.key(e) : t.pair(e))} is deprecated`];
   return u && r.push(`we now treat it as ${N.blue(typeof u == "string" ? t.key(u) : t.pair(u))}`), r.join("; ") + ".";
-}, tt = Symbol.for("vnopts.VALUE_NOT_EXIST"), Ce = Symbol.for("vnopts.VALUE_UNCHANGED"), hu = " ".repeat(2), Fn = (e, u, t) => {
+}, ut = /* @__PURE__ */ Symbol.for("vnopts.VALUE_NOT_EXIST"), he = /* @__PURE__ */ Symbol.for("vnopts.VALUE_UNCHANGED"), pu = " ".repeat(2), cn = (e, u, t) => {
   let { text: r, list: n } = t.normalizeExpectedResult(t.schemas[e].expected(t)), D = [];
-  return r && D.push(Cu(e, u, r, t.descriptor)), n && D.push([Cu(e, u, n.title, t.descriptor)].concat(n.values.map((i) => rt(i, t.loggerPrintWidth))).join(`
-`)), nt(D, t.loggerPrintWidth);
+  return r && D.push(hu(e, u, r, t.descriptor)), n && D.push([hu(e, u, n.title, t.descriptor)].concat(n.values.map((a) => tt(a, t.loggerPrintWidth))).join(`
+`)), rt(D, t.loggerPrintWidth);
 };
-function Cu(e, u, t, r) {
-  return [`Invalid ${N.red(r.key(e))} value.`, `Expected ${N.blue(t)},`, `but received ${u === tt ? N.gray("nothing") : N.red(r.value(u))}.`].join(" ");
+function hu(e, u, t, r) {
+  return [`Invalid ${N.red(r.key(e))} value.`, `Expected ${N.blue(t)},`, `but received ${u === ut ? N.gray("nothing") : N.red(r.value(u))}.`].join(" ");
 }
-function rt({ text: e, list: u }, t) {
+function tt({ text: e, list: u }, t) {
   let r = [];
-  return e && r.push(`- ${N.blue(e)}`), u && r.push([`- ${N.blue(u.title)}:`].concat(u.values.map((n) => rt(n, t - hu.length).replace(/^|\n/g, `$&${hu}`))).join(`
-`)), nt(r, t);
+  return e && r.push(`- ${N.blue(e)}`), u && r.push([`- ${N.blue(u.title)}:`].concat(u.values.map((n) => tt(n, t - pu.length).replace(/^|\n/g, `$&${pu}`))).join(`
+`)), rt(r, t);
 }
-function nt(e, u) {
-  if (e.length === 1)
-    return e[0];
-  let [t, r] = e, [n, D] = e.map((i) => i.split(`
+function rt(e, u) {
+  if (e.length === 1) return e[0];
+  let [t, r] = e, [n, D] = e.map((a) => a.split(`
 `, 1)[0].length);
   return n > u && n > D ? r : t;
 }
-var Oe = [], mu = [];
-function pn(e, u) {
-  if (e === u)
-    return 0;
+var Ne = [], Cu = [];
+function fn(e, u) {
+  if (e === u) return 0;
   let t = e;
   e.length > u.length && (e = u, u = t);
   let r = e.length, n = u.length;
-  for (; r > 0 && e.charCodeAt(~-r) === u.charCodeAt(~-n); )
-    r--, n--;
+  for (; r > 0 && e.charCodeAt(~-r) === u.charCodeAt(~-n); ) r--, n--;
   let D = 0;
-  for (; D < r && e.charCodeAt(D) === u.charCodeAt(D); )
-    D++;
-  if (r -= D, n -= D, r === 0)
-    return n;
-  let i, o, a, s, c = 0, F = 0;
-  for (; c < r; )
-    mu[c] = e.charCodeAt(D + c), Oe[c] = ++c;
-  for (; F < n; )
-    for (i = u.charCodeAt(D + F), a = F++, o = F, c = 0; c < r; c++)
-      s = i === mu[c] ? a : a + 1, a = Oe[c], o = Oe[c] = a > o ? s > o ? o + 1 : s : s > a ? a + 1 : s;
-  return o;
-}
-var Dt = (e, u, { descriptor: t, logger: r, schemas: n }) => {
-  let D = [`Ignored unknown option ${N.yellow(t.pair({ key: e, value: u }))}.`], i = Object.keys(n).sort().find((o) => pn(e, o) < 3);
-  i && D.push(`Did you mean ${N.blue(t.key(i))}?`), r.warn(D.join(" "));
-}, hn = ["default", "expected", "validate", "deprecated", "forward", "redirect", "overlap", "preprocess", "postprocess"];
-function Cn(e, u) {
+  for (; D < r && e.charCodeAt(D) === u.charCodeAt(D); ) D++;
+  if (r -= D, n -= D, r === 0) return n;
+  let a, i, o, s, c = 0, F = 0;
+  for (; c < r; ) Cu[c] = e.charCodeAt(D + c), Ne[c] = ++c;
+  for (; F < n; ) for (a = u.charCodeAt(D + F), o = F++, i = F, c = 0; c < r; c++) s = a === Cu[c] ? o : o + 1, o = Ne[c], i = Ne[c] = o > i ? s > i ? i + 1 : s : s > o ? o + 1 : s;
+  return i;
+}
+var nt = (e, u, { descriptor: t, logger: r, schemas: n }) => {
+  let D = [`Ignored unknown option ${N.yellow(t.pair({ key: e, value: u }))}.`], a = Object.keys(n).sort().find((i) => fn(e, i) < 3);
+  a && D.push(`Did you mean ${N.blue(t.key(a))}?`), r.warn(D.join(" "));
+}, dn = ["default", "expected", "validate", "deprecated", "forward", "redirect", "overlap", "preprocess", "postprocess"];
+function Fn(e, u) {
   let t = new e(u), r = Object.create(t);
-  for (let n of hn)
-    n in u && (r[n] = mn(u[n], t, U.prototype[n].length));
+  for (let n of dn) n in u && (r[n] = pn(u[n], t, U.prototype[n].length));
   return r;
 }
 var U = class {
   static create(e) {
-    return Cn(this, e);
+    return Fn(this, e);
   }
   constructor(e) {
     this.name = e.name;
@@ -1532,13 +1362,13 @@ var U = class {
     return e;
   }
   postprocess(e, u) {
-    return Ce;
+    return he;
   }
 };
-function mn(e, u, t) {
+function pn(e, u, t) {
   return typeof e == "function" ? (...r) => e(...r.slice(0, t - 1), u, ...r.slice(t - 1)) : () => e;
 }
-var En = class extends U {
+var hn = class extends U {
   constructor(e) {
     super(e), this._sourceName = e.sourceName;
   }
@@ -1551,14 +1381,14 @@ var En = class extends U {
   redirect(e, u) {
     return this._sourceName;
   }
-}, gn = class extends U {
+}, Cn = class extends U {
   expected() {
     return "anything";
   }
   validate() {
     return !0;
   }
-}, yn = class extends U {
+}, mn = class extends U {
   constructor({ valueSchema: e, name: u = e.name, ...t }) {
     super({ ...t, name: u }), this._valueSchema = e;
   }
@@ -1567,8 +1397,7 @@ var En = class extends U {
     return { text: u && `an array of ${u}`, list: t && { title: "an array of the following values", values: [{ list: t }] } };
   }
   validate(e, u) {
-    if (!Array.isArray(e))
-      return !1;
+    if (!Array.isArray(e)) return !1;
     let t = [];
     for (let r of e) {
       let n = u.normalizeValidateResult(this._valueSchema.validate(r, u), r);
@@ -1588,7 +1417,7 @@ var En = class extends U {
     let t = [];
     for (let r of e) {
       let n = u.normalizeForwardResult(this._valueSchema.forward(r, u), r);
-      t.push(...n.map(Eu));
+      t.push(...n.map(mu));
     }
     return t;
   }
@@ -1596,7 +1425,7 @@ var En = class extends U {
     let t = [], r = [];
     for (let n of e) {
       let D = u.normalizeRedirectResult(this._valueSchema.redirect(n, u), n);
-      "remain" in D && t.push(D.remain), r.push(...D.redirect.map(Eu));
+      "remain" in D && t.push(D.remain), r.push(...D.redirect.map(mu));
     }
     return t.length === 0 ? { redirect: r } : { redirect: r, remain: t };
   }
@@ -1604,10 +1433,10 @@ var En = class extends U {
     return e.concat(u);
   }
 };
-function Eu({ from: e, to: u }) {
+function mu({ from: e, to: u }) {
   return { from: [e], to: u };
 }
-var vn = class extends U {
+var En = class extends U {
   expected() {
     return "true or false";
   }
@@ -1615,89 +1444,83 @@ var vn = class extends U {
     return typeof e == "boolean";
   }
 };
-function Bn(e, u) {
+function gn(e, u) {
   let t = /* @__PURE__ */ Object.create(null);
   for (let r of e) {
     let n = r[u];
-    if (t[n])
-      throw new Error(`Duplicate ${u} ${JSON.stringify(n)}`);
+    if (t[n]) throw new Error(`Duplicate ${u} ${JSON.stringify(n)}`);
     t[n] = r;
   }
   return t;
 }
-function bn(e, u) {
+function yn(e, u) {
   let t = /* @__PURE__ */ new Map();
   for (let r of e) {
     let n = r[u];
-    if (t.has(n))
-      throw new Error(`Duplicate ${u} ${JSON.stringify(n)}`);
+    if (t.has(n)) throw new Error(`Duplicate ${u} ${JSON.stringify(n)}`);
     t.set(n, r);
   }
   return t;
 }
-function An() {
+function vn() {
   let e = /* @__PURE__ */ Object.create(null);
   return (u) => {
     let t = JSON.stringify(u);
     return e[t] ? !0 : (e[t] = !0, !1);
   };
 }
-function wn(e, u) {
+function Bn(e, u) {
   let t = [], r = [];
-  for (let n of e)
-    u(n) ? t.push(n) : r.push(n);
+  for (let n of e) u(n) ? t.push(n) : r.push(n);
   return [t, r];
 }
-function kn(e) {
+function bn(e) {
   return e === Math.floor(e);
 }
-function Sn(e, u) {
-  if (e === u)
-    return 0;
+function An(e, u) {
+  if (e === u) return 0;
   let t = typeof e, r = typeof u, n = ["undefined", "object", "boolean", "number", "string"];
   return t !== r ? n.indexOf(t) - n.indexOf(r) : t !== "string" ? Number(e) - Number(u) : e.localeCompare(u);
 }
-function xn(e) {
+function wn(e) {
   return (...u) => {
     let t = e(...u);
     return typeof t == "string" ? new Error(t) : t;
   };
 }
-function gu(e) {
+function Eu(e) {
   return e === void 0 ? {} : e;
 }
-function it(e) {
-  if (typeof e == "string")
-    return { text: e };
+function Dt(e) {
+  if (typeof e == "string") return { text: e };
   let { text: u, list: t } = e;
-  return Nn((u || t) !== void 0, "Unexpected `expected` result, there should be at least one field."), t ? { text: u, list: { title: t.title, values: t.values.map(it) } } : { text: u };
+  return kn((u || t) !== void 0, "Unexpected `expected` result, there should be at least one field."), t ? { text: u, list: { title: t.title, values: t.values.map(Dt) } } : { text: u };
 }
-function yu(e, u) {
+function gu(e, u) {
   return e === !0 ? !0 : e === !1 ? { value: u } : e;
 }
-function vu(e, u, t = !1) {
+function yu(e, u, t = !1) {
   return e === !1 ? !1 : e === !0 ? t ? !0 : [{ value: u }] : "value" in e ? [e] : e.length === 0 ? !1 : e;
 }
-function Bu(e, u) {
+function vu(e, u) {
   return typeof e == "string" || "key" in e ? { from: u, to: e } : "from" in e ? { from: e.from, to: e.to } : { from: u, to: e.to };
 }
-function Me(e, u) {
-  return e === void 0 ? [] : Array.isArray(e) ? e.map((t) => Bu(t, u)) : [Bu(e, u)];
+function Re(e, u) {
+  return e === void 0 ? [] : Array.isArray(e) ? e.map((t) => vu(t, u)) : [vu(e, u)];
 }
-function bu(e, u) {
-  let t = Me(typeof e == "object" && "redirect" in e ? e.redirect : e, u);
+function Bu(e, u) {
+  let t = Re(typeof e == "object" && "redirect" in e ? e.redirect : e, u);
   return t.length === 0 ? { remain: u, redirect: t } : typeof e == "object" && "remain" in e ? { remain: e.remain, redirect: t } : { redirect: t };
 }
-function Nn(e, u) {
-  if (!e)
-    throw new Error(u);
+function kn(e, u) {
+  if (!e) throw new Error(u);
 }
-var On = class extends U {
+var Sn = class extends U {
   constructor(e) {
-    super(e), this._choices = bn(e.choices.map((u) => u && typeof u == "object" ? u : { value: u }), "value");
+    super(e), this._choices = yn(e.choices.map((u) => u && typeof u == "object" ? u : { value: u }), "value");
   }
   expected({ descriptor: e }) {
-    let u = Array.from(this._choices.keys()).map((n) => this._choices.get(n)).filter(({ hidden: n }) => !n).map((n) => n.value).sort(Sn).map(e.value), t = u.slice(0, -2), r = u.slice(-2);
+    let u = Array.from(this._choices.keys()).map((n) => this._choices.get(n)).filter(({ hidden: n }) => !n).map((n) => n.value).sort(An).map(e.value), t = u.slice(0, -2), r = u.slice(-2);
     return { text: t.concat(r.join(" or ")).join(", "), list: { title: "one of the following values", values: u } };
   }
   validate(e) {
@@ -1715,35 +1538,35 @@ var On = class extends U {
     let u = this._choices.get(e);
     return u ? u.redirect : void 0;
   }
-}, _n = class extends U {
+}, xn = class extends U {
   expected() {
     return "a number";
   }
   validate(e, u) {
     return typeof e == "number";
   }
-}, jn = class extends _n {
+}, Nn = class extends xn {
   expected() {
     return "an integer";
   }
   validate(e, u) {
-    return u.normalizeValidateResult(super.validate(e, u), e) === !0 && kn(e);
+    return u.normalizeValidateResult(super.validate(e, u), e) === !0 && bn(e);
   }
-}, Au = class extends U {
+}, bu = class extends U {
   expected() {
     return "a string";
   }
   validate(e) {
     return typeof e == "string";
   }
-}, Tn = ue, In = Dt, Pn = Fn, $n = dn, Ln = class {
+}, On = ue, _n = nt, jn = cn, Tn = ln, In = class {
   constructor(e, u) {
-    let { logger: t = console, loggerPrintWidth: r = 80, descriptor: n = Tn, unknown: D = In, invalid: i = Pn, deprecated: o = $n, missing: a = () => !1, required: s = () => !1, preprocess: c = (l) => l, postprocess: F = () => Ce } = u || {};
+    let { logger: t = console, loggerPrintWidth: r = 80, descriptor: n = On, unknown: D = _n, invalid: a = jn, deprecated: i = Tn, missing: o = () => !1, required: s = () => !1, preprocess: c = (l) => l, postprocess: F = () => he } = u || {};
     this._utils = { descriptor: n, logger: t || { warn: () => {
-    } }, loggerPrintWidth: r, schemas: Bn(e, "name"), normalizeDefaultResult: gu, normalizeExpectedResult: it, normalizeDeprecatedResult: vu, normalizeForwardResult: Me, normalizeRedirectResult: bu, normalizeValidateResult: yu }, this._unknownHandler = D, this._invalidHandler = xn(i), this._deprecatedHandler = o, this._identifyMissing = (l, d) => !(l in d) || a(l, d), this._identifyRequired = s, this._preprocess = c, this._postprocess = F, this.cleanHistory();
+    } }, loggerPrintWidth: r, schemas: gn(e, "name"), normalizeDefaultResult: Eu, normalizeExpectedResult: Dt, normalizeDeprecatedResult: yu, normalizeForwardResult: Re, normalizeRedirectResult: Bu, normalizeValidateResult: gu }, this._unknownHandler = D, this._invalidHandler = wn(a), this._deprecatedHandler = i, this._identifyMissing = (l, d) => !(l in d) || o(l, d), this._identifyRequired = s, this._preprocess = c, this._postprocess = F, this.cleanHistory();
   }
   cleanHistory() {
-    this._hasDeprecationWarned = An();
+    this._hasDeprecationWarned = vn();
   }
   normalize(e) {
     let u = {}, t = [this._preprocess(e, this._utils)], r = () => {
@@ -1756,87 +1579,75 @@ var On = class extends U {
     for (let n of Object.keys(this._utils.schemas)) {
       let D = this._utils.schemas[n];
       if (!(n in u)) {
-        let i = gu(D.default(this._utils));
-        "value" in i && t.push({ [n]: i.value });
+        let a = Eu(D.default(this._utils));
+        "value" in a && t.push({ [n]: a.value });
       }
     }
     r();
     for (let n of Object.keys(this._utils.schemas)) {
-      if (!(n in u))
-        continue;
-      let D = this._utils.schemas[n], i = u[n], o = D.postprocess(i, this._utils);
-      o !== Ce && (this._applyValidation(o, n, D), u[n] = o);
+      if (!(n in u)) continue;
+      let D = this._utils.schemas[n], a = u[n], i = D.postprocess(a, this._utils);
+      i !== he && (this._applyValidation(i, n, D), u[n] = i);
     }
     return this._applyPostprocess(u), this._applyRequiredCheck(u), u;
   }
   _applyNormalization(e, u) {
     let t = [], { knownKeys: r, unknownKeys: n } = this._partitionOptionKeys(e);
     for (let D of r) {
-      let i = this._utils.schemas[D], o = i.preprocess(e[D], this._utils);
-      this._applyValidation(o, D, i);
-      let a = ({ from: F, to: l }) => {
+      let a = this._utils.schemas[D], i = a.preprocess(e[D], this._utils);
+      this._applyValidation(i, D, a);
+      let o = ({ from: F, to: l }) => {
         t.push(typeof l == "string" ? { [l]: F } : { [l.key]: l.value });
       }, s = ({ value: F, redirectTo: l }) => {
-        let d = vu(i.deprecated(F, this._utils), o, !0);
-        if (d !== !1)
-          if (d === !0)
-            this._hasDeprecationWarned(D) || this._utils.logger.warn(this._deprecatedHandler(D, l, this._utils));
-          else
-            for (let { value: f } of d) {
-              let h = { key: D, value: f };
-              if (!this._hasDeprecationWarned(h)) {
-                let p = typeof l == "string" ? { key: l, value: f } : l;
-                this._utils.logger.warn(this._deprecatedHandler(h, p, this._utils));
-              }
-            }
+        let d = yu(a.deprecated(F, this._utils), i, !0);
+        if (d !== !1) if (d === !0) this._hasDeprecationWarned(D) || this._utils.logger.warn(this._deprecatedHandler(D, l, this._utils));
+        else for (let { value: f } of d) {
+          let h = { key: D, value: f };
+          if (!this._hasDeprecationWarned(h)) {
+            let p = typeof l == "string" ? { key: l, value: f } : l;
+            this._utils.logger.warn(this._deprecatedHandler(h, p, this._utils));
+          }
+        }
       };
-      Me(i.forward(o, this._utils), o).forEach(a);
-      let c = bu(i.redirect(o, this._utils), o);
-      if (c.redirect.forEach(a), "remain" in c) {
+      Re(a.forward(i, this._utils), i).forEach(o);
+      let c = Bu(a.redirect(i, this._utils), i);
+      if (c.redirect.forEach(o), "remain" in c) {
         let F = c.remain;
-        u[D] = D in u ? i.overlap(u[D], F, this._utils) : F, s({ value: F });
+        u[D] = D in u ? a.overlap(u[D], F, this._utils) : F, s({ value: F });
       }
-      for (let { from: F, to: l } of c.redirect)
-        s({ value: F, redirectTo: l });
+      for (let { from: F, to: l } of c.redirect) s({ value: F, redirectTo: l });
     }
     for (let D of n) {
-      let i = e[D];
-      this._applyUnknownHandler(D, i, u, (o, a) => {
-        t.push({ [o]: a });
+      let a = e[D];
+      this._applyUnknownHandler(D, a, u, (i, o) => {
+        t.push({ [i]: o });
       });
     }
     return t;
   }
   _applyRequiredCheck(e) {
-    for (let u of Object.keys(this._utils.schemas))
-      if (this._identifyMissing(u, e) && this._identifyRequired(u))
-        throw this._invalidHandler(u, tt, this._utils);
+    for (let u of Object.keys(this._utils.schemas)) if (this._identifyMissing(u, e) && this._identifyRequired(u)) throw this._invalidHandler(u, ut, this._utils);
   }
   _partitionOptionKeys(e) {
-    let [u, t] = wn(Object.keys(e).filter((r) => !this._identifyMissing(r, e)), (r) => r in this._utils.schemas);
+    let [u, t] = Bn(Object.keys(e).filter((r) => !this._identifyMissing(r, e)), (r) => r in this._utils.schemas);
     return { knownKeys: u, unknownKeys: t };
   }
   _applyValidation(e, u, t) {
-    let r = yu(t.validate(e, this._utils), e);
-    if (r !== !0)
-      throw this._invalidHandler(u, r.value, this._utils);
+    let r = gu(t.validate(e, this._utils), e);
+    if (r !== !0) throw this._invalidHandler(u, r.value, this._utils);
   }
   _applyUnknownHandler(e, u, t, r) {
     let n = this._unknownHandler(e, u, this._utils);
-    if (n)
-      for (let D of Object.keys(n)) {
-        if (this._identifyMissing(D, n))
-          continue;
-        let i = n[D];
-        D in this._utils.schemas ? r(D, i) : t[D] = i;
-      }
+    if (n) for (let D of Object.keys(n)) {
+      if (this._identifyMissing(D, n)) continue;
+      let a = n[D];
+      D in this._utils.schemas ? r(D, a) : t[D] = a;
+    }
   }
   _applyPostprocess(e) {
     let u = this._postprocess(e, this._utils);
-    if (u !== Ce) {
-      if (u.delete)
-        for (let t of u.delete)
-          delete e[t];
+    if (u !== he) {
+      if (u.delete) for (let t of u.delete) delete e[t];
       if (u.override) {
         let { knownKeys: t, unknownKeys: r } = this._partitionOptionKeys(u.override);
         for (let n of t) {
@@ -1845,179 +1656,159 @@ var On = class extends U {
         }
         for (let n of r) {
           let D = u.override[n];
-          this._applyUnknownHandler(n, D, e, (i, o) => {
-            let a = this._utils.schemas[i];
-            this._applyValidation(o, i, a), e[i] = o;
+          this._applyUnknownHandler(n, D, e, (a, i) => {
+            let o = this._utils.schemas[a];
+            this._applyValidation(i, a, o), e[a] = i;
           });
         }
       }
     }
   }
-}, _e;
-function Rn(e, u, { logger: t = !1, isCLI: r = !1, passThrough: n = !1, FlagSchema: D, descriptor: i } = {}) {
+}, Oe;
+function Pn(e, u, { logger: t = !1, isCLI: r = !1, passThrough: n = !1, FlagSchema: D, descriptor: a } = {}) {
   if (r) {
-    if (!D)
-      throw new Error("'FlagSchema' option is required.");
-    if (!i)
-      throw new Error("'descriptor' option is required.");
-  } else
-    i = ue;
-  let o = n ? Array.isArray(n) ? (l, d) => n.includes(l) ? { [l]: d } : void 0 : (l, d) => ({ [l]: d }) : (l, d, f) => {
+    if (!D) throw new Error("'FlagSchema' option is required.");
+    if (!a) throw new Error("'descriptor' option is required.");
+  } else a = ue;
+  let i = n ? Array.isArray(n) ? (l, d) => n.includes(l) ? { [l]: d } : void 0 : (l, d) => ({ [l]: d }) : (l, d, f) => {
     let { _: h, ...p } = f.schemas;
-    return Dt(l, d, { ...f, schemas: p });
-  }, a = Mn(u, { isCLI: r, FlagSchema: D }), s = new Ln(a, { logger: t, unknown: o, descriptor: i }), c = t !== !1;
-  c && _e && (s._hasDeprecationWarned = _e);
+    return nt(l, d, { ...f, schemas: p });
+  }, o = $n(u, { isCLI: r, FlagSchema: D }), s = new In(o, { logger: t, unknown: i, descriptor: a }), c = t !== !1;
+  c && Oe && (s._hasDeprecationWarned = Oe);
   let F = s.normalize(e);
-  return c && (_e = s._hasDeprecationWarned), F;
+  return c && (Oe = s._hasDeprecationWarned), F;
 }
-function Mn(e, { isCLI: u, FlagSchema: t }) {
+function $n(e, { isCLI: u, FlagSchema: t }) {
   let r = [];
-  u && r.push(gn.create({ name: "_" }));
-  for (let n of e)
-    r.push(Wn(n, { isCLI: u, optionInfos: e, FlagSchema: t })), n.alias && u && r.push(En.create({ name: n.alias, sourceName: n.name }));
+  u && r.push(Cn.create({ name: "_" }));
+  for (let n of e) r.push(Ln(n, { isCLI: u, optionInfos: e, FlagSchema: t })), n.alias && u && r.push(hn.create({ name: n.alias, sourceName: n.name }));
   return r;
 }
-function Wn(e, { isCLI: u, optionInfos: t, FlagSchema: r }) {
-  let { name: n } = e, D = { name: n }, i, o = {};
+function Ln(e, { isCLI: u, optionInfos: t, FlagSchema: r }) {
+  let { name: n } = e, D = { name: n }, a, i = {};
   switch (e.type) {
     case "int":
-      i = jn, u && (D.preprocess = Number);
+      a = Nn, u && (D.preprocess = Number);
       break;
     case "string":
-      i = Au;
+      a = bu;
       break;
     case "choice":
-      i = On, D.choices = e.choices.map((a) => a != null && a.redirect ? { ...a, redirect: { to: { key: e.name, value: a.redirect } } } : a);
+      a = Sn, D.choices = e.choices.map((o) => o != null && o.redirect ? { ...o, redirect: { to: { key: e.name, value: o.redirect } } } : o);
       break;
     case "boolean":
-      i = vn;
+      a = En;
       break;
     case "flag":
-      i = r, D.flags = t.flatMap((a) => [a.alias, a.description && a.name, a.oppositeDescription && `no-${a.name}`].filter(Boolean));
+      a = r, D.flags = t.flatMap((o) => [o.alias, o.description && o.name, o.oppositeDescription && `no-${o.name}`].filter(Boolean));
       break;
     case "path":
-      i = Au;
+      a = bu;
       break;
     default:
       throw new Error(`Unexpected type ${e.type}`);
   }
-  if (e.exception ? D.validate = (a, s, c) => e.exception(a) || s.validate(a, c) : D.validate = (a, s, c) => a === void 0 || s.validate(a, c), e.redirect && (o.redirect = (a) => a ? { to: typeof e.redirect == "string" ? e.redirect : { key: e.redirect.option, value: e.redirect.value } } : void 0), e.deprecated && (o.deprecated = !0), u && !e.array) {
-    let a = D.preprocess || ((s) => s);
-    D.preprocess = (s, c, F) => c.preprocess(a(Array.isArray(s) ? v(!1, s, -1) : s), F);
+  if (e.exception ? D.validate = (o, s, c) => e.exception(o) || s.validate(o, c) : D.validate = (o, s, c) => o === void 0 || s.validate(o, c), e.redirect && (i.redirect = (o) => o ? { to: typeof e.redirect == "string" ? e.redirect : { key: e.redirect.option, value: e.redirect.value } } : void 0), e.deprecated && (i.deprecated = !0), u && !e.array) {
+    let o = D.preprocess || ((s) => s);
+    D.preprocess = (s, c, F) => c.preprocess(o(Array.isArray(s) ? v(!1, s, -1) : s), F);
   }
-  return e.array ? yn.create({ ...u ? { preprocess: (a) => Array.isArray(a) ? a : [a] } : {}, ...o, valueSchema: i.create(D) }) : i.create({ ...D, ...o });
+  return e.array ? mn.create({ ...u ? { preprocess: (o) => Array.isArray(o) ? o : [o] } : {}, ...i, valueSchema: a.create(D) }) : a.create({ ...D, ...i });
 }
-var Vn = Rn, zn = (e, u, t) => {
+var Rn = Pn, Wn = (e, u, t) => {
   if (!(e && u == null)) {
-    if (u.findLast)
-      return u.findLast(t);
+    if (u.findLast) return u.findLast(t);
     for (let r = u.length - 1; r >= 0; r--) {
       let n = u[r];
-      if (t(n, r, u))
-        return n;
+      if (t(n, r, u)) return n;
     }
   }
-}, ot = zn;
-function at(e, u) {
-  if (!u)
-    throw new Error("parserName is required.");
-  let t = ot(!1, e, (n) => n.parsers && Object.prototype.hasOwnProperty.call(n.parsers, u));
-  if (t)
-    return t;
+}, at = Wn;
+function it(e, u) {
+  if (!u) throw new Error("parserName is required.");
+  let t = at(!1, e, (n) => n.parsers && Object.prototype.hasOwnProperty.call(n.parsers, u));
+  if (t) return t;
   let r = `Couldn't resolve parser "${u}".`;
-  throw r += " Plugins must be explicitly added to the standalone bundle.", new Qu(r);
+  throw r += " Plugins must be explicitly added to the standalone bundle.", new Zu(r);
 }
-function qn(e, u) {
-  if (!u)
-    throw new Error("astFormat is required.");
-  let t = ot(!1, e, (n) => n.printers && Object.prototype.hasOwnProperty.call(n.printers, u));
-  if (t)
-    return t;
+function Mn(e, u) {
+  if (!u) throw new Error("astFormat is required.");
+  let t = at(!1, e, (n) => n.printers && Object.prototype.hasOwnProperty.call(n.printers, u));
+  if (t) return t;
   let r = `Couldn't find plugin for AST format "${u}".`;
-  throw r += " Plugins must be explicitly added to the standalone bundle.", new Qu(r);
+  throw r += " Plugins must be explicitly added to the standalone bundle.", new Zu(r);
 }
-function Xe({ plugins: e, parser: u }) {
-  let t = at(e, u);
-  return st(t, u);
+function Qe({ plugins: e, parser: u }) {
+  let t = it(e, u);
+  return ot(t, u);
 }
-function st(e, u) {
+function ot(e, u) {
   let t = e.parsers[u];
   return typeof t == "function" ? t() : t;
 }
-function Un(e, u) {
+function Vn(e, u) {
   let t = e.printers[u];
   return typeof t == "function" ? t() : t;
 }
-var wu = { astFormat: "estree", printer: {}, originalText: void 0, locStart: null, locEnd: null };
-async function Jn(e, u = {}) {
+var Au = { astFormat: "estree", printer: {}, originalText: void 0, locStart: null, locEnd: null };
+async function zn(e, u = {}) {
   var t;
   let r = { ...e };
-  if (!r.parser)
-    if (r.filepath) {
-      if (r.parser = fn(r, { physicalFile: r.filepath }), !r.parser)
-        throw new au(`No parser could be inferred for file "${r.filepath}".`);
-    } else
-      throw new au("No parser and no file path given, couldn't infer a parser.");
-  let n = Xu({ plugins: e.plugins, showDeprecated: !0 }).options, D = { ...wu, ...Object.fromEntries(n.filter((l) => l.default !== void 0).map((l) => [l.name, l.default])) }, i = at(r.plugins, r.parser), o = await st(i, r.parser);
-  r.astFormat = o.astFormat, r.locEnd = o.locEnd, r.locStart = o.locStart;
-  let a = (t = i.printers) != null && t[o.astFormat] ? i : qn(r.plugins, o.astFormat), s = await Un(a, o.astFormat);
+  if (!r.parser) if (r.filepath) {
+    if (r.parser = sn(r, { physicalFile: r.filepath }), !r.parser) throw new iu(`No parser could be inferred for file "${r.filepath}".`);
+  } else throw new iu("No parser and no file path given, couldn't infer a parser.");
+  let n = Qu({ plugins: e.plugins, showDeprecated: !0 }).options, D = { ...Au, ...Object.fromEntries(n.filter((l) => l.default !== void 0).map((l) => [l.name, l.default])) }, a = it(r.plugins, r.parser), i = await ot(a, r.parser);
+  r.astFormat = i.astFormat, r.locEnd = i.locEnd, r.locStart = i.locStart;
+  let o = (t = a.printers) != null && t[i.astFormat] ? a : Mn(r.plugins, i.astFormat), s = await Vn(o, i.astFormat);
   r.printer = s;
-  let c = a.defaultOptions ? Object.fromEntries(Object.entries(a.defaultOptions).filter(([, l]) => l !== void 0)) : {}, F = { ...D, ...c };
-  for (let [l, d] of Object.entries(F))
-    (r[l] === null || r[l] === void 0) && (r[l] = d);
-  return r.parser === "json" && (r.trailingComma = "none"), Vn(r, n, { passThrough: Object.keys(wu), ...u });
-}
-var ne = Jn, Gn = Ot(Tt(), 1);
-async function Hn(e, u) {
-  let t = await Xe(u), r = t.preprocess ? t.preprocess(e, u) : e;
+  let c = o.defaultOptions ? Object.fromEntries(Object.entries(o.defaultOptions).filter(([, l]) => l !== void 0)) : {}, F = { ...D, ...c };
+  for (let [l, d] of Object.entries(F)) (r[l] === null || r[l] === void 0) && (r[l] = d);
+  return r.parser === "json" && (r.trailingComma = "none"), Rn(r, n, { passThrough: Object.keys(Au), ...u });
+}
+var ne = zn, qn = St(Ot());
+async function Un(e, u) {
+  let t = await Qe(u), r = t.preprocess ? t.preprocess(e, u) : e;
   u.originalText = r;
   let n;
   try {
     n = await t.parse(r, u, u);
   } catch (D) {
-    Kn(D, e);
+    Jn(D, e);
   }
   return { text: r, ast: n };
 }
-function Kn(e, u) {
+function Jn(e, u) {
   let { loc: t } = e;
   if (t) {
-    let r = (0, Gn.codeFrameColumns)(u, t, { highlightCode: !0 });
+    let r = (0, qn.codeFrameColumns)(u, t, { highlightCode: !0 });
     throw e.message += `
 ` + r, e.codeFrame = r, e;
   }
   throw e;
 }
-var le = Hn;
-async function Yn(e, u, t, r, n) {
-  let { embeddedLanguageFormatting: D, printer: { embed: i, hasPrettierIgnore: o = () => !1, getVisitorKeys: a } } = t;
-  if (!i || D !== "auto")
-    return;
-  if (i.length > 2)
-    throw new Error("printer.embed has too many parameters. The API changed in Prettier v3. Please update your plugin. See https://prettier.io/docs/plugins#optional-embed");
-  let s = be(i.getVisitorKeys ?? a), c = [];
+var le = Un;
+async function Gn(e, u, t, r, n) {
+  let { embeddedLanguageFormatting: D, printer: { embed: a, hasPrettierIgnore: i = () => !1, getVisitorKeys: o } } = t;
+  if (!a || D !== "auto") return;
+  if (a.length > 2) throw new Error("printer.embed has too many parameters. The API changed in Prettier v3. Please update your plugin. See https://prettier.io/docs/plugins#optional-embed");
+  let s = Be(a.getVisitorKeys ?? o), c = [];
   d();
   let F = e.stack;
-  for (let { print: f, node: h, pathStack: p } of c)
-    try {
-      e.stack = p;
-      let C = await f(l, u, e, t);
-      C && n.set(h, C);
-    } catch (C) {
-      if (globalThis.PRETTIER_DEBUG)
-        throw C;
-    }
+  for (let { print: f, node: h, pathStack: p } of c) try {
+    e.stack = p;
+    let C = await f(l, u, e, t);
+    C && n.set(h, C);
+  } catch (C) {
+    if (globalThis.PRETTIER_DEBUG) throw C;
+  }
   e.stack = F;
   function l(f, h) {
-    return Zn(f, h, t, r);
+    return Hn(f, h, t, r);
   }
   function d() {
     let { node: f } = e;
-    if (f === null || typeof f != "object" || o(e))
-      return;
-    for (let p of s(f))
-      Array.isArray(f[p]) ? e.each(d, p) : e.call(d, p);
-    let h = i(e, t);
+    if (f === null || typeof f != "object" || i(e)) return;
+    for (let p of s(f)) Array.isArray(f[p]) ? e.each(d, p) : e.call(d, p);
+    let h = a(e, t);
     if (h) {
       if (typeof h == "function") {
         c.push({ print: h, node: f, pathStack: [...e.stack] });
@@ -2027,76 +1818,69 @@ async function Yn(e, u, t, r, n) {
     }
   }
 }
-async function Zn(e, u, t, r) {
-  let n = await ne({ ...t, ...u, parentParser: t.parser, originalText: e, cursorOffset: void 0, rangeStart: void 0, rangeEnd: void 0 }, { passThrough: !0 }), { ast: D } = await le(e, n), i = await r(D, n);
-  return $u(i);
+async function Hn(e, u, t, r) {
+  let n = await ne({ ...t, ...u, parentParser: t.parser, originalText: e, cursorOffset: void 0, rangeStart: void 0, rangeEnd: void 0 }, { passThrough: !0 }), { ast: D } = await le(e, n), a = await r(D, n);
+  return Pu(a);
 }
-function Qn(e, u) {
-  let { originalText: t, [Symbol.for("comments")]: r, locStart: n, locEnd: D, [Symbol.for("printedComments")]: i } = u, { node: o } = e, a = n(o), s = D(o);
-  for (let c of r)
-    n(c) >= a && D(c) <= s && i.add(c);
-  return t.slice(a, s);
-}
-var Xn = Qn;
-async function Ae(e, u) {
-  ({ ast: e } = await lt(e, u));
-  let t = /* @__PURE__ */ new Map(), r = new Nr(e), n = /* @__PURE__ */ new Map();
-  await Yn(r, i, u, Ae, n);
-  let D = await ku(r, u, i, void 0, n);
-  if (Zr(u), u.cursorOffset >= 0) {
-    if (u.nodeAfterCursor && !u.nodeBeforeCursor)
-      return [K, D];
-    if (u.nodeBeforeCursor && !u.nodeAfterCursor)
-      return [D, K];
+function Kn(e, u) {
+  let { originalText: t, [/* @__PURE__ */ Symbol.for("comments")]: r, locStart: n, locEnd: D, [/* @__PURE__ */ Symbol.for("printedComments")]: a } = u, { node: i } = e, o = n(i), s = D(i);
+  for (let c of r) n(c) >= o && D(c) <= s && a.add(c);
+  return t.slice(o, s);
+}
+var Yn = Kn;
+async function be(e, u) {
+  ({ ast: e } = await st(e, u));
+  let t = /* @__PURE__ */ new Map(), r = new kr(e), n = /* @__PURE__ */ new Map();
+  await Gn(r, a, u, be, n);
+  let D = await wu(r, u, a, void 0, n);
+  if (Hr(u), u.cursorOffset >= 0) {
+    if (u.nodeAfterCursor && !u.nodeBeforeCursor) return [K, D];
+    if (u.nodeBeforeCursor && !u.nodeAfterCursor) return [D, K];
   }
   return D;
-  function i(a, s) {
-    return a === void 0 || a === r ? o(s) : Array.isArray(a) ? r.call(() => o(s), ...a) : r.call(() => o(s), a);
+  function a(o, s) {
+    return o === void 0 || o === r ? i(s) : Array.isArray(o) ? r.call(() => i(s), ...o) : r.call(() => i(s), o);
   }
-  function o(a) {
+  function i(o) {
     let s = r.node;
-    if (s == null)
-      return "";
-    let c = s && typeof s == "object" && a === void 0;
-    if (c && t.has(s))
-      return t.get(s);
-    let F = ku(r, u, i, a, n);
+    if (s == null) return "";
+    let c = s && typeof s == "object" && o === void 0;
+    if (c && t.has(s)) return t.get(s);
+    let F = wu(r, u, a, o, n);
     return c && t.set(s, F), F;
   }
 }
-function ku(e, u, t, r, n) {
+function wu(e, u, t, r, n) {
   var D;
-  let { node: i } = e, { printer: o } = u, a;
-  switch ((D = o.hasPrettierIgnore) != null && D.call(o, e) ? a = Xn(e, u) : n.has(i) ? a = n.get(i) : a = o.print(e, u, t, r), i) {
+  let { node: a } = e, { printer: i } = u, o;
+  switch ((D = i.hasPrettierIgnore) != null && D.call(i, e) ? o = Yn(e, u) : n.has(a) ? o = n.get(a) : o = i.print(e, u, t, r), a) {
     case u.cursorNode:
-      a = pe(a, (s) => [K, s, K]);
+      o = Fe(o, (s) => [K, s, K]);
       break;
     case u.nodeBeforeCursor:
-      a = pe(a, (s) => [s, K]);
+      o = Fe(o, (s) => [s, K]);
       break;
     case u.nodeAfterCursor:
-      a = pe(a, (s) => [K, s]);
+      o = Fe(o, (s) => [K, s]);
       break;
   }
-  return o.printComment && (!o.willPrintOwnComments || !o.willPrintOwnComments(e, u)) && (a = Yr(e, a, u)), a;
+  return i.printComment && (!i.willPrintOwnComments || !i.willPrintOwnComments(e, u)) && (o = Gr(e, o, u)), o;
 }
-async function lt(e, u) {
+async function st(e, u) {
   let t = e.comments ?? [];
-  u[Symbol.for("comments")] = t, u[Symbol.for("printedComments")] = /* @__PURE__ */ new Set(), zr(e, u);
+  u[/* @__PURE__ */ Symbol.for("comments")] = t, u[/* @__PURE__ */ Symbol.for("printedComments")] = /* @__PURE__ */ new Set(), Wr(e, u);
   let { printer: { preprocess: r } } = u;
   return e = r ? await r(e, u) : e, { ast: e, comments: t };
 }
-function eD(e, u) {
-  let { cursorOffset: t, locStart: r, locEnd: n } = u, D = be(u.printer.getVisitorKeys), i = (d) => r(d) <= t && n(d) >= t, o = e, a = [e];
-  for (let d of jr(e, { getVisitorKeys: D, filter: i }))
-    a.push(d), o = d;
-  if (Tr(o, { getVisitorKeys: D }))
-    return { cursorNode: o };
+function Zn(e, u) {
+  let { cursorOffset: t, locStart: r, locEnd: n } = u, D = Be(u.printer.getVisitorKeys), a = (d) => r(d) <= t && n(d) >= t, i = e, o = [e];
+  for (let d of Nr(e, { getVisitorKeys: D, filter: a })) o.push(d), i = d;
+  if (Or(i, { getVisitorKeys: D })) return { cursorNode: i };
   let s, c, F = -1, l = Number.POSITIVE_INFINITY;
-  for (; a.length > 0 && (s === void 0 || c === void 0); ) {
-    o = a.pop();
+  for (; o.length > 0 && (s === void 0 || c === void 0); ) {
+    i = o.pop();
     let d = s !== void 0, f = c !== void 0;
-    for (let h of Be(o, { getVisitorKeys: D })) {
+    for (let h of ve(i, { getVisitorKeys: D })) {
       if (!d) {
         let p = n(h);
         p <= t && p > F && (s = h, F = p);
@@ -2109,86 +1893,69 @@ function eD(e, u) {
   }
   return { nodeBeforeCursor: s, nodeAfterCursor: c };
 }
-var ct = eD;
-function uD(e, u) {
+var lt = Zn;
+function Qn(e, u) {
   let { printer: { massageAstNode: t, getVisitorKeys: r } } = u;
-  if (!t)
-    return e;
-  let n = be(r), D = t.ignoredProperties ?? /* @__PURE__ */ new Set();
-  return i(e);
-  function i(o, a) {
-    if (!(o !== null && typeof o == "object"))
-      return o;
-    if (Array.isArray(o))
-      return o.map((l) => i(l, a)).filter(Boolean);
-    let s = {}, c = new Set(n(o));
-    for (let l in o)
-      !Object.prototype.hasOwnProperty.call(o, l) || D.has(l) || (c.has(l) ? s[l] = i(o[l], o) : s[l] = o[l]);
-    let F = t(o, s, a);
-    if (F !== null)
-      return F ?? s;
-  }
-}
-var tD = uD, rD = (e, u, t) => {
+  if (!t) return e;
+  let n = Be(r), D = t.ignoredProperties ?? /* @__PURE__ */ new Set();
+  return a(e);
+  function a(i, o) {
+    if (!(i !== null && typeof i == "object")) return i;
+    if (Array.isArray(i)) return i.map((l) => a(l, o)).filter(Boolean);
+    let s = {}, c = new Set(n(i));
+    for (let l in i) !Object.prototype.hasOwnProperty.call(i, l) || D.has(l) || (c.has(l) ? s[l] = a(i[l], i) : s[l] = i[l]);
+    let F = t(i, s, o);
+    if (F !== null) return F ?? s;
+  }
+}
+var Xn = Qn, eD = (e, u, t) => {
   if (!(e && u == null)) {
-    if (u.findLastIndex)
-      return u.findLastIndex(t);
+    if (u.findLastIndex) return u.findLastIndex(t);
     for (let r = u.length - 1; r >= 0; r--) {
       let n = u[r];
-      if (t(n, r, u))
-        return r;
+      if (t(n, r, u)) return r;
     }
     return -1;
   }
-}, nD = rD, DD = ({ parser: e }) => e === "json" || e === "json5" || e === "jsonc" || e === "json-stringify";
-function iD(e, u) {
+}, uD = eD, tD = ({ parser: e }) => e === "json" || e === "json5" || e === "jsonc" || e === "json-stringify";
+function rD(e, u) {
   let t = [e.node, ...e.parentNodes], r = /* @__PURE__ */ new Set([u.node, ...u.parentNodes]);
-  return t.find((n) => ft.has(n.type) && r.has(n));
+  return t.find((n) => ct.has(n.type) && r.has(n));
 }
-function Su(e) {
-  let u = nD(!1, e, (t) => t.type !== "Program" && t.type !== "File");
+function ku(e) {
+  let u = uD(!1, e, (t) => t.type !== "Program" && t.type !== "File");
   return u === -1 ? e : e.slice(0, u + 1);
 }
-function oD(e, u, { locStart: t, locEnd: r }) {
+function nD(e, u, { locStart: t, locEnd: r }) {
   let n = e.node, D = u.node;
-  if (n === D)
-    return { startNode: n, endNode: D };
-  let i = t(e.node);
-  for (let a of Su(u.parentNodes))
-    if (t(a) >= i)
-      D = a;
-    else
-      break;
-  let o = r(u.node);
-  for (let a of Su(e.parentNodes)) {
-    if (r(a) <= o)
-      n = a;
-    else
-      break;
-    if (n === D)
-      break;
+  if (n === D) return { startNode: n, endNode: D };
+  let a = t(e.node);
+  for (let o of ku(u.parentNodes)) if (t(o) >= a) D = o;
+  else break;
+  let i = r(u.node);
+  for (let o of ku(e.parentNodes)) {
+    if (r(o) <= i) n = o;
+    else break;
+    if (n === D) break;
   }
   return { startNode: n, endNode: D };
 }
 function We(e, u, t, r, n = [], D) {
-  let { locStart: i, locEnd: o } = t, a = i(e), s = o(e);
-  if (!(u > s || u < a || D === "rangeEnd" && u === a || D === "rangeStart" && u === s)) {
-    for (let c of Ze(e, t)) {
+  let { locStart: a, locEnd: i } = t, o = a(e), s = i(e);
+  if (!(u > s || u < o || D === "rangeEnd" && u === o || D === "rangeStart" && u === s)) {
+    for (let c of Ye(e, t)) {
       let F = We(c, u, t, r, [e, ...n], D);
-      if (F)
-        return F;
+      if (F) return F;
     }
-    if (!r || r(e, n[0]))
-      return { node: e, parentNodes: n };
+    if (!r || r(e, n[0])) return { node: e, parentNodes: n };
   }
 }
-function aD(e, u) {
+function DD(e, u) {
   return u !== "DeclareExportDeclaration" && e !== "TypeParameterDeclaration" && (e === "Directive" || e === "TypeAlias" || e === "TSExportAssignment" || e.startsWith("Declare") || e.startsWith("TSDeclare") || e.endsWith("Statement") || e.endsWith("Declaration"));
 }
-var ft = /* @__PURE__ */ new Set(["JsonRoot", "ObjectExpression", "ArrayExpression", "StringLiteral", "NumericLiteral", "BooleanLiteral", "NullLiteral", "UnaryExpression", "TemplateLiteral"]), sD = /* @__PURE__ */ new Set(["OperationDefinition", "FragmentDefinition", "VariableDefinition", "TypeExtensionDefinition", "ObjectTypeDefinition", "FieldDefinition", "DirectiveDefinition", "EnumTypeDefinition", "EnumValueDefinition", "InputValueDefinition", "InputObjectTypeDefinition", "SchemaDefinition", "OperationTypeDefinition", "InterfaceTypeDefinition", "UnionTypeDefinition", "ScalarTypeDefinition"]);
-function xu(e, u, t) {
-  if (!u)
-    return !1;
+var ct = /* @__PURE__ */ new Set(["JsonRoot", "ObjectExpression", "ArrayExpression", "StringLiteral", "NumericLiteral", "BooleanLiteral", "NullLiteral", "UnaryExpression", "TemplateLiteral"]), aD = /* @__PURE__ */ new Set(["OperationDefinition", "FragmentDefinition", "VariableDefinition", "TypeExtensionDefinition", "ObjectTypeDefinition", "FieldDefinition", "DirectiveDefinition", "EnumTypeDefinition", "EnumValueDefinition", "InputValueDefinition", "InputObjectTypeDefinition", "SchemaDefinition", "OperationTypeDefinition", "InterfaceTypeDefinition", "UnionTypeDefinition", "ScalarTypeDefinition"]);
+function Su(e, u, t) {
+  if (!u) return !1;
   switch (e.parser) {
     case "flow":
     case "hermes":
@@ -2202,243 +1969,220 @@ function xu(e, u, t) {
     case "oxc":
     case "oxc-ts":
     case "__babel_estree":
-      return aD(u.type, t == null ? void 0 : t.type);
+      return DD(u.type, t?.type);
     case "json":
     case "json5":
     case "jsonc":
     case "json-stringify":
-      return ft.has(u.type);
+      return ct.has(u.type);
     case "graphql":
-      return sD.has(u.kind);
+      return aD.has(u.kind);
     case "vue":
       return u.tag !== "root";
   }
   return !1;
 }
-function lD(e, u, t) {
-  let { rangeStart: r, rangeEnd: n, locStart: D, locEnd: i } = u;
-  Re.ok(n > r);
-  let o = e.slice(r, n).search(/\S/u), a = o === -1;
-  if (!a)
-    for (r += o; n > r && !/\S/u.test(e[n - 1]); --n)
-      ;
-  let s = We(t, r, u, (d, f) => xu(u, d, f), [], "rangeStart"), c = a ? s : We(t, n, u, (d) => xu(u, d), [], "rangeEnd");
-  if (!s || !c)
-    return { rangeStart: 0, rangeEnd: 0 };
+function iD(e, u, t) {
+  let { rangeStart: r, rangeEnd: n, locStart: D, locEnd: a } = u;
+  Le.ok(n > r);
+  let i = e.slice(r, n).search(/\S/u), o = i === -1;
+  if (!o) for (r += i; n > r && !/\S/u.test(e[n - 1]); --n) ;
+  let s = We(t, r, u, (d, f) => Su(u, d, f), [], "rangeStart"), c = o ? s : We(t, n, u, (d) => Su(u, d), [], "rangeEnd");
+  if (!s || !c) return { rangeStart: 0, rangeEnd: 0 };
   let F, l;
-  if (DD(u)) {
-    let d = iD(s, c);
+  if (tD(u)) {
+    let d = rD(s, c);
     F = d, l = d;
-  } else
-    ({ startNode: F, endNode: l } = oD(s, c, u));
-  return { rangeStart: Math.min(D(F), D(l)), rangeEnd: Math.max(i(F), i(l)) };
-}
-var dt = "\uFEFF", Nu = Symbol("cursor");
-async function Ft(e, u, t = 0) {
-  if (!e || e.trim().length === 0)
-    return { formatted: "", cursorOffset: -1, comments: [] };
+  } else ({ startNode: F, endNode: l } = nD(s, c, u));
+  return { rangeStart: Math.min(D(F), D(l)), rangeEnd: Math.max(a(F), a(l)) };
+}
+var ft = "\uFEFF", xu = /* @__PURE__ */ Symbol("cursor");
+async function dt(e, u, t = 0) {
+  if (!e || e.trim().length === 0) return { formatted: "", cursorOffset: -1, comments: [] };
   let { ast: r, text: n } = await le(e, u);
-  u.cursorOffset >= 0 && (u = { ...u, ...ct(r, u) });
-  let D = await Ae(r, u);
-  t > 0 && (D = zu([Y, D], t, u.tabWidth));
-  let i = ve(D, u);
+  u.cursorOffset >= 0 && (u = { ...u, ...lt(r, u) });
+  let D = await be(r, u);
+  t > 0 && (D = Vu([Y, D], t, u.tabWidth));
+  let a = ye(D, u);
   if (t > 0) {
-    let a = i.formatted.trim();
-    i.cursorNodeStart !== void 0 && (i.cursorNodeStart -= i.formatted.indexOf(a), i.cursorNodeStart < 0 && (i.cursorNodeStart = 0, i.cursorNodeText = i.cursorNodeText.trimStart()), i.cursorNodeStart + i.cursorNodeText.length > a.length && (i.cursorNodeText = i.cursorNodeText.trimEnd())), i.formatted = a + qe(u.endOfLine);
+    let o = a.formatted.trim();
+    a.cursorNodeStart !== void 0 && (a.cursorNodeStart -= a.formatted.indexOf(o), a.cursorNodeStart < 0 && (a.cursorNodeStart = 0, a.cursorNodeText = a.cursorNodeText.trimStart()), a.cursorNodeStart + a.cursorNodeText.length > o.length && (a.cursorNodeText = a.cursorNodeText.trimEnd())), a.formatted = o + ze(u.endOfLine);
   }
-  let o = u[Symbol.for("comments")];
+  let i = u[/* @__PURE__ */ Symbol.for("comments")];
   if (u.cursorOffset >= 0) {
-    let a, s, c, F;
-    if ((u.cursorNode || u.nodeBeforeCursor || u.nodeAfterCursor) && i.cursorNodeText)
-      if (c = i.cursorNodeStart, F = i.cursorNodeText, u.cursorNode)
-        a = u.locStart(u.cursorNode), s = n.slice(a, u.locEnd(u.cursorNode));
-      else {
-        if (!u.nodeBeforeCursor && !u.nodeAfterCursor)
-          throw new Error("Cursor location must contain at least one of cursorNode, nodeBeforeCursor, nodeAfterCursor");
-        a = u.nodeBeforeCursor ? u.locEnd(u.nodeBeforeCursor) : 0;
-        let C = u.nodeAfterCursor ? u.locStart(u.nodeAfterCursor) : n.length;
-        s = n.slice(a, C);
-      }
-    else
-      a = 0, s = n, c = 0, F = i.formatted;
-    let l = u.cursorOffset - a;
-    if (s === F)
-      return { formatted: i.formatted, cursorOffset: c + l, comments: o };
+    let o, s, c, F;
+    if ((u.cursorNode || u.nodeBeforeCursor || u.nodeAfterCursor) && a.cursorNodeText) if (c = a.cursorNodeStart, F = a.cursorNodeText, u.cursorNode) o = u.locStart(u.cursorNode), s = n.slice(o, u.locEnd(u.cursorNode));
+    else {
+      if (!u.nodeBeforeCursor && !u.nodeAfterCursor) throw new Error("Cursor location must contain at least one of cursorNode, nodeBeforeCursor, nodeAfterCursor");
+      o = u.nodeBeforeCursor ? u.locEnd(u.nodeBeforeCursor) : 0;
+      let C = u.nodeAfterCursor ? u.locStart(u.nodeAfterCursor) : n.length;
+      s = n.slice(o, C);
+    }
+    else o = 0, s = n, c = 0, F = a.formatted;
+    let l = u.cursorOffset - o;
+    if (s === F) return { formatted: a.formatted, cursorOffset: c + l, comments: i };
     let d = s.split("");
-    d.splice(l, 0, Nu);
-    let f = F.split(""), h = Mt(d, f), p = c;
-    for (let C of h)
-      if (C.removed) {
-        if (C.value.includes(Nu))
-          break;
-      } else
-        p += C.count;
-    return { formatted: i.formatted, cursorOffset: p, comments: o };
-  }
-  return { formatted: i.formatted, cursorOffset: -1, comments: o };
-}
-async function cD(e, u) {
-  let { ast: t, text: r } = await le(e, u), { rangeStart: n, rangeEnd: D } = lD(r, u, t), i = r.slice(n, D), o = Math.min(n, r.lastIndexOf(`
-`, n) + 1), a = r.slice(o, n).match(/^\s*/u)[0], s = Ke(a, u.tabWidth), c = await Ft(i, { ...u, rangeStart: 0, rangeEnd: Number.POSITIVE_INFINITY, cursorOffset: u.cursorOffset > n && u.cursorOffset <= D ? u.cursorOffset - n : -1, endOfLine: "lf" }, s), F = c.formatted.trimEnd(), { cursorOffset: l } = u;
-  l > D ? l += F.length - i.length : c.cursorOffset >= 0 && (l = c.cursorOffset + n);
+    d.splice(l, 0, xu);
+    let f = F.split(""), h = $t(d, f), p = c;
+    for (let C of h) if (C.removed) {
+      if (C.value.includes(xu)) break;
+    } else p += C.count;
+    return { formatted: a.formatted, cursorOffset: p, comments: i };
+  }
+  return { formatted: a.formatted, cursorOffset: -1, comments: i };
+}
+async function oD(e, u) {
+  let { ast: t, text: r } = await le(e, u), { rangeStart: n, rangeEnd: D } = iD(r, u, t), a = r.slice(n, D), i = Math.min(n, r.lastIndexOf(`
+`, n) + 1), o = r.slice(i, n).match(/^\s*/u)[0], s = He(o, u.tabWidth), c = await dt(a, { ...u, rangeStart: 0, rangeEnd: Number.POSITIVE_INFINITY, cursorOffset: u.cursorOffset > n && u.cursorOffset <= D ? u.cursorOffset - n : -1, endOfLine: "lf" }, s), F = c.formatted.trimEnd(), { cursorOffset: l } = u;
+  l > D ? l += F.length - a.length : c.cursorOffset >= 0 && (l = c.cursorOffset + n);
   let d = r.slice(0, n) + F + r.slice(D);
   if (u.endOfLine !== "lf") {
-    let f = qe(u.endOfLine);
+    let f = ze(u.endOfLine);
     l >= 0 && f === `\r
-` && (l += Iu(d.slice(0, l), `
-`)), d = Ee(!1, d, `
+` && (l += Tu(d.slice(0, l), `
+`)), d = me(!1, d, `
 `, f);
   }
   return { formatted: d, cursorOffset: l, comments: c.comments };
 }
-function je(e, u, t) {
+function _e(e, u, t) {
   return typeof u != "number" || Number.isNaN(u) || u < 0 || u > e.length ? t : u;
 }
-function Ou(e, u) {
+function Nu(e, u) {
   let { cursorOffset: t, rangeStart: r, rangeEnd: n } = u;
-  return t = je(e, t, -1), r = je(e, r, 0), n = je(e, n, e.length), { ...u, cursorOffset: t, rangeStart: r, rangeEnd: n };
+  return t = _e(e, t, -1), r = _e(e, r, 0), n = _e(e, n, e.length), { ...u, cursorOffset: t, rangeStart: r, rangeEnd: n };
 }
-function pt(e, u) {
-  let { cursorOffset: t, rangeStart: r, rangeEnd: n, endOfLine: D } = Ou(e, u), i = e.charAt(0) === dt;
-  if (i && (e = e.slice(1), t--, r--, n--), D === "auto" && (D = Wt(e)), e.includes("\r")) {
-    let o = (a) => Iu(e.slice(0, Math.max(a, 0)), `\r
+function Ft(e, u) {
+  let { cursorOffset: t, rangeStart: r, rangeEnd: n, endOfLine: D } = Nu(e, u), a = e.charAt(0) === ft;
+  if (a && (e = e.slice(1), t--, r--, n--), D === "auto" && (D = Lt(e)), e.includes("\r")) {
+    let i = (o) => Tu(e.slice(0, Math.max(o, 0)), `\r
 `);
-    t -= o(t), r -= o(r), n -= o(n), e = Vt(e);
+    t -= i(t), r -= i(r), n -= i(n), e = Rt(e);
   }
-  return { hasBOM: i, text: e, options: Ou(e, { ...u, cursorOffset: t, rangeStart: r, rangeEnd: n, endOfLine: D }) };
+  return { hasBOM: a, text: e, options: Nu(e, { ...u, cursorOffset: t, rangeStart: r, rangeEnd: n, endOfLine: D }) };
 }
-async function _u(e, u) {
-  let t = await Xe(u);
+async function Ou(e, u) {
+  let t = await Qe(u);
   return !t.hasPragma || t.hasPragma(e);
 }
-async function fD(e, u) {
+async function sD(e, u) {
   var t;
-  let r = await Xe(u);
+  let r = await Qe(u);
   return (t = r.hasIgnorePragma) == null ? void 0 : t.call(r, e);
 }
-async function ht(e, u) {
-  let { hasBOM: t, text: r, options: n } = pt(e, await ne(u));
-  if (n.rangeStart >= n.rangeEnd && r !== "" || n.requirePragma && !await _u(r, n) || n.checkIgnorePragma && await fD(r, n))
-    return { formatted: e, cursorOffset: u.cursorOffset, comments: [] };
+async function pt(e, u) {
+  let { hasBOM: t, text: r, options: n } = Ft(e, await ne(u));
+  if (n.rangeStart >= n.rangeEnd && r !== "" || n.requirePragma && !await Ou(r, n) || n.checkIgnorePragma && await sD(r, n)) return { formatted: e, cursorOffset: u.cursorOffset, comments: [] };
   let D;
-  return n.rangeStart > 0 || n.rangeEnd < r.length ? D = await cD(r, n) : (!n.requirePragma && n.insertPragma && n.printer.insertPragma && !await _u(r, n) && (r = n.printer.insertPragma(r)), D = await Ft(r, n)), t && (D.formatted = dt + D.formatted, D.cursorOffset >= 0 && D.cursorOffset++), D;
+  return n.rangeStart > 0 || n.rangeEnd < r.length ? D = await oD(r, n) : (!n.requirePragma && n.insertPragma && n.printer.insertPragma && !await Ou(r, n) && (r = n.printer.insertPragma(r)), D = await dt(r, n)), t && (D.formatted = ft + D.formatted, D.cursorOffset >= 0 && D.cursorOffset++), D;
 }
-async function dD(e, u, t) {
-  let { text: r, options: n } = pt(e, await ne(u)), D = await le(r, n);
-  return t && (t.preprocessForPrint && (D.ast = await lt(D.ast, n)), t.massage && (D.ast = tD(D.ast, n))), D;
+async function lD(e, u, t) {
+  let { text: r, options: n } = Ft(e, await ne(u)), D = await le(r, n);
+  return t && (t.preprocessForPrint && (D.ast = await st(D.ast, n)), t.massage && (D.ast = Xn(D.ast, n))), D;
 }
-async function FD(e, u) {
+async function cD(e, u) {
   u = await ne(u);
-  let t = await Ae(e, u);
-  return ve(t, u);
+  let t = await be(e, u);
+  return ye(t, u);
 }
-async function pD(e, u) {
-  let t = Er(e), { formatted: r } = await ht(t, { ...u, parser: "__js_expression" });
+async function fD(e, u) {
+  let t = hr(e), { formatted: r } = await pt(t, { ...u, parser: "__js_expression" });
   return r;
 }
-async function hD(e, u) {
+async function dD(e, u) {
   u = await ne(u);
   let { ast: t } = await le(e, u);
-  return u.cursorOffset >= 0 && (u = { ...u, ...ct(t, u) }), Ae(t, u);
-}
-async function CD(e, u) {
-  return ve(e, await ne(u));
+  return u.cursorOffset >= 0 && (u = { ...u, ...lt(t, u) }), be(t, u);
 }
-var Ct = {};
-ze(Ct, { builders: () => mD, printer: () => ED, utils: () => gD });
-var mD = { join: Vu, line: Mu, softline: Cr, hardline: Y, literalline: Wu, group: Lu, conditionalGroup: cr, fill: fr, lineSuffix: Te, lineSuffixBoundary: pr, cursor: K, breakParent: ye, ifBreak: dr, trim: hr, indent: me, indentIfBreak: Fr, align: re, addAlignmentToDoc: zu, markAsRoot: sr, dedentToRoot: ar, dedent: lr, hardlineWithoutBreakParent: Ge, literallineWithoutBreakParent: Ru, label: mr, concat: (e) => e }, ED = { printDocToString: ve }, gD = { willBreak: Zt, traverseDoc: Ue, findInDoc: Je, mapDoc: ge, removeLines: er, stripTrailingHardline: $u, replaceEndOfLine: rr, canBreak: Dr }, yD = "3.6.2", mt = {};
-ze(mt, { addDanglingComment: () => G, addLeadingComment: () => oe, addTrailingComment: () => ae, getAlignmentSize: () => Ke, getIndentSize: () => kD, getMaxContinuousCount: () => ND, getNextNonSpaceNonCommentCharacter: () => _D, getNextNonSpaceNonCommentCharacterIndex: () => VD, getPreferredQuote: () => TD, getStringWidth: () => He, hasNewline: () => V, hasNewlineInRange: () => PD, hasSpaces: () => LD, isNextLineEmpty: () => JD, isNextLineEmptyAfterIndex: () => ru, isPreviousLineEmpty: () => qD, makeString: () => MD, skip: () => se, skipEverythingButNewLine: () => Gu, skipInlineComment: () => eu, skipNewline: () => Z, skipSpaces: () => z, skipToLineEnd: () => Ju, skipTrailingComment: () => uu, skipWhitespace: () => Ir });
-function vD(e, u) {
-  if (u === !1)
-    return !1;
+async function FD(e, u) {
+  return ye(e, await ne(u));
+}
+var ht = {};
+Ve(ht, { builders: () => pD, printer: () => hD, utils: () => CD });
+var pD = { join: Mu, line: Ru, softline: Fr, hardline: Y, literalline: Wu, group: $u, conditionalGroup: or, fill: sr, lineSuffix: je, lineSuffixBoundary: fr, cursor: K, breakParent: ge, ifBreak: lr, trim: dr, indent: Ce, indentIfBreak: cr, align: re, addAlignmentToDoc: Vu, markAsRoot: ar, dedentToRoot: Dr, dedent: ir, hardlineWithoutBreakParent: Je, literallineWithoutBreakParent: Lu, label: pr, concat: (e) => e }, hD = { printDocToString: ye }, CD = { willBreak: Ht, traverseDoc: qe, findInDoc: Ue, mapDoc: Ee, removeLines: Zt, stripTrailingHardline: Pu, replaceEndOfLine: er, canBreak: tr }, mD = "3.6.2", Ct = {};
+Ve(Ct, { addDanglingComment: () => G, addLeadingComment: () => ie, addTrailingComment: () => oe, getAlignmentSize: () => He, getIndentSize: () => bD, getMaxContinuousCount: () => kD, getNextNonSpaceNonCommentCharacter: () => xD, getNextNonSpaceNonCommentCharacterIndex: () => RD, getPreferredQuote: () => OD, getStringWidth: () => Ge, hasNewline: () => V, hasNewlineInRange: () => jD, hasSpaces: () => ID, isNextLineEmpty: () => zD, isNextLineEmptyAfterIndex: () => tu, isPreviousLineEmpty: () => MD, makeString: () => $D, skip: () => se, skipEverythingButNewLine: () => Ju, skipInlineComment: () => Xe, skipNewline: () => Z, skipSpaces: () => z, skipToLineEnd: () => Uu, skipTrailingComment: () => eu, skipWhitespace: () => _r });
+function ED(e, u) {
+  if (u === !1) return !1;
   if (e.charAt(u) === "/" && e.charAt(u + 1) === "*") {
-    for (let t = u + 2; t < e.length; ++t)
-      if (e.charAt(t) === "*" && e.charAt(t + 1) === "/")
-        return t + 2;
+    for (let t = u + 2; t < e.length; ++t) if (e.charAt(t) === "*" && e.charAt(t + 1) === "/") return t + 2;
   }
   return u;
 }
-var eu = vD;
-function BD(e, u) {
-  return u === !1 ? !1 : e.charAt(u) === "/" && e.charAt(u + 1) === "/" ? Gu(e, u) : u;
+var Xe = ED;
+function gD(e, u) {
+  return u === !1 ? !1 : e.charAt(u) === "/" && e.charAt(u + 1) === "/" ? Ju(e, u) : u;
 }
-var uu = BD;
-function bD(e, u) {
+var eu = gD;
+function yD(e, u) {
   let t = null, r = u;
-  for (; r !== t; )
-    t = r, r = z(e, r), r = eu(e, r), r = uu(e, r), r = Z(e, r);
+  for (; r !== t; ) t = r, r = z(e, r), r = Xe(e, r), r = eu(e, r), r = Z(e, r);
   return r;
 }
-var tu = bD;
-function AD(e, u) {
+var uu = yD;
+function vD(e, u) {
   let t = null, r = u;
-  for (; r !== t; )
-    t = r, r = Ju(e, r), r = eu(e, r), r = z(e, r);
-  return r = uu(e, r), r = Z(e, r), r !== !1 && V(e, r);
+  for (; r !== t; ) t = r, r = Uu(e, r), r = Xe(e, r), r = z(e, r);
+  return r = eu(e, r), r = Z(e, r), r !== !1 && V(e, r);
 }
-var ru = AD;
-function wD(e, u) {
+var tu = vD;
+function BD(e, u) {
   let t = e.lastIndexOf(`
 `);
-  return t === -1 ? 0 : Ke(e.slice(t + 1).match(/^[\t ]*/u)[0], u);
+  return t === -1 ? 0 : He(e.slice(t + 1).match(/^[\t ]*/u)[0], u);
 }
-var kD = wD;
-function SD(e) {
-  if (typeof e != "string")
-    throw new TypeError("Expected a string");
+var bD = BD;
+function AD(e) {
+  if (typeof e != "string") throw new TypeError("Expected a string");
   return e.replace(/[|\\{}()[\]^$+*?.]/g, "\\$&").replace(/-/g, "\\x2d");
 }
-function xD(e, u) {
-  let t = e.match(new RegExp(`(${SD(u)})+`, "gu"));
+function wD(e, u) {
+  let t = e.match(new RegExp(`(${AD(u)})+`, "gu"));
   return t === null ? 0 : t.reduce((r, n) => Math.max(r, n.length / u.length), 0);
 }
-var ND = xD;
-function OD(e, u) {
-  let t = tu(e, u);
+var kD = wD;
+function SD(e, u) {
+  let t = uu(e, u);
   return t === !1 ? "" : e.charAt(t);
 }
-var _D = OD, Fe = "'", ju = '"';
-function jD(e, u) {
-  let t = u === !0 || u === Fe ? Fe : ju, r = t === Fe ? ju : Fe, n = 0, D = 0;
-  for (let i of e)
-    i === t ? n++ : i === r && D++;
+var xD = SD, de = "'", _u = '"';
+function ND(e, u) {
+  let t = u === !0 || u === de ? de : _u, r = t === de ? _u : de, n = 0, D = 0;
+  for (let a of e) a === t ? n++ : a === r && D++;
   return n > D ? r : t;
 }
-var TD = jD;
-function ID(e, u, t) {
-  for (let r = u; r < t; ++r)
-    if (e.charAt(r) === `
-`)
-      return !0;
+var OD = ND;
+function _D(e, u, t) {
+  for (let r = u; r < t; ++r) if (e.charAt(r) === `
+`) return !0;
   return !1;
 }
-var PD = ID;
-function $D(e, u, t = {}) {
+var jD = _D;
+function TD(e, u, t = {}) {
   return z(e, t.backwards ? u - 1 : u, t) !== u;
 }
-var LD = $D;
-function RD(e, u, t) {
-  let r = u === '"' ? "'" : '"', n = Ee(!1, e, /\\(.)|(["'])/gsu, (D, i, o) => i === r ? i : o === u ? "\\" + o : o || (t && /^[^\n\r"'0-7\\bfnrt-vx\u2028\u2029]$/u.test(i) ? i : "\\" + i));
+var ID = TD;
+function PD(e, u, t) {
+  let r = u === '"' ? "'" : '"', n = me(!1, e, /\\(.)|(["'])/gsu, (D, a, i) => a === r ? a : i === u ? "\\" + i : i || (t && /^[^\n\r"'0-7\\bfnrt-vx\u2028\u2029]$/u.test(a) ? a : "\\" + a));
   return u + n + u;
 }
-var MD = RD;
-function WD(e, u, t) {
-  return tu(e, t(u));
+var $D = PD;
+function LD(e, u, t) {
+  return uu(e, t(u));
 }
-function VD(e, u) {
-  return arguments.length === 2 || typeof u == "number" ? tu(e, u) : WD(...arguments);
+function RD(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? uu(e, u) : LD(...arguments);
 }
-function zD(e, u, t) {
-  return Qe(e, t(u));
+function WD(e, u, t) {
+  return Ze(e, t(u));
 }
-function qD(e, u) {
-  return arguments.length === 2 || typeof u == "number" ? Qe(e, u) : zD(...arguments);
+function MD(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? Ze(e, u) : WD(...arguments);
 }
-function UD(e, u, t) {
-  return ru(e, t(u));
+function VD(e, u, t) {
+  return tu(e, t(u));
 }
-function JD(e, u) {
-  return arguments.length === 2 || typeof u == "number" ? ru(e, u) : UD(...arguments);
+function zD(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? tu(e, u) : VD(...arguments);
 }
 function H(e, u = 1) {
   return async (...t) => {
@@ -2446,22 +2190,22 @@ function H(e, u = 1) {
     return t[u] = { ...r, plugins: Array.isArray(n) ? n : Object.values(n) }, e(...t);
   };
 }
-var Et = H(ht);
-async function gt(e, u) {
-  let { formatted: t } = await Et(e, { ...u, cursorOffset: -1 });
+var mt = H(pt);
+async function Et(e, u) {
+  let { formatted: t } = await mt(e, { ...u, cursorOffset: -1 });
   return t;
 }
-async function GD(e, u) {
-  return await gt(e, u) === e;
+async function qD(e, u) {
+  return await Et(e, u) === e;
 }
-var HD = H(Xu, 0), KD = { parse: H(dD), formatAST: H(FD), formatDoc: H(pD), printToDoc: H(hD), printDocToString: H(CD) };
+var UD = H(Qu, 0), JD = { parse: H(lD), formatAST: H(cD), formatDoc: H(fD), printToDoc: H(dD), printDocToString: H(FD) };
 export {
-  KD as __debug,
-  GD as check,
-  Ct as doc,
-  gt as format,
-  Et as formatWithCursor,
-  HD as getSupportInfo,
-  mt as util,
-  yD as version
+  JD as __debug,
+  qD as check,
+  ht as doc,
+  Et as format,
+  mt as formatWithCursor,
+  UD as getSupportInfo,
+  Ct as util,
+  mD as version
 };