@frontify/guideline-blocks-settings 1.0.13-alpha.2 → 1.0.13-alpha.3

package/dist/node_modules/.pnpm/slate@0.102.0/node_modules/slate/dist/index.es.es.js

@@ -1,4014 +0,0 @@
-import { isPlainObject as H } from "../../../../is-plain-object@5.0.0/node_modules/is-plain-object/dist/is-plain-object.es.js";
-import { produce as Ru, createDraft as Mu, finishDraft as Wu, isDraft as Te } from "../../../../immer@10.1.3/node_modules/immer/dist/immer.es.js";
-var Ie = {
-  transform(e, u) {
-    var {
-      current: r,
-      affinity: n
-    } = e;
-    if (r != null) {
-      var t = o.transform(r, u, {
-        affinity: n
-      });
-      e.current = t, t == null && e.unref();
-    }
-  }
-}, ze = {
-  transform(e, u) {
-    var {
-      current: r,
-      affinity: n
-    } = e;
-    if (r != null) {
-      var t = $.transform(r, u, {
-        affinity: n
-      });
-      e.current = t, t == null && e.unref();
-    }
-  }
-}, qe = {
-  transform(e, u) {
-    var {
-      current: r,
-      affinity: n
-    } = e;
-    if (r != null) {
-      var t = g.transform(r, u, {
-        affinity: n
-      });
-      e.current = t, t == null && e.unref();
-    }
-  }
-}, Ou = /* @__PURE__ */ new WeakMap(), yu = /* @__PURE__ */ new WeakMap(), Eu = /* @__PURE__ */ new WeakMap(), Fe = /* @__PURE__ */ new WeakMap(), Ku = /* @__PURE__ */ new WeakMap(), Hu = /* @__PURE__ */ new WeakMap(), Ju = /* @__PURE__ */ new WeakMap(), o = {
-  ancestors(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-      reverse: r = !1
-    } = u, n = o.levels(e, u);
-    return r ? n = n.slice(1) : n = n.slice(0, -1), n;
-  },
-  common(e, u) {
-    for (var r = [], n = 0; n < e.length && n < u.length; n++) {
-      var t = e[n], a = u[n];
-      if (t !== a)
-        break;
-      r.push(t);
-    }
-    return r;
-  },
-  compare(e, u) {
-    for (var r = Math.min(e.length, u.length), n = 0; n < r; n++) {
-      if (e[n] < u[n]) return -1;
-      if (e[n] > u[n]) return 1;
-    }
-    return 0;
-  },
-  endsAfter(e, u) {
-    var r = e.length - 1, n = e.slice(0, r), t = u.slice(0, r), a = e[r], s = u[r];
-    return o.equals(n, t) && a > s;
-  },
-  endsAt(e, u) {
-    var r = e.length, n = e.slice(0, r), t = u.slice(0, r);
-    return o.equals(n, t);
-  },
-  endsBefore(e, u) {
-    var r = e.length - 1, n = e.slice(0, r), t = u.slice(0, r), a = e[r], s = u[r];
-    return o.equals(n, t) && a < s;
-  },
-  equals(e, u) {
-    return e.length === u.length && e.every((r, n) => r === u[n]);
-  },
-  hasPrevious(e) {
-    return e[e.length - 1] > 0;
-  },
-  isAfter(e, u) {
-    return o.compare(e, u) === 1;
-  },
-  isAncestor(e, u) {
-    return e.length < u.length && o.compare(e, u) === 0;
-  },
-  isBefore(e, u) {
-    return o.compare(e, u) === -1;
-  },
-  isChild(e, u) {
-    return e.length === u.length + 1 && o.compare(e, u) === 0;
-  },
-  isCommon(e, u) {
-    return e.length <= u.length && o.compare(e, u) === 0;
-  },
-  isDescendant(e, u) {
-    return e.length > u.length && o.compare(e, u) === 0;
-  },
-  isParent(e, u) {
-    return e.length + 1 === u.length && o.compare(e, u) === 0;
-  },
-  isPath(e) {
-    return Array.isArray(e) && (e.length === 0 || typeof e[0] == "number");
-  },
-  isSibling(e, u) {
-    if (e.length !== u.length)
-      return !1;
-    var r = e.slice(0, -1), n = u.slice(0, -1), t = e[e.length - 1], a = u[u.length - 1];
-    return t !== a && o.equals(r, n);
-  },
-  levels(e) {
-    for (var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-      reverse: r = !1
-    } = u, n = [], t = 0; t <= e.length; t++)
-      n.push(e.slice(0, t));
-    return r && n.reverse(), n;
-  },
-  next(e) {
-    if (e.length === 0)
-      throw new Error("Cannot get the next path of a root path [".concat(e, "], because it has no next index."));
-    var u = e[e.length - 1];
-    return e.slice(0, -1).concat(u + 1);
-  },
-  operationCanTransformPath(e) {
-    switch (e.type) {
-      case "insert_node":
-      case "remove_node":
-      case "merge_node":
-      case "split_node":
-      case "move_node":
-        return !0;
-      default:
-        return !1;
-    }
-  },
-  parent(e) {
-    if (e.length === 0)
-      throw new Error("Cannot get the parent path of the root path [".concat(e, "]."));
-    return e.slice(0, -1);
-  },
-  previous(e) {
-    if (e.length === 0)
-      throw new Error("Cannot get the previous path of a root path [".concat(e, "], because it has no previous index."));
-    var u = e[e.length - 1];
-    if (u <= 0)
-      throw new Error("Cannot get the previous path of a first child path [".concat(e, "] because it would result in a negative index."));
-    return e.slice(0, -1).concat(u - 1);
-  },
-  relative(e, u) {
-    if (!o.isAncestor(u, e) && !o.equals(e, u))
-      throw new Error("Cannot get the relative path of [".concat(e, "] inside ancestor [").concat(u, "], because it is not above or equal to the path."));
-    return e.slice(u.length);
-  },
-  transform(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    if (!e) return null;
-    var n = [...e], {
-      affinity: t = "forward"
-    } = r;
-    if (e.length === 0)
-      return n;
-    switch (u.type) {
-      case "insert_node": {
-        var {
-          path: a
-        } = u;
-        (o.equals(a, n) || o.endsBefore(a, n) || o.isAncestor(a, n)) && (n[a.length - 1] += 1);
-        break;
-      }
-      case "remove_node": {
-        var {
-          path: s
-        } = u;
-        if (o.equals(s, n) || o.isAncestor(s, n))
-          return null;
-        o.endsBefore(s, n) && (n[s.length - 1] -= 1);
-        break;
-      }
-      case "merge_node": {
-        var {
-          path: f,
-          position: D
-        } = u;
-        o.equals(f, n) || o.endsBefore(f, n) ? n[f.length - 1] -= 1 : o.isAncestor(f, n) && (n[f.length - 1] -= 1, n[f.length] += D);
-        break;
-      }
-      case "split_node": {
-        var {
-          path: l,
-          position: c
-        } = u;
-        if (o.equals(l, n)) {
-          if (t === "forward")
-            n[n.length - 1] += 1;
-          else if (t !== "backward") return null;
-        } else o.endsBefore(l, n) ? n[l.length - 1] += 1 : o.isAncestor(l, n) && e[l.length] >= c && (n[l.length - 1] += 1, n[l.length] -= c);
-        break;
-      }
-      case "move_node": {
-        var {
-          path: C,
-          newPath: v
-        } = u;
-        if (o.equals(C, v))
-          return n;
-        if (o.isAncestor(C, n) || o.equals(C, n)) {
-          var B = v.slice();
-          return o.endsBefore(C, v) && C.length < v.length && (B[C.length - 1] -= 1), B.concat(n.slice(C.length));
-        } else o.isSibling(C, v) && (o.isAncestor(v, n) || o.equals(v, n)) ? o.endsBefore(C, n) ? n[C.length - 1] -= 1 : n[C.length - 1] += 1 : o.endsBefore(v, n) || o.equals(v, n) || o.isAncestor(v, n) ? (o.endsBefore(C, n) && (n[C.length - 1] -= 1), n[v.length - 1] += 1) : o.endsBefore(C, n) && (o.equals(v, n) && (n[v.length - 1] += 1), n[C.length - 1] -= 1);
-        break;
-      }
-    }
-    return n;
-  }
-};
-function pu(e) {
-  "@babel/helpers - typeof";
-  return pu = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(u) {
-    return typeof u;
-  } : function(u) {
-    return u && typeof Symbol == "function" && u.constructor === Symbol && u !== Symbol.prototype ? "symbol" : typeof u;
-  }, pu(e);
-}
-function Le(e, u) {
-  if (pu(e) !== "object" || e === null) return e;
-  var r = e[Symbol.toPrimitive];
-  if (r !== void 0) {
-    var n = r.call(e, u);
-    if (pu(n) !== "object") return n;
-    throw new TypeError("@@toPrimitive must return a primitive value.");
-  }
-  return (u === "string" ? String : Number)(e);
-}
-function Ve(e) {
-  var u = Le(e, "string");
-  return pu(u) === "symbol" ? u : String(u);
-}
-function G(e, u, r) {
-  return u = Ve(u), u in e ? Object.defineProperty(e, u, {
-    value: r,
-    enumerable: !0,
-    configurable: !0,
-    writable: !0
-  }) : e[u] = r, e;
-}
-function Zu(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function hu(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? Zu(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : Zu(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var Me = (e, u, r) => {
-  switch (r.type) {
-    case "insert_node": {
-      var {
-        path: n,
-        node: t
-      } = r, a = h.parent(e, n), s = n[n.length - 1];
-      if (s > a.children.length)
-        throw new Error('Cannot apply an "insert_node" operation at path ['.concat(n, "] because the destination is past the end of the node."));
-      if (a.children.splice(s, 0, t), u)
-        for (var [f, D] of g.points(u))
-          u[D] = $.transform(f, r);
-      break;
-    }
-    case "insert_text": {
-      var {
-        path: l,
-        offset: c,
-        text: C
-      } = r;
-      if (C.length === 0) break;
-      var v = h.leaf(e, l), B = v.text.slice(0, c), A = v.text.slice(c);
-      if (v.text = B + C + A, u)
-        for (var [E, m] of g.points(u))
-          u[m] = $.transform(E, r);
-      break;
-    }
-    case "merge_node": {
-      var {
-        path: p
-      } = r, d = h.get(e, p), x = o.previous(p), O = h.get(e, x), N = h.parent(e, p), S = p[p.length - 1];
-      if (b.isText(d) && b.isText(O))
-        O.text += d.text;
-      else if (!b.isText(d) && !b.isText(O))
-        O.children.push(...d.children);
-      else
-        throw new Error('Cannot apply a "merge_node" operation at path ['.concat(p, "] to nodes of different interfaces: ").concat(Y.stringify(d), " ").concat(Y.stringify(O)));
-      if (N.children.splice(S, 1), u)
-        for (var [P, z] of g.points(u))
-          u[z] = $.transform(P, r);
-      break;
-    }
-    case "move_node": {
-      var {
-        path: T,
-        newPath: j
-      } = r;
-      if (o.isAncestor(T, j))
-        throw new Error("Cannot move a path [".concat(T, "] to new path [").concat(j, "] because the destination is inside itself."));
-      var I = h.get(e, T), q = h.parent(e, T), W = T[T.length - 1];
-      q.children.splice(W, 1);
-      var M = o.transform(T, r), J = h.get(e, o.parent(M)), Q = M[M.length - 1];
-      if (J.children.splice(Q, 0, I), u)
-        for (var [X, k] of g.points(u))
-          u[k] = $.transform(X, r);
-      break;
-    }
-    case "remove_node": {
-      var {
-        path: V
-      } = r, U = V[V.length - 1], uu = h.parent(e, V);
-      if (uu.children.splice(U, 1), u)
-        for (var [_, eu] of g.points(u)) {
-          var au = $.transform(_, r);
-          if (u != null && au != null)
-            u[eu] = au;
-          else {
-            var R = void 0, K = void 0;
-            for (var [tu, su] of h.texts(e))
-              if (o.compare(su, V) === -1)
-                R = [tu, su];
-              else {
-                K = [tu, su];
-                break;
-              }
-            var fu = !1;
-            R && K && (o.equals(K[1], V) ? fu = !o.hasPrevious(K[1]) : fu = o.common(R[1], V).length < o.common(K[1], V).length), R && !fu ? (_.path = R[1], _.offset = R[0].text.length) : K ? (_.path = K[1], _.offset = 0) : u = null;
-          }
-        }
-      break;
-    }
-    case "remove_text": {
-      var {
-        path: gu,
-        offset: Au,
-        text: mu
-      } = r;
-      if (mu.length === 0) break;
-      var ou = h.leaf(e, gu), Z = ou.text.slice(0, Au), Pu = ou.text.slice(Au + mu.length);
-      if (ou.text = Z + Pu, u)
-        for (var [be, we] of g.points(u))
-          u[we] = $.transform(be, r);
-      break;
-    }
-    case "set_node": {
-      var {
-        path: Iu,
-        properties: Oe,
-        newProperties: xu
-      } = r;
-      if (Iu.length === 0)
-        throw new Error("Cannot set properties on the root node!");
-      var ju = h.get(e, Iu);
-      for (var lu in xu) {
-        if (lu === "children" || lu === "text")
-          throw new Error('Cannot set the "'.concat(lu, '" property of nodes!'));
-        var zu = xu[lu];
-        zu == null ? delete ju[lu] : ju[lu] = zu;
-      }
-      for (var qu in Oe)
-        xu.hasOwnProperty(qu) || delete ju[qu];
-      break;
-    }
-    case "set_selection": {
-      var {
-        newProperties: iu
-      } = r;
-      if (iu == null)
-        u = iu;
-      else {
-        if (u == null) {
-          if (!g.isRange(iu))
-            throw new Error('Cannot apply an incomplete "set_selection" operation properties '.concat(Y.stringify(iu), " when there is no current selection."));
-          u = hu({}, iu);
-        }
-        for (var cu in iu) {
-          var Lu = iu[cu];
-          if (Lu == null) {
-            if (cu === "anchor" || cu === "focus")
-              throw new Error('Cannot remove the "'.concat(cu, '" selection property'));
-            delete u[cu];
-          } else
-            u[cu] = Lu;
-        }
-      }
-      break;
-    }
-    case "split_node": {
-      var {
-        path: Cu,
-        position: du,
-        properties: Vu
-      } = r;
-      if (Cu.length === 0)
-        throw new Error('Cannot apply a "split_node" operation at path ['.concat(Cu, "] because the root node cannot be split."));
-      var Du = h.get(e, Cu), ye = h.parent(e, Cu), Pe = Cu[Cu.length - 1], Nu;
-      if (b.isText(Du)) {
-        var xe = Du.text.slice(0, du), je = Du.text.slice(du);
-        Du.text = xe, Nu = hu(hu({}, Vu), {}, {
-          text: je
-        });
-      } else {
-        var Ne = Du.children.slice(0, du), Re = Du.children.slice(du);
-        Du.children = Ne, Nu = hu(hu({}, Vu), {}, {
-          children: Re
-        });
-      }
-      if (ye.children.splice(Pe + 1, 0, Nu), u)
-        for (var [$e, Se] of g.points(u))
-          u[Se] = $.transform($e, r);
-      break;
-    }
-  }
-  return u;
-}, We = {
-  transform(e, u) {
-    e.children = Mu(e.children);
-    var r = e.selection && Mu(e.selection);
-    try {
-      r = Me(e, r, u);
-    } finally {
-      e.children = Wu(e.children), r ? e.selection = Te(r) ? Wu(r) : r : e.selection = null;
-    }
-  }
-}, Ke = {
-  insertNodes(e, u, r) {
-    e.insertNodes(u, r);
-  },
-  liftNodes(e, u) {
-    e.liftNodes(u);
-  },
-  mergeNodes(e, u) {
-    e.mergeNodes(u);
-  },
-  moveNodes(e, u) {
-    e.moveNodes(u);
-  },
-  removeNodes(e, u) {
-    e.removeNodes(u);
-  },
-  setNodes(e, u, r) {
-    e.setNodes(u, r);
-  },
-  splitNodes(e, u) {
-    e.splitNodes(u);
-  },
-  unsetNodes(e, u, r) {
-    e.unsetNodes(u, r);
-  },
-  unwrapNodes(e, u) {
-    e.unwrapNodes(u);
-  },
-  wrapNodes(e, u, r) {
-    e.wrapNodes(u, r);
-  }
-}, He = {
-  collapse(e, u) {
-    e.collapse(u);
-  },
-  deselect(e) {
-    e.deselect();
-  },
-  move(e, u) {
-    e.move(u);
-  },
-  select(e, u) {
-    e.select(u);
-  },
-  setPoint(e, u, r) {
-    e.setPoint(u, r);
-  },
-  setSelection(e, u) {
-    e.setSelection(u);
-  }
-}, Ee = (e, u) => {
-  for (var r in e) {
-    var n = e[r], t = u[r];
-    if (H(n) && H(t)) {
-      if (!Ee(n, t)) return !1;
-    } else if (Array.isArray(n) && Array.isArray(t)) {
-      if (n.length !== t.length) return !1;
-      for (var a = 0; a < n.length; a++)
-        if (n[a] !== t[a]) return !1;
-    } else if (n !== t)
-      return !1;
-  }
-  for (var s in u)
-    if (e[s] === void 0 && u[s] !== void 0)
-      return !1;
-  return !0;
-};
-function Je(e, u) {
-  if (e == null) return {};
-  var r = {}, n = Object.keys(e), t, a;
-  for (a = 0; a < n.length; a++)
-    t = n[a], !(u.indexOf(t) >= 0) && (r[t] = e[t]);
-  return r;
-}
-function nu(e, u) {
-  if (e == null) return {};
-  var r = Je(e, u), n, t;
-  if (Object.getOwnPropertySymbols) {
-    var a = Object.getOwnPropertySymbols(e);
-    for (t = 0; t < a.length; t++)
-      n = a[t], !(u.indexOf(n) >= 0) && Object.prototype.propertyIsEnumerable.call(e, n) && (r[n] = e[n]);
-  }
-  return r;
-}
-var Ze = ["anchor", "focus"];
-function Gu(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function Ge(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? Gu(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : Gu(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var g = {
-  edges(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-      reverse: r = !1
-    } = u, {
-      anchor: n,
-      focus: t
-    } = e;
-    return g.isBackward(e) === r ? [n, t] : [t, n];
-  },
-  end(e) {
-    var [, u] = g.edges(e);
-    return u;
-  },
-  equals(e, u) {
-    return $.equals(e.anchor, u.anchor) && $.equals(e.focus, u.focus);
-  },
-  includes(e, u) {
-    if (g.isRange(u)) {
-      if (g.includes(e, u.anchor) || g.includes(e, u.focus))
-        return !0;
-      var [r, n] = g.edges(e), [t, a] = g.edges(u);
-      return $.isBefore(r, t) && $.isAfter(n, a);
-    }
-    var [s, f] = g.edges(e), D = !1, l = !1;
-    return $.isPoint(u) ? (D = $.compare(u, s) >= 0, l = $.compare(u, f) <= 0) : (D = o.compare(u, s.path) >= 0, l = o.compare(u, f.path) <= 0), D && l;
-  },
-  intersection(e, u) {
-    var r = nu(e, Ze), [n, t] = g.edges(e), [a, s] = g.edges(u), f = $.isBefore(n, a) ? a : n, D = $.isBefore(t, s) ? t : s;
-    return $.isBefore(D, f) ? null : Ge({
-      anchor: f,
-      focus: D
-    }, r);
-  },
-  isBackward(e) {
-    var {
-      anchor: u,
-      focus: r
-    } = e;
-    return $.isAfter(u, r);
-  },
-  isCollapsed(e) {
-    var {
-      anchor: u,
-      focus: r
-    } = e;
-    return $.equals(u, r);
-  },
-  isExpanded(e) {
-    return !g.isCollapsed(e);
-  },
-  isForward(e) {
-    return !g.isBackward(e);
-  },
-  isRange(e) {
-    return H(e) && $.isPoint(e.anchor) && $.isPoint(e.focus);
-  },
-  *points(e) {
-    yield [e.anchor, "anchor"], yield [e.focus, "focus"];
-  },
-  start(e) {
-    var [u] = g.edges(e);
-    return u;
-  },
-  transform(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    return Ru(e, (n) => {
-      if (n === null)
-        return null;
-      var {
-        affinity: t = "inward"
-      } = r, a, s;
-      if (t === "inward") {
-        var f = g.isCollapsed(n);
-        g.isForward(n) ? (a = "forward", s = f ? a : "backward") : (a = "backward", s = f ? a : "forward");
-      } else t === "outward" ? g.isForward(n) ? (a = "backward", s = "forward") : (a = "forward", s = "backward") : (a = t, s = t);
-      var D = $.transform(n.anchor, u, {
-        affinity: a
-      }), l = $.transform(n.focus, u, {
-        affinity: s
-      });
-      if (!D || !l)
-        return null;
-      n.anchor = D, n.focus = l;
-    });
-  }
-}, Uu = (e) => H(e) && h.isNodeList(e.children) && !i.isEditor(e), w = {
-  isAncestor(e) {
-    return H(e) && h.isNodeList(e.children);
-  },
-  isElement: Uu,
-  isElementList(e) {
-    return Array.isArray(e) && e.every((u) => w.isElement(u));
-  },
-  isElementProps(e) {
-    return e.children !== void 0;
-  },
-  isElementType: function(u, r) {
-    var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : "type";
-    return Uu(u) && u[n] === r;
-  },
-  matches(e, u) {
-    for (var r in u)
-      if (r !== "children" && e[r] !== u[r])
-        return !1;
-    return !0;
-  }
-}, Ue = ["children"], Ye = ["text"], Yu = /* @__PURE__ */ new WeakMap(), h = {
-  ancestor(e, u) {
-    var r = h.get(e, u);
-    if (b.isText(r))
-      throw new Error("Cannot get the ancestor node at path [".concat(u, "] because it refers to a text node instead: ").concat(Y.stringify(r)));
-    return r;
-  },
-  ancestors(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    return function* () {
-      for (var n of o.ancestors(u, r)) {
-        var t = h.ancestor(e, n), a = [t, n];
-        yield a;
-      }
-    }();
-  },
-  child(e, u) {
-    if (b.isText(e))
-      throw new Error("Cannot get the child of a text node: ".concat(Y.stringify(e)));
-    var r = e.children[u];
-    if (r == null)
-      throw new Error("Cannot get child at index `".concat(u, "` in node: ").concat(Y.stringify(e)));
-    return r;
-  },
-  children(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    return function* () {
-      for (var {
-        reverse: n = !1
-      } = r, t = h.ancestor(e, u), {
-        children: a
-      } = t, s = n ? a.length - 1 : 0; n ? s >= 0 : s < a.length; ) {
-        var f = h.child(t, s), D = u.concat(s);
-        yield [f, D], s = n ? s - 1 : s + 1;
-      }
-    }();
-  },
-  common(e, u, r) {
-    var n = o.common(u, r), t = h.get(e, n);
-    return [t, n];
-  },
-  descendant(e, u) {
-    var r = h.get(e, u);
-    if (i.isEditor(r))
-      throw new Error("Cannot get the descendant node at path [".concat(u, "] because it refers to the root editor node instead: ").concat(Y.stringify(r)));
-    return r;
-  },
-  descendants(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-    return function* () {
-      for (var [r, n] of h.nodes(e, u))
-        n.length !== 0 && (yield [r, n]);
-    }();
-  },
-  elements(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-    return function* () {
-      for (var [r, n] of h.nodes(e, u))
-        w.isElement(r) && (yield [r, n]);
-    }();
-  },
-  extractProps(e) {
-    if (w.isAncestor(e)) {
-      var u = nu(e, Ue);
-      return u;
-    } else {
-      var u = nu(e, Ye);
-      return u;
-    }
-  },
-  first(e, u) {
-    for (var r = u.slice(), n = h.get(e, r); n && !(b.isText(n) || n.children.length === 0); )
-      n = n.children[0], r.push(0);
-    return [n, r];
-  },
-  fragment(e, u) {
-    if (b.isText(e))
-      throw new Error("Cannot get a fragment starting from a root text node: ".concat(Y.stringify(e)));
-    var r = Ru({
-      children: e.children
-    }, (n) => {
-      var [t, a] = g.edges(u), s = h.nodes(n, {
-        reverse: !0,
-        pass: (v) => {
-          var [, B] = v;
-          return !g.includes(u, B);
-        }
-      });
-      for (var [, f] of s) {
-        if (!g.includes(u, f)) {
-          var D = h.parent(n, f), l = f[f.length - 1];
-          D.children.splice(l, 1);
-        }
-        if (o.equals(f, a.path)) {
-          var c = h.leaf(n, f);
-          c.text = c.text.slice(0, a.offset);
-        }
-        if (o.equals(f, t.path)) {
-          var C = h.leaf(n, f);
-          C.text = C.text.slice(t.offset);
-        }
-      }
-      i.isEditor(n) && (n.selection = null);
-    });
-    return r.children;
-  },
-  get(e, u) {
-    for (var r = e, n = 0; n < u.length; n++) {
-      var t = u[n];
-      if (b.isText(r) || !r.children[t])
-        throw new Error("Cannot find a descendant at path [".concat(u, "] in node: ").concat(Y.stringify(e)));
-      r = r.children[t];
-    }
-    return r;
-  },
-  has(e, u) {
-    for (var r = e, n = 0; n < u.length; n++) {
-      var t = u[n];
-      if (b.isText(r) || !r.children[t])
-        return !1;
-      r = r.children[t];
-    }
-    return !0;
-  },
-  isNode(e) {
-    return b.isText(e) || w.isElement(e) || i.isEditor(e);
-  },
-  isNodeList(e) {
-    if (!Array.isArray(e))
-      return !1;
-    var u = Yu.get(e);
-    if (u !== void 0)
-      return u;
-    var r = e.every((n) => h.isNode(n));
-    return Yu.set(e, r), r;
-  },
-  last(e, u) {
-    for (var r = u.slice(), n = h.get(e, r); n && !(b.isText(n) || n.children.length === 0); ) {
-      var t = n.children.length - 1;
-      n = n.children[t], r.push(t);
-    }
-    return [n, r];
-  },
-  leaf(e, u) {
-    var r = h.get(e, u);
-    if (!b.isText(r))
-      throw new Error("Cannot get the leaf node at path [".concat(u, "] because it refers to a non-leaf node: ").concat(Y.stringify(r)));
-    return r;
-  },
-  levels(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    return function* () {
-      for (var n of o.levels(u, r)) {
-        var t = h.get(e, n);
-        yield [t, n];
-      }
-    }();
-  },
-  matches(e, u) {
-    return w.isElement(e) && w.isElementProps(u) && w.matches(e, u) || b.isText(e) && b.isTextProps(u) && b.matches(e, u);
-  },
-  nodes(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-    return function* () {
-      for (var {
-        pass: r,
-        reverse: n = !1
-      } = u, {
-        from: t = [],
-        to: a
-      } = u, s = /* @__PURE__ */ new Set(), f = [], D = e; !(a && (n ? o.isBefore(f, a) : o.isAfter(f, a))); ) {
-        if (s.has(D) || (yield [D, f]), !s.has(D) && !b.isText(D) && D.children.length !== 0 && (r == null || r([D, f]) === !1)) {
-          s.add(D);
-          var l = n ? D.children.length - 1 : 0;
-          o.isAncestor(f, t) && (l = t[f.length]), f = f.concat(l), D = h.get(e, f);
-          continue;
-        }
-        if (f.length === 0)
-          break;
-        if (!n) {
-          var c = o.next(f);
-          if (h.has(e, c)) {
-            f = c, D = h.get(e, f);
-            continue;
-          }
-        }
-        if (n && f[f.length - 1] !== 0) {
-          var C = o.previous(f);
-          f = C, D = h.get(e, f);
-          continue;
-        }
-        f = o.parent(f), D = h.get(e, f), s.add(D);
-      }
-    }();
-  },
-  parent(e, u) {
-    var r = o.parent(u), n = h.get(e, r);
-    if (b.isText(n))
-      throw new Error("Cannot get the parent of path [".concat(u, "] because it does not exist in the root."));
-    return n;
-  },
-  string(e) {
-    return b.isText(e) ? e.text : e.children.map(h.string).join("");
-  },
-  texts(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-    return function* () {
-      for (var [r, n] of h.nodes(e, u))
-        b.isText(r) && (yield [r, n]);
-    }();
-  }
-};
-function Qu(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function L(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? Qu(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : Qu(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var Fu = {
-  isNodeOperation(e) {
-    return Fu.isOperation(e) && e.type.endsWith("_node");
-  },
-  isOperation(e) {
-    if (!H(e))
-      return !1;
-    switch (e.type) {
-      case "insert_node":
-        return o.isPath(e.path) && h.isNode(e.node);
-      case "insert_text":
-        return typeof e.offset == "number" && typeof e.text == "string" && o.isPath(e.path);
-      case "merge_node":
-        return typeof e.position == "number" && o.isPath(e.path) && H(e.properties);
-      case "move_node":
-        return o.isPath(e.path) && o.isPath(e.newPath);
-      case "remove_node":
-        return o.isPath(e.path) && h.isNode(e.node);
-      case "remove_text":
-        return typeof e.offset == "number" && typeof e.text == "string" && o.isPath(e.path);
-      case "set_node":
-        return o.isPath(e.path) && H(e.properties) && H(e.newProperties);
-      case "set_selection":
-        return e.properties === null && g.isRange(e.newProperties) || e.newProperties === null && g.isRange(e.properties) || H(e.properties) && H(e.newProperties);
-      case "split_node":
-        return o.isPath(e.path) && typeof e.position == "number" && H(e.properties);
-      default:
-        return !1;
-    }
-  },
-  isOperationList(e) {
-    return Array.isArray(e) && e.every((u) => Fu.isOperation(u));
-  },
-  isSelectionOperation(e) {
-    return Fu.isOperation(e) && e.type.endsWith("_selection");
-  },
-  isTextOperation(e) {
-    return Fu.isOperation(e) && e.type.endsWith("_text");
-  },
-  inverse(e) {
-    switch (e.type) {
-      case "insert_node":
-        return L(L({}, e), {}, {
-          type: "remove_node"
-        });
-      case "insert_text":
-        return L(L({}, e), {}, {
-          type: "remove_text"
-        });
-      case "merge_node":
-        return L(L({}, e), {}, {
-          type: "split_node",
-          path: o.previous(e.path)
-        });
-      case "move_node": {
-        var {
-          newPath: u,
-          path: r
-        } = e;
-        if (o.equals(u, r))
-          return e;
-        if (o.isSibling(r, u))
-          return L(L({}, e), {}, {
-            path: u,
-            newPath: r
-          });
-        var n = o.transform(r, e), t = o.transform(o.next(r), e);
-        return L(L({}, e), {}, {
-          path: n,
-          newPath: t
-        });
-      }
-      case "remove_node":
-        return L(L({}, e), {}, {
-          type: "insert_node"
-        });
-      case "remove_text":
-        return L(L({}, e), {}, {
-          type: "insert_text"
-        });
-      case "set_node": {
-        var {
-          properties: a,
-          newProperties: s
-        } = e;
-        return L(L({}, e), {}, {
-          properties: s,
-          newProperties: a
-        });
-      }
-      case "set_selection": {
-        var {
-          properties: f,
-          newProperties: D
-        } = e;
-        return f == null ? L(L({}, e), {}, {
-          properties: D,
-          newProperties: null
-        }) : D == null ? L(L({}, e), {}, {
-          properties: null,
-          newProperties: f
-        }) : L(L({}, e), {}, {
-          properties: D,
-          newProperties: f
-        });
-      }
-      case "split_node":
-        return L(L({}, e), {}, {
-          type: "merge_node",
-          path: o.next(e.path)
-        });
-    }
-  }
-}, Xu = /* @__PURE__ */ new WeakMap(), Qe = (e) => {
-  var u = Xu.get(e);
-  if (u !== void 0)
-    return u;
-  if (!H(e))
-    return !1;
-  var r = typeof e.addMark == "function" && typeof e.apply == "function" && typeof e.deleteFragment == "function" && typeof e.insertBreak == "function" && typeof e.insertSoftBreak == "function" && typeof e.insertFragment == "function" && typeof e.insertNode == "function" && typeof e.insertText == "function" && typeof e.isElementReadOnly == "function" && typeof e.isInline == "function" && typeof e.isSelectable == "function" && typeof e.isVoid == "function" && typeof e.normalizeNode == "function" && typeof e.onChange == "function" && typeof e.removeMark == "function" && typeof e.getDirtyPaths == "function" && (e.marks === null || H(e.marks)) && (e.selection === null || g.isRange(e.selection)) && h.isNodeList(e.children) && Fu.isOperationList(e.operations);
-  return Xu.set(e, r), r;
-}, i = {
-  above(e, u) {
-    return e.above(u);
-  },
-  addMark(e, u, r) {
-    e.addMark(u, r);
-  },
-  after(e, u, r) {
-    return e.after(u, r);
-  },
-  before(e, u, r) {
-    return e.before(u, r);
-  },
-  deleteBackward(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-      unit: r = "character"
-    } = u;
-    e.deleteBackward(r);
-  },
-  deleteForward(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-      unit: r = "character"
-    } = u;
-    e.deleteForward(r);
-  },
-  deleteFragment(e, u) {
-    e.deleteFragment(u);
-  },
-  edges(e, u) {
-    return e.edges(u);
-  },
-  elementReadOnly(e) {
-    var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-    return e.elementReadOnly(u);
-  },
-  end(e, u) {
-    return e.end(u);
-  },
-  first(e, u) {
-    return e.first(u);
-  },
-  fragment(e, u) {
-    return e.fragment(u);
-  },
-  hasBlocks(e, u) {
-    return e.hasBlocks(u);
-  },
-  hasInlines(e, u) {
-    return e.hasInlines(u);
-  },
-  hasPath(e, u) {
-    return e.hasPath(u);
-  },
-  hasTexts(e, u) {
-    return e.hasTexts(u);
-  },
-  insertBreak(e) {
-    e.insertBreak();
-  },
-  insertFragment(e, u, r) {
-    e.insertFragment(u, r);
-  },
-  insertNode(e, u) {
-    e.insertNode(u);
-  },
-  insertSoftBreak(e) {
-    e.insertSoftBreak();
-  },
-  insertText(e, u) {
-    e.insertText(u);
-  },
-  isBlock(e, u) {
-    return e.isBlock(u);
-  },
-  isEdge(e, u, r) {
-    return e.isEdge(u, r);
-  },
-  isEditor(e) {
-    return Qe(e);
-  },
-  isElementReadOnly(e, u) {
-    return e.isElementReadOnly(u);
-  },
-  isEmpty(e, u) {
-    return e.isEmpty(u);
-  },
-  isEnd(e, u, r) {
-    return e.isEnd(u, r);
-  },
-  isInline(e, u) {
-    return e.isInline(u);
-  },
-  isNormalizing(e) {
-    return e.isNormalizing();
-  },
-  isSelectable(e, u) {
-    return e.isSelectable(u);
-  },
-  isStart(e, u, r) {
-    return e.isStart(u, r);
-  },
-  isVoid(e, u) {
-    return e.isVoid(u);
-  },
-  last(e, u) {
-    return e.last(u);
-  },
-  leaf(e, u, r) {
-    return e.leaf(u, r);
-  },
-  levels(e, u) {
-    return e.levels(u);
-  },
-  marks(e) {
-    return e.getMarks();
-  },
-  next(e, u) {
-    return e.next(u);
-  },
-  node(e, u, r) {
-    return e.node(u, r);
-  },
-  nodes(e, u) {
-    return e.nodes(u);
-  },
-  normalize(e, u) {
-    e.normalize(u);
-  },
-  parent(e, u, r) {
-    return e.parent(u, r);
-  },
-  path(e, u, r) {
-    return e.path(u, r);
-  },
-  pathRef(e, u, r) {
-    return e.pathRef(u, r);
-  },
-  pathRefs(e) {
-    return e.pathRefs();
-  },
-  point(e, u, r) {
-    return e.point(u, r);
-  },
-  pointRef(e, u, r) {
-    return e.pointRef(u, r);
-  },
-  pointRefs(e) {
-    return e.pointRefs();
-  },
-  positions(e, u) {
-    return e.positions(u);
-  },
-  previous(e, u) {
-    return e.previous(u);
-  },
-  range(e, u, r) {
-    return e.range(u, r);
-  },
-  rangeRef(e, u, r) {
-    return e.rangeRef(u, r);
-  },
-  rangeRefs(e) {
-    return e.rangeRefs();
-  },
-  removeMark(e, u) {
-    e.removeMark(u);
-  },
-  setNormalizing(e, u) {
-    e.setNormalizing(u);
-  },
-  start(e, u) {
-    return e.start(u);
-  },
-  string(e, u, r) {
-    return e.string(u, r);
-  },
-  unhangRange(e, u, r) {
-    return e.unhangRange(u, r);
-  },
-  void(e, u) {
-    return e.void(u);
-  },
-  withoutNormalizing(e, u) {
-    e.withoutNormalizing(u);
-  }
-}, Xe = {
-  isSpan(e) {
-    return Array.isArray(e) && e.length === 2 && e.every(o.isPath);
-  }
-};
-function ku(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function _u(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? ku(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : ku(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var $ = {
-  compare(e, u) {
-    var r = o.compare(e.path, u.path);
-    return r === 0 ? e.offset < u.offset ? -1 : e.offset > u.offset ? 1 : 0 : r;
-  },
-  isAfter(e, u) {
-    return $.compare(e, u) === 1;
-  },
-  isBefore(e, u) {
-    return $.compare(e, u) === -1;
-  },
-  equals(e, u) {
-    return e.offset === u.offset && o.equals(e.path, u.path);
-  },
-  isPoint(e) {
-    return H(e) && typeof e.offset == "number" && o.isPath(e.path);
-  },
-  transform(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    return Ru(e, (n) => {
-      if (n === null)
-        return null;
-      var {
-        affinity: t = "forward"
-      } = r, {
-        path: a,
-        offset: s
-      } = n;
-      switch (u.type) {
-        case "insert_node":
-        case "move_node": {
-          n.path = o.transform(a, u, r);
-          break;
-        }
-        case "insert_text": {
-          o.equals(u.path, a) && (u.offset < s || u.offset === s && t === "forward") && (n.offset += u.text.length);
-          break;
-        }
-        case "merge_node": {
-          o.equals(u.path, a) && (n.offset += u.position), n.path = o.transform(a, u, r);
-          break;
-        }
-        case "remove_text": {
-          o.equals(u.path, a) && u.offset <= s && (n.offset -= Math.min(s - u.offset, u.text.length));
-          break;
-        }
-        case "remove_node": {
-          if (o.equals(u.path, a) || o.isAncestor(u.path, a))
-            return null;
-          n.path = o.transform(a, u, r);
-          break;
-        }
-        case "split_node": {
-          if (o.equals(u.path, a)) {
-            if (u.position === s && t == null)
-              return null;
-            (u.position < s || u.position === s && t === "forward") && (n.offset -= u.position, n.path = o.transform(a, u, _u(_u({}, r), {}, {
-              affinity: "forward"
-            })));
-          } else
-            n.path = o.transform(a, u, r);
-          break;
-        }
-      }
-    });
-  }
-}, ue = void 0, Y = {
-  setScrubber(e) {
-    ue = e;
-  },
-  stringify(e) {
-    return JSON.stringify(e, ue);
-  }
-}, ke = ["text"], _e = ["anchor", "focus"];
-function ee(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function ru(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? ee(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : ee(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var b = {
-  equals(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-      loose: n = !1
-    } = r;
-    function t(a) {
-      var s = nu(a, ke);
-      return s;
-    }
-    return Ee(n ? t(e) : e, n ? t(u) : u);
-  },
-  isText(e) {
-    return H(e) && typeof e.text == "string";
-  },
-  isTextList(e) {
-    return Array.isArray(e) && e.every((u) => b.isText(u));
-  },
-  isTextProps(e) {
-    return e.text !== void 0;
-  },
-  matches(e, u) {
-    for (var r in u)
-      if (r !== "text" && (!e.hasOwnProperty(r) || e[r] !== u[r]))
-        return !1;
-    return !0;
-  },
-  decorations(e, u) {
-    var r = [ru({}, e)];
-    for (var n of u) {
-      var t = nu(n, _e), [a, s] = g.edges(n), f = [], D = 0, l = a.offset, c = s.offset;
-      for (var C of r) {
-        var {
-          length: v
-        } = C.text, B = D;
-        if (D += v, l <= B && D <= c) {
-          Object.assign(C, t), f.push(C);
-          continue;
-        }
-        if (l !== c && (l === D || c === B) || l > D || c < B || c === B && B !== 0) {
-          f.push(C);
-          continue;
-        }
-        var A = C, E = void 0, m = void 0;
-        if (c < D) {
-          var p = c - B;
-          m = ru(ru({}, A), {}, {
-            text: A.text.slice(p)
-          }), A = ru(ru({}, A), {}, {
-            text: A.text.slice(0, p)
-          });
-        }
-        if (l > B) {
-          var d = l - B;
-          E = ru(ru({}, A), {}, {
-            text: A.text.slice(0, d)
-          }), A = ru(ru({}, A), {}, {
-            text: A.text.slice(d)
-          });
-        }
-        Object.assign(A, t), E && f.push(E), f.push(A), m && f.push(m);
-      }
-      r = f;
-    }
-    return r;
-  }
-}, $u = (e) => e.selection ? e.selection : e.children.length > 0 ? i.end(e, []) : [0], Bu = (e, u) => {
-  var [r] = i.node(e, u);
-  return (n) => n === r;
-}, Su = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, n = !r, t = r ? ar(u) : u, a = y.None, s = y.None, f = 0, D = null, l = null;
-  for (var c of t) {
-    var C = c.codePointAt(0);
-    if (!C) break;
-    var v = Ar(c, C);
-    if ([a, s] = n ? [s, v] : [v, a], vu(a, y.ZWJ) && vu(s, y.ExtPict) && (n ? D = re(u.substring(0, f)) : D = re(u.substring(0, u.length - f)), !D) || vu(a, y.RI) && vu(s, y.RI) && (l !== null ? l = !l : n ? l = !0 : l = pr(u.substring(0, u.length - f)), !l) || a !== y.None && s !== y.None && hr(a, s))
-      break;
-    f += c.length;
-  }
-  return f || 1;
-}, ur = /\s/, er = /[\u002B\u0021-\u0023\u0025-\u002A\u002C-\u002F\u003A\u003B\u003F\u0040\u005B-\u005D\u005F\u007B\u007D\u00A1\u00A7\u00AB\u00B6\u00B7\u00BB\u00BF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061E\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u0AF0\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166D\u166E\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2010-\u2027\u2030-\u2043\u2045-\u2051\u2053-\u205E\u207D\u207E\u208D\u208E\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E3B\u3001-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]/, rr = /['\u2018\u2019]/, nr = function(u) {
-  for (var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : !1, n = 0, t = !1; u.length > 0; ) {
-    var a = Su(u, r), [s, f] = Tu(u, a, r);
-    if (tr(s, f, r))
-      t = !0, n += a;
-    else if (!t)
-      n += a;
-    else
-      break;
-    u = f;
-  }
-  return n;
-}, Tu = (e, u, r) => {
-  if (r) {
-    var n = e.length - u;
-    return [e.slice(n, e.length), e.slice(0, n)];
-  }
-  return [e.slice(0, u), e.slice(u)];
-}, tr = function e(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : !1;
-  if (ur.test(u))
-    return !1;
-  if (rr.test(u)) {
-    var t = Su(r, n), [a, s] = Tu(r, t, n);
-    if (e(a, s, n))
-      return !0;
-  }
-  return !er.test(u);
-}, ar = function* (u) {
-  for (var r = u.length - 1, n = 0; n < u.length; n++) {
-    var t = u.charAt(r - n);
-    if (ir(t.charCodeAt(0))) {
-      var a = u.charAt(r - n - 1);
-      if (sr(a.charCodeAt(0))) {
-        yield a + t, n++;
-        continue;
-      }
-    }
-    yield t;
-  }
-}, sr = (e) => e >= 55296 && e <= 56319, ir = (e) => e >= 56320 && e <= 57343, y;
-(function(e) {
-  e[e.None = 0] = "None", e[e.Extend = 1] = "Extend", e[e.ZWJ = 2] = "ZWJ", e[e.RI = 4] = "RI", e[e.Prepend = 8] = "Prepend", e[e.SpacingMark = 16] = "SpacingMark", e[e.L = 32] = "L", e[e.V = 64] = "V", e[e.T = 128] = "T", e[e.LV = 256] = "LV", e[e.LVT = 512] = "LVT", e[e.ExtPict = 1024] = "ExtPict", e[e.Any = 2048] = "Any";
-})(y || (y = {}));
-var Dr = /^(?:[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u0898-\u089F\u08CA-\u08E1\u08E3-\u0902\u093A\u093C\u0941-\u0948\u094D\u0951-\u0957\u0962\u0963\u0981\u09BC\u09BE\u09C1-\u09C4\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01\u0A02\u0A3C\u0A41\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81\u0A82\u0ABC\u0AC1-\u0AC5\u0AC7\u0AC8\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01\u0B3C\u0B3E\u0B3F\u0B41-\u0B44\u0B4D\u0B55-\u0B57\u0B62\u0B63\u0B82\u0BBE\u0BC0\u0BCD\u0BD7\u0C00\u0C04\u0C3C\u0C3E-\u0C40\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81\u0CBC\u0CBF\u0CC2\u0CC6\u0CCC\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00\u0D01\u0D3B\u0D3C\u0D3E\u0D41-\u0D44\u0D4D\u0D57\u0D62\u0D63\u0D81\u0DCA\u0DCF\u0DD2-\u0DD4\u0DD6\u0DDF\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EBC\u0EC8-\u0ECE\u0F18\u0F19\u0F35\u0F37\u0F39\u0F71-\u0F7E\u0F80-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102D-\u1030\u1032-\u1037\u1039\u103A\u103D\u103E\u1058\u1059\u105E-\u1060\u1071-\u1074\u1082\u1085\u1086\u108D\u109D\u135D-\u135F\u1712-\u1714\u1732\u1733\u1752\u1753\u1772\u1773\u17B4\u17B5\u17B7-\u17BD\u17C6\u17C9-\u17D3\u17DD\u180B-\u180D\u180F\u1885\u1886\u18A9\u1920-\u1922\u1927\u1928\u1932\u1939-\u193B\u1A17\u1A18\u1A1B\u1A56\u1A58-\u1A5E\u1A60\u1A62\u1A65-\u1A6C\u1A73-\u1A7C\u1A7F\u1AB0-\u1ACE\u1B00-\u1B03\u1B34-\u1B3A\u1B3C\u1B42\u1B6B-\u1B73\u1B80\u1B81\u1BA2-\u1BA5\u1BA8\u1BA9\u1BAB-\u1BAD\u1BE6\u1BE8\u1BE9\u1BED\u1BEF-\u1BF1\u1C2C-\u1C33\u1C36\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE0\u1CE2-\u1CE8\u1CED\u1CF4\u1CF8\u1CF9\u1DC0-\u1DFF\u200C\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA825\uA826\uA82C\uA8C4\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA951\uA980-\uA982\uA9B3\uA9B6-\uA9B9\uA9BC\uA9BD\uA9E5\uAA29-\uAA2E\uAA31\uAA32\uAA35\uAA36\uAA43\uAA4C\uAA7C\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEC\uAAED\uAAF6\uABE5\uABE8\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F\uFF9E\uFF9F]|\uD800[\uDDFD\uDEE0\uDF76-\uDF7A]|\uD802[\uDE01-\uDE03\uDE05\uDE06\uDE0C-\uDE0F\uDE38-\uDE3A\uDE3F\uDEE5\uDEE6]|\uD803[\uDD24-\uDD27\uDEAB\uDEAC\uDEFD-\uDEFF\uDF46-\uDF50\uDF82-\uDF85]|\uD804[\uDC01\uDC38-\uDC46\uDC70\uDC73\uDC74\uDC7F-\uDC81\uDCB3-\uDCB6\uDCB9\uDCBA\uDCC2\uDD00-\uDD02\uDD27-\uDD2B\uDD2D-\uDD34\uDD73\uDD80\uDD81\uDDB6-\uDDBE\uDDC9-\uDDCC\uDDCF\uDE2F-\uDE31\uDE34\uDE36\uDE37\uDE3E\uDE41\uDEDF\uDEE3-\uDEEA\uDF00\uDF01\uDF3B\uDF3C\uDF3E\uDF40\uDF57\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC38-\uDC3F\uDC42-\uDC44\uDC46\uDC5E\uDCB0\uDCB3-\uDCB8\uDCBA\uDCBD\uDCBF\uDCC0\uDCC2\uDCC3\uDDAF\uDDB2-\uDDB5\uDDBC\uDDBD\uDDBF\uDDC0\uDDDC\uDDDD\uDE33-\uDE3A\uDE3D\uDE3F\uDE40\uDEAB\uDEAD\uDEB0-\uDEB5\uDEB7\uDF1D-\uDF1F\uDF22-\uDF25\uDF27-\uDF2B]|\uD806[\uDC2F-\uDC37\uDC39\uDC3A\uDD30\uDD3B\uDD3C\uDD3E\uDD43\uDDD4-\uDDD7\uDDDA\uDDDB\uDDE0\uDE01-\uDE0A\uDE33-\uDE38\uDE3B-\uDE3E\uDE47\uDE51-\uDE56\uDE59-\uDE5B\uDE8A-\uDE96\uDE98\uDE99]|\uD807[\uDC30-\uDC36\uDC38-\uDC3D\uDC3F\uDC92-\uDCA7\uDCAA-\uDCB0\uDCB2\uDCB3\uDCB5\uDCB6\uDD31-\uDD36\uDD3A\uDD3C\uDD3D\uDD3F-\uDD45\uDD47\uDD90\uDD91\uDD95\uDD97\uDEF3\uDEF4\uDF00\uDF01\uDF36-\uDF3A\uDF40\uDF42]|\uD80D[\uDC40\uDC47-\uDC55]|\uD81A[\uDEF0-\uDEF4\uDF30-\uDF36]|\uD81B[\uDF4F\uDF8F-\uDF92\uDFE4]|\uD82F[\uDC9D\uDC9E]|\uD833[\uDF00-\uDF2D\uDF30-\uDF46]|\uD834[\uDD65\uDD67-\uDD69\uDD6E-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD838[\uDC00-\uDC06\uDC08-\uDC18\uDC1B-\uDC21\uDC23\uDC24\uDC26-\uDC2A\uDC8F\uDD30-\uDD36\uDEAE\uDEEC-\uDEEF]|\uD839[\uDCEC-\uDCEF]|\uD83A[\uDCD0-\uDCD6\uDD44-\uDD4A]|\uD83C[\uDFFB-\uDFFF]|\uDB40[\uDC20-\uDC7F\uDD00-\uDDEF])$/, fr = /^(?:[\u0600-\u0605\u06DD\u070F\u0890\u0891\u08E2\u0D4E]|\uD804[\uDCBD\uDCCD\uDDC2\uDDC3]|\uD806[\uDD3F\uDD41\uDE3A\uDE84-\uDE89]|\uD807\uDD46)$/, or = /^(?:[\u0903\u093B\u093E-\u0940\u0949-\u094C\u094E\u094F\u0982\u0983\u09BF\u09C0\u09C7\u09C8\u09CB\u09CC\u0A03\u0A3E-\u0A40\u0A83\u0ABE-\u0AC0\u0AC9\u0ACB\u0ACC\u0B02\u0B03\u0B40\u0B47\u0B48\u0B4B\u0B4C\u0BBF\u0BC1\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCC\u0C01-\u0C03\u0C41-\u0C44\u0C82\u0C83\u0CBE\u0CC0\u0CC1\u0CC3\u0CC4\u0CC7\u0CC8\u0CCA\u0CCB\u0D02\u0D03\u0D3F\u0D40\u0D46-\u0D48\u0D4A-\u0D4C\u0D82\u0D83\u0DD0\u0DD1\u0DD8-\u0DDE\u0DF2\u0DF3\u0E33\u0EB3\u0F3E\u0F3F\u0F7F\u1031\u103B\u103C\u1056\u1057\u1084\u1715\u1734\u17B6\u17BE-\u17C5\u17C7\u17C8\u1923-\u1926\u1929-\u192B\u1930\u1931\u1933-\u1938\u1A19\u1A1A\u1A55\u1A57\u1A6D-\u1A72\u1B04\u1B3B\u1B3D-\u1B41\u1B43\u1B44\u1B82\u1BA1\u1BA6\u1BA7\u1BAA\u1BE7\u1BEA-\u1BEC\u1BEE\u1BF2\u1BF3\u1C24-\u1C2B\u1C34\u1C35\u1CE1\u1CF7\uA823\uA824\uA827\uA880\uA881\uA8B4-\uA8C3\uA952\uA953\uA983\uA9B4\uA9B5\uA9BA\uA9BB\uA9BE-\uA9C0\uAA2F\uAA30\uAA33\uAA34\uAA4D\uAAEB\uAAEE\uAAEF\uAAF5\uABE3\uABE4\uABE6\uABE7\uABE9\uABEA\uABEC]|\uD804[\uDC00\uDC02\uDC82\uDCB0-\uDCB2\uDCB7\uDCB8\uDD2C\uDD45\uDD46\uDD82\uDDB3-\uDDB5\uDDBF\uDDC0\uDDCE\uDE2C-\uDE2E\uDE32\uDE33\uDE35\uDEE0-\uDEE2\uDF02\uDF03\uDF3F\uDF41-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF62\uDF63]|\uD805[\uDC35-\uDC37\uDC40\uDC41\uDC45\uDCB1\uDCB2\uDCB9\uDCBB\uDCBC\uDCBE\uDCC1\uDDB0\uDDB1\uDDB8-\uDDBB\uDDBE\uDE30-\uDE32\uDE3B\uDE3C\uDE3E\uDEAC\uDEAE\uDEAF\uDEB6\uDF26]|\uD806[\uDC2C-\uDC2E\uDC38\uDD31-\uDD35\uDD37\uDD38\uDD3D\uDD40\uDD42\uDDD1-\uDDD3\uDDDC-\uDDDF\uDDE4\uDE39\uDE57\uDE58\uDE97]|\uD807[\uDC2F\uDC3E\uDCA9\uDCB1\uDCB4\uDD8A-\uDD8E\uDD93\uDD94\uDD96\uDEF5\uDEF6]|\uD81B[\uDF51-\uDF87\uDFF0\uDFF1]|\uD834[\uDD66\uDD6D])$/, lr = /^[\u1100-\u115F\uA960-\uA97C]$/, cr = /^[\u1160-\u11A7\uD7B0-\uD7C6]$/, Cr = /^[\u11A8-\u11FF\uD7CB-\uD7FB]$/, vr = /^[\uAC00\uAC1C\uAC38\uAC54\uAC70\uAC8C\uACA8\uACC4\uACE0\uACFC\uAD18\uAD34\uAD50\uAD6C\uAD88\uADA4\uADC0\uADDC\uADF8\uAE14\uAE30\uAE4C\uAE68\uAE84\uAEA0\uAEBC\uAED8\uAEF4\uAF10\uAF2C\uAF48\uAF64\uAF80\uAF9C\uAFB8\uAFD4\uAFF0\uB00C\uB028\uB044\uB060\uB07C\uB098\uB0B4\uB0D0\uB0EC\uB108\uB124\uB140\uB15C\uB178\uB194\uB1B0\uB1CC\uB1E8\uB204\uB220\uB23C\uB258\uB274\uB290\uB2AC\uB2C8\uB2E4\uB300\uB31C\uB338\uB354\uB370\uB38C\uB3A8\uB3C4\uB3E0\uB3FC\uB418\uB434\uB450\uB46C\uB488\uB4A4\uB4C0\uB4DC\uB4F8\uB514\uB530\uB54C\uB568\uB584\uB5A0\uB5BC\uB5D8\uB5F4\uB610\uB62C\uB648\uB664\uB680\uB69C\uB6B8\uB6D4\uB6F0\uB70C\uB728\uB744\uB760\uB77C\uB798\uB7B4\uB7D0\uB7EC\uB808\uB824\uB840\uB85C\uB878\uB894\uB8B0\uB8CC\uB8E8\uB904\uB920\uB93C\uB958\uB974\uB990\uB9AC\uB9C8\uB9E4\uBA00\uBA1C\uBA38\uBA54\uBA70\uBA8C\uBAA8\uBAC4\uBAE0\uBAFC\uBB18\uBB34\uBB50\uBB6C\uBB88\uBBA4\uBBC0\uBBDC\uBBF8\uBC14\uBC30\uBC4C\uBC68\uBC84\uBCA0\uBCBC\uBCD8\uBCF4\uBD10\uBD2C\uBD48\uBD64\uBD80\uBD9C\uBDB8\uBDD4\uBDF0\uBE0C\uBE28\uBE44\uBE60\uBE7C\uBE98\uBEB4\uBED0\uBEEC\uBF08\uBF24\uBF40\uBF5C\uBF78\uBF94\uBFB0\uBFCC\uBFE8\uC004\uC020\uC03C\uC058\uC074\uC090\uC0AC\uC0C8\uC0E4\uC100\uC11C\uC138\uC154\uC170\uC18C\uC1A8\uC1C4\uC1E0\uC1FC\uC218\uC234\uC250\uC26C\uC288\uC2A4\uC2C0\uC2DC\uC2F8\uC314\uC330\uC34C\uC368\uC384\uC3A0\uC3BC\uC3D8\uC3F4\uC410\uC42C\uC448\uC464\uC480\uC49C\uC4B8\uC4D4\uC4F0\uC50C\uC528\uC544\uC560\uC57C\uC598\uC5B4\uC5D0\uC5EC\uC608\uC624\uC640\uC65C\uC678\uC694\uC6B0\uC6CC\uC6E8\uC704\uC720\uC73C\uC758\uC774\uC790\uC7AC\uC7C8\uC7E4\uC800\uC81C\uC838\uC854\uC870\uC88C\uC8A8\uC8C4\uC8E0\uC8FC\uC918\uC934\uC950\uC96C\uC988\uC9A4\uC9C0\uC9DC\uC9F8\uCA14\uCA30\uCA4C\uCA68\uCA84\uCAA0\uCABC\uCAD8\uCAF4\uCB10\uCB2C\uCB48\uCB64\uCB80\uCB9C\uCBB8\uCBD4\uCBF0\uCC0C\uCC28\uCC44\uCC60\uCC7C\uCC98\uCCB4\uCCD0\uCCEC\uCD08\uCD24\uCD40\uCD5C\uCD78\uCD94\uCDB0\uCDCC\uCDE8\uCE04\uCE20\uCE3C\uCE58\uCE74\uCE90\uCEAC\uCEC8\uCEE4\uCF00\uCF1C\uCF38\uCF54\uCF70\uCF8C\uCFA8\uCFC4\uCFE0\uCFFC\uD018\uD034\uD050\uD06C\uD088\uD0A4\uD0C0\uD0DC\uD0F8\uD114\uD130\uD14C\uD168\uD184\uD1A0\uD1BC\uD1D8\uD1F4\uD210\uD22C\uD248\uD264\uD280\uD29C\uD2B8\uD2D4\uD2F0\uD30C\uD328\uD344\uD360\uD37C\uD398\uD3B4\uD3D0\uD3EC\uD408\uD424\uD440\uD45C\uD478\uD494\uD4B0\uD4CC\uD4E8\uD504\uD520\uD53C\uD558\uD574\uD590\uD5AC\uD5C8\uD5E4\uD600\uD61C\uD638\uD654\uD670\uD68C\uD6A8\uD6C4\uD6E0\uD6FC\uD718\uD734\uD750\uD76C\uD788]$/, Br = /^[\uAC01-\uAC1B\uAC1D-\uAC37\uAC39-\uAC53\uAC55-\uAC6F\uAC71-\uAC8B\uAC8D-\uACA7\uACA9-\uACC3\uACC5-\uACDF\uACE1-\uACFB\uACFD-\uAD17\uAD19-\uAD33\uAD35-\uAD4F\uAD51-\uAD6B\uAD6D-\uAD87\uAD89-\uADA3\uADA5-\uADBF\uADC1-\uADDB\uADDD-\uADF7\uADF9-\uAE13\uAE15-\uAE2F\uAE31-\uAE4B\uAE4D-\uAE67\uAE69-\uAE83\uAE85-\uAE9F\uAEA1-\uAEBB\uAEBD-\uAED7\uAED9-\uAEF3\uAEF5-\uAF0F\uAF11-\uAF2B\uAF2D-\uAF47\uAF49-\uAF63\uAF65-\uAF7F\uAF81-\uAF9B\uAF9D-\uAFB7\uAFB9-\uAFD3\uAFD5-\uAFEF\uAFF1-\uB00B\uB00D-\uB027\uB029-\uB043\uB045-\uB05F\uB061-\uB07B\uB07D-\uB097\uB099-\uB0B3\uB0B5-\uB0CF\uB0D1-\uB0EB\uB0ED-\uB107\uB109-\uB123\uB125-\uB13F\uB141-\uB15B\uB15D-\uB177\uB179-\uB193\uB195-\uB1AF\uB1B1-\uB1CB\uB1CD-\uB1E7\uB1E9-\uB203\uB205-\uB21F\uB221-\uB23B\uB23D-\uB257\uB259-\uB273\uB275-\uB28F\uB291-\uB2AB\uB2AD-\uB2C7\uB2C9-\uB2E3\uB2E5-\uB2FF\uB301-\uB31B\uB31D-\uB337\uB339-\uB353\uB355-\uB36F\uB371-\uB38B\uB38D-\uB3A7\uB3A9-\uB3C3\uB3C5-\uB3DF\uB3E1-\uB3FB\uB3FD-\uB417\uB419-\uB433\uB435-\uB44F\uB451-\uB46B\uB46D-\uB487\uB489-\uB4A3\uB4A5-\uB4BF\uB4C1-\uB4DB\uB4DD-\uB4F7\uB4F9-\uB513\uB515-\uB52F\uB531-\uB54B\uB54D-\uB567\uB569-\uB583\uB585-\uB59F\uB5A1-\uB5BB\uB5BD-\uB5D7\uB5D9-\uB5F3\uB5F5-\uB60F\uB611-\uB62B\uB62D-\uB647\uB649-\uB663\uB665-\uB67F\uB681-\uB69B\uB69D-\uB6B7\uB6B9-\uB6D3\uB6D5-\uB6EF\uB6F1-\uB70B\uB70D-\uB727\uB729-\uB743\uB745-\uB75F\uB761-\uB77B\uB77D-\uB797\uB799-\uB7B3\uB7B5-\uB7CF\uB7D1-\uB7EB\uB7ED-\uB807\uB809-\uB823\uB825-\uB83F\uB841-\uB85B\uB85D-\uB877\uB879-\uB893\uB895-\uB8AF\uB8B1-\uB8CB\uB8CD-\uB8E7\uB8E9-\uB903\uB905-\uB91F\uB921-\uB93B\uB93D-\uB957\uB959-\uB973\uB975-\uB98F\uB991-\uB9AB\uB9AD-\uB9C7\uB9C9-\uB9E3\uB9E5-\uB9FF\uBA01-\uBA1B\uBA1D-\uBA37\uBA39-\uBA53\uBA55-\uBA6F\uBA71-\uBA8B\uBA8D-\uBAA7\uBAA9-\uBAC3\uBAC5-\uBADF\uBAE1-\uBAFB\uBAFD-\uBB17\uBB19-\uBB33\uBB35-\uBB4F\uBB51-\uBB6B\uBB6D-\uBB87\uBB89-\uBBA3\uBBA5-\uBBBF\uBBC1-\uBBDB\uBBDD-\uBBF7\uBBF9-\uBC13\uBC15-\uBC2F\uBC31-\uBC4B\uBC4D-\uBC67\uBC69-\uBC83\uBC85-\uBC9F\uBCA1-\uBCBB\uBCBD-\uBCD7\uBCD9-\uBCF3\uBCF5-\uBD0F\uBD11-\uBD2B\uBD2D-\uBD47\uBD49-\uBD63\uBD65-\uBD7F\uBD81-\uBD9B\uBD9D-\uBDB7\uBDB9-\uBDD3\uBDD5-\uBDEF\uBDF1-\uBE0B\uBE0D-\uBE27\uBE29-\uBE43\uBE45-\uBE5F\uBE61-\uBE7B\uBE7D-\uBE97\uBE99-\uBEB3\uBEB5-\uBECF\uBED1-\uBEEB\uBEED-\uBF07\uBF09-\uBF23\uBF25-\uBF3F\uBF41-\uBF5B\uBF5D-\uBF77\uBF79-\uBF93\uBF95-\uBFAF\uBFB1-\uBFCB\uBFCD-\uBFE7\uBFE9-\uC003\uC005-\uC01F\uC021-\uC03B\uC03D-\uC057\uC059-\uC073\uC075-\uC08F\uC091-\uC0AB\uC0AD-\uC0C7\uC0C9-\uC0E3\uC0E5-\uC0FF\uC101-\uC11B\uC11D-\uC137\uC139-\uC153\uC155-\uC16F\uC171-\uC18B\uC18D-\uC1A7\uC1A9-\uC1C3\uC1C5-\uC1DF\uC1E1-\uC1FB\uC1FD-\uC217\uC219-\uC233\uC235-\uC24F\uC251-\uC26B\uC26D-\uC287\uC289-\uC2A3\uC2A5-\uC2BF\uC2C1-\uC2DB\uC2DD-\uC2F7\uC2F9-\uC313\uC315-\uC32F\uC331-\uC34B\uC34D-\uC367\uC369-\uC383\uC385-\uC39F\uC3A1-\uC3BB\uC3BD-\uC3D7\uC3D9-\uC3F3\uC3F5-\uC40F\uC411-\uC42B\uC42D-\uC447\uC449-\uC463\uC465-\uC47F\uC481-\uC49B\uC49D-\uC4B7\uC4B9-\uC4D3\uC4D5-\uC4EF\uC4F1-\uC50B\uC50D-\uC527\uC529-\uC543\uC545-\uC55F\uC561-\uC57B\uC57D-\uC597\uC599-\uC5B3\uC5B5-\uC5CF\uC5D1-\uC5EB\uC5ED-\uC607\uC609-\uC623\uC625-\uC63F\uC641-\uC65B\uC65D-\uC677\uC679-\uC693\uC695-\uC6AF\uC6B1-\uC6CB\uC6CD-\uC6E7\uC6E9-\uC703\uC705-\uC71F\uC721-\uC73B\uC73D-\uC757\uC759-\uC773\uC775-\uC78F\uC791-\uC7AB\uC7AD-\uC7C7\uC7C9-\uC7E3\uC7E5-\uC7FF\uC801-\uC81B\uC81D-\uC837\uC839-\uC853\uC855-\uC86F\uC871-\uC88B\uC88D-\uC8A7\uC8A9-\uC8C3\uC8C5-\uC8DF\uC8E1-\uC8FB\uC8FD-\uC917\uC919-\uC933\uC935-\uC94F\uC951-\uC96B\uC96D-\uC987\uC989-\uC9A3\uC9A5-\uC9BF\uC9C1-\uC9DB\uC9DD-\uC9F7\uC9F9-\uCA13\uCA15-\uCA2F\uCA31-\uCA4B\uCA4D-\uCA67\uCA69-\uCA83\uCA85-\uCA9F\uCAA1-\uCABB\uCABD-\uCAD7\uCAD9-\uCAF3\uCAF5-\uCB0F\uCB11-\uCB2B\uCB2D-\uCB47\uCB49-\uCB63\uCB65-\uCB7F\uCB81-\uCB9B\uCB9D-\uCBB7\uCBB9-\uCBD3\uCBD5-\uCBEF\uCBF1-\uCC0B\uCC0D-\uCC27\uCC29-\uCC43\uCC45-\uCC5F\uCC61-\uCC7B\uCC7D-\uCC97\uCC99-\uCCB3\uCCB5-\uCCCF\uCCD1-\uCCEB\uCCED-\uCD07\uCD09-\uCD23\uCD25-\uCD3F\uCD41-\uCD5B\uCD5D-\uCD77\uCD79-\uCD93\uCD95-\uCDAF\uCDB1-\uCDCB\uCDCD-\uCDE7\uCDE9-\uCE03\uCE05-\uCE1F\uCE21-\uCE3B\uCE3D-\uCE57\uCE59-\uCE73\uCE75-\uCE8F\uCE91-\uCEAB\uCEAD-\uCEC7\uCEC9-\uCEE3\uCEE5-\uCEFF\uCF01-\uCF1B\uCF1D-\uCF37\uCF39-\uCF53\uCF55-\uCF6F\uCF71-\uCF8B\uCF8D-\uCFA7\uCFA9-\uCFC3\uCFC5-\uCFDF\uCFE1-\uCFFB\uCFFD-\uD017\uD019-\uD033\uD035-\uD04F\uD051-\uD06B\uD06D-\uD087\uD089-\uD0A3\uD0A5-\uD0BF\uD0C1-\uD0DB\uD0DD-\uD0F7\uD0F9-\uD113\uD115-\uD12F\uD131-\uD14B\uD14D-\uD167\uD169-\uD183\uD185-\uD19F\uD1A1-\uD1BB\uD1BD-\uD1D7\uD1D9-\uD1F3\uD1F5-\uD20F\uD211-\uD22B\uD22D-\uD247\uD249-\uD263\uD265-\uD27F\uD281-\uD29B\uD29D-\uD2B7\uD2B9-\uD2D3\uD2D5-\uD2EF\uD2F1-\uD30B\uD30D-\uD327\uD329-\uD343\uD345-\uD35F\uD361-\uD37B\uD37D-\uD397\uD399-\uD3B3\uD3B5-\uD3CF\uD3D1-\uD3EB\uD3ED-\uD407\uD409-\uD423\uD425-\uD43F\uD441-\uD45B\uD45D-\uD477\uD479-\uD493\uD495-\uD4AF\uD4B1-\uD4CB\uD4CD-\uD4E7\uD4E9-\uD503\uD505-\uD51F\uD521-\uD53B\uD53D-\uD557\uD559-\uD573\uD575-\uD58F\uD591-\uD5AB\uD5AD-\uD5C7\uD5C9-\uD5E3\uD5E5-\uD5FF\uD601-\uD61B\uD61D-\uD637\uD639-\uD653\uD655-\uD66F\uD671-\uD68B\uD68D-\uD6A7\uD6A9-\uD6C3\uD6C5-\uD6DF\uD6E1-\uD6FB\uD6FD-\uD717\uD719-\uD733\uD735-\uD74F\uD751-\uD76B\uD76D-\uD787\uD789-\uD7A3]$/, gr = /^(?:[\xA9\xAE\u203C\u2049\u2122\u2139\u2194-\u2199\u21A9\u21AA\u231A\u231B\u2328\u2388\u23CF\u23E9-\u23F3\u23F8-\u23FA\u24C2\u25AA\u25AB\u25B6\u25C0\u25FB-\u25FE\u2600-\u2605\u2607-\u2612\u2614-\u2685\u2690-\u2705\u2708-\u2712\u2714\u2716\u271D\u2721\u2728\u2733\u2734\u2744\u2747\u274C\u274E\u2753-\u2755\u2757\u2763-\u2767\u2795-\u2797\u27A1\u27B0\u27BF\u2934\u2935\u2B05-\u2B07\u2B1B\u2B1C\u2B50\u2B55\u3030\u303D\u3297\u3299]|\uD83C[\uDC00-\uDCFF\uDD0D-\uDD0F\uDD2F\uDD6C-\uDD71\uDD7E\uDD7F\uDD8E\uDD91-\uDD9A\uDDAD-\uDDE5\uDE01-\uDE0F\uDE1A\uDE2F\uDE32-\uDE3A\uDE3C-\uDE3F\uDE49-\uDFFA]|\uD83D[\uDC00-\uDD3D\uDD46-\uDE4F\uDE80-\uDEFF\uDF74-\uDF7F\uDFD5-\uDFFF]|\uD83E[\uDC0C-\uDC0F\uDC48-\uDC4F\uDC5A-\uDC5F\uDC88-\uDC8F\uDCAE-\uDCFF\uDD0C-\uDD3A\uDD3C-\uDD45\uDD47-\uDEFF]|\uD83F[\uDC00-\uDFFD])$/, Ar = (e, u) => {
-  var r = y.Any;
-  return e.search(Dr) !== -1 && (r |= y.Extend), u === 8205 && (r |= y.ZWJ), u >= 127462 && u <= 127487 && (r |= y.RI), e.search(fr) !== -1 && (r |= y.Prepend), e.search(or) !== -1 && (r |= y.SpacingMark), e.search(lr) !== -1 && (r |= y.L), e.search(cr) !== -1 && (r |= y.V), e.search(Cr) !== -1 && (r |= y.T), e.search(vr) !== -1 && (r |= y.LV), e.search(Br) !== -1 && (r |= y.LVT), e.search(gr) !== -1 && (r |= y.ExtPict), r;
-};
-function vu(e, u) {
-  return (e & u) !== 0;
-}
-var mr = [
-  // GB6
-  [y.L, y.L | y.V | y.LV | y.LVT],
-  // GB7
-  [y.LV | y.V, y.V | y.T],
-  // GB8
-  [y.LVT | y.T, y.T],
-  // GB9
-  [y.Any, y.Extend | y.ZWJ],
-  // GB9a
-  [y.Any, y.SpacingMark],
-  // GB9b
-  [y.Prepend, y.Any],
-  // GB11
-  [y.ZWJ, y.ExtPict],
-  // GB12 and GB13
-  [y.RI, y.RI]
-];
-function hr(e, u) {
-  return mr.findIndex((r) => vu(e, r[0]) && vu(u, r[1])) === -1;
-}
-var Fr = /(?:[\xA9\xAE\u203C\u2049\u2122\u2139\u2194-\u2199\u21A9\u21AA\u231A\u231B\u2328\u2388\u23CF\u23E9-\u23F3\u23F8-\u23FA\u24C2\u25AA\u25AB\u25B6\u25C0\u25FB-\u25FE\u2600-\u2605\u2607-\u2612\u2614-\u2685\u2690-\u2705\u2708-\u2712\u2714\u2716\u271D\u2721\u2728\u2733\u2734\u2744\u2747\u274C\u274E\u2753-\u2755\u2757\u2763-\u2767\u2795-\u2797\u27A1\u27B0\u27BF\u2934\u2935\u2B05-\u2B07\u2B1B\u2B1C\u2B50\u2B55\u3030\u303D\u3297\u3299]|\uD83C[\uDC00-\uDCFF\uDD0D-\uDD0F\uDD2F\uDD6C-\uDD71\uDD7E\uDD7F\uDD8E\uDD91-\uDD9A\uDDAD-\uDDE5\uDE01-\uDE0F\uDE1A\uDE2F\uDE32-\uDE3A\uDE3C-\uDE3F\uDE49-\uDFFA]|\uD83D[\uDC00-\uDD3D\uDD46-\uDE4F\uDE80-\uDEFF\uDF74-\uDF7F\uDFD5-\uDFFF]|\uD83E[\uDC0C-\uDC0F\uDC48-\uDC4F\uDC5A-\uDC5F\uDC88-\uDC8F\uDCAE-\uDCFF\uDD0C-\uDD3A\uDD3C-\uDD45\uDD47-\uDEFF]|\uD83F[\uDC00-\uDFFD])(?:[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u0898-\u089F\u08CA-\u08E1\u08E3-\u0902\u093A\u093C\u0941-\u0948\u094D\u0951-\u0957\u0962\u0963\u0981\u09BC\u09BE\u09C1-\u09C4\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01\u0A02\u0A3C\u0A41\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81\u0A82\u0ABC\u0AC1-\u0AC5\u0AC7\u0AC8\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01\u0B3C\u0B3E\u0B3F\u0B41-\u0B44\u0B4D\u0B55-\u0B57\u0B62\u0B63\u0B82\u0BBE\u0BC0\u0BCD\u0BD7\u0C00\u0C04\u0C3C\u0C3E-\u0C40\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81\u0CBC\u0CBF\u0CC2\u0CC6\u0CCC\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00\u0D01\u0D3B\u0D3C\u0D3E\u0D41-\u0D44\u0D4D\u0D57\u0D62\u0D63\u0D81\u0DCA\u0DCF\u0DD2-\u0DD4\u0DD6\u0DDF\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EBC\u0EC8-\u0ECE\u0F18\u0F19\u0F35\u0F37\u0F39\u0F71-\u0F7E\u0F80-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102D-\u1030\u1032-\u1037\u1039\u103A\u103D\u103E\u1058\u1059\u105E-\u1060\u1071-\u1074\u1082\u1085\u1086\u108D\u109D\u135D-\u135F\u1712-\u1714\u1732\u1733\u1752\u1753\u1772\u1773\u17B4\u17B5\u17B7-\u17BD\u17C6\u17C9-\u17D3\u17DD\u180B-\u180D\u180F\u1885\u1886\u18A9\u1920-\u1922\u1927\u1928\u1932\u1939-\u193B\u1A17\u1A18\u1A1B\u1A56\u1A58-\u1A5E\u1A60\u1A62\u1A65-\u1A6C\u1A73-\u1A7C\u1A7F\u1AB0-\u1ACE\u1B00-\u1B03\u1B34-\u1B3A\u1B3C\u1B42\u1B6B-\u1B73\u1B80\u1B81\u1BA2-\u1BA5\u1BA8\u1BA9\u1BAB-\u1BAD\u1BE6\u1BE8\u1BE9\u1BED\u1BEF-\u1BF1\u1C2C-\u1C33\u1C36\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE0\u1CE2-\u1CE8\u1CED\u1CF4\u1CF8\u1CF9\u1DC0-\u1DFF\u200C\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA825\uA826\uA82C\uA8C4\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA951\uA980-\uA982\uA9B3\uA9B6-\uA9B9\uA9BC\uA9BD\uA9E5\uAA29-\uAA2E\uAA31\uAA32\uAA35\uAA36\uAA43\uAA4C\uAA7C\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEC\uAAED\uAAF6\uABE5\uABE8\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F\uFF9E\uFF9F]|\uD800[\uDDFD\uDEE0\uDF76-\uDF7A]|\uD802[\uDE01-\uDE03\uDE05\uDE06\uDE0C-\uDE0F\uDE38-\uDE3A\uDE3F\uDEE5\uDEE6]|\uD803[\uDD24-\uDD27\uDEAB\uDEAC\uDEFD-\uDEFF\uDF46-\uDF50\uDF82-\uDF85]|\uD804[\uDC01\uDC38-\uDC46\uDC70\uDC73\uDC74\uDC7F-\uDC81\uDCB3-\uDCB6\uDCB9\uDCBA\uDCC2\uDD00-\uDD02\uDD27-\uDD2B\uDD2D-\uDD34\uDD73\uDD80\uDD81\uDDB6-\uDDBE\uDDC9-\uDDCC\uDDCF\uDE2F-\uDE31\uDE34\uDE36\uDE37\uDE3E\uDE41\uDEDF\uDEE3-\uDEEA\uDF00\uDF01\uDF3B\uDF3C\uDF3E\uDF40\uDF57\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC38-\uDC3F\uDC42-\uDC44\uDC46\uDC5E\uDCB0\uDCB3-\uDCB8\uDCBA\uDCBD\uDCBF\uDCC0\uDCC2\uDCC3\uDDAF\uDDB2-\uDDB5\uDDBC\uDDBD\uDDBF\uDDC0\uDDDC\uDDDD\uDE33-\uDE3A\uDE3D\uDE3F\uDE40\uDEAB\uDEAD\uDEB0-\uDEB5\uDEB7\uDF1D-\uDF1F\uDF22-\uDF25\uDF27-\uDF2B]|\uD806[\uDC2F-\uDC37\uDC39\uDC3A\uDD30\uDD3B\uDD3C\uDD3E\uDD43\uDDD4-\uDDD7\uDDDA\uDDDB\uDDE0\uDE01-\uDE0A\uDE33-\uDE38\uDE3B-\uDE3E\uDE47\uDE51-\uDE56\uDE59-\uDE5B\uDE8A-\uDE96\uDE98\uDE99]|\uD807[\uDC30-\uDC36\uDC38-\uDC3D\uDC3F\uDC92-\uDCA7\uDCAA-\uDCB0\uDCB2\uDCB3\uDCB5\uDCB6\uDD31-\uDD36\uDD3A\uDD3C\uDD3D\uDD3F-\uDD45\uDD47\uDD90\uDD91\uDD95\uDD97\uDEF3\uDEF4\uDF00\uDF01\uDF36-\uDF3A\uDF40\uDF42]|\uD80D[\uDC40\uDC47-\uDC55]|\uD81A[\uDEF0-\uDEF4\uDF30-\uDF36]|\uD81B[\uDF4F\uDF8F-\uDF92\uDFE4]|\uD82F[\uDC9D\uDC9E]|\uD833[\uDF00-\uDF2D\uDF30-\uDF46]|\uD834[\uDD65\uDD67-\uDD69\uDD6E-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\uD836[\uDE00-\uDE36\uDE3B-\uDE6C\uDE75\uDE84\uDE9B-\uDE9F\uDEA1-\uDEAF]|\uD838[\uDC00-\uDC06\uDC08-\uDC18\uDC1B-\uDC21\uDC23\uDC24\uDC26-\uDC2A\uDC8F\uDD30-\uDD36\uDEAE\uDEEC-\uDEEF]|\uD839[\uDCEC-\uDCEF]|\uD83A[\uDCD0-\uDCD6\uDD44-\uDD4A]|\uD83C[\uDFFB-\uDFFF]|\uDB40[\uDC20-\uDC7F\uDD00-\uDDEF])*\u200D$/, re = (e) => e.search(Fr) !== -1, Er = /(?:\uD83C[\uDDE6-\uDDFF])+$/g, pr = (e) => {
-  var u = e.match(Er);
-  if (u === null)
-    return !1;
-  var r = u[0].length / 2;
-  return r % 2 === 1;
-}, dr = {
-  delete(e, u) {
-    e.delete(u);
-  },
-  insertFragment(e, u, r) {
-    e.insertFragment(u, r);
-  },
-  insertText(e, u) {
-    var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-    i.withoutNormalizing(e, () => {
-      var {
-        voids: n = !1
-      } = r, {
-        at: t = $u(e)
-      } = r;
-      if (o.isPath(t) && (t = i.range(e, t)), g.isRange(t))
-        if (g.isCollapsed(t))
-          t = t.anchor;
-        else {
-          var a = g.end(t);
-          if (!n && i.void(e, {
-            at: a
-          }))
-            return;
-          var s = g.start(t), f = i.pointRef(e, s), D = i.pointRef(e, a);
-          F.delete(e, {
-            at: t,
-            voids: n
-          });
-          var l = f.unref(), c = D.unref();
-          t = l || c, F.setSelection(e, {
-            anchor: t,
-            focus: t
-          });
-        }
-      if (!(!n && i.void(e, {
-        at: t
-      }) || i.elementReadOnly(e, {
-        at: t
-      }))) {
-        var {
-          path: C,
-          offset: v
-        } = t;
-        u.length > 0 && e.apply({
-          type: "insert_text",
-          path: C,
-          offset: v,
-          text: u
-        });
-      }
-    });
-  }
-};
-function ne(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function bu(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? ne(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : ne(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var F = bu(bu(bu(bu({}, We), Ke), He), dr), wu = /* @__PURE__ */ new WeakMap(), br = (e) => wu.get(e) || !1, wr = (e, u, r) => {
-  var n = wu.get(e) || !1;
-  wu.set(e, !0);
-  try {
-    u(), r();
-  } finally {
-    wu.set(e, n);
-  }
-};
-function pe(e, u, r) {
-  var n = Ou.get(e) || [], t = yu.get(e) || /* @__PURE__ */ new Set(), a, s, f = (C) => {
-    if (C) {
-      var v = C.join(",");
-      s.has(v) || (s.add(v), a.push(C));
-    }
-  };
-  if (r) {
-    a = [], s = /* @__PURE__ */ new Set();
-    for (var D of n) {
-      var l = r(D);
-      f(l);
-    }
-  } else
-    a = n, s = t;
-  for (var c of u)
-    f(c);
-  Ou.set(e, a), yu.set(e, s);
-}
-var Or = (e, u) => {
-  for (var r of i.pathRefs(e))
-    Ie.transform(r, u);
-  for (var n of i.pointRefs(e))
-    ze.transform(n, u);
-  for (var t of i.rangeRefs(e))
-    qe.transform(t, u);
-  if (!br(e)) {
-    var a = o.operationCanTransformPath(u) ? (s) => o.transform(s, u) : void 0;
-    pe(e, e.getDirtyPaths(u), a);
-  }
-  F.transform(e, u), e.operations.push(u), i.normalize(e, {
-    operation: u
-  }), u.type === "set_selection" && (e.marks = null), Eu.get(e) || (Eu.set(e, !0), Promise.resolve().then(() => {
-    Eu.set(e, !1), e.onChange({
-      operation: u
-    }), e.operations = [];
-  }));
-}, yr = (e, u) => {
-  switch (u.type) {
-    case "insert_text":
-    case "remove_text":
-    case "set_node": {
-      var {
-        path: r
-      } = u;
-      return o.levels(r);
-    }
-    case "insert_node": {
-      var {
-        node: n,
-        path: t
-      } = u, a = o.levels(t), s = b.isText(n) ? [] : Array.from(h.nodes(n), (j) => {
-        var [, I] = j;
-        return t.concat(I);
-      });
-      return [...a, ...s];
-    }
-    case "merge_node": {
-      var {
-        path: f
-      } = u, D = o.ancestors(f), l = o.previous(f);
-      return [...D, l];
-    }
-    case "move_node": {
-      var {
-        path: c,
-        newPath: C
-      } = u;
-      if (o.equals(c, C))
-        return [];
-      var v = [], B = [];
-      for (var A of o.ancestors(c)) {
-        var E = o.transform(A, u);
-        v.push(E);
-      }
-      for (var m of o.ancestors(C)) {
-        var p = o.transform(m, u);
-        B.push(p);
-      }
-      var d = B[B.length - 1], x = C[C.length - 1], O = d.concat(x);
-      return [...v, ...B, O];
-    }
-    case "remove_node": {
-      var {
-        path: N
-      } = u, S = o.ancestors(N);
-      return [...S];
-    }
-    case "split_node": {
-      var {
-        path: P
-      } = u, z = o.levels(P), T = o.next(P);
-      return [...z, T];
-    }
-    default:
-      return [];
-  }
-}, Pr = (e) => {
-  var {
-    selection: u
-  } = e;
-  return u ? h.fragment(e, u) : [];
-}, xr = (e, u) => {
-  var [r, n] = u;
-  if (!b.isText(r)) {
-    if (w.isElement(r) && r.children.length === 0) {
-      var t = {
-        text: ""
-      };
-      F.insertNodes(e, t, {
-        at: n.concat(0),
-        voids: !0
-      });
-      return;
-    }
-    for (var a = i.isEditor(r) ? !1 : w.isElement(r) && (e.isInline(r) || r.children.length === 0 || b.isText(r.children[0]) || e.isInline(r.children[0])), s = 0, f = 0; f < r.children.length; f++, s++) {
-      var D = h.get(e, n);
-      if (!b.isText(D)) {
-        var l = D.children[s], c = D.children[s - 1], C = f === r.children.length - 1, v = b.isText(l) || w.isElement(l) && e.isInline(l);
-        if (v !== a)
-          F.removeNodes(e, {
-            at: n.concat(s),
-            voids: !0
-          }), s--;
-        else if (w.isElement(l)) {
-          if (e.isInline(l)) {
-            if (c == null || !b.isText(c)) {
-              var B = {
-                text: ""
-              };
-              F.insertNodes(e, B, {
-                at: n.concat(s),
-                voids: !0
-              }), s++;
-            } else if (C) {
-              var A = {
-                text: ""
-              };
-              F.insertNodes(e, A, {
-                at: n.concat(s + 1),
-                voids: !0
-              }), s++;
-            }
-          }
-        } else
-          c != null && b.isText(c) && (b.equals(l, c, {
-            loose: !0
-          }) ? (F.mergeNodes(e, {
-            at: n.concat(s),
-            voids: !0
-          }), s--) : c.text === "" ? (F.removeNodes(e, {
-            at: n.concat(s - 1),
-            voids: !0
-          }), s--) : l.text === "" && (F.removeNodes(e, {
-            at: n.concat(s),
-            voids: !0
-          }), s--));
-      }
-    }
-  }
-}, jr = (e, u) => {
-  var {
-    iteration: r,
-    initialDirtyPathsLength: n
-  } = u, t = n * 42;
-  if (r > t)
-    throw new Error("Could not completely normalize the editor after ".concat(t, " iterations! This is usually due to incorrect normalization logic that leaves a node in an invalid state."));
-  return !0;
-}, Nr = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-    voids: n = !1,
-    mode: t = "lowest",
-    at: a = u.selection,
-    match: s
-  } = r;
-  if (a) {
-    var f = i.path(u, a), D = t === "lowest";
-    for (var [l, c] of i.levels(u, {
-      at: f,
-      voids: n,
-      match: s,
-      reverse: D
-    }))
-      if (!b.isText(l)) {
-        if (g.isRange(a)) {
-          if (o.isAncestor(c, a.anchor.path) && o.isAncestor(c, a.focus.path))
-            return [l, c];
-        } else if (!o.equals(f, c))
-          return [l, c];
-      }
-  }
-};
-function te(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function ae(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? te(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : te(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var Rr = (e, u, r) => {
-  var {
-    selection: n
-  } = e;
-  if (n) {
-    var t = (C, v) => {
-      if (!b.isText(C))
-        return !1;
-      var [B, A] = i.parent(e, v);
-      return !e.isVoid(B) || e.markableVoid(B);
-    }, a = g.isExpanded(n), s = !1;
-    if (!a) {
-      var [f, D] = i.node(e, n);
-      if (f && t(f, D)) {
-        var [l] = i.parent(e, D);
-        s = l && e.markableVoid(l);
-      }
-    }
-    if (a || s)
-      F.setNodes(e, {
-        [u]: r
-      }, {
-        match: t,
-        split: !0,
-        voids: !0
-      });
-    else {
-      var c = ae(ae({}, i.marks(e) || {}), {}, {
-        [u]: r
-      });
-      e.marks = c, Eu.get(e) || e.onChange();
-    }
-  }
-};
-function se(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function ie(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? se(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : se(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var $r = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, t = i.point(u, r, {
-    edge: "end"
-  }), a = i.end(u, []), s = {
-    anchor: t,
-    focus: a
-  }, {
-    distance: f = 1
-  } = n, D = 0, l;
-  for (var c of i.positions(u, ie(ie({}, n), {}, {
-    at: s
-  }))) {
-    if (D > f)
-      break;
-    D !== 0 && (l = c), D++;
-  }
-  return l;
-};
-function De(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function fe(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? De(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : De(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var Sr = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, t = i.start(u, []), a = i.point(u, r, {
-    edge: "start"
-  }), s = {
-    anchor: t,
-    focus: a
-  }, {
-    distance: f = 1
-  } = n, D = 0, l;
-  for (var c of i.positions(u, fe(fe({}, n), {}, {
-    at: s,
-    reverse: !0
-  }))) {
-    if (D > f)
-      break;
-    D !== 0 && (l = c), D++;
-  }
-  return l;
-}, Tr = (e, u) => {
-  var {
-    selection: r
-  } = e;
-  r && g.isCollapsed(r) && F.delete(e, {
-    unit: u,
-    reverse: !0
-  });
-}, Ir = (e, u) => {
-  var {
-    selection: r
-  } = e;
-  r && g.isCollapsed(r) && F.delete(e, {
-    unit: u
-  });
-}, zr = function(u) {
-  var {
-    direction: r = "forward"
-  } = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-    selection: n
-  } = u;
-  n && g.isExpanded(n) && F.delete(u, {
-    reverse: r === "backward"
-  });
-}, qr = (e, u) => [i.start(e, u), i.end(e, u)];
-function oe(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function le(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? oe(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : oe(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var Lr = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  return i.above(u, le(le({}, r), {}, {
-    match: (n) => w.isElement(n) && i.isElementReadOnly(u, n)
-  }));
-}, Vr = (e, u) => i.point(e, u, {
-  edge: "end"
-}), Mr = (e, u) => {
-  var r = i.path(e, u, {
-    edge: "start"
-  });
-  return i.node(e, r);
-}, Wr = (e, u) => {
-  var r = i.range(e, u);
-  return h.fragment(e, r);
-};
-function ce(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function Ce(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? ce(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : ce(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var Kr = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  return i.above(u, Ce(Ce({}, r), {}, {
-    match: (n) => w.isElement(n) && i.isVoid(u, n)
-  }));
-}, Hr = (e, u) => u.children.some((r) => w.isElement(r) && i.isBlock(e, r)), Jr = (e, u) => u.children.some((r) => b.isText(r) || i.isInline(e, r)), Zr = (e, u) => h.has(e, u), Gr = (e, u) => u.children.every((r) => b.isText(r)), Ur = (e) => {
-  F.splitNodes(e, {
-    always: !0
-  });
-}, Yr = (e, u, r) => {
-  F.insertNodes(e, u, r);
-}, Qr = (e) => {
-  F.splitNodes(e, {
-    always: !0
-  });
-};
-function ve(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function Xr(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? ve(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : ve(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var kr = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    selection: t,
-    marks: a
-  } = u;
-  if (t) {
-    if (a) {
-      var s = Xr({
-        text: r
-      }, a);
-      F.insertNodes(u, s, {
-        at: n.at,
-        voids: n.voids
-      });
-    } else
-      F.insertText(u, r, n);
-    u.marks = null;
-  }
-}, _r = (e, u) => !e.isInline(u), un = (e, u, r) => i.isStart(e, u, r) || i.isEnd(e, u, r), en = (e, u) => {
-  var {
-    children: r
-  } = u, [n] = r;
-  return r.length === 0 || r.length === 1 && b.isText(n) && n.text === "" && !e.isVoid(u);
-}, rn = (e, u, r) => {
-  var n = i.end(e, r);
-  return $.equals(u, n);
-}, nn = (e) => {
-  var u = Fe.get(e);
-  return u === void 0 ? !0 : u;
-}, tn = (e, u, r) => {
-  if (u.offset !== 0)
-    return !1;
-  var n = i.start(e, r);
-  return $.equals(u, n);
-}, an = (e, u) => {
-  var r = i.path(e, u, {
-    edge: "end"
-  });
-  return i.node(e, r);
-}, sn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, t = i.path(u, r, n), a = h.leaf(u, t);
-  return [a, t];
-};
-function Dn(e) {
-  var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  return function* () {
-    var {
-      at: r = e.selection,
-      reverse: n = !1,
-      voids: t = !1
-    } = u, {
-      match: a
-    } = u;
-    if (a == null && (a = () => !0), !!r) {
-      var s = [], f = i.path(e, r);
-      for (var [D, l] of h.levels(e, f))
-        if (a(D, l) && (s.push([D, l]), !t && w.isElement(D) && i.isVoid(e, D)))
-          break;
-      n && s.reverse(), yield* s;
-    }
-  }();
-}
-var fn = ["text"], on = ["text"], ln = function(u) {
-  var {
-    marks: r,
-    selection: n
-  } = u;
-  if (!n)
-    return null;
-  var {
-    anchor: t,
-    focus: a
-  } = n;
-  if (r)
-    return r;
-  if (g.isExpanded(n)) {
-    var s = i.isEnd(u, t, t.path);
-    if (s) {
-      var f = i.after(u, t);
-      f && (t = f);
-    }
-    var [D] = i.nodes(u, {
-      match: b.isText,
-      at: {
-        anchor: t,
-        focus: a
-      }
-    });
-    if (D) {
-      var [l] = D, c = nu(l, fn);
-      return c;
-    } else
-      return {};
-  }
-  var {
-    path: C
-  } = t, [v] = i.leaf(u, C);
-  if (t.offset === 0) {
-    var B = i.previous(u, {
-      at: C,
-      match: b.isText
-    }), A = i.above(u, {
-      match: (O) => w.isElement(O) && i.isVoid(u, O) && u.markableVoid(O)
-    });
-    if (!A) {
-      var E = i.above(u, {
-        match: (O) => w.isElement(O) && i.isBlock(u, O)
-      });
-      if (B && E) {
-        var [m, p] = B, [, d] = E;
-        o.isAncestor(d, p) && (v = m);
-      }
-    }
-  }
-  var x = nu(v, on);
-  return x;
-}, cn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-    mode: n = "lowest",
-    voids: t = !1
-  } = r, {
-    match: a,
-    at: s = u.selection
-  } = r;
-  if (s) {
-    var f = i.after(u, s, {
-      voids: t
-    });
-    if (f) {
-      var [, D] = i.last(u, []), l = [f.path, D];
-      if (o.isPath(s) && s.length === 0)
-        throw new Error("Cannot get the next node from the root node!");
-      if (a == null)
-        if (o.isPath(s)) {
-          var [c] = i.parent(u, s);
-          a = (v) => c.children.includes(v);
-        } else
-          a = () => !0;
-      var [C] = i.nodes(u, {
-        at: l,
-        match: a,
-        mode: n,
-        voids: t
-      });
-      return C;
-    }
-  }
-}, Cn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, t = i.path(u, r, n), a = h.get(u, t);
-  return [a, t];
-};
-function vn(e) {
-  var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  return function* () {
-    var {
-      at: r = e.selection,
-      mode: n = "all",
-      universal: t = !1,
-      reverse: a = !1,
-      voids: s = !1,
-      ignoreNonSelectable: f = !1
-    } = u, {
-      match: D
-    } = u;
-    if (D || (D = () => !0), !!r) {
-      var l, c;
-      if (Xe.isSpan(r))
-        l = r[0], c = r[1];
-      else {
-        var C = i.path(e, r, {
-          edge: "start"
-        }), v = i.path(e, r, {
-          edge: "end"
-        });
-        l = a ? v : C, c = a ? C : v;
-      }
-      var B = h.nodes(e, {
-        reverse: a,
-        from: l,
-        to: c,
-        pass: (O) => {
-          var [N] = O;
-          return w.isElement(N) ? !!(!s && (i.isVoid(e, N) || i.isElementReadOnly(e, N)) || f && !i.isSelectable(e, N)) : !1;
-        }
-      }), A = [], E;
-      for (var [m, p] of B)
-        if (!(f && w.isElement(m) && !i.isSelectable(e, m))) {
-          var d = E && o.compare(p, E[1]) === 0;
-          if (!(n === "highest" && d)) {
-            if (!D(m, p)) {
-              if (t && !d && b.isText(m))
-                return;
-              continue;
-            }
-            if (n === "lowest" && d) {
-              E = [m, p];
-              continue;
-            }
-            var x = n === "lowest" ? E : [m, p];
-            x && (t ? A.push(x) : yield x), E = [m, p];
-          }
-        }
-      n === "lowest" && E && (t ? A.push(E) : yield E), t && (yield* A);
-    }
-  }();
-}
-var Bn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-    force: n = !1,
-    operation: t
-  } = r, a = (c) => Ou.get(c) || [], s = (c) => yu.get(c) || /* @__PURE__ */ new Set(), f = (c) => {
-    var C = a(c).pop(), v = C.join(",");
-    return s(c).delete(v), C;
-  };
-  if (i.isNormalizing(u)) {
-    if (n) {
-      var D = Array.from(h.nodes(u), (c) => {
-        var [, C] = c;
-        return C;
-      }), l = new Set(D.map((c) => c.join(",")));
-      Ou.set(u, D), yu.set(u, l);
-    }
-    a(u).length !== 0 && i.withoutNormalizing(u, () => {
-      for (var c of a(u))
-        if (h.has(u, c)) {
-          var C = i.node(u, c), [v, B] = C;
-          w.isElement(v) && v.children.length === 0 && u.normalizeNode(C, {
-            operation: t
-          });
-        }
-      for (var A = a(u), E = A.length, m = 0; A.length !== 0; ) {
-        if (!u.shouldNormalize({
-          dirtyPaths: A,
-          iteration: m,
-          initialDirtyPathsLength: E,
-          operation: t
-        }))
-          return;
-        var p = f(u);
-        if (h.has(u, p)) {
-          var d = i.node(u, p);
-          u.normalizeNode(d, {
-            operation: t
-          });
-        }
-        m++, A = a(u);
-      }
-    });
-  }
-}, gn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, t = i.path(u, r, n), a = o.parent(t), s = i.node(u, a);
-  return s;
-}, An = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    affinity: t = "forward"
-  } = n, a = {
-    current: r,
-    affinity: t,
-    unref() {
-      var {
-        current: f
-      } = a, D = i.pathRefs(u);
-      return D.delete(a), a.current = null, f;
-    }
-  }, s = i.pathRefs(u);
-  return s.add(a), a;
-}, mn = (e) => {
-  var u = Ku.get(e);
-  return u || (u = /* @__PURE__ */ new Set(), Ku.set(e, u)), u;
-}, hn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    depth: t,
-    edge: a
-  } = n;
-  if (o.isPath(r)) {
-    if (a === "start") {
-      var [, s] = h.first(u, r);
-      r = s;
-    } else if (a === "end") {
-      var [, f] = h.last(u, r);
-      r = f;
-    }
-  }
-  return g.isRange(r) && (a === "start" ? r = g.start(r) : a === "end" ? r = g.end(r) : r = o.common(r.anchor.path, r.focus.path)), $.isPoint(r) && (r = r.path), t != null && (r = r.slice(0, t)), r;
-}, Fn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    affinity: t = "forward"
-  } = n, a = {
-    current: r,
-    affinity: t,
-    unref() {
-      var {
-        current: f
-      } = a, D = i.pointRefs(u);
-      return D.delete(a), a.current = null, f;
-    }
-  }, s = i.pointRefs(u);
-  return s.add(a), a;
-}, En = (e) => {
-  var u = Hu.get(e);
-  return u || (u = /* @__PURE__ */ new Set(), Hu.set(e, u)), u;
-}, pn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    edge: t = "start"
-  } = n;
-  if (o.isPath(r)) {
-    var a;
-    if (t === "end") {
-      var [, s] = h.last(u, r);
-      a = s;
-    } else {
-      var [, f] = h.first(u, r);
-      a = f;
-    }
-    var D = h.get(u, a);
-    if (!b.isText(D))
-      throw new Error("Cannot get the ".concat(t, " point in the node at path [").concat(r, "] because it has no ").concat(t, " text node."));
-    return {
-      path: a,
-      offset: t === "end" ? D.text.length : 0
-    };
-  }
-  if (g.isRange(r)) {
-    var [l, c] = g.edges(r);
-    return t === "start" ? l : c;
-  }
-  return r;
-};
-function dn(e) {
-  var u = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  return function* () {
-    var {
-      at: r = e.selection,
-      unit: n = "offset",
-      reverse: t = !1,
-      voids: a = !1,
-      ignoreNonSelectable: s = !1
-    } = u;
-    if (!r)
-      return;
-    var f = i.range(e, r), [D, l] = g.edges(f), c = t ? l : D, C = !1, v = "", B = 0, A = 0, E = 0;
-    for (var [m, p] of i.nodes(e, {
-      at: r,
-      reverse: t,
-      voids: a,
-      ignoreNonSelectable: s
-    })) {
-      if (w.isElement(m)) {
-        if (!a && (e.isVoid(m) || e.isElementReadOnly(m))) {
-          yield i.start(e, p);
-          continue;
-        }
-        if (e.isInline(m)) continue;
-        if (i.hasInlines(e, m)) {
-          var d = o.isAncestor(p, l.path) ? l : i.end(e, p), x = o.isAncestor(p, D.path) ? D : i.start(e, p);
-          v = i.string(e, {
-            anchor: x,
-            focus: d
-          }, {
-            voids: a
-          }), C = !0;
-        }
-      }
-      if (b.isText(m)) {
-        var O = o.equals(p, c.path);
-        for (O ? (A = t ? c.offset : m.text.length - c.offset, E = c.offset) : (A = m.text.length, E = t ? A : 0), (O || C || n === "offset") && (yield {
-          path: p,
-          offset: E
-        }, C = !1); ; ) {
-          if (B === 0) {
-            if (v === "") break;
-            B = N(v, n, t), v = Tu(v, B, t)[1];
-          }
-          if (E = t ? E - B : E + B, A = A - B, A < 0) {
-            B = -A;
-            break;
-          }
-          B = 0, yield {
-            path: p,
-            offset: E
-          };
-        }
-      }
-    }
-    function N(S, P, z) {
-      return P === "character" ? Su(S, z) : P === "word" ? nr(S, z) : P === "line" || P === "block" ? S.length : 1;
-    }
-  }();
-}
-var bn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-    mode: n = "lowest",
-    voids: t = !1
-  } = r, {
-    match: a,
-    at: s = u.selection
-  } = r;
-  if (s) {
-    var f = i.before(u, s, {
-      voids: t
-    });
-    if (f) {
-      var [, D] = i.first(u, []), l = [f.path, D];
-      if (o.isPath(s) && s.length === 0)
-        throw new Error("Cannot get the previous node from the root node!");
-      if (a == null)
-        if (o.isPath(s)) {
-          var [c] = i.parent(u, s);
-          a = (v) => c.children.includes(v);
-        } else
-          a = () => !0;
-      var [C] = i.nodes(u, {
-        reverse: !0,
-        at: l,
-        match: a,
-        mode: n,
-        voids: t
-      });
-      return C;
-    }
-  }
-}, wn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    affinity: t = "forward"
-  } = n, a = {
-    current: r,
-    affinity: t,
-    unref() {
-      var {
-        current: f
-      } = a, D = i.rangeRefs(u);
-      return D.delete(a), a.current = null, f;
-    }
-  }, s = i.rangeRefs(u);
-  return s.add(a), a;
-}, On = (e) => {
-  var u = Ju.get(e);
-  return u || (u = /* @__PURE__ */ new Set(), Ju.set(e, u)), u;
-}, yn = (e, u, r) => {
-  if (g.isRange(u) && !r)
-    return u;
-  var n = i.start(e, u), t = i.end(e, r || u);
-  return {
-    anchor: n,
-    focus: t
-  };
-};
-function Be(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function Pn(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? Be(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : Be(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var xn = (e, u) => {
-  var {
-    selection: r
-  } = e;
-  if (r) {
-    var n = (c, C) => {
-      if (!b.isText(c))
-        return !1;
-      var [v, B] = i.parent(e, C);
-      return !e.isVoid(v) || e.markableVoid(v);
-    }, t = g.isExpanded(r), a = !1;
-    if (!t) {
-      var [s, f] = i.node(e, r);
-      if (s && n(s, f)) {
-        var [D] = i.parent(e, f);
-        a = D && e.markableVoid(D);
-      }
-    }
-    if (t || a)
-      F.unsetNodes(e, u, {
-        match: n,
-        split: !0,
-        voids: !0
-      });
-    else {
-      var l = Pn({}, i.marks(e) || {});
-      delete l[u], e.marks = l, Eu.get(e) || e.onChange();
-    }
-  }
-}, jn = (e, u) => {
-  Fe.set(e, u);
-}, Nn = (e, u) => i.point(e, u, {
-  edge: "start"
-}), Rn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    voids: t = !1
-  } = n, a = i.range(u, r), [s, f] = g.edges(a), D = "";
-  for (var [l, c] of i.nodes(u, {
-    at: a,
-    match: b.isText,
-    voids: t
-  })) {
-    var C = l.text;
-    o.equals(c, f.path) && (C = C.slice(0, f.offset)), o.equals(c, s.path) && (C = C.slice(s.offset)), D += C;
-  }
-  return D;
-}, $n = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    voids: t = !1
-  } = n, [a, s] = g.edges(r);
-  if (a.offset !== 0 || s.offset !== 0 || g.isCollapsed(r) || o.hasPrevious(s.path))
-    return r;
-  var f = i.above(u, {
-    at: s,
-    match: (A) => w.isElement(A) && i.isBlock(u, A),
-    voids: t
-  }), D = f ? f[1] : [], l = i.start(u, a), c = {
-    anchor: l,
-    focus: s
-  }, C = !0;
-  for (var [v, B] of i.nodes(u, {
-    at: c,
-    match: b.isText,
-    reverse: !0,
-    voids: t
-  })) {
-    if (C) {
-      C = !1;
-      continue;
-    }
-    if (v.text !== "" || o.isBefore(B, D)) {
-      s = {
-        path: B,
-        offset: v.text.length
-      };
-      break;
-    }
-  }
-  return {
-    anchor: a,
-    focus: s
-  };
-}, Sn = (e, u) => {
-  var r = i.isNormalizing(e);
-  i.setNormalizing(e, !1);
-  try {
-    u();
-  } finally {
-    i.setNormalizing(e, r);
-  }
-  i.normalize(e);
-}, Tn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  i.withoutNormalizing(u, () => {
-    var n, t, {
-      reverse: a = !1,
-      unit: s = "character",
-      distance: f = 1,
-      voids: D = !1
-    } = r, {
-      at: l = u.selection,
-      hanging: c = !1
-    } = r;
-    if (l) {
-      var C = !1;
-      if (g.isRange(l) && g.isCollapsed(l) && (C = !0, l = l.anchor), $.isPoint(l)) {
-        var v = i.void(u, {
-          at: l,
-          mode: "highest"
-        });
-        if (!D && v) {
-          var [, B] = v;
-          l = B;
-        } else {
-          var A = {
-            unit: s,
-            distance: f
-          }, E = a ? i.before(u, l, A) || i.start(u, []) : i.after(u, l, A) || i.end(u, []);
-          l = {
-            anchor: l,
-            focus: E
-          }, c = !0;
-        }
-      }
-      if (o.isPath(l)) {
-        F.removeNodes(u, {
-          at: l,
-          voids: D
-        });
-        return;
-      }
-      if (!g.isCollapsed(l)) {
-        if (!c) {
-          var [, m] = g.edges(l), p = i.end(u, []);
-          $.equals(m, p) || (l = i.unhangRange(u, l, {
-            voids: D
-          }));
-        }
-        var [d, x] = g.edges(l), O = i.above(u, {
-          match: (Z) => w.isElement(Z) && i.isBlock(u, Z),
-          at: d,
-          voids: D
-        }), N = i.above(u, {
-          match: (Z) => w.isElement(Z) && i.isBlock(u, Z),
-          at: x,
-          voids: D
-        }), S = O && N && !o.equals(O[1], N[1]), P = o.equals(d.path, x.path), z = D ? null : (n = i.void(u, {
-          at: d,
-          mode: "highest"
-        })) !== null && n !== void 0 ? n : i.elementReadOnly(u, {
-          at: d,
-          mode: "highest"
-        }), T = D ? null : (t = i.void(u, {
-          at: x,
-          mode: "highest"
-        })) !== null && t !== void 0 ? t : i.elementReadOnly(u, {
-          at: x,
-          mode: "highest"
-        });
-        if (z) {
-          var j = i.before(u, d);
-          j && O && o.isAncestor(O[1], j.path) && (d = j);
-        }
-        if (T) {
-          var I = i.after(u, x);
-          I && N && o.isAncestor(N[1], I.path) && (x = I);
-        }
-        var q = [], W;
-        for (var M of i.nodes(u, {
-          at: l,
-          voids: D
-        })) {
-          var [J, Q] = M;
-          W && o.compare(Q, W) === 0 || (!D && w.isElement(J) && (i.isVoid(u, J) || i.isElementReadOnly(u, J)) || !o.isCommon(Q, d.path) && !o.isCommon(Q, x.path)) && (q.push(M), W = Q);
-        }
-        var X = Array.from(q, (Z) => {
-          var [, Pu] = Z;
-          return i.pathRef(u, Pu);
-        }), k = i.pointRef(u, d), V = i.pointRef(u, x), U = "";
-        if (!P && !z) {
-          var uu = k.current, [_] = i.leaf(u, uu), {
-            path: eu
-          } = uu, {
-            offset: au
-          } = d, R = _.text.slice(au);
-          R.length > 0 && (u.apply({
-            type: "remove_text",
-            path: eu,
-            offset: au,
-            text: R
-          }), U = R);
-        }
-        if (X.reverse().map((Z) => Z.unref()).filter((Z) => Z !== null).forEach((Z) => F.removeNodes(u, {
-          at: Z,
-          voids: D
-        })), !T) {
-          var K = V.current, [tu] = i.leaf(u, K), {
-            path: su
-          } = K, fu = P ? d.offset : 0, gu = tu.text.slice(fu, x.offset);
-          gu.length > 0 && (u.apply({
-            type: "remove_text",
-            path: su,
-            offset: fu,
-            text: gu
-          }), U = gu);
-        }
-        !P && S && V.current && k.current && F.mergeNodes(u, {
-          at: V.current,
-          hanging: !0,
-          voids: D
-        }), C && a && s === "character" && U.length > 1 && U.match(/[\u0E00-\u0E7F]+/) && F.insertText(u, U.slice(0, U.length - f));
-        var Au = k.unref(), mu = V.unref(), ou = a ? Au || mu : mu || Au;
-        r.at == null && ou && F.select(u, ou);
-      }
-    }
-  });
-}, In = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      hanging: t = !1,
-      voids: a = !1
-    } = n, {
-      at: s = $u(u),
-      batchDirty: f = !0
-    } = n;
-    if (r.length) {
-      if (g.isRange(s))
-        if (t || (s = i.unhangRange(u, s, {
-          voids: a
-        })), g.isCollapsed(s))
-          s = s.anchor;
-        else {
-          var [, D] = g.edges(s);
-          if (!a && i.void(u, {
-            at: D
-          }))
-            return;
-          var l = i.pointRef(u, D);
-          F.delete(u, {
-            at: s
-          }), s = l.unref();
-        }
-      else o.isPath(s) && (s = i.start(u, s));
-      if (!(!a && i.void(u, {
-        at: s
-      }))) {
-        var c = i.above(u, {
-          at: s,
-          match: (R) => w.isElement(R) && i.isInline(u, R),
-          mode: "highest",
-          voids: a
-        });
-        if (c) {
-          var [, C] = c;
-          if (i.isEnd(u, s, C)) {
-            var v = i.after(u, C);
-            s = v;
-          } else if (i.isStart(u, s, C)) {
-            var B = i.before(u, C);
-            s = B;
-          }
-        }
-        var A = i.above(u, {
-          match: (R) => w.isElement(R) && i.isBlock(u, R),
-          at: s,
-          voids: a
-        }), [, E] = A, m = i.isStart(u, s, E), p = i.isEnd(u, s, E), d = m && p, x = !m || m && p, O = !p, [, N] = h.first({
-          children: r
-        }, []), [, S] = h.last({
-          children: r
-        }, []), P = [], z = (R) => {
-          var [K, tu] = R, su = tu.length === 0;
-          return su ? !1 : d ? !0 : !(x && o.isAncestor(tu, N) && w.isElement(K) && !u.isVoid(K) && !u.isInline(K) || O && o.isAncestor(tu, S) && w.isElement(K) && !u.isVoid(K) && !u.isInline(K));
-        };
-        for (var T of h.nodes({
-          children: r
-        }, {
-          pass: z
-        }))
-          z(T) && P.push(T);
-        var j = [], I = [], q = [], W = !0, M = !1;
-        for (var [J] of P)
-          w.isElement(J) && !u.isInline(J) ? (W = !1, M = !0, I.push(J)) : W ? j.push(J) : q.push(J);
-        var [Q] = i.nodes(u, {
-          at: s,
-          match: (R) => b.isText(R) || i.isInline(u, R),
-          mode: "highest",
-          voids: a
-        }), [, X] = Q, k = i.isStart(u, s, X), V = i.isEnd(u, s, X), U = i.pathRef(u, p && !q.length ? o.next(E) : E), uu = i.pathRef(u, V ? o.next(X) : X);
-        F.splitNodes(u, {
-          at: s,
-          match: (R) => M ? w.isElement(R) && i.isBlock(u, R) : b.isText(R) || i.isInline(u, R),
-          mode: M ? "lowest" : "highest",
-          always: M && (!m || j.length > 0) && (!p || q.length > 0),
-          voids: a
-        });
-        var _ = i.pathRef(u, !k || k && V ? o.next(X) : X);
-        if (F.insertNodes(u, j, {
-          at: _.current,
-          match: (R) => b.isText(R) || i.isInline(u, R),
-          mode: "highest",
-          voids: a,
-          batchDirty: f
-        }), d && !j.length && I.length && !q.length && F.delete(u, {
-          at: E,
-          voids: a
-        }), F.insertNodes(u, I, {
-          at: U.current,
-          match: (R) => w.isElement(R) && i.isBlock(u, R),
-          mode: "lowest",
-          voids: a,
-          batchDirty: f
-        }), F.insertNodes(u, q, {
-          at: uu.current,
-          match: (R) => b.isText(R) || i.isInline(u, R),
-          mode: "highest",
-          voids: a,
-          batchDirty: f
-        }), !n.at) {
-          var eu;
-          if (q.length > 0 && uu.current ? eu = o.previous(uu.current) : I.length > 0 && U.current ? eu = o.previous(U.current) : _.current && (eu = o.previous(_.current)), eu) {
-            var au = i.end(u, eu);
-            F.select(u, au);
-          }
-        }
-        _.unref(), U.unref(), uu.unref();
-      }
-    }
-  });
-}, zn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-    edge: n = "anchor"
-  } = r, {
-    selection: t
-  } = u;
-  if (t) {
-    if (n === "anchor")
-      F.select(u, t.anchor);
-    else if (n === "focus")
-      F.select(u, t.focus);
-    else if (n === "start") {
-      var [a] = g.edges(t);
-      F.select(u, a);
-    } else if (n === "end") {
-      var [, s] = g.edges(t);
-      F.select(u, s);
-    }
-  } else return;
-}, qn = (e) => {
-  var {
-    selection: u
-  } = e;
-  u && e.apply({
-    type: "set_selection",
-    properties: u,
-    newProperties: null
-  });
-}, Ln = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
-    selection: n
-  } = u, {
-    distance: t = 1,
-    unit: a = "character",
-    reverse: s = !1
-  } = r, {
-    edge: f = null
-  } = r;
-  if (n) {
-    f === "start" && (f = g.isBackward(n) ? "focus" : "anchor"), f === "end" && (f = g.isBackward(n) ? "anchor" : "focus");
-    var {
-      anchor: D,
-      focus: l
-    } = n, c = {
-      distance: t,
-      unit: a,
-      ignoreNonSelectable: !0
-    }, C = {};
-    if (f == null || f === "anchor") {
-      var v = s ? i.before(u, D, c) : i.after(u, D, c);
-      v && (C.anchor = v);
-    }
-    if (f == null || f === "focus") {
-      var B = s ? i.before(u, l, c) : i.after(u, l, c);
-      B && (C.focus = B);
-    }
-    F.setSelection(u, C);
-  }
-}, Vn = (e, u) => {
-  var {
-    selection: r
-  } = e;
-  if (u = i.range(e, u), r) {
-    F.setSelection(e, u);
-    return;
-  }
-  if (!g.isRange(u))
-    throw new Error("When setting the selection and the current selection is `null` you must provide at least an `anchor` and `focus`, but you passed: ".concat(Y.stringify(u)));
-  e.apply({
-    type: "set_selection",
-    properties: r,
-    newProperties: u
-  });
-};
-function ge(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function Ae(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? ge(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : ge(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var Mn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
-    selection: t
-  } = u, {
-    edge: a = "both"
-  } = n;
-  if (t) {
-    a === "start" && (a = g.isBackward(t) ? "focus" : "anchor"), a === "end" && (a = g.isBackward(t) ? "anchor" : "focus");
-    var {
-      anchor: s,
-      focus: f
-    } = t, D = a === "anchor" ? s : f;
-    F.setSelection(u, {
-      [a === "anchor" ? "anchor" : "focus"]: Ae(Ae({}, D), r)
-    });
-  }
-}, Wn = (e, u) => {
-  var {
-    selection: r
-  } = e, n = {}, t = {};
-  if (r) {
-    for (var a in u)
-      (a === "anchor" && u.anchor != null && !$.equals(u.anchor, r.anchor) || a === "focus" && u.focus != null && !$.equals(u.focus, r.focus) || a !== "anchor" && a !== "focus" && u[a] !== r[a]) && (n[a] = r[a], t[a] = u[a]);
-    Object.keys(n).length > 0 && e.apply({
-      type: "set_selection",
-      properties: n,
-      newProperties: t
-    });
-  }
-}, Kn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      hanging: t = !1,
-      voids: a = !1,
-      mode: s = "lowest",
-      batchDirty: f = !0
-    } = n, {
-      at: D,
-      match: l,
-      select: c
-    } = n;
-    if (h.isNode(r) && (r = [r]), r.length !== 0) {
-      var [C] = r;
-      if (D || (D = $u(u), c !== !1 && (c = !0)), c == null && (c = !1), g.isRange(D))
-        if (t || (D = i.unhangRange(u, D, {
-          voids: a
-        })), g.isCollapsed(D))
-          D = D.anchor;
-        else {
-          var [, v] = g.edges(D), B = i.pointRef(u, v);
-          F.delete(u, {
-            at: D
-          }), D = B.unref();
-        }
-      if ($.isPoint(D)) {
-        l == null && (b.isText(C) ? l = (j) => b.isText(j) : u.isInline(C) ? l = (j) => b.isText(j) || i.isInline(u, j) : l = (j) => w.isElement(j) && i.isBlock(u, j));
-        var [A] = i.nodes(u, {
-          at: D.path,
-          match: l,
-          mode: s,
-          voids: a
-        });
-        if (A) {
-          var [, E] = A, m = i.pathRef(u, E), p = i.isEnd(u, D, E);
-          F.splitNodes(u, {
-            at: D,
-            match: l,
-            mode: s,
-            voids: a
-          });
-          var d = m.unref();
-          D = p ? o.next(d) : d;
-        } else
-          return;
-      }
-      var x = o.parent(D), O = D[D.length - 1];
-      if (!(!a && i.void(u, {
-        at: x
-      }))) {
-        if (f) {
-          var N = [], S = o.levels(x);
-          wr(u, () => {
-            var j = function() {
-              var W = x.concat(O);
-              O++;
-              var M = {
-                type: "insert_node",
-                path: W,
-                node: I
-              };
-              u.apply(M), D = o.next(D), N.push(M), b.isText ? S.push(...Array.from(h.nodes(I), (J) => {
-                var [, Q] = J;
-                return W.concat(Q);
-              })) : S.push(W);
-            };
-            for (var I of r)
-              j();
-          }, () => {
-            pe(u, S, (j) => {
-              var I = j;
-              for (var q of N)
-                if (o.operationCanTransformPath(q) && (I = o.transform(I, q), !I))
-                  return null;
-              return I;
-            });
-          });
-        } else
-          for (var P of r) {
-            var z = x.concat(O);
-            O++, u.apply({
-              type: "insert_node",
-              path: z,
-              node: P
-            }), D = o.next(D);
-          }
-        if (D = o.previous(D), c) {
-          var T = i.end(u, D);
-          T && F.select(u, T);
-        }
-      }
-    }
-  });
-}, Hn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      at: n = u.selection,
-      mode: t = "lowest",
-      voids: a = !1
-    } = r, {
-      match: s
-    } = r;
-    if (s == null && (s = o.isPath(n) ? Bu(u, n) : (O) => w.isElement(O) && i.isBlock(u, O)), !!n) {
-      var f = i.nodes(u, {
-        at: n,
-        match: s,
-        mode: t,
-        voids: a
-      }), D = Array.from(f, (O) => {
-        var [, N] = O;
-        return i.pathRef(u, N);
-      });
-      for (var l of D) {
-        var c = l.unref();
-        if (c.length < 2)
-          throw new Error("Cannot lift node at a path [".concat(c, "] because it has a depth of less than `2`."));
-        var C = i.node(u, o.parent(c)), [v, B] = C, A = c[c.length - 1], {
-          length: E
-        } = v.children;
-        if (E === 1) {
-          var m = o.next(B);
-          F.moveNodes(u, {
-            at: c,
-            to: m,
-            voids: a
-          }), F.removeNodes(u, {
-            at: B,
-            voids: a
-          });
-        } else if (A === 0)
-          F.moveNodes(u, {
-            at: c,
-            to: B,
-            voids: a
-          });
-        else if (A === E - 1) {
-          var p = o.next(B);
-          F.moveNodes(u, {
-            at: c,
-            to: p,
-            voids: a
-          });
-        } else {
-          var d = o.next(c), x = o.next(B);
-          F.splitNodes(u, {
-            at: d,
-            voids: a
-          }), F.moveNodes(u, {
-            at: c,
-            to: x,
-            voids: a
-          });
-        }
-      }
-    }
-  });
-}, Jn = ["text"], Zn = ["children"], de = (e, u) => {
-  if (w.isElement(u)) {
-    var r = u;
-    return i.isVoid(e, u) ? !0 : r.children.length === 1 ? de(e, r.children[0]) : !1;
-  } else return !i.isEditor(u);
-}, Gn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      match: n,
-      at: t = u.selection
-    } = r, {
-      hanging: a = !1,
-      voids: s = !1,
-      mode: f = "lowest"
-    } = r;
-    if (t) {
-      if (n == null)
-        if (o.isPath(t)) {
-          var [D] = i.parent(u, t);
-          n = (j) => D.children.includes(j);
-        } else
-          n = (j) => w.isElement(j) && i.isBlock(u, j);
-      if (!a && g.isRange(t) && (t = i.unhangRange(u, t, {
-        voids: s
-      })), g.isRange(t))
-        if (g.isCollapsed(t))
-          t = t.anchor;
-        else {
-          var [, l] = g.edges(t), c = i.pointRef(u, l);
-          F.delete(u, {
-            at: t
-          }), t = c.unref(), r.at == null && F.select(u, t);
-        }
-      var [C] = i.nodes(u, {
-        at: t,
-        match: n,
-        voids: s,
-        mode: f
-      }), v = i.previous(u, {
-        at: t,
-        match: n,
-        voids: s,
-        mode: f
-      });
-      if (!(!C || !v)) {
-        var [B, A] = C, [E, m] = v;
-        if (!(A.length === 0 || m.length === 0)) {
-          var p = o.next(m), d = o.common(A, m), x = o.isSibling(A, m), O = Array.from(i.levels(u, {
-            at: A
-          }), (j) => {
-            var [I] = j;
-            return I;
-          }).slice(d.length).slice(0, -1), N = i.above(u, {
-            at: A,
-            mode: "highest",
-            match: (j) => O.includes(j) && de(u, j)
-          }), S = N && i.pathRef(u, N[1]), P, z;
-          if (b.isText(B) && b.isText(E)) {
-            var T = nu(B, Jn);
-            z = E.text.length, P = T;
-          } else if (w.isElement(B) && w.isElement(E)) {
-            var T = nu(B, Zn);
-            z = E.children.length, P = T;
-          } else
-            throw new Error("Cannot merge the node at path [".concat(A, "] with the previous sibling because it is not the same kind: ").concat(Y.stringify(B), " ").concat(Y.stringify(E)));
-          x || F.moveNodes(u, {
-            at: A,
-            to: p,
-            voids: s
-          }), S && F.removeNodes(u, {
-            at: S.current,
-            voids: s
-          }), w.isElement(E) && i.isEmpty(u, E) || b.isText(E) && E.text === "" && m[m.length - 1] !== 0 ? F.removeNodes(u, {
-            at: m,
-            voids: s
-          }) : u.apply({
-            type: "merge_node",
-            path: p,
-            position: z,
-            properties: P
-          }), S && S.unref();
-        }
-      }
-    }
-  });
-}, Un = (e, u) => {
-  i.withoutNormalizing(e, () => {
-    var {
-      to: r,
-      at: n = e.selection,
-      mode: t = "lowest",
-      voids: a = !1
-    } = u, {
-      match: s
-    } = u;
-    if (n) {
-      s == null && (s = o.isPath(n) ? Bu(e, n) : (B) => w.isElement(B) && i.isBlock(e, B));
-      var f = i.pathRef(e, r), D = i.nodes(e, {
-        at: n,
-        match: s,
-        mode: t,
-        voids: a
-      }), l = Array.from(D, (B) => {
-        var [, A] = B;
-        return i.pathRef(e, A);
-      });
-      for (var c of l) {
-        var C = c.unref(), v = f.current;
-        C.length !== 0 && e.apply({
-          type: "move_node",
-          path: C,
-          newPath: v
-        }), f.current && o.isSibling(v, C) && o.isAfter(v, C) && (f.current = o.next(f.current));
-      }
-      f.unref();
-    }
-  });
-}, Yn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      hanging: n = !1,
-      voids: t = !1,
-      mode: a = "lowest"
-    } = r, {
-      at: s = u.selection,
-      match: f
-    } = r;
-    if (s) {
-      f == null && (f = o.isPath(s) ? Bu(u, s) : (B) => w.isElement(B) && i.isBlock(u, B)), !n && g.isRange(s) && (s = i.unhangRange(u, s, {
-        voids: t
-      }));
-      var D = i.nodes(u, {
-        at: s,
-        match: f,
-        mode: a,
-        voids: t
-      }), l = Array.from(D, (B) => {
-        var [, A] = B;
-        return i.pathRef(u, A);
-      });
-      for (var c of l) {
-        var C = c.unref();
-        if (C) {
-          var [v] = i.node(u, C);
-          u.apply({
-            type: "remove_node",
-            path: C,
-            node: v
-          });
-        }
-      }
-    }
-  });
-}, Qn = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      match: t,
-      at: a = u.selection,
-      compare: s,
-      merge: f
-    } = n, {
-      hanging: D = !1,
-      mode: l = "lowest",
-      split: c = !1,
-      voids: C = !1
-    } = n;
-    if (a) {
-      if (t == null && (t = o.isPath(a) ? Bu(u, a) : (z) => w.isElement(z) && i.isBlock(u, z)), !D && g.isRange(a) && (a = i.unhangRange(u, a, {
-        voids: C
-      })), c && g.isRange(a)) {
-        if (g.isCollapsed(a) && i.leaf(u, a.anchor)[0].text.length > 0)
-          return;
-        var v = i.rangeRef(u, a, {
-          affinity: "inward"
-        }), [B, A] = g.edges(a), E = l === "lowest" ? "lowest" : "highest", m = i.isEnd(u, A, A.path);
-        F.splitNodes(u, {
-          at: A,
-          match: t,
-          mode: E,
-          voids: C,
-          always: !m
-        });
-        var p = i.isStart(u, B, B.path);
-        F.splitNodes(u, {
-          at: B,
-          match: t,
-          mode: E,
-          voids: C,
-          always: !p
-        }), a = v.unref(), n.at == null && F.select(u, a);
-      }
-      s || (s = (z, T) => z !== T);
-      for (var [d, x] of i.nodes(u, {
-        at: a,
-        match: t,
-        mode: l,
-        voids: C
-      })) {
-        var O = {}, N = {};
-        if (x.length !== 0) {
-          var S = !1;
-          for (var P in r)
-            P === "children" || P === "text" || s(r[P], d[P]) && (S = !0, d.hasOwnProperty(P) && (O[P] = d[P]), f ? r[P] != null && (N[P] = f(d[P], r[P])) : r[P] != null && (N[P] = r[P]));
-          S && u.apply({
-            type: "set_node",
-            path: x,
-            properties: O,
-            newProperties: N
-          });
-        }
-      }
-    }
-  });
-}, Xn = (e, u) => {
-  if (g.isCollapsed(u))
-    return u.anchor;
-  var [, r] = g.edges(u), n = i.pointRef(e, r);
-  return F.delete(e, {
-    at: u
-  }), n.unref();
-}, kn = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      mode: n = "lowest",
-      voids: t = !1
-    } = r, {
-      match: a,
-      at: s = u.selection,
-      height: f = 0,
-      always: D = !1
-    } = r;
-    if (a == null && (a = (V) => w.isElement(V) && i.isBlock(u, V)), g.isRange(s) && (s = Xn(u, s)), o.isPath(s)) {
-      var l = s, c = i.point(u, l), [C] = i.parent(u, l);
-      a = (V) => V === C, f = c.path.length - l.length + 1, s = c, D = !0;
-    }
-    if (s) {
-      var v = i.pointRef(u, s, {
-        affinity: "backward"
-      }), B;
-      try {
-        var [A] = i.nodes(u, {
-          at: s,
-          match: a,
-          mode: n,
-          voids: t
-        });
-        if (!A)
-          return;
-        var E = i.void(u, {
-          at: s,
-          mode: "highest"
-        }), m = 0;
-        if (!t && E) {
-          var [p, d] = E;
-          if (w.isElement(p) && u.isInline(p)) {
-            var x = i.after(u, d);
-            if (!x) {
-              var O = {
-                text: ""
-              }, N = o.next(d);
-              F.insertNodes(u, O, {
-                at: N,
-                voids: t
-              }), x = i.point(u, N);
-            }
-            s = x, D = !0;
-          }
-          var S = s.path.length - d.length;
-          f = S + 1, D = !0;
-        }
-        B = i.pointRef(u, s);
-        var P = s.path.length - f, [, z] = A, T = s.path.slice(0, P), j = f === 0 ? s.offset : s.path[P] + m;
-        for (var [I, q] of i.levels(u, {
-          at: T,
-          reverse: !0,
-          voids: t
-        })) {
-          var W = !1;
-          if (q.length < z.length || q.length === 0 || !t && w.isElement(I) && i.isVoid(u, I))
-            break;
-          var M = v.current, J = i.isEnd(u, M, q);
-          if (D || !v || !i.isEdge(u, M, q)) {
-            W = !0;
-            var Q = h.extractProps(I);
-            u.apply({
-              type: "split_node",
-              path: q,
-              position: j,
-              properties: Q
-            });
-          }
-          j = q[q.length - 1] + (W || J ? 1 : 0);
-        }
-        if (r.at == null) {
-          var X = B.current || i.end(u, []);
-          F.select(u, X);
-        }
-      } finally {
-        var k;
-        v.unref(), (k = B) === null || k === void 0 || k.unref();
-      }
-    }
-  });
-}, _n = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-  Array.isArray(r) || (r = [r]);
-  var t = {};
-  for (var a of r)
-    t[a] = null;
-  F.setNodes(u, t, n);
-}, ut = function(u) {
-  var r = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      mode: n = "lowest",
-      split: t = !1,
-      voids: a = !1
-    } = r, {
-      at: s = u.selection,
-      match: f
-    } = r;
-    if (s) {
-      f == null && (f = o.isPath(s) ? Bu(u, s) : (B) => w.isElement(B) && i.isBlock(u, B)), o.isPath(s) && (s = i.range(u, s));
-      var D = g.isRange(s) ? i.rangeRef(u, s) : null, l = i.nodes(u, {
-        at: s,
-        match: f,
-        mode: n,
-        voids: a
-      }), c = Array.from(
-        l,
-        (B) => {
-          var [, A] = B;
-          return i.pathRef(u, A);
-        }
-        // unwrapNode will call liftNode which does not support splitting the node when nested.
-        // If we do not reverse the order and call it from top to the bottom, it will remove all blocks
-        // that wrap target node. So we reverse the order.
-      ).reverse(), C = function() {
-        var A = v.unref(), [E] = i.node(u, A), m = i.range(u, A);
-        t && D && (m = g.intersection(D.current, m)), F.liftNodes(u, {
-          at: m,
-          match: (p) => w.isAncestor(E) && E.children.includes(p),
-          voids: a
-        });
-      };
-      for (var v of c)
-        C();
-      D && D.unref();
-    }
-  });
-};
-function me(e, u) {
-  var r = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var n = Object.getOwnPropertySymbols(e);
-    u && (n = n.filter(function(t) {
-      return Object.getOwnPropertyDescriptor(e, t).enumerable;
-    })), r.push.apply(r, n);
-  }
-  return r;
-}
-function he(e) {
-  for (var u = 1; u < arguments.length; u++) {
-    var r = arguments[u] != null ? arguments[u] : {};
-    u % 2 ? me(Object(r), !0).forEach(function(n) {
-      G(e, n, r[n]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : me(Object(r)).forEach(function(n) {
-      Object.defineProperty(e, n, Object.getOwnPropertyDescriptor(r, n));
-    });
-  }
-  return e;
-}
-var et = function(u, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
-  i.withoutNormalizing(u, () => {
-    var {
-      mode: t = "lowest",
-      split: a = !1,
-      voids: s = !1
-    } = n, {
-      match: f,
-      at: D = u.selection
-    } = n;
-    if (D) {
-      if (f == null && (o.isPath(D) ? f = Bu(u, D) : u.isInline(r) ? f = (m) => w.isElement(m) && i.isInline(u, m) || b.isText(m) : f = (m) => w.isElement(m) && i.isBlock(u, m)), a && g.isRange(D)) {
-        var [l, c] = g.edges(D), C = i.rangeRef(u, D, {
-          affinity: "inward"
-        });
-        F.splitNodes(u, {
-          at: c,
-          match: f,
-          voids: s
-        }), F.splitNodes(u, {
-          at: l,
-          match: f,
-          voids: s
-        }), D = C.unref(), n.at == null && F.select(u, D);
-      }
-      var v = Array.from(i.nodes(u, {
-        at: D,
-        match: u.isInline(r) ? (m) => w.isElement(m) && i.isBlock(u, m) : (m) => i.isEditor(m),
-        mode: "lowest",
-        voids: s
-      })), B = function() {
-        var p = g.isRange(D) ? g.intersection(D, i.range(u, E)) : D;
-        if (!p)
-          return 0;
-        var d = Array.from(i.nodes(u, {
-          at: p,
-          match: f,
-          mode: t,
-          voids: s
-        }));
-        if (d.length > 0) {
-          var [x] = d, O = d[d.length - 1], [, N] = x, [, S] = O;
-          if (N.length === 0 && S.length === 0)
-            return 0;
-          var P = o.equals(N, S) ? o.parent(N) : o.common(N, S), z = i.range(u, N, S), T = i.node(u, P), [j] = T, I = P.length + 1, q = o.next(S.slice(0, I)), W = he(he({}, r), {}, {
-            children: []
-          });
-          F.insertNodes(u, W, {
-            at: q,
-            voids: s
-          }), F.moveNodes(u, {
-            at: z,
-            match: (M) => w.isAncestor(j) && j.children.includes(M),
-            to: q.concat(0),
-            voids: s
-          });
-        }
-      }, A;
-      for (var [, E] of v)
-        A = B();
-    }
-  });
-}, tt = () => {
-  var e = {
-    children: [],
-    operations: [],
-    selection: null,
-    marks: null,
-    isElementReadOnly: () => !1,
-    isInline: () => !1,
-    isSelectable: () => !0,
-    isVoid: () => !1,
-    markableVoid: () => !1,
-    onChange: () => {
-    },
-    // Core
-    apply: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Or(e, ...n);
-    },
-    // Editor
-    addMark: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Rr(e, ...n);
-    },
-    deleteBackward: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Tr(e, ...n);
-    },
-    deleteForward: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Ir(e, ...n);
-    },
-    deleteFragment: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return zr(e, ...n);
-    },
-    getFragment: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Pr(e, ...n);
-    },
-    insertBreak: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Ur(e, ...n);
-    },
-    insertSoftBreak: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Qr(e, ...n);
-    },
-    insertFragment: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return In(e, ...n);
-    },
-    insertNode: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Yr(e, ...n);
-    },
-    insertText: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return kr(e, ...n);
-    },
-    normalizeNode: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return xr(e, ...n);
-    },
-    removeMark: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return xn(e, ...n);
-    },
-    getDirtyPaths: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return yr(e, ...n);
-    },
-    shouldNormalize: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return jr(e, ...n);
-    },
-    // Editor interface
-    above: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Nr(e, ...n);
-    },
-    after: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return $r(e, ...n);
-    },
-    before: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Sr(e, ...n);
-    },
-    collapse: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return zn(e, ...n);
-    },
-    delete: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Tn(e, ...n);
-    },
-    deselect: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return qn(e, ...n);
-    },
-    edges: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return qr(e, ...n);
-    },
-    elementReadOnly: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Lr(e, ...n);
-    },
-    end: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Vr(e, ...n);
-    },
-    first: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Mr(e, ...n);
-    },
-    fragment: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Wr(e, ...n);
-    },
-    getMarks: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return ln(e, ...n);
-    },
-    hasBlocks: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Hr(e, ...n);
-    },
-    hasInlines: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Jr(e, ...n);
-    },
-    hasPath: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Zr(e, ...n);
-    },
-    hasTexts: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Gr(e, ...n);
-    },
-    insertNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Kn(e, ...n);
-    },
-    isBlock: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return _r(e, ...n);
-    },
-    isEdge: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return un(e, ...n);
-    },
-    isEmpty: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return en(e, ...n);
-    },
-    isEnd: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return rn(e, ...n);
-    },
-    isNormalizing: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return nn(e, ...n);
-    },
-    isStart: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return tn(e, ...n);
-    },
-    last: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return an(e, ...n);
-    },
-    leaf: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return sn(e, ...n);
-    },
-    levels: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Dn(e, ...n);
-    },
-    liftNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Hn(e, ...n);
-    },
-    mergeNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Gn(e, ...n);
-    },
-    move: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Ln(e, ...n);
-    },
-    moveNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Un(e, ...n);
-    },
-    next: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return cn(e, ...n);
-    },
-    node: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Cn(e, ...n);
-    },
-    nodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return vn(e, ...n);
-    },
-    normalize: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Bn(e, ...n);
-    },
-    parent: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return gn(e, ...n);
-    },
-    path: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return hn(e, ...n);
-    },
-    pathRef: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return An(e, ...n);
-    },
-    pathRefs: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return mn(e, ...n);
-    },
-    point: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return pn(e, ...n);
-    },
-    pointRef: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Fn(e, ...n);
-    },
-    pointRefs: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return En(e, ...n);
-    },
-    positions: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return dn(e, ...n);
-    },
-    previous: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return bn(e, ...n);
-    },
-    range: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return yn(e, ...n);
-    },
-    rangeRef: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return wn(e, ...n);
-    },
-    rangeRefs: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return On(e, ...n);
-    },
-    removeNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Yn(e, ...n);
-    },
-    select: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Vn(e, ...n);
-    },
-    setNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Qn(e, ...n);
-    },
-    setNormalizing: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return jn(e, ...n);
-    },
-    setPoint: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Mn(e, ...n);
-    },
-    setSelection: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Wn(e, ...n);
-    },
-    splitNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return kn(e, ...n);
-    },
-    start: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Nn(e, ...n);
-    },
-    string: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Rn(e, ...n);
-    },
-    unhangRange: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return $n(e, ...n);
-    },
-    unsetNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return _n(e, ...n);
-    },
-    unwrapNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return ut(e, ...n);
-    },
-    void: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Kr(e, ...n);
-    },
-    withoutNormalizing: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return Sn(e, ...n);
-    },
-    wrapNodes: function() {
-      for (var r = arguments.length, n = new Array(r), t = 0; t < r; t++)
-        n[t] = arguments[t];
-      return et(e, ...n);
-    }
-  };
-  return e;
-};
-export {
-  i as Editor,
-  w as Element,
-  h as Node,
-  Fu as Operation,
-  o as Path,
-  Ie as PathRef,
-  $ as Point,
-  ze as PointRef,
-  g as Range,
-  qe as RangeRef,
-  Y as Scrubber,
-  Xe as Span,
-  b as Text,
-  F as Transforms,
-  Nr as above,
-  Rr as addMark,
-  $r as after,
-  Or as apply,
-  Sr as before,
-  zn as collapse,
-  tt as createEditor,
-  Tr as deleteBackward,
-  Ir as deleteForward,
-  zr as deleteFragment,
-  Tn as deleteText,
-  qn as deselect,
-  qr as edges,
-  Lr as elementReadOnly,
-  Vr as end,
-  Mr as first,
-  Wr as fragment,
-  yr as getDirtyPaths,
-  Pr as getFragment,
-  Kr as getVoid,
-  Hr as hasBlocks,
-  Jr as hasInlines,
-  Zr as hasPath,
-  Gr as hasTexts,
-  Ur as insertBreak,
-  In as insertFragment,
-  Yr as insertNode,
-  Kn as insertNodes,
-  Qr as insertSoftBreak,
-  kr as insertText,
-  _r as isBlock,
-  un as isEdge,
-  Qe as isEditor,
-  en as isEmpty,
-  rn as isEnd,
-  nn as isNormalizing,
-  tn as isStart,
-  an as last,
-  sn as leaf,
-  Dn as levels,
-  Hn as liftNodes,
-  ln as marks,
-  Gn as mergeNodes,
-  Ln as move,
-  Un as moveNodes,
-  cn as next,
-  Cn as node,
-  vn as nodes,
-  Bn as normalize,
-  xr as normalizeNode,
-  gn as parent,
-  hn as path,
-  An as pathRef,
-  mn as pathRefs,
-  pn as point,
-  Fn as pointRef,
-  En as pointRefs,
-  dn as positions,
-  bn as previous,
-  yn as range,
-  wn as rangeRef,
-  On as rangeRefs,
-  xn as removeMark,
-  Yn as removeNodes,
-  Vn as select,
-  Qn as setNodes,
-  jn as setNormalizing,
-  Mn as setPoint,
-  Wn as setSelection,
-  jr as shouldNormalize,
-  kn as splitNodes,
-  Nn as start,
-  Rn as string,
-  $n as unhangRange,
-  _n as unsetNodes,
-  ut as unwrapNodes,
-  Sn as withoutNormalizing,
-  et as wrapNodes
-};
-//# sourceMappingURL=index.es.es.js.map