eddyter 1.3.62 → 1.3.64

package/dist/{standalone-C0qguT38.js → standalone-DmuJV5rn.js}

@@ -1,9 +1,12 @@
 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);
 }, 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 });
+  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 });
+  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;
 }, 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 });
@@ -15,19 +18,23 @@ var yt = Object.create, Me = Object.defineProperty, vt = Object.getOwnPropertyDe
     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 = 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];
+    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, a, i = {}) {
@@ -41,7 +48,8 @@ var yt = Object.create, Me = Object.defineProperty, vt = Object.getOwnPropertyDe
  `, o.gutter(m.replace(/\d/g, " ")), " ", M, o.marker("^").repeat(ce)].join(""), g && i.message && (B += " " + o.message(i.message));
         }
         return [o.marker(">"), o.gutter(m), p.length > 0 ? ` ${p}` : "", B].join("");
-      } else return ` ${o.gutter(m)}${p.length > 0 ? ` ${p}` : ""}`;
+      } else
+        return ` ${o.gutter(m)}${p.length > 0 ? ` ${p}` : ""}`;
     }).join(`
 `);
     return i.message && !d && (h = `${" ".repeat(f + 1)}${i.message}
@@ -51,7 +59,8 @@ ${h}`), h;
 }), _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);
+  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;
@@ -67,11 +76,13 @@ var jt = (e, u, t, r) => {
           r(C);
         }, 0);
         return;
-      } else return C;
+      } 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 >= i && d + 1 >= a) 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, -o); C <= Math.min(h, o); C += 2) {
         let E, m = l[C - 1], y = l[C + 1];
@@ -86,21 +97,26 @@ var jt = (e, u, t, r) => {
           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 >= i && d + 1 >= a) return D(this.buildValues(E.lastComponent, u, e)) || !0;
+        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));
       }
       o++;
     };
-    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;
-    }
+    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;
@@ -108,7 +124,8 @@ var jt = (e, u, t, r) => {
   }
   extractCommon(e, u, t, r, n) {
     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 });
+    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) {
@@ -116,7 +133,8 @@ var jt = (e, u, t, r) => {
   }
   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) {
@@ -136,12 +154,14 @@ var jt = (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, 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;
+      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(i, i + s.count);
@@ -149,7 +169,8 @@ var jt = (e, u, t, r) => {
             let d = t[o + l];
             return d.length > F.length ? d : F;
           }), s.value = this.join(c);
-        } else s.value = this.join(u.slice(i, i + s.count));
+        } else
+          s.value = this.join(u.slice(i, i + s.count));
         i += s.count, s.added || (o += s.count);
       }
     }
@@ -211,29 +232,38 @@ function Rt(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);
+  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 Vt(e) {
-  if (typeof e == "string") return Q;
-  if (Array.isArray(e)) return T;
-  if (!e) return;
+  if (typeof e == "string")
+    return Q;
+  if (Array.isArray(e))
+    return T;
+  if (!e)
+    return;
   let { type: u } = e;
-  if (Iu.has(u)) return u;
+  if (Iu.has(u))
+    return u;
 }
 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}'.`;
+  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}.`;
@@ -254,47 +284,55 @@ function Jt(e, u, t, r) {
     }
     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;
+    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);
       }
-      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 qe = Jt;
 function Ee(e, u) {
-  if (typeof e == "string") return u(e);
+  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);
+    if (t.has(D))
+      return t.get(D);
     let a = n(D);
     return t.set(D, a), a;
   }
@@ -331,14 +369,16 @@ function Ee(e, u) {
 function Ue(e, u, t) {
   let r = t, n = !1;
   function D(a) {
-    if (n) return !1;
+    if (n)
+      return !1;
     let i = u(a);
     i !== void 0 && (n = !0, r = i);
   }
   return qe(e, D), r;
 }
 function Gt(e) {
-  if (e.type === w && e.break || e.type === b && e.hard || e.type === S) return !0;
+  if (e.type === w && e.break || e.type === b && e.hard || e.type === S)
+    return !0;
 }
 function Ht(e) {
   return Ue(e, Gt, !1);
@@ -354,7 +394,8 @@ function Kt(e) {
   let u = /* @__PURE__ */ new Set(), t = [];
   function r(D) {
     if (D.type === S && nu(t), D.type === w) {
-      if (t.push(D), u.has(D)) return !1;
+      if (t.push(D), u.has(D))
+        return !1;
       u.add(D);
     }
   }
@@ -370,7 +411,8 @@ function Zt(e) {
   return Ee(e, Yt);
 }
 function Du(e) {
-  for (e = [...e]; e.length >= 2 && v(!1, e, -2).type === b && v(!1, e, -1).type === S; ) e.length -= 2;
+  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 = ae(v(!1, e, -1));
     e[e.length - 1] = u;
@@ -413,25 +455,31 @@ function Pu(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);
       }
@@ -458,7 +506,8 @@ function er(e, u = Wu) {
 `)) : t);
 }
 function ur(e) {
-  if (e.type === b) return !0;
+  if (e.type === b)
+    return !0;
 }
 function tr(e) {
   return Ue(e, ur, !1);
@@ -504,13 +553,15 @@ function je(e) {
 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 Vu(e, u, t) {
   let r = e;
   if (u > 0) {
-    for (let n = 0; n < Math.floor(u / t); ++n) r = Ce(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;
@@ -520,14 +571,17 @@ function pr(e, 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;
@@ -537,7 +591,8 @@ function hr(e) {
   return r(j(e));
   function r(D, a, i) {
     var o, s;
-    if (typeof D == "string") return JSON.stringify(D);
+    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(", ")}]`;
@@ -546,11 +601,16 @@ function hr(e) {
       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 = 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 === 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)}`);
@@ -563,20 +623,28 @@ function hr(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 === W) 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];
+    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)})`;
+      if (!t.has(o))
+        return t.add(o), u[D] = `Symbol.for(${JSON.stringify(o)})`;
     }
   }
 }
@@ -589,8 +657,10 @@ function Er(e) {
 }
 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;
+  if (!e)
+    return 0;
+  if (!yr.test(e))
+    return e.length;
   e = e.replace(Cr(), "  ");
   let u = 0;
   for (let t of e) {
@@ -599,7 +669,7 @@ function vr(e) {
   }
   return u;
 }
-var Ge = vr, A = /* @__PURE__ */ Symbol("MODE_BREAK"), x = /* @__PURE__ */ Symbol("MODE_FLAT"), ee = /* @__PURE__ */ Symbol("cursor"), Te = /* @__PURE__ */ Symbol("DOC_FILL_PRINTED_LENGTH");
+var Ge = vr, A = Symbol("MODE_BREAK"), x = Symbol("MODE_FLAT"), ee = Symbol("cursor"), Te = Symbol("DOC_FILL_PRINTED_LENGTH");
 function zu() {
   return { value: "", length: 0, queue: [] };
 }
@@ -611,19 +681,20 @@ function br(e, u, t) {
 }
 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}'`);
