n8n-editor-ui 1.62.1 → 1.63.0

package/dist/assets/{prettier-DuWRKCwA.js → prettier-eWLVZldr.js}

@@ -1,9 +1,6 @@
 var __defProp = Object.defineProperty;
 var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
-var __publicField = (obj, key, value) => {
-  __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
-  return value;
-};
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
 var yu = Object.create;
 var He = Object.defineProperty;
 var Au = Object.getOwnPropertyDescriptor;
@@ -14,12 +11,9 @@ var sr = (e) => {
 };
 var _u = (e, t) => () => (e && (t = e(e = 0)), t);
 var At = (e, t) => () => (t || e((t = { exports: {} }).exports, t), t.exports), We = (e, t) => {
-  for (var r in t)
-    He(e, r, { get: t[r], enumerable: true });
+  for (var r in t) He(e, r, { get: t[r], enumerable: true });
 }, ar = (e, t, r, n) => {
-  if (t && typeof t == "object" || typeof t == "function")
-    for (let o of Bu(t))
-      !xu.call(e, o) && o !== r && He(e, o, { get: () => t[o], enumerable: !(n = Au(t, o)) || n.enumerable });
+  if (t && typeof t == "object" || typeof t == "function") for (let o of Bu(t)) !xu.call(e, o) && o !== r && He(e, o, { get: () => t[o], enumerable: !(n = Au(t, o)) || n.enumerable });
   return e;
 };
 var Me = (e, t, r) => (r = e != null ? yu(wu(e)) : {}, ar(t || !e || !e.__esModule ? He(r, "default", { value: e, enumerable: true }) : r, e)), vu = (e) => ar(He({}, "__esModule", { value: true }), e);
@@ -50,27 +44,22 @@ var $n = At((Ct) => {
   Ct.default = To;
   var In = (kn(), vu(Tn)), Hn = vo(Pn(), true);
   function Wn(e) {
-    if (typeof WeakMap != "function")
-      return null;
+    if (typeof WeakMap != "function") return null;
     var t = /* @__PURE__ */ new WeakMap(), r = /* @__PURE__ */ new WeakMap();
     return (Wn = function(n) {
       return n ? r : t;
     })(e);
   }
   function vo(e, t) {
-    if (!t && e && e.__esModule)
-      return e;
-    if (e === null || typeof e != "object" && typeof e != "function")
-      return { default: e };
+    if (!t && e && e.__esModule) return e;
+    if (e === null || typeof e != "object" && typeof e != "function") return { default: e };
     var r = Wn(t);
-    if (r && r.has(e))
-      return r.get(e);
+    if (r && r.has(e)) return r.get(e);
     var n = { __proto__: null }, o = Object.defineProperty && Object.getOwnPropertyDescriptor;
-    for (var u in e)
-      if (u !== "default" && {}.hasOwnProperty.call(e, u)) {
-        var i = o ? Object.getOwnPropertyDescriptor(e, u) : null;
-        i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u];
-      }
+    for (var u in e) if (u !== "default" && {}.hasOwnProperty.call(e, u)) {
+      var i = o ? Object.getOwnPropertyDescriptor(e, u) : null;
+      i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u];
+    }
     return n.default = e, r && r.set(e, n), n;
   }
   var bo = Hn.default, Rn = (e, t) => (r) => e(t(r)), Zt;
