@maildeno/editor 0.4.3 → 0.4.4

package/dist/standalone-Yv8gSIWN.js

@@ -0,0 +1,2336 @@
+var er = Object.defineProperty;
+var Eu = (e) => {
+  throw TypeError(e);
+};
+var ur = (e, u, t) => u in e ? er(e, u, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[u] = t;
+var Be = (e, u, t) => ur(e, typeof u != "symbol" ? u + "" : u, t), Me = (e, u, t) => u.has(e) || Eu("Cannot " + t);
+var y = (e, u, t) => (Me(e, u, "read from private field"), t ? t.call(e) : u.get(e)), J = (e, u, t) => u.has(e) ? Eu("Cannot add the same private member more than once") : u instanceof WeakSet ? u.add(e) : u.set(e, t), Fe = (e, u, t, r) => (Me(e, u, "write to private field"), r ? r.call(e, t) : u.set(e, t), t), q = (e, u, t) => (Me(e, u, "access private method"), t);
+var tr = Object.defineProperty, Xe = (e, u) => {
+  for (var t in u) tr(e, t, { get: u[t], enumerable: !0 });
+}, rr = {};
+Xe(rr, { __debug: () => na, check: () => ta, doc: () => Ut, format: () => Yt, formatWithCursor: () => Ht, getSupportInfo: () => ra, util: () => Jt, version: () => Ni });
+var me = (e, u) => (t, r, ...n) => t | 1 && r == null ? void 0 : (u.call(r) ?? r[e]).apply(r, n), nr = String.prototype.replaceAll ?? function(e, u) {
+  return e.global ? this.replace(e, u) : this.split(e).join(u);
+}, Dr = me("replaceAll", function() {
+  if (typeof this == "string") return nr;
+}), Se = Dr, ir = 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)), a = this.removeEmpty(this.tokenize(D, t));
+    return this.diffWithOptionsObj(i, a, t, r);
+  }
+  diffWithOptionsObj(e, u, t, r) {
+    var n;
+    let D = (C) => {
+      if (C = this.postProcess(C, t), r) {
+        setTimeout(function() {
+          r(C);
+        }, 0);
+        return;
+      } else return C;
+    }, i = u.length, a = e.length, o = 1, s = i + a;
+    t.maxEditLength != null && (s = Math.min(s, t.maxEditLength));
+    let l = (n = t.timeout) !== null && n !== void 0 ? n : 1 / 0, f = Date.now() + l, c = [{ oldPos: -1, lastComponent: void 0 }], d = this.extractCommon(c[0], u, e, 0, t);
+    if (c[0].oldPos + 1 >= a && d + 1 >= i) return D(this.buildValues(c[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, g = c[C - 1], m = c[C + 1];
+        g && (c[C - 1] = void 0);
+        let b = !1;
+        if (m) {
+          let w = m.oldPos - C;
+          b = m && 0 <= w && w < i;
+        }
+        let A = g && g.oldPos + 1 < a;
+        if (!b && !A) {
+          c[C] = void 0;
+          continue;
+        }
+        if (!A || b && g.oldPos < m.oldPos ? E = this.addToPath(m, !0, !1, 0, t) : E = this.addToPath(g, !1, !0, 1, t), d = this.extractCommon(E, u, e, C, t), E.oldPos + 1 >= a && d + 1 >= i) return D(this.buildValues(E.lastComponent, u, e)) || !0;
+        c[C] = E, E.oldPos + 1 >= a && (h = Math.min(h, C - 1)), d + 1 >= i && (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;
+    }
+  }
+  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, a = e.oldPos, o = a - r, s = 0;
+    for (; o + 1 < D && a + 1 < i && this.equals(t[a + 1], u[o + 1], n); ) o++, a++, 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 = a, 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]);
+    return u;
+  }
+  castInput(e, u) {
+    return e;
+  }
+  tokenize(e, u) {
+    return Array.from(e);
+  }
+  join(e) {
+    return e.join("");
+  }
+  postProcess(e, u) {
+    return e;
+  }
+  get useLongestToken() {
+    return !1;
+  }
+  buildValues(e, u, t) {
+    let r = [], n;
+    for (; e; ) r.push(e), n = e.previousComponent, delete e.previousComponent, e = n;
+    r.reverse();
+    let D = r.length, i = 0, a = 0, o = 0;
+    for (; i < D; i++) {
+      let s = r[i];
+      if (s.removed) s.value = this.join(t.slice(o, o + s.count)), o += s.count;
+      else {
+        if (!s.added && this.useLongestToken) {
+          let l = u.slice(a, a + s.count);
+          l = l.map(function(f, c) {
+            let d = t[o + c];
+            return d.length > f.length ? d : f;
+          }), s.value = this.join(l);
+        } else s.value = this.join(u.slice(a, a + s.count));
+        a += s.count, s.added || (o += s.count);
+      }
+    }
+    return r;
+  }
+}, ar = class extends ir {
+  tokenize(e) {
+    return e.slice();
+  }
+  join(e) {
+    return e;
+  }
+  removeEmpty(e) {
+    return e;
+  }
+}, or = new ar();
+function sr(e, u, t) {
+  return or.diff(e, u, t);
+}
+var lr = () => {
+}, cr = lr, Gu = "cr", Hu = "crlf", fr = "lf", Fr = fr, eu = "\r", Yu = `\r
+`, xe = `
+`, dr = xe;
+function pr(e) {
+  let u = e.indexOf(eu);
+  return u !== -1 ? e.charAt(u + 1) === xe ? Hu : Gu : Fr;
+}
+function uu(e) {
+  return e === Gu ? eu : e === Hu ? Yu : dr;
+}
+var hr = /* @__PURE__ */ new Map([[xe, /\n/g], [eu, /\r/g], [Yu, /\r\n/g]]);
+function Zu(e, u) {
+  var r;
+  let t = hr.get(u);
+  return ((r = e.match(t)) == null ? void 0 : r.length) ?? 0;
+}
+var Cr = /\r\n?/g;
+function Er(e) {
+  return Se(0, e, Cr, xe);
+}
+var Ne = Symbol.for("comments");
+function mr(e) {
+  return this[e < 0 ? this.length + e : e];
+}
+var gr = me("at", function() {
+  if (Array.isArray(this) || typeof this == "string") return mr;
+}), B = gr, re = "string", M = "array", Y = "cursor", R = "indent", V = "align", W = "trim", k = "group", T = "fill", S = "if-break", z = "indent-if-break", K = "line-suffix", U = "line-suffix-boundary", v = "line", I = "label", N = "break-parent", Qu = /* @__PURE__ */ new Set([Y, R, V, W, k, T, S, z, K, U, v, I, N]);
+function yr(e) {
+  let u = e.length;
+  for (; u > 0 && (e[u - 1] === "\r" || e[u - 1] === `
+`); ) u--;
+  return u < e.length ? e.slice(0, u) : e;
+}
+function tu(e, u, t) {
+  if (!e.has(u)) {
+    let r = t(u);
+    e.set(u, r);
+  }
+  return e.get(u);
+}
+function Br(e) {
+  if (typeof e == "string") return re;
+  if (Array.isArray(e)) return M;
+  if (!e) return;
+  let { type: u } = e;
+  if (Qu.has(u)) return u;
+}
+var ne = Br, vr = (e) => new Intl.ListFormat("en-US", { type: "disjunction" }).format(e);
+function Ar(e) {
+  let u = e === null ? "null" : typeof e;
+  if (u !== "string" && u !== "object") return `Unexpected doc '${u}', 
+Expected it to be 'string' or 'object'.`;
+  if (ne(e)) throw new Error("doc is valid.");
+  let t = Object.prototype.toString.call(e);
+  if (t !== "[object Object]") return `Unexpected doc '${t}'.`;
+  let r = vr([...Qu].map((n) => `'${n}'`));
+  return `Unexpected doc.type '${e.type}'.
+Expected it to be ${r}.`;
+}
+var br = class extends Error {
+  constructor(u) {
+    super(Ar(u));
+    Be(this, "name", "InvalidDocError");
+    this.doc = u;
+  }
+}, le = br, mu = {};
+function wr(e, u, t, r) {
+  let n = [e];
+  for (; n.length > 0; ) {
+    let D = n.pop();
+    if (D === mu) {
+      t(n.pop());
+      continue;
+    }
+    t && n.push(D, mu);
+    let i = ne(D);
+    if (!i) throw new le(D);
+    if ((u == null ? void 0 : u(D)) !== !1) switch (i) {
+      case M:
+      case T: {
+        let a = i === M ? D : D.parts;
+        for (let o = a.length, s = o - 1; s >= 0; --s) n.push(a[s]);
+        break;
+      }
+      case S:
+        n.push(D.flatContents, D.breakContents);
+        break;
+      case k:
+        if (r && D.expandedStates) for (let a = D.expandedStates.length, o = a - 1; o >= 0; --o) n.push(D.expandedStates[o]);
+        else n.push(D.contents);
+        break;
+      case V:
+      case R:
+      case z:
+      case I:
+      case K:
+        n.push(D.contents);
+        break;
+      case re:
+      case Y:
+      case W:
+      case U:
+      case v:
+      case N:
+        break;
+      default:
+        throw new le(D);
+    }
+  }
+}
+var ru = wr;
+function _e(e, u) {
+  if (typeof e == "string") return u(e);
+  let t = /* @__PURE__ */ new Map();
+  return r(e);
+  function r(D) {
+    return tu(t, D, n);
+  }
+  function n(D) {
+    switch (ne(D)) {
+      case M:
+        return u(D.map(r));
+      case T:
+        return u({ ...D, parts: D.parts.map(r) });
+      case S:
+        return u({ ...D, breakContents: r(D.breakContents), flatContents: r(D.flatContents) });
+      case k: {
+        let { expandedStates: i, contents: a } = D;
+        return i ? (i = i.map(r), a = i[0]) : a = r(a), u({ ...D, contents: a, expandedStates: i });
+      }
+      case V:
+      case R:
+      case z:
+      case I:
+      case K:
+        return u({ ...D, contents: r(D.contents) });
+      case re:
+      case Y:
+      case W:
+      case U:
+      case v:
+      case N:
+        return u(D);
+      default:
+        throw new le(D);
+    }
+  }
+}
+function nu(e, u, t) {
+  let r = t, n = !1;
+  function D(i) {
+    if (n) return !1;
+    let a = u(i);
+    a !== void 0 && (n = !0, r = a);
+  }
+  return ru(e, D), r;
+}
+function kr(e) {
+  if (e.type === k && e.break || e.type === v && e.hard || e.type === N) return !0;
+}
+function Sr(e) {
+  return nu(e, kr, !1);
+}
+function gu(e) {
+  if (e.length > 0) {
+    let u = B(0, e, -1);
+    !u.expandedStates && !u.break && (u.break = "propagated");
+  }
+  return null;
+}
+function xr(e) {
+  let u = /* @__PURE__ */ new Set(), t = [];
+  function r(D) {
+    if (D.type === N && gu(t), D.type === k) {
+      if (t.push(D), u.has(D)) return !1;
+      u.add(D);
+    }
+  }
+  function n(D) {
+    D.type === k && t.pop().break && gu(t);
+  }
+  ru(e, r, n, !0);
+}
+function Nr(e) {
+  return e.type === v && !e.hard ? e.soft ? "" : " " : e.type === S ? e.flatContents : e;
+}
+function _r(e) {
+  return _e(e, Nr);
+}
+function yu(e) {
+  for (e = [...e]; e.length >= 2 && B(0, e, -2).type === v && B(0, e, -1).type === N; ) e.length -= 2;
+  if (e.length > 0) {
+    let u = de(B(0, e, -1));
+    e[e.length - 1] = u;
+  }
+  return e;
+}
+function de(e) {
+  switch (ne(e)) {
+    case R:
+    case z:
+    case k:
+    case K:
+    case I: {
+      let u = de(e.contents);
+      return { ...e, contents: u };
+    }
+    case S:
+      return { ...e, breakContents: de(e.breakContents), flatContents: de(e.flatContents) };
+    case T:
+      return { ...e, parts: yu(e.parts) };
+    case M:
+      return yu(e);
+    case re:
+      return yr(e);
+    case V:
+    case Y:
+    case W:
+    case U:
+    case v:
+    case N:
+      break;
+    default:
+      throw new le(e);
+  }
+  return e;
+}
+function Xu(e) {
+  return de(Tr(e));
+}
+function Or(e) {
+  switch (ne(e)) {
+    case T: {
+      let { parts: u } = e;
+      if (u.every((t) => t === "")) return "";
+      if (u.length === 1) return u[0];
+      break;
+    }
+    case k:
+      if (!e.contents && !e.id && !e.break && !e.expandedStates) return "";
+      if (e.contents.type === k && e.contents.id === e.id && e.contents.break === e.break && e.contents.expandedStates === e.expandedStates) return e.contents;
+      break;
+    case V:
+    case R:
+    case z:
+    case K:
+      if (!e.contents) return "";
+      break;
+    case S:
+      if (!e.flatContents && !e.breakContents) return "";
+      break;
+    case M: {
+      let u = [];
+      for (let t of e) {
+        if (!t) continue;
+        let [r, ...n] = Array.isArray(t) ? t : [t];
+        typeof r == "string" && typeof B(0, u, -1) == "string" ? u[u.length - 1] += r : u.push(r), u.push(...n);
+      }
+      return u.length === 0 ? "" : u.length === 1 ? u[0] : u;
+    }
+    case re:
+    case Y:
+    case W:
+    case U:
+    case v:
+    case I:
+    case N:
+      break;
+    default:
+      throw new le(e);
+  }
+  return e;
+}
+function Tr(e) {
+  return _e(e, (u) => Or(u));
+}
+function Ir(e, u = it) {
+  return _e(e, (t) => typeof t == "string" ? rt(u, t.split(`
+`)) : t);
+}
+function Pr(e) {
+  if (e.type === v) return !0;
+}
+function jr(e) {
+  return nu(e, Pr, !1);
+}
+function Ae(e, u) {
+  return e.type === I ? { ...e, contents: u(e.contents) } : u(e);
+}
+var Lr = cr;
+function ke(e) {
+  return { type: R, contents: e };
+}
+function ce(e, u) {
+  return { type: V, contents: u, n: e };
+}
+function $r(e) {
+  return ce(Number.NEGATIVE_INFINITY, e);
+}
+function et(e) {
+  return ce({ type: "root" }, e);
+}
+function Mr(e) {
+  return ce(-1, e);
+}
+function ut(e, u, t) {
+  let r = e;
+  if (u > 0) {
+    for (let n = 0; n < Math.floor(u / t); ++n) r = ke(r);
+    r = ce(u % t, r), r = ce(Number.NEGATIVE_INFINITY, r);
+  }
+  return r;
+}
+var Oe = { type: N }, ee = { type: Y };
+function Rr(e) {
+  return { type: T, parts: e };
+}
+function tt(e, u = {}) {
+  return Lr(u.expandedStates), { type: k, id: u.id, contents: e, break: !!u.shouldBreak, expandedStates: u.expandedStates };
+}
+function Vr(e, u) {
+  return tt(e[0], { ...u, expandedStates: e });
+}
+function Wr(e, u = "", t = {}) {
+  return { type: S, breakContents: e, flatContents: u, groupId: t.groupId };
+}
+function zr(e, u) {
+  return { type: z, contents: e, groupId: u.groupId, negate: u.negate };
+}
+function rt(e, u) {
+  let t = [];
+  for (let r = 0; r < u.length; r++) r !== 0 && t.push(e), t.push(u[r]);
+  return t;
+}
+function Kr(e, u) {
+  return e ? { type: I, label: e, contents: u } : u;
+}
+var nt = { type: v }, Ur = { type: v, soft: !0 }, Du = { type: v, hard: !0 }, L = [Du, Oe], Dt = { type: v, hard: !0, literal: !0 }, it = [Dt, Oe];
+function qe(e) {
+  return { type: K, contents: e };
+}
+var Jr = { type: U }, qr = { type: W };
+function P(e) {
+  var u;
+  if (!e) return "";
+  if (Array.isArray(e)) {
+    let t = [];
+    for (let r of e) if (Array.isArray(r)) t.push(...P(r));
+    else {
+      let n = P(r);
+      n !== "" && t.push(n);
+    }
+    return t;
+  }
+  return e.type === S ? { ...e, breakContents: P(e.breakContents), flatContents: P(e.flatContents) } : e.type === k ? { ...e, contents: P(e.contents), expandedStates: (u = e.expandedStates) == null ? void 0 : u.map(P) } : e.type === T ? { type: "fill", parts: e.parts.map(P) } : e.contents ? { ...e, contents: P(e.contents) } : e;
+}
+function Gr(e) {
+  let u = /* @__PURE__ */ Object.create(null), t = /* @__PURE__ */ new Set();
+  return r(P(e));
+  function r(D, i, a) {
+    var o, s;
+    if (typeof D == "string") return JSON.stringify(D);
+    if (Array.isArray(D)) {
+      let l = D.map(r).filter(Boolean);
+      return l.length === 1 ? l[0] : `[${l.join(", ")}]`;
+    }
+    if (D.type === v) {
+      let l = ((o = a == null ? void 0 : a[i + 1]) == null ? void 0 : o.type) === N;
+      return D.literal ? l ? "literalline" : "literallineWithoutBreakParent" : D.hard ? l ? "hardline" : "hardlineWithoutBreakParent" : D.soft ? "softline" : "line";
+    }
+    if (D.type === N) return ((s = a == null ? void 0 : a[i - 1]) == null ? void 0 : s.type) === v && a[i - 1].hard ? void 0 : "breakParent";
+    if (D.type === W) return "trim";
+    if (D.type === R) return "indent(" + r(D.contents) + ")";
+    if (D.type === V) 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 === S) return "ifBreak(" + r(D.breakContents) + (D.flatContents ? ", " + r(D.flatContents) : "") + (D.groupId ? (D.flatContents ? "" : ', ""') + `, { groupId: ${n(D.groupId)} }` : "") + ")";
+    if (D.type === z) {
+      let l = [];
+      D.negate && l.push("negate: true"), D.groupId && l.push(`groupId: ${n(D.groupId)}`);
+      let f = l.length > 0 ? `, { ${l.join(", ")} }` : "";
+      return `indentIfBreak(${r(D.contents)}${f})`;
+    }
+    if (D.type === k) {
+      let l = [];
+      D.break && D.break !== "propagated" && l.push("shouldBreak: true"), D.id && l.push(`id: ${n(D.id)}`);
+      let f = l.length > 0 ? `, { ${l.join(", ")} }` : "";
+      return D.expandedStates ? `conditionalGroup([${D.expandedStates.map((c) => r(c)).join(",")}]${f})` : `group(${r(D.contents)}${f})`;
+    }
+    if (D.type === T) return `fill([${D.parts.map((l) => r(l)).join(", ")}])`;
+    if (D.type === K) return "lineSuffix(" + r(D.contents) + ")";
+    if (D.type === U) return "lineSuffixBoundary";
+    if (D.type === I) return `label(${JSON.stringify(D.label)}, ${r(D.contents)})`;
+    if (D.type === Y) 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 a = 0; ; a++) {
+      let o = i + (a > 0 ? ` #${a}` : "");
+      if (!t.has(o)) return t.add(o), u[D] = `Symbol.for(${JSON.stringify(o)})`;
+    }
+  }
+}
+var Hr = () => /[#*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-\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-\uDED8\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]|\uDC30\u200D\uD83D\uDC68\uD83C[\uDFFC-\uDFFF])|\uD83E(?:[\uDD1D\uDEEF]\u200D\uD83D\uDC68\uD83C[\uDFFC-\uDFFF]|[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3])))?|\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]|\uDC30\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFD-\uDFFF])|\uD83E(?:[\uDD1D\uDEEF]\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFD-\uDFFF]|[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3])))?|\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]|\uDC30\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])|\uD83E(?:[\uDD1D\uDEEF]\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF]|[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3])))?|\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]|\uDC30\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFD\uDFFF])|\uD83E(?:[\uDD1D\uDEEF]\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFD\uDFFF]|[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3])))?|\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]|\uDC30\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFE])|\uD83E(?:[\uDD1D\uDEEF]\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFE]|[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3])))?))?|\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]|\uDC30\u200D\uD83D\uDC69\uD83C[\uDFFC-\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFC-\uDFFF]|\uDEEF\u200D\uD83D\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]|\uDC30\u200D\uD83D\uDC69\uD83C[\uDFFB\uDFFD-\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFD-\uDFFF]|\uDEEF\u200D\uD83D\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]|\uDC30\u200D\uD83D\uDC69\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF]|\uDEEF\u200D\uD83D\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]|\uDC30\u200D\uD83D\uDC69\uD83C[\uDFFB-\uDFFD\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFD\uDFFF]|\uDEEF\u200D\uD83D\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]|\uDC30\u200D\uD83D\uDC69\uD83C[\uDFFB-\uDFFE])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFE]|\uDEEF\u200D\uD83D\uDC69\uD83C[\uDFFB-\uDFFE])))?))?|\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\uDD3C-\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-\uDE8A\uDE8E-\uDEC2\uDEC6\uDEC8\uDECD-\uDEDC\uDEDF-\uDEEA\uDEEF]|\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\uDE70]|\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]|\uDC30\u200D\uD83E\uDDD1\uD83C[\uDFFC-\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3\uDE70]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF]|\uDEEF\u200D\uD83E\uDDD1\uD83C[\uDFFC-\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]|\uDC30\u200D\uD83E\uDDD1\uD83C[\uDFFB\uDFFD-\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3\uDE70]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF]|\uDEEF\u200D\uD83E\uDDD1\uD83C[\uDFFB\uDFFD-\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]|\uDC30\u200D\uD83E\uDDD1\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3\uDE70]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF]|\uDEEF\u200D\uD83E\uDDD1\uD83C[\uDFFB\uDFFC\uDFFE\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]|\uDC30\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFD\uDFFF])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3\uDE70]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF]|\uDEEF\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFD\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]|\uDC30\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFE])|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3\uDE70]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF]|\uDEEF\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFE])))?))?|\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, Yr = 12288, Zr = 65510, Qr = [12288, 12288, 65281, 65376, 65504, 65510], Xr = 4352, en = 262141, at = [4352, 4447, 8986, 8987, 9001, 9002, 9193, 9196, 9200, 9200, 9203, 9203, 9725, 9726, 9748, 9749, 9776, 9783, 9800, 9811, 9855, 9855, 9866, 9871, 9875, 9875, 9889, 9889, 9898, 9899, 9917, 9918, 9924, 9925, 9934, 9934, 9940, 9940, 9962, 9962, 9970, 9971, 9973, 9973, 9978, 9978, 9981, 9981, 9989, 9989, 9994, 9995, 10024, 10024, 10060, 10060, 10062, 10062, 10067, 10069, 10071, 10071, 10133, 10135, 10160, 10160, 10175, 10175, 11035, 11036, 11088, 11088, 11093, 11093, 11904, 11929, 11931, 12019, 12032, 12245, 12272, 12287, 12289, 12350, 12353, 12438, 12441, 12543, 12549, 12591, 12593, 12686, 12688, 12773, 12783, 12830, 12832, 12871, 12880, 42124, 42128, 42182, 43360, 43388, 44032, 55203, 63744, 64255, 65040, 65049, 65072, 65106, 65108, 65126, 65128, 65131, 94176, 94180, 94192, 94198, 94208, 101589, 101631, 101662, 101760, 101874, 110576, 110579, 110581, 110587, 110589, 110590, 110592, 110882, 110898, 110898, 110928, 110930, 110933, 110933, 110948, 110951, 110960, 111355, 119552, 119638, 119648, 119670, 126980, 126980, 127183, 127183, 127374, 127374, 127377, 127386, 127488, 127490, 127504, 127547, 127552, 127560, 127568, 127569, 127584, 127589, 127744, 127776, 127789, 127797, 127799, 127868, 127870, 127891, 127904, 127946, 127951, 127955, 127968, 127984, 127988, 127988, 127992, 128062, 128064, 128064, 128066, 128252, 128255, 128317, 128331, 128334, 128336, 128359, 128378, 128378, 128405, 128406, 128420, 128420, 128507, 128591, 128640, 128709, 128716, 128716, 128720, 128722, 128725, 128728, 128732, 128735, 128747, 128748, 128756, 128764, 128992, 129003, 129008, 129008, 129292, 129338, 129340, 129349, 129351, 129535, 129648, 129660, 129664, 129674, 129678, 129734, 129736, 129736, 129741, 129756, 129759, 129770, 129775, 129784, 131072, 196605, 196608, 262141], ot = (e, u) => {
+  let t = 0, r = Math.floor(e.length / 2) - 1;
+  for (; t <= r; ) {
+    let n = Math.floor((t + r) / 2), D = n * 2;
+    if (u < e[D]) r = n - 1;
+    else if (u > e[D + 1]) t = n + 1;
+    else return !0;
+  }
+  return !1;
+}, Bu = 19968, [un, tn] = rn(at);
+function rn(e) {
+  let u = e[0], t = e[1];
+  for (let r = 0; r < e.length; r += 2) {
+    let n = e[r], D = e[r + 1];
+    if (Bu >= n && Bu <= D) return [n, D];
+    D - n > t - u && (u = n, t = D);
+  }
+  return [u, t];
+}
+var nn = (e) => e < Yr || e > Zr ? !1 : ot(Qr, e), Dn = (e) => e >= un && e <= tn ? !0 : e < Xr || e > en ? !1 : ot(at, e), an = /^(?:[\xA9\xAE\u203C\u2049\u2122\u2139\u2194-\u2199\u21A9\u21AA\u2328\u23CF\u23ED-\u23EF\u23F1\u23F2\u23F8-\u23FA\u24C2\u25AA\u25AB\u25B6\u25C0\u25FB\u25FC\u2600-\u2604\u260E\u2611\u2618\u2620\u2622\u2623\u2626\u262A\u262E\u262F\u2638-\u263A\u2640\u2642\u265F\u2660\u2663\u2665\u2666\u2668\u267B\u267E\u2692\u2694-\u2697\u2699\u269B\u269C\u26A0\u26A7\u26B0\u26B1\u26C8\u26CF\u26D1\u26D3\u26E9\u26F0\u26F1\u26F4\u26F7\u26F8\u2702\u2708\u2709\u270F\u2712\u2714\u2716\u271D\u2721\u2733\u2734\u2744\u2747\u2763\u2764\u27A1\u2934\u2935\u2B05-\u2B07]|\uD83C[\uDD70\uDD71\uDD7E\uDD7F\uDF21\uDF24-\uDF2C\uDF36\uDF7D\uDF96\uDF97\uDF99-\uDF9B\uDF9E\uDF9F\uDFCD\uDFCE\uDFD4-\uDFDF\uDFF3\uDFF5\uDFF7]|\uD83D[\uDC3F\uDC41\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])$/, on = (e) => an.test(e), sn = /[^\x20-\x7F]/;
+function ln(e) {
+  if (!e) return 0;
+  if (!sn.test(e)) return e.length;
+  let u = 0;
+  e = e.replace(Hr(), (t) => (u += on(t) ? 1 : 2, ""));
+  for (let t of e) {
+    let r = t.codePointAt(0);
+    r <= 31 || r >= 127 && r <= 159 || r >= 768 && r <= 879 || r >= 65024 && r <= 65039 || (u += nn(r) || Dn(r) ? 2 : 1);
+  }
+  return u;
+}
+var iu = ln, cn = { type: 0 }, fn = { type: 1 }, st = { value: "", length: 0, queue: [], get root() {
+  return st;
+} };
+function lt(e, u, t) {
+  let r = u.type === 1 ? e.queue.slice(0, -1) : [...e.queue, u], n = "", D = 0, i = 0, a = 0;
+  for (let F of r) switch (F.type) {
+    case 0:
+      l(), t.useTabs ? o(1) : s(t.tabWidth);
+      break;
+    case 3: {
+      let { string: h } = F;
+      l(), n += h, D += h.length;
+      break;
+    }
+    case 2: {
+      let { width: h } = F;
+      i += 1, a += h;
+      break;
+    }
+    default:
+      throw new Error(`Unexpected indent comment '${F.type}'.`);
+  }
+  return c(), { ...e, value: n, length: D, queue: r };
+  function o(F) {
+    n += "	".repeat(F), D += t.tabWidth * F;
+  }
+  function s(F) {
+    n += " ".repeat(F), D += F;
+  }
+  function l() {
+    t.useTabs ? f() : c();
+  }
+  function f() {
+    i > 0 && o(i), d();
+  }
+  function c() {
+    a > 0 && s(a), d();
+  }
+  function d() {
+    i = 0, a = 0;
+  }
+}
+function Fn(e, u, t) {
+  if (!u) return e;
+  if (u.type === "root") return { ...e, root: e };
+  if (u === Number.NEGATIVE_INFINITY) return e.root;
+  let r;
+  return typeof u == "number" ? u < 0 ? r = fn : r = { type: 2, width: u } : r = { type: 3, string: u }, lt(e, r, t);
+}
+function dn(e, u) {
+  return lt(e, cn, u);
+}
+function pn(e) {
+  let u = 0;
+  for (let t = e.length - 1; t >= 0; t--) {
+    let r = e[t];
+    if (r === " " || r === "	") u++;
+    else break;
+  }
+  return u;
+}
+function ct(e) {
+  let u = pn(e);
+  return { text: u === 0 ? e : e.slice(0, e.length - u), count: u };
+}
+var Ce, j, oe, se, ue, Ee, Ge, Ju, hn = (Ju = class {
+  constructor() {
+    J(this, Ee);
+    J(this, Ce, []);
+    J(this, j, "");
+    J(this, oe, 0);
+    J(this, se, []);
+    J(this, ue, []);
+  }
+  markPosition() {
+    if (y(this, se).length + y(this, ue).length >= 2) throw new Error("There are too many 'cursor' in doc.");
+    y(this, ue).push(y(this, oe) + y(this, j).length);
+  }
+  write(e) {
+    Fe(this, j, y(this, j) + e);
+  }
+  trim() {
+    let { text: e, count: u } = ct(y(this, j));
+    return Fe(this, j, e), q(this, Ee, Ge).call(this), u;
+  }
+  finish() {
+    return q(this, Ee, Ge).call(this), { text: y(this, Ce).join(""), positions: y(this, se) };
+  }
+}, Ce = new WeakMap(), j = new WeakMap(), oe = new WeakMap(), se = new WeakMap(), ue = new WeakMap(), Ee = new WeakSet(), Ge = function() {
+  let e = y(this, j);
+  e !== "" && (y(this, Ce).push(e), Fe(this, oe, y(this, oe) + e.length), Fe(this, j, ""));
+  for (let u of y(this, ue)) y(this, se).push(Math.min(u, y(this, oe)));
+  y(this, ue).length = 0;
+}, Ju), Cn = hn, x = Symbol("MODE_BREAK"), _ = Symbol("MODE_FLAT"), He = Symbol("DOC_FILL_PRINTED_LENGTH");
+function ve(e, u, t, r, n, D) {
+  if (t === Number.POSITIVE_INFINITY) return !0;
+  let i = u.length, a = !1, o = [e], s = "";
+  for (; t >= 0; ) {
+    if (o.length === 0) {
+      if (i === 0) return !0;
+      o.push(u[--i]);
+      continue;
+    }
+    let { mode: l, doc: f } = o.pop(), c = ne(f);
+    switch (c) {
+      case re:
+        f && (a && (s += " ", t -= 1, a = !1), s += f, t -= iu(f));
+        break;
+      case M:
+      case T: {
+        let d = c === M ? f : f.parts, F = f[He] ?? 0;
+        for (let h = d.length - 1; h >= F; h--) o.push({ mode: l, doc: d[h] });
+        break;
+      }
+      case R:
+      case V:
+      case z:
+      case I:
+        o.push({ mode: l, doc: f.contents });
+        break;
+      case W: {
+        let { text: d, count: F } = ct(s);
+        s = d, t += F;
+        break;
+      }
+      case k: {
+        if (D && f.break) return !1;
+        let d = f.break ? x : l, F = f.expandedStates && d === x ? B(0, f.expandedStates, -1) : f.contents;
+        o.push({ mode: d, doc: F });
+        break;
+      }
+      case S: {
+        let d = (f.groupId ? n[f.groupId] || _ : l) === x ? f.breakContents : f.flatContents;
+        d && o.push({ mode: l, doc: d });
+        break;
+      }
+      case v:
+        if (l === x || f.hard) return !0;
+        f.soft || (a = !0);
+        break;
+      case K:
+        r = !0;
+        break;
+      case U:
+        if (r) return !1;
+        break;
+    }
+  }
+  return !1;
+}
+function Te(e, u) {
+  let t = /* @__PURE__ */ Object.create(null), r = u.printWidth, n = uu(u.endOfLine), D = 0, i = [{ indent: st, mode: x, doc: e }], a = !1, o = [], s = new Cn();
+  for (xr(e); i.length > 0; ) {
+    let { indent: F, mode: h, doc: p } = i.pop();
+    switch (ne(p)) {
+      case re: {
+        let C = n !== `
+` ? Se(0, p, `
+`, n) : p;
+        C && (s.write(C), i.length > 0 && (D += iu(C)));
+        break;
+      }
+      case M:
+        for (let C = p.length - 1; C >= 0; C--) i.push({ indent: F, mode: h, doc: p[C] });
+        break;
+      case Y:
+        s.markPosition();
+        break;
+      case R:
+        i.push({ indent: dn(F, u), mode: h, doc: p.contents });
+        break;
+      case V:
+        i.push({ indent: Fn(F, p.n, u), mode: h, doc: p.contents });
+        break;
+      case W:
+        D -= s.trim();
+        break;
+      case k: {
+        let C = (function() {
+          if (h === _ && !a) return { indent: F, mode: p.break ? x : _, doc: p.contents };
+          a = !1;
+          let E = r - D, g = o.length > 0, m = { indent: F, mode: _, doc: p.contents };
+          if (!p.break && ve(m, i, E, g, t)) return m;
+          if (!p.expandedStates) return { indent: F, mode: x, doc: p.contents };
+          if (!p.break) for (let b = 1; b < p.expandedStates.length - 1; b++) {
+            let A = { indent: F, mode: _, doc: p.expandedStates[b] };
+            if (ve(A, i, E, g, t)) return A;
+          }
+          return { indent: F, mode: x, doc: B(0, p.expandedStates, -1) };
+        })();
+        i.push(C), p.id && (t[p.id] = C.mode);
+        break;
+      }
+      case T: {
+        let C = r - D, E = p[He] ?? 0, { parts: g } = p, m = g.length - E;
+        if (m === 0) break;
+        let b = g[E + 0], A = g[E + 1], w = { indent: F, mode: _, doc: b }, De = { indent: F, mode: x, doc: b }, Le = ve(w, [], C, o.length > 0, t, !0);
+        if (m === 1) {
+          Le ? i.push(w) : i.push(De);
+          break;
+        }
+        let Cu = { indent: F, mode: _, doc: A }, $e = { indent: F, mode: x, doc: A };
+        if (m === 2) {
+          Le ? i.push(Cu, w) : i.push($e, De);
+          break;
+        }
+        let Zt = g[E + 2], Qt = { indent: F, mode: h, doc: { ...p, [He]: E + 2 } }, Xt = ve({ indent: F, mode: _, doc: [b, A, Zt] }, [], C, o.length > 0, t, !0);
+        i.push(Qt), Xt ? i.push(Cu, w) : Le ? i.push($e, w) : i.push($e, De);
+        break;
+      }
+      case S:
+      case z: {
+        let C = p.groupId ? t[p.groupId] : h;
+        if (C === x) {
+          let E = p.type === S ? p.breakContents : p.negate ? p.contents : ke(p.contents);
+          E && i.push({ indent: F, mode: h, doc: E });
+        }
+        if (C === _) {
+          let E = p.type === S ? p.flatContents : p.negate ? ke(p.contents) : p.contents;
+          E && i.push({ indent: F, mode: h, doc: E });
+        }
+        break;
+      }
+      case K:
+        o.push({ indent: F, mode: h, doc: p.contents });
+        break;
+      case U:
+        o.length > 0 && i.push({ indent: F, mode: h, doc: Du });
+        break;
+      case v:
+        switch (h) {
+          case _:
+            if (!p.hard) {
+              p.soft || (s.write(" "), D += 1);
+              break;
+            }
+            a = !0;
+          case x:
+            if (o.length > 0) {
+              i.push({ indent: F, mode: h, doc: p }, ...o.reverse()), o.length = 0;
+              break;
+            }
+            p.literal ? (s.write(n), D = 0, F.root && (F.root.value && s.write(F.root.value), D = F.root.length)) : (s.trim(), s.write(n + F.value), D = F.length);
+            break;
+        }
+        break;
+      case I:
+        i.push({ indent: F, mode: h, doc: p.contents });
+        break;
+      case N:
+        break;
+      default:
+        throw new le(p);
+    }
+    i.length === 0 && o.length > 0 && (i.push(...o.reverse()), o.length = 0);
+  }
+  let { text: l, positions: f } = s.finish();
+  if (f.length !== 2) return { formatted: l };
+  let [c, d] = f;
+  return { formatted: l, cursorNodeStart: c, cursorNodeText: l.slice(c, d) };
+}
+function En(e, u, t = 0) {
+  let r = 0;
+  for (let n = t; n < e.length; ++n) e[n] === "	" ? r = r + u - r % u : r++;
+  return r;
+}
+var au = En, $, Ye, be, qu, mn = (qu = class {
+  constructor(e) {
+    J(this, $);
+    this.stack = [e];
+  }
+  get key() {
+    let { stack: e, siblings: u } = this;
+    return B(0, e, u === null ? -2 : -4) ?? null;
+  }
+  get index() {
+    return this.siblings === null ? null : B(0, this.stack, -2);
+  }
+  get node() {
+    return B(0, this.stack, -1);
+  }
+  get parent() {
+    return this.getNode(1);
+  }
+  get grandparent() {
+    return this.getNode(2);
+  }
+  get isInArray() {
+    return this.siblings !== null;
+  }
+  get siblings() {
+    let { stack: e } = this, u = B(0, e, -3);
+    return Array.isArray(u) ? u : null;
+  }
+  get next() {
+    let { siblings: e } = this;
+    return e === null ? null : e[this.index + 1];
+  }
+  get previous() {
+    let { siblings: e } = this;
+    return e === null ? null : e[this.index - 1];
+  }
+  get isFirst() {
+    return this.index === 0;
+  }
+  get isLast() {
+    let { siblings: e, index: u } = this;
+    return e !== null && u === e.length - 1;
+  }
+  get isRoot() {
+    return this.stack.length === 1;
+  }
+  get root() {
+    return this.stack[0];
+  }
+  get ancestors() {
+    return [...q(this, $, be).call(this)];
+  }
+  getName() {
+    let { stack: e } = this, { length: u } = e;
+    return u > 1 ? B(0, e, -2) : null;
+  }
+  getValue() {
+    return B(0, this.stack, -1);
+  }
+  getNode(e = 0) {
+    let u = q(this, $, Ye).call(this, e);
+    return u === -1 ? null : this.stack[u];
+  }
+  getParentNode(e = 0) {
+    return this.getNode(e + 1);
+  }
+  call(e, ...u) {
+    let { stack: t } = this, { length: r } = t, n = B(0, t, -1);
+    for (let D of u) n = n == null ? void 0 : n[D], t.push(D, n);
+    try {
+      return e(this);
+    } finally {
+      t.length = r;
+    }
+  }
+  callParent(e, u = 0) {
+    let t = q(this, $, Ye).call(this, u + 1), r = this.stack.splice(t + 1);
+    try {
+      return e(this);
+    } finally {
+      this.stack.push(...r);
+    }
+  }
+  each(e, ...u) {
+    let { stack: t } = this, { length: r } = t, n = B(0, t, -1);
+    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;
+    } finally {
+      t.length = r;
+    }
+  }
+  map(e, ...u) {
+    let t = [];
+    return this.each((r, n, D) => {
+      t[n] = e(r, n, D);
+    }, ...u), t;
+  }
+  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;
+      let D = null;
+      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 q(this, $, be).call(this)) if (e(u)) return u;
+  }
+  hasAncestor(e) {
+    for (let u of q(this, $, be).call(this)) if (e(u)) return !0;
+    return !1;
+  }
+}, $ = new WeakSet(), Ye = 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;
+  return -1;
+}, be = function* () {
+  let { stack: e } = this;
+  for (let u = e.length - 3; u >= 0; u -= 2) {
+    let t = e[u];
+    Array.isArray(t) || (yield t);
+  }
+}, qu), gn = mn;
+function yn(e) {
+  return Array.isArray(e) && e.length > 0;
+}
+var ft = yn;
+function Bn(e) {
+  return e !== null && typeof e == "object";
+}
+var ou = Bn;
+function ge(e) {
+  return (u, t, r) => {
+    if (t === !1) return !1;
+    let n = !!(r != null && r.backwards), { length: D } = u, i = t;
+    for (; i >= 0 && i < D; ) {
+      let a = u.charAt(i);
+      if (e instanceof RegExp) {
+        if (!e.test(a)) return i;
+      } else if (!e.includes(a)) return i;
+      n ? i-- : i++;
+    }
+    return i === -1 || i === D ? i : !1;
+  };
+}
+var vn = ge(/\s/), H = ge(" 	"), Ft = ge(",; 	"), dt = ge(/[^\n\r]/), vu = (e) => e === `
+` || e === "\r" || e === "\u2028" || e === "\u2029";
+function An(e, u, t) {
+  if (u === !1) return !1;
+  let r = !!(t != null && t.backwards), n = e.charAt(u);
+  if (r) {
+    if (e.charAt(u - 1) === "\r" && n === `
+`) return u - 2;
+    if (vu(n)) return u - 1;
+  } else {
+    if (n === "\r" && e.charAt(u + 1) === `
+`) return u + 2;
+    if (vu(n)) return u + 1;
+  }
+  return u;
+}
+var te = An;
+function bn(e, u, t = {}) {
+  let r = H(e, t.backwards ? u - 1 : u, t), n = te(e, r, t);
+  return r !== n;
+}
+var G = bn;
+function* Ie(e, u) {
+  let { getVisitorKeys: t, filter: r = () => !0 } = u, n = (D) => ou(D) && r(D);
+  for (let D of t(e)) {
+    let i = e[D];
+    if (Array.isArray(i)) for (let a of i) n(a) && (yield a);
+    else n(i) && (yield i);
+  }
+}
+function* wn(e, u) {
+  let t = [e];
+  for (let r = 0; r < t.length; r++) {
+    let n = t[r];
+    for (let D of Ie(n, u)) yield D, t.push(D);
+  }
+}
+function kn(e, u) {
+  return Ie(e, u).next().done;
+}
+function Sn(e, u, t) {
+  var o;
+  let { filter: r } = t;
+  if (!r) return [];
+  let n, D = (((o = t.getChildren) == null ? void 0 : o.call(t, e, t)) ?? [...Ie(e, { getVisitorKeys: t.getVisitorKeys })]).flatMap((s) => (n ?? (n = [e, ...u]), r(s, n) ? [s] : pt(s, n, t))), { locStart: i, locEnd: a } = t;
+  return D.sort((s, l) => i(s) - i(l) || a(s) - a(l)), D;
+}
+function pt(e, u, t) {
+  return tu(t.cache, e, (r) => Sn(r, u, t));
+}
+var ht = pt;
+function xn(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 su(e, u) {
+  (e.comments ?? (e.comments = [])).push(u), u.printed = !1, u.nodeDescription = xn(e);
+}
+function pe(e, u) {
+  u.leading = !0, u.trailing = !1, su(e, u);
+}
+function Q(e, u, t) {
+  u.leading = !1, u.trailing = !1, t && (u.marker = t), su(e, u);
+}
+function he(e, u) {
+  u.leading = !1, u.trailing = !0, su(e, u);
+}
+var Ct = /* @__PURE__ */ new WeakMap();
+function Et(e, u, t, r, n = []) {
+  let { locStart: D, locEnd: i } = t, a = D(u), o = i(u), s = ht(e, n, { cache: Ct, locStart: D, locEnd: i, getVisitorKeys: t.getVisitorKeys, filter: t.printer.canAttachComment, getChildren: t.printer.getCommentChildNodes }), l, f, c = 0, d = s.length;
+  for (; c < d; ) {
+    let F = c + d >> 1, h = s[F], p = D(h), C = i(h);
+    if (p <= a && o <= C) return Et(h, u, t, h, [h, ...n]);
+    if (C <= a) {
+      l = h, c = F + 1;
+      continue;
+    }
+    if (o <= p) {
+      f = h, d = F;
+      continue;
+    }
+    throw new Error("Comment location overlaps with node location");
+  }
+  if ((r == null ? void 0 : r.type) === "TemplateLiteral") {
+    let { quasis: F } = r, h = Ve(F, u, t);
+    l && Ve(F, l, t) !== h && (l = null), f && Ve(F, f, t) !== h && (f = null);
+  }
+  return { enclosingNode: r, precedingNode: l, followingNode: f };
+}
+var Re = () => !1;
+function Nn(e, u) {
+  let { comments: t } = e;
+  if (delete e.comments, !ft(t) || !u.printer.canAttachComment) return;
+  let r = [], { printer: { features: { experimental_avoidAstMutation: n }, handleComments: D = {} }, originalText: i } = u, { ownLine: a = Re, endOfLine: o = Re, remaining: s = Re } = D, l = t.map((c, d) => ({ ...Et(e, c, u), comment: c, text: i, options: u, ast: e, isLastComment: t.length - 1 === d, placement: void 0 })), f = !n;
+  for (let [c, d] of l.entries()) {
+    let { comment: F, precedingNode: h, enclosingNode: p, followingNode: C, text: E, options: g, ast: m, isLastComment: b } = d, A = _n(E, g, l, c) ? "ownLine" : On(E, g, l, c) ? "endOfLine" : "remaining", w;
+    if (n ? (d.placement = A, w = [d]) : w = [F, E, g, m, b], f && (F.enclosingNode = p, F.precedingNode = h, F.followingNode = C), F.placement = A, A === "ownLine") a(...w) || (C ? pe(C, F) : h ? he(h, F) : Q(p || m, F));
+    else if (A === "endOfLine") o(...w) || (h ? he(h, F) : C ? pe(C, F) : Q(p || m, F));
+    else if (!s(...w)) if (h && C) {
+      let De = r.length;
+      De > 0 && r[De - 1].followingNode !== C && Au(r, g), r.push(d);
+    } else h ? he(h, F) : C ? pe(C, F) : Q(p || m, F);
+  }
+  if (Au(r, u), f) for (let c of t) delete c.precedingNode, delete c.enclosingNode, delete c.followingNode;
+}
+var mt = (e) => !/[\S\n\u2028\u2029]/.test(e);
+function _n(e, u, t, r) {
+  let { comment: n, precedingNode: D } = t[r], { locStart: i, locEnd: a } = u, o = i(n);
+  if (D) for (let s = r - 1; s >= 0; s--) {
+    let { comment: l, precedingNode: f } = t[s];
+    if (f !== D || !mt(e.slice(a(l), o))) break;
+    o = i(l);
+  }
+  return G(e, o, { backwards: !0 });
+}
+function On(e, u, t, r) {
+  let { comment: n, followingNode: D } = t[r], { locStart: i, locEnd: a } = u, o = a(n);
+  if (D) for (let s = r + 1; s < t.length; s++) {
+    let { comment: l, followingNode: f } = t[s];
+    if (f !== D || !mt(e.slice(o, i(l)))) break;
+    o = a(l);
+  }
+  return G(e, o);
+}
+function Au(e, u) {
+  var a, o;
+  let t = e.length;
+  if (t === 0) return;
+  let { precedingNode: r, followingNode: n } = e[0], D = u.locStart(n), i;
+  for (i = t; i > 0; --i) {
+    let { comment: s, precedingNode: l, followingNode: f } = e[i - 1], c = u.originalText.slice(u.locEnd(s), D);
+    if (((o = (a = u.printer).isGap) == null ? void 0 : o.call(a, c, u)) ?? /^[\s(]*$/.test(c)) D = u.locStart(s);
+    else break;
+  }
+  for (let [s, { comment: l }] of e.entries()) s < i ? he(r, l) : pe(n, l);
+  for (let s of [r, n]) s.comments && s.comments.length > 1 && s.comments.sort((l, f) => u.locStart(l) - u.locStart(f));
+  e.length = 0;
+}
+function Ve(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;
+  return 0;
+}
+function Tn(e, u) {
+  let t = u - 1;
+  t = H(e, t, { backwards: !0 }), t = te(e, t, { backwards: !0 }), t = H(e, t, { backwards: !0 });
+  let r = te(e, t, { backwards: !0 });
+  return t !== r;
+}
+var lu = Tn, gt = () => !0;
+function yt(e, u) {
+  let t = e.node;
+  return t.printed = !0, u.printer.printComment(e, u);
+}
+function In(e, u) {
+  var s;
+  let t = e.node, r = [yt(e, u)], { printer: n, originalText: D, locStart: i, locEnd: a } = u;
+  if ((s = n.isBlockComment) != null && s.call(n, t)) {
+    let l = " ";
+    G(D, a(t)) && (G(D, i(t), { backwards: !0 }) ? l = L : l = nt), r.push(l);
+  } else r.push(L);
+  let o = te(D, H(D, a(t)));
+  return o !== !1 && G(D, o) && r.push(L), r;
+}
+function Pn(e, u, t) {
+  var s;
+  let r = e.node, n = yt(e, u), { printer: D, originalText: i, locStart: a } = u, o = (s = D.isBlockComment) == null ? void 0 : s.call(D, r);
+  if (t != null && t.hasLineSuffix && !(t != null && t.isBlock) || G(i, a(r), { backwards: !0 })) {
+    let l = lu(i, a(r));
+    return { doc: qe([L, l ? L : "", n]), isBlock: o, hasLineSuffix: !0 };
+  }
+  return !o || t != null && t.hasLineSuffix ? { doc: [qe([" ", n]), Oe], isBlock: o, hasLineSuffix: !0 } : { doc: [" ", n], isBlock: o, hasLineSuffix: !1 };
+}
+function jn(e, u, t) {
+  var i, a;
+  let r = u[Symbol.for("printedComments")], n = gt, D = new Set((a = (i = e.node) == null ? void 0 : i.comments) == null ? void 0 : a.filter((o) => !(r != null && r.has(o)) && o.leading && n(o)));
+  return D.size === 0 ? "" : e.map(({ node: o }) => D.has(o) ? In(e, u) : "", "comments").filter(Boolean);
+}
+function Ln(e, u, t) {
+  var l;
+  let r = (l = e.node) == null ? void 0 : l.comments, n = new Set(r == null ? void 0 : r.filter((f) => f.trailing)), D = u[Symbol.for("printedComments")], i = gt, a = new Set(r == null ? void 0 : r.filter((f) => n.has(f) && !(D != null && D.has(f)) && i(f)));
+  if (a.size === 0) return "";
+  let o = [], s;
+  return e.each(({ node: f }) => {
+    n.has(f) && (s = Pn(e, u, s), a.has(f) && o.push(s.doc));
+  }, "comments"), o;
+}
+function $n(e, u, t, r) {
+  let n = jn(e, t), D = Ln(e, t);
+  return n || D ? Ae(u, (i) => [n, i, D]) : u;
+}
+function Mn(e) {
+  let { [Ne]: 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!');
+    delete r.printed;
+  }
+}
+var Bt = class extends Error {
+  constructor() {
+    super(...arguments);
+    Be(this, "name", "ConfigError");
+  }
+}, bu = class extends Error {
+  constructor() {
+    super(...arguments);
+    Be(this, "name", "UndefinedParserError");
+  }
+}, Rn = Object.hasOwn ?? Function.prototype.call.bind(Object.prototype.hasOwnProperty), Pe = Rn, Vn = { 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 vt({ plugins: e = [], showDeprecated: u = !1 } = {}) {
+  let t = e.flatMap((n) => n.languages ?? []), r = [];
+  for (let n of zn(Object.assign({}, ...e.map(({ options: D }) => D), Vn))) !u && n.deprecated || (Array.isArray(n.choices) && (u || (n.choices = n.choices.filter((D) => !D.deprecated)), n.name === "parser" && (n.choices = [...n.choices, ...Wn(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));
+  return { languages: t, options: r };
+}
+function* Wn(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((o) => o.parsers && Pe(o.parsers, D)), a = n.name;
+      i != null && i.name && (a += ` (plugin: ${i.name})`), yield { value: D, description: a };
+    }
+  }
+}
+function zn(e) {
+  let u = [];
+  for (let [t, r] of Object.entries(e)) {
+    let n = { name: t, ...r };
+    Array.isArray(n.default) && (n.default = B(0, n.default, -1).value), u.push(n);
+  }
+  return u;
+}
+var Kn = Array.prototype.toReversed ?? function() {
+  return [...this].reverse();
+}, Un = me("toReversed", function() {
+  if (Array.isArray(this)) return Kn;
+}), Jn = Un;
+function qn() {
+  var r, n, D, i, a;
+  let e = globalThis, u = (r = e.process) == null ? void 0 : r.platform;
+  if (typeof u == "string") return u.startsWith("win");
+  let t = (D = (n = e.Deno) == null ? void 0 : n.build) == null ? void 0 : D.os;
+  return typeof t == "string" ? t === "windows" : ((a = (i = e.navigator) == null ? void 0 : i.platform) == null ? void 0 : a.startsWith("Win")) ?? !1;
+}
+var Gn = qn();
+function At(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 Hn(e) {
+  return e = At(e), decodeURIComponent(e.pathname.replace(/%(?![0-9A-Fa-f]{2})/g, "%25"));
+}
+function Yn(e) {
+  e = At(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 Zn(e) {
+  return Gn ? Yn(e) : Hn(e);
+}
+var Qn = (e) => String(e).split(/[/\\]/).pop(), Xn = (e) => String(e).startsWith("file:");
+function wu(e, u) {
+  if (!u) return;
+  let t = Qn(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)));
+}
+function eD(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}`));
+}
+var We = void 0;
+function ku(e, u) {
+  if (u) {
+    if (Xn(u)) try {
+      u = Zn(u);
+    } catch {
+      return;
+    }
+    if (typeof u == "string") return e.find(({ isSupported: t }) => t == null ? void 0 : t({ filepath: u }));
+  }
+}
+function uD(e, u) {
+  var r;
+  let t = Jn(0, e.plugins).flatMap((n) => n.languages ?? []);
+  return (r = eD(t, u.language) ?? wu(t, u.physicalFile) ?? wu(t, u.file) ?? ku(t, u.physicalFile) ?? ku(t, u.file) ?? (We == null ? void 0 : We(t, u.physicalFile))) == null ? void 0 : r.parsers[0];
+}
+var bt = uD, ae = { 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) => ae.value(t)).join(", ")}]`;
+  let u = Object.keys(e);
+  return u.length === 0 ? "{}" : `{ ${u.map((t) => `${ae.key(t)}: ${ae.value(e[t])}`).join(", ")} }`;
+}, pair: ({ key: e, value: u }) => ae.value({ [e]: u }) }, wt = new Proxy(String, { get: () => wt }), O = wt, tD = (e, u, { descriptor: t }) => {
+  let r = [`${O.yellow(typeof e == "string" ? t.key(e) : t.pair(e))} is deprecated`];
+  return u && r.push(`we now treat it as ${O.blue(typeof u == "string" ? t.key(u) : t.pair(u))}`), r.join("; ") + ".";
+}, kt = Symbol.for("vnopts.VALUE_NOT_EXIST"), we = Symbol.for("vnopts.VALUE_UNCHANGED"), Su = " ".repeat(2), rD = (e, u, t) => {
+  let { text: r, list: n } = t.normalizeExpectedResult(t.schemas[e].expected(t)), D = [];
+  return r && D.push(xu(e, u, r, t.descriptor)), n && D.push([xu(e, u, n.title, t.descriptor)].concat(n.values.map((i) => St(i, t.loggerPrintWidth))).join(`
+`)), xt(D, t.loggerPrintWidth);
+};
+function xu(e, u, t, r) {
+  return [`Invalid ${O.red(r.key(e))} value.`, `Expected ${O.blue(t)},`, `but received ${u === kt ? O.gray("nothing") : O.red(r.value(u))}.`].join(" ");
+}
+function St({ text: e, list: u }, t) {
+  let r = [];
+  return e && r.push(`- ${O.blue(e)}`), u && r.push([`- ${O.blue(u.title)}:`].concat(u.values.map((n) => St(n, t - Su.length).replace(/^|\n/g, `$&${Su}`))).join(`
+`)), xt(r, t);
+}
+function xt(e, u) {
+  if (e.length === 1) return e[0];
+  let [t, r] = e, [n, D] = e.map((i) => i.split(`
+`, 1)[0].length);
+  return n > u && n > D ? r : t;
+}
+var ie = [], ze = [];
+function Ke(e, u, t) {
+  if (e === u) return 0;
+  let r = t == null ? void 0 : t.maxDistance, n = e;
+  e.length > u.length && (e = u, u = n);
+  let D = e.length, i = u.length;
+  for (; D > 0 && e.charCodeAt(~-D) === u.charCodeAt(~-i); ) D--, i--;
+  let a = 0;
+  for (; a < D && e.charCodeAt(a) === u.charCodeAt(a); ) a++;
+  if (D -= a, i -= a, r !== void 0 && i - D > r) return r;
+  if (D === 0) return r !== void 0 && i > r ? r : i;
+  let o, s, l, f, c = 0, d = 0;
+  for (; c < D; ) ze[c] = e.charCodeAt(a + c), ie[c] = ++c;
+  for (; d < i; ) {
+    for (o = u.charCodeAt(a + d), l = d++, s = d, c = 0; c < D; c++) f = o === ze[c] ? l : l + 1, l = ie[c], s = ie[c] = l > s ? f > s ? s + 1 : f : f > l ? l + 1 : f;
+    if (r !== void 0) {
+      let F = s;
+      for (c = 0; c < D; c++) ie[c] < F && (F = ie[c]);
+      if (F > r) return r;
+    }
+  }
+  return ie.length = D, ze.length = D, r !== void 0 && s > r ? r : s;
+}
+function nD(e, u, t) {
+  if (!Array.isArray(u) || u.length === 0) return;
+  let r = t == null ? void 0 : t.maxDistance, n = e.length;
+  for (let o of u) if (o === e) return o;
+  let D, i = Number.POSITIVE_INFINITY, a = /* @__PURE__ */ new Set();
+  for (let o of u) {
+    if (a.has(o)) continue;
+    a.add(o);
+    let s = Math.abs(o.length - n);
+    if (s >= i || s > r) continue;
+    let l = Number.isFinite(i) ? Math.min(i, r) : r, f = l === void 0 ? Ke(e, o) : Ke(e, o, { maxDistance: l });
+    if (f > r) continue;
+    let c = f;
+    if (l !== void 0 && f === l && l === r && (c = Ke(e, o)), c < i && (i = c, D = o, i === 0)) break;
+  }
+  if (!(i > r)) return D;
+}
+var Nt = (e, u, { descriptor: t, logger: r, schemas: n }) => {
+  let D = [`Ignored unknown option ${O.yellow(t.pair({ key: e, value: u }))}.`], i = nD(e, Object.keys(n), { maxDistance: 3 });
+  i && D.push(`Did you mean ${O.blue(t.key(i))}?`), r.warn(D.join(" "));
+}, DD = ["default", "expected", "validate", "deprecated", "forward", "redirect", "overlap", "preprocess", "postprocess"];
+function iD(e, u) {
+  let t = new e(u), r = Object.create(t);
+  for (let n of DD) n in u && (r[n] = aD(u[n], t, Z.prototype[n].length));
+  return r;
+}
+var Z = class {
+  static create(e) {
+    return iD(this, e);
+  }
+  constructor(e) {
+    this.name = e.name;
+  }
+  default(e) {
+  }
+  expected(e) {
+    return "nothing";
+  }
+  validate(e, u) {
+    return !1;
+  }
+  deprecated(e, u) {
+    return !1;
+  }
+  forward(e, u) {
+  }
+  redirect(e, u) {
+  }
+  overlap(e, u, t) {
+    return e;
+  }
+  preprocess(e, u) {
+    return e;
+  }
+  postprocess(e, u) {
+    return we;
+  }
+};
+function aD(e, u, t) {
+  return typeof e == "function" ? (...r) => e(...r.slice(0, t - 1), u, ...r.slice(t - 1)) : () => e;
+}
+var oD = class extends Z {
+  constructor(e) {
+    super(e), this._sourceName = e.sourceName;
+  }
+  expected(e) {
+    return e.schemas[this._sourceName].expected(e);
+  }
+  validate(e, u) {
+    return u.schemas[this._sourceName].validate(e, u);
+  }
+  redirect(e, u) {
+    return this._sourceName;
+  }
+}, sD = class extends Z {
+  expected() {
+    return "anything";
+  }
+  validate() {
+    return !0;
+  }
+}, lD = class extends Z {
+  constructor({ valueSchema: e, name: u = e.name, ...t }) {
+    super({ ...t, name: u }), this._valueSchema = e;
+  }
+  expected(e) {
+    let { text: u, list: t } = e.normalizeExpectedResult(this._valueSchema.expected(e));
+    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;
+    let t = [];
+    for (let r of e) {
+      let n = u.normalizeValidateResult(this._valueSchema.validate(r, u), r);
+      n !== !0 && t.push(n.value);
+    }
+    return t.length === 0 ? !0 : { value: t };
+  }
+  deprecated(e, u) {
+    let t = [];
+    for (let r of e) {
+      let n = u.normalizeDeprecatedResult(this._valueSchema.deprecated(r, u), r);
+      n !== !1 && t.push(...n.map(({ value: D }) => ({ value: [D] })));
+    }
+    return t;
+  }
+  forward(e, u) {
+    let t = [];
+    for (let r of e) {
+      let n = u.normalizeForwardResult(this._valueSchema.forward(r, u), r);
+      t.push(...n.map(Nu));
+    }
+    return t;
+  }
+  redirect(e, 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(Nu));
+    }
+    return t.length === 0 ? { redirect: r } : { redirect: r, remain: t };
+  }
+  overlap(e, u) {
+    return e.concat(u);
+  }
+};
+function Nu({ from: e, to: u }) {
+  return { from: [e], to: u };
+}
+var cD = class extends Z {
+  expected() {
+    return "true or false";
+  }
+  validate(e) {
+    return typeof e == "boolean";
+  }
+};
+function fD(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)}`);
+    t[n] = r;
+  }
+  return t;
+}
+function FD(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)}`);
+    t.set(n, r);
+  }
+  return t;
+}
+function dD() {
+  let e = /* @__PURE__ */ Object.create(null);
+  return (u) => {
+    let t = JSON.stringify(u);
+    return e[t] ? !0 : (e[t] = !0, !1);
+  };
+}
+function pD(e, u) {
+  let t = [], r = [];
+  for (let n of e) u(n) ? t.push(n) : r.push(n);
+  return [t, r];
+}
+function hD(e) {
+  return e === Math.floor(e);
+}
+function CD(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 ED(e) {
+  return (...u) => {
+    let t = e(...u);
+    return typeof t == "string" ? new Error(t) : t;
+  };
+}
+function _u(e) {
+  return e === void 0 ? {} : e;
+}
+function _t(e) {
+  if (typeof e == "string") return { text: e };
+  let { text: u, list: t } = e;
+  return mD((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(_t) } } : { text: u };
+}
+function Ou(e, u) {
+  return e === !0 ? !0 : e === !1 ? { value: u } : e;
+}
+function Tu(e, u, t = !1) {
+  return e === !1 ? !1 : e === !0 ? t ? !0 : [{ value: u }] : "value" in e ? [e] : e.length === 0 ? !1 : e;
+}
+function Iu(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 Ze(e, u) {
+  return e === void 0 ? [] : Array.isArray(e) ? e.map((t) => Iu(t, u)) : [Iu(e, u)];
+}
+function Pu(e, u) {
+  let t = Ze(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 mD(e, u) {
+  if (!e) throw new Error(u);
+}
+var gD = class extends Z {
+  constructor(e) {
+    super(e), this._choices = FD(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(CD).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) {
+    return this._choices.has(e);
+  }
+  deprecated(e) {
+    let u = this._choices.get(e);
+    return u && u.deprecated ? { value: e } : !1;
+  }
+  forward(e) {
+    let u = this._choices.get(e);
+    return u ? u.forward : void 0;
+  }
+  redirect(e) {
+    let u = this._choices.get(e);
+    return u ? u.redirect : void 0;
+  }
+}, yD = class extends Z {
+  expected() {
+    return "a number";
+  }
+  validate(e, u) {
+    return typeof e == "number";
+  }
+}, BD = class extends yD {
+  expected() {
+    return "an integer";
+  }
+  validate(e, u) {
+    return u.normalizeValidateResult(super.validate(e, u), e) === !0 && hD(e);
+  }
+}, ju = class extends Z {
+  expected() {
+    return "a string";
+  }
+  validate(e) {
+    return typeof e == "string";
+  }
+}, vD = ae, AD = Nt, bD = rD, wD = tD, kD = class {
+  constructor(e, u) {
+    let { logger: t = console, loggerPrintWidth: r = 80, descriptor: n = vD, unknown: D = AD, invalid: i = bD, deprecated: a = wD, missing: o = () => !1, required: s = () => !1, preprocess: l = (c) => c, postprocess: f = () => we } = u || {};
+    this._utils = { descriptor: n, logger: t || { warn: () => {
+    } }, loggerPrintWidth: r, schemas: fD(e, "name"), normalizeDefaultResult: _u, normalizeExpectedResult: _t, normalizeDeprecatedResult: Tu, normalizeForwardResult: Ze, normalizeRedirectResult: Pu, normalizeValidateResult: Ou }, this._unknownHandler = D, this._invalidHandler = ED(i), this._deprecatedHandler = a, this._identifyMissing = (c, d) => !(c in d) || o(c, d), this._identifyRequired = s, this._preprocess = l, this._postprocess = f, this.cleanHistory();
+  }
+  cleanHistory() {
+    this._hasDeprecationWarned = dD();
+  }
+  normalize(e) {
+    let u = {}, t = [this._preprocess(e, this._utils)], r = () => {
+      for (; t.length !== 0; ) {
+        let n = t.shift(), D = this._applyNormalization(n, u);
+        t.push(...D);
+      }
+    };
+    r();
+    for (let n of Object.keys(this._utils.schemas)) {
+      let D = this._utils.schemas[n];
+      if (!(n in u)) {
+        let i = _u(D.default(this._utils));
+        "value" in i && t.push({ [n]: i.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], a = D.postprocess(i, this._utils);
+      a !== we && (this._applyValidation(a, n, D), u[n] = a);
+    }
+    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], a = i.preprocess(e[D], this._utils);
+      this._applyValidation(a, D, i);
+      let o = ({ from: f, to: c }) => {
+        t.push(typeof c == "string" ? { [c]: f } : { [c.key]: c.value });
+      }, s = ({ value: f, redirectTo: c }) => {
+        let d = Tu(i.deprecated(f, this._utils), a, !0);
+        if (d !== !1) if (d === !0) this._hasDeprecationWarned(D) || this._utils.logger.warn(this._deprecatedHandler(D, c, this._utils));
+        else for (let { value: F } of d) {
+          let h = { key: D, value: F };
+          if (!this._hasDeprecationWarned(h)) {
+            let p = typeof c == "string" ? { key: c, value: F } : c;
+            this._utils.logger.warn(this._deprecatedHandler(h, p, this._utils));
+          }
+        }
+      };
+      Ze(i.forward(a, this._utils), a).forEach(o);
+      let l = Pu(i.redirect(a, this._utils), a);
+      if (l.redirect.forEach(o), "remain" in l) {
+        let f = l.remain;
+        u[D] = D in u ? i.overlap(u[D], f, this._utils) : f, s({ value: f });
+      }
+      for (let { from: f, to: c } of l.redirect) s({ value: f, redirectTo: c });
+    }
+    for (let D of n) {
+      let i = e[D];
+      this._applyUnknownHandler(D, i, u, (a, o) => {
+        t.push({ [a]: 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, kt, this._utils);
+  }
+  _partitionOptionKeys(e) {
+    let [u, t] = pD(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 = Ou(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;
+    }
+  }
+  _applyPostprocess(e) {
+    let u = this._postprocess(e, this._utils);
+    if (u !== we) {
+      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) {
+          let D = u.override[n];
+          this._applyValidation(D, n, this._utils.schemas[n]), e[n] = D;
+        }
+        for (let n of r) {
+          let D = u.override[n];
+          this._applyUnknownHandler(n, D, e, (i, a) => {
+            let o = this._utils.schemas[i];
+            this._applyValidation(a, i, o), e[i] = a;
+          });
+        }
+      }
+    }
+  }
+}, Ue;
+function SD(e, u, { logger: t = !1, isCLI: r = !1, passThrough: n = !1, FlagSchema: D, descriptor: i } = {}) {
+  if (r) {
+    if (!D) throw new Error("'FlagSchema' option is required.");
+    if (!i) throw new Error("'descriptor' option is required.");
+  } else i = ae;
+  let a = n ? Array.isArray(n) ? (c, d) => n.includes(c) ? { [c]: d } : void 0 : (c, d) => ({ [c]: d }) : (c, d, F) => {
+    let { _: h, ...p } = F.schemas;
+    return Nt(c, d, { ...F, schemas: p });
+  }, o = xD(u, { isCLI: r, FlagSchema: D }), s = new kD(o, { logger: t, unknown: a, descriptor: i }), l = t !== !1;
+  l && Ue && (s._hasDeprecationWarned = Ue);
+  let f = s.normalize(e);
+  return l && (Ue = s._hasDeprecationWarned), f;
+}
+function xD(e, { isCLI: u, FlagSchema: t }) {
+  let r = [];
+  u && r.push(sD.create({ name: "_" }));
+  for (let n of e) r.push(ND(n, { isCLI: u, optionInfos: e, FlagSchema: t })), n.alias && u && r.push(oD.create({ name: n.alias, sourceName: n.name }));
+  return r;
+}
+function ND(e, { isCLI: u, optionInfos: t, FlagSchema: r }) {
+  let { name: n } = e, D = { name: n }, i, a = {};
+  switch (e.type) {
+    case "int":
+      i = BD, u && (D.preprocess = Number);
+      break;
+    case "string":
+      i = ju;
+      break;
+    case "choice":
+      i = gD, D.choices = e.choices.map((o) => o != null && o.redirect ? { ...o, redirect: { to: { key: e.name, value: o.redirect } } } : o);
+      break;
+    case "boolean":
+      i = cD;
+      break;
+    case "flag":
+      i = r, D.flags = t.flatMap((o) => [o.alias, o.description && o.name, o.oppositeDescription && `no-${o.name}`].filter(Boolean));
+      break;
+    case "path":
+      i = ju;
+      break;
+    default:
+      throw new Error(`Unexpected type ${e.type}`);
+  }
+  if (e.exception ? D.validate = (o, s, l) => e.exception(o) || s.validate(o, l) : D.validate = (o, s, l) => o === void 0 || s.validate(o, l), e.redirect && (a.redirect = (o) => o ? { to: typeof e.redirect == "string" ? e.redirect : { key: e.redirect.option, value: e.redirect.value } } : void 0), e.deprecated && (a.deprecated = !0), u && !e.array) {
+    let o = D.preprocess || ((s) => s);
+    D.preprocess = (s, l, f) => l.preprocess(o(Array.isArray(s) ? B(0, s, -1) : s), f);
+  }
+  return e.array ? lD.create({ ...u ? { preprocess: (o) => Array.isArray(o) ? o : [o] } : {}, ...a, valueSchema: i.create(D) }) : i.create({ ...D, ...a });
+}
+var _D = SD, OD = Array.prototype.findLast ?? function(e) {
+  for (let u = this.length - 1; u >= 0; u--) {
+    let t = this[u];
+    if (e(t, u, this)) return t;
+  }
+}, TD = me("findLast", function() {
+  if (Array.isArray(this)) return OD;
+}), Ot = TD, ID = Symbol.for("PRETTIER_IS_FRONT_MATTER"), PD = [];
+function jD(e) {
+  return !!(e != null && e[ID]);
+}
+var cu = jD, Tt = /* @__PURE__ */ new Set(["yaml", "toml"]), It = ({ node: e }) => cu(e) && Tt.has(e.language);
+async function LD(e, u, t, r) {
+  let { node: n } = t, { language: D } = n;
+  if (!Tt.has(D)) return;
+  let i = n.value.trim(), a;
+  if (i) {
+    let o = D === "yaml" ? D : bt(r, { language: D });
+    if (!o) return;
+    a = i ? await e(i, { parser: o }) : "";
+  } else a = i;
+  return et([n.startDelimiter, n.explicitLanguage ?? "", L, a, a ? L : "", n.endDelimiter]);
+}
+function $D(e, u) {
+  return It({ node: e }) && (delete u.end, delete u.raw, delete u.value), u;
+}
+var MD = $D;
+function RD({ node: e }) {
+  return e.raw;
+}
+var VD = RD, Pt = /* @__PURE__ */ new Set(["tokens", "comments", "parent", "enclosingNode", "precedingNode", "followingNode"]), WD = (e) => Object.keys(e).filter((u) => !Pt.has(u));
+function zD(e, u) {
+  let t = e ? (r) => e(r, Pt) : WD;
+  return u ? new Proxy(t, { apply: (r, n, D) => cu(D[0]) ? PD : Reflect.apply(r, n, D) }) : t;
+}
+var Lu = zD;
+function jt(e, u) {
+  if (!u) throw new Error("parserName is required.");
+  let t = Ot(0, e, (n) => n.parsers && Pe(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 Bt(r);
+}
+function KD(e, u) {
+  if (!u) throw new Error("astFormat is required.");
+  let t = Ot(0, e, (n) => n.printers && Pe(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 Bt(r);
+}
+function fu({ plugins: e, parser: u }) {
+  let t = jt(e, u);
+  return Lt(t, u);
+}
+function Lt(e, u) {
+  let t = e.parsers[u];
+  return typeof t == "function" ? t() : t;
+}
+async function UD(e, u) {
+  let t = e.printers[u], r = typeof t == "function" ? await t() : t;
+  return GD(r);
+}
+function JD(e) {
+  let { features: u, getVisitorKeys: t, embed: r, massageAstNode: n, print: D, ...i } = e;
+  u = QD(u);
+  let a = u.experimental_frontMatterSupport;
+  t = Lu(t, a.massageAstNode || a.embed || a.print);
+  let o = n;
+  n && a.massageAstNode && (o = new Proxy(n, { apply(f, c, d) {
+    return MD(...d), Reflect.apply(f, c, d);
+  } }));
+  let s = r;
+  if (r) {
+    let f;
+    s = new Proxy(r, { get(c, d, F) {
+      return d === "getVisitorKeys" ? (f ?? (f = r.getVisitorKeys ? Lu(r.getVisitorKeys, a.massageAstNode || a.embed) : t), f) : Reflect.get(c, d, F);
+    }, apply: (c, d, F) => a.embed && It(...F) ? LD : Reflect.apply(c, d, F) });
+  }
+  let l = D;
+  return a.print && (l = new Proxy(D, { apply(f, c, d) {
+    let [F] = d;
+    return cu(F.node) ? VD(F) : Reflect.apply(f, c, d);
+  } })), { features: u, getVisitorKeys: t, embed: s, massageAstNode: o, print: l, ...i };
+}
+var qD = /* @__PURE__ */ new WeakMap();
+function GD(e) {
+  return tu(qD, e, JD);
+}
+var HD = ["clean", "embed", "print"], YD = Object.fromEntries(HD.map((e) => [e, !1]));
+function ZD(e) {
+  return { ...YD, ...e };
+}
+function QD(e) {
+  return { experimental_avoidAstMutation: !1, ...e, experimental_frontMatterSupport: ZD(e == null ? void 0 : e.experimental_frontMatterSupport) };
+}
+var $u = { astFormat: "estree", printer: {}, originalText: void 0, locStart: null, locEnd: null, getVisitorKeys: null };
+async function XD(e, u = {}) {
+  var f;
+  let t = { ...e };
+  if (!t.parser) {
+    if (!t.filepath) throw new bu("No parser and no file path given, couldn't infer a parser.");
+    if (t.parser = bt(t, { physicalFile: t.filepath }), !t.parser) throw new bu(`No parser could be inferred for file "${t.filepath}".`);
+  }
+  let r = vt({ plugins: e.plugins, showDeprecated: !0 }).options, n = { ...$u, ...Object.fromEntries(r.filter((c) => c.default !== void 0).map((c) => [c.name, c.default])) }, D = jt(t.plugins, t.parser), i = await Lt(D, t.parser);
+  t.astFormat = i.astFormat, t.locEnd = i.locEnd, t.locStart = i.locStart;
+  let a = (f = D.printers) != null && f[i.astFormat] ? D : KD(t.plugins, i.astFormat), o = await UD(a, i.astFormat);
+  t.printer = o, t.getVisitorKeys = o.getVisitorKeys;
+  let s = a.defaultOptions ? Object.fromEntries(Object.entries(a.defaultOptions).filter(([, c]) => c !== void 0)) : {}, l = { ...n, ...s };
+  for (let [c, d] of Object.entries(l)) t[c] ?? (t[c] = d);
+  return t.parser === "json" && (t.trailingComma = "none"), _D(t, r, { passThrough: Object.keys($u), ...u });
+}
+var fe = XD, Mu = /\r\n|[\n\r\u2028\u2029]/;
+function ei(e, u, t, r) {
+  let n = { column: null, line: -1, ...e.start }, D = { ...n, ...e.end }, { linesAbove: i = 2, linesBelow: a = 3 } = t || {}, o = n.line - r, s = n.column, l = D.line - r, f = D.column, c = Math.max(o - (i + 1), 0), d = Math.min(u.length, l + a);
+  o === -1 && (c = 0), l === -1 && (d = u.length);
+  let F = l - o, h = {};
+  if (F) for (let p = 0; p <= F; p++) {
+    let C = p + o;
+    if (s == null) h[C] = !0;
+    else if (p === 0) {
+      let E = u[C - 1].length;
+      h[C] = [s, E - s];
+    } else if (p === F) h[C] = [0, f];
+    else {
+      let E = u[C - 1].length;
+      h[C] = [0, E];
+    }
+  }
+  else if (s === f) s != null ? h[o] = [s, 0] : h[o] = !0;
+  else {
+    let p = s ?? 0, C = f ?? p;
+    h[o] = [p, C - p];
+  }
+  return { start: c, end: d, markerLines: h };
+}
+function ui(e, u, t = {}, r) {
+  let { defs: n, highlight: D } = { defs: { gutter: String, marker: String, message: String, reset: String }, highlight: String }, i = (t.startLine || 1) - 1, a = e.split(Mu), { start: o, end: s, markerLines: l } = ei(u, a, t, i), f = u.start && typeof u.start.column == "number", c = String(s + i).length, d = D(e).split(Mu, s).slice(o, s).map((F, h) => {
+    let p = o + 1 + h, C = ` ${` ${p + i}`.slice(-c)} |`, E = l[p], g = !l[p + 1];
+    if (E) {
+      let m = "";
+      if (Array.isArray(E)) {
+        let b = F.slice(0, E[0]).replace(/[^\t]/g, " "), A = E[1] || 1;
+        m = [`
+ `, n.gutter(C.replace(/\d/g, " ")), " ", b, n.marker("^").repeat(A)].join(""), g && t.message && (m += " " + n.message(t.message));
+      }
+      return [n.marker(">"), n.gutter(C), F.length > 0 ? ` ${F}` : "", m].join("");
+    } else return ` ${n.gutter(C)}${F.length > 0 ? ` ${F}` : ""}`;
+  }).join(`
+`);
+  return t.message && !f && (d = `${" ".repeat(c + 1)}${t.message}
+${d}`), n.reset(d);
+}
+function ti(e, u, t = {}) {
+  return ui(e, u, t);
+}
+async function ri(e, u) {
+  let t = await fu(u), r = t.preprocess ? await t.preprocess(e, u) : e;
+  u.originalText = r;
+  let n;
+  try {
+    n = await t.parse(r, u, u);
+  } catch (D) {
+    ni(D, e);
+  }
+  return { text: r, ast: n };
+}
+function ni(e, u) {
+  let { loc: t } = e;
+  if (t) {
+    let { start: r, end: n } = t;
+    r && (r = { line: r.line, column: r.column - 1 }), n && (n = { line: n.line, column: n.column - 1 });
+    let D = ti(u, { start: r, end: n }, {});
+    e.message += `
+` + D, e.codeFrame = D;
+  }
+  throw e;
+}
+var ye = ri;
+async function Di(e, u, t, r, n) {
+  if (t.embeddedLanguageFormatting !== "auto") return;
+  let { printer: D } = t, { embed: i } = D;
+  if (!i) 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 { hasPrettierIgnore: a } = D, { getVisitorKeys: o } = i, s = [];
+  c();
+  let l = e.stack;
+  for (let { print: d, node: F, pathStack: h } of s) try {
+    e.stack = h;
+    let p = await d(f, u, e, t);
+    p && n.set(F, p);
+  } catch (p) {
+    if (globalThis.PRETTIER_DEBUG) throw p;
+  }
+  e.stack = l;
+  function f(d, F) {
+    return ii(d, F, t, r);
+  }
+  function c() {
+    let { node: d } = e;
+    if (d === null || typeof d != "object" || a != null && a(e)) return;
+    for (let h of o(d)) Array.isArray(d[h]) ? e.each(c, h) : e.call(c, h);
+    let F = i(e, t);
+    if (F) {
+      if (typeof F == "function") {
+        s.push({ print: F, node: d, pathStack: [...e.stack] });
+        return;
+      }
+      n.set(d, F);
+    }
+  }
+}
+async function ii(e, u, t, r) {
+  let n = await fe({ ...t, ...u, parentParser: t.parser, originalText: e, cursorOffset: void 0, rangeStart: void 0, rangeEnd: void 0 }, { passThrough: !0 }), { ast: D } = await ye(e, n), i = await r(D, n);
+  return Xu(i);
+}
+function ai(e, u, t, r) {
+  let { originalText: n, [Ne]: D, locStart: i, locEnd: a, [Symbol.for("printedComments")]: o } = u, { node: s } = e, l = i(s), f = a(s);
+  for (let d of D) i(d) >= l && a(d) <= f && o.add(d);
+  let { printPrettierIgnored: c } = u.printer;
+  return c ? c(e, u, t, r) : n.slice(l, f);
+}
+var oi = ai;
+async function je(e, u) {
+  ({ ast: e } = await $t(e, u));
+  let t = /* @__PURE__ */ new Map(), r = new gn(e), n = /* @__PURE__ */ new Map();
+  await Di(r, i, u, je, n);
+  let D = await Ru(r, u, i, void 0, n);
+  if (Mn(u), u.cursorOffset >= 0) {
+    if (u.nodeAfterCursor && !u.nodeBeforeCursor) return [ee, D];
+    if (u.nodeBeforeCursor && !u.nodeAfterCursor) return [D, ee];
+  }
+  return D;
+  function i(o, s) {
+    return o === void 0 || o === r ? a(s) : Array.isArray(o) ? r.call(() => a(s), ...o) : r.call(() => a(s), o);
+  }
+  function a(o) {
+    let s = r.node;
+    if (s == null) return "";
+    let l = ou(s) && o === void 0;
+    if (l && t.has(s)) return t.get(s);
+    let f = Ru(r, u, i, o, n);
+    return l && t.set(s, f), f;
+  }
+}
+function Ru(e, u, t, r, n) {
+  var o, s;
+  let { node: D } = e, { printer: i } = u, a;
+  switch ((o = i.hasPrettierIgnore) != null && o.call(i, e) ? a = oi(e, u, t, r) : n.has(D) ? a = n.get(D) : a = i.print(e, u, t, r), D) {
+    case u.cursorNode:
+      a = Ae(a, (l) => [ee, l, ee]);
+      break;
+    case u.nodeBeforeCursor:
+      a = Ae(a, (l) => [l, ee]);
+      break;
+    case u.nodeAfterCursor:
+      a = Ae(a, (l) => [ee, l]);
+      break;
+  }
+  return i.printComment && ft(D.comments) && !((s = i.willPrintOwnComments) != null && s.call(i, e, u)) && (a = $n(e, a, u)), a;
+}
+async function $t(e, u) {
+  let t = e.comments ?? [];
+  u[Ne] = t, u[Symbol.for("printedComments")] = /* @__PURE__ */ new Set(), Nn(e, u);
+  let { printer: { preprocess: r } } = u;
+  return e = r ? await r(e, u) : e, { ast: e, comments: t };
+}
+function si(e, u) {
+  let { cursorOffset: t, locStart: r, locEnd: n, getVisitorKeys: D } = u, i = (d) => r(d) <= t && n(d) >= t, a = e, o = [e];
+  for (let d of wn(e, { getVisitorKeys: D, filter: i })) o.push(d), a = d;
+  if (kn(a, { getVisitorKeys: D })) return { cursorNode: a };
+  let s, l, f = -1, c = Number.POSITIVE_INFINITY;
+  for (; o.length > 0 && (s === void 0 || l === void 0); ) {
+    a = o.pop();
+    let d = s !== void 0, F = l !== void 0;
+    for (let h of Ie(a, { getVisitorKeys: D })) {
+      if (!d) {
+        let p = n(h);
+        p <= t && p > f && (s = h, f = p);
+      }
+      if (!F) {
+        let p = r(h);
+        p >= t && p < c && (l = h, c = p);
+      }
+    }
+  }
+  return { nodeBeforeCursor: s, nodeAfterCursor: l };
+}
+var Mt = si;
+function li(e, u) {
+  let { printer: t } = u, r = t.massageAstNode;
+  if (!r) return e;
+  let { getVisitorKeys: n } = t, { ignoredProperties: D } = r;
+  return i(e);
+  function i(a, o) {
+    if (!ou(a)) return a;
+    if (Array.isArray(a)) return a.map((c) => i(c, o)).filter(Boolean);
+    let s = {}, l = new Set(n(a));
+    for (let c in a) !Pe(a, c) || D != null && D.has(c) || (l.has(c) ? s[c] = i(a[c], a) : s[c] = a[c]);
+    let f = r(a, s, o);
+    if (f !== null) return f ?? s;
+  }
+}
+var ci = li, fi = Array.prototype.findLastIndex ?? function(e) {
+  for (let u = this.length - 1; u >= 0; u--) {
+    let t = this[u];
+    if (e(t, u, this)) return u;
+  }
+  return -1;
+}, Fi = me("findLastIndex", function() {
+  if (Array.isArray(this)) return fi;
+}), di = Fi;
+function pi(e, u) {
+  return u = new Set(u), e.find((t) => Rt.has(t.type) && u.has(t));
+}
+function Vu(e) {
+  let u = di(0, e, (t) => t.type !== "Program" && t.type !== "File");
+  return u === -1 ? e : e.slice(0, u + 1);
+}
+function hi(e, u, { locStart: t, locEnd: r }) {
+  let [n, ...D] = e, [i, ...a] = u;
+  if (n === i) return [n, i];
+  let o = t(n);
+  for (let l of Vu(a)) if (t(l) >= o) i = l;
+  else break;
+  let s = r(i);
+  for (let l of Vu(D)) {
+    if (r(l) <= s) n = l;
+    else break;
+    if (n === i) break;
+  }
+  return [n, i];
+}
+function Qe(e, u, t, r, n = [], D, i) {
+  let { locStart: a, locEnd: o } = i, s = a(e), l = o(e);
+  if (u > l || u < s || D === "rangeEnd" && u === s || D === "rangeStart" && u === l) return;
+  let f = [e, ...n], c = ht(e, f, { cache: Ct, locStart: a, locEnd: o, getVisitorKeys: t.getVisitorKeys, filter: t.printer.canAttachComment, getChildren: t.printer.getCommentChildNodes });
+  for (let d of c) {
+    let F = Qe(d, u, t, r, f, D, i);
+    if (F) return F;
+  }
+  if (r(e, n[0])) return f;
+}
+function Ci(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 Rt = /* @__PURE__ */ new Set(["JsonRoot", "ObjectExpression", "ArrayExpression", "StringLiteral", "NumericLiteral", "BooleanLiteral", "NullLiteral", "UnaryExpression", "TemplateLiteral"]), Ei = /* @__PURE__ */ new Set(["OperationDefinition", "FragmentDefinition", "VariableDefinition", "TypeExtensionDefinition", "ObjectTypeDefinition", "FieldDefinition", "DirectiveDefinition", "EnumTypeDefinition", "EnumValueDefinition", "InputValueDefinition", "InputObjectTypeDefinition", "SchemaDefinition", "OperationTypeDefinition", "InterfaceTypeDefinition", "UnionTypeDefinition", "ScalarTypeDefinition"]);
+function Wu(e, u, t) {
+  if (!u) return !1;
+  switch (e.parser) {
+    case "flow":
+    case "hermes":
+    case "babel":
+    case "babel-flow":
+    case "babel-ts":
+    case "typescript":
+    case "acorn":
+    case "espree":
+    case "meriyah":
+    case "oxc":
+    case "oxc-ts":
+    case "yuku":
+    case "yuku-ts":
+    case "__babel_estree":
+      return Ci(u.type, t == null ? void 0 : t.type);
+    case "json":
+    case "json5":
+    case "jsonc":
+    case "json-stringify":
+      return Rt.has(u.type);
+    case "graphql":
+      return Ei.has(u.kind);
+    case "vue":
+      return u.tag !== "root";
+  }
+  return !1;
+}
+function mi(e, u, t) {
+  var F;
+  let { rangeStart: r, rangeEnd: n } = u, D = e.slice(r, n).search(/\S/), i = D === -1;
+  if (!i) for (r += D; n > r && !/\S/.test(e[n - 1]); --n) ;
+  let a = ((F = u.printer.features) == null ? void 0 : F.experimental_locForRangeFormat) ?? u, o = Qe(t, r, u, (h, p) => Wu(u, h, p), [], "rangeStart", a);
+  if (!o) return;
+  let s = i ? o : Qe(t, n, u, (h) => Wu(u, h), [], "rangeEnd", a);
+  if (!s) return;
+  let l, f;
+  if (t.type === "JsonRoot") {
+    let h = pi(o, s);
+    l = h, f = h;
+  } else [l, f] = hi(o, s, u);
+  let { locStart: c, locEnd: d } = a;
+  return [Math.min(c(l), c(f)), Math.max(d(l), d(f))];
+}
+var Vt = "\uFEFF", zu = Symbol("cursor");
+async function Wt(e, u, t = 0) {
+  if (!e || e.trim().length === 0) return { formatted: "", cursorOffset: -1, comments: [] };
+  let { ast: r, text: n } = await ye(e, u);
+  u.cursorOffset >= 0 && (u = { ...u, ...Mt(r, u) });
+  let D = await je(r, u);
+  t > 0 && (D = ut([L, D], t, u.tabWidth));
+  let i = Te(D, u);
+  if (t > 0) {
+    let o = i.formatted.trim();
+    i.cursorNodeStart !== void 0 && (i.cursorNodeStart -= i.formatted.indexOf(o), i.cursorNodeStart < 0 && (i.cursorNodeStart = 0, i.cursorNodeText = i.cursorNodeText.trimStart()), i.cursorNodeStart + i.cursorNodeText.length > o.length && (i.cursorNodeText = i.cursorNodeText.trimEnd())), i.formatted = o + uu(u.endOfLine);
+  }
+  let a = u[Ne];
+  if (u.cursorOffset >= 0) {
+    let o, s, l, f;
+    if ((u.cursorNode || u.nodeBeforeCursor || u.nodeAfterCursor) && i.cursorNodeText) if (l = i.cursorNodeStart, f = i.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, l = 0, f = i.formatted;
+    let c = u.cursorOffset - o;
+    if (s === f) return { formatted: i.formatted, cursorOffset: l + c, comments: a };
+    let d = s.split("");
+    d.splice(c, 0, zu);
+    let F = f.split(""), h = sr(d, F), p = l;
+    for (let C of h) if (C.removed) {
+      if (C.value.includes(zu)) break;
+    } else p += C.count;
+    return { formatted: i.formatted, cursorOffset: p, comments: a };
+  }
+  return { formatted: i.formatted, cursorOffset: -1, comments: a };
+}
+async function gi(e, u) {
+  let { ast: t, text: r } = await ye(e, u), [n, D] = mi(r, u, t) ?? [0, 0], i = r.slice(n, D), a = Math.min(n, r.lastIndexOf(`
+`, n) + 1), o = r.slice(a, n).match(/^\s*/)[0], s = au(o, u.tabWidth), l = await Wt(i, { ...u, rangeStart: 0, rangeEnd: Number.POSITIVE_INFINITY, cursorOffset: u.cursorOffset > n && u.cursorOffset <= D ? u.cursorOffset - n : -1, endOfLine: "lf" }, s), f = l.formatted.trimEnd(), { cursorOffset: c } = u;
+  c > D ? c += f.length - i.length : l.cursorOffset >= 0 && (c = l.cursorOffset + n);
+  let d = r.slice(0, n) + f + r.slice(D);
+  if (u.endOfLine !== "lf") {
+    let F = uu(u.endOfLine);
+    c >= 0 && F === `\r
+` && (c += Zu(d.slice(0, c), `
+`)), d = Se(0, d, `
+`, F);
+  }
+  return { formatted: d, cursorOffset: c, comments: l.comments };
+}
+function Je(e, u, t) {
+  return typeof u != "number" || Number.isNaN(u) || u < 0 || u > e.length ? t : u;
+}
+function Ku(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 };
+}
+function zt(e, u) {
+  let { cursorOffset: t, rangeStart: r, rangeEnd: n, endOfLine: D } = Ku(e, u), i = e.charAt(0) === Vt;
+  if (i && (e = e.slice(1), t--, r--, n--), D === "auto" && (D = pr(e)), e.includes("\r")) {
+    let a = (o) => Zu(e.slice(0, Math.max(o, 0)), `\r
+`);
+    t -= a(t), r -= a(r), n -= a(n), e = Er(e);
+  }
+  return { hasBOM: i, text: e, options: Ku(e, { ...u, cursorOffset: t, rangeStart: r, rangeEnd: n, endOfLine: D }) };
+}
+async function Uu(e, u) {
+  let t = await fu(u);
+  return !t.hasPragma || t.hasPragma(e);
+}
+async function yi(e, u) {
+  var t, r;
+  return (r = (t = await fu(u)).hasIgnorePragma) == null ? void 0 : r.call(t, e);
+}
+async function Kt(e, u) {
+  let { hasBOM: t, text: r, options: n } = zt(e, await fe(u));
+  if (n.rangeStart >= n.rangeEnd && r !== "" || n.requirePragma && !await Uu(r, n) || n.checkIgnorePragma && await yi(r, n)) return { formatted: e, cursorOffset: u.cursorOffset, comments: [] };
+  let D;
+  return n.rangeStart > 0 || n.rangeEnd < r.length ? D = await gi(r, n) : (!n.requirePragma && n.insertPragma && n.printer.insertPragma && !await Uu(r, n) && (r = n.printer.insertPragma(r)), D = await Wt(r, n)), t && (D.formatted = Vt + D.formatted, D.cursorOffset >= 0 && D.cursorOffset++), D;
+}
+async function Bi(e, u, t) {
+  let { text: r, options: n } = zt(e, await fe(u)), D = await ye(r, n);
+  return t && (t.preprocessForPrint && (D.ast = await $t(D.ast, n)), t.massage && (D.ast = ci(D.ast, n))), D;
+}
+async function vi(e, u) {
+  u = await fe(u);
+  let t = await je(e, u);
+  return Te(t, u);
+}
+async function Ai(e, u) {
+  let t = Gr(e), { formatted: r } = await Kt(t, { ...u, parser: "__js_expression" });
+  return r;
+}
+async function bi(e, u) {
+  u = await fe(u);
+  let { ast: t } = await ye(e, u);
+  return u.cursorOffset >= 0 && (u = { ...u, ...Mt(t, u) }), je(t, u);
+}
+async function wi(e, u) {
+  return Te(e, await fe(u));
+}
+var Ut = {};
+Xe(Ut, { builders: () => ki, printer: () => Si, utils: () => xi });
+var ki = { join: rt, line: nt, softline: Ur, hardline: L, literalline: it, group: tt, conditionalGroup: Vr, fill: Rr, lineSuffix: qe, lineSuffixBoundary: Jr, cursor: ee, breakParent: Oe, ifBreak: Wr, trim: qr, indent: ke, indentIfBreak: zr, align: ce, addAlignmentToDoc: ut, markAsRoot: et, dedentToRoot: $r, dedent: Mr, hardlineWithoutBreakParent: Du, literallineWithoutBreakParent: Dt, label: Kr, concat: (e) => e }, Si = { printDocToString: Te }, xi = { willBreak: Sr, traverseDoc: ru, findInDoc: nu, mapDoc: _e, removeLines: _r, stripTrailingHardline: Xu, replaceEndOfLine: Ir, canBreak: jr }, Ni = "3.9.6", Jt = {};
+Xe(Jt, { addDanglingComment: () => Q, addLeadingComment: () => pe, addTrailingComment: () => he, getAlignmentSize: () => au, getIndentSize: () => ji, getMaxContinuousCount: () => Mi, getNextNonSpaceNonCommentCharacter: () => Vi, getNextNonSpaceNonCommentCharacterIndex: () => Yi, getPreferredQuote: () => Ki, getStringWidth: () => iu, hasNewline: () => G, hasNewlineInRange: () => Ji, hasSpaces: () => Gi, isNextLineEmpty: () => ua, isNextLineEmptyAfterIndex: () => hu, isPreviousLineEmpty: () => Qi, makeString: () => ea, skip: () => ge, skipEverythingButNewLine: () => dt, skipInlineComment: () => Fu, skipNewline: () => te, skipSpaces: () => H, skipToLineEnd: () => Ft, skipTrailingComment: () => du, skipWhitespace: () => vn });
+function _i(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;
+  }
+  return u;
+}
+var Fu = _i;
+function Oi(e, u) {
+  return u === !1 ? !1 : e.charAt(u) === "/" && e.charAt(u + 1) === "/" ? dt(e, u) : u;
+}
+var du = Oi;
+function Ti(e, u) {
+  let t = null, r = u;
+  for (; r !== t; ) t = r, r = H(e, r), r = Fu(e, r), r = du(e, r), r = te(e, r);
+  return r;
+}
+var pu = Ti;
+function Ii(e, u) {
+  let t = null, r = u;
+  for (; r !== t; ) t = r, r = Ft(e, r), r = Fu(e, r), r = H(e, r);
+  return r = du(e, r), r = te(e, r), r !== !1 && G(e, r);
+}
+var hu = Ii;
+function Pi(e, u) {
+  let t = e.lastIndexOf(`
+`);
+  return t === -1 ? 0 : au(e.slice(t + 1).match(/^[\t ]*/)[0], u);
+}
+var ji = Pi;
+function Li(e) {
+  if (typeof e != "string") throw new TypeError("Expected a string");
+  return e.replace(/[|\\{}()[\]^$+*?.]/g, "\\$&").replace(/-/g, "\\x2d");
+}
+function $i(e, u) {
+  let t = e.matchAll(new RegExp(`(?:${Li(u)})+`, "g"));
+  return t.reduce || (t = [...t]), t.reduce((r, [n]) => Math.max(r, n.length), 0) / u.length;
+}
+var Mi = $i;
+function Ri(e, u) {
+  let t = pu(e, u);
+  return t === !1 ? "" : e.charAt(t);
+}
+var Vi = Ri, qt = Object.freeze({ character: "'", codePoint: 39 }), Gt = Object.freeze({ character: '"', codePoint: 34 }), Wi = Object.freeze({ preferred: qt, alternate: Gt }), zi = Object.freeze({ preferred: Gt, alternate: qt });
+function Ki(e, u) {
+  let { preferred: t, alternate: r } = u === !0 || u === "'" ? Wi : zi, { length: n } = e, D = 0, i = 0;
+  for (let a = 0; a < n; a++) {
+    let o = e.charCodeAt(a);
+    o === t.codePoint ? D++ : o === r.codePoint && i++;
+  }
+  return (D > i ? r : t).character;
+}
+function Ui(e, u, t) {
+  for (let r = u; r < t; ++r) if (e.charAt(r) === `
+`) return !0;
+  return !1;
+}
+var Ji = Ui;
+function qi(e, u, t = {}) {
+  return H(e, t.backwards ? u - 1 : u, t) !== u;
+}
+var Gi = qi;
+function Hi(e, u, t) {
+  return pu(e, t(u));
+}
+function Yi(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? pu(e, u) : Hi(...arguments);
+}
+function Zi(e, u, t) {
+  return lu(e, t(u));
+}
+function Qi(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? lu(e, u) : Zi(...arguments);
+}
+function Xi(e, u, t) {
+  return hu(e, t(u));
+}
+function ea(e, u, t) {
+  let r = u === '"' ? "'" : '"', n = Se(0, e, /\\(.)|(["'])/gs, (D, i, a) => i === r ? i : a === u ? "\\" + a : a || (t && /^[^\n\r"'0-7\\bfnrt-vx\u2028\u2029]$/.test(i) ? i : "\\" + i));
+  return u + n + u;
+}
+function ua(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? hu(e, u) : Xi(...arguments);
+}
+function X(e, u = 1) {
+  return async (...t) => {
+    let r = t[u] ?? {}, n = r.plugins ?? [];
+    return t[u] = { ...r, plugins: Array.isArray(n) ? n : Object.values(n) }, await e(...t);
+  };
+}
+var Ht = X(Kt);
+async function Yt(e, u) {
+  let { formatted: t } = await Ht(e, { ...u, cursorOffset: -1 });
+  return t;
+}
+async function ta(e, u) {
+  return await Yt(e, u) === e;
+}
+var ra = X(vt, 0), na = { parse: X(Bi), formatAST: X(vi), formatDoc: X(Ai), printToDoc: X(bi), printDocToString: X(wi) };
+export {
+  na as __debug,
+  ta as check,
+  rr as default,
+  Ut as doc,
+  Yt as format,
+  Ht as formatWithCursor,
+  ra as getSupportInfo,
+  Jt as util,
+  Ni as version
+};