@maildeno/editor 0.4.3 → 0.4.5

package/dist/standalone-DHvJ30Td.js

@@ -0,0 +1,3554 @@
+var Lt = Object.defineProperty, $e = (e, u) => {
+  for (var t in u) Lt(e, t, {
+    get: u[t],
+    enumerable: !0
+  });
+}, $t = {};
+$e($t, {
+  __debug: () => Ti,
+  check: () => _i,
+  doc: () => St,
+  format: () => Tt,
+  formatWithCursor: () => Ot,
+  getSupportInfo: () => Oi,
+  util: () => xt,
+  version: () => Di
+});
+var le = (e, u) => (t, r, ...n) => t | 1 && r == null ? void 0 : (u.call(r) ?? r[e]).apply(r, n), Rt = String.prototype.replaceAll ?? function(e, u) {
+  return e.global ? this.replace(e, u) : this.split(e).join(u);
+}, Ce = le("replaceAll", function() {
+  if (typeof this == "string") return Rt;
+}), Mt = class {
+  diff(e, u, t = {}) {
+    let r;
+    typeof t == "function" ? (r = t, t = {}) : "callback" in t && (r = t.callback);
+    let n = this.castInput(e, t), D = this.castInput(u, t), i = this.removeEmpty(this.tokenize(n, t)), o = this.removeEmpty(this.tokenize(D, t));
+    return this.diffWithOptionsObj(i, o, t, r);
+  }
+  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, o = e.length, a = 1, s = i + o;
+    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 >= o && 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, -a); C <= Math.min(h, a); C += 2) {
+        let E, m = c[C - 1], g = c[C + 1];
+        m && (c[C - 1] = void 0);
+        let B = !1;
+        if (g) {
+          let b = g.oldPos - C;
+          B = g && 0 <= b && b < i;
+        }
+        let A = m && m.oldPos + 1 < o;
+        if (!B && !A) {
+          c[C] = void 0;
+          continue;
+        }
+        if (!A || B && m.oldPos < g.oldPos ? E = this.addToPath(g, !0, !1, 0, t) : E = this.addToPath(m, !1, !0, 1, t), d = this.extractCommon(E, u, e, C, t), E.oldPos + 1 >= o && d + 1 >= i) return D(this.buildValues(E.lastComponent, u, e)) || !0;
+        c[C] = E, E.oldPos + 1 >= o && (h = Math.min(h, C - 1)), d + 1 >= i && (f = Math.max(f, C + 1));
+      }
+      a++;
+    };
+    if (r) (function C() {
+      setTimeout(function() {
+        if (a > s || Date.now() > F) return r(void 0);
+        p() || C();
+      }, 0);
+    })();
+    else for (; a <= s && Date.now() <= F; ) {
+      let C = p();
+      if (C) return C;
+    }
+  }
+  addToPath(e, u, t, r, n) {
+    let D = e.lastComponent;
+    return D && !n.oneChangePerToken && D.added === u && D.removed === t ? {
+      oldPos: e.oldPos + r,
+      lastComponent: {
+        count: D.count + 1,
+        added: u,
+        removed: t,
+        previousComponent: D.previousComponent
+      }
+    } : {
+      oldPos: e.oldPos + r,
+      lastComponent: {
+        count: 1,
+        added: u,
+        removed: t,
+        previousComponent: D
+      }
+    };
+  }
+  extractCommon(e, u, t, r, n) {
+    let D = u.length, i = t.length, o = e.oldPos, a = o - r, s = 0;
+    for (; a + 1 < D && o + 1 < i && this.equals(t[o + 1], u[a + 1], n); ) a++, o++, s++, n.oneChangePerToken && (e.lastComponent = {
+      count: 1,
+      previousComponent: e.lastComponent,
+      added: !1,
+      removed: !1
+    });
+    return s && !n.oneChangePerToken && (e.lastComponent = {
+      count: s,
+      previousComponent: e.lastComponent,
+      added: !1,
+      removed: !1
+    }), e.oldPos = o, a;
+  }
+  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, o = 0, a = 0;
+    for (; i < D; i++) {
+      let s = r[i];
+      if (s.removed) s.value = this.join(t.slice(a, a + s.count)), a += s.count;
+      else {
+        if (!s.added && this.useLongestToken) {
+          let l = u.slice(o, o + s.count);
+          l = l.map(function(F, c) {
+            let d = t[a + c];
+            return d.length > F.length ? d : F;
+          }), s.value = this.join(l);
+        } else s.value = this.join(u.slice(o, o + s.count));
+        o += s.count, s.added || (a += s.count);
+      }
+    }
+    return r;
+  }
+}, Vt = class extends Mt {
+  tokenize(e) {
+    return e.slice();
+  }
+  join(e) {
+    return e;
+  }
+  removeEmpty(e) {
+    return e;
+  }
+}, Wt = new Vt();
+function Kt(e, u, t) {
+  return Wt.diff(e, u, t);
+}
+var zt = () => {
+}, U = zt, Nu = "cr", _u = "crlf", Ut = "lf", Re = "\r", Ou = `\r
+`, Ee = `
+`, Jt = Ee;
+function qt(e) {
+  let u = e.indexOf(Re);
+  return u !== -1 ? e.charAt(u + 1) === Ee ? _u : Nu : Ut;
+}
+function Me(e) {
+  return e === Nu ? Re : e === _u ? Ou : Jt;
+}
+var Gt = /* @__PURE__ */ new Map([
+  [Ee, /\n/g],
+  [Re, /\r/g],
+  [Ou, /\r\n/g]
+]);
+function Tu(e, u) {
+  let t = Gt.get(u);
+  return e.match(t)?.length ?? 0;
+}
+var Ht = /\r\n?/g;
+function Yt(e) {
+  return Ce(0, e, Ht, Ee);
+}
+var me = /* @__PURE__ */ Symbol.for("comments");
+function Zt(e) {
+  return this[e < 0 ? this.length + e : e];
+}
+var y = le("at", function() {
+  if (Array.isArray(this) || typeof this == "string") return Zt;
+}), X = "string", L = "array", q = "cursor", $ = "indent", R = "align", M = "trim", w = "group", T = "fill", k = "if-break", V = "indent-if-break", W = "line-suffix", K = "line-suffix-boundary", v = "line", I = "label", x = "break-parent", Iu = /* @__PURE__ */ new Set([
+  q,
+  $,
+  R,
+  M,
+  w,
+  T,
+  k,
+  V,
+  W,
+  K,
+  v,
+  I,
+  x
+]);
+function Qt(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 Ve(e, u, t) {
+  if (!e.has(u)) {
+    let r = t(u);
+    e.set(u, r);
+  }
+  return e.get(u);
+}
+function Xt(e) {
+  if (typeof e == "string") return X;
+  if (Array.isArray(e)) return L;
+  if (!e) return;
+  let { type: u } = e;
+  if (Iu.has(u)) return u;
+}
+var ee = Xt, er = (e) => new Intl.ListFormat("en-US", { type: "disjunction" }).format(e);
+function ur(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 (ee(e)) throw new Error("doc is valid.");
+  let t = Object.prototype.toString.call(e);
+  if (t !== "[object Object]") return `Unexpected doc '${t}'.`;
+  let r = er([...Iu].map((n) => `'${n}'`));
+  return `Unexpected doc.type '${e.type}'.
+Expected it to be ${r}.`;
+}
+var tr = class extends Error {
+  name = "InvalidDocError";
+  constructor(e) {
+    super(ur(e)), this.doc = e;
+  }
+}, ne = tr, ru = {};
+function rr(e, u, t, r) {
+  let n = [e];
+  for (; n.length > 0; ) {
+    let D = n.pop();
+    if (D === ru) {
+      t(n.pop());
+      continue;
+    }
+    t && n.push(D, ru);
+    let i = ee(D);
+    if (!i) throw new ne(D);
+    if (u?.(D) !== !1) switch (i) {
+      case L:
+      case T: {
+        let o = i === L ? D : D.parts;
+        for (let a = o.length - 1; a >= 0; --a) n.push(o[a]);
+        break;
+      }
+      case k:
+        n.push(D.flatContents, D.breakContents);
+        break;
+      case w:
+        if (r && D.expandedStates) for (let o = D.expandedStates.length, a = o - 1; a >= 0; --a) n.push(D.expandedStates[a]);
+        else n.push(D.contents);
+        break;
+      case R:
+      case $:
+      case V:
+      case I:
+      case W:
+        n.push(D.contents);
+        break;
+      case X:
+      case q:
+      case M:
+      case K:
+      case v:
+      case x:
+        break;
+      default:
+        throw new ne(D);
+    }
+  }
+}
+var We = rr;
+function ge(e, u) {
+  if (typeof e == "string") return u(e);
+  let t = /* @__PURE__ */ new Map();
+  return r(e);
+  function r(D) {
+    return Ve(t, D, n);
+  }
+  function n(D) {
+    switch (ee(D)) {
+      case L:
+        return u(D.map(r));
+      case T:
+        return u({
+          ...D,
+          parts: D.parts.map(r)
+        });
+      case k:
+        return u({
+          ...D,
+          breakContents: r(D.breakContents),
+          flatContents: r(D.flatContents)
+        });
+      case w: {
+        let { expandedStates: i, contents: o } = D;
+        return i ? (i = i.map(r), o = i[0]) : o = r(o), u({
+          ...D,
+          contents: o,
+          expandedStates: i
+        });
+      }
+      case R:
+      case $:
+      case V:
+      case I:
+      case W:
+        return u({
+          ...D,
+          contents: r(D.contents)
+        });
+      case X:
+      case q:
+      case M:
+      case K:
+      case v:
+      case x:
+        return u(D);
+      default:
+        throw new ne(D);
+    }
+  }
+}
+function Ke(e, u, t) {
+  let r = t, n = !1;
+  function D(i) {
+    if (n) return !1;
+    let o = u(i);
+    o !== void 0 && (n = !0, r = o);
+  }
+  return We(e, D), r;
+}
+function nr(e) {
+  if (e.type === w && e.break || e.type === v && e.hard || e.type === x) return !0;
+}
+function Dr(e) {
+  return Ke(e, nr, !1);
+}
+function nu(e) {
+  if (e.length > 0) {
+    let u = y(0, e, -1);
+    !u.expandedStates && !u.break && (u.break = "propagated");
+  }
+  return null;
+}
+function ir(e) {
+  let u = /* @__PURE__ */ new Set(), t = [];
+  function r(D) {
+    if (D.type === x && nu(t), D.type === w) {
+      if (t.push(D), u.has(D)) return !1;
+      u.add(D);
+    }
+  }
+  function n(D) {
+    D.type === w && t.pop().break && nu(t);
+  }
+  We(e, r, n, !0);
+}
+function ar(e) {
+  return e.type === v && !e.hard ? e.soft ? "" : " " : e.type === k ? e.flatContents : e;
+}
+function or(e) {
+  return ge(e, ar);
+}
+function Du(e) {
+  for (e = [...e]; e.length >= 2 && y(0, e, -2).type === v && y(0, e, -1).type === x; ) e.length -= 2;
+  if (e.length > 0) {
+    let u = ae(y(0, e, -1));
+    e[e.length - 1] = u;
+  }
+  return e;
+}
+function ae(e) {
+  switch (ee(e)) {
+    case $:
+    case V:
+    case w:
+    case W:
+    case I: {
+      let u = ae(e.contents);
+      return {
+        ...e,
+        contents: u
+      };
+    }
+    case k:
+      return {
+        ...e,
+        breakContents: ae(e.breakContents),
+        flatContents: ae(e.flatContents)
+      };
+    case T:
+      return {
+        ...e,
+        parts: Du(e.parts)
+      };
+    case L:
+      return Du(e);
+    case X:
+      return Qt(e);
+    case R:
+    case q:
+    case M:
+    case K:
+    case v:
+    case x:
+      break;
+    default:
+      throw new ne(e);
+  }
+  return e;
+}
+function Pu(e) {
+  return ae(lr(e));
+}
+function sr(e) {
+  switch (ee(e)) {
+    case T: {
+      let { parts: u } = e;
+      if (u.every((t) => t === "")) return "";
+      if (u.length === 1) return u[0];
+      break;
+    }
+    case w:
+      if (!e.contents && !e.id && !e.break && !e.expandedStates) return "";
+      if (e.contents.type === w && e.contents.id === e.id && e.contents.break === e.break && e.contents.expandedStates === e.expandedStates) return e.contents;
+      break;
+    case R:
+    case $:
+    case V:
+    case W:
+      if (!e.contents) return "";
+      break;
+    case k:
+      if (!e.flatContents && !e.breakContents) return "";
+      break;
+    case L: {
+      let u = [];
+      for (let t of e) {
+        if (!t) continue;
+        let [r, ...n] = Array.isArray(t) ? t : [t];
+        typeof r == "string" && typeof y(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 X:
+    case q:
+    case M:
+    case K:
+    case v:
+    case I:
+    case x:
+      break;
+    default:
+      throw new ne(e);
+  }
+  return e;
+}
+function lr(e) {
+  return ge(e, (u) => sr(u));
+}
+function cr(e, u = Ku) {
+  return ge(e, (t) => typeof t == "string" ? Mu(u, t.split(`
+`)) : t);
+}
+function Fr(e) {
+  if (e.type === v) return !0;
+}
+function fr(e) {
+  return Ke(e, Fr, !1);
+}
+function de(e, u) {
+  return e.type === I ? {
+    ...e,
+    contents: u(e.contents)
+  } : u(e);
+}
+var O = U, ju = U, dr = U, pr = U;
+function he(e) {
+  return O(e), {
+    type: $,
+    contents: e
+  };
+}
+function De(e, u) {
+  return pr(e), O(u), {
+    type: R,
+    contents: u,
+    n: e
+  };
+}
+function hr(e) {
+  return De(Number.NEGATIVE_INFINITY, e);
+}
+function Lu(e) {
+  return De({ type: "root" }, e);
+}
+function Cr(e) {
+  return De(-1, e);
+}
+function $u(e, u, t) {
+  O(e);
+  let r = e;
+  if (u > 0) {
+    for (let n = 0; n < Math.floor(u / t); ++n) r = he(r);
+    r = De(u % t, r), r = De(Number.NEGATIVE_INFINITY, r);
+  }
+  return r;
+}
+var ye = { type: x }, Z = { type: q };
+function Er(e) {
+  return dr(e), {
+    type: T,
+    parts: e
+  };
+}
+function Ru(e, u = {}) {
+  return O(e), ju(u.expandedStates, !0), {
+    type: w,
+    id: u.id,
+    contents: e,
+    break: !!u.shouldBreak,
+    expandedStates: u.expandedStates
+  };
+}
+function mr(e, u) {
+  return Ru(e[0], {
+    ...u,
+    expandedStates: e
+  });
+}
+function gr(e, u = "", t = {}) {
+  return O(e), u !== "" && O(u), {
+    type: k,
+    breakContents: e,
+    flatContents: u,
+    groupId: t.groupId
+  };
+}
+function yr(e, u) {
+  return O(e), {
+    type: V,
+    contents: e,
+    groupId: u.groupId,
+    negate: u.negate
+  };
+}
+function Mu(e, u) {
+  O(e), ju(u);
+  let t = [];
+  for (let r = 0; r < u.length; r++) r !== 0 && t.push(e), t.push(u[r]);
+  return t;
+}
+function vr(e, u) {
+  return O(u), e ? {
+    type: I,
+    label: e,
+    contents: u
+  } : u;
+}
+var Vu = { type: v }, Br = {
+  type: v,
+  soft: !0
+}, ze = {
+  type: v,
+  hard: !0
+}, j = [ze, ye], Wu = {
+  type: v,
+  hard: !0,
+  literal: !0
+}, Ku = [Wu, ye];
+function Ie(e) {
+  return O(e), {
+    type: W,
+    contents: e
+  };
+}
+var Ar = { type: K }, br = { type: M };
+function P(e) {
+  if (!e) return "";
+  if (Array.isArray(e)) {
+    let u = [];
+    for (let t of e) if (Array.isArray(t)) u.push(...P(t));
+    else {
+      let r = P(t);
+      r !== "" && u.push(r);
+    }
+    return u;
+  }
+  return e.type === k ? {
+    ...e,
+    breakContents: P(e.breakContents),
+    flatContents: P(e.flatContents)
+  } : e.type === w ? {
+    ...e,
+    contents: P(e.contents),
+    expandedStates: e.expandedStates?.map(P)
+  } : e.type === T ? {
+    type: "fill",
+    parts: e.parts.map(P)
+  } : e.contents ? {
+    ...e,
+    contents: P(e.contents)
+  } : e;
+}
+function wr(e) {
+  let u = /* @__PURE__ */ Object.create(null), t = /* @__PURE__ */ new Set();
+  return r(P(e));
+  function r(D, i, o) {
+    if (typeof D == "string") return JSON.stringify(D);
+    if (Array.isArray(D)) {
+      let a = D.map(r).filter(Boolean);
+      return a.length === 1 ? a[0] : `[${a.join(", ")}]`;
+    }
+    if (D.type === v) {
+      let a = o?.[i + 1]?.type === x;
+      return D.literal ? a ? "literalline" : "literallineWithoutBreakParent" : D.hard ? a ? "hardline" : "hardlineWithoutBreakParent" : D.soft ? "softline" : "line";
+    }
+    if (D.type === x) return o?.[i - 1]?.type === v && o[i - 1].hard ? void 0 : "breakParent";
+    if (D.type === M) return "trim";
+    if (D.type === $) return "indent(" + r(D.contents) + ")";
+    if (D.type === R) return D.n === Number.NEGATIVE_INFINITY ? "dedentToRoot(" + r(D.contents) + ")" : D.n < 0 ? "dedent(" + r(D.contents) + ")" : D.n.type === "root" ? "markAsRoot(" + r(D.contents) + ")" : "align(" + JSON.stringify(D.n) + ", " + r(D.contents) + ")";
+    if (D.type === k) return "ifBreak(" + r(D.breakContents) + (D.flatContents ? ", " + r(D.flatContents) : "") + (D.groupId ? (D.flatContents ? "" : ', ""') + `, { groupId: ${n(D.groupId)} }` : "") + ")";
+    if (D.type === V) {
+      let a = [];
+      D.negate && a.push("negate: true"), D.groupId && a.push(`groupId: ${n(D.groupId)}`);
+      let s = a.length > 0 ? `, { ${a.join(", ")} }` : "";
+      return `indentIfBreak(${r(D.contents)}${s})`;
+    }
+    if (D.type === w) {
+      let a = [];
+      D.break && D.break !== "propagated" && a.push("shouldBreak: true"), D.id && a.push(`id: ${n(D.id)}`);
+      let s = a.length > 0 ? `, { ${a.join(", ")} }` : "";
+      return D.expandedStates ? `conditionalGroup([${D.expandedStates.map((l) => r(l)).join(",")}]${s})` : `group(${r(D.contents)}${s})`;
+    }
+    if (D.type === T) return `fill([${D.parts.map((a) => r(a)).join(", ")}])`;
+    if (D.type === W) return "lineSuffix(" + r(D.contents) + ")";
+    if (D.type === K) return "lineSuffixBoundary";
+    if (D.type === I) return `label(${JSON.stringify(D.label)}, ${r(D.contents)})`;
+    if (D.type === q) return "cursor";
+    throw new Error("Unknown doc type " + D.type);
+  }
+  function n(D) {
+    if (typeof D != "symbol") return JSON.stringify(String(D));
+    if (D in u) return u[D];
+    let i = D.description || "symbol";
+    for (let o = 0; ; o++) {
+      let a = i + (o > 0 ? ` #${o}` : "");
+      if (!t.has(a)) return t.add(a), u[D] = `Symbol.for(${JSON.stringify(a)})`;
+    }
+  }
+}
+var kr = () => /[#*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, Sr = 12288, xr = 65510, Nr = [
+  12288,
+  12288,
+  65281,
+  65376,
+  65504,
+  65510
+], _r = 4352, Or = 262141, zu = [
+  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
+], Uu = (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;
+}, iu = 19968, [Tr, Ir] = Pr(zu);
+function Pr(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 (iu >= n && iu <= D) return [n, D];
+    D - n > t - u && (u = n, t = D);
+  }
+  return [u, t];
+}
+var jr = (e) => e < Sr || e > xr ? !1 : Uu(Nr, e), Lr = (e) => e >= Tr && e <= Ir ? !0 : e < _r || e > Or ? !1 : Uu(zu, e), $r = /^(?:[\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])$/, Rr = (e) => $r.test(e), Mr = /[^\x20-\x7F]/;
+function Vr(e) {
+  if (!e) return 0;
+  if (!Mr.test(e)) return e.length;
+  let u = 0;
+  e = e.replace(kr(), (t) => (u += Rr(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 += jr(r) || Lr(r) ? 2 : 1);
+  }
+  return u;
+}
+var Ue = Vr, Wr = { type: 0 }, Kr = { type: 1 }, Ju = {
+  value: "",
+  length: 0,
+  queue: [],
+  get root() {
+    return Ju;
+  }
+};
+function qu(e, u, t) {
+  let r = u.type === 1 ? e.queue.slice(0, -1) : [...e.queue, u], n = "", D = 0, i = 0, o = 0;
+  for (let f of r) switch (f.type) {
+    case 0:
+      l(), t.useTabs ? a(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, o += h;
+      break;
+    }
+    default:
+      throw new Error(`Unexpected indent comment '${f.type}'.`);
+  }
+  return c(), {
+    ...e,
+    value: n,
+    length: D,
+    queue: r
+  };
+  function a(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 && a(i), d();
+  }
+  function c() {
+    o > 0 && s(o), d();
+  }
+  function d() {
+    i = 0, o = 0;
+  }
+}
+function zr(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 = Kr : r = {
+    type: 2,
+    width: u
+  } : r = {
+    type: 3,
+    string: u
+  }, qu(e, r, t);
+}
+function Ur(e, u) {
+  return qu(e, Wr, u);
+}
+function Jr(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 Gu(e) {
+  let u = Jr(e);
+  return {
+    text: u === 0 ? e : e.slice(0, e.length - u),
+    count: u
+  };
+}
+var qr = class {
+  #u = [];
+  #e = "";
+  #r = 0;
+  #n = [];
+  #t = [];
+  #D() {
+    let e = this.#e;
+    e !== "" && (this.#u.push(e), this.#r += e.length, this.#e = "");
+    for (let u of this.#t) this.#n.push(Math.min(u, this.#r));
+    this.#t.length = 0;
+  }
+  markPosition() {
+    if (this.#n.length + this.#t.length >= 2) throw new Error("There are too many 'cursor' in doc.");
+    this.#t.push(this.#r + this.#e.length);
+  }
+  write(e) {
+    this.#e += e;
+  }
+  trim() {
+    let { text: e, count: u } = Gu(this.#e);
+    return this.#e = e, this.#D(), u;
+  }
+  finish() {
+    return this.#D(), {
+      text: this.#u.join(""),
+      positions: this.#n
+    };
+  }
+}, Gr = qr, S = /* @__PURE__ */ Symbol("MODE_BREAK"), N = /* @__PURE__ */ Symbol("MODE_FLAT"), Pe = /* @__PURE__ */ Symbol("DOC_FILL_PRINTED_LENGTH");
+function fe(e, u, t, r, n, D) {
+  if (t === Number.POSITIVE_INFINITY) return !0;
+  let i = u.length, o = !1, a = [e], s = "";
+  for (; t >= 0; ) {
+    if (a.length === 0) {
+      if (i === 0) return !0;
+      a.push(u[--i]);
+      continue;
+    }
+    let { mode: l, doc: F } = a.pop(), c = ee(F);
+    switch (c) {
+      case X:
+        F && (o && (s += " ", t -= 1, o = !1), s += F, t -= Ue(F));
+        break;
+      case L:
+      case T: {
+        let d = c === L ? F : F.parts, f = F[Pe] ?? 0;
+        for (let h = d.length - 1; h >= f; h--) a.push({
+          mode: l,
+          doc: d[h]
+        });
+        break;
+      }
+      case $:
+      case R:
+      case V:
+      case I:
+        a.push({
+          mode: l,
+          doc: F.contents
+        });
+        break;
+      case M: {
+        let { text: d, count: f } = Gu(s);
+        s = d, t += f;
+        break;
+      }
+      case w: {
+        if (D && F.break) return !1;
+        let d = F.break ? S : l, f = F.expandedStates && d === S ? y(0, F.expandedStates, -1) : F.contents;
+        a.push({
+          mode: d,
+          doc: f
+        });
+        break;
+      }
+      case k: {
+        let d = (F.groupId ? n[F.groupId] || N : l) === S ? F.breakContents : F.flatContents;
+        d && a.push({
+          mode: l,
+          doc: d
+        });
+        break;
+      }
+      case v:
+        if (l === S || F.hard) return !0;
+        F.soft || (o = !0);
+        break;
+      case W:
+        r = !0;
+        break;
+      case K:
+        if (r) return !1;
+    }
+  }
+  return !1;
+}
+function ve(e, u) {
+  let t = /* @__PURE__ */ Object.create(null), r = u.printWidth, n = Me(u.endOfLine), D = 0, i = [{
+    indent: Ju,
+    mode: S,
+    doc: e
+  }], o = !1, a = [], s = new Gr();
+  for (ir(e); i.length > 0; ) {
+    let { indent: f, mode: h, doc: p } = i.pop();
+    switch (ee(p)) {
+      case X: {
+        let C = n !== `
+` ? Ce(0, p, `
+`, n) : p;
+        C && (s.write(C), i.length > 0 && (D += Ue(C)));
+        break;
+      }
+      case L:
+        for (let C = p.length - 1; C >= 0; C--) i.push({
+          indent: f,
+          mode: h,
+          doc: p[C]
+        });
+        break;
+      case q:
+        s.markPosition();
+        break;
+      case $:
+        i.push({
+          indent: Ur(f, u),
+          mode: h,
+          doc: p.contents
+        });
+        break;
+      case R:
+        i.push({
+          indent: zr(f, p.n, u),
+          mode: h,
+          doc: p.contents
+        });
+        break;
+      case M:
+        D -= s.trim();
+        break;
+      case w: {
+        let C = (function() {
+          if (h === N && !o) return {
+            indent: f,
+            mode: p.break ? S : N,
+            doc: p.contents
+          };
+          o = !1;
+          let E = r - D, m = a.length > 0, g = {
+            indent: f,
+            mode: N,
+            doc: p.contents
+          };
+          if (!p.break && fe(g, i, E, m, t)) return g;
+          if (!p.expandedStates) return {
+            indent: f,
+            mode: S,
+            doc: p.contents
+          };
+          if (!p.break) for (let B = 1; B < p.expandedStates.length - 1; B++) {
+            let A = {
+              indent: f,
+              mode: N,
+              doc: p.expandedStates[B]
+            };
+            if (fe(A, i, E, m, t)) return A;
+          }
+          return {
+            indent: f,
+            mode: S,
+            doc: y(0, p.expandedStates, -1)
+          };
+        })();
+        i.push(C), p.id && (t[p.id] = C.mode);
+        break;
+      }
+      case T: {
+        let C = r - D, E = p[Pe] ?? 0, { parts: m } = p, g = m.length - E;
+        if (g === 0) break;
+        let B = m[E + 0], A = m[E + 1], b = {
+          indent: f,
+          mode: N,
+          doc: B
+        }, ue = {
+          indent: f,
+          mode: S,
+          doc: B
+        }, we = fe(b, [], C, a.length > 0, t, !0);
+        if (g === 1) {
+          we ? i.push(b) : i.push(ue);
+          break;
+        }
+        let tu = {
+          indent: f,
+          mode: N,
+          doc: A
+        }, ke = {
+          indent: f,
+          mode: S,
+          doc: A
+        };
+        if (g === 2) {
+          we ? i.push(tu, b) : i.push(ke, ue);
+          break;
+        }
+        let It = m[E + 2], Pt = {
+          indent: f,
+          mode: h,
+          doc: {
+            ...p,
+            [Pe]: E + 2
+          }
+        }, jt = fe({
+          indent: f,
+          mode: N,
+          doc: [
+            B,
+            A,
+            It
+          ]
+        }, [], C, a.length > 0, t, !0);
+        i.push(Pt), jt ? i.push(tu, b) : we ? i.push(ke, b) : i.push(ke, ue);
+        break;
+      }
+      case k:
+      case V: {
+        let C = p.groupId ? t[p.groupId] : h;
+        if (C === S) {
+          let E = p.type === k ? p.breakContents : p.negate ? p.contents : he(p.contents);
+          E && i.push({
+            indent: f,
+            mode: h,
+            doc: E
+          });
+        }
+        if (C === N) {
+          let E = p.type === k ? p.flatContents : p.negate ? he(p.contents) : p.contents;
+          E && i.push({
+            indent: f,
+            mode: h,
+            doc: E
+          });
+        }
+        break;
+      }
+      case W:
+        a.push({
+          indent: f,
+          mode: h,
+          doc: p.contents
+        });
+        break;
+      case K:
+        a.length > 0 && i.push({
+          indent: f,
+          mode: h,
+          doc: ze
+        });
+        break;
+      case v:
+        switch (h) {
+          case N:
+            if (!p.hard) {
+              p.soft || (s.write(" "), D += 1);
+              break;
+            }
+            o = !0;
+          case S:
+            if (a.length > 0) {
+              i.push({
+                indent: f,
+                mode: h,
+                doc: p
+              }, ...a.reverse()), a.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;
+      case I:
+        i.push({
+          indent: f,
+          mode: h,
+          doc: p.contents
+        });
+        break;
+      case x:
+        break;
+      default:
+        throw new ne(p);
+    }
+    i.length === 0 && a.length > 0 && (i.push(...a.reverse()), a.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 Hr(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 Je = Hr, Yr = class {
+  constructor(e) {
+    this.stack = [e];
+  }
+  get key() {
+    let { stack: e, siblings: u } = this;
+    return y(0, e, u === null ? -2 : -4) ?? null;
+  }
+  get index() {
+    return this.siblings === null ? null : y(0, this.stack, -2);
+  }
+  get node() {
+    return y(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 = y(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 [...this.#e()];
+  }
+  getName() {
+    let { stack: e } = this, { length: u } = e;
+    return u > 1 ? y(0, e, -2) : null;
+  }
+  getValue() {
+    return y(0, this.stack, -1);
+  }
+  getNode(e = 0) {
+    let u = this.#u(e);
+    return u === -1 ? null : this.stack[u];
+  }
+  getParentNode(e = 0) {
+    return this.getNode(e + 1);
+  }
+  #u(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;
+  }
+  call(e, ...u) {
+    let { stack: t } = this, { length: r } = t, n = y(0, t, -1);
+    for (let D of u) n = n?.[D], t.push(D, n);
+    try {
+      return e(this);
+    } finally {
+      t.length = r;
+    }
+  }
+  callParent(e, u = 0) {
+    let t = this.#u(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 = y(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 this.#e()) if (e(u)) return u;
+  }
+  hasAncestor(e) {
+    for (let u of this.#e()) if (e(u)) return !0;
+    return !1;
+  }
+  *#e() {
+    let { stack: e } = this;
+    for (let u = e.length - 3; u >= 0; u -= 2) {
+      let t = e[u];
+      Array.isArray(t) || (yield t);
+    }
+  }
+}, Zr = Yr;
+function Qr(e) {
+  return Array.isArray(e) && e.length > 0;
+}
+var Hu = Qr;
+function Xr(e) {
+  return e !== null && typeof e == "object";
+}
+var qe = Xr;
+function ce(e) {
+  return (u, t, r) => {
+    if (t === !1) return !1;
+    let n = !!r?.backwards, { length: D } = u, i = t;
+    for (; i >= 0 && i < D; ) {
+      let o = u.charAt(i);
+      if (e instanceof RegExp) {
+        if (!e.test(o)) return i;
+      } else if (!e.includes(o)) return i;
+      n ? i-- : i++;
+    }
+    return i === -1 || i === D ? i : !1;
+  };
+}
+var en = ce(/\s/), J = ce(" 	"), Yu = ce(",; 	"), Zu = ce(/[^\n\r]/), au = (e) => e === `
+` || e === "\r" || e === "\u2028" || e === "\u2029";
+function un(e, u, t) {
+  if (u === !1) return !1;
+  let r = !!t?.backwards, n = e.charAt(u);
+  if (r) {
+    if (e.charAt(u - 1) === "\r" && n === `
+`) return u - 2;
+    if (au(n)) return u - 1;
+  } else {
+    if (n === "\r" && e.charAt(u + 1) === `
+`) return u + 2;
+    if (au(n)) return u + 1;
+  }
+  return u;
+}
+var Q = un;
+function tn(e, u, t = {}) {
+  let r = J(e, t.backwards ? u - 1 : u, t);
+  return r !== Q(e, r, t);
+}
+var z = tn;
+function* Be(e, u) {
+  let { getVisitorKeys: t, filter: r = () => !0 } = u, n = (D) => qe(D) && r(D);
+  for (let D of t(e)) {
+    let i = e[D];
+    if (Array.isArray(i)) for (let o of i) n(o) && (yield o);
+    else n(i) && (yield i);
+  }
+}
+function* rn(e, u) {
+  let t = [e];
+  for (let r = 0; r < t.length; r++) {
+    let n = t[r];
+    for (let D of Be(n, u)) yield D, t.push(D);
+  }
+}
+function nn(e, u) {
+  return Be(e, u).next().done;
+}
+function Dn(e, u, t) {
+  let { filter: r } = t;
+  if (!r) return [];
+  let n, D = (t.getChildren?.(e, t) ?? [...Be(e, { getVisitorKeys: t.getVisitorKeys })]).flatMap((a) => (n ?? (n = [e, ...u]), r(a, n) ? [a] : Qu(a, n, t))), { locStart: i, locEnd: o } = t;
+  return D.sort((a, s) => i(a) - i(s) || o(a) - o(s)), D;
+}
+function Qu(e, u, t) {
+  return Ve(t.cache, e, (r) => Dn(r, u, t));
+}
+var Xu = Qu;
+function an(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 Ge(e, u) {
+  (e.comments ?? (e.comments = [])).push(u), u.printed = !1, u.nodeDescription = an(e);
+}
+function oe(e, u) {
+  u.leading = !0, u.trailing = !1, Ge(e, u);
+}
+function H(e, u, t) {
+  u.leading = !1, u.trailing = !1, t && (u.marker = t), Ge(e, u);
+}
+function se(e, u) {
+  u.leading = !1, u.trailing = !0, Ge(e, u);
+}
+var et = /* @__PURE__ */ new WeakMap();
+function ut(e, u, t, r, n = []) {
+  let { locStart: D, locEnd: i } = t, o = D(u), a = i(u), s = Xu(e, n, {
+    cache: et,
+    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 <= o && a <= C) return ut(h, u, t, h, [h, ...n]);
+    if (C <= o) {
+      l = h, c = f + 1;
+      continue;
+    }
+    if (a <= p) {
+      F = h, d = f;
+      continue;
+    }
+    throw new Error("Comment location overlaps with node location");
+  }
+  if (r?.type === "TemplateLiteral") {
+    let { quasis: f } = r, h = xe(f, u, t);
+    l && xe(f, l, t) !== h && (l = null), F && xe(f, F, t) !== h && (F = null);
+  }
+  return {
+    enclosingNode: r,
+    precedingNode: l,
+    followingNode: F
+  };
+}
+var Se = () => !1;
+function on(e, u) {
+  let { comments: t } = e;
+  if (delete e.comments, !Hu(t) || !u.printer.canAttachComment) return;
+  let r = [], { printer: { features: { experimental_avoidAstMutation: n }, handleComments: D = {} }, originalText: i } = u, { ownLine: o = Se, endOfLine: a = Se, remaining: s = Se } = D, l = t.map((c, d) => ({
+    ...ut(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: m, ast: g, isLastComment: B } = d, A = sn(E, m, l, c) ? "ownLine" : ln(E, m, l, c) ? "endOfLine" : "remaining", b;
+    if (n ? (d.placement = A, b = [d]) : b = [
+      f,
+      E,
+      m,
+      g,
+      B
+    ], F && (f.enclosingNode = p, f.precedingNode = h, f.followingNode = C), f.placement = A, A === "ownLine") o(...b) || (C ? oe(C, f) : h ? se(h, f) : H(p || g, f));
+    else if (A === "endOfLine") a(...b) || (h ? se(h, f) : C ? oe(C, f) : H(p || g, f));
+    else if (!s(...b)) if (h && C) {
+      let ue = r.length;
+      ue > 0 && r[ue - 1].followingNode !== C && ou(r, m), r.push(d);
+    } else h ? se(h, f) : C ? oe(C, f) : H(p || g, f);
+  }
+  if (ou(r, u), F) for (let c of t) delete c.precedingNode, delete c.enclosingNode, delete c.followingNode;
+}
+var tt = (e) => !/[\S\n\u2028\u2029]/.test(e);
+function sn(e, u, t, r) {
+  let { comment: n, precedingNode: D } = t[r], { locStart: i, locEnd: o } = u, a = i(n);
+  if (D) for (let s = r - 1; s >= 0; s--) {
+    let { comment: l, precedingNode: F } = t[s];
+    if (F !== D || !tt(e.slice(o(l), a))) break;
+    a = i(l);
+  }
+  return z(e, a, { backwards: !0 });
+}
+function ln(e, u, t, r) {
+  let { comment: n, followingNode: D } = t[r], { locStart: i, locEnd: o } = u, a = o(n);
+  if (D) for (let s = r + 1; s < t.length; s++) {
+    let { comment: l, followingNode: F } = t[s];
+    if (F !== D || !tt(e.slice(a, i(l)))) break;
+    a = o(l);
+  }
+  return z(e, a);
+}
+function ou(e, u) {
+  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: o, precedingNode: a, followingNode: s } = e[i - 1];
+    U(a, r), U(s, n);
+    let l = u.originalText.slice(u.locEnd(o), D);
+    if (u.printer.isGap?.(l, u) ?? /^[\s(]*$/.test(l)) D = u.locStart(o);
+    else break;
+  }
+  for (let [o, { comment: a }] of e.entries()) o < i ? se(r, a) : oe(n, a);
+  for (let o of [r, n]) o.comments && o.comments.length > 1 && o.comments.sort((a, s) => u.locStart(a) - u.locStart(s));
+  e.length = 0;
+}
+function xe(e, u, t) {
+  let r = t.locStart(u) - 1;
+  for (let n = 1; n < e.length; ++n) if (r < t.locStart(e[n])) return n - 1;
+  return 0;
+}
+function cn(e, u) {
+  let t = u - 1;
+  t = J(e, t, { backwards: !0 }), t = Q(e, t, { backwards: !0 }), t = J(e, t, { backwards: !0 });
+  let r = Q(e, t, { backwards: !0 });
+  return t !== r;
+}
+var He = cn, rt = () => !0;
+function nt(e, u) {
+  let t = e.node;
+  return t.printed = !0, u.printer.printComment(e, u);
+}
+function Fn(e, u) {
+  let t = e.node, r = [nt(e, u)], { printer: n, originalText: D, locStart: i, locEnd: o } = u;
+  if (n.isBlockComment?.(t)) {
+    let s = " ";
+    z(D, o(t)) && (z(D, i(t), { backwards: !0 }) ? s = j : s = Vu), r.push(s);
+  } else r.push(j);
+  let a = Q(D, J(D, o(t)));
+  return a !== !1 && z(D, a) && r.push(j), r;
+}
+function fn(e, u, t) {
+  let r = e.node, n = nt(e, u), { printer: D, originalText: i, locStart: o } = u, a = D.isBlockComment?.(r);
+  return t?.hasLineSuffix && !t?.isBlock || z(i, o(r), { backwards: !0 }) ? {
+    doc: Ie([
+      j,
+      He(i, o(r)) ? j : "",
+      n
+    ]),
+    isBlock: a,
+    hasLineSuffix: !0
+  } : !a || t?.hasLineSuffix ? {
+    doc: [Ie([" ", n]), ye],
+    isBlock: a,
+    hasLineSuffix: !0
+  } : {
+    doc: [" ", n],
+    isBlock: a,
+    hasLineSuffix: !1
+  };
+}
+function dn(e, u, t) {
+  let r = u[/* @__PURE__ */ Symbol.for("printedComments")], n = t?.filter ?? rt, D = new Set(e.node?.comments?.filter((i) => !r?.has(i) && i.leading && n(i)));
+  return D.size === 0 ? "" : e.map(({ node: i }) => D.has(i) ? Fn(e, u) : "", "comments").filter(Boolean);
+}
+function pn(e, u, t) {
+  let r = e.node?.comments, n = new Set(r?.filter((l) => l.trailing)), D = u[/* @__PURE__ */ Symbol.for("printedComments")], i = t?.filter ?? rt, o = new Set(r?.filter((l) => n.has(l) && !D?.has(l) && i(l)));
+  if (o.size === 0) return "";
+  let a = [], s;
+  return e.each(({ node: l }) => {
+    n.has(l) && (s = fn(e, u, s), o.has(l) && a.push(s.doc));
+  }, "comments"), a;
+}
+function hn(e, u, t, r) {
+  let n = dn(e, t, r), D = pn(e, t, r);
+  return n || D ? de(u, (i) => [
+    n,
+    i,
+    D
+  ]) : u;
+}
+function Cn(e) {
+  let { [me]: u, [/* @__PURE__ */ Symbol.for("printedComments")]: t } = e;
+  for (let r of u) {
+    if (!r.printed && !t.has(r)) throw new Error('Comment "' + r.value.trim() + '" was not printed. Please report this error!');
+    delete r.printed;
+  }
+}
+var En = () => U, Dt = class extends Error {
+  name = "ConfigError";
+}, su = class extends Error {
+  name = "UndefinedParserError";
+}, Ae = Object.hasOwn ?? Function.prototype.call.bind(Object.prototype.hasOwnProperty), mn = {
+  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 it({ plugins: e = [], showDeprecated: u = !1 } = {}) {
+  let t = e.flatMap((n) => n.languages ?? []), r = [];
+  for (let n of yn(Object.assign({}, ...e.map(({ options: D }) => D), mn))) !u && n.deprecated || (Array.isArray(n.choices) && (u || (n.choices = n.choices.filter((D) => !D.deprecated)), n.name === "parser" && (n.choices = [...n.choices, ...gn(n.choices, t, e)])), n.pluginDefaults = Object.fromEntries(e.filter((D) => D.defaultOptions?.[n.name] !== void 0).map((D) => [D.name, D.defaultOptions[n.name]])), r.push(n));
+  return {
+    languages: t,
+    options: r
+  };
+}
+function* gn(e, u, t) {
+  let r = new Set(e.map((n) => n.value));
+  for (let n of u) if (n.parsers) {
+    for (let D of n.parsers) if (!r.has(D)) {
+      r.add(D);
+      let i = t.find((a) => a.parsers && Ae(a.parsers, D)), o = n.name;
+      i?.name && (o += ` (plugin: ${i.name})`), yield {
+        value: D,
+        description: o
+      };
+    }
+  }
+}
+function yn(e) {
+  let u = [];
+  for (let [t, r] of Object.entries(e)) {
+    let n = {
+      name: t,
+      ...r
+    };
+    Array.isArray(n.default) && (n.default = y(0, n.default, -1).value), u.push(n);
+  }
+  return u;
+}
+var vn = Array.prototype.toReversed ?? function() {
+  return [...this].reverse();
+}, Bn = le("toReversed", function() {
+  if (Array.isArray(this)) return vn;
+});
+function An() {
+  let e = globalThis, u = e.process?.platform;
+  if (typeof u == "string") return u.startsWith("win");
+  let t = e.Deno?.build?.os;
+  return typeof t == "string" ? t === "windows" : e.navigator?.platform?.startsWith("Win") ?? !1;
+}
+var bn = An();
+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 wn(e) {
+  return e = at(e), decodeURIComponent(e.pathname.replace(/%(?![0-9A-Fa-f]{2})/g, "%25"));
+}
+function kn(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 Sn(e) {
+  return bn ? kn(e) : wn(e);
+}
+var xn = (e) => String(e).split(/[/\\]/).pop(), Nn = (e) => String(e).startsWith("file:");
+function lu(e, u) {
+  if (!u) return;
+  let t = xn(u).toLowerCase();
+  return e.find(({ filenames: r }) => r?.some((n) => n.toLowerCase() === t)) ?? e.find(({ extensions: r }) => r?.some((n) => t.endsWith(n)));
+}
+function _n(e, u) {
+  if (u) return e.find(({ name: t }) => t.toLowerCase() === u) ?? e.find(({ aliases: t }) => t?.includes(u)) ?? e.find(({ extensions: t }) => t?.includes(`.${u}`));
+}
+var On = void 0;
+function cu(e, u) {
+  if (u) {
+    if (Nn(u)) try {
+      u = Sn(u);
+    } catch {
+      return;
+    }
+    if (typeof u == "string") return e.find(({ isSupported: t }) => t?.({ filepath: u }));
+  }
+}
+function Tn(e, u) {
+  let t = Bn(0, e.plugins).flatMap((r) => r.languages ?? []);
+  return (_n(t, u.language) ?? lu(t, u.physicalFile) ?? lu(t, u.file) ?? cu(t, u.physicalFile) ?? cu(t, u.file) ?? On?.(t, u.physicalFile))?.parsers[0];
+}
+var ot = Tn, re = {
+  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) => re.value(t)).join(", ")}]`;
+    let u = Object.keys(e);
+    return u.length === 0 ? "{}" : `{ ${u.map((t) => `${re.key(t)}: ${re.value(e[t])}`).join(", ")} }`;
+  },
+  pair: ({ key: e, value: u }) => re.value({ [e]: u })
+}, st = new Proxy(String, { get: () => st }), _ = st, In = (e, u, { descriptor: t }) => {
+  let r = [`${_.yellow(typeof e == "string" ? t.key(e) : t.pair(e))} is deprecated`];
+  return u && r.push(`we now treat it as ${_.blue(typeof u == "string" ? t.key(u) : t.pair(u))}`), r.join("; ") + ".";
+}, lt = /* @__PURE__ */ Symbol.for("vnopts.VALUE_NOT_EXIST"), pe = /* @__PURE__ */ Symbol.for("vnopts.VALUE_UNCHANGED"), Fu = " ".repeat(2), Pn = (e, u, t) => {
+  let { text: r, list: n } = t.normalizeExpectedResult(t.schemas[e].expected(t)), D = [];
+  return r && D.push(fu(e, u, r, t.descriptor)), n && D.push([fu(e, u, n.title, t.descriptor)].concat(n.values.map((i) => ct(i, t.loggerPrintWidth))).join(`
+`)), Ft(D, t.loggerPrintWidth);
+};
+function fu(e, u, t, r) {
+  return [
+    `Invalid ${_.red(r.key(e))} value.`,
+    `Expected ${_.blue(t)},`,
+    `but received ${u === lt ? _.gray("nothing") : _.red(r.value(u))}.`
+  ].join(" ");
+}
+function ct({ text: e, list: u }, t) {
+  let r = [];
+  return e && r.push(`- ${_.blue(e)}`), u && r.push([`- ${_.blue(u.title)}:`].concat(u.values.map((n) => ct(n, t - Fu.length).replace(/^|\n/g, `$&${Fu}`))).join(`
+`)), Ft(r, t);
+}
+function Ft(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 te = [], Ne = [];
+function _e(e, u, t) {
+  if (e === u) return 0;
+  let r = 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 o = 0;
+  for (; o < D && e.charCodeAt(o) === u.charCodeAt(o); ) o++;
+  if (D -= o, i -= o, r !== void 0 && i - D > r) return r;
+  if (D === 0) return r !== void 0 && i > r ? r : i;
+  let a, s, l, F, c = 0, d = 0;
+  for (; c < D; ) Ne[c] = e.charCodeAt(o + c), te[c] = ++c;
+  for (; d < i; ) {
+    for (a = u.charCodeAt(o + d), l = d++, s = d, c = 0; c < D; c++) F = a === Ne[c] ? l : l + 1, l = te[c], s = te[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++) te[c] < f && (f = te[c]);
+      if (f > r) return r;
+    }
+  }
+  return te.length = D, Ne.length = D, r !== void 0 && s > r ? r : s;
+}
+function jn(e, u, t) {
+  if (!Array.isArray(u) || u.length === 0) return;
+  let r = t?.maxDistance, n = e.length;
+  for (let a of u) if (a === e) return a;
+  if (r === 0) return;
+  let D, i = Number.POSITIVE_INFINITY, o = /* @__PURE__ */ new Set();
+  for (let a of u) {
+    if (o.has(a)) continue;
+    o.add(a);
+    let s = Math.abs(a.length - n);
+    if (s >= i || r !== void 0 && s > r) continue;
+    let l = Number.isFinite(i) ? r === void 0 ? i : Math.min(i, r) : r, F = l === void 0 ? _e(e, a) : _e(e, a, { maxDistance: l });
+    if (r !== void 0 && F > r) continue;
+    let c = F;
+    if (l !== void 0 && F === l && l === r && (c = _e(e, a)), c < i && (i = c, D = a, i === 0)) break;
+  }
+  if (!(r !== void 0 && i > r)) return D;
+}
+var ft = (e, u, { descriptor: t, logger: r, schemas: n }) => {
+  let D = [`Ignored unknown option ${_.yellow(t.pair({
+    key: e,
+    value: u
+  }))}.`], i = jn(e, Object.keys(n), { maxDistance: 3 });
+  i && D.push(`Did you mean ${_.blue(t.key(i))}?`), r.warn(D.join(" "));
+}, Ln = [
+  "default",
+  "expected",
+  "validate",
+  "deprecated",
+  "forward",
+  "redirect",
+  "overlap",
+  "preprocess",
+  "postprocess"
+];
+function $n(e, u) {
+  let t = new e(u), r = Object.create(t);
+  for (let n of Ln) n in u && (r[n] = Rn(u[n], t, G.prototype[n].length));
+  return r;
+}
+var G = class {
+  static create(e) {
+    return $n(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 pe;
+  }
+};
+function Rn(e, u, t) {
+  return typeof e == "function" ? (...r) => e(...r.slice(0, t - 1), u, ...r.slice(t - 1)) : () => e;
+}
+var Mn = class extends G {
+  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;
+  }
+}, Vn = class extends G {
+  expected() {
+    return "anything";
+  }
+  validate() {
+    return !0;
+  }
+}, Wn = class extends G {
+  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(du));
+    }
+    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(du));
+    }
+    return t.length === 0 ? { redirect: r } : {
+      redirect: r,
+      remain: t
+    };
+  }
+  overlap(e, u) {
+    return e.concat(u);
+  }
+};
+function du({ from: e, to: u }) {
+  return {
+    from: [e],
+    to: u
+  };
+}
+var Kn = class extends G {
+  expected() {
+    return "true or false";
+  }
+  validate(e) {
+    return typeof e == "boolean";
+  }
+};
+function zn(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 Un(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 Jn() {
+  let e = /* @__PURE__ */ Object.create(null);
+  return (u) => {
+    let t = JSON.stringify(u);
+    return e[t] ? !0 : (e[t] = !0, !1);
+  };
+}
+function qn(e, u) {
+  let t = [], r = [];
+  for (let n of e) u(n) ? t.push(n) : r.push(n);
+  return [t, r];
+}
+function Gn(e) {
+  return e === Math.floor(e);
+}
+function Hn(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 Yn(e) {
+  return (...u) => {
+    let t = e(...u);
+    return typeof t == "string" ? new Error(t) : t;
+  };
+}
+function pu(e) {
+  return e === void 0 ? {} : e;
+}
+function dt(e) {
+  if (typeof e == "string") return { text: e };
+  let { text: u, list: t } = e;
+  return Zn((u || t) !== void 0, "Unexpected `expected` result, there should be at least one field."), t ? {
+    text: u,
+    list: {
+      title: t.title,
+      values: t.values.map(dt)
+    }
+  } : { text: u };
+}
+function hu(e, u) {
+  return e === !0 ? !0 : e === !1 ? { value: u } : e;
+}
+function Cu(e, u, t = !1) {
+  return e === !1 ? !1 : e === !0 ? t ? !0 : [{ value: u }] : "value" in e ? [e] : e.length === 0 ? !1 : e;
+}
+function Eu(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 je(e, u) {
+  return e === void 0 ? [] : Array.isArray(e) ? e.map((t) => Eu(t, u)) : [Eu(e, u)];
+}
+function mu(e, u) {
+  let t = je(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 Zn(e, u) {
+  if (!e) throw new Error(u);
+}
+var Qn = class extends G {
+  constructor(e) {
+    super(e), this._choices = Un(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(Hn).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;
+  }
+}, Xn = class extends G {
+  expected() {
+    return "a number";
+  }
+  validate(e, u) {
+    return typeof e == "number";
+  }
+}, eD = class extends Xn {
+  expected() {
+    return "an integer";
+  }
+  validate(e, u) {
+    return u.normalizeValidateResult(super.validate(e, u), e) === !0 && Gn(e);
+  }
+}, gu = class extends G {
+  expected() {
+    return "a string";
+  }
+  validate(e) {
+    return typeof e == "string";
+  }
+}, uD = re, tD = ft, rD = Pn, nD = In, DD = class {
+  constructor(e, u) {
+    let { logger: t = console, loggerPrintWidth: r = 80, descriptor: n = uD, unknown: D = tD, invalid: i = rD, deprecated: o = nD, missing: a = () => !1, required: s = () => !1, preprocess: l = (c) => c, postprocess: F = () => pe } = u || {};
+    this._utils = {
+      descriptor: n,
+      logger: t || { warn: () => {
+      } },
+      loggerPrintWidth: r,
+      schemas: zn(e, "name"),
+      normalizeDefaultResult: pu,
+      normalizeExpectedResult: dt,
+      normalizeDeprecatedResult: Cu,
+      normalizeForwardResult: je,
+      normalizeRedirectResult: mu,
+      normalizeValidateResult: hu
+    }, this._unknownHandler = D, this._invalidHandler = Yn(i), this._deprecatedHandler = o, this._identifyMissing = (c, d) => !(c in d) || a(c, d), this._identifyRequired = s, this._preprocess = l, this._postprocess = F, this.cleanHistory();
+  }
+  cleanHistory() {
+    this._hasDeprecationWarned = Jn();
+  }
+  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 = pu(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], o = D.postprocess(i, this._utils);
+      o !== pe && (this._applyValidation(o, n, D), u[n] = o);
+    }
+    return this._applyPostprocess(u), this._applyRequiredCheck(u), u;
+  }
+  _applyNormalization(e, u) {
+    let t = [], { knownKeys: r, unknownKeys: n } = this._partitionOptionKeys(e);
+    for (let D of r) {
+      let i = this._utils.schemas[D], o = i.preprocess(e[D], this._utils);
+      this._applyValidation(o, D, i);
+      let a = ({ from: F, to: c }) => {
+        t.push(typeof c == "string" ? { [c]: F } : { [c.key]: c.value });
+      }, s = ({ value: F, redirectTo: c }) => {
+        let d = Cu(i.deprecated(F, this._utils), o, !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));
+          }
+        }
+      };
+      je(i.forward(o, this._utils), o).forEach(a);
+      let l = mu(i.redirect(o, this._utils), o);
+      if (l.redirect.forEach(a), "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, (o, a) => {
+        t.push({ [o]: a });
+      });
+    }
+    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, lt, this._utils);
+  }
+  _partitionOptionKeys(e) {
+    let [u, t] = qn(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 = hu(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 !== pe) {
+      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, o) => {
+            let a = this._utils.schemas[i];
+            this._applyValidation(o, i, a), e[i] = o;
+          });
+        }
+      }
+    }
+  }
+}, Oe;
+function iD(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 = re;
+  let o = n ? Array.isArray(n) ? (F, c) => n.includes(F) ? { [F]: c } : void 0 : (F, c) => ({ [F]: c }) : (F, c, d) => {
+    let { _: f, ...h } = d.schemas;
+    return ft(F, c, {
+      ...d,
+      schemas: h
+    });
+  }, a = new DD(aD(u, {
+    isCLI: r,
+    FlagSchema: D
+  }), {
+    logger: t,
+    unknown: o,
+    descriptor: i
+  }), s = t !== !1;
+  s && Oe && (a._hasDeprecationWarned = Oe);
+  let l = a.normalize(e);
+  return s && (Oe = a._hasDeprecationWarned), l;
+}
+function aD(e, { isCLI: u, FlagSchema: t }) {
+  let r = [];
+  u && r.push(Vn.create({ name: "_" }));
+  for (let n of e) r.push(oD(n, {
+    isCLI: u,
+    optionInfos: e,
+    FlagSchema: t
+  })), n.alias && u && r.push(Mn.create({
+    name: n.alias,
+    sourceName: n.name
+  }));
+  return r;
+}
+function oD(e, { isCLI: u, optionInfos: t, FlagSchema: r }) {
+  let { name: n } = e, D = { name: n }, i, o = {};
+  switch (e.type) {
+    case "int":
+      i = eD, u && (D.preprocess = Number);
+      break;
+    case "string":
+      i = gu;
+      break;
+    case "choice":
+      i = Qn, D.choices = e.choices.map((a) => a?.redirect ? {
+        ...a,
+        redirect: { to: {
+          key: e.name,
+          value: a.redirect
+        } }
+      } : a);
+      break;
+    case "boolean":
+      i = Kn;
+      break;
+    case "flag":
+      i = r, D.flags = t.flatMap((a) => [
+        a.alias,
+        a.description && a.name,
+        a.oppositeDescription && `no-${a.name}`
+      ].filter(Boolean));
+      break;
+    case "path":
+      i = gu;
+      break;
+    default:
+      throw new Error(`Unexpected type ${e.type}`);
+  }
+  if (e.exception ? D.validate = (a, s, l) => e.exception(a) || s.validate(a, l) : D.validate = (a, s, l) => a === void 0 || s.validate(a, l), e.redirect && (o.redirect = (a) => a ? { to: typeof e.redirect == "string" ? e.redirect : {
+    key: e.redirect.option,
+    value: e.redirect.value
+  } } : void 0), e.deprecated && (o.deprecated = !0), u && !e.array) {
+    let a = D.preprocess || ((s) => s);
+    D.preprocess = (s, l, F) => l.preprocess(a(Array.isArray(s) ? y(0, s, -1) : s), F);
+  }
+  return e.array ? Wn.create({
+    ...u ? { preprocess: (a) => Array.isArray(a) ? a : [a] } : {},
+    ...o,
+    valueSchema: i.create(D)
+  }) : i.create({
+    ...D,
+    ...o
+  });
+}
+var sD = iD, lD = 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;
+  }
+}, pt = le("findLast", function() {
+  if (Array.isArray(this)) return lD;
+}), cD = /* @__PURE__ */ Symbol.for("PRETTIER_IS_FRONT_MATTER"), FD = [];
+function fD(e) {
+  return !!e?.[cD];
+}
+var Ye = fD, ht = /* @__PURE__ */ new Set(["yaml", "toml"]), Ct = ({ node: e }) => Ye(e) && ht.has(e.language);
+async function dD(e, u, t, r) {
+  let { node: n } = t, { language: D } = n;
+  if (!ht.has(D)) return;
+  let i = n.value.trim(), o;
+  if (i) {
+    let a = D === "yaml" ? D : ot(r, { language: D });
+    if (!a) return;
+    o = i ? await e(i, { parser: a }) : "";
+  } else o = i;
+  return Lu([
+    n.startDelimiter,
+    n.explicitLanguage ?? "",
+    j,
+    o,
+    o ? j : "",
+    n.endDelimiter
+  ]);
+}
+function pD(e, u) {
+  return Ct({ node: e }) && (delete u.end, delete u.raw, delete u.value), u;
+}
+var hD = pD;
+function CD({ node: e }) {
+  return e.raw;
+}
+var ED = CD, Et = /* @__PURE__ */ new Set([
+  "tokens",
+  "comments",
+  "parent",
+  "enclosingNode",
+  "precedingNode",
+  "followingNode"
+]), mD = (e) => Object.keys(e).filter((u) => !Et.has(u));
+function gD(e, u) {
+  let t = e ? (r) => e(r, Et) : mD;
+  return u ? new Proxy(t, { apply: (r, n, D) => Ye(D[0]) ? FD : Reflect.apply(r, n, D) }) : t;
+}
+var yu = gD;
+function mt(e, u) {
+  if (!u) throw new Error("parserName is required.");
+  let t = pt(0, e, (n) => n.parsers && Ae(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 Dt(r);
+}
+function yD(e, u) {
+  if (!u) throw new Error("astFormat is required.");
+  let t = pt(0, e, (n) => n.printers && Ae(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 Dt(r);
+}
+function Ze({ plugins: e, parser: u }) {
+  return gt(mt(e, u), u);
+}
+function gt(e, u) {
+  let t = e.parsers[u];
+  return typeof t == "function" ? t() : t;
+}
+async function vD(e, u) {
+  let t = e.printers[u];
+  return bD(typeof t == "function" ? await t() : t);
+}
+function BD(e) {
+  let { features: u, getVisitorKeys: t, embed: r, massageAstNode: n, print: D, ...i } = e;
+  u = SD(u);
+  let o = u.experimental_frontMatterSupport;
+  t = yu(t, o.massageAstNode || o.embed || o.print);
+  let a = n;
+  n && o.massageAstNode && (a = new Proxy(n, { apply(F, c, d) {
+    return hD(...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 ? yu(r.getVisitorKeys, o.massageAstNode || o.embed) : t), F) : Reflect.get(c, d, f);
+      },
+      apply: (c, d, f) => o.embed && Ct(...f) ? dD : Reflect.apply(c, d, f)
+    });
+  }
+  let l = D;
+  return o.print && (l = new Proxy(D, { apply(F, c, d) {
+    let [f] = d;
+    return Ye(f.node) ? ED(f) : Reflect.apply(F, c, d);
+  } })), {
+    features: u,
+    getVisitorKeys: t,
+    embed: s,
+    massageAstNode: a,
+    print: l,
+    ...i
+  };
+}
+var AD = /* @__PURE__ */ new WeakMap();
+function bD(e) {
+  return Ve(AD, e, BD);
+}
+var wD = Object.fromEntries([
+  "clean",
+  "embed",
+  "print"
+].map((e) => [e, !1]));
+function kD(e) {
+  return {
+    ...wD,
+    ...e
+  };
+}
+function SD(e) {
+  return {
+    experimental_avoidAstMutation: !1,
+    ...e,
+    experimental_frontMatterSupport: kD(e?.experimental_frontMatterSupport)
+  };
+}
+var vu = {
+  astFormat: "estree",
+  printer: {},
+  originalText: void 0,
+  locStart: null,
+  locEnd: null,
+  getVisitorKeys: null
+};
+async function xD(e, u = {}) {
+  let t = { ...e };
+  if (!t.parser) {
+    if (!t.filepath) throw new su("No parser and no file path given, couldn't infer a parser.");
+    if (t.parser = ot(t, { physicalFile: t.filepath }), !t.parser) throw new su(`No parser could be inferred for file "${t.filepath}".`);
+  }
+  let r = it({
+    plugins: e.plugins,
+    showDeprecated: !0
+  }).options, n = {
+    ...vu,
+    ...Object.fromEntries(r.filter((F) => F.default !== void 0).map((F) => [F.name, F.default]))
+  }, D = mt(t.plugins, t.parser), i = await gt(D, t.parser);
+  t.astFormat = i.astFormat, t.locEnd = i.locEnd, t.locStart = i.locStart;
+  let o = D.printers?.[i.astFormat] ? D : yD(t.plugins, i.astFormat), a = await vD(o, i.astFormat);
+  t.printer = a, t.getVisitorKeys = a.getVisitorKeys;
+  let s = o.defaultOptions ? Object.fromEntries(Object.entries(o.defaultOptions).filter(([, F]) => F !== void 0)) : {}, l = {
+    ...n,
+    ...s
+  };
+  for (let [F, c] of Object.entries(l)) t[F] ?? (t[F] = c);
+  return t.parser === "json" && (t.trailingComma = "none"), sD(t, r, {
+    passThrough: Object.keys(vu),
+    ...u
+  });
+}
+var ie = xD, Bu = /\r\n|[\n\r\u2028\u2029]/;
+function ND(e, u, t, r) {
+  let n = {
+    column: null,
+    line: -1,
+    ...e.start
+  }, D = {
+    ...n,
+    ...e.end
+  }, { linesAbove: i = 2, linesBelow: o = 3 } = t || {}, a = n.line - r, s = n.column, l = D.line - r, F = D.column, c = Math.max(a - (i + 1), 0), d = Math.min(u.length, l + o);
+  a === -1 && (c = 0), l === -1 && (d = u.length);
+  let f = l - a, h = {};
+  if (f) for (let p = 0; p <= f; p++) {
+    let C = p + a;
+    s == null ? h[C] = !0 : p === 0 ? h[C] = [s, u[C - 1].length - s] : p === f ? h[C] = [0, F] : h[C] = [0, u[C - 1].length];
+  }
+  else if (s === F) s != null ? h[a] = [s, 0] : h[a] = !0;
+  else {
+    let p = s ?? 0;
+    h[a] = [p, (F ?? p) - p];
+  }
+  return {
+    start: c,
+    end: d,
+    markerLines: h
+  };
+}
+function _D(e, u, t = {}, r) {
+  let { defs: n, highlight: D } = r || {
+    defs: {
+      gutter: String,
+      marker: String,
+      message: String,
+      reset: String
+    },
+    highlight: String
+  }, i = (t.startLine || 1) - 1, { start: o, end: a, markerLines: s } = ND(u, e.split(Bu), t, i), l = u.start && typeof u.start.column == "number", F = String(a + i).length, c = D(e).split(Bu, a).slice(o, a).map((d, f) => {
+    let h = o + 1 + f, p = ` ${` ${h + i}`.slice(-F)} |`, C = s[h], E = !s[h + 1];
+    if (C) {
+      let m = "";
+      if (Array.isArray(C)) {
+        let g = d.slice(0, C[0]).replace(/[^\t]/g, " "), B = C[1] || 1;
+        m = [
+          `
+ `,
+          n.gutter(p.replace(/\d/g, " ")),
+          " ",
+          g,
+          n.marker("^").repeat(B)
+        ].join(""), E && t.message && (m += " " + n.message(t.message));
+      }
+      return [
+        n.marker(">"),
+        n.gutter(p),
+        d.length > 0 ? ` ${d}` : "",
+        m
+      ].join("");
+    } else return ` ${n.gutter(p)}${d.length > 0 ? ` ${d}` : ""}`;
+  }).join(`
+`);
+  return t.message && !l && (c = `${" ".repeat(F + 1)}${t.message}
+${c}`), n.reset(c);
+}
+function OD(e, u, t = {}) {
+  return _D(e, u, t);
+}
+async function TD(e, u) {
+  let t = await Ze(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) {
+    ID(D, e);
+  }
+  return {
+    text: r,
+    ast: n
+  };
+}
+function ID(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 = OD(u, {
+      start: r,
+      end: n
+    }, { highlightCode: !0 });
+    e.message += `
+` + D, e.codeFrame = D;
+  }
+  throw e;
+}
+var Fe = TD;
+async function PD(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: o } = D, { getVisitorKeys: a } = 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 jD(d, f, t, r);
+  }
+  function c() {
+    let { node: d } = e;
+    if (d === null || typeof d != "object" || o?.(e)) return;
+    for (let h of a(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 jD(e, u, t, r) {
+  let n = await ie({
+    ...t,
+    ...u,
+    parentParser: t.parser,
+    originalText: e,
+    cursorOffset: void 0,
+    rangeStart: void 0,
+    rangeEnd: void 0
+  }, { passThrough: !0 }), { ast: D } = await Fe(e, n);
+  return Pu(await r(D, n));
+}
+function LD(e, u, t, r) {
+  let { originalText: n, [me]: D, locStart: i, locEnd: o, [/* @__PURE__ */ Symbol.for("printedComments")]: a } = u, { node: s } = e, l = i(s), F = o(s);
+  for (let d of D) i(d) >= l && o(d) <= F && a.add(d);
+  let { printPrettierIgnored: c } = u.printer;
+  return c ? c(e, u, t, r) : n.slice(l, F);
+}
+var $D = LD;
+async function be(e, u) {
+  ({ ast: e } = await yt(e, u));
+  let t = /* @__PURE__ */ new Map(), r = new Zr(e), n = En(u), D = /* @__PURE__ */ new Map();
+  await PD(r, o, u, be, D);
+  let i = await Au(r, u, o, void 0, D);
+  if (Cn(u), u.cursorOffset >= 0) {
+    if (u.nodeAfterCursor && !u.nodeBeforeCursor) return [Z, i];
+    if (u.nodeBeforeCursor && !u.nodeAfterCursor) return [i, Z];
+  }
+  return i;
+  function o(s, l) {
+    return s === void 0 || s === r ? a(l) : Array.isArray(s) ? r.call(() => a(l), ...s) : r.call(() => a(l), s);
+  }
+  function a(s) {
+    n(r);
+    let l = r.node;
+    if (l == null) return "";
+    let F = qe(l) && s === void 0;
+    if (F && t.has(l)) return t.get(l);
+    let c = Au(r, u, o, s, D);
+    return F && t.set(l, c), c;
+  }
+}
+function Au(e, u, t, r, n) {
+  let { node: D } = e, { printer: i } = u, o;
+  switch (i.hasPrettierIgnore?.(e) ? o = $D(e, u, t, r) : n.has(D) ? o = n.get(D) : o = i.print(e, u, t, r), D) {
+    case u.cursorNode:
+      o = de(o, (a) => [
+        Z,
+        a,
+        Z
+      ]);
+      break;
+    case u.nodeBeforeCursor:
+      o = de(o, (a) => [a, Z]);
+      break;
+    case u.nodeAfterCursor:
+      o = de(o, (a) => [Z, a]);
+  }
+  return i.printComment && Hu(D.comments) && !i.willPrintOwnComments?.(e, u) && (o = hn(e, o, u)), o;
+}
+async function yt(e, u) {
+  let t = e.comments ?? [];
+  u[me] = t, u[/* @__PURE__ */ Symbol.for("printedComments")] = /* @__PURE__ */ new Set(), on(e, u);
+  let { printer: { preprocess: r } } = u;
+  return e = r ? await r(e, u) : e, {
+    ast: e,
+    comments: t
+  };
+}
+function RD(e, u) {
+  let { cursorOffset: t, locStart: r, locEnd: n, getVisitorKeys: D } = u, i = (d) => r(d) <= t && n(d) >= t, o = e, a = [e];
+  for (let d of rn(e, {
+    getVisitorKeys: D,
+    filter: i
+  })) a.push(d), o = d;
+  if (nn(o, { getVisitorKeys: D })) return { cursorNode: o };
+  let s, l, F = -1, c = Number.POSITIVE_INFINITY;
+  for (; a.length > 0 && (s === void 0 || l === void 0); ) {
+    o = a.pop();
+    let d = s !== void 0, f = l !== void 0;
+    for (let h of Be(o, { 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 vt = RD;
+function MD(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(o, a) {
+    if (!qe(o)) return o;
+    if (Array.isArray(o)) return o.map((c) => i(c, a)).filter(Boolean);
+    let s = {}, l = new Set(n(o));
+    for (let c in o) !Ae(o, c) || D?.has(c) || (l.has(c) ? s[c] = i(o[c], o) : s[c] = o[c]);
+    let F = r(o, s, a);
+    if (F !== null) return F ?? s;
+  }
+}
+var VD = MD, WD = 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;
+}, KD = le("findLastIndex", function() {
+  if (Array.isArray(this)) return WD;
+});
+function zD(e, u) {
+  return u = new Set(u), e.find((t) => Bt.has(t.type) && u.has(t));
+}
+function bu(e) {
+  let u = KD(0, e, (t) => t.type !== "Program" && t.type !== "File");
+  return u === -1 ? e : e.slice(0, u + 1);
+}
+function UD(e, u, { locStart: t, locEnd: r }) {
+  let [n, ...D] = e, [i, ...o] = u;
+  if (n === i) return [n, i];
+  let a = t(n);
+  for (let l of bu(o)) if (t(l) >= a) i = l;
+  else break;
+  let s = r(i);
+  for (let l of bu(D)) {
+    if (r(l) <= s) n = l;
+    else break;
+    if (n === i) break;
+  }
+  return [n, i];
+}
+function Le(e, u, t, r, n = [], D, i) {
+  let { locStart: o, locEnd: a } = i, s = o(e), l = a(e);
+  if (u > l || u < s || D === "rangeEnd" && u === s || D === "rangeStart" && u === l) return;
+  let F = [e, ...n], c = Xu(e, F, {
+    cache: et,
+    locStart: o,
+    locEnd: a,
+    getVisitorKeys: t.getVisitorKeys,
+    filter: t.printer.canAttachComment,
+    getChildren: t.printer.getCommentChildNodes
+  });
+  for (let d of c) {
+    let f = Le(d, u, t, r, F, D, i);
+    if (f) return f;
+  }
+  if (r(e, n[0])) return F;
+}
+function JD(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 Bt = /* @__PURE__ */ new Set([
+  "JsonRoot",
+  "ObjectExpression",
+  "ArrayExpression",
+  "StringLiteral",
+  "NumericLiteral",
+  "BooleanLiteral",
+  "NullLiteral",
+  "UnaryExpression",
+  "TemplateLiteral"
+]), qD = /* @__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 JD(u.type, t?.type);
+    case "json":
+    case "json5":
+    case "jsonc":
+    case "json-stringify":
+      return Bt.has(u.type);
+    case "graphql":
+      return qD.has(u.kind);
+    case "vue":
+      return u.tag !== "root";
+  }
+  return !1;
+}
+function GD(e, u, t) {
+  let { rangeStart: r, rangeEnd: n } = u;
+  U(n > r);
+  let D = e.slice(r, n).search(/\S/), i = D === -1;
+  if (!i) for (r += D; n > r && !/\S/.test(e[n - 1]); --n) ;
+  let o = u.printer.features?.experimental_locForRangeFormat ?? u, a = Le(t, r, u, (f, h) => wu(u, f, h), [], "rangeStart", o);
+  if (!a) return;
+  let s = i ? a : Le(t, n, u, (f) => wu(u, f), [], "rangeEnd", o);
+  if (!s) return;
+  let l, F;
+  if (t.type === "JsonRoot") {
+    let f = zD(a, s);
+    l = f, F = f;
+  } else [l, F] = UD(a, s, u);
+  let { locStart: c, locEnd: d } = o;
+  return [Math.min(c(l), c(F)), Math.max(d(l), d(F))];
+}
+var At = "\uFEFF", ku = /* @__PURE__ */ Symbol("cursor");
+async function bt(e, u, t = 0) {
+  if (!e || e.trim().length === 0) return {
+    formatted: "",
+    cursorOffset: -1,
+    comments: []
+  };
+  let { ast: r, text: n } = await Fe(e, u);
+  u.cursorOffset >= 0 && (u = {
+    ...u,
+    ...vt(r, u)
+  });
+  let D = await be(r, u, t);
+  t > 0 && (D = $u([j, D], t, u.tabWidth));
+  let i = ve(D, u);
+  if (t > 0) {
+    let a = i.formatted.trim();
+    i.cursorNodeStart !== void 0 && (i.cursorNodeStart -= i.formatted.indexOf(a), i.cursorNodeStart < 0 && (i.cursorNodeStart = 0, i.cursorNodeText = i.cursorNodeText.trimStart()), i.cursorNodeStart + i.cursorNodeText.length > a.length && (i.cursorNodeText = i.cursorNodeText.trimEnd())), i.formatted = a + Me(u.endOfLine);
+  }
+  let o = u[me];
+  if (u.cursorOffset >= 0) {
+    let a, s, l, F;
+    if ((u.cursorNode || u.nodeBeforeCursor || u.nodeAfterCursor) && i.cursorNodeText) if (l = i.cursorNodeStart, F = i.cursorNodeText, u.cursorNode) a = u.locStart(u.cursorNode), s = n.slice(a, u.locEnd(u.cursorNode));
+    else {
+      if (!u.nodeBeforeCursor && !u.nodeAfterCursor) throw new Error("Cursor location must contain at least one of cursorNode, nodeBeforeCursor, nodeAfterCursor");
+      a = u.nodeBeforeCursor ? u.locEnd(u.nodeBeforeCursor) : 0;
+      let p = u.nodeAfterCursor ? u.locStart(u.nodeAfterCursor) : n.length;
+      s = n.slice(a, p);
+    }
+    else a = 0, s = n, l = 0, F = i.formatted;
+    let c = u.cursorOffset - a;
+    if (s === F) return {
+      formatted: i.formatted,
+      cursorOffset: l + c,
+      comments: o
+    };
+    let d = s.split("");
+    d.splice(c, 0, ku);
+    let f = Kt(d, F.split("")), h = l;
+    for (let p of f) if (p.removed) {
+      if (p.value.includes(ku)) break;
+    } else h += p.count;
+    return {
+      formatted: i.formatted,
+      cursorOffset: h,
+      comments: o
+    };
+  }
+  return {
+    formatted: i.formatted,
+    cursorOffset: -1,
+    comments: o
+  };
+}
+async function HD(e, u) {
+  let { ast: t, text: r } = await Fe(e, u), [n, D] = GD(r, u, t) ?? [0, 0], i = r.slice(n, D), o = Math.min(n, r.lastIndexOf(`
+`, n) + 1), a = r.slice(o, n).match(/^\s*/)[0], s = Je(a, u.tabWidth), l = await bt(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 = Me(u.endOfLine);
+    c >= 0 && f === `\r
+` && (c += Tu(d.slice(0, c), `
+`)), d = Ce(0, d, `
+`, f);
+  }
+  return {
+    formatted: d,
+    cursorOffset: c,
+    comments: l.comments
+  };
+}
+function Te(e, u, t) {
+  return typeof u != "number" || Number.isNaN(u) || u < 0 || u > e.length ? t : u;
+}
+function Su(e, u) {
+  let { cursorOffset: t, rangeStart: r, rangeEnd: n } = u;
+  return t = Te(e, t, -1), r = Te(e, r, 0), n = Te(e, n, e.length), {
+    ...u,
+    cursorOffset: t,
+    rangeStart: r,
+    rangeEnd: n
+  };
+}
+function wt(e, u) {
+  let { cursorOffset: t, rangeStart: r, rangeEnd: n, endOfLine: D } = Su(e, u), i = e.charAt(0) === At;
+  if (i && (e = e.slice(1), t--, r--, n--), D === "auto" && (D = qt(e)), e.includes("\r")) {
+    let o = (a) => Tu(e.slice(0, Math.max(a, 0)), `\r
+`);
+    t -= o(t), r -= o(r), n -= o(n), e = Yt(e);
+  }
+  return {
+    hasBOM: i,
+    text: e,
+    options: Su(e, {
+      ...u,
+      cursorOffset: t,
+      rangeStart: r,
+      rangeEnd: n,
+      endOfLine: D
+    })
+  };
+}
+async function xu(e, u) {
+  let t = await Ze(u);
+  return !t.hasPragma || t.hasPragma(e);
+}
+async function YD(e, u) {
+  return (await Ze(u)).hasIgnorePragma?.(e);
+}
+async function kt(e, u) {
+  let { hasBOM: t, text: r, options: n } = wt(e, await ie(u));
+  if (n.rangeStart >= n.rangeEnd && r !== "" || n.requirePragma && !await xu(r, n) || n.checkIgnorePragma && await YD(r, n)) return {
+    formatted: e,
+    cursorOffset: u.cursorOffset,
+    comments: []
+  };
+  let D;
+  return n.rangeStart > 0 || n.rangeEnd < r.length ? D = await HD(r, n) : (!n.requirePragma && n.insertPragma && n.printer.insertPragma && !await xu(r, n) && (r = n.printer.insertPragma(r)), D = await bt(r, n)), t && (D.formatted = At + D.formatted, D.cursorOffset >= 0 && D.cursorOffset++), D;
+}
+async function ZD(e, u, t) {
+  let { text: r, options: n } = wt(e, await ie(u)), D = await Fe(r, n);
+  return t && (t.preprocessForPrint && (D.ast = await yt(D.ast, n)), t.massage && (D.ast = VD(D.ast, n))), D;
+}
+async function QD(e, u) {
+  return u = await ie(u), ve(await be(e, u), u);
+}
+async function XD(e, u) {
+  let { formatted: t } = await kt(wr(e), {
+    ...u,
+    parser: "__js_expression"
+  });
+  return t;
+}
+async function ei(e, u) {
+  u = await ie(u);
+  let { ast: t } = await Fe(e, u);
+  return u.cursorOffset >= 0 && (u = {
+    ...u,
+    ...vt(t, u)
+  }), be(t, u);
+}
+async function ui(e, u) {
+  return ve(e, await ie(u));
+}
+var St = {};
+$e(St, {
+  builders: () => ti,
+  printer: () => ri,
+  utils: () => ni
+});
+var ti = {
+  join: Mu,
+  line: Vu,
+  softline: Br,
+  hardline: j,
+  literalline: Ku,
+  group: Ru,
+  conditionalGroup: mr,
+  fill: Er,
+  lineSuffix: Ie,
+  lineSuffixBoundary: Ar,
+  cursor: Z,
+  breakParent: ye,
+  ifBreak: gr,
+  trim: br,
+  indent: he,
+  indentIfBreak: yr,
+  align: De,
+  addAlignmentToDoc: $u,
+  markAsRoot: Lu,
+  dedentToRoot: hr,
+  dedent: Cr,
+  hardlineWithoutBreakParent: ze,
+  literallineWithoutBreakParent: Wu,
+  label: vr,
+  concat: (e) => e
+}, ri = { printDocToString: ve }, ni = {
+  willBreak: Dr,
+  traverseDoc: We,
+  findInDoc: Ke,
+  mapDoc: ge,
+  removeLines: or,
+  stripTrailingHardline: Pu,
+  replaceEndOfLine: cr,
+  canBreak: fr
+}, Di = "3.9.6", xt = {};
+$e(xt, {
+  addDanglingComment: () => H,
+  addLeadingComment: () => oe,
+  addTrailingComment: () => se,
+  getAlignmentSize: () => Je,
+  getIndentSize: () => ci,
+  getMaxContinuousCount: () => di,
+  getNextNonSpaceNonCommentCharacter: () => hi,
+  getNextNonSpaceNonCommentCharacterIndex: () => bi,
+  getPreferredQuote: () => mi,
+  getStringWidth: () => Ue,
+  hasNewline: () => z,
+  hasNewlineInRange: () => yi,
+  hasSpaces: () => Bi,
+  isNextLineEmpty: () => Ni,
+  isNextLineEmptyAfterIndex: () => uu,
+  isPreviousLineEmpty: () => ki,
+  makeString: () => xi,
+  skip: () => ce,
+  skipEverythingButNewLine: () => Zu,
+  skipInlineComment: () => Qe,
+  skipNewline: () => Q,
+  skipSpaces: () => J,
+  skipToLineEnd: () => Yu,
+  skipTrailingComment: () => Xe,
+  skipWhitespace: () => en
+});
+function ii(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 Qe = ii;
+function ai(e, u) {
+  return u === !1 ? !1 : e.charAt(u) === "/" && e.charAt(u + 1) === "/" ? Zu(e, u) : u;
+}
+var Xe = ai;
+function oi(e, u) {
+  let t = null, r = u;
+  for (; r !== t; ) t = r, r = J(e, r), r = Qe(e, r), r = Xe(e, r), r = Q(e, r);
+  return r;
+}
+var eu = oi;
+function si(e, u) {
+  let t = null, r = u;
+  for (; r !== t; ) t = r, r = Yu(e, r), r = Qe(e, r), r = J(e, r);
+  return r = Xe(e, r), r = Q(e, r), r !== !1 && z(e, r);
+}
+var uu = si;
+function li(e, u) {
+  let t = e.lastIndexOf(`
+`);
+  return t === -1 ? 0 : Je(e.slice(t + 1).match(/^[\t ]*/)[0], u);
+}
+var ci = li;
+function Fi(e) {
+  if (typeof e != "string") throw new TypeError("Expected a string");
+  return e.replace(/[|\\{}()[\]^$+*?.]/g, "\\$&").replace(/-/g, "\\x2d");
+}
+function fi(e, u) {
+  let t = e.matchAll(new RegExp(`(?:${Fi(u)})+`, "g"));
+  return t.reduce || (t = [...t]), t.reduce((r, [n]) => Math.max(r, n.length), 0) / u.length;
+}
+var di = fi;
+function pi(e, u) {
+  let t = eu(e, u);
+  return t === !1 ? "" : e.charAt(t);
+}
+var hi = pi, Nt = Object.freeze({
+  character: "'",
+  codePoint: 39
+}), _t = Object.freeze({
+  character: '"',
+  codePoint: 34
+}), Ci = Object.freeze({
+  preferred: Nt,
+  alternate: _t
+}), Ei = Object.freeze({
+  preferred: _t,
+  alternate: Nt
+});
+function mi(e, u) {
+  let { preferred: t, alternate: r } = u === !0 || u === "'" ? Ci : Ei, { length: n } = e, D = 0, i = 0;
+  for (let o = 0; o < n; o++) {
+    let a = e.charCodeAt(o);
+    a === t.codePoint ? D++ : a === r.codePoint && i++;
+  }
+  return (D > i ? r : t).character;
+}
+function gi(e, u, t) {
+  for (let r = u; r < t; ++r) if (e.charAt(r) === `
+`) return !0;
+  return !1;
+}
+var yi = gi;
+function vi(e, u, t = {}) {
+  return J(e, t.backwards ? u - 1 : u, t) !== u;
+}
+var Bi = vi;
+function Ai(e, u, t) {
+  return eu(e, t(u));
+}
+function bi(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? eu(e, u) : Ai(...arguments);
+}
+function wi(e, u, t) {
+  return He(e, t(u));
+}
+function ki(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? He(e, u) : wi(...arguments);
+}
+function Si(e, u, t) {
+  return uu(e, t(u));
+}
+function xi(e, u, t) {
+  let r = u === '"' ? "'" : '"';
+  return u + Ce(0, e, /\\(.)|(["'])/gs, (n, D, i) => D === r ? D : i === u ? "\\" + i : i || (t && /^[^\n\r"'0-7\\bfnrt-vx\u2028\u2029]$/.test(D) ? D : "\\" + D)) + u;
+}
+function Ni(e, u) {
+  return arguments.length === 2 || typeof u == "number" ? uu(e, u) : Si(...arguments);
+}
+function Y(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 Ot = Y(kt);
+async function Tt(e, u) {
+  let { formatted: t } = await Ot(e, {
+    ...u,
+    cursorOffset: -1
+  });
+  return t;
+}
+async function _i(e, u) {
+  return await Tt(e, u) === e;
+}
+var Oi = Y(it, 0), Ti = {
+  parse: Y(ZD),
+  formatAST: Y(QD),
+  formatDoc: Y(XD),
+  printToDoc: Y(ei),
+  printDocToString: Y(ui)
+};
+export {
+  Ti as __debug,
+  _i as check,
+  $t as default,
+  St as doc,
+  Tt as format,
+  Ot as formatWithCursor,
+  Oi as getSupportInfo,
+  xt as util,
+  Di as version
+};