@@ -90,23 +79,19 @@ var $n = At((Ct) => {
     let n = Object.assign({ column: 0, line: -1 }, e.start), o = Object.assign({}, n, e.end), { linesAbove: u = 2, linesBelow: i = 3 } = r || {}, s = n.line, a = n.column, D = o.line, l = o.column, d = Math.max(s - (u + 1), 0), f = Math.min(t.length, D + i);
     s === -1 && (d = 0), D === -1 && (f = t.length);
     let p = D - s, c = {};
-    if (p)
-      for (let F = 0; F <= p; F++) {
-        let m = F + s;
-        if (!a)
-          c[m] = true;
-        else if (F === 0) {
-          let E = t[m - 1].length;
-          c[m] = [a, E - a + 1];
-        } else if (F === p)
-          c[m] = [0, l];
-        else {
-          let E = t[m - F].length;
-          c[m] = [0, E];
-        }
+    if (p) for (let F = 0; F <= p; F++) {
+      let m = F + s;
+      if (!a) c[m] = true;
+      else if (F === 0) {
+        let E = t[m - 1].length;
+        c[m] = [a, E - a + 1];
+      } else if (F === p) c[m] = [0, l];
+      else {
+        let E = t[m - F].length;
+        c[m] = [0, E];
       }
-    else
-      a === l ? a ? c[s] = [a, 0] : c[s] = true : c[s] = [a, l - a];
+    }
+    else a === l ? a ? c[s] = [a, 0] : c[s] = true : c[s] = [a, l - a];
     return { start: d, end: f, markerLines: c };
   }
   function Mn(e, t, r = {}) {
@@ -120,8 +105,7 @@ var $n = At((Ct) => {
  `, i(u.gutter, w.replace(/\d/g, " ")), " ", v, i(u.marker, "^").repeat($)].join(""), C && r.message && (k += " " + i(u.message, r.message));
         }
         return [i(u.marker, ">"), i(u.gutter, w), F.length > 0 ? ` ${F}` : "", k].join("");
-      } else
-        return ` ${i(u.gutter, w)}${F.length > 0 ? ` ${F}` : ""}`;
+      } else return ` ${i(u.gutter, w)}${F.length > 0 ? ` ${F}` : ""}`;
     }).join(`
 `);
     return r.message && !d && (c = `${" ".repeat(f + 1)}${r.message}
@@ -142,8 +126,7 @@ ${c}`), n ? o.reset(c) : c;
 var ir = {};
 We(ir, { __debug: () => di, check: () => fi, doc: () => nr, format: () => gu, formatWithCursor: () => Cu, getSupportInfo: () => pi, util: () => or, version: () => fu });
 var Ou = (e, t, r, n) => {
-  if (!(e && t == null))
-    return t.replaceAll ? t.replaceAll(r, n) : r.global ? t.replace(r, n) : t.split(r).join(n);
+  if (!(e && t == null)) return t.replaceAll ? t.replaceAll(r, n) : r.global ? t.replace(r, n) : t.split(r).join(n);
 }, ne = Ou;
 function Z() {
 }
@@ -160,8 +143,7 @@ Z.prototype = { diff: function(t, r) {
   var a = r.length, D = t.length, l = 1, d = a + D;
   o.maxEditLength && (d = Math.min(d, o.maxEditLength));
   var f = (n = o.timeout) !== null && n !== void 0 ? n : 1 / 0, p = Date.now() + f, c = [{ oldPos: -1, lastComponent: void 0 }], F = this.extractCommon(c[0], r, t, 0);
-  if (c[0].oldPos + 1 >= D && F + 1 >= a)
-    return s([{ value: this.join(r), count: r.length }]);
+  if (c[0].oldPos + 1 >= D && F + 1 >= a) return s([{ value: this.join(r), count: r.length }]);
   var m = -1 / 0, E = 1 / 0;
   function A() {
     for (var h = Math.max(m, -l); h <= Math.min(E, l); h += 2) {
@@ -177,38 +159,31 @@ Z.prototype = { diff: function(t, r) {
         c[h] = void 0;
         continue;
       }
-      if (!yt || $ && k.oldPos + 1 < v.oldPos ? C = i.addToPath(v, true, void 0, 0) : C = i.addToPath(k, void 0, true, 1), F = i.extractCommon(C, r, t, h), C.oldPos + 1 >= D && F + 1 >= a)
-        return s(Su(i, C.lastComponent, r, t, i.useLongestToken));
+      if (!yt || $ && k.oldPos + 1 < v.oldPos ? C = i.addToPath(v, true, void 0, 0) : C = i.addToPath(k, void 0, true, 1), F = i.extractCommon(C, r, t, h), C.oldPos + 1 >= D && F + 1 >= a) return s(Su(i, C.lastComponent, r, t, i.useLongestToken));
       c[h] = C, C.oldPos + 1 >= D && (E = Math.min(E, h - 1)), F + 1 >= a && (m = Math.max(m, h + 1));
     }
     l++;
   }
-  if (u)
-    (function h() {
-      setTimeout(function() {
-        if (l > d || Date.now() > p)
-          return u();
-        A() || h();
-      }, 0);
-    })();
-  else
-    for (; l <= d && Date.now() <= p; ) {
-      var w = A();
-      if (w)
-        return w;
-    }
+  if (u) (function h() {
+    setTimeout(function() {
+      if (l > d || Date.now() > p) return u();
+      A() || h();
+    }, 0);
+  })();
+  else for (; l <= d && Date.now() <= p; ) {
+    var w = A();
+    if (w) return w;
+  }
 }, addToPath: function(t, r, n, o) {
   var u = t.lastComponent;
   return u && u.added === r && u.removed === n ? { oldPos: t.oldPos + o, lastComponent: { count: u.count + 1, added: r, removed: n, previousComponent: u.previousComponent } } : { oldPos: t.oldPos + o, lastComponent: { count: 1, added: r, removed: n, previousComponent: u } };
 }, extractCommon: function(t, r, n, o) {
-  for (var u = r.length, i = n.length, s = t.oldPos, a = s - o, D = 0; a + 1 < u && s + 1 < i && this.equals(r[a + 1], n[s + 1]); )
-    a++, s++, D++;
+  for (var u = r.length, i = n.length, s = t.oldPos, a = s - o, D = 0; a + 1 < u && s + 1 < i && this.equals(r[a + 1], n[s + 1]); ) a++, s++, D++;
   return D && (t.lastComponent = { count: D, previousComponent: t.lastComponent }), t.oldPos = s, a;
 }, equals: function(t, r) {
   return this.options.comparator ? this.options.comparator(t, r) : t === r || this.options.ignoreCase && t.toLowerCase() === r.toLowerCase();
 }, removeEmpty: function(t) {
-  for (var r = [], n = 0; n < t.length; n++)
-    t[n] && r.push(t[n]);
+  for (var r = [], n = 0; n < t.length; n++) t[n] && r.push(t[n]);
   return r;
 }, castInput: function(t) {
   return t;
@@ -218,8 +193,7 @@ Z.prototype = { diff: function(t, r) {
   return t.join("");
 } };
 function Su(e, t, r, n, o) {
-  for (var u = [], i; t; )
-    u.push(t), i = t.previousComponent, delete t.previousComponent, t = i;
+  for (var u = [], i; t; ) u.push(t), i = t.previousComponent, delete t.previousComponent, t = i;
   u.reverse();
   for (var s = 0, a = u.length, D = 0, l = 0; s < a; s++) {
     var d = u[s];
@@ -235,8 +209,7 @@ function Su(e, t, r, n, o) {
           var E = n[l + m];
           return E.length > F.length ? E : F;
         }), d.value = e.join(f);
-      } else
-        d.value = e.join(r.slice(D, D + d.count));
+      } else d.value = e.join(r.slice(D, D + d.count));
       D += d.count, d.added || (l += d.count);
     }
   }
@@ -249,8 +222,7 @@ fr.equals = function(e, t) {
   return this.options.ignoreCase && (e = e.toLowerCase(), t = t.toLowerCase()), e === t || this.options.ignoreWhitespace && !cr.test(e) && !cr.test(t);
 };
 fr.tokenize = function(e) {
-  for (var t = e.split(/([^\S\r\n]+|[()[\]{}'"\r\n]|\b)/), r = 0; r < t.length - 1; r++)
-    !t[r + 1] && t[r + 2] && lr.test(t[r]) && lr.test(t[r + 2]) && (t[r] += t[r + 2], t.splice(r + 1, 2), r--);
+  for (var t = e.split(/([^\S\r\n]+|[()[\]{}'"\r\n]|\b)/), r = 0; r < t.length - 1; r++) !t[r + 1] && t[r + 2] && lr.test(t[r]) && lr.test(t[r + 2]) && (t[r] += t[r + 2], t.splice(r + 1, 2), r--);
   return t;
 };
 var pr = new Z();
@@ -296,25 +268,19 @@ Ae.equals = function(e, t) {
 function Bt(e, t, r, n, o) {
   t = t || [], r = r || [], n && (e = n(o, e));
   var u;
-  for (u = 0; u < t.length; u += 1)
-    if (t[u] === e)
-      return r[u];
+  for (u = 0; u < t.length; u += 1) if (t[u] === e) return r[u];
   var i;
   if (ku.call(e) === "[object Array]") {
-    for (t.push(e), i = new Array(e.length), r.push(i), u = 0; u < e.length; u += 1)
-      i[u] = Bt(e[u], t, r, n, o);
+    for (t.push(e), i = new Array(e.length), r.push(i), u = 0; u < e.length; u += 1) i[u] = Bt(e[u], t, r, n, o);
     return t.pop(), r.pop(), i;
   }
   if (e && e.toJSON && (e = e.toJSON()), $e(e) === "object" && e !== null) {
     t.push(e), i = {}, r.push(i);
     var s = [], a;
-    for (a in e)
-      e.hasOwnProperty(a) && s.push(a);
-    for (s.sort(), u = 0; u < s.length; u += 1)
-      a = s[u], i[a] = Bt(e[a], t, r, n, a);
+    for (a in e) e.hasOwnProperty(a) && s.push(a);
+    for (s.sort(), u = 0; u < s.length; u += 1) a = s[u], i[a] = Bt(e[a], t, r, n, a);
     t.pop(), r.pop();
-  } else
-    i = e;
+  } else i = e;
   return i;
 }
 var Ve = new Z();
@@ -370,28 +336,21 @@ function mr(e) {
 }
 var U = "string", W = "array", z = "cursor", L = "indent", P = "align", I = "trim", x = "group", S = "fill", _ = "if-break", R = "indent-if-break", Y = "line-suffix", j = "line-suffix-boundary", B = "line", N = "label", b = "break-parent", Ue = /* @__PURE__ */ new Set([z, L, P, I, x, S, _, R, Y, j, B, N, b]);
 function Lu(e) {
-  if (typeof e == "string")
-    return U;
-  if (Array.isArray(e))
-    return W;
-  if (!e)
-    return;
+  if (typeof e == "string") return U;
+  if (Array.isArray(e)) return W;
+  if (!e) return;
   let { type: t } = e;
-  if (Ue.has(t))
-    return t;
+  if (Ue.has(t)) return t;
 }
 var G = Lu;
 var Pu = (e) => new Intl.ListFormat("en-US", { type: "disjunction" }).format(e);
 function Iu(e) {
   let t = e === null ? "null" : typeof e;
-  if (t !== "string" && t !== "object")
-    return `Unexpected doc '${t}', 
+  if (t !== "string" && t !== "object") return `Unexpected doc '${t}', 
 Expected it to be 'string' or 'object'.`;
-  if (G(e))
-    throw new Error("doc is valid.");
+  if (G(e)) throw new Error("doc is valid.");
   let r = Object.prototype.toString.call(e);
-  if (r !== "[object Object]")
-    return `Unexpected doc '${r}'.`;
+  if (r !== "[object Object]") return `Unexpected doc '${r}'.`;
   let n = Pu([...Ue].map((o) => `'${o}'`));
   return `Unexpected doc.type '${e.type}'.
 Expected it to be ${n}.`;
@@ -414,44 +373,38 @@ function Ru(e, t, r, n) {
     }
     r && o.push(u, Er);
     let i = G(u);
-    if (!i)
-      throw new Q(u);
-    if ((t == null ? void 0 : t(u)) !== false)
-      switch (i) {
-        case W:
-        case S: {
-          let s = i === W ? u : u.parts;
-          for (let a = s.length, D = a - 1; D >= 0; --D)
-            o.push(s[D]);
-          break;
-        }
-        case _:
-          o.push(u.flatContents, u.breakContents);
-          break;
-        case x:
-          if (n && u.expandedStates)
-            for (let s = u.expandedStates.length, a = s - 1; a >= 0; --a)
-              o.push(u.expandedStates[a]);
-          else
-            o.push(u.contents);
-          break;
-        case P:
-        case L:
-        case R:
-        case N:
-        case Y:
-          o.push(u.contents);
-          break;
-        case U:
-        case z:
-        case I:
-        case j:
-        case B:
-        case b:
-          break;
-        default:
-          throw new Q(u);
+    if (!i) throw new Q(u);
+    if ((t == null ? void 0 : t(u)) !== false) switch (i) {
+      case W:
+      case S: {
+        let s = i === W ? u : u.parts;
+        for (let a = s.length, D = a - 1; D >= 0; --D) o.push(s[D]);
+        break;
       }
+      case _:
+        o.push(u.flatContents, u.breakContents);
+        break;
+      case x:
+        if (n && u.expandedStates) for (let s = u.expandedStates.length, a = s - 1; a >= 0; --a) o.push(u.expandedStates[a]);
+        else o.push(u.contents);
+        break;
+      case P:
+      case L:
+      case R:
+      case N:
+      case Y:
+        o.push(u.contents);
+        break;
+      case U:
+      case z:
+      case I:
+      case j:
+      case B:
+      case b:
+        break;
+      default:
+        throw new Q(u);
+    }
   }
 }
 var we = Ru;
@@ -494,16 +447,14 @@ var xr = { type: j }, de = { type: b }, _r = { type: I }, _e = { type: B, hard:
 function be(e, t) {
   K(e), ze(t);
   let r = [];
-  for (let n = 0; n < t.length; n++)
-    n !== 0 && r.push(e), r.push(t[n]);
+  for (let n = 0; n < t.length; n++) n !== 0 && r.push(e), r.push(t[n]);
   return r;
 }
 function Je(e, t, r) {
   K(e);
   let n = e;
   if (t > 0) {
-    for (let o = 0; o < Math.floor(t / r); ++o)
-      n = De(n);
+    for (let o = 0; o < Math.floor(t / r); ++o) n = De(n);
     n = ae(t % r, n), n = ae(Number.NEGATIVE_INFINITY, n);
   }
   return n;
@@ -513,17 +464,14 @@ function br(e, t) {
 }
 function ee(e) {
   var t;
-  if (!e)
-    return "";
+  if (!e) return "";
   if (Array.isArray(e)) {
     let r = [];
-    for (let n of e)
-      if (Array.isArray(n))
-        r.push(...ee(n));
-      else {
-        let o = ee(n);
-        o !== "" && r.push(o);
-      }
+    for (let n of e) if (Array.isArray(n)) r.push(...ee(n));
+    else {
+      let o = ee(n);
+      o !== "" && r.push(o);
+    }
     return r;
   }
   return e.type === _ ? { ...e, breakContents: ee(e.breakContents), flatContents: ee(e.flatContents) } : e.type === x ? { ...e, contents: ee(e.contents), expandedStates: (t = e.expandedStates) == null ? void 0 : t.map(ee) } : e.type === S ? { type: "fill", parts: e.parts.map(ee) } : e.contents ? { ...e, contents: ee(e.contents) } : e;
@@ -533,8 +481,7 @@ function Or(e) {
   return n(ee(e));
   function n(u, i, s) {
     var a, D;
-    if (typeof u == "string")
-      return JSON.stringify(u);
+    if (typeof u == "string") return JSON.stringify(u);
     if (Array.isArray(u)) {
       let l = u.map(n).filter(Boolean);
       return l.length === 1 ? l[0] : `[${l.join(", ")}]`;
@@ -543,16 +490,11 @@ function Or(e) {
       let l = ((a = s == null ? void 0 : s[i + 1]) == null ? void 0 : a.type) === b;
       return u.literal ? l ? "literalline" : "literallineWithoutBreakParent" : u.hard ? l ? "hardline" : "hardlineWithoutBreakParent" : u.soft ? "softline" : "line";
     }
-    if (u.type === b)
-      return ((D = s == null ? void 0 : s[i - 1]) == null ? void 0 : D.type) === B && s[i - 1].hard ? void 0 : "breakParent";
-    if (u.type === I)
-      return "trim";
-    if (u.type === L)
-      return "indent(" + n(u.contents) + ")";
-    if (u.type === P)
-      return u.n === Number.NEGATIVE_INFINITY ? "dedentToRoot(" + n(u.contents) + ")" : u.n < 0 ? "dedent(" + n(u.contents) + ")" : u.n.type === "root" ? "markAsRoot(" + n(u.contents) + ")" : "align(" + JSON.stringify(u.n) + ", " + n(u.contents) + ")";
-    if (u.type === _)
-      return "ifBreak(" + n(u.breakContents) + (u.flatContents ? ", " + n(u.flatContents) : "") + (u.groupId ? (u.flatContents ? "" : ', ""') + `, { groupId: ${o(u.groupId)} }` : "") + ")";
+    if (u.type === b) return ((D = s == null ? void 0 : s[i - 1]) == null ? void 0 : D.type) === B && s[i - 1].hard ? void 0 : "breakParent";
+    if (u.type === I) return "trim";
+    if (u.type === L) return "indent(" + n(u.contents) + ")";
+    if (u.type === P) return u.n === Number.NEGATIVE_INFINITY ? "dedentToRoot(" + n(u.contents) + ")" : u.n < 0 ? "dedent(" + n(u.contents) + ")" : u.n.type === "root" ? "markAsRoot(" + n(u.contents) + ")" : "align(" + JSON.stringify(u.n) + ", " + n(u.contents) + ")";
+    if (u.type === _) return "ifBreak(" + n(u.breakContents) + (u.flatContents ? ", " + n(u.flatContents) : "") + (u.groupId ? (u.flatContents ? "" : ', ""') + `, { groupId: ${o(u.groupId)} }` : "") + ")";
     if (u.type === R) {
       let l = [];
       u.negate && l.push("negate: true"), u.groupId && l.push(`groupId: ${o(u.groupId)}`);
@@ -565,32 +507,24 @@ function Or(e) {
       let d = l.length > 0 ? `, { ${l.join(", ")} }` : "";
       return u.expandedStates ? `conditionalGroup([${u.expandedStates.map((f) => n(f)).join(",")}]${d})` : `group(${n(u.contents)}${d})`;
     }
-    if (u.type === S)
-      return `fill([${u.parts.map((l) => n(l)).join(", ")}])`;
-    if (u.type === Y)
-      return "lineSuffix(" + n(u.contents) + ")";
-    if (u.type === j)
-      return "lineSuffixBoundary";
-    if (u.type === N)
-      return `label(${JSON.stringify(u.label)}, ${n(u.contents)})`;
+    if (u.type === S) return `fill([${u.parts.map((l) => n(l)).join(", ")}])`;
+    if (u.type === Y) return "lineSuffix(" + n(u.contents) + ")";
+    if (u.type === j) return "lineSuffixBoundary";
+    if (u.type === N) return `label(${JSON.stringify(u.label)}, ${n(u.contents)})`;
     throw new Error("Unknown doc type " + u.type);
   }
   function o(u) {
-    if (typeof u != "symbol")
-      return JSON.stringify(String(u));
-    if (u in t)
-      return t[u];
+    if (typeof u != "symbol") return JSON.stringify(String(u));
+    if (u in t) return t[u];
     let i = u.description || "symbol";
     for (let s = 0; ; s++) {
       let a = i + (s > 0 ? ` #${s}` : "");
-      if (!r.has(a))
-        return r.add(a), t[u] = `Symbol.for(${JSON.stringify(a)})`;
+      if (!r.has(a)) return r.add(a), t[u] = `Symbol.for(${JSON.stringify(a)})`;
     }
   }
 }
 var Yu = (e, t, r) => {
-  if (!(e && t == null))
-    return Array.isArray(t) || typeof t == "string" ? t[r < 0 ? t.length + r : r] : t.at(r);
+  if (!(e && t == null)) return Array.isArray(t) || typeof t == "string" ? t[r < 0 ? t.length + r : r] : t.at(r);
 }, y = Yu;
 var Sr = () => /[#*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](?:\uFE0F|\uD83C[\uDFFB-\uDFFF])?|[\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(?:\uFE0F|\uD83C[\uDFFB-\uDFFF])?(?:\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](?:\uFE0F|\uD83C[\uDFFB-\uDFFF])?(?:\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-\uDDF5\uDDF7\uDDFA-\uDDFF]|\uDDE9\uD83C[\uDDEA\uDDEC\uDDEF\uDDF0\uDDF2\uDDF4\uDDFF]|\uDDEA\uD83C[\uDDE6\uDDE8\uDDEA\uDDEC\uDDED\uDDF7-\uDDFA]|\uDDEB\uD83C[\uDDEE-\uDDF0\uDDF2\uDDF4\uDDF7]|\uDDEC\uD83C[\uDDE6\uDDE7\uDDE9-\uDDEE\uDDF1-\uDDF3\uDDF5-\uDDFA\uDDFC\uDDFE]|\uDDED\uD83C[\uDDF0\uDDF2\uDDF3\uDDF7\uDDF9\uDDFA]|\uDDEE\uD83C[\uDDE8-\uDDEA\uDDF1-\uDDF4\uDDF6-\uDDF9]|\uDDEF\uD83C[\uDDEA\uDDF2\uDDF4\uDDF5]|\uDDF0\uD83C[\uDDEA\uDDEC-\uDDEE\uDDF2\uDDF3\uDDF5\uDDF7\uDDFC\uDDFE\uDDFF]|\uDDF1\uD83C[\uDDE6-\uDDE8\uDDEE\uDDF0\uDDF7-\uDDFB\uDDFE]|\uDDF2\uD83C[\uDDE6\uDDE8-\uDDED\uDDF0-\uDDFF]|\uDDF3\uD83C[\uDDE6\uDDE8\uDDEA-\uDDEC\uDDEE\uDDF1\uDDF4\uDDF5\uDDF7\uDDFA\uDDFF]|\uDDF4\uD83C\uDDF2|\uDDF5\uD83C[\uDDE6\uDDEA-\uDDED\uDDF0-\uDDF3\uDDF7-\uDDF9\uDDFC\uDDFE]|\uDDF6\uD83C\uDDE6|\uDDF7\uD83C[\uDDEA\uDDF4\uDDF8\uDDFA\uDDFC]|\uDDF8\uD83C[\uDDE6-\uDDEA\uDDEC-\uDDF4\uDDF7-\uDDF9\uDDFB\uDDFD-\uDDFF]|\uDDF9\uD83C[\uDDE6\uDDE8\uDDE9\uDDEB-\uDDED\uDDEF-\uDDF4\uDDF7\uDDF9\uDDFB\uDDFC\uDDFF]|\uDDFA\uD83C[\uDDE6\uDDEC\uDDF2\uDDF3\uDDF8\uDDFE\uDDFF]|\uDDFB\uD83C[\uDDE6\uDDE8\uDDEA\uDDEC\uDDEE\uDDF3\uDDFA]|\uDDFC\uD83C[\uDDEB\uDDF8]|\uDDFD\uD83C\uDDF0|\uDDFE\uD83C[\uDDEA\uDDF9]|\uDDFF\uD83C[\uDDE6\uDDF2\uDDFC]|\uDF44(?:\u200D\uD83D\uDFEB)?|\uDF4B(?:\u200D\uD83D\uDFE9)?|\uDFC3(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?|\uDFF3\uFE0F?(?:\u200D(?:\u26A7\uFE0F?|\uD83C\uDF08))?|\uDFF4(?:\u200D\u2620\uFE0F?|\uDB40\uDC67\uDB40\uDC62\uDB40(?:\uDC65\uDB40\uDC6E\uDB40\uDC67|\uDC73\uDB40\uDC63\uDB40\uDC74|\uDC77\uDB40\uDC6C\uDB40\uDC73)\uDB40\uDC7F)?)|\uD83D(?:[\uDC3F\uDCFD\uDD49\uDD4A\uDD6F\uDD70\uDD73\uDD76-\uDD79\uDD87\uDD8A-\uDD8D\uDDA5\uDDA8\uDDB1\uDDB2\uDDBC\uDDC2-\uDDC4\uDDD1-\uDDD3\uDDDC-\uDDDE\uDDE1\uDDE3\uDDE8\uDDEF\uDDF3\uDDFA\uDECB\uDECD-\uDECF\uDEE0-\uDEE5\uDEE9\uDEF0\uDEF3]\uFE0F?|[\uDC42\uDC43\uDC46-\uDC50\uDC66\uDC67\uDC6B-\uDC6D\uDC72\uDC74-\uDC76\uDC78\uDC7C\uDC83\uDC85\uDC8F\uDC91\uDCAA\uDD7A\uDD95\uDD96\uDE4C\uDE4F\uDEC0\uDECC](?:\uD83C[\uDFFB-\uDFFF])?|[\uDC6E\uDC70\uDC71\uDC73\uDC77\uDC81\uDC82\uDC86\uDC87\uDE45-\uDE47\uDE4B\uDE4D\uDE4E\uDEA3\uDEB4\uDEB5](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDD74\uDD90](?:\uFE0F|\uD83C[\uDFFB-\uDFFF])?|[\uDC00-\uDC07\uDC09-\uDC14\uDC16-\uDC25\uDC27-\uDC3A\uDC3C-\uDC3E\uDC40\uDC44\uDC45\uDC51-\uDC65\uDC6A\uDC79-\uDC7B\uDC7D-\uDC80\uDC84\uDC88-\uDC8E\uDC90\uDC92-\uDCA9\uDCAB-\uDCFC\uDCFF-\uDD3D\uDD4B-\uDD4E\uDD50-\uDD67\uDDA4\uDDFB-\uDE2D\uDE2F-\uDE34\uDE37-\uDE41\uDE43\uDE44\uDE48-\uDE4A\uDE80-\uDEA2\uDEA4-\uDEB3\uDEB7-\uDEBF\uDEC1-\uDEC5\uDED0-\uDED2\uDED5-\uDED7\uDEDC-\uDEDF\uDEEB\uDEEC\uDEF4-\uDEFC\uDFE0-\uDFEB\uDFF0]|\uDC08(?:\u200D\u2B1B)?|\uDC15(?:\u200D\uD83E\uDDBA)?|\uDC26(?:\u200D(?:\u2B1B|\uD83D\uDD25))?|\uDC3B(?:\u200D\u2744\uFE0F?)?|\uDC41\uFE0F?(?:\u200D\uD83D\uDDE8\uFE0F?)?|\uDC68(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D(?:[\uDC68\uDC69]\u200D\uD83D(?:\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?)|[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?)|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFC-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFD-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFD\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?\uDC68\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D\uDC68\uD83C[\uDFFB-\uDFFE])))?))?|\uDC69(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:\uDC8B\u200D\uD83D)?[\uDC68\uDC69]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D(?:[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?|\uDC69\u200D\uD83D(?:\uDC66(?:\u200D\uD83D\uDC66)?|\uDC67(?:\u200D\uD83D[\uDC66\uDC67])?))|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFC-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFD-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFD\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D\uD83D(?:[\uDC68\uDC69]|\uDC8B\u200D\uD83D[\uDC68\uDC69])\uD83C[\uDFFB-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83D[\uDC68\uDC69]\uD83C[\uDFFB-\uDFFE])))?))?|\uDC6F(?:\u200D[\u2640\u2642]\uFE0F?)?|\uDD75(?:\uFE0F|\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|\uDE2E(?:\u200D\uD83D\uDCA8)?|\uDE35(?:\u200D\uD83D\uDCAB)?|\uDE36(?:\u200D\uD83C\uDF2B\uFE0F?)?|\uDE42(?:\u200D[\u2194\u2195]\uFE0F?)?|\uDEB6(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?)|\uD83E(?:[\uDD0C\uDD0F\uDD18-\uDD1F\uDD30-\uDD34\uDD36\uDD77\uDDB5\uDDB6\uDDBB\uDDD2\uDDD3\uDDD5\uDEC3-\uDEC5\uDEF0\uDEF2-\uDEF8](?:\uD83C[\uDFFB-\uDFFF])?|[\uDD26\uDD35\uDD37-\uDD39\uDD3D\uDD3E\uDDB8\uDDB9\uDDCD\uDDCF\uDDD4\uDDD6-\uDDDD](?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDDDE\uDDDF](?:\u200D[\u2640\u2642]\uFE0F?)?|[\uDD0D\uDD0E\uDD10-\uDD17\uDD20-\uDD25\uDD27-\uDD2F\uDD3A\uDD3F-\uDD45\uDD47-\uDD76\uDD78-\uDDB4\uDDB7\uDDBA\uDDBC-\uDDCC\uDDD0\uDDE0-\uDDFF\uDE70-\uDE7C\uDE80-\uDE88\uDE90-\uDEBD\uDEBF-\uDEC2\uDECE-\uDEDB\uDEE0-\uDEE8]|\uDD3C(?:\u200D[\u2640\u2642]\uFE0F?|\uD83C[\uDFFB-\uDFFF])?|\uDDCE(?:\uD83C[\uDFFB-\uDFFF])?(?:\u200D(?:[\u2640\u2642]\uFE0F?(?:\u200D\u27A1\uFE0F?)?|\u27A1\uFE0F?))?|\uDDD1(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1|\uDDD1\u200D\uD83E\uDDD2(?:\u200D\uD83E\uDDD2)?|\uDDD2(?:\u200D\uD83E\uDDD2)?))|\uD83C(?:\uDFFB(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFC-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFC(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB\uDFFD-\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFD(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFE(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB-\uDFFD\uDFFF]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?|\uDFFF(?:\u200D(?:[\u2695\u2696\u2708]\uFE0F?|\u2764\uFE0F?\u200D(?:\uD83D\uDC8B\u200D)?\uD83E\uDDD1\uD83C[\uDFFB-\uDFFE]|\uD83C[\uDF3E\uDF73\uDF7C\uDF84\uDF93\uDFA4\uDFA8\uDFEB\uDFED]|\uD83D[\uDCBB\uDCBC\uDD27\uDD2C\uDE80\uDE92]|\uD83E(?:[\uDDAF\uDDBC\uDDBD](?:\u200D\u27A1\uFE0F?)?|[\uDDB0-\uDDB3]|\uDD1D\u200D\uD83E\uDDD1\uD83C[\uDFFB-\uDFFF])))?))?|\uDEF1(?:\uD83C(?:\uDFFB(?:\u200D\uD83E\uDEF2\uD83C[\uDFFC-\uDFFF])?|\uDFFC(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB\uDFFD-\uDFFF])?|\uDFFD(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB\uDFFC\uDFFE\uDFFF])?|\uDFFE(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB-\uDFFD\uDFFF])?|\uDFFF(?:\u200D\uD83E\uDEF2\uD83C[\uDFFB-\uDFFE])?))?)/g;
 function Nr(e) {
@@ -602,10 +536,8 @@ function Tr(e) {
 var kr = (e) => !(Nr(e) || Tr(e));
 var ju = /[^\x20-\x7F]/u;
 function Hu(e) {
-  if (!e)
-    return 0;
-  if (!ju.test(e))
-    return e.length;
+  if (!e) return 0;
+  if (!ju.test(e)) return e.length;
   e = e.replace(Sr(), "  ");
   let t = 0;
   for (let r of e) {
@@ -616,13 +548,11 @@ function Hu(e) {
 }
 var Oe = Hu;
 function Ne(e, t) {
-  if (typeof e == "string")
-    return t(e);
+  if (typeof e == "string") return t(e);
   let r = /* @__PURE__ */ new Map();
   return n(e);
   function n(u) {
-    if (r.has(u))
-      return r.get(u);
+    if (r.has(u)) return r.get(u);
     let i = o(u);
     return r.set(u, i), i;
   }
@@ -659,16 +589,14 @@ function Ne(e, t) {
 function Xe(e, t, r) {
   let n = r, o = false;
   function u(i) {
-    if (o)
-      return false;
+    if (o) return false;
     let s = t(i);
     s !== void 0 && (o = true, n = s);
   }
   return we(e, u), n;
 }
 function Wu(e) {
-  if (e.type === x && e.break || e.type === B && e.hard || e.type === b)
-    return true;
+  if (e.type === x && e.break || e.type === B && e.hard || e.type === b) return true;
 }
 function Ir(e) {
   return Xe(e, Wu, false);
@@ -684,8 +612,7 @@ function Rr(e) {
   let t = /* @__PURE__ */ new Set(), r = [];
   function n(u) {
     if (u.type === b && Lr(r), u.type === x) {
-      if (r.push(u), t.has(u))
-        return false;
+      if (r.push(u), t.has(u)) return false;
       t.add(u);
     }
   }
@@ -701,8 +628,7 @@ function Yr(e) {
   return Ne(e, Mu);
 }
 function Pr(e) {
-  for (e = [...e]; e.length >= 2 && y(false, e, -2).type === B && y(false, e, -1).type === b; )
-    e.length -= 2;
+  for (e = [...e]; e.length >= 2 && y(false, e, -2).type === B && y(false, e, -1).type === b; ) e.length -= 2;
   if (e.length > 0) {
     let t = Se(y(false, e, -1));
     e[e.length - 1] = t;
@@ -745,31 +671,25 @@ function Ze(e) {
 function $u(e) {
   switch (G(e)) {
     case S:
-      if (e.parts.every((t) => t === ""))
-        return "";
+      if (e.parts.every((t) => t === "")) return "";
       break;
     case x:
-      if (!e.contents && !e.id && !e.break && !e.expandedStates)
-        return "";
-      if (e.contents.type === x && e.contents.id === e.id && e.contents.break === e.break && e.contents.expandedStates === e.expandedStates)
-        return e.contents;
+      if (!e.contents && !e.id && !e.break && !e.expandedStates) return "";
+      if (e.contents.type === x && e.contents.id === e.id && e.contents.break === e.break && e.contents.expandedStates === e.expandedStates) return e.contents;
       break;
     case P:
     case L:
     case R:
     case Y:
-      if (!e.contents)
-        return "";
+      if (!e.contents) return "";
       break;
     case _:
-      if (!e.flatContents && !e.breakContents)
-        return "";
+      if (!e.flatContents && !e.breakContents) return "";
       break;
     case W: {
       let t = [];
       for (let r of e) {
-        if (!r)
-          continue;
+        if (!r) continue;
         let [n, ...o] = Array.isArray(r) ? r : [r];
         typeof n == "string" && typeof y(false, t, -1) == "string" ? t[t.length - 1] += n : t.push(n), t.push(...o);
       }
@@ -796,8 +716,7 @@ function jr(e, t = qe) {
 `)) : r);
 }
 function Uu(e) {
-  if (e.type === B)
-    return true;
+  if (e.type === B) return true;
 }
 function Hr(e) {
   return Xe(e, Uu, false);
@@ -817,20 +736,19 @@ function Gu(e, t, r) {
 }
 function bt(e, t, r) {
   let n = t.type === "dedent" ? e.queue.slice(0, -1) : [...e.queue, t], o = "", u = 0, i = 0, s = 0;
-  for (let c of n)
-    switch (c.type) {
-      case "indent":
-        l(), r.useTabs ? a(1) : D(r.tabWidth);
-        break;
-      case "stringAlign":
-        l(), o += c.n, u += c.n.length;
-        break;
-      case "numberAlign":
-        i += 1, s += c.n;
-        break;
-      default:
-        throw new Error(`Unexpected type '${c.type}'`);
-    }
+  for (let c of n) switch (c.type) {
+    case "indent":
+      l(), r.useTabs ? a(1) : D(r.tabWidth);
+      break;
+    case "stringAlign":
+      l(), o += c.n, u += c.n.length;
+      break;
+    case "numberAlign":
+      i += 1, s += c.n;
+      break;
+    default:
+      throw new Error(`Unexpected type '${c.type}'`);
+  }
   return f(), { ...e, value: o, length: u, queue: n };
   function a(c) {
     o += "	".repeat(c), u += r.tabWidth * c;
@@ -853,36 +771,30 @@ function bt(e, t, r) {
 }
 function Ot(e) {
   let t = 0, r = 0, n = e.length;
-  e:
-    for (; n--; ) {
-      let o = e[n];
-      if (o === Te) {
-        r++;
-        continue;
-      }
-      for (let u = o.length - 1; u >= 0; u--) {
-        let i = o[u];
-        if (i === " " || i === "	")
-          t++;
-        else {
-          e[n] = o.slice(0, u + 1);
-          break e;
-        }
+  e: for (; n--; ) {
+    let o = e[n];
+    if (o === Te) {
+      r++;
+      continue;
+    }
+    for (let u = o.length - 1; u >= 0; u--) {
+      let i = o[u];
+      if (i === " " || i === "	") t++;
+      else {
+        e[n] = o.slice(0, u + 1);
+        break e;
       }
     }
-  if (t > 0 || r > 0)
-    for (e.length = n + 1; r-- > 0; )
-      e.push(Te);
+  }
+  if (t > 0 || r > 0) for (e.length = n + 1; r-- > 0; ) e.push(Te);
   return t;
 }
 function et(e, t, r, n, o, u) {
-  if (r === Number.POSITIVE_INFINITY)
-    return true;
+  if (r === Number.POSITIVE_INFINITY) return true;
   let i = t.length, s = [e], a = [];
   for (; r >= 0; ) {
     if (s.length === 0) {
-      if (i === 0)
-        return true;
+      if (i === 0) return true;
       s.push(t[--i]);
       continue;
     }
@@ -894,8 +806,7 @@ function et(e, t, r, n, o, u) {
       case W:
       case S: {
         let f = d === W ? l : l.parts;
-        for (let p = f.length - 1; p >= 0; p--)
-          s.push({ mode: D, doc: f[p] });
+        for (let p = f.length - 1; p >= 0; p--) s.push({ mode: D, doc: f[p] });
         break;
       }
       case L:
@@ -908,8 +819,7 @@ function et(e, t, r, n, o, u) {
         r += Ot(a);
         break;
       case x: {
-        if (u && l.break)
-          return false;
+        if (u && l.break) return false;
         let f = l.break ? H : D, p = l.expandedStates && f === H ? y(false, l.expandedStates, -1) : l.contents;
         s.push({ mode: f, doc: p });
         break;
@@ -920,16 +830,14 @@ function et(e, t, r, n, o, u) {
         break;
       }
       case B:
-        if (D === H || l.hard)
-          return true;
+        if (D === H || l.hard) return true;
         l.soft || (a.push(" "), r--);
         break;
       case Y:
         n = true;
         break;
       case j:
-        if (n)
-          return false;
+        if (n) return false;
         break;
     }
   }
@@ -948,12 +856,10 @@ function Fe(e, t) {
         break;
       }
       case W:
-        for (let F = c.length - 1; F >= 0; F--)
-          i.push({ ind: f, mode: p, doc: c[F] });
+        for (let F = c.length - 1; F >= 0; F--) i.push({ ind: f, mode: p, doc: c[F] });
         break;
       case z:
-        if (l >= 2)
-          throw new Error("There are too many 'cursor' in doc.");
+        if (l >= 2) throw new Error("There are too many 'cursor' in doc.");
         s.push(Te), l++;
         break;
       case L:
@@ -975,27 +881,23 @@ function Fe(e, t) {
           case H: {
             a = false;
             let F = { ind: f, mode: J, doc: c.contents }, m = n - u, E = D.length > 0;
-            if (!c.break && et(F, i, m, E, r))
-              i.push(F);
+            if (!c.break && et(F, i, m, E, r)) i.push(F);
             else if (c.expandedStates) {
               let A = y(false, c.expandedStates, -1);
               if (c.break) {
                 i.push({ ind: f, mode: H, doc: A });
                 break;
-              } else
-                for (let w = 1; w < c.expandedStates.length + 1; w++)
-                  if (w >= c.expandedStates.length) {
-                    i.push({ ind: f, mode: H, doc: A });
-                    break;
-                  } else {
-                    let h = c.expandedStates[w], C = { ind: f, mode: J, doc: h };
-                    if (et(C, i, m, E, r)) {
-                      i.push(C);
-                      break;
-                    }
-                  }
-            } else
-              i.push({ ind: f, mode: H, doc: c.contents });
+              } else for (let w = 1; w < c.expandedStates.length + 1; w++) if (w >= c.expandedStates.length) {
+                i.push({ ind: f, mode: H, doc: A });
+                break;
+              } else {
+                let h = c.expandedStates[w], C = { ind: f, mode: J, doc: h };
+                if (et(C, i, m, E, r)) {
+                  i.push(C);
+                  break;
+                }
+              }
+            } else i.push({ ind: f, mode: H, doc: c.contents });
             break;
           }
         }
@@ -1003,8 +905,7 @@ function Fe(e, t) {
         break;
       case S: {
         let F = n - u, { parts: m } = c;
-        if (m.length === 0)
-          break;
+        if (m.length === 0) break;
         let [E, A] = m, w = { ind: f, mode: J, doc: E }, h = { ind: f, mode: H, doc: E }, C = et(w, [], F, D.length > 0, r, true);
         if (m.length === 1) {
           C ? i.push(w) : i.push(h);
@@ -1042,8 +943,7 @@ function Fe(e, t) {
       case B:
         switch (p) {
           case J:
-            if (c.hard)
-              a = true;
+            if (c.hard) a = true;
             else {
               c.soft || (s.push(" "), u += 1);
               break;
@@ -1076,8 +976,7 @@ function Fe(e, t) {
 }
 function Ku(e, t, r = 0) {
   let n = 0;
-  for (let o = r; o < e.length; ++o)
-    e[o] === "	" ? n = n + t - n % t : n++;
+  for (let o = r; o < e.length; ++o) e[o] === "	" ? n = n + t - n % t : n++;
   return n;
 }
 var me = Ku;
@@ -1149,8 +1048,7 @@ var te, Nt, tt, St = class {
   }
   call(t, ...r) {
     let { stack: n } = this, { length: o } = n, u = y(false, n, -1);
-    for (let i of r)
-      u = u[i], n.push(i, u);
+    for (let i of r) u = u[i], n.push(i, u);
     try {
       return t(this);
     } finally {
@@ -1167,11 +1065,9 @@ var te, Nt, tt, St = class {
   }
   each(t, ...r) {
     let { stack: n } = this, { length: o } = n, u = y(false, n, -1);
-    for (let i of r)
-      u = u[i], n.push(i, u);
+    for (let i of r) u = u[i], n.push(i, u);
     try {
-      for (let i = 0; i < u.length; ++i)
-        n.push(i, u[i]), t(this, i, u), n.length -= 2;
+      for (let i = 0; i < u.length; ++i) n.push(i, u[i]), t(this, i, u), n.length -= 2;
     } finally {
       n.length = o;
     }
@@ -1185,32 +1081,24 @@ var te, Nt, tt, St = class {
   match(...t) {
     let r = this.stack.length - 1, n = null, o = this.stack[r--];
     for (let u of t) {
-      if (o === void 0)
-        return false;
+      if (o === void 0) return false;
       let i = null;
-      if (typeof n == "number" && (i = n, n = this.stack[r--], o = this.stack[r--]), u && !u(o, n, i))
-        return false;
+      if (typeof n == "number" && (i = n, n = this.stack[r--], o = this.stack[r--]), u && !u(o, n, i)) return false;
       n = this.stack[r--], o = this.stack[r--];
     }
     return true;
   }
   findAncestor(t) {
-    for (let r of pe(this, te, tt).call(this))
-      if (t(r))
-        return r;
+    for (let r of pe(this, te, tt).call(this)) if (t(r)) return r;
   }
   hasAncestor(t) {
-    for (let r of pe(this, te, tt).call(this))
-      if (t(r))
-        return true;
+    for (let r of pe(this, te, tt).call(this)) if (t(r)) return true;
     return false;
   }
 };
 te = /* @__PURE__ */ new WeakSet(), Nt = function(t) {
   let { stack: r } = this;
-  for (let n = r.length - 1; n >= 0; n -= 2)
-    if (!Array.isArray(r[n]) && --t < 0)
-      return n;
+  for (let n = r.length - 1; n >= 0; n -= 2) if (!Array.isArray(r[n]) && --t < 0) return n;
   return -1;
 }, tt = function* () {
   let { stack: t } = this;
@@ -1230,34 +1118,27 @@ function* Tt(e, t) {
   let { getVisitorKeys: r, filter: n = () => true } = t, o = (u) => Vr(u) && n(u);
   for (let u of r(e)) {
     let i = e[u];
-    if (Array.isArray(i))
-      for (let s of i)
-        o(s) && (yield s);
-    else
-      o(i) && (yield i);
+    if (Array.isArray(i)) for (let s of i) o(s) && (yield s);
+    else o(i) && (yield i);
   }
 }
 function* Ur(e, t) {
   let r = [e];
   for (let n = 0; n < r.length; n++) {
     let o = r[n];
-    for (let u of Tt(o, t))
-      yield u, r.push(u);
+    for (let u of Tt(o, t)) yield u, r.push(u);
   }
 }
 function Ee(e) {
   return (t, r, n) => {
     let o = !!(n != null && n.backwards);
-    if (r === false)
-      return false;
+    if (r === false) return false;
     let { length: u } = t, i = r;
     for (; i >= 0 && i < u; ) {
       let s = t.charAt(i);
       if (e instanceof RegExp) {
-        if (!e.test(s))
-          return i;
-      } else if (!e.includes(s))
-        return i;
+        if (!e.test(s)) return i;
+      } else if (!e.includes(s)) return i;
       o ? i-- : i++;
     }
     return i === -1 || i === u ? i : false;
@@ -1266,23 +1147,18 @@ function Ee(e) {
 var zr = Ee(/\s/u), T = Ee(" 	"), rt = Ee(",; 	"), nt = Ee(/[^\n\r]/u);
 function Ju(e, t, r) {
   let n = !!(r != null && r.backwards);
-  if (t === false)
-    return false;
+  if (t === false) return false;
   let o = e.charAt(t);
   if (n) {
     if (e.charAt(t - 1) === "\r" && o === `
-`)
-      return t - 2;
+`) return t - 2;
     if (o === `
-` || o === "\r" || o === "\u2028" || o === "\u2029")
-      return t - 1;
+` || o === "\r" || o === "\u2028" || o === "\u2029") return t - 1;
   } else {
     if (o === "\r" && e.charAt(t + 1) === `
-`)
-      return t + 2;
+`) return t + 2;
     if (o === `
-` || o === "\r" || o === "\u2028" || o === "\u2029")
-      return t + 1;
+` || o === "\r" || o === "\u2028" || o === "\u2029") return t + 1;
   }
   return t;
 }
@@ -1319,11 +1195,9 @@ function oe(e, t) {
 }
 var Pt = /* @__PURE__ */ new WeakMap();
 function ut(e, t) {
-  if (Pt.has(e))
-    return Pt.get(e);
+  if (Pt.has(e)) return Pt.get(e);
   let { printer: { getCommentChildNodes: r, canAttachComment: n, getVisitorKeys: o }, locStart: u, locEnd: i } = t;
-  if (!n)
-    return [];
+  if (!n) return [];
   let s = ((r == null ? void 0 : r(e, t)) ?? [...Tt(e, { getVisitorKeys: X(o) })]).flatMap((a) => n(a) ? [a] : ut(a, t));
   return s.sort((a, D) => u(a) - u(D) || i(a) - i(D)), Pt.set(e, s), s;
 }
@@ -1331,8 +1205,7 @@ function qr(e, t, r, n) {
   let { locStart: o, locEnd: u } = r, i = o(t), s = u(t), a = ut(e, r), D, l, d = 0, f = a.length;
   for (; d < f; ) {
     let p = d + f >> 1, c = a[p], F = o(c), m = u(c);
-    if (F <= i && s <= m)
-      return qr(c, t, r, c);
+    if (F <= i && s <= m) return qr(c, t, r, c);
     if (m <= i) {
       D = c, d = p + 1;
       continue;
@@ -1352,8 +1225,7 @@ function qr(e, t, r, n) {
 var It = () => false;
 function Jr(e, t) {
   let { comments: r } = e;
-  if (delete e.comments, !kt(r) || !t.printer.canAttachComment)
-    return;
+  if (delete e.comments, !kt(r) || !t.printer.canAttachComment) return;
   let n = [], { locStart: o, locEnd: u, printer: { experimentalFeatures: { avoidAstMutation: i = false } = {}, handleComments: s = {} }, originalText: a } = t, { ownLine: D = It, endOfLine: l = It, remaining: d = It } = s, f = r.map((p, c) => ({ ...qr(e, p, t), comment: p, text: a, options: t, ast: e, isLastComment: r.length - 1 === c }));
   for (let [p, c] of f.entries()) {
     let { comment: F, precedingNode: m, enclosingNode: E, followingNode: A, text: w, options: h, ast: C, isLastComment: k } = c;
@@ -1368,70 +1240,53 @@ function Jr(e, t) {
       }
     }
     let v;
-    if (i ? v = [c] : (F.enclosingNode = E, F.precedingNode = m, F.followingNode = A, v = [F, w, h, C, k]), ro(w, h, f, p))
-      F.placement = "ownLine", D(...v) || (A ? ue(A, F) : m ? oe(m, F) : E ? re(E, F) : re(C, F));
-    else if (no(w, h, f, p))
-      F.placement = "endOfLine", l(...v) || (m ? oe(m, F) : A ? ue(A, F) : E ? re(E, F) : re(C, F));
-    else if (F.placement = "remaining", !d(...v))
-      if (m && A) {
-        let $ = n.length;
-        $ > 0 && n[$ - 1].followingNode !== A && Kr(n, h), n.push(c);
-      } else
-        m ? oe(m, F) : A ? ue(A, F) : E ? re(E, F) : re(C, F);
-  }
-  if (Kr(n, t), !i)
-    for (let p of r)
-      delete p.precedingNode, delete p.enclosingNode, delete p.followingNode;
+    if (i ? v = [c] : (F.enclosingNode = E, F.precedingNode = m, F.followingNode = A, v = [F, w, h, C, k]), ro(w, h, f, p)) F.placement = "ownLine", D(...v) || (A ? ue(A, F) : m ? oe(m, F) : E ? re(E, F) : re(C, F));
+    else if (no(w, h, f, p)) F.placement = "endOfLine", l(...v) || (m ? oe(m, F) : A ? ue(A, F) : E ? re(E, F) : re(C, F));
+    else if (F.placement = "remaining", !d(...v)) if (m && A) {
+      let $ = n.length;
+      $ > 0 && n[$ - 1].followingNode !== A && Kr(n, h), n.push(c);
+    } else m ? oe(m, F) : A ? ue(A, F) : E ? re(E, F) : re(C, F);
+  }
+  if (Kr(n, t), !i) for (let p of r) delete p.precedingNode, delete p.enclosingNode, delete p.followingNode;
 }
 var Xr = (e) => !/[\S\n\u2028\u2029]/u.test(e);
 function ro(e, t, r, n) {
   let { comment: o, precedingNode: u } = r[n], { locStart: i, locEnd: s } = t, a = i(o);
-  if (u)
-    for (let D = n - 1; D >= 0; D--) {
-      let { comment: l, precedingNode: d } = r[D];
-      if (d !== u || !Xr(e.slice(s(l), a)))
-        break;
-      a = i(l);
-    }
+  if (u) for (let D = n - 1; D >= 0; D--) {
+    let { comment: l, precedingNode: d } = r[D];
+    if (d !== u || !Xr(e.slice(s(l), a))) break;
+    a = i(l);
+  }
   return V(e, a, { backwards: true });
 }
 function no(e, t, r, n) {
   let { comment: o, followingNode: u } = r[n], { locStart: i, locEnd: s } = t, a = s(o);
-  if (u)
-    for (let D = n + 1; D < r.length; D++) {
-      let { comment: l, followingNode: d } = r[D];
-      if (d !== u || !Xr(e.slice(a, i(l))))
-        break;
-      a = s(l);
-    }
+  if (u) for (let D = n + 1; D < r.length; D++) {
+    let { comment: l, followingNode: d } = r[D];
+    if (d !== u || !Xr(e.slice(a, i(l)))) break;
+    a = s(l);
+  }
   return V(e, a);
 }
 function Kr(e, t) {
   var s, a;
   let r = e.length;
-  if (r === 0)
-    return;
+  if (r === 0) return;
   let { precedingNode: n, followingNode: o } = e[0], u = t.locStart(o), i;
   for (i = r; i > 0; --i) {
     let { comment: D, precedingNode: l, followingNode: d } = e[i - 1];
     ke.strictEqual(l, n), ke.strictEqual(d, o);
     let f = t.originalText.slice(t.locEnd(D), u);
-    if (((a = (s = t.printer).isGap) == null ? void 0 : a.call(s, f, t)) ?? /^[\s(]*$/u.test(f))
-      u = t.locStart(D);
-    else
-      break;
+    if (((a = (s = t.printer).isGap) == null ? void 0 : a.call(s, f, t)) ?? /^[\s(]*$/u.test(f)) u = t.locStart(D);
+    else break;
   }
-  for (let [D, { comment: l }] of e.entries())
-    D < i ? oe(n, l) : ue(o, l);
-  for (let D of [n, o])
-    D.comments && D.comments.length > 1 && D.comments.sort((l, d) => t.locStart(l) - t.locStart(d));
+  for (let [D, { comment: l }] of e.entries()) D < i ? oe(n, l) : ue(o, l);
+  for (let D of [n, o]) D.comments && D.comments.length > 1 && D.comments.sort((l, d) => t.locStart(l) - t.locStart(d));
   e.length = 0;
 }
 function Rt(e, t, r) {
   let n = r.locStart(t) - 1;
-  for (let o = 1; o < e.length; ++o)
-    if (n < r.locStart(e[o]))
-      return o - 1;
+  for (let o = 1; o < e.length; ++o) if (n < r.locStart(e[o])) return o - 1;
   return 0;
 }
 function uo(e, t) {
@@ -1451,8 +1306,7 @@ function oo(e, t) {
   if ((l = o.isBlockComment) == null ? void 0 : l.call(o, r)) {
     let d = V(u, s(r)) ? V(u, i(r), { backwards: true }) ? q : Ke : " ";
     n.push(d);
-  } else
-    n.push(q);
+  } else n.push(q);
   let D = M(u, T(u, s(r)));
   return D !== false && V(u, D) && n.push(q), n;
 }
@@ -1467,16 +1321,13 @@ function io(e, t, r) {
 }
 function so(e, t) {
   let r = e.node;
-  if (!r)
-    return {};
+  if (!r) return {};
   let n = t[Symbol.for("printedComments")];
-  if ((r.comments || []).filter((a) => !n.has(a)).length === 0)
-    return { leading: "", trailing: "" };
+  if ((r.comments || []).filter((a) => !n.has(a)).length === 0) return { leading: "", trailing: "" };
   let u = [], i = [], s;
   return e.each(() => {
     let a = e.node;
-    if (n != null && n.has(a))
-      return;
+    if (n != null && n.has(a)) return;
     let { leading: D, trailing: l } = a;
     D ? u.push(oo(e, t)) : l && (s = io(e, t, s), i.push(s.doc));
   }, "comments"), { leading: u, trailing: i };
@@ -1488,8 +1339,7 @@ function Qr(e, t, r) {
 function en(e) {
   let { [Symbol.for("comments")]: t, [Symbol.for("printedComments")]: r } = e;
   for (let n of t) {
-    if (!n.printed && !r.has(n))
-      throw new Error('Comment "' + n.value.trim() + '" was not printed. Please report this error!');
+    if (!n.printed && !r.has(n)) throw new Error('Comment "' + n.value.trim() + '" was not printed. Please report this error!');
     delete n.printed;
   }
 }
@@ -1516,24 +1366,21 @@ The range will extend backwards to the start of the first line containing the se
 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: false, 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 ot({ plugins: e = [], showDeprecated: t = false } = {}) {
   let r = e.flatMap((o) => o.languages ?? []), n = [];
-  for (let o of lo(Object.assign({}, ...e.map(({ options: u }) => u), rn)))
-    !t && o.deprecated || (Array.isArray(o.choices) && (t || (o.choices = o.choices.filter((u) => !u.deprecated)), o.name === "parser" && (o.choices = [...o.choices, ...Do(o.choices, r, e)])), o.pluginDefaults = Object.fromEntries(e.filter((u) => {
-      var i;
-      return ((i = u.defaultOptions) == null ? void 0 : i[o.name]) !== void 0;
-    }).map((u) => [u.name, u.defaultOptions[o.name]])), n.push(o));
+  for (let o of lo(Object.assign({}, ...e.map(({ options: u }) => u), rn))) !t && o.deprecated || (Array.isArray(o.choices) && (t || (o.choices = o.choices.filter((u) => !u.deprecated)), o.name === "parser" && (o.choices = [...o.choices, ...Do(o.choices, r, e)])), o.pluginDefaults = Object.fromEntries(e.filter((u) => {
+    var i;
+    return ((i = u.defaultOptions) == null ? void 0 : i[o.name]) !== void 0;
+  }).map((u) => [u.name, u.defaultOptions[o.name]])), n.push(o));
   return { languages: r, options: n };
 }
 function* Do(e, t, r) {
   let n = new Set(e.map((o) => o.value));
-  for (let o of t)
-    if (o.parsers) {
-      for (let u of o.parsers)
-        if (!n.has(u)) {
-          n.add(u);
-          let i = r.find((a) => a.parsers && Object.prototype.hasOwnProperty.call(a.parsers, u)), s = o.name;
-          i != null && i.name && (s += ` (plugin: ${i.name})`), yield { value: u, description: s };
-        }
+  for (let o of t) if (o.parsers) {
+    for (let u of o.parsers) if (!n.has(u)) {
+      n.add(u);
+      let i = r.find((a) => a.parsers && Object.prototype.hasOwnProperty.call(a.parsers, u)), s = o.name;
+      i != null && i.name && (s += ` (plugin: ${i.name})`), yield { value: u, description: s };
     }
+  }
 }
 function lo(e) {
   let t = [];
@@ -1545,14 +1392,12 @@ function lo(e) {
 }
 var co = (e) => String(e).split(/[/\\]/u).pop();
 function nn(e, t) {
-  if (!t)
-    return;
+  if (!t) return;
   let r = co(t).toLowerCase();
   return e.find(({ filenames: n }) => n == null ? void 0 : n.some((o) => o.toLowerCase() === r)) ?? e.find(({ extensions: n }) => n == null ? void 0 : n.some((o) => r.endsWith(o)));
 }
 function fo(e, t) {
-  if (t)
-    return e.find(({ name: r }) => r.toLowerCase() === t) ?? e.find(({ aliases: r }) => r == null ? void 0 : r.includes(t)) ?? e.find(({ extensions: r }) => r == null ? void 0 : r.includes(`.${t}`));
+  if (t) return e.find(({ name: r }) => r.toLowerCase() === t) ?? e.find(({ aliases: r }) => r == null ? void 0 : r.includes(t)) ?? e.find(({ extensions: r }) => r == null ? void 0 : r.includes(`.${t}`));
 }
 function po(e, t) {
   let r = e.plugins.flatMap((o) => o.languages ?? []), n = fo(r, t.language) ?? nn(r, t.physicalFile) ?? nn(r, t.file) ?? (t.physicalFile, void 0);
@@ -1560,10 +1405,8 @@ function po(e, t) {
 }
 var un = po;
 var ie = { 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((r) => ie.value(r)).join(", ")}]`;
+  if (e === null || typeof e != "object") return JSON.stringify(e);
+  if (Array.isArray(e)) return `[${e.map((r) => ie.value(r)).join(", ")}]`;
   let t = Object.keys(e);
   return t.length === 0 ? "{}" : `{ ${t.map((r) => `${ie.key(r)}: ${ie.value(e[r])}`).join(", ")} }`;
 }, pair: ({ key: e, value: t }) => ie.value({ [e]: t }) };
@@ -1587,8 +1430,7 @@ function fn({ text: e, list: t }, r) {
 `)), pn(n, r);
 }
 function pn(e, t) {
-  if (e.length === 1)
-    return e[0];
+  if (e.length === 1) return e[0];
   let [r, n] = e, [o, u] = e.map((i) => i.split(`
 `, 1)[0].length);
   return o > t && o > u ? n : r;
@@ -1596,24 +1438,17 @@ function pn(e, t) {
 var Wt = Me(it(), 1);
 var jt = [], dn = [];
 function Ht(e, t) {
-  if (e === t)
-    return 0;
+  if (e === t) return 0;
   let r = e;
   e.length > t.length && (e = t, t = r);
   let n = e.length, o = t.length;
-  for (; n > 0 && e.charCodeAt(~-n) === t.charCodeAt(~-o); )
-    n--, o--;
+  for (; n > 0 && e.charCodeAt(~-n) === t.charCodeAt(~-o); ) n--, o--;
   let u = 0;
-  for (; u < n && e.charCodeAt(u) === t.charCodeAt(u); )
-    u++;
-  if (n -= u, o -= u, n === 0)
-    return o;
+  for (; u < n && e.charCodeAt(u) === t.charCodeAt(u); ) u++;
+  if (n -= u, o -= u, n === 0) return o;
   let i, s, a, D, l = 0, d = 0;
-  for (; l < n; )
-    dn[l] = e.charCodeAt(u + l), jt[l] = ++l;
-  for (; d < o; )
-    for (i = t.charCodeAt(u + d), a = d++, s = d, l = 0; l < n; l++)
-      D = i === dn[l] ? a : a + 1, a = jt[l], s = jt[l] = a > s ? D > s ? s + 1 : D : D > a ? a + 1 : D;
+  for (; l < n; ) dn[l] = e.charCodeAt(u + l), jt[l] = ++l;
+  for (; d < o; ) for (i = t.charCodeAt(u + d), a = d++, s = d, l = 0; l < n; l++) D = i === dn[l] ? a : a + 1, a = jt[l], s = jt[l] = a > s ? D > s ? s + 1 : D : D > a ? a + 1 : D;
   return s;
 }
 var at = (e, t, { descriptor: r, logger: n, schemas: o }) => {
@@ -1623,8 +1458,7 @@ var at = (e, t, { descriptor: r, logger: n, schemas: o }) => {
 var Fo = ["default", "expected", "validate", "deprecated", "forward", "redirect", "overlap", "preprocess", "postprocess"];
 function mo(e, t) {
   let r = new e(t), n = Object.create(r);
-  for (let o of Fo)
-    o in t && (n[o] = Eo(t[o], r, O.prototype[o].length));
+  for (let o of Fo) o in t && (n[o] = Eo(t[o], r, O.prototype[o].length));
   return n;
 }
 var O = class {
@@ -1693,8 +1527,7 @@ var ct = class extends O {
     return { text: r && `an array of ${r}`, list: n && { title: "an array of the following values", values: [{ list: n }] } };
   }
   validate(t, r) {
-    if (!Array.isArray(t))
-      return false;
+    if (!Array.isArray(t)) return false;
     let n = [];
     for (let o of t) {
       let u = r.normalizeValidateResult(this._valueSchema.validate(o, r), o);
@@ -1745,8 +1578,7 @@ function En(e, t) {
   let r = /* @__PURE__ */ Object.create(null);
   for (let n of e) {
     let o = n[t];
-    if (r[o])
-      throw new Error(`Duplicate ${t} ${JSON.stringify(o)}`);
+    if (r[o]) throw new Error(`Duplicate ${t} ${JSON.stringify(o)}`);
     r[o] = n;
   }
   return r;
@@ -1755,8 +1587,7 @@ function hn(e, t) {
   let r = /* @__PURE__ */ new Map();
   for (let n of e) {
     let o = n[t];
-    if (r.has(o))
-      throw new Error(`Duplicate ${t} ${JSON.stringify(o)}`);
+    if (r.has(o)) throw new Error(`Duplicate ${t} ${JSON.stringify(o)}`);
     r.set(o, n);
   }
   return r;
@@ -1770,16 +1601,14 @@ function Cn() {
 }
 function gn(e, t) {
   let r = [], n = [];
-  for (let o of e)
-    t(o) ? r.push(o) : n.push(o);
+  for (let o of e) t(o) ? r.push(o) : n.push(o);
   return [r, n];
 }
 function yn(e) {
   return e === Math.floor(e);
 }
 function An(e, t) {
-  if (e === t)
-    return 0;
+  if (e === t) return 0;
   let r = typeof e, n = typeof t, o = ["undefined", "object", "boolean", "number", "string"];
   return r !== n ? o.indexOf(r) - o.indexOf(n) : r !== "string" ? Number(e) - Number(t) : e.localeCompare(t);
 }
@@ -1793,8 +1622,7 @@ function Mt(e) {
   return e === void 0 ? {} : e;
 }
 function $t(e) {
-  if (typeof e == "string")
-    return { text: e };
+  if (typeof e == "string") return { text: e };
   let { text: t, list: r } = e;
   return ho((t || r) !== void 0, "Unexpected `expected` result, there should be at least one field."), r ? { text: t, list: { title: r.title, values: r.values.map($t) } } : { text: t };
 }
@@ -1815,8 +1643,7 @@ function zt(e, t) {
   return r.length === 0 ? { remain: t, redirect: r } : typeof e == "object" && "remain" in e ? { remain: e.remain, redirect: r } : { redirect: r };
 }
 function ho(e, t) {
-  if (!e)
-    throw new Error(t);
+  if (!e) throw new Error(t);
 }
 var dt = class extends O {
   constructor(t) {
@@ -1893,8 +1720,7 @@ var Et = class {
     }
     u();
     for (let i of Object.keys(this._utils.schemas)) {
-      if (!(i in r))
-        continue;
+      if (!(i in r)) continue;
       let s = this._utils.schemas[i], a = r[i], D = s.postprocess(a, this._utils);
       D !== he && (this._applyValidation(D, i, s), r[i] = D);
     }
@@ -1909,17 +1735,14 @@ var Et = class {
         n.push(typeof c == "string" ? { [c]: p } : { [c.key]: c.value });
       }, l = ({ value: p, redirectTo: c }) => {
         let F = Ut(s.deprecated(p, this._utils), a, true);
-        if (F !== false)
-          if (F === true)
-            this._hasDeprecationWarned(i) || this._utils.logger.warn(this._deprecatedHandler(i, c, this._utils));
-          else
-            for (let { value: m } of F) {
-              let E = { key: i, value: m };
-              if (!this._hasDeprecationWarned(E)) {
-                let A = typeof c == "string" ? { key: c, value: m } : c;
-                this._utils.logger.warn(this._deprecatedHandler(E, A, this._utils));
-              }
-            }
+        if (F !== false) if (F === true) this._hasDeprecationWarned(i) || this._utils.logger.warn(this._deprecatedHandler(i, c, this._utils));
+        else for (let { value: m } of F) {
+          let E = { key: i, value: m };
+          if (!this._hasDeprecationWarned(E)) {
+            let A = typeof c == "string" ? { key: c, value: m } : c;
+            this._utils.logger.warn(this._deprecatedHandler(E, A, this._utils));
+          }
+        }
       };
       pt(s.forward(a, this._utils), a).forEach(D);
       let f = zt(s.redirect(a, this._utils), a);
@@ -1927,8 +1750,7 @@ var Et = class {
         let p = f.remain;
         r[i] = i in r ? s.overlap(r[i], p, this._utils) : p, l({ value: p });
       }
-      for (let { from: p, to: c } of f.redirect)
-        l({ value: p, redirectTo: c });
+      for (let { from: p, to: c } of f.redirect) l({ value: p, redirectTo: c });
     }
     for (let i of u) {
       let s = t[i];
@@ -1939,9 +1761,7 @@ var Et = class {
     return n;
   }
   _applyRequiredCheck(t) {
-    for (let r of Object.keys(this._utils.schemas))
-      if (this._identifyMissing(r, t) && this._identifyRequired(r))
-        throw this._invalidHandler(r, st, this._utils);
+    for (let r of Object.keys(this._utils.schemas)) if (this._identifyMissing(r, t) && this._identifyRequired(r)) throw this._invalidHandler(r, st, this._utils);
   }
   _partitionOptionKeys(t) {
     let [r, n] = gn(Object.keys(t).filter((o) => !this._identifyMissing(o, t)), (o) => o in this._utils.schemas);
@@ -1949,25 +1769,20 @@ var Et = class {
   }
   _applyValidation(t, r, n) {
     let o = Vt(n.validate(t, this._utils), t);
-    if (o !== true)
-      throw this._invalidHandler(r, o.value, this._utils);
+    if (o !== true) throw this._invalidHandler(r, o.value, this._utils);
   }
   _applyUnknownHandler(t, r, n, o) {
     let u = this._unknownHandler(t, r, this._utils);
-    if (u)
-      for (let i of Object.keys(u)) {
-        if (this._identifyMissing(i, u))
-          continue;
-        let s = u[i];
-        i in this._utils.schemas ? o(i, s) : n[i] = s;
-      }
+    if (u) for (let i of Object.keys(u)) {
+      if (this._identifyMissing(i, u)) continue;
+      let s = u[i];
+      i in this._utils.schemas ? o(i, s) : n[i] = s;
+    }
   }
   _applyPostprocess(t) {
     let r = this._postprocess(t, this._utils);
     if (r !== he) {
-      if (r.delete)
-        for (let n of r.delete)
-          delete t[n];
+      if (r.delete) for (let n of r.delete) delete t[n];
       if (r.override) {
         let { knownKeys: n, unknownKeys: o } = this._partitionOptionKeys(r.override);
         for (let u of n) {
@@ -1988,12 +1803,9 @@ var Et = class {
 var Gt;
 function go(e, t, { logger: r = false, isCLI: n = false, passThrough: o = false, FlagSchema: u, descriptor: i } = {}) {
   if (n) {
-    if (!u)
-      throw new Error("'FlagSchema' option is required.");
-    if (!i)
-      throw new Error("'descriptor' option is required.");
-  } else
-    i = ie;
+    if (!u) throw new Error("'FlagSchema' option is required.");
+    if (!i) throw new Error("'descriptor' option is required.");
+  } else i = ie;
   let s = o ? Array.isArray(o) ? (f, p) => o.includes(f) ? { [f]: p } : void 0 : (f, p) => ({ [f]: p }) : (f, p, c) => {
     let { _: F, ...m } = c.schemas;
     return at(f, p, { ...c, schemas: m });
@@ -2005,8 +1817,7 @@ function go(e, t, { logger: r = false, isCLI: n = false, passThrough: o = false,
 function yo(e, { isCLI: t, FlagSchema: r }) {
   let n = [];
   t && n.push(lt.create({ name: "_" }));
-  for (let o of e)
-    n.push(Ao(o, { isCLI: t, optionInfos: e, FlagSchema: r })), o.alias && t && n.push(Dt.create({ name: o.alias, sourceName: o.name }));
+  for (let o of e) n.push(Ao(o, { isCLI: t, optionInfos: e, FlagSchema: r })), o.alias && t && n.push(Dt.create({ name: o.alias, sourceName: o.name }));
   return n;
 }
 function Ao(e, { isCLI: t, optionInfos: r, FlagSchema: n }) {
@@ -2042,30 +1853,24 @@ function Ao(e, { isCLI: t, optionInfos: r, FlagSchema: n }) {
 var bn = go;
 var Bo = (e, t, r) => {
   if (!(e && t == null)) {
-    if (t.findLast)
-      return t.findLast(r);
+    if (t.findLast) return t.findLast(r);
     for (let n = t.length - 1; n >= 0; n--) {
       let o = t[n];
-      if (r(o, n, t))
-        return o;
+      if (r(o, n, t)) return o;
     }
   }
 }, Kt = Bo;
 function qt(e, t) {
-  if (!t)
-    throw new Error("parserName is required.");
+  if (!t) throw new Error("parserName is required.");
   let r = Kt(false, e, (o) => o.parsers && Object.prototype.hasOwnProperty.call(o.parsers, t));
-  if (r)
-    return r;
+  if (r) return r;
   let n = `Couldn't resolve parser "${t}".`;
   throw n += " Plugins must be explicitly added to the standalone bundle.", new Pe(n);
 }
 function On(e, t) {
-  if (!t)
-    throw new Error("astFormat is required.");
+  if (!t) throw new Error("astFormat is required.");
   let r = Kt(false, e, (o) => o.printers && Object.prototype.hasOwnProperty.call(o.printers, t));
-  if (r)
-    return r;
+  if (r) return r;
   let n = `Couldn't find plugin for AST format "${t}".`;
   throw n += " Plugins must be explicitly added to the standalone bundle.", new Pe(n);
 }
@@ -2085,19 +1890,15 @@ var Nn = { astFormat: "estree", printer: {}, originalText: void 0, locStart: nul
 async function wo(e, t = {}) {
   var d;
   let r = { ...e };
-  if (!r.parser)
-    if (r.filepath) {
-      if (r.parser = un(r, { physicalFile: r.filepath }), !r.parser)
-        throw new Ie(`No parser could be inferred for file "${r.filepath}".`);
-    } else
-      throw new Ie("No parser and no file path given, couldn't infer a parser.");
+  if (!r.parser) if (r.filepath) {
+    if (r.parser = un(r, { physicalFile: r.filepath }), !r.parser) throw new Ie(`No parser could be inferred for file "${r.filepath}".`);
+  } else throw new Ie("No parser and no file path given, couldn't infer a parser.");
   let n = ot({ plugins: e.plugins, showDeprecated: true }).options, o = { ...Nn, ...Object.fromEntries(n.filter((f) => f.default !== void 0).map((f) => [f.name, f.default])) }, u = qt(r.plugins, r.parser), i = await Jt(u, r.parser);
   r.astFormat = i.astFormat, r.locEnd = i.locEnd, r.locStart = i.locStart;
   let s = (d = u.printers) != null && d[i.astFormat] ? u : On(r.plugins, i.astFormat), a = await Sn(s, i.astFormat);
   r.printer = a;
   let D = s.defaultOptions ? Object.fromEntries(Object.entries(s.defaultOptions).filter(([, f]) => f !== void 0)) : {}, l = { ...o, ...D };
-  for (let [f, p] of Object.entries(l))
-    (r[f] === null || r[f] === void 0) && (r[f] = p);
+  for (let [f, p] of Object.entries(l)) (r[f] === null || r[f] === void 0) && (r[f] = p);
   return r.parser === "json" && (r.trailingComma = "none"), bn(r, n, { passThrough: Object.keys(Nn), ...t });
 }
 var se = wo;
@@ -2125,32 +1926,26 @@ function Lo(e, t) {
 var ce = ko;
 async function Un(e, t, r, n, o) {
   let { embeddedLanguageFormatting: u, printer: { embed: i, hasPrettierIgnore: s = () => false, getVisitorKeys: a } } = r;
-  if (!i || u !== "auto")
-    return;
-  if (i.length > 2)
-    throw new Error("printer.embed has too many parameters. The API changed in Prettier v3. Please update your plugin. See https://prettier.io/docs/en/plugins.html#optional-embed");
+  if (!i || u !== "auto") return;
+  if (i.length > 2) throw new Error("printer.embed has too many parameters. The API changed in Prettier v3. Please update your plugin. See https://prettier.io/docs/en/plugins.html#optional-embed");
   let D = X(i.getVisitorKeys ?? a), l = [];
   p();
   let d = e.stack;
-  for (let { print: c, node: F, pathStack: m } of l)
-    try {
-      e.stack = m;
-      let E = await c(f, t, e, r);
-      E && o.set(F, E);
-    } catch (E) {
-      if (globalThis.PRETTIER_DEBUG)
-        throw E;
-    }
+  for (let { print: c, node: F, pathStack: m } of l) try {
+    e.stack = m;
+    let E = await c(f, t, e, r);
+    E && o.set(F, E);
+  } catch (E) {
+    if (globalThis.PRETTIER_DEBUG) throw E;
+  }
   e.stack = d;
   function f(c, F) {
     return Po(c, F, r, n);
   }
   function p() {
     let { node: c } = e;
-    if (c === null || typeof c != "object" || s(e))
-      return;
-    for (let m of D(c))
-      Array.isArray(c[m]) ? e.each(p, m) : e.call(p, m);
+    if (c === null || typeof c != "object" || s(e)) return;
+    for (let m of D(c)) Array.isArray(c[m]) ? e.each(p, m) : e.call(p, m);
     let F = i(e, r);
     if (F) {
       if (typeof F == "function") {
@@ -2167,8 +1962,7 @@ async function Po(e, t, r, n) {
 }
 function Io(e, t) {
   let { originalText: r, [Symbol.for("comments")]: n, locStart: o, locEnd: u, [Symbol.for("printedComments")]: i } = t, { node: s } = e, a = o(s), D = u(s);
-  for (let l of n)
-    o(l) >= a && u(l) <= D && i.add(l);
+  for (let l of n) o(l) >= a && u(l) <= D && i.add(l);
   return r.slice(a, D);
 }
 var zn = Io;
@@ -2184,11 +1978,9 @@ async function Ye(e, t) {
   function a(D) {
     o(n);
     let l = n.node;
-    if (l == null)
-      return "";
+    if (l == null) return "";
     let d = l && typeof l == "object" && D === void 0;
-    if (d && r.has(l))
-      return r.get(l);
+    if (d && r.has(l)) return r.get(l);
     let f = Gn(n, t, s, D, u);
     return d && r.set(l, f), f;
   }
@@ -2206,39 +1998,31 @@ async function Qt(e, t) {
 }
 function Ro(e, t) {
   let { cursorOffset: r, locStart: n, locEnd: o } = t, u = X(t.printer.getVisitorKeys), i = (a) => n(a) <= r && o(a) >= r, s = e;
-  for (let a of Ur(e, { getVisitorKeys: u, filter: i }))
-    s = a;
+  for (let a of Ur(e, { getVisitorKeys: u, filter: i })) s = a;
   return s;
 }
 var Kn = Ro;
 function Yo(e, t) {
   let { printer: { massageAstNode: r, getVisitorKeys: n } } = t;
-  if (!r)
-    return e;
+  if (!r) return e;
   let o = X(n), u = r.ignoredProperties ?? /* @__PURE__ */ new Set();
   return i(e);
   function i(s, a) {
-    if (!(s !== null && typeof s == "object"))
-      return s;
-    if (Array.isArray(s))
-      return s.map((f) => i(f, a)).filter(Boolean);
+    if (!(s !== null && typeof s == "object")) return s;
+    if (Array.isArray(s)) return s.map((f) => i(f, a)).filter(Boolean);
     let D = {}, l = new Set(o(s));
-    for (let f in s)
-      !Object.prototype.hasOwnProperty.call(s, f) || u.has(f) || (l.has(f) ? D[f] = i(s[f], s) : D[f] = s[f]);
+    for (let f in s) !Object.prototype.hasOwnProperty.call(s, f) || u.has(f) || (l.has(f) ? D[f] = i(s[f], s) : D[f] = s[f]);
     let d = r(s, D, a);
-    if (d !== null)
-      return d ?? D;
+    if (d !== null) return d ?? D;
   }
 }
 var qn = Yo;
 var jo = (e, t, r) => {
   if (!(e && t == null)) {
-    if (t.findLastIndex)
-      return t.findLastIndex(r);
+    if (t.findLastIndex) return t.findLastIndex(r);
     for (let n = t.length - 1; n >= 0; n--) {
       let o = t[n];
-      if (r(o, n, t))
-        return n;
+      if (r(o, n, t)) return n;
     }
     return -1;
   }
@@ -2254,22 +2038,15 @@ function Xn(e) {
 }
 function Mo(e, t, { locStart: r, locEnd: n }) {
   let o = e.node, u = t.node;
-  if (o === u)
-    return { startNode: o, endNode: u };
+  if (o === u) return { startNode: o, endNode: u };
   let i = r(e.node);
-  for (let a of Xn(t.parentNodes))
-    if (r(a) >= i)
-      u = a;
-    else
-      break;
+  for (let a of Xn(t.parentNodes)) if (r(a) >= i) u = a;
+  else break;
   let s = n(t.node);
   for (let a of Xn(e.parentNodes)) {
-    if (n(a) <= s)
-      o = a;
-    else
-      break;
-    if (o === u)
-      break;
+    if (n(a) <= s) o = a;
+    else break;
+    if (o === u) break;
   }
   return { startNode: o, endNode: u };
 }
@@ -2278,11 +2055,9 @@ function er(e, t, r, n, o = [], u) {
   if (!(t > D || t < a || u === "rangeEnd" && t === a || u === "rangeStart" && t === D)) {
     for (let l of ut(e, r)) {
       let d = er(l, t, r, n, [e, ...o], u);
-      if (d)
-        return d;
+      if (d) return d;
     }
-    if (!n || n(e, o[0]))
-      return { node: e, parentNodes: o };
+    if (!n || n(e, o[0])) return { node: e, parentNodes: o };
   }
 }
 function $o(e, t) {
@@ -2290,8 +2065,7 @@ function $o(e, t) {
 }
 var Qn = /* @__PURE__ */ new Set(["JsonRoot", "ObjectExpression", "ArrayExpression", "StringLiteral", "NumericLiteral", "BooleanLiteral", "NullLiteral", "UnaryExpression", "TemplateLiteral"]), Vo = /* @__PURE__ */ new Set(["OperationDefinition", "FragmentDefinition", "VariableDefinition", "TypeExtensionDefinition", "ObjectTypeDefinition", "FieldDefinition", "DirectiveDefinition", "EnumTypeDefinition", "EnumValueDefinition", "InputValueDefinition", "InputObjectTypeDefinition", "SchemaDefinition", "OperationTypeDefinition", "InterfaceTypeDefinition", "UnionTypeDefinition", "ScalarTypeDefinition"]);
 function Zn(e, t, r) {
-  if (!t)
-    return false;
+  if (!t) return false;
   switch (e.parser) {
     case "flow":
     case "babel":
@@ -2319,24 +2093,19 @@ function eu(e, t, r) {
   let { rangeStart: n, rangeEnd: o, locStart: u, locEnd: i } = t;
   ke.ok(o > n);
   let s = e.slice(n, o).search(/\S/u), a = s === -1;
-  if (!a)
-    for (n += s; o > n && !/\S/u.test(e[o - 1]); --o)
-      ;
+  if (!a) for (n += s; o > n && !/\S/u.test(e[o - 1]); --o) ;
   let D = er(r, n, t, (p, c) => Zn(t, p, c), [], "rangeStart"), l = a ? D : er(r, o, t, (p) => Zn(t, p), [], "rangeEnd");
-  if (!D || !l)
-    return { rangeStart: 0, rangeEnd: 0 };
+  if (!D || !l) return { rangeStart: 0, rangeEnd: 0 };
   let d, f;
   if (Ho(t)) {
     let p = Wo(D, l);
     d = p, f = p;
-  } else
-    ({ startNode: d, endNode: f } = Mo(D, l, t));
+  } else ({ startNode: d, endNode: f } = Mo(D, l, t));
   return { rangeStart: Math.min(u(d), u(f)), rangeEnd: Math.max(i(d), i(f)) };
 }
 var uu = "\uFEFF", tu = Symbol("cursor");
 async function ou(e, t, r = 0) {
-  if (!e || e.trim().length === 0)
-    return { formatted: "", cursorOffset: -1, comments: [] };
+  if (!e || e.trim().length === 0) return { formatted: "", cursorOffset: -1, comments: [] };
   let { ast: n, text: o } = await ce(e, t);
   t.cursorOffset >= 0 && (t.cursorNode = Kn(n, t));
   let u = await Ye(n, t, r);
@@ -2349,17 +2118,13 @@ async function ou(e, t, r = 0) {
   let s = t[Symbol.for("comments")];
   if (t.cursorOffset >= 0) {
     let a, D, l, d, f;
-    if (t.cursorNode && i.cursorNodeText ? (a = t.locStart(t.cursorNode), D = o.slice(a, t.locEnd(t.cursorNode)), l = t.cursorOffset - a, d = i.cursorNodeStart, f = i.cursorNodeText) : (a = 0, D = o, l = t.cursorOffset, d = 0, f = i.formatted), D === f)
-      return { formatted: i.formatted, cursorOffset: d + l, comments: s };
+    if (t.cursorNode && i.cursorNodeText ? (a = t.locStart(t.cursorNode), D = o.slice(a, t.locEnd(t.cursorNode)), l = t.cursorOffset - a, d = i.cursorNodeStart, f = i.cursorNodeText) : (a = 0, D = o, l = t.cursorOffset, d = 0, f = i.formatted), D === f) return { formatted: i.formatted, cursorOffset: d + l, comments: s };
     let p = D.split("");
     p.splice(l, 0, tu);
     let c = f.split(""), F = dr(p, c), m = d;
-    for (let E of F)
-      if (E.removed) {
-        if (E.value.includes(tu))
-          break;
-      } else
-        m += E.count;
+    for (let E of F) if (E.removed) {
+      if (E.value.includes(tu)) break;
+    } else m += E.count;
     return { formatted: i.formatted, cursorOffset: m, comments: s };
   }
   return { formatted: i.formatted, cursorOffset: -1, comments: s };
@@ -2400,8 +2165,7 @@ async function nu(e, t) {
 }
 async function rr(e, t) {
   let { hasBOM: r, text: n, options: o } = iu(e, await se(t));
-  if (o.rangeStart >= o.rangeEnd && n !== "" || o.requirePragma && !await nu(n, o))
-    return { formatted: e, cursorOffset: t.cursorOffset, comments: [] };
+  if (o.rangeStart >= o.rangeEnd && n !== "" || o.requirePragma && !await nu(n, o)) return { formatted: e, cursorOffset: t.cursorOffset, comments: [] };
   let u;
   return o.rangeStart > 0 || o.rangeEnd < n.length ? u = await Uo(n, o) : (!o.requirePragma && o.insertPragma && o.printer.insertPragma && !await nu(n, o) && (n = o.printer.insertPragma(n)), u = await ou(n, o)), r && (u.formatted = uu + u.formatted, u.cursorOffset >= 0 && u.cursorOffset++), u;
 }
@@ -2433,12 +2197,9 @@ var fu = "3.3.3";
 var or = {};
 We(or, { addDanglingComment: () => re, addLeadingComment: () => ue, addTrailingComment: () => oe, getAlignmentSize: () => me, getIndentSize: () => pu, getMaxContinuousCount: () => du, getNextNonSpaceNonCommentCharacter: () => Fu, getNextNonSpaceNonCommentCharacterIndex: () => si, getStringWidth: () => Oe, hasNewline: () => V, hasNewlineInRange: () => mu, hasSpaces: () => Eu, isNextLineEmpty: () => ci, isNextLineEmptyAfterIndex: () => gt, isPreviousLineEmpty: () => Di, makeString: () => hu, skip: () => Ee, skipEverythingButNewLine: () => nt, skipInlineComment: () => Ce, skipNewline: () => M, skipSpaces: () => T, skipToLineEnd: () => rt, skipTrailingComment: () => ge, skipWhitespace: () => zr });
 function Jo(e, t) {
-  if (t === false)
-    return false;
+  if (t === false) return false;
   if (e.charAt(t) === "/" && e.charAt(t + 1) === "*") {
-    for (let r = t + 2; r < e.length; ++r)
-      if (e.charAt(r) === "*" && e.charAt(r + 1) === "/")
-        return r + 2;
+    for (let r = t + 2; r < e.length; ++r) if (e.charAt(r) === "*" && e.charAt(r + 1) === "/") return r + 2;
   }
   return t;
 }
@@ -2449,15 +2210,13 @@ function Xo(e, t) {
 var ge = Xo;
 function Zo(e, t) {
   let r = null, n = t;
-  for (; n !== r; )
-    r = n, n = T(e, n), n = Ce(e, n), n = ge(e, n), n = M(e, n);
+  for (; n !== r; ) r = n, n = T(e, n), n = Ce(e, n), n = ge(e, n), n = M(e, n);
   return n;
 }
 var je = Zo;
 function Qo(e, t) {
   let r = null, n = t;
-  for (; n !== r; )
-    r = n, n = rt(e, n), n = Ce(e, n), n = T(e, n);
+  for (; n !== r; ) r = n, n = rt(e, n), n = Ce(e, n), n = T(e, n);
   return n = ge(e, n), n = M(e, n), n !== false && V(e, n);
 }
 var gt = Qo;
@@ -2468,8 +2227,7 @@ function ei(e, t) {
 }
 var pu = ei;
 function ur(e) {
-  if (typeof e != "string")
-    throw new TypeError("Expected a string");
+  if (typeof e != "string") throw new TypeError("Expected a string");
   return e.replace(/[|\\{}()[\]^$+*?.]/g, "\\$&").replace(/-/g, "\\x2d");
 }
 function ti(e, t) {
@@ -2483,10 +2241,8 @@ function ri(e, t) {
 }
 var Fu = ri;
 function ni(e, t, r) {
-  for (let n = t; n < r; ++n)
-    if (e.charAt(n) === `
-`)
-      return true;
+  for (let n = t; n < r; ++n) if (e.charAt(n) === `
+`) return true;
   return false;
 }
 var mu = ni;