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

package/dist/node_modules/.pnpm/@udecode_slate-utils@36.3.9_slate-history@0.100.0_slate@0.102.0__slate@0.102.0/node_modules/@udecode/slate-utils/dist/index.es.js

@@ -1,310 +0,0 @@
-import { getAboveNode as Q, withoutNormalizing as y, isStartPoint as O, isExpanded as j, isEndPoint as k, insertNodes as L, isAncestor as G, getMarks as D, unsetNodes as H, isText as E, getNodeString as J, isInline as K, getParentNode as U, getPath as C, getNodeEntry as W, getNodeDescendants as X, isVoid as Y, match as Z, getNode as M, isBlock as $, moveNodes as ee, getQueryOptions as te, getEditorString as I, getNodeChildren as re, removeNodes as ne, getPreviousNode as ae, getEndPoint as se, getNextNode as oe, getStartPoint as T, getPoint as F, getPointBefore as R } from "../../../../../@udecode_slate@36.0.6_slate-history@0.100.0_slate@0.102.0__slate@0.102.0/node_modules/@udecode/slate/dist/index.es.js";
-import { Range as m, Path as g, Span as ce, Point as ie } from "../../../../../slate@0.102.0/node_modules/slate/dist/index.es.es.js";
-import S from "../../../../../lodash@4.17.21/node_modules/lodash/castArray.es.js";
-import le from "../../../../../lodash@4.17.21/node_modules/lodash/map.es.js";
-import { isDefined as fe } from "../../../../../@udecode_utils@31.0.0/node_modules/@udecode/utils/dist/index.es.js";
-var ue = Object.defineProperty, he = Object.defineProperties, ve = Object.getOwnPropertyDescriptors, N = Object.getOwnPropertySymbols, q = Object.prototype.hasOwnProperty, V = Object.prototype.propertyIsEnumerable, w = (e, r, t) => r in e ? ue(e, r, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[r] = t, d = (e, r) => {
-  for (var t in r || (r = {}))
-    q.call(r, t) && w(e, t, r[t]);
-  if (N)
-    for (var t of N(r))
-      V.call(r, t) && w(e, t, r[t]);
-  return e;
-}, x = (e, r) => he(e, ve(r)), z = (e, r) => {
-  var t = {};
-  for (var n in e)
-    q.call(e, n) && r.indexOf(n) < 0 && (t[n] = e[n]);
-  if (e != null && N)
-    for (var n of N(e))
-      r.indexOf(n) < 0 && V.call(e, n) && (t[n] = e[n]);
-  return t;
-}, Re = (e, r) => {
-  try {
-    const {
-      at: t = e.selection,
-      match: n,
-      reverse: a = !1,
-      voids: o = !1
-    } = r;
-    if (!t)
-      return;
-    let i, s;
-    if (ce.isSpan(t))
-      [i, s] = t;
-    else if (m.isRange(t)) {
-      const l = C(e, t, { edge: "start" }), u = C(e, t, { edge: "end" });
-      i = a ? u : l, s = a ? l : u;
-    }
-    let c = [e, []];
-    g.isPath(t) && (c = W(e, t));
-    const f = X(c[0], {
-      from: i,
-      pass: ([l]) => o ? !1 : Y(e, l),
-      reverse: a,
-      to: s
-    });
-    for (const [l, u] of f)
-      if (Z(l, u, n))
-        return [l, t.concat(u)];
-  } catch {
-    return;
-  }
-}, v = (e, r = {}) => Q(e, x(d({}, r), {
-  block: !0
-})), we = (e) => {
-  const [r, t] = e;
-  if (G(r)) {
-    const { children: n } = r;
-    return n.map((a, o) => {
-      const i = t.concat([o]);
-      return [a, i];
-    });
-  }
-  return [];
-}, ge = (e) => {
-  const [r, t] = e;
-  if (E(r) || r.children.length === 0)
-    return null;
-  const n = r.children;
-  return [n.at(-1), t.concat([n.length - 1])];
-}, de = (e) => {
-  const r = ge(e);
-  return r ? r[1] : e[1].concat([-1]);
-}, je = (e, r) => {
-  const t = de(e);
-  return g.equals(t, r);
-}, me = (e, r) => {
-  if (!e)
-    return;
-  const t = D(e);
-  return t == null ? void 0 : t[r];
-}, Le = (e, r) => {
-  const t = oe(e, {
-    at: r
-  });
-  if (t)
-    return T(e, t[1]);
-}, Pe = (e, r) => {
-  const [t, n] = e, a = r[n.length], o = [], i = t.children;
-  if (a + 1 < t.children.length)
-    for (let s = a + 1; s < t.children.length; s++)
-      o.push(i[s]);
-  return o;
-}, pe = (e, r = {}) => {
-  var t = r, {
-    at: n
-  } = t, a = z(t, [
-    "at"
-  ]);
-  if (n || (n = e.selection), !n)
-    return;
-  const [o, i] = m.edges(n), s = v(e, d({
-    at: o
-  }, a)), c = v(e, d({
-    at: i
-  }, a));
-  if (!(!s && !c))
-    return !s || !c ? !0 : !g.equals(s[1], c[1]);
-}, _e = (e, r, t) => {
-  var n;
-  if (!t || !t.match && !t.matchString)
-    return R(e, r, t);
-  const a = !t.unit || t.unit === "offset", o = t.matchString ? S(t.matchString) : [""], i = (n = t.matchByRegex) != null ? n : !1;
-  let s;
-  return o.some((c) => {
-    var f, l;
-    let u = r, P = F(e, r, { edge: "end" });
-    const b = c.length + 1, p = Array.from({ length: b });
-    let A = 0;
-    for (; ; ) {
-      const h = R(e, u, t);
-      if (!h || pe(e, {
-        at: {
-          anchor: h,
-          focus: P
-        }
-      }))
-        return;
-      const B = I(e, {
-        anchor: h,
-        focus: P
-      });
-      let _ = B;
-      if (a && b && (p.unshift({
-        point: h,
-        text: B
-      }), p.pop(), _ = le(p.slice(0, -1), "text").join("")), (i ? !!c.match(_) : _ === c) || (f = t.match) != null && f.call(t, { at: r, beforePoint: h, beforeString: _ }))
-        return t.afterMatch ? b && a ? (s = (l = p.at(-1)) == null ? void 0 : l.point, !!s) : (s = P, !0) : (s = h, !0);
-      if (P = h, u = h, A += 1, !t.skipInvalid && (!c || A >= c.length))
-        return;
-    }
-  }), s;
-}, Ne = (e, {
-  at: r = e.selection,
-  focus: t
-} = {}) => {
-  let n;
-  return m.isRange(r) && (n = t ? r.focus : r.anchor), ie.isPoint(r) && (n = r), g.isPath(r) && (n = { offset: 0, path: r }), n;
-}, De = (e, r) => {
-  const t = ae(e, {
-    at: r
-  });
-  if (t)
-    return se(e, t[1]);
-}, Ie = (e) => {
-  if (e.length === 0)
-    return;
-  const r = e.at(-1);
-  if (!(r <= 0))
-    return e.slice(0, -1).concat(r - 1);
-}, Te = (e, r, t) => {
-  const n = _e(e, r, t);
-  if (!n)
-    return;
-  const a = F(e, r, { edge: "end" });
-  return {
-    anchor: n,
-    focus: a
-  };
-}, Fe = (e, r = {}) => {
-  var t;
-  const n = (t = v(e, r)) == null ? void 0 : t[1];
-  if (!n)
-    return;
-  const a = T(e, n), o = Ne(e, r);
-  if (o)
-    return { anchor: a, focus: o };
-}, qe = (e) => I(e, e.selection), be = (e, r) => !J(r) && !r.children.some((t) => K(e, t)), Ve = (e) => {
-  var r;
-  const t = (r = v(e)) == null ? void 0 : r[0];
-  return t ? be(e, t) : !1;
-}, ze = (e) => {
-  if (!e.selection)
-    return !1;
-  const r = v(e);
-  if (!r)
-    return !1;
-  const t = e.selection.focus, n = U(e, e.selection);
-  if (!n)
-    return !1;
-  const [, a] = n;
-  if (!k(e, t, a))
-    return !1;
-  const o = Pe(r, t.path);
-  if (o.length > 0) {
-    for (const i of o)
-      if (E(i) && i.text)
-        return !1;
-  } else
-    return k(e, t, r[1]);
-  return !0;
-}, Qe = (e) => e.at(-1) === 0, ke = (e, r) => fe(me(e, r)), Ge = (e, r) => {
-  var t, n;
-  const a = (t = v(e, r)) == null ? void 0 : t[1];
-  return !!a && k(e, (n = e.selection) == null ? void 0 : n.focus, a);
-}, He = (e, r) => {
-  var t;
-  const { selection: n } = e;
-  if (!n)
-    return !1;
-  const a = (t = v(e, r)) == null ? void 0 : t[1];
-  return a ? O(e, n.focus, a) || j(e.selection) && O(e, n.anchor, a) : !1;
-}, Je = (e) => j(e.selection), ye = (e, r, t) => {
-  L(e, r, t);
-}, Ke = (e, r, t) => {
-  ye(
-    e,
-    {
-      children: [{ text: "" }],
-      type: r
-    },
-    te(e, t)
-  );
-}, Ue = (e, { at: r, fromStartIndex: t = 0, match: n, to: a }) => {
-  let o = 0;
-  const i = g.isPath(r) ? r : r[1], s = g.isPath(r) ? M(e, i) : r[0];
-  if (!s || !$(e, s))
-    return o;
-  for (let c = s.children.length - 1; c >= t; c--) {
-    const f = [...i, c], l = M(e, f);
-    (!n || l && n([l, f])) && (ee(e, { at: f, to: a }), o++);
-  }
-  return o;
-}, Ee = (e, r) => {
-  var t = r, { at: n, key: a, shouldChange: o = !0 } = t, i = z(t, ["at", "key", "shouldChange"]), s;
-  const c = n ?? e.selection;
-  if (a = S(a), c) {
-    if (m.isRange(c) && m.isExpanded(c))
-      H(e, a, d({
-        at: c,
-        match: E,
-        split: !0
-      }, i));
-    else if (e.selection) {
-      const f = (s = D(e)) != null ? s : {};
-      a.forEach((l) => {
-        delete f[l];
-      }), e.marks = f, o && e.onChange();
-    }
-  }
-}, Se = (e, r, t) => {
-  y(e, () => {
-    for (const [, n] of re(e, r, {
-      reverse: !0
-    }))
-      ne(e, x(d({}, t), { at: n }));
-  });
-}, We = (e, { at: r, insertOptions: t, nodes: n, removeOptions: a }) => {
-  y(e, () => {
-    Se(e, r, a), L(e, n, x(d({}, t), {
-      at: r.concat([0])
-    }));
-  });
-}, Xe = (e, { clear: r, key: t }) => {
-  e.selection && y(e, () => {
-    if (ke(e, t)) {
-      e.removeMark(t);
-      return;
-    }
-    if (r) {
-      const a = S(r);
-      Ee(e, { key: a });
-    }
-    e.addMark(t, !0);
-  });
-};
-export {
-  Re as findDescendant,
-  v as getBlockAbove,
-  we as getChildren,
-  ge as getLastChild,
-  de as getLastChildPath,
-  me as getMark,
-  Le as getNextNodeStartPoint,
-  Pe as getNextSiblingNodes,
-  _e as getPointBeforeLocation,
-  Ne as getPointFromLocation,
-  De as getPreviousNodeEndPoint,
-  Ie as getPreviousPath,
-  Te as getRangeBefore,
-  Fe as getRangeFromBlockStart,
-  qe as getSelectionText,
-  ye as insertElements,
-  Ke as insertEmptyElement,
-  be as isAncestorEmpty,
-  Ve as isBlockAboveEmpty,
-  ze as isBlockTextEmptyAfterSelection,
-  Qe as isFirstChild,
-  je as isLastChild,
-  ke as isMarkActive,
-  pe as isRangeAcrossBlocks,
-  Ge as isSelectionAtBlockEnd,
-  He as isSelectionAtBlockStart,
-  Je as isSelectionExpanded,
-  Ue as moveChildren,
-  Ee as removeMark,
-  Se as removeNodeChildren,
-  We as replaceNodeChildren,
-  Xe as toggleMark
-};
-//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/@udecode_slate-utils@36.3.9_slate-history@0.100.0_slate@0.102.0__slate@0.102.0/node_modules/@udecode/slate-utils/dist/index.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.es.js","sources":["../../../../../../../../../../node_modules/.pnpm/@udecode+slate-utils@36.3.9_slate-history@0.100.0_slate@0.102.0__slate@0.102.0/node_modules/@udecode/slate-utils/dist/index.mjs"],"sourcesContent":["var __defProp = Object.defineProperty;\nvar __defProps = Object.defineProperties;\nvar __getOwnPropDescs = Object.getOwnPropertyDescriptors;\nvar __getOwnPropSymbols = Object.getOwnPropertySymbols;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __propIsEnum = Object.prototype.propertyIsEnumerable;\nvar __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;\nvar __spreadValues = (a, b) => {\n  for (var prop in b || (b = {}))\n    if (__hasOwnProp.call(b, prop))\n      __defNormalProp(a, prop, b[prop]);\n  if (__getOwnPropSymbols)\n    for (var prop of __getOwnPropSymbols(b)) {\n      if (__propIsEnum.call(b, prop))\n        __defNormalProp(a, prop, b[prop]);\n    }\n  return a;\n};\nvar __spreadProps = (a, b) => __defProps(a, __getOwnPropDescs(b));\nvar __objRest = (source, exclude) => {\n  var target = {};\n  for (var prop in source)\n    if (__hasOwnProp.call(source, prop) && exclude.indexOf(prop) < 0)\n      target[prop] = source[prop];\n  if (source != null && __getOwnPropSymbols)\n    for (var prop of __getOwnPropSymbols(source)) {\n      if (exclude.indexOf(prop) < 0 && __propIsEnum.call(source, prop))\n        target[prop] = source[prop];\n    }\n  return target;\n};\n\n// src/queries/findDescendant.ts\nimport {\n  getNodeDescendants,\n  getNodeEntry,\n  getPath,\n  isVoid,\n  match\n} from \"@udecode/slate\";\nimport { Path, Range, Span } from \"slate\";\nvar findDescendant = (editor, options) => {\n  try {\n    const {\n      at = editor.selection,\n      match: _match,\n      reverse = false,\n      voids = false\n    } = options;\n    if (!at)\n      return;\n    let from;\n    let to;\n    if (Span.isSpan(at)) {\n      [from, to] = at;\n    } else if (Range.isRange(at)) {\n      const first = getPath(editor, at, { edge: \"start\" });\n      const last2 = getPath(editor, at, { edge: \"end\" });\n      from = reverse ? last2 : first;\n      to = reverse ? first : last2;\n    }\n    let root = [editor, []];\n    if (Path.isPath(at)) {\n      root = getNodeEntry(editor, at);\n    }\n    const nodeEntries = getNodeDescendants(root[0], {\n      from,\n      pass: ([n]) => voids ? false : isVoid(editor, n),\n      reverse,\n      to\n    });\n    for (const [node, path] of nodeEntries) {\n      if (match(node, path, _match)) {\n        return [node, at.concat(path)];\n      }\n    }\n  } catch (error) {\n    return void 0;\n  }\n};\n\n// src/queries/getAncestorNode.ts\nimport { getNodeEntry as getNodeEntry2 } from \"@udecode/slate\";\nvar getAncestorNode = (editor, path) => {\n  var _a;\n  const { selection } = editor;\n  const at = path ? path[0] : (_a = selection == null ? void 0 : selection.focus) == null ? void 0 : _a.path[0];\n  if (typeof at !== \"number\")\n    return;\n  return getNodeEntry2(editor, [at]);\n};\n\n// src/queries/getBlockAbove.ts\nimport {\n  getAboveNode\n} from \"@udecode/slate\";\nvar getBlockAbove = (editor, options = {}) => getAboveNode(editor, __spreadProps(__spreadValues({}, options), {\n  block: true\n}));\n\n// src/queries/getChildren.ts\nimport {\n  isAncestor\n} from \"@udecode/slate\";\nvar getChildren = (nodeEntry) => {\n  const [node, path] = nodeEntry;\n  if (isAncestor(node)) {\n    const { children } = node;\n    return children.map((child, index) => {\n      const childPath = path.concat([index]);\n      return [child, childPath];\n    });\n  }\n  return [];\n};\n\n// src/queries/getEdgeBlocksAbove.ts\nimport {\n  getEdgePoints\n} from \"@udecode/slate\";\nvar getEdgeBlocksAbove = (editor, _a = {}) => {\n  var _b = _a, { at: _at } = _b, options = __objRest(_b, [\"at\"]);\n  const at = _at != null ? _at : editor.selection;\n  if (!at)\n    return null;\n  const [start, end] = getEdgePoints(editor, at != null ? at : editor.selection);\n  const startBlock = getBlockAbove(editor, __spreadValues({\n    at: start\n  }, options));\n  if (!startBlock)\n    return null;\n  const endBlock = getBlockAbove(editor, __spreadValues({\n    at: end\n  }, options));\n  if (!endBlock)\n    return null;\n  return [startBlock, endBlock];\n};\n\n// src/queries/getLastChild.ts\nimport {\n  isText\n} from \"@udecode/slate\";\nimport { Path as Path2 } from \"slate\";\nvar getLastChild = (nodeEntry) => {\n  const [node, path] = nodeEntry;\n  if (isText(node))\n    return null;\n  if (node.children.length === 0)\n    return null;\n  const children = node.children;\n  return [children.at(-1), path.concat([children.length - 1])];\n};\nvar getLastChildPath = (nodeEntry) => {\n  const lastChild = getLastChild(nodeEntry);\n  if (!lastChild)\n    return nodeEntry[1].concat([-1]);\n  return lastChild[1];\n};\nvar isLastChild = (parentEntry, childPath) => {\n  const lastChildPath = getLastChildPath(parentEntry);\n  return Path2.equals(lastChildPath, childPath);\n};\n\n// src/queries/getLastNodeByLevel.ts\nimport {\n  getLastNode,\n  isAncestor as isAncestor2\n} from \"@udecode/slate\";\nvar getLastChild2 = (node, level) => {\n  if (!(level + 1) || !isAncestor2(node))\n    return node;\n  const { children } = node;\n  const lastNode = children.at(-1);\n  return getLastChild2(lastNode, level - 1);\n};\nvar getLastNodeByLevel = (editor, level) => {\n  const { children } = editor;\n  const lastNode = children.at(-1);\n  if (!lastNode)\n    return;\n  const [, lastPath] = getLastNode(editor, []);\n  return [getLastChild2(lastNode, level - 1), lastPath.slice(0, level + 1)];\n};\n\n// src/queries/getMark.ts\nimport { getMarks } from \"@udecode/slate\";\nvar getMark = (editor, key) => {\n  if (!editor)\n    return;\n  const marks = getMarks(editor);\n  return marks == null ? void 0 : marks[key];\n};\n\n// src/queries/getNextNodeStartPoint.ts\nimport {\n  getNextNode,\n  getStartPoint\n} from \"@udecode/slate\";\nvar getNextNodeStartPoint = (editor, at) => {\n  const nextEntry = getNextNode(editor, {\n    at\n  });\n  if (!nextEntry)\n    return;\n  return getStartPoint(editor, nextEntry[1]);\n};\n\n// src/queries/getNextSiblingNodes.ts\nvar getNextSiblingNodes = (ancestorEntry, path) => {\n  const [ancestor, ancestorPath] = ancestorEntry;\n  const leafIndex = path[ancestorPath.length];\n  const siblings = [];\n  const ancestorChildren = ancestor.children;\n  if (leafIndex + 1 < ancestor.children.length) {\n    for (let i = leafIndex + 1; i < ancestor.children.length; i++) {\n      siblings.push(ancestorChildren[i]);\n    }\n  }\n  return siblings;\n};\n\n// src/queries/getNodesRange.ts\nimport {\n  getRange\n} from \"@udecode/slate\";\nvar getNodesRange = (editor, nodeEntries) => {\n  if (nodeEntries.length === 0)\n    return;\n  const firstBlockPath = nodeEntries[0][1];\n  const lastBlockPath = nodeEntries.at(-1)[1];\n  return getRange(editor, firstBlockPath, lastBlockPath);\n};\n\n// src/queries/getOperations.ts\nvar getOperations = (editor) => editor.operations;\n\n// src/queries/getPointBeforeLocation.ts\nimport {\n  getEditorString,\n  getPoint,\n  getPointBefore\n} from \"@udecode/slate\";\nimport castArray from \"lodash/castArray.js\";\nimport map from \"lodash/map.js\";\n\n// src/queries/isRangeAcrossBlocks.ts\nimport { Path as Path3, Range as Range2 } from \"slate\";\nvar isRangeAcrossBlocks = (editor, _a = {}) => {\n  var _b = _a, {\n    at\n  } = _b, options = __objRest(_b, [\n    \"at\"\n  ]);\n  if (!at)\n    at = editor.selection;\n  if (!at)\n    return;\n  const [start, end] = Range2.edges(at);\n  const startBlock = getBlockAbove(editor, __spreadValues({\n    at: start\n  }, options));\n  const endBlock = getBlockAbove(editor, __spreadValues({\n    at: end\n  }, options));\n  if (!startBlock && !endBlock)\n    return;\n  if (!startBlock || !endBlock)\n    return true;\n  return !Path3.equals(startBlock[1], endBlock[1]);\n};\n\n// src/queries/getPointBeforeLocation.ts\nvar getPointBeforeLocation = (editor, at, options) => {\n  var _a;\n  if (!options || !options.match && !options.matchString) {\n    return getPointBefore(editor, at, options);\n  }\n  const unitOffset = !options.unit || options.unit === \"offset\";\n  const matchStrings = options.matchString ? castArray(options.matchString) : [\"\"];\n  const matchByRegex = (_a = options.matchByRegex) != null ? _a : false;\n  let point;\n  matchStrings.some((matchString) => {\n    var _a2, _b;\n    let beforeAt = at;\n    let previousBeforePoint = getPoint(editor, at, { edge: \"end\" });\n    const stackLength = matchString.length + 1;\n    const stack = Array.from({ length: stackLength });\n    let count = 0;\n    while (true) {\n      const beforePoint = getPointBefore(editor, beforeAt, options);\n      if (!beforePoint)\n        return;\n      if (isRangeAcrossBlocks(editor, {\n        at: {\n          anchor: beforePoint,\n          focus: previousBeforePoint\n        }\n      })) {\n        return;\n      }\n      const beforeString = getEditorString(editor, {\n        anchor: beforePoint,\n        focus: previousBeforePoint\n      });\n      let beforeStringToMatch = beforeString;\n      if (unitOffset && stackLength) {\n        stack.unshift({\n          point: beforePoint,\n          text: beforeString\n        });\n        stack.pop();\n        beforeStringToMatch = map(stack.slice(0, -1), \"text\").join(\"\");\n      }\n      const isMatched = matchByRegex ? !!matchString.match(beforeStringToMatch) : beforeStringToMatch === matchString;\n      if (isMatched || ((_a2 = options.match) == null ? void 0 : _a2.call(options, { at, beforePoint, beforeString: beforeStringToMatch }))) {\n        if (options.afterMatch) {\n          if (stackLength && unitOffset) {\n            point = (_b = stack.at(-1)) == null ? void 0 : _b.point;\n            return !!point;\n          }\n          point = previousBeforePoint;\n          return true;\n        }\n        point = beforePoint;\n        return true;\n      }\n      previousBeforePoint = beforePoint;\n      beforeAt = beforePoint;\n      count += 1;\n      if (!options.skipInvalid && (!matchString || count >= matchString.length))\n        return;\n    }\n  });\n  return point;\n};\n\n// src/queries/getPointFromLocation.ts\nimport { Path as Path4, Point, Range as Range3 } from \"slate\";\nvar getPointFromLocation = (editor, {\n  at = editor.selection,\n  focus\n} = {}) => {\n  let point;\n  if (Range3.isRange(at))\n    point = focus ? at.focus : at.anchor;\n  if (Point.isPoint(at))\n    point = at;\n  if (Path4.isPath(at))\n    point = { offset: 0, path: at };\n  return point;\n};\n\n// src/queries/getPointNextToVoid.ts\nimport {\n  getPointAfter,\n  getPointBefore as getPointBefore2,\n  getVoidNode\n} from \"@udecode/slate\";\nimport { Path as Path5 } from \"slate\";\nvar getPointNextToVoid = (editor, {\n  after,\n  at\n}) => {\n  const startVoid = getVoidNode(editor, { at, mode: \"highest\" });\n  if (startVoid) {\n    const blockAbove = getBlockAbove(editor, { at });\n    if (blockAbove) {\n      const nextPoint = after ? getPointAfter(editor, at) : getPointBefore2(editor, at);\n      if (nextPoint && blockAbove && Path5.isAncestor(blockAbove[1], nextPoint.path)) {\n        at = nextPoint;\n      }\n    }\n  }\n  return at;\n};\n\n// src/queries/getPreviousBlockById.ts\nimport {\n  findNode,\n  getNodeEntries,\n  getPreviousNode,\n  isBlock,\n  queryNode\n} from \"@udecode/slate\";\nvar getPreviousBlockById = (editor, id, query) => {\n  const entry = findNode(editor, {\n    match: { id }\n  });\n  if (entry) {\n    const prevEntry = getPreviousNode(editor, { at: entry[1] });\n    if ((prevEntry == null ? void 0 : prevEntry[0].id) && isBlock(editor, prevEntry[0])) {\n      return prevEntry;\n    }\n  }\n  let found = false;\n  const _nodes = getNodeEntries(editor, {\n    at: [],\n    match: (n) => {\n      if (!isBlock(editor, n) || !n.id)\n        return false;\n      if (n.id === id) {\n        found = true;\n        return false;\n      }\n      return found && n.id !== id && queryNode([n, []], query);\n    },\n    mode: \"highest\",\n    reverse: true\n  });\n  const nodeEntries = Array.from(_nodes);\n  if (nodeEntries.length > 0) {\n    return nodeEntries[0];\n  }\n  if (!found)\n    return;\n  const _entries = getNodeEntries(editor, {\n    at: [],\n    match: (n) => {\n      return isBlock(editor, n) && !!n.id && queryNode([n, []], query);\n    },\n    mode: \"highest\"\n  });\n  const firstNodeEntry = Array.from(_entries);\n  if (firstNodeEntry.length > 0) {\n    const [, path] = firstNodeEntry[0];\n    path[path.length - 1] = path.at(-1) - 1;\n    return [null, path];\n  }\n};\n\n// src/queries/getPreviousNodeEndPoint.ts\nimport {\n  getEndPoint,\n  getPreviousNode as getPreviousNode2\n} from \"@udecode/slate\";\nvar getPreviousNodeEndPoint = (editor, at) => {\n  const prevEntry = getPreviousNode2(editor, {\n    at\n  });\n  if (!prevEntry)\n    return;\n  return getEndPoint(editor, prevEntry[1]);\n};\n\n// src/queries/getPreviousPath.ts\nvar getPreviousPath = (path) => {\n  if (path.length === 0)\n    return;\n  const last2 = path.at(-1);\n  if (last2 <= 0)\n    return;\n  return path.slice(0, -1).concat(last2 - 1);\n};\n\n// src/queries/getPreviousSiblingNode.ts\nimport { getNode } from \"@udecode/slate\";\nimport last from \"lodash/last.js\";\nvar getPreviousSiblingNode = (editor, path) => {\n  const index = last(path);\n  if (index > 0) {\n    const previousSiblingIndex = index - 1;\n    const previousSiblingPath = path.slice(0, -1).concat([previousSiblingIndex]);\n    const previousSiblingNode = getNode(editor, previousSiblingPath);\n    return previousSiblingNode ? [previousSiblingNode, previousSiblingPath] : void 0;\n  }\n};\n\n// src/queries/getRangeBefore.ts\nimport { getPoint as getPoint2 } from \"@udecode/slate\";\nvar getRangeBefore = (editor, at, options) => {\n  const anchor = getPointBeforeLocation(editor, at, options);\n  if (!anchor)\n    return;\n  const focus = getPoint2(editor, at, { edge: \"end\" });\n  return {\n    anchor,\n    focus\n  };\n};\n\n// src/queries/getRangeFromBlockStart.ts\nimport {\n  getStartPoint as getStartPoint2\n} from \"@udecode/slate\";\nvar getRangeFromBlockStart = (editor, options = {}) => {\n  var _a;\n  const path = (_a = getBlockAbove(editor, options)) == null ? void 0 : _a[1];\n  if (!path)\n    return;\n  const start = getStartPoint2(editor, path);\n  const focus = getPointFromLocation(editor, options);\n  if (!focus)\n    return;\n  return { anchor: start, focus };\n};\n\n// src/queries/getSelectionText.ts\nimport { getEditorString as getEditorString2 } from \"@udecode/slate\";\nvar getSelectionText = (editor) => getEditorString2(editor, editor.selection);\n\n// src/queries/isAncestorEmpty.ts\nimport {\n  getNodeString,\n  isInline\n} from \"@udecode/slate\";\nvar isAncestorEmpty = (editor, node) => !getNodeString(node) && !node.children.some((n) => isInline(editor, n));\n\n// src/queries/isBlockAboveEmpty.ts\nvar isBlockAboveEmpty = (editor) => {\n  var _a;\n  const block = (_a = getBlockAbove(editor)) == null ? void 0 : _a[0];\n  if (!block)\n    return false;\n  return isAncestorEmpty(editor, block);\n};\n\n// src/queries/isBlockTextEmptyAfterSelection.ts\nimport {\n  getParentNode,\n  isEndPoint,\n  isText as isText2\n} from \"@udecode/slate\";\nvar isBlockTextEmptyAfterSelection = (editor) => {\n  if (!editor.selection)\n    return false;\n  const blockAbove = getBlockAbove(editor);\n  if (!blockAbove)\n    return false;\n  const cursor = editor.selection.focus;\n  const selectionParentEntry = getParentNode(editor, editor.selection);\n  if (!selectionParentEntry)\n    return false;\n  const [, selectionParentPath] = selectionParentEntry;\n  if (!isEndPoint(editor, cursor, selectionParentPath))\n    return false;\n  const siblingNodes = getNextSiblingNodes(blockAbove, cursor.path);\n  if (siblingNodes.length > 0) {\n    for (const siblingNode of siblingNodes) {\n      if (isText2(siblingNode) && siblingNode.text) {\n        return false;\n      }\n    }\n  } else {\n    return isEndPoint(editor, cursor, blockAbove[1]);\n  }\n  return true;\n};\n\n// src/queries/isDocumentEnd.ts\nimport {\n  getEndPoint as getEndPoint2,\n  isEndPoint as isEndPoint2\n} from \"@udecode/slate\";\nimport { Path as Path6 } from \"slate\";\nvar isDocumentEnd = (editor) => {\n  if (editor.selection) {\n    const point = editor.selection.focus;\n    const endPoint = getEndPoint2(editor, []);\n    return endPoint.offset === 0 && isEndPoint2(editor, point, point) && Path6.equals(Path6.next(Path6.parent(point.path)), endPoint.path);\n  }\n  return false;\n};\n\n// src/queries/isEditorEmpty.ts\nimport { isElementEmpty } from \"@udecode/slate\";\nvar isEditorEmpty = (editor) => {\n  return editor.children.length === 1 && isElementEmpty(editor, editor.children[0]);\n};\n\n// src/queries/isFirstChild.ts\nvar isFirstChild = (path) => path.at(-1) === 0;\n\n// src/queries/isMarkActive.ts\nimport { isDefined } from \"@udecode/utils\";\nvar isMarkActive = (editor, type) => {\n  return isDefined(getMark(editor, type));\n};\n\n// src/queries/isPointAtWordEnd.ts\nimport {\n  getEditorString as getEditorString3,\n  getPointAfter as getPointAfter2,\n  getRange as getRange2\n} from \"@udecode/slate\";\nvar AFTER_MATCH_REGEX = /^(?:\\s|$)/;\nvar isPointAtWordEnd = (editor, { at }) => {\n  const after = getPointAfter2(editor, at);\n  const afterRange = getRange2(editor, at, after);\n  const afterText = getEditorString3(editor, afterRange);\n  return !!afterText.match(AFTER_MATCH_REGEX);\n};\n\n// src/queries/isRangeInSameBlock.ts\nimport { Path as Path7, Range as Range4 } from \"slate\";\nvar isRangeInSameBlock = (editor, _a = {}) => {\n  var _b = _a, {\n    at\n  } = _b, options = __objRest(_b, [\n    \"at\"\n  ]);\n  if (!at)\n    at = editor.selection;\n  if (!at)\n    return;\n  const [start, end] = Range4.edges(at);\n  const startBlock = getBlockAbove(editor, __spreadValues({\n    at: start\n  }, options));\n  const endBlock = getBlockAbove(editor, __spreadValues({\n    at: end\n  }, options));\n  if (!startBlock || !endBlock)\n    return;\n  return Path7.equals(startBlock[1], endBlock[1]);\n};\n\n// src/queries/isRangeInSingleText.ts\nimport { Path as Path8, Range as Range5 } from \"slate\";\nvar isRangeInSingleText = (at) => {\n  const [start, end] = Range5.edges(at);\n  return Path8.equals(start.path, end.path);\n};\n\n// src/queries/isSelectionAtBlockEnd.ts\nimport {\n  isEndPoint as isEndPoint3\n} from \"@udecode/slate\";\nvar isSelectionAtBlockEnd = (editor, options) => {\n  var _a, _b;\n  const path = (_a = getBlockAbove(editor, options)) == null ? void 0 : _a[1];\n  return !!path && isEndPoint3(editor, (_b = editor.selection) == null ? void 0 : _b.focus, path);\n};\n\n// src/queries/isSelectionAtBlockStart.ts\nimport {\n  isExpanded,\n  isStartPoint\n} from \"@udecode/slate\";\nvar isSelectionAtBlockStart = (editor, options) => {\n  var _a;\n  const { selection } = editor;\n  if (!selection)\n    return false;\n  const path = (_a = getBlockAbove(editor, options)) == null ? void 0 : _a[1];\n  if (!path)\n    return false;\n  return isStartPoint(editor, selection.focus, path) || isExpanded(editor.selection) && isStartPoint(editor, selection.anchor, path);\n};\n\n// src/queries/isSelectionCoverBlock.ts\nvar isSelectionCoverBlock = (editor, _a = {}) => {\n  var _b = _a, {\n    at\n  } = _b, options = __objRest(_b, [\n    \"at\"\n  ]);\n  return isSelectionAtBlockEnd(editor, options) && isSelectionAtBlockStart(editor, options) && isRangeInSameBlock(editor, options);\n};\n\n// src/queries/isSelectionExpanded.ts\nimport { isExpanded as isExpanded2 } from \"@udecode/slate\";\nvar isSelectionExpanded = (editor) => isExpanded2(editor.selection);\n\n// src/queries/isTextByPath.ts\nimport { getNode as getNode2, isText as isText3 } from \"@udecode/slate\";\nvar isTextByPath = (editor, path) => {\n  const node = getNode2(editor, path);\n  return isText3(node);\n};\n\n// src/queries/isWordAfterTrigger.ts\nimport {\n  getEditorString as getEditorString4,\n  getPointBefore as getPointBefore3,\n  getRange as getRange3\n} from \"@udecode/slate\";\nimport { escapeRegExp } from \"@udecode/utils\";\nvar isWordAfterTrigger = (editor, { at, trigger }) => {\n  const wordBefore = getPointBefore3(editor, at, { unit: \"word\" });\n  const before = wordBefore && getPointBefore3(editor, wordBefore);\n  const beforeRange = before && getRange3(editor, before, at);\n  const beforeText = getEditorString4(editor, beforeRange);\n  const escapedTrigger = escapeRegExp(trigger);\n  const beforeRegex = new RegExp(\n    `^${escapedTrigger}([\\\\w|\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\xFF|\\u0430-\\u044F\\u0410-\\u042F\\u0451\\u0401]+)$`\n  );\n  const match2 = beforeText ? beforeText.match(beforeRegex) : null;\n  return {\n    match: match2,\n    range: beforeRange\n  };\n};\n\n// src/queries/queryEditor.ts\nimport {\n  someNode\n} from \"@udecode/slate\";\nimport castArray2 from \"lodash/castArray.js\";\nvar queryEditor = (editor, {\n  allow,\n  at = editor.selection || [],\n  exclude,\n  filter,\n  selectionAtBlockEnd,\n  selectionAtBlockStart\n} = {}) => {\n  if (filter && !filter(editor) || selectionAtBlockStart && !isSelectionAtBlockStart(editor) || selectionAtBlockEnd && !isSelectionAtBlockEnd(editor)) {\n    return false;\n  }\n  const allows = castArray2(allow);\n  if (allows.length > 0 && !someNode(editor, { at, match: { type: allows } })) {\n    return false;\n  }\n  const excludes = castArray2(exclude);\n  if (excludes.length > 0 && someNode(editor, { at, match: { type: excludes } })) {\n    return false;\n  }\n  return true;\n};\n\n// src/transforms/insertElements.ts\nimport {\n  insertNodes\n} from \"@udecode/slate\";\nvar insertElements = (editor, nodes, options) => {\n  insertNodes(editor, nodes, options);\n};\n\n// src/transforms/insertEmptyElement.ts\nimport {\n  getQueryOptions\n} from \"@udecode/slate\";\nvar insertEmptyElement = (editor, type, options) => {\n  insertElements(\n    editor,\n    {\n      children: [{ text: \"\" }],\n      type\n    },\n    getQueryOptions(editor, options)\n  );\n};\n\n// src/transforms/moveChildren.ts\nimport {\n  getNode as getNode3,\n  isBlock as isBlock2,\n  moveNodes\n} from \"@udecode/slate\";\nimport { Path as Path9 } from \"slate\";\nvar moveChildren = (editor, { at, fromStartIndex = 0, match: match2, to }) => {\n  let moved = 0;\n  const parentPath = Path9.isPath(at) ? at : at[1];\n  const parentNode = Path9.isPath(at) ? getNode3(editor, parentPath) : at[0];\n  if (!parentNode)\n    return moved;\n  if (!isBlock2(editor, parentNode))\n    return moved;\n  for (let i = parentNode.children.length - 1; i >= fromStartIndex; i--) {\n    const childPath = [...parentPath, i];\n    const childNode = getNode3(editor, childPath);\n    if (!match2 || childNode && match2([childNode, childPath])) {\n      moveNodes(editor, { at: childPath, to });\n      moved++;\n    }\n  }\n  return moved;\n};\n\n// src/transforms/removeMark.ts\nimport {\n  getMarks as getMarks2,\n  isText as isText4,\n  unsetNodes\n} from \"@udecode/slate\";\nimport castArray3 from \"lodash/castArray.js\";\nimport { Range as Range6 } from \"slate\";\nvar removeMark = (editor, _a) => {\n  var _b = _a, { at, key, shouldChange = true } = _b, rest = __objRest(_b, [\"at\", \"key\", \"shouldChange\"]);\n  var _a2;\n  const selection = at != null ? at : editor.selection;\n  key = castArray3(key);\n  if (selection) {\n    if (Range6.isRange(selection) && Range6.isExpanded(selection)) {\n      unsetNodes(editor, key, __spreadValues({\n        at: selection,\n        match: isText4,\n        split: true\n      }, rest));\n    } else if (editor.selection) {\n      const marks = (_a2 = getMarks2(editor)) != null ? _a2 : {};\n      key.forEach((k) => {\n        delete marks[k];\n      });\n      editor.marks = marks;\n      shouldChange && editor.onChange();\n    }\n  }\n};\n\n// src/transforms/removeNodeChildren.ts\nimport {\n  getNodeChildren,\n  removeNodes,\n  withoutNormalizing\n} from \"@udecode/slate\";\nvar removeNodeChildren = (editor, path, options) => {\n  withoutNormalizing(editor, () => {\n    for (const [, childPath] of getNodeChildren(editor, path, {\n      reverse: true\n    })) {\n      removeNodes(editor, __spreadProps(__spreadValues({}, options), { at: childPath }));\n    }\n  });\n};\n\n// src/transforms/removeSelectionMark.ts\nimport {\n  getMarks as getMarks3,\n  removeEditorMark\n} from \"@udecode/slate\";\nvar removeSelectionMark = (editor) => {\n  const marks = getMarks3(editor);\n  if (!marks)\n    return;\n  Object.keys(marks).forEach((key) => {\n    removeEditorMark(editor, key);\n  });\n};\n\n// src/transforms/replaceNode.ts\nimport {\n  insertNodes as insertNodes2,\n  removeNodes as removeNodes2,\n  withoutNormalizing as withoutNormalizing2\n} from \"@udecode/slate\";\nvar replaceNode = (editor, { at, insertOptions, nodes, removeOptions }) => {\n  withoutNormalizing2(editor, () => {\n    removeNodes2(editor, __spreadProps(__spreadValues({}, removeOptions), { at }));\n    insertNodes2(editor, nodes, __spreadProps(__spreadValues({}, insertOptions), {\n      at\n    }));\n  });\n};\n\n// src/transforms/replaceNodeChildren.ts\nimport {\n  insertNodes as insertNodes3,\n  withoutNormalizing as withoutNormalizing3\n} from \"@udecode/slate\";\nvar replaceNodeChildren = (editor, { at, insertOptions, nodes, removeOptions }) => {\n  withoutNormalizing3(editor, () => {\n    removeNodeChildren(editor, at, removeOptions);\n    insertNodes3(editor, nodes, __spreadProps(__spreadValues({}, insertOptions), {\n      at: at.concat([0])\n    }));\n  });\n};\n\n// src/transforms/selectEndOfBlockAboveSelection.ts\nimport { getEndPoint as getEndPoint3, select } from \"@udecode/slate\";\nvar selectEndOfBlockAboveSelection = (editor) => {\n  var _a;\n  const path = (_a = getBlockAbove(editor)) == null ? void 0 : _a[1];\n  path && select(editor, getEndPoint3(editor, path));\n};\n\n// src/transforms/setMarks.ts\nimport {\n  withoutNormalizing as withoutNormalizing4\n} from \"@udecode/slate\";\nimport castArray4 from \"lodash/castArray.js\";\nvar setMarks = (editor, marks, clear = []) => {\n  if (!editor.selection)\n    return;\n  withoutNormalizing4(editor, () => {\n    const clears = castArray4(clear);\n    removeMark(editor, { key: clears });\n    removeMark(editor, { key: Object.keys(marks) });\n    Object.keys(marks).forEach((key) => {\n      editor.addMark(key, marks[key]);\n    });\n  });\n};\n\n// src/transforms/toggleMark.ts\nimport { withoutNormalizing as withoutNormalizing5 } from \"@udecode/slate\";\nimport castArray5 from \"lodash/castArray.js\";\nvar toggleMark = (editor, { clear, key }) => {\n  if (!editor.selection)\n    return;\n  withoutNormalizing5(editor, () => {\n    const isActive = isMarkActive(editor, key);\n    if (isActive) {\n      editor.removeMark(key);\n      return;\n    }\n    if (clear) {\n      const clears = castArray5(clear);\n      removeMark(editor, { key: clears });\n    }\n    editor.addMark(key, true);\n  });\n};\n\n// src/transforms/toggleWrapNodes.ts\nimport {\n  someNode as someNode2,\n  unwrapNodes,\n  wrapNodes\n} from \"@udecode/slate\";\nvar toggleWrapNodes = (editor, type) => {\n  if (someNode2(editor, { match: { type } })) {\n    unwrapNodes(editor, { match: { type } });\n  } else {\n    wrapNodes(editor, {\n      children: [],\n      type\n    });\n  }\n};\n\n// src/transforms/wrapNodeChildren.ts\nimport {\n  getNode as getNode4,\n  withoutNormalizing as withoutNormalizing6,\n  wrapNodes as wrapNodes2\n} from \"@udecode/slate\";\nvar wrapNodeChildren = (editor, element, options) => {\n  const path = options == null ? void 0 : options.at;\n  const node = getNode4(editor, path);\n  if (!(node == null ? void 0 : node.children))\n    return;\n  withoutNormalizing6(editor, () => {\n    const firstChildPath = path.concat([0]);\n    wrapNodes2(editor, element, __spreadProps(__spreadValues({}, options), {\n      at: firstChildPath\n    }));\n    if (node.children.length < 2)\n      return;\n    moveChildren(editor, {\n      at: path,\n      fromStartIndex: 1,\n      to: firstChildPath.concat([1])\n    });\n  });\n};\n\n// src/utils/createDocumentNode.ts\nvar createDocumentNode = (type = \"p\", text = \"\", remaining = []) => [\n  {\n    children: [\n      {\n        children: [{ text }],\n        type\n      },\n      ...remaining\n    ]\n  }\n];\n\n// src/utils/createNode.ts\nvar createNode = (type = \"p\", text = \"\") => ({\n  children: [{ text }],\n  type\n});\nexport {\n  createDocumentNode,\n  createNode,\n  findDescendant,\n  getAncestorNode,\n  getBlockAbove,\n  getChildren,\n  getEdgeBlocksAbove,\n  getLastChild,\n  getLastChildPath,\n  getLastNodeByLevel,\n  getMark,\n  getNextNodeStartPoint,\n  getNextSiblingNodes,\n  getNodesRange,\n  getOperations,\n  getPointBeforeLocation,\n  getPointFromLocation,\n  getPointNextToVoid,\n  getPreviousBlockById,\n  getPreviousNodeEndPoint,\n  getPreviousPath,\n  getPreviousSiblingNode,\n  getRangeBefore,\n  getRangeFromBlockStart,\n  getSelectionText,\n  insertElements,\n  insertEmptyElement,\n  isAncestorEmpty,\n  isBlockAboveEmpty,\n  isBlockTextEmptyAfterSelection,\n  isDocumentEnd,\n  isEditorEmpty,\n  isFirstChild,\n  isLastChild,\n  isMarkActive,\n  isPointAtWordEnd,\n  isRangeAcrossBlocks,\n  isRangeInSameBlock,\n  isRangeInSingleText,\n  isSelectionAtBlockEnd,\n  isSelectionAtBlockStart,\n  isSelectionCoverBlock,\n  isSelectionExpanded,\n  isTextByPath,\n  isWordAfterTrigger,\n  moveChildren,\n  queryEditor,\n  removeMark,\n  removeNodeChildren,\n  removeSelectionMark,\n  replaceNode,\n  replaceNodeChildren,\n  selectEndOfBlockAboveSelection,\n  setMarks,\n  toggleMark,\n  toggleWrapNodes,\n  wrapNodeChildren\n};\n//# sourceMappingURL=index.mjs.map"],"names":["__defProp","__defProps","__getOwnPropDescs","__getOwnPropSymbols","__hasOwnProp","__propIsEnum","__defNormalProp","obj","key","value","__spreadValues","a","b","prop","__spreadProps","__objRest","source","exclude","target","findDescendant","editor","options","at","_match","reverse","voids","from","to","Span","Range","first","getPath","last2","root","Path","getNodeEntry","nodeEntries","getNodeDescendants","n","isVoid","node","path","match","getBlockAbove","getAboveNode","getChildren","nodeEntry","isAncestor","children","child","index","childPath","getLastChild","isText","getLastChildPath","lastChild","isLastChild","parentEntry","lastChildPath","Path2","getMark","marks","getMarks","getNextNodeStartPoint","nextEntry","getNextNode","getStartPoint","getNextSiblingNodes","ancestorEntry","ancestor","ancestorPath","leafIndex","siblings","ancestorChildren","i","isRangeAcrossBlocks","_a","_b","start","end","Range2","startBlock","endBlock","Path3","getPointBeforeLocation","getPointBefore","unitOffset","matchStrings","castArray","matchByRegex","point","matchString","_a2","beforeAt","previousBeforePoint","getPoint","stackLength","stack","count","beforePoint","beforeString","getEditorString","beforeStringToMatch","map","getPointFromLocation","focus","Range3","Point","Path4","getPreviousNodeEndPoint","prevEntry","getPreviousNode2","getEndPoint","getPreviousPath","getRangeBefore","anchor","getPoint2","getRangeFromBlockStart","getStartPoint2","getSelectionText","getEditorString2","isAncestorEmpty","getNodeString","isInline","isBlockAboveEmpty","block","isBlockTextEmptyAfterSelection","blockAbove","cursor","selectionParentEntry","getParentNode","selectionParentPath","isEndPoint","siblingNodes","siblingNode","isText2","isFirstChild","isMarkActive","type","isDefined","isSelectionAtBlockEnd","isEndPoint3","isSelectionAtBlockStart","selection","isStartPoint","isExpanded","isSelectionExpanded","isExpanded2","insertElements","nodes","insertNodes","insertEmptyElement","getQueryOptions","moveChildren","fromStartIndex","match2","moved","parentPath","Path9","parentNode","getNode3","isBlock2","childNode","moveNodes","removeMark","shouldChange","rest","castArray3","Range6","unsetNodes","isText4","getMarks2","k","removeNodeChildren","withoutNormalizing","getNodeChildren","removeNodes","replaceNodeChildren","insertOptions","removeOptions","withoutNormalizing3","insertNodes3","toggleMark","clear","withoutNormalizing5","clears","castArray5"],"mappings":";;;;;AAAA,IAAIA,KAAY,OAAO,gBACnBC,KAAa,OAAO,kBACpBC,KAAoB,OAAO,2BAC3BC,IAAsB,OAAO,uBAC7BC,IAAe,OAAO,UAAU,gBAChCC,IAAe,OAAO,UAAU,sBAChCC,IAAkB,CAACC,GAAKC,GAAKC,MAAUD,KAAOD,IAAMP,GAAUO,GAAKC,GAAK,EAAE,YAAY,IAAM,cAAc,IAAM,UAAU,IAAM,OAAAC,EAAK,CAAE,IAAIF,EAAIC,CAAG,IAAIC,GACtJC,IAAiB,CAACC,GAAGC,MAAM;AAC7B,WAASC,KAAQD,MAAMA,IAAI,CAAA;AACzB,IAAIR,EAAa,KAAKQ,GAAGC,CAAI,KAC3BP,EAAgBK,GAAGE,GAAMD,EAAEC,CAAI,CAAC;AACpC,MAAIV;AACF,aAASU,KAAQV,EAAoBS,CAAC;AACpC,MAAIP,EAAa,KAAKO,GAAGC,CAAI,KAC3BP,EAAgBK,GAAGE,GAAMD,EAAEC,CAAI,CAAC;AAEtC,SAAOF;AACT,GACIG,IAAgB,CAACH,GAAGC,MAAMX,GAAWU,GAAGT,GAAkBU,CAAC,CAAC,GAC5DG,IAAY,CAACC,GAAQC,MAAY;AACnC,MAAIC,IAAS,CAAA;AACb,WAASL,KAAQG;AACf,IAAIZ,EAAa,KAAKY,GAAQH,CAAI,KAAKI,EAAQ,QAAQJ,CAAI,IAAI,MAC7DK,EAAOL,CAAI,IAAIG,EAAOH,CAAI;AAC9B,MAAIG,KAAU,QAAQb;AACpB,aAASU,KAAQV,EAAoBa,CAAM;AACzC,MAAIC,EAAQ,QAAQJ,CAAI,IAAI,KAAKR,EAAa,KAAKW,GAAQH,CAAI,MAC7DK,EAAOL,CAAI,IAAIG,EAAOH,CAAI;AAEhC,SAAOK;AACT,GAWIC,KAAiB,CAACC,GAAQC,MAAY;AACxC,MAAI;AACF,UAAM;AAAA,MACJ,IAAAC,IAAKF,EAAO;AAAA,MACZ,OAAOG;AAAA,MACP,SAAAC,IAAU;AAAA,MACV,OAAAC,IAAQ;AAAA,IACd,IAAQJ;AACJ,QAAI,CAACC;AACH;AACF,QAAII,GACAC;AACJ,QAAIC,GAAK,OAAON,CAAE;AAChB,OAACI,GAAMC,CAAE,IAAIL;AAAA,aACJO,EAAM,QAAQP,CAAE,GAAG;AAC5B,YAAMQ,IAAQC,EAAQX,GAAQE,GAAI,EAAE,MAAM,SAAS,GAC7CU,IAAQD,EAAQX,GAAQE,GAAI,EAAE,MAAM,OAAO;AACjD,MAAAI,IAAOF,IAAUQ,IAAQF,GACzBH,IAAKH,IAAUM,IAAQE;AAAA,IACzB;AACA,QAAIC,IAAO,CAACb,GAAQ,EAAE;AACtB,IAAIc,EAAK,OAAOZ,CAAE,MAChBW,IAAOE,EAAaf,GAAQE,CAAE;AAEhC,UAAMc,IAAcC,EAAmBJ,EAAK,CAAC,GAAG;AAAA,MAC9C,MAAAP;AAAA,MACA,MAAM,CAAC,CAACY,CAAC,MAAMb,IAAQ,KAAQc,EAAOnB,GAAQkB,CAAC;AAAA,MAC/C,SAAAd;AAAA,MACA,IAAAG;AAAA,IACN,CAAK;AACD,eAAW,CAACa,GAAMC,CAAI,KAAKL;AACzB,UAAIM,EAAMF,GAAMC,GAAMlB,CAAM;AAC1B,eAAO,CAACiB,GAAMlB,EAAG,OAAOmB,CAAI,CAAC;AAAA,EAGnC,QAAgB;AACd;AAAA,EACF;AACF,GAiBIE,IAAgB,CAACvB,GAAQC,IAAU,OAAOuB,EAAaxB,GAAQN,EAAcJ,EAAe,CAAA,GAAIW,CAAO,GAAG;AAAA,EAC5G,OAAO;AACT,CAAC,CAAC,GAMEwB,KAAc,CAACC,MAAc;AAC/B,QAAM,CAACN,GAAMC,CAAI,IAAIK;AACrB,MAAIC,EAAWP,CAAI,GAAG;AACpB,UAAM,EAAE,UAAAQ,EAAQ,IAAKR;AACrB,WAAOQ,EAAS,IAAI,CAACC,GAAOC,MAAU;AACpC,YAAMC,IAAYV,EAAK,OAAO,CAACS,CAAK,CAAC;AACrC,aAAO,CAACD,GAAOE,CAAS;AAAA,IAC1B,CAAC;AAAA,EACH;AACA,SAAO,CAAA;AACT,GA8BIC,KAAe,CAACN,MAAc;AAChC,QAAM,CAACN,GAAMC,CAAI,IAAIK;AAGrB,MAFIO,EAAOb,CAAI,KAEXA,EAAK,SAAS,WAAW;AAC3B,WAAO;AACT,QAAMQ,IAAWR,EAAK;AACtB,SAAO,CAACQ,EAAS,GAAG,EAAE,GAAGP,EAAK,OAAO,CAACO,EAAS,SAAS,CAAC,CAAC,CAAC;AAC7D,GACIM,KAAmB,CAACR,MAAc;AACpC,QAAMS,IAAYH,GAAaN,CAAS;AACxC,SAAKS,IAEEA,EAAU,CAAC,IADTT,EAAU,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;AAEnC,GACIU,KAAc,CAACC,GAAaN,MAAc;AAC5C,QAAMO,IAAgBJ,GAAiBG,CAAW;AAClD,SAAOE,EAAM,OAAOD,GAAeP,CAAS;AAC9C,GAyBIS,KAAU,CAACxC,GAAQZ,MAAQ;AAC7B,MAAI,CAACY;AACH;AACF,QAAMyC,IAAQC,EAAS1C,CAAM;AAC7B,SAAOyC,KAAS,OAAO,SAASA,EAAMrD,CAAG;AAC3C,GAOIuD,KAAwB,CAAC3C,GAAQE,MAAO;AAC1C,QAAM0C,IAAYC,GAAY7C,GAAQ;AAAA,IACpC,IAAAE;AAAA,EACJ,CAAG;AACD,MAAK0C;AAEL,WAAOE,EAAc9C,GAAQ4C,EAAU,CAAC,CAAC;AAC3C,GAGIG,KAAsB,CAACC,GAAe3B,MAAS;AACjD,QAAM,CAAC4B,GAAUC,CAAY,IAAIF,GAC3BG,IAAY9B,EAAK6B,EAAa,MAAM,GACpCE,IAAW,CAAA,GACXC,IAAmBJ,EAAS;AAClC,MAAIE,IAAY,IAAIF,EAAS,SAAS;AACpC,aAASK,IAAIH,IAAY,GAAGG,IAAIL,EAAS,SAAS,QAAQK;AACxD,MAAAF,EAAS,KAAKC,EAAiBC,CAAC,CAAC;AAGrC,SAAOF;AACT,GA4BIG,KAAsB,CAACvD,GAAQwD,IAAK,OAAO;AAC7C,MAAIC,IAAKD,GAAI;AAAA,IACX,IAAAtD;AAAA,EACJ,IAAMuD,GAAIxD,IAAUN,EAAU8D,GAAI;AAAA,IAC9B;AAAA,EACJ,CAAG;AAGD,MAFKvD,MACHA,IAAKF,EAAO,YACV,CAACE;AACH;AACF,QAAM,CAACwD,GAAOC,CAAG,IAAIC,EAAO,MAAM1D,CAAE,GAC9B2D,IAAatC,EAAcvB,GAAQV,EAAe;AAAA,IACtD,IAAIoE;AAAA,EACR,GAAKzD,CAAO,CAAC,GACL6D,IAAWvC,EAAcvB,GAAQV,EAAe;AAAA,IACpD,IAAIqE;AAAA,EACR,GAAK1D,CAAO,CAAC;AACX,MAAI,GAAC4D,KAAc,CAACC;AAEpB,WAAI,CAACD,KAAc,CAACC,IACX,KACF,CAACC,EAAM,OAAOF,EAAW,CAAC,GAAGC,EAAS,CAAC,CAAC;AACjD,GAGIE,KAAyB,CAAChE,GAAQE,GAAID,MAAY;AACpD,MAAIuD;AACJ,MAAI,CAACvD,KAAW,CAACA,EAAQ,SAAS,CAACA,EAAQ;AACzC,WAAOgE,EAAejE,GAAQE,GAAID,CAAO;AAE3C,QAAMiE,IAAa,CAACjE,EAAQ,QAAQA,EAAQ,SAAS,UAC/CkE,IAAelE,EAAQ,cAAcmE,EAAUnE,EAAQ,WAAW,IAAI,CAAC,EAAE,GACzEoE,KAAgBb,IAAKvD,EAAQ,iBAAiB,OAAOuD,IAAK;AAChE,MAAIc;AACJ,SAAAH,EAAa,KAAK,CAACI,MAAgB;AACjC,QAAIC,GAAKf;AACT,QAAIgB,IAAWvE,GACXwE,IAAsBC,EAAS3E,GAAQE,GAAI,EAAE,MAAM,OAAO;AAC9D,UAAM0E,IAAcL,EAAY,SAAS,GACnCM,IAAQ,MAAM,KAAK,EAAE,QAAQD,EAAW,CAAE;AAChD,QAAIE,IAAQ;AACZ,eAAa;AACX,YAAMC,IAAcd,EAAejE,GAAQyE,GAAUxE,CAAO;AAG5D,UAFI,CAAC8E,KAEDxB,GAAoBvD,GAAQ;AAAA,QAC9B,IAAI;AAAA,UACF,QAAQ+E;AAAA,UACR,OAAOL;AAAA,QACjB;AAAA,MACA,CAAO;AACC;AAEF,YAAMM,IAAeC,EAAgBjF,GAAQ;AAAA,QAC3C,QAAQ+E;AAAA,QACR,OAAOL;AAAA,MACf,CAAO;AACD,UAAIQ,IAAsBF;AAU1B,UATId,KAAcU,MAChBC,EAAM,QAAQ;AAAA,QACZ,OAAOE;AAAA,QACP,MAAMC;AAAA,MAChB,CAAS,GACDH,EAAM,IAAG,GACTK,IAAsBC,GAAIN,EAAM,MAAM,GAAG,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,KAE7CR,IAAe,CAAC,CAACE,EAAY,MAAMW,CAAmB,IAAIA,MAAwBX,OACjFC,IAAMvE,EAAQ,UAAU,QAAgBuE,EAAI,KAAKvE,GAAS,EAAE,IAAAC,GAAI,aAAA6E,GAAa,cAAcG,EAAmB,CAAE;AACjI,eAAIjF,EAAQ,aACN2E,KAAeV,KACjBI,KAASb,IAAKoB,EAAM,GAAG,EAAE,MAAM,OAAO,SAASpB,EAAG,OAC3C,CAAC,CAACa,MAEXA,IAAQI,GACD,OAETJ,IAAQS,GACD;AAKT,UAHAL,IAAsBK,GACtBN,IAAWM,GACXD,KAAS,GACL,CAAC7E,EAAQ,gBAAgB,CAACsE,KAAeO,KAASP,EAAY;AAChE;AAAA,IACJ;AAAA,EACF,CAAC,GACMD;AACT,GAIIc,KAAuB,CAACpF,GAAQ;AAAA,EAClC,IAAAE,IAAKF,EAAO;AAAA,EACZ,OAAAqF;AACF,IAAI,OAAO;AACT,MAAIf;AACJ,SAAIgB,EAAO,QAAQpF,CAAE,MACnBoE,IAAQe,IAAQnF,EAAG,QAAQA,EAAG,SAC5BqF,GAAM,QAAQrF,CAAE,MAClBoE,IAAQpE,IACNsF,EAAM,OAAOtF,CAAE,MACjBoE,IAAQ,EAAE,QAAQ,GAAG,MAAMpE,EAAE,IACxBoE;AACT,GAqFImB,KAA0B,CAACzF,GAAQE,MAAO;AAC5C,QAAMwF,IAAYC,GAAiB3F,GAAQ;AAAA,IACzC,IAAAE;AAAA,EACJ,CAAG;AACD,MAAKwF;AAEL,WAAOE,GAAY5F,GAAQ0F,EAAU,CAAC,CAAC;AACzC,GAGIG,KAAkB,CAACxE,MAAS;AAC9B,MAAIA,EAAK,WAAW;AAClB;AACF,QAAMT,IAAQS,EAAK,GAAG,EAAE;AACxB,MAAI,EAAAT,KAAS;AAEb,WAAOS,EAAK,MAAM,GAAG,EAAE,EAAE,OAAOT,IAAQ,CAAC;AAC3C,GAiBIkF,KAAiB,CAAC9F,GAAQE,GAAID,MAAY;AAC5C,QAAM8F,IAAS/B,GAAuBhE,GAAQE,GAAID,CAAO;AACzD,MAAI,CAAC8F;AACH;AACF,QAAMV,IAAQW,EAAUhG,GAAQE,GAAI,EAAE,MAAM,OAAO;AACnD,SAAO;AAAA,IACL,QAAA6F;AAAA,IACA,OAAAV;AAAA,EACJ;AACA,GAMIY,KAAyB,CAACjG,GAAQC,IAAU,OAAO;AACrD,MAAIuD;AACJ,QAAMnC,KAAQmC,IAAKjC,EAAcvB,GAAQC,CAAO,MAAM,OAAO,SAASuD,EAAG,CAAC;AAC1E,MAAI,CAACnC;AACH;AACF,QAAMqC,IAAQwC,EAAelG,GAAQqB,CAAI,GACnCgE,IAAQD,GAAqBpF,GAAQC,CAAO;AAClD,MAAKoF;AAEL,WAAO,EAAE,QAAQ3B,GAAO,OAAA2B,EAAK;AAC/B,GAIIc,KAAmB,CAACnG,MAAWoG,EAAiBpG,GAAQA,EAAO,SAAS,GAOxEqG,KAAkB,CAACrG,GAAQoB,MAAS,CAACkF,EAAclF,CAAI,KAAK,CAACA,EAAK,SAAS,KAAK,CAACF,MAAMqF,EAASvG,GAAQkB,CAAC,CAAC,GAG1GsF,KAAoB,CAACxG,MAAW;AAClC,MAAIwD;AACJ,QAAMiD,KAASjD,IAAKjC,EAAcvB,CAAM,MAAM,OAAO,SAASwD,EAAG,CAAC;AAClE,SAAKiD,IAEEJ,GAAgBrG,GAAQyG,CAAK,IAD3B;AAEX,GAQIC,KAAiC,CAAC1G,MAAW;AAC/C,MAAI,CAACA,EAAO;AACV,WAAO;AACT,QAAM2G,IAAapF,EAAcvB,CAAM;AACvC,MAAI,CAAC2G;AACH,WAAO;AACT,QAAMC,IAAS5G,EAAO,UAAU,OAC1B6G,IAAuBC,EAAc9G,GAAQA,EAAO,SAAS;AACnE,MAAI,CAAC6G;AACH,WAAO;AACT,QAAM,CAAA,EAAGE,CAAmB,IAAIF;AAChC,MAAI,CAACG,EAAWhH,GAAQ4G,GAAQG,CAAmB;AACjD,WAAO;AACT,QAAME,IAAelE,GAAoB4D,GAAYC,EAAO,IAAI;AAChE,MAAIK,EAAa,SAAS;AACxB,eAAWC,KAAeD;AACxB,UAAIE,EAAQD,CAAW,KAAKA,EAAY;AACtC,eAAO;AAAA;AAIX,WAAOF,EAAWhH,GAAQ4G,GAAQD,EAAW,CAAC,CAAC;AAEjD,SAAO;AACT,GAwBIS,KAAe,CAAC/F,MAASA,EAAK,GAAG,EAAE,MAAM,GAIzCgG,KAAe,CAACrH,GAAQsH,MACnBC,GAAU/E,GAAQxC,GAAQsH,CAAI,CAAC,GAoDpCE,KAAwB,CAACxH,GAAQC,MAAY;AAC/C,MAAIuD,GAAIC;AACR,QAAMpC,KAAQmC,IAAKjC,EAAcvB,GAAQC,CAAO,MAAM,OAAO,SAASuD,EAAG,CAAC;AAC1E,SAAO,CAAC,CAACnC,KAAQoG,EAAYzH,IAASyD,IAAKzD,EAAO,cAAc,OAAO,SAASyD,EAAG,OAAOpC,CAAI;AAChG,GAOIqG,KAA0B,CAAC1H,GAAQC,MAAY;AACjD,MAAIuD;AACJ,QAAM,EAAE,WAAAmE,EAAS,IAAK3H;AACtB,MAAI,CAAC2H;AACH,WAAO;AACT,QAAMtG,KAAQmC,IAAKjC,EAAcvB,GAAQC,CAAO,MAAM,OAAO,SAASuD,EAAG,CAAC;AAC1E,SAAKnC,IAEEuG,EAAa5H,GAAQ2H,EAAU,OAAOtG,CAAI,KAAKwG,EAAW7H,EAAO,SAAS,KAAK4H,EAAa5H,GAAQ2H,EAAU,QAAQtG,CAAI,IADxH;AAEX,GAcIyG,KAAsB,CAAC9H,MAAW+H,EAAY/H,EAAO,SAAS,GA+D9DgI,KAAiB,CAAChI,GAAQiI,GAAOhI,MAAY;AAC/C,EAAAiI,EAAYlI,GAAQiI,GAAOhI,CAAO;AACpC,GAMIkI,KAAqB,CAACnI,GAAQsH,GAAMrH,MAAY;AAClD,EAAA+H;AAAA,IACEhI;AAAA,IACA;AAAA,MACE,UAAU,CAAC,EAAE,MAAM,IAAI;AAAA,MACvB,MAAAsH;AAAA,IACN;AAAA,IACIc,GAAgBpI,GAAQC,CAAO;AAAA,EACnC;AACA,GASIoI,KAAe,CAACrI,GAAQ,EAAE,IAAAE,GAAI,gBAAAoI,IAAiB,GAAG,OAAOC,GAAQ,IAAAhI,QAAS;AAC5E,MAAIiI,IAAQ;AACZ,QAAMC,IAAaC,EAAM,OAAOxI,CAAE,IAAIA,IAAKA,EAAG,CAAC,GACzCyI,IAAaD,EAAM,OAAOxI,CAAE,IAAI0I,EAAS5I,GAAQyI,CAAU,IAAIvI,EAAG,CAAC;AAGzE,MAFI,CAACyI,KAED,CAACE,EAAS7I,GAAQ2I,CAAU;AAC9B,WAAOH;AACT,WAASlF,IAAIqF,EAAW,SAAS,SAAS,GAAGrF,KAAKgF,GAAgBhF,KAAK;AACrE,UAAMvB,IAAY,CAAC,GAAG0G,GAAYnF,CAAC,GAC7BwF,IAAYF,EAAS5I,GAAQ+B,CAAS;AAC5C,KAAI,CAACwG,KAAUO,KAAaP,EAAO,CAACO,GAAW/G,CAAS,CAAC,OACvDgH,GAAU/I,GAAQ,EAAE,IAAI+B,GAAW,IAAAxB,EAAE,CAAE,GACvCiI;AAAA,EAEJ;AACA,SAAOA;AACT,GAUIQ,KAAa,CAAChJ,GAAQwD,MAAO;AAC/B,MAAIC,IAAKD,GAAI,EAAE,IAAAtD,GAAI,KAAAd,GAAK,cAAA6J,IAAe,GAAI,IAAKxF,GAAIyF,IAAOvJ,EAAU8D,GAAI,CAAC,MAAM,OAAO,cAAc,CAAC,GAClGe;AACJ,QAAMmD,IAAYzH,KAAkBF,EAAO;AAE3C,MADAZ,IAAM+J,EAAW/J,CAAG,GAChBuI;AACF,QAAIyB,EAAO,QAAQzB,CAAS,KAAKyB,EAAO,WAAWzB,CAAS;AAC1D,MAAA0B,EAAWrJ,GAAQZ,GAAKE,EAAe;AAAA,QACrC,IAAIqI;AAAA,QACJ,OAAO2B;AAAAA,QACP,OAAO;AAAA,MACf,GAASJ,CAAI,CAAC;AAAA,aACClJ,EAAO,WAAW;AAC3B,YAAMyC,KAAS+B,IAAM+E,EAAUvJ,CAAM,MAAM,OAAOwE,IAAM,CAAA;AACxD,MAAApF,EAAI,QAAQ,CAACoK,MAAM;AACjB,eAAO/G,EAAM+G,CAAC;AAAA,MAChB,CAAC,GACDxJ,EAAO,QAAQyC,GACfwG,KAAgBjJ,EAAO,SAAQ;AAAA,IACjC;AAAA;AAEJ,GAQIyJ,KAAqB,CAACzJ,GAAQqB,GAAMpB,MAAY;AAClD,EAAAyJ,EAAmB1J,GAAQ,MAAM;AAC/B,eAAW,CAAA,EAAG+B,CAAS,KAAK4H,GAAgB3J,GAAQqB,GAAM;AAAA,MACxD,SAAS;AAAA,IACf,CAAK;AACC,MAAAuI,GAAY5J,GAAQN,EAAcJ,EAAe,CAAA,GAAIW,CAAO,GAAG,EAAE,IAAI8B,EAAS,CAAE,CAAC;AAAA,EAErF,CAAC;AACH,GAoCI8H,KAAsB,CAAC7J,GAAQ,EAAE,IAAAE,GAAI,eAAA4J,GAAe,OAAA7B,GAAO,eAAA8B,QAAoB;AACjFC,EAAAA,EAAoBhK,GAAQ,MAAM;AAChC,IAAAyJ,GAAmBzJ,GAAQE,GAAI6J,CAAa,GAC5CE,EAAajK,GAAQiI,GAAOvI,EAAcJ,EAAe,CAAA,GAAIwK,CAAa,GAAG;AAAA,MAC3E,IAAI5J,EAAG,OAAO,CAAC,CAAC,CAAC;AAAA,IACvB,CAAK,CAAC;AAAA,EACJ,CAAC;AACH,GA+BIgK,KAAa,CAAClK,GAAQ,EAAE,OAAAmK,GAAO,KAAA/K,EAAG,MAAO;AAC3C,EAAKY,EAAO,aAEZoK,EAAoBpK,GAAQ,MAAM;AAEhC,QADiBqH,GAAarH,GAAQZ,CAAG,GAC3B;AACZ,MAAAY,EAAO,WAAWZ,CAAG;AACrB;AAAA,IACF;AACA,QAAI+K,GAAO;AACT,YAAME,IAASC,EAAWH,CAAK;AAC/B,MAAAnB,GAAWhJ,GAAQ,EAAE,KAAKqK,EAAM,CAAE;AAAA,IACpC;AACA,IAAArK,EAAO,QAAQZ,GAAK,EAAI;AAAA,EAC1B,CAAC;AACH;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@udecode_slate@31.0.0_slate-history@0.100.0_slate@0.102.0__slate@0.102.0/node_modules/@udecode/slate/dist/index.es.js

@@ -1,176 +0,0 @@
-import { Range as h, Editor as a, Transforms as i, Node as c, withoutNormalizing as k, Element as A, Text as z, removeNodes as S, Path as T } from "../../../../../slate@0.102.0/node_modules/slate/dist/index.es.es.js";
-import { HistoryEditor as j } from "../../../../../slate-history@0.100.0_slate@0.102.0/node_modules/slate-history/dist/index.es.es.js";
-var B = Object.defineProperty, R = Object.defineProperties, I = Object.getOwnPropertyDescriptors, u = Object.getOwnPropertySymbols, P = Object.prototype.hasOwnProperty, _ = Object.prototype.propertyIsEnumerable, p = (r, e, t) => e in r ? B(r, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[e] = t, E = (r, e) => {
-  for (var t in e || (e = {}))
-    P.call(e, t) && p(r, t, e[t]);
-  if (u)
-    for (var t of u(e))
-      _.call(e, t) && p(r, t, e[t]);
-  return r;
-}, C = (r, e) => R(r, I(e)), M = (r, e) => {
-  var t = {};
-  for (var n in r)
-    P.call(r, n) && e.indexOf(n) < 0 && (t[n] = r[n]);
-  if (r != null && u)
-    for (var n of u(r))
-      e.indexOf(n) < 0 && _.call(r, n) && (t[n] = r[n]);
-  return t;
-}, w = (r) => A.isElement(r), q = (r, e) => w(e) && a.isBlock(r, e);
-function D(r) {
-  return Array.isArray(r) ? r : [r];
-}
-var H = (r, e, t) => t ? typeof t == "object" ? Object.entries(t).every(([n, s]) => D(s).includes(r[n])) : t(r, e) : !0, g = (r, e = {}) => {
-  const { match: t, block: n } = e;
-  return C(E({}, e), {
-    match: t || n ? (s, l) => H(s, l, t) && (!n || q(r, s)) : void 0
-  });
-}, y = (r, e) => a.above(r, g(r, e)), O = (r, e, t = {}) => {
-  const { voids: n, unhang: s = !0 } = t;
-  return h.isRange(e) && s ? a.unhangRange(r, e, { voids: n }) : e;
-}, $ = (r, e) => (O(r, e == null ? void 0 : e.at, e), a.nodes(r, g(r, e))), Y = (r, e, t) => {
-  try {
-    return a.parent(r, e, t);
-  } catch {
-  }
-}, Z = (r, e) => a.previous(r, e), rr = (r, e) => {
-  let t = !1;
-  return a.withoutNormalizing(r, () => {
-    t = !!e();
-  }), t;
-}, Q = (r) => z.isText(r), er = (r, e) => {
-  i.delete(r, e);
-}, tr = (r, e) => i.removeNodes(r, e), nr = (r, e) => {
-  i.select(r, e);
-}, V = (r, e) => a.end(r, e), ar = (r, e, t) => a.before(r, e, t), sr = (r, e) => a.start(r, e), or = (r, e, t) => {
-  if (!e)
-    return "";
-  try {
-    return a.string(r, e, t);
-  } catch {
-    return "";
-  }
-}, ir = (r) => a.marks(r), lr = (r, e) => a.next(r, e), vr = (r, e, t) => !!e && a.isEnd(r, e, t), F = (r, e) => w(e) && a.isInline(r, e), fr = (r, e, t) => !!e && a.isStart(r, e, t), cr = (r, e) => a.normalize(r, e), dr = (r, e) => j.withoutMerging(r, e), ur = (r, e) => {
-  try {
-    for (let t = 0; t < e.length; t++) {
-      const n = e[t];
-      if (Q(r) || !r.children[n])
-        return null;
-      r = r.children[n];
-    }
-    return r;
-  } catch {
-    return null;
-  }
-}, gr = (r, e, t) => c.ancestors(r, e, t), Nr = (r, e, t) => c.children(r, e, t), mr = (r, e) => c.leaf(r, e), hr = (r) => c.extractProps(r), G = (r) => c.string(r), pr = (r) => c.isNode(r), yr = (r) => !!r && h.isCollapsed(r), Pr = (r) => !!r && h.isExpanded(r), _r = (r) => {
-  i.deselect(r);
-};
-function m(r) {
-  return Array.isArray(r) ? r : [r];
-}
-var J = (r, { filter: e, allow: t, exclude: n, level: s, maxLevel: l } = {}) => {
-  if (!r)
-    return !1;
-  const [f, v] = r;
-  if (s && !m(s).includes(v.length) || l && v.length > l || e && !e(r))
-    return !1;
-  if (t) {
-    const o = m(t);
-    if (o.length > 0 && !o.includes(f.type))
-      return !1;
-  }
-  if (n) {
-    const o = m(n);
-    if (o.length > 0 && o.includes(f.type))
-      return !1;
-  }
-  return !0;
-}, Er = (r, e, t = {}) => {
-  var n = t, { nextBlock: s, removeEmpty: l } = n, f = M(n, ["nextBlock", "removeEmpty"]);
-  k(r, () => {
-    if (l) {
-      const v = y(r, { at: f.at });
-      if (v) {
-        const o = l === !0 ? {
-          allow: ["p"]
-        } : l, { filter: d } = o;
-        o.filter = ([N, x]) => G(N) || N.children.some((b) => F(r, b)) ? !1 : !d || d([N, x]), J(v, o) && (S(r, { at: v[1] }), s = !1);
-      }
-    }
-    if (s) {
-      const { at: v = r.selection } = f;
-      if (v) {
-        const o = V(r, v), d = y(r, {
-          at: o,
-          block: !0
-        });
-        d && (f.at = T.next(d[1]));
-      }
-    }
-    i.insertNodes(r, e, f);
-  });
-}, wr = (r, e, t) => {
-  i.insertText(r, e, t);
-}, K = (r, e, t) => i.setNodes(r, e, t), Or = (r, e) => i.splitNodes(r, e), xr = (r, e, t) => i.unsetNodes(r, e, t), br = (r, e) => {
-  i.unwrapNodes(r, g(r, e));
-}, kr = (r, e, t) => {
-  O(r, t == null ? void 0 : t.at, t), i.wrapNodes(r, e, t);
-}, L = (r, e = {}) => {
-  try {
-    const t = $(r, E({
-      at: r.selection || []
-    }, g(r, e)));
-    for (const [n, s] of t)
-      return [n, s];
-  } catch {
-    return;
-  }
-}, Ar = (r, e) => !!L(r, e), zr = (r, e, t) => K(r, e, t);
-export {
-  er as deleteText,
-  _r as deselect,
-  L as findNode,
-  y as getAboveNode,
-  or as getEditorString,
-  V as getEndPoint,
-  ir as getMarks,
-  lr as getNextNode,
-  ur as getNode,
-  gr as getNodeAncestors,
-  Nr as getNodeChildren,
-  $ as getNodeEntries,
-  mr as getNodeLeaf,
-  hr as getNodeProps,
-  G as getNodeString,
-  Y as getParentNode,
-  ar as getPointBefore,
-  Z as getPreviousNode,
-  g as getQueryOptions,
-  sr as getStartPoint,
-  Er as insertNodes,
-  wr as insertText,
-  q as isBlock,
-  yr as isCollapsed,
-  w as isElement,
-  vr as isEndPoint,
-  Pr as isExpanded,
-  F as isInline,
-  pr as isNode,
-  fr as isStartPoint,
-  Q as isText,
-  H as match,
-  cr as normalizeEditor,
-  J as queryNode,
-  tr as removeNodes,
-  nr as select,
-  zr as setElements,
-  K as setNodes,
-  Ar as someNode,
-  Or as splitNodes,
-  O as unhangRange,
-  xr as unsetNodes,
-  br as unwrapNodes,
-  dr as withoutMergingHistory,
-  rr as withoutNormalizing,
-  kr as wrapNodes
-};
-//# sourceMappingURL=index.es.js.map