-  }
+  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 o(f) {
     n += "	".repeat(f), D += t.tabWidth * f;
@@ -646,30 +717,36 @@ function Ie(e, u, t) {
 }
 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 a = n[D];
-      if (a === " " || a === "	") 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 fe(e, u, t, r, n, D) {
-  if (t === Number.POSITIVE_INFINITY) return !0;
+  if (t === Number.POSITIVE_INFINITY)
+    return !0;
   let a = u.length, i = [e], o = [];
   for (; t >= 0; ) {
     if (i.length === 0) {
-      if (a === 0) return !0;
+      if (a === 0)
+        return !0;
       i.push(u[--a]);
       continue;
     }
@@ -681,7 +758,8 @@ function fe(e, u, t, r, n, D) {
       case T:
       case O: {
         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] });
+        for (let f = l.length - 1; f >= d; f--)
+          i.push({ mode: s, doc: l[f] });
         break;
       }
       case I:
@@ -694,7 +772,8 @@ function fe(e, u, t, r, n, D) {
         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;
         i.push({ mode: l, doc: d });
         break;
@@ -705,14 +784,16 @@ function fe(e, u, t, r, n, D) {
         break;
       }
       case b:
-        if (s === A || c.hard) return !0;
+        if (s === A || c.hard)
+          return !0;
         c.soft || (o.push(" "), t--);
         break;
       case R:
         r = !0;
         break;
       case W:
-        if (r) return !1;
+        if (r)
+          return !1;
         break;
     }
   }
@@ -731,10 +812,12 @@ function ye(e, u) {
         break;
       }
       case T:
-        for (let h = f.length - 1; h >= 0; h--) a.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.");
+        if (c >= 2)
+          throw new Error("There are too many 'cursor' in doc.");
         i.push(ee), c++;
         break;
       case I:
@@ -756,23 +839,27 @@ function ye(e, u) {
           case A: {
             o = !1;
             let h = { ind: l, mode: x, doc: f.contents }, p = r - D, C = s.length > 0;
-            if (!f.break && fe(h, a, p, C, t)) a.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) {
                 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) {
-                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 });
+              } 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;
           }
         }
@@ -780,7 +867,8 @@ function ye(e, u) {
         break;
       case O: {
         let h = r - D, p = f[Te] ?? 0, { parts: C } = f, E = C.length - p;
-        if (E === 0) break;
+        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) {
           M ? a.push(g) : a.push(B);
@@ -817,7 +905,8 @@ function ye(e, u) {
       case b:
         switch (d) {
           case x:
-            if (f.hard) o = !0;
+            if (f.hard)
+              o = !0;
             else {
               f.soft || (i.push(" "), D += 1);
               break;
@@ -844,7 +933,8 @@ function ye(e, u) {
   let F = i.indexOf(ee);
   if (F !== -1) {
     let l = i.indexOf(ee, F + 1);
-    if (l === -1) return { formatted: i.filter((p) => p !== ee).join("") };
+    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 };
   }
@@ -852,7 +942,8 @@ function ye(e, u) {
 }
 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 He = Ar, J, $e, pe, wr = class {
@@ -922,7 +1013,8 @@ var He = Ar, J, $e, pe, wr = 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 {
@@ -939,9 +1031,11 @@ var He = Ar, J, $e, pe, wr = 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;
     }
@@ -955,24 +1049,32 @@ var He = Ar, J, $e, pe, wr = 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, pe).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, pe).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(), $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;
 }, pe = function* () {
   let { stack: e } = this;
@@ -991,15 +1093,19 @@ function* ve(e, u) {
   let { getVisitorKeys: t, filter: r = () => !0 } = u, n = (D) => xr(D) && r(D);
   for (let D of t(e)) {
     let a = e[D];
-    if (Array.isArray(a)) for (let i of a) n(i) && (yield i);
-    else n(a) && (yield a);
+    if (Array.isArray(a))
+      for (let i of a)
+        n(i) && (yield i);
+    else
+      n(a) && (yield a);
   }
 }
 function* Nr(e, u) {
   let t = [e];
   for (let r = 0; r < t.length; r++) {
     let n = t[r];
-    for (let D of ve(n, u)) yield D, t.push(D);
+    for (let D of ve(n, u))
+      yield D, t.push(D);
   }
 }
 function Or(e, u) {
@@ -1008,13 +1114,16 @@ function Or(e, u) {
 function se(e) {
   return (u, t, r) => {
     let n = !!(r != null && r.backwards);
-    if (t === !1) return !1;
+    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(i)) return a;
-      } else if (!e.includes(i)) return a;
+        if (!e.test(i))
+          return a;
+      } else if (!e.includes(i))
+        return a;
       n ? a-- : a++;
     }
     return a === -1 || a === D ? a : !1;
@@ -1023,18 +1132,23 @@ function se(e) {
 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;
 }
@@ -1070,9 +1184,11 @@ function oe(e, u) {
 }
 var ke = /* @__PURE__ */ new WeakMap();
 function Ye(e, u) {
-  if (ke.has(e)) return ke.get(e);
+  if (ke.has(e))
+    return ke.get(e);
   let { printer: { getCommentChildNodes: t, canAttachComment: r, getVisitorKeys: n }, locStart: D, locEnd: a } = u;
-  if (!r) return [];
+  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;
 }
@@ -1080,7 +1196,8 @@ 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 = o[d], h = n(f), p = D(f);
-    if (h <= a && i <= p) return Hu(f, u, t, f);
+    if (h <= a && i <= p)
+      return Hu(f, u, t, f);
     if (p <= a) {
       s = f, F = d + 1;
       continue;
@@ -1100,57 +1217,75 @@ function Hu(e, u, t, r) {
 var Se = () => !1;
 function Wr(e, u) {
   let { comments: t } = e;
-  if (delete e.comments, !Pr(t) || !u.printer.canAttachComment) return;
+  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]), 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;
+    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);
-  }
+  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);
-  }
+  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;
+  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;
+    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));
+  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 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 zr(e, u) {
@@ -1170,7 +1305,8 @@ function qr(e, u) {
   if ((t = D.isBlockComment) != null && t.call(D, r)) {
     let c = V(a, o(r)) ? V(a, i(r), { backwards: !0 }) ? Y : Ru : " ";
     n.push(c);
-  } else n.push(Y);
+  } else
+    n.push(Y);
   let s = Z(a, z(a, o(r)));
   return s !== !1 && V(a, s) && n.push(Y), n;
 }
@@ -1185,13 +1321,16 @@ function Ur(e, u, t) {
 }
 function Jr(e, u) {
   let t = e.node;
-  if (!t) return {};
-  let r = u[/* @__PURE__ */ Symbol.for("printedComments")];
-  if ((t.comments || []).filter((i) => !r.has(i)).length === 0) return { leading: "", trailing: "" };
+  if (!t)
+    return {};
+  let r = u[Symbol.for("printedComments")];
+  if ((t.comments || []).filter((i) => !r.has(i)).length === 0)
+    return { leading: "", trailing: "" };
   let n = [], D = [], a;
   return e.each(() => {
     let i = e.node;
-    if (r != null && r.has(i)) return;
+    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 };
@@ -1201,9 +1340,10 @@ function Gr(e, u, t) {
   return !r && !n ? u : Fe(u, (D) => [r, D, n]);
 }
 function Hr(e) {
-  let { [/* @__PURE__ */ Symbol.for("comments")]: u, [/* @__PURE__ */ Symbol.for("printedComments")]: t } = e;
+  let { [Symbol.for("comments")]: u, [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;
   }
 }
@@ -1217,21 +1357,24 @@ The range will extend forwards to the end of the selected statement.`, cliCatego
 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 Qu({ plugins: e = [], showDeprecated: u = !1 } = {}) {
   let t = e.flatMap((n) => n.languages ?? []), r = [];
-  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));
+  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* 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 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 };
+  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 Zr(e) {
   let u = [];
@@ -1242,10 +1385,12 @@ function Zr(e) {
   return u;
 }
 var Qr = (e, u) => {
-  if (!(e && u == null)) return u.toReversed || !Array.isArray(u) ? u.toReversed() : [...u].reverse();
+  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}"`);
+  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 un(e) {
@@ -1261,21 +1406,25 @@ function rn(e) {
 }
 var nn = rn, Dn = (e) => String(e).split(/[/\\]/u).pop();
 function du(e, u) {
-  if (!u) return;
+  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 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}`));
+  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 Fu(e, u) {
   if (u) {
-    if (String(u).startsWith("file:")) try {
-      u = nn(u);
-    } catch {
-      return;
-    }
-    if (typeof u == "string") return e.find(({ isSupported: t }) => 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 on(e, u) {
@@ -1283,14 +1432,16 @@ function on(e, u) {
   return r?.parsers[0];
 }
 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(", ")}]`;
+  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 }) }, 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("; ") + ".";
-}, ut = /* @__PURE__ */ Symbol.for("vnopts.VALUE_NOT_EXIST"), he = /* @__PURE__ */ Symbol.for("vnopts.VALUE_UNCHANGED"), pu = " ".repeat(2), cn = (e, u, t) => {
+}, ut = Symbol.for("vnopts.VALUE_NOT_EXIST"), he = 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(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);
@@ -1304,24 +1455,32 @@ function tt({ text: e, list: u }, t) {
 `)), rt(r, t);
 }
 function rt(e, u) {
-  if (e.length === 1) return e[0];
+  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 Ne = [], Cu = [];
 function fn(e, u) {
-  if (e === u) return 0;
+  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;
+  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;
+  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 }) => {
@@ -1330,7 +1489,8 @@ var nt = (e, u, { descriptor: t, logger: r, schemas: n }) => {
 }, 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 dn) n in u && (r[n] = pn(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 {
@@ -1397,7 +1557,8 @@ var hn = 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);
@@ -1448,7 +1609,8 @@ 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;
@@ -1457,7 +1619,8 @@ 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;
@@ -1471,14 +1634,16 @@ function vn() {
 }
 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 bn(e) {
   return e === Math.floor(e);
 }
 function An(e, u) {
-  if (e === u) return 0;
+  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);
 }
@@ -1492,7 +1657,8 @@ function Eu(e) {
   return e === void 0 ? {} : e;
 }
 function Dt(e) {
-  if (typeof e == "string") return { text: e };
+  if (typeof e == "string")
+    return { text: e };
   let { text: u, list: t } = e;
   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 };
 }
@@ -1513,7 +1679,8 @@ function Bu(e, u) {
   return t.length === 0 ? { remain: u, redirect: t } : typeof e == "object" && "remain" in e ? { remain: e.remain, redirect: t } : { redirect: t };
 }
 function kn(e, u) {
-  if (!e) throw new Error(u);
+  if (!e)
+    throw new Error(u);
 }
 var Sn = class extends U {
   constructor(e) {
@@ -1585,7 +1752,8 @@ var Sn = class extends U {
     }
     r();
     for (let n of Object.keys(this._utils.schemas)) {
-      if (!(n in u)) continue;
+      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);
     }
@@ -1600,14 +1768,17 @@ var Sn = class extends U {
         t.push(typeof l == "string" ? { [l]: F } : { [l.key]: l.value });
       }, s = ({ value: F, redirectTo: l }) => {
         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));
-          }
-        }
+        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));
+              }
+            }
       };
       Re(a.forward(i, this._utils), i).forEach(o);
       let c = Bu(a.redirect(i, this._utils), i);
@@ -1615,7 +1786,8 @@ var Sn = class extends U {
         let F = c.remain;
         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 a = e[D];
@@ -1626,7 +1798,9 @@ var Sn = class extends U {
     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, ut, 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] = Bn(Object.keys(e).filter((r) => !this._identifyMissing(r, e)), (r) => r in this._utils.schemas);
@@ -1634,20 +1808,25 @@ var Sn = class extends U {
   }
   _applyValidation(e, u, t) {
     let r = gu(t.validate(e, this._utils), e);
-    if (r !== !0) throw this._invalidHandler(u, r.value, this._utils);
+    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 a = n[D];
-      D in this._utils.schemas ? r(D, a) : t[D] = a;
-    }
+    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 !== he) {
-      if (u.delete) for (let t of u.delete) delete e[t];
+      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) {
@@ -1667,9 +1846,12 @@ var Sn = class extends U {
 }, 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 (!a) throw new Error("'descriptor' option is required.");
-  } else a = ue;
+    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 nt(l, d, { ...f, schemas: p });
@@ -1681,7 +1863,8 @@ function Pn(e, u, { logger: t = !1, isCLI: r = !1, passThrough: n = !1, FlagSche
 function $n(e, { isCLI: u, FlagSchema: t }) {
   let r = [];
   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 }));
+  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 Ln(e, { isCLI: u, optionInfos: t, FlagSchema: r }) {
@@ -1716,24 +1899,30 @@ function Ln(e, { isCLI: u, optionInfos: t, FlagSchema: r }) {
 }
 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;
     }
   }
 }, at = Wn;
 function it(e, u) {
-  if (!u) throw new Error("parserName is required.");
+  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;
+  if (t)
+    return t;
   let r = `Couldn't resolve parser "${u}".`;
   throw r += " Plugins must be explicitly added to the standalone bundle.", new Zu(r);
 }
 function Mn(e, u) {
-  if (!u) throw new Error("astFormat is required.");
+  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;
+  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 Zu(r);
 }
@@ -1753,15 +1942,19 @@ var Au = { astFormat: "estree", printer: {}, originalText: void 0, locStart: nul
 async function zn(e, u = {}) {
   var t;
   let r = { ...e };
-  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.");
+  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 = 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);
+  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());
@@ -1788,26 +1981,32 @@ function Jn(e, u) {
 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");
+  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 Hn(f, h, t, r);
   }
   function d() {
     let { node: f } = e;
-    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);
+    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") {
@@ -1823,8 +2022,9 @@ async function Hn(e, u, t, r) {
   return Pu(a);
 }
 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);
+  let { originalText: t, [Symbol.for("comments")]: r, locStart: n, locEnd: D, [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;
@@ -1834,8 +2034,10 @@ async function be(e, u) {
   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];
+    if (u.nodeAfterCursor && !u.nodeBeforeCursor)
+      return [K, D];
+    if (u.nodeBeforeCursor && !u.nodeAfterCursor)
+      return [D, K];
   }
   return D;
   function a(o, s) {
@@ -1843,9 +2045,11 @@ async function be(e, u) {
   }
   function i(o) {
     let s = r.node;
-    if (s == null) return "";
+    if (s == null)
+      return "";
     let c = s && typeof s == "object" && o === void 0;
-    if (c && t.has(s)) return t.get(s);
+    if (c && t.has(s))
+      return t.get(s);
     let F = wu(r, u, a, o, n);
     return c && t.set(s, F), F;
   }
@@ -1868,14 +2072,16 @@ function wu(e, u, t, r, n) {
 }
 async function st(e, u) {
   let t = e.comments ?? [];
-  u[/* @__PURE__ */ Symbol.for("comments")] = t, u[/* @__PURE__ */ Symbol.for("printedComments")] = /* @__PURE__ */ new Set(), Wr(e, u);
+  u[Symbol.for("comments")] = t, u[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 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 };
+  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 (; o.length > 0 && (s === void 0 || c === void 0); ) {
     i = o.pop();
@@ -1896,24 +2102,31 @@ function Zn(e, u) {
 var lt = Zn;
 function Qn(e, u) {
   let { printer: { massageAstNode: t, getVisitorKeys: r } } = u;
-  if (!t) return e;
+  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);
+    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]);
+    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;
+    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;
   }
@@ -1928,15 +2141,22 @@ function ku(e) {
 }
 function nD(e, u, { locStart: t, locEnd: r }) {
   let n = e.node, D = u.node;
-  if (n === D) return { startNode: n, endNode: D };
+  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;
+  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;
+    if (r(o) <= i)
+      n = o;
+    else
+      break;
+    if (n === D)
+      break;
   }
   return { startNode: n, endNode: D };
 }
@@ -1945,9 +2165,11 @@ function We(e, u, t, r, n = [], D) {
   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 DD(e, u) {
@@ -1955,7 +2177,8 @@ function DD(e, u) {
 }
 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;
+  if (!u)
+    return !1;
   switch (e.parser) {
     case "flow":
     case "hermes":
@@ -1986,19 +2209,24 @@ 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) ;
+  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 };
+  if (!s || !c)
+    return { rangeStart: 0, rangeEnd: 0 };
   let F, l;
   if (tD(u)) {
     let d = rD(s, c);
     F = d, l = d;
-  } else ({ startNode: F, endNode: l } = nD(s, c, u));
+  } 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");
+var ft = "\uFEFF", xu = Symbol("cursor");
 async function dt(e, u, t = 0) {
-  if (!e || e.trim().length === 0) return { formatted: "", cursorOffset: -1, comments: [] };
+  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, ...lt(r, u) });
   let D = await be(r, u);
@@ -2008,25 +2236,33 @@ async function dt(e, u, t = 0) {
     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 i = u[/* @__PURE__ */ Symbol.for("comments")];
+  let i = u[Symbol.for("comments")];
   if (u.cursorOffset >= 0) {
     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;
+    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 };
+    if (s === F)
+      return { formatted: a.formatted, cursorOffset: c + l, comments: i };
     let d = s.split("");
     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;
+    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 };
@@ -2072,7 +2308,8 @@ async function sD(e, u) {
 }
 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: [] };
+  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 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;
 }
@@ -2102,9 +2339,12 @@ 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 (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;
 }
@@ -2115,13 +2355,15 @@ function gD(e, u) {
 var eu = gD;
 function yD(e, u) {
   let t = null, r = u;
-  for (; r !== t; ) t = r, r = z(e, r), r = Xe(e, r), r = eu(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 uu = yD;
 function vD(e, u) {
   let t = null, r = u;
-  for (; r !== t; ) t = r, r = Uu(e, r), r = Xe(e, r), r = z(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 tu = vD;
@@ -2132,7 +2374,8 @@ function BD(e, u) {
 }
 var bD = BD;
 function AD(e) {
-  if (typeof e != "string") throw new TypeError("Expected a string");
+  if (typeof e != "string")
+    throw new TypeError("Expected a string");
   return e.replace(/[|\\{}()[\]^$+*?.]/g, "\\$&").replace(/-/g, "\\x2d");
 }
 function wD(e, u) {
@@ -2147,13 +2390,16 @@ function SD(e, u) {
 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++;
+  for (let a of e)
+    a === t ? n++ : a === r && D++;
   return n > D ? r : t;
 }
 var OD = ND;
 function _D(e, u, t) {
-  for (let r = u; r < t; ++r) if (e.charAt(r) === `
-`) return !0;
+  for (let r = u; r < t; ++r)
+    if (e.charAt(r) === `
+`)
+      return !0;
   return !1;
 }
 var jD = _D;