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

package/dist/node_modules/.pnpm/@udecode_plate-list@31.1.3_@udecode_plate-common@36.5.9_@types_react@18.3.27_immer@10.1_375468742cb8a1ec080124e2804dd917/node_modules/@udecode/plate-list/dist/index.es.js

@@ -1,1199 +0,0 @@
-import Kt from "../../../../../lodash@4.17.21/node_modules/lodash/castArray.es.js";
-import { Path as L, Range as z } from "../../../../../slate@0.102.0/node_modules/slate/dist/index.es.es.js";
-import { onKeyDownResetNode as xt, SIMULATE_BACKSPACE as Tt } from "../../../../../@udecode_plate-reset-node@31.0.0_@udecode_plate-common@36.5.9_@types_react@18.3.27_imme_714b9acfe590db8ee3c973b29012c335/node_modules/@udecode/plate-reset-node/dist/index.es.js";
-import { getBlockAbove as it, isBlockAboveEmpty as Lt, isSelectionAtBlockStart as vt, isFirstChild as jt, isSelectionAtBlockEnd as Vt, insertElements as x, getChildren as D, getPreviousPath as _t, isBlockTextEmptyAfterSelection as Wt, isRangeAcrossBlocks as kt, findDescendant as lt, getLastChildPath as At, moveChildren as Ct, insertEmptyElement as qt, isLastChild as gt } from "../../../../../@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";
-import { withoutNormalizing as S, setElements as B, unwrapNodes as Pt, getAboveNode as A, getCommonNode as ot, isElement as U, getPointBefore as Yt, getNodeEntries as W, deleteMerge as ut, getNodeEntry as R, removeNodes as C, getEndPoint as Zt, createPathRef as J, getParentNode as b, findNode as G, wrapNodes as M, match as q, getNode as T, someNode as st, isCollapsed as nt, deleteText as ft, isStartPoint as Gt, getMarks as Jt, select as ct, splitNodes as Qt, moveNodes as K, collapseSelection as Xt, isExpanded as $t, getPointAfter as at, getEditorString as dt, getStartPoint as te, getNodeString as ee, isBlock as et, getNodeTexts as se, getNodes as ne, unhangRange as le } 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 { createPluginFactory as ce, getPluginType as m, ELEMENT_DEFAULT as X, mockPlugin as Bt, getPlugin as ae, useEditorSelector as re, useEditorRef as ie, getPluginOptions as oe, KEY_DESERIALIZE_HTML as ue, Hotkeys as It } from "../../../../../@udecode_plate-core@36.5.9_@types_react@18.3.27_immer@10.1.3_react-dom@18.3.1_react@18._c9509afa110721f0311786c7b385e3f0/node_modules/@udecode/plate-core/dist/index.es.js";
-import { isHotkey as fe } from "../../../../../is-hotkey@0.2.0/node_modules/is-hotkey/lib/index.es.js";
-var he = Object.defineProperty, pe = Object.defineProperties, me = Object.getOwnPropertyDescriptors, Et = Object.getOwnPropertySymbols, ye = Object.prototype.hasOwnProperty, Le = Object.prototype.propertyIsEnumerable, Nt = (t, e, s) => e in t ? he(t, e, { enumerable: !0, configurable: !0, writable: !0, value: s }) : t[e] = s, H = (t, e) => {
-  for (var s in e || (e = {}))
-    ye.call(e, s) && Nt(t, s, e[s]);
-  if (Et)
-    for (var s of Et(e))
-      Le.call(e, s) && Nt(t, s, e[s]);
-  return t;
-}, Rt = (t, e) => pe(t, me(e)), ht = (t, e) => {
-  var s;
-  const n = (s = b(t, e)) == null ? void 0 : s[0];
-  return (n == null ? void 0 : n.type) === m(t, v);
-}, ve = (t) => m(t, Z), ge = (t) => m(t, d), I = (t) => [ge(t), ve(t)], Pe = (t) => m(t, v), Ie = (t) => m(t, E), Ot = (t, {
-  diffListPath: e,
-  liPath: s
-}) => {
-  const n = A(t, {
-    at: s,
-    match: { type: I(t) }
-  });
-  if (!n)
-    return;
-  const [a, r] = n;
-  if (!e || !L.equals(r, e)) {
-    if (a.children.length < 2) {
-      const c = A(t, {
-        at: r,
-        match: { type: m(t, v) }
-      });
-      if (c)
-        return Ot(t, { liPath: c[1], diffListPath: e }) || r;
-    }
-    return s;
-  }
-}, j = (t, { at: e = t.selection } = {}) => {
-  const s = m(t, v);
-  let n;
-  if (z.isRange(e) && !nt(e) ? n = e.focus.path : z.isRange(e) ? n = e.anchor.path : n = e, n && T(t, n)) {
-    const r = A(t, {
-      at: n,
-      match: { type: s }
-    });
-    if (r)
-      return { list: b(t, r[1]), listItem: r };
-  }
-}, Ft = (t, e = t.selection) => {
-  var s;
-  if (!e)
-    return;
-  const n = A(t, {
-    at: e,
-    match: {
-      type: [
-        m(t, Z),
-        m(t, d)
-      ]
-    }
-  });
-  if (n) {
-    const [, a] = n;
-    return (s = Ft(t, a)) != null ? s : n;
-  }
-}, Y = (t, e) => e.children.some((s) => q(s, [], { type: I(t) })), pt = (t) => {
-  const { selection: e } = t;
-  return !e || nt(e) || !kt(t) ? !1 : st(t, {
-    match: { type: m(t, v) }
-  });
-}, k = (t, e) => U(e) && I(t).includes(e.type), Ee = (t, { list: e, listItem: s }) => {
-  let n = !1;
-  const [a] = e, [, r] = s;
-  let c;
-  try {
-    c = L.previous(r);
-  } catch {
-    return;
-  }
-  const u = R(
-    t,
-    c
-  );
-  if (u) {
-    const [p, o] = u, i = p.children.find(
-      (f) => q(f, [], { type: I(t) })
-    ), l = o.concat(
-      i ? [1, i.children.length] : [1]
-    );
-    S(t, () => {
-      i || M(
-        t,
-        { type: a.type, children: [] },
-        { at: r }
-      ), K(t, {
-        at: r,
-        to: l
-      }), n = !0;
-    });
-  }
-  return n;
-}, V = (t, {
-  fromList: e,
-  fromListItem: s,
-  fromStartIndex: n,
-  to: a,
-  toList: r,
-  toListIndex: c = null,
-  deleteFromList: u = !0
-}) => {
-  let p, o;
-  return S(t, () => {
-    if (s) {
-      const l = lt(t, {
-        at: s[1],
-        match: {
-          type: I(t)
-        }
-      });
-      if (!l)
-        return;
-      p = l == null ? void 0 : l[1];
-    } else if (e)
-      p = e[1];
-    else
-      return;
-    let i = null;
-    if (a && (i = a), r)
-      if (c === null) {
-        const l = At(r);
-        i = L.next(l);
-      } else
-        i = r[1].concat([c]);
-    i && (o = Ct(t, {
-      at: p,
-      to: i,
-      fromStartIndex: n
-    }), u && ft(t, { at: p }));
-  }), o;
-}, Q = (t, { at: e } = {}) => {
-  const s = () => {
-    if (A(t, { match: { type: I(t), at: e } }))
-      return !0;
-    if (!e && t.selection) {
-      const n = ot(
-        t,
-        t.selection.anchor.path,
-        t.selection.focus.path
-      );
-      if (U(n[0]) && I(t).includes(n[0].type))
-        return !0;
-    }
-    return !1;
-  };
-  S(t, () => {
-    do
-      it(t, {
-        at: e,
-        match: { type: m(t, E) }
-      }) && B(t, {
-        at: e,
-        type: m(t, X)
-      }), Pt(t, {
-        at: e,
-        match: { type: m(t, v) },
-        split: !0
-      }), Pt(t, {
-        at: e,
-        match: {
-          type: [
-            m(t, Z),
-            m(t, d)
-          ]
-        },
-        split: !0
-      });
-    while (s());
-  });
-}, $ = (t, { list: e, listItem: s }) => {
-  const n = () => {
-    const [r, c] = e, [u, p] = s, o = A(t, {
-      at: c,
-      match: { type: m(t, v) }
-    });
-    if (!o) {
-      let h;
-      try {
-        h = L.next(c);
-      } catch {
-        return;
-      }
-      const y = Y(t, u), g = !gt(e, p);
-      if ((y || g) && x(
-        t,
-        {
-          type: r.type,
-          children: []
-        },
-        { at: h }
-      ), y) {
-        const P = T(t, h);
-        if (!P)
-          return;
-        V(t, {
-          fromListItem: s,
-          toList: [P, h]
-        });
-      }
-      if (g) {
-        const P = T(t, h);
-        if (!P)
-          return;
-        V(t, {
-          fromList: e,
-          fromStartIndex: p.at(-1) + 1,
-          toList: [P, h],
-          deleteFromList: !1
-        });
-      }
-      return Q(t, { at: p.concat(0) }), !0;
-    }
-    const [, i] = o, l = p.concat([1]);
-    if (!gt(e, p)) {
-      Y(t, u) || x(
-        t,
-        {
-          type: r.type,
-          children: []
-        },
-        { at: l }
-      );
-      const h = T(t, l);
-      if (!h)
-        return;
-      V(t, {
-        fromListItem: o,
-        toList: [h, l],
-        fromStartIndex: p.at(-1) + 1,
-        deleteFromList: !1
-      });
-    }
-    const f = L.next(i);
-    return K(t, {
-      at: p,
-      to: f
-    }), !0;
-  };
-  let a = !1;
-  return S(t, () => {
-    a = n();
-  }), a;
-}, mt = (t, {
-  list: e,
-  listItem: s
-}) => {
-  const [, n] = e;
-  return ht(t, n) ? !1 : ($(t, { list: e, listItem: s }), !0);
-}, Ne = (t, {
-  increase: e = !0,
-  at: s = ((a) => (a = t.selection) != null ? a : void 0)(),
-  enableResetOnShiftTab: n
-} = {}) => {
-  const a = W(t, {
-    at: s,
-    match: {
-      type: m(t, E)
-    }
-  }), r = Array.from(a);
-  if (r.length === 0)
-    return;
-  const c = [], u = [];
-  r.forEach((o) => {
-    const i = o[1], l = L.parent(i);
-    c.some((h) => {
-      const y = L.parent(h);
-      return L.isAncestor(y, l);
-    }) || (c.push(i), u.push(J(t, i)));
-  });
-  const p = e ? u : u.reverse();
-  return S(t, () => {
-    let o = !1;
-    return p.forEach((i) => {
-      const l = i.unref();
-      if (!l)
-        return;
-      const f = b(t, l);
-      if (!f)
-        return;
-      const h = b(t, f[1]);
-      if (!h)
-        return;
-      let y;
-      e ? y = Ee(t, {
-        list: h,
-        listItem: f
-      }) : ht(t, h[1]) ? y = $(t, {
-        list: h,
-        listItem: f
-      }) : n && (y = mt(t, {
-        list: h,
-        listItem: f
-      })), o = y || o;
-    }), o;
-  });
-}, we = (t) => {
-  const e = m(t, v), s = m(t, E);
-  if (!t.selection)
-    return !1;
-  const n = A(t, { match: { type: s } });
-  if (!n)
-    return !1;
-  const [, a] = n, r = b(t, a);
-  if (!r)
-    return !1;
-  const [c, u] = r;
-  if (c.type !== e)
-    return !1;
-  let p = !1;
-  return S(t, () => {
-    z.isCollapsed(t.selection) || ft(t);
-    const o = Gt(
-      t,
-      t.selection.focus,
-      a
-    ), i = Wt(t), l = L.next(a), f = L.next(u);
-    if (o) {
-      x(
-        t,
-        {
-          type: e,
-          children: [{ type: s, children: [{ text: "" }] }]
-        },
-        { at: u }
-      ), p = !0;
-      return;
-    }
-    if (i) {
-      const h = Jt(t) || {};
-      x(
-        t,
-        {
-          type: e,
-          children: [{ type: s, children: [H({ text: "" }, h)] }]
-        },
-        { at: f }
-      ), ct(t, f);
-    } else
-      S(t, () => {
-        Qt(t), M(
-          t,
-          {
-            type: e,
-            children: []
-          },
-          { at: l }
-        ), K(t, {
-          at: l,
-          to: f
-        }), ct(t, f), Xt(t, {
-          edge: "start"
-        });
-      });
-    c.children.length > 1 && K(t, {
-      at: l,
-      to: f.concat(1)
-    }), p = !0;
-  }), p;
-}, wt = (t, {
-  fromListItem: e,
-  toListItem: s,
-  start: n
-}) => {
-  const [, a] = e, [, r] = s;
-  let c = 0;
-  return S(t, () => {
-    const u = lt(t, {
-      at: a,
-      match: {
-        type: I(t)
-      }
-    });
-    if (!u)
-      return;
-    const [, p] = u, o = lt(t, {
-      at: r,
-      match: {
-        type: I(t)
-      }
-    });
-    let i;
-    if (o)
-      if (n) {
-        const [, l] = o;
-        i = l.concat([0]);
-      } else
-        i = L.next(At(o));
-    else {
-      const l = b(t, a);
-      if (!l)
-        return;
-      const [f] = l, h = f.type, y = r.concat([1]);
-      x(
-        t,
-        { type: h, children: [] },
-        { at: y }
-      ), i = y.concat([0]);
-    }
-    c = Ct(t, {
-      at: p,
-      to: i
-    }), ft(t, { at: p });
-  }), c;
-}, rt = (t, { list: e, listItem: s, reverse: n = !0 }) => {
-  const [a, r] = s;
-  if ($t(t.selection) || !Y(t, a))
-    return !1;
-  const c = _t(r);
-  let u = !1;
-  return S(t, () => {
-    if (c) {
-      const p = R(t, c);
-      if (!p)
-        return;
-      let o = L.next(r);
-      x(
-        t,
-        {
-          type: m(t, v),
-          children: [
-            {
-              type: m(t, E),
-              children: [{ text: "" }]
-            }
-          ]
-        },
-        { at: o }
-      );
-      const i = R(t, o);
-      if (!i)
-        return;
-      const l = J(t, i[1]);
-      wt(t, {
-        fromListItem: s,
-        toListItem: i
-      }), ut(t, {
-        reverse: n
-      }), o = l.unref(), wt(t, {
-        fromListItem: [i[0], o],
-        toListItem: p
-      }), C(t, { at: o }), u = !0;
-      return;
-    }
-    V(t, {
-      fromListItem: s,
-      toList: e,
-      toListIndex: 1
-    });
-  }), u;
-}, Dt = (t, { type: e, pluginKey: s = e }) => S(t, () => {
-  if (!t.selection)
-    return;
-  const { validLiChildrenTypes: n } = oe(
-    t,
-    s
-  );
-  if (nt(t.selection) || !kt(t)) {
-    const a = j(t);
-    if (a) {
-      const { list: r } = a;
-      r[0].type === e ? Q(t) : B(
-        t,
-        { type: e },
-        {
-          at: t.selection,
-          match: (c) => U(c) && I(t).includes(c.type),
-          mode: "lowest"
-        }
-      );
-    } else {
-      M(t, { type: e, children: [] });
-      const c = W(t, {
-        match: { type: m(t, X) }
-      }), u = Array.from(c);
-      it(t, {
-        match: { type: n }
-      }) || B(t, {
-        type: m(t, E)
-      });
-      const o = {
-        type: m(t, v),
-        children: []
-      };
-      for (const [, i] of u)
-        M(t, o, {
-          at: i
-        });
-    }
-  } else {
-    const [a, r] = z.edges(t.selection), c = ot(
-      t,
-      a.path,
-      r.path
-    );
-    if (I(t).includes(c[0].type) || c[0].type === m(t, v))
-      if (c[0].type === e)
-        Q(t);
-      else {
-        const u = G(t, {
-          at: z.start(t.selection),
-          match: { type: I(t) },
-          mode: "lowest"
-        }), p = G(t, {
-          at: z.end(t.selection),
-          match: { type: I(t) },
-          mode: "lowest"
-        }), o = Math.min(
-          u[1].length,
-          p[1].length
-        );
-        B(
-          t,
-          { type: e },
-          {
-            at: t.selection,
-            match: (i, l) => U(i) && I(t).includes(i.type) && l.length >= o,
-            mode: "all"
-          }
-        );
-      }
-    else {
-      const u = c[1].length, p = W(t, {
-        mode: "all"
-      });
-      Array.from(p).filter(
-        ([, i]) => i.length === u + 1
-      ).forEach((i) => {
-        if (I(t).includes(i[0].type))
-          B(
-            t,
-            { type: e },
-            {
-              at: i[1],
-              match: (l) => U(l) && I(t).includes(l.type),
-              mode: "all"
-            }
-          );
-        else {
-          n != null && n.includes(i[0].type) || B(
-            t,
-            { type: m(t, E) },
-            { at: i[1] }
-          );
-          const l = {
-            type: m(t, v),
-            children: []
-          };
-          M(t, l, {
-            at: i[1]
-          }), M(t, { type: e, children: [] }, { at: i[1] });
-        }
-      });
-    }
-  }
-}), St = (t, {
-  type: e,
-  options: { hotkey: s, enableResetOnShiftTab: n }
-}) => (a) => {
-  if (a.defaultPrevented)
-    return;
-  const r = It.isTab(t, a), c = It.isUntab(t, a);
-  let u = t.selection;
-  if (t.selection && (r || c)) {
-    const { selection: o } = t;
-    if (!nt(t.selection)) {
-      const { anchor: l, focus: f } = z.isBackward(o) ? { anchor: H({}, o.focus), focus: H({}, o.anchor) } : { anchor: H({}, o.anchor), focus: H({}, o.focus) }, h = le(t, { anchor: l, focus: f });
-      h && (u = h, ct(t, h));
-    }
-    const i = st(t, {
-      match: { type: m(t, v) }
-    });
-    if (u && i)
-      return a.preventDefault(), Ne(t, {
-        at: u,
-        increase: r,
-        enableResetOnShiftTab: n
-      }), !0;
-  }
-  if (!s)
-    return;
-  const p = Kt(s);
-  for (const o of p)
-    fe(o)(a) && Dt(t, { type: e });
-}, Se = (t, e) => {
-  const s = j(t, {});
-  let n = !1;
-  if (s) {
-    const { list: a, listItem: r } = s;
-    vt(t, {
-      match: (c) => c.type === m(t, v)
-    }) && S(t, () => {
-      if (n = mt(t, { list: a, listItem: r }), n || (n = rt(t, { list: a, listItem: r }), n))
-        return !0;
-      if (jt(r[1]) && !ht(t, a[1])) {
-        xt(
-          t,
-          Bt({
-            options: {
-              rules: [
-                {
-                  types: [m(t, v)],
-                  defaultType: m(t, X),
-                  hotkey: "backspace",
-                  predicate: () => vt(t),
-                  onReset: (i) => Q(i)
-                }
-              ]
-            }
-          })
-        )(Tt), n = !0;
-        return;
-      }
-      const c = Yt(
-        t,
-        t.selection.focus
-      );
-      let u, p = !1;
-      if (c && pt(Rt(H({}, t), {
-        selection: {
-          anchor: t.selection.anchor,
-          focus: c
-        }
-      }))) {
-        const i = m(t, E);
-        u = [...W(t, {
-          at: r[1],
-          mode: "lowest",
-          match: (f) => f.type === i
-        })][0], p = u[0].children.length > 1;
-      }
-      if (ut(t, {
-        unit: e,
-        reverse: !0
-      }), n = !0, !u || !p)
-        return;
-      const o = R(
-        t,
-        L.parent(u[1])
-      );
-      o && o[0].children.length === 0 && C(t, { at: o[1] });
-    });
-  }
-  return n;
-}, be = (t) => {
-  const e = at(
-    t,
-    t.selection.focus.path
-  );
-  if (e) {
-    const s = j(t, {
-      at: e
-    });
-    if (s) {
-      const { listItem: n } = s, a = it(t, {
-        at: t.selection.anchor
-      });
-      if (!dt(t, a[1]))
-        return C(t), !0;
-      if (Y(t, n[0])) {
-        const r = j(t, {
-          at: [...n[1], 1, 0, 0]
-        });
-        $(t, r);
-      }
-    }
-  }
-  return !1;
-}, xe = (t, e, s, n) => {
-  const { listItem: a } = e;
-  if (!Y(t, a[0])) {
-    const u = m(t, v), p = W(t, {
-      at: a[1],
-      mode: "lowest",
-      match: (N, w) => {
-        var _;
-        if (w.length === 0)
-          return !1;
-        const O = N.type === u, F = ((_ = T(t, L.next(w))) == null ? void 0 : _.type) === u;
-        return O && F;
-      }
-    }), o = Array.from(p, (N) => N[1])[0];
-    if (!o) {
-      const N = at(t, a[1]);
-      if (N) {
-        const w = j(t, {
-          at: N
-        });
-        if (w) {
-          const _ = Ft(t, a[1]);
-          return V(t, {
-            fromList: w.list,
-            toList: _,
-            deleteFromList: !0
-          }), !0;
-        }
-      }
-      return !1;
-    }
-    const i = R(
-      t,
-      L.next(o)
-    );
-    if (!i)
-      return !1;
-    const l = b(t, i[1]);
-    if (l && rt(t, {
-      list: l,
-      listItem: i,
-      reverse: !1
-    }))
-      return !0;
-    const f = at(t, t.selection.focus);
-    if (!f || !pt(Rt(H({}, t), {
-      selection: {
-        anchor: t.selection.anchor,
-        focus: f
-      }
-    })))
-      return !1;
-    const h = m(t, E), g = [...W(t, {
-      at: f.path,
-      mode: "lowest",
-      match: (N) => N.type === h
-    })][0];
-    if (g[0].children.length < 2)
-      return !1;
-    s(n);
-    const P = R(
-      t,
-      L.parent(g[1])
-    );
-    return P && P[0].children.length === 0 && C(t, { at: P[1] }), !0;
-  }
-  const r = R(
-    t,
-    L.next([...a[1], 0])
-  );
-  if (!r)
-    return !1;
-  const c = D(r)[0];
-  return !!(mt(t, {
-    list: r,
-    listItem: c
-  }) || rt(t, {
-    list: r,
-    listItem: c
-  }));
-}, Te = (t, e, s) => {
-  let n = !1;
-  return !(t != null && t.selection) || !Vt(t) || S(t, () => {
-    const a = j(t, {});
-    if (!a) {
-      n = be(t);
-      return;
-    }
-    n = xe(
-      t,
-      a,
-      e,
-      s
-    );
-  }), n;
-}, bt = (t) => {
-  const e = te(t, t.selection);
-  return A(t, {
-    at: e,
-    match: { type: m(t, v) }
-  });
-}, _e = (t) => {
-  let e = !1;
-  return S(t, () => {
-    if (!pt(t))
-      return;
-    const s = Zt(t, t.selection), n = A(t, {
-      at: s,
-      match: { type: m(t, v) }
-    }), r = n && !Y(t, n[0]) ? J(t, n[1]) : void 0;
-    if (!bt(t) || !n) {
-      e = !1;
-      return;
-    }
-    ut(t);
-    const c = bt(t);
-    if (r) {
-      const u = r.unref(), p = c && b(t, c[1]), o = Ot(t, {
-        liPath: u,
-        diffListPath: p == null ? void 0 : p[1]
-      });
-      o && C(t, { at: o }), e = !0;
-    }
-  }), e;
-}, ke = (t) => {
-  if (!t.selection)
-    return;
-  const e = j(t, {});
-  let s;
-  if (e) {
-    const { list: a, listItem: r } = e;
-    if (Lt(t) && (s = $(t, {
-      list: a,
-      listItem: r
-    }), s))
-      return !0;
-  }
-  if (xt(
-    t,
-    Bt({
-      options: {
-        rules: [
-          {
-            types: [m(t, v)],
-            defaultType: m(t, X),
-            predicate: () => !s && Lt(t),
-            onReset: (a) => Q(a)
-          }
-        ]
-      }
-    })
-  )(Tt) || !s && we(t))
-    return !0;
-}, Ae = (t) => {
-  const { insertFragment: e } = t, s = ae(t, v), n = Pe(t), a = Ie(t), r = (l, f, { type: h }) => {
-    let y = L.parent(f[1]);
-    for (; T(l, y).type !== h; )
-      y = L.parent(y);
-    return [T(l, y), y];
-  }, c = (l) => {
-    let f = null, h = l;
-    for (; k(t, h) || h.type === n && h.children[0].type !== a; )
-      f = h, [h] = h.children;
-    return f ? f.children : [h];
-  }, u = (l) => {
-    if (!k(t, l))
-      return [l];
-    const f = se(l), h = Array.from(f), y = h.reduce(
-      (N, w) => L.isAncestor(N[1], w[1]) ? N : ot(l, w[1], N[1]),
-      // any list item would do, we grab the first one
-      r(l, h[0], s)
-    ), [g, ...P] = k(
-      t,
-      y[0]
-    ) ? y[0].children : [y[0]];
-    return [...c(g), ...P];
-  }, p = (l) => l.type === n ? l : {
-    type: n,
-    children: [l]
-  }, o = (l) => l.length === 1 && k(t, l[0]) && [...ne({ children: l })].filter((h) => U(h[0])).filter(([h]) => h.type === a).length === 1, i = (l, f, h) => {
-    const [, y] = f, [g, P] = h, N = !ee(g), [w, ..._] = l.flatMap(u).map(p);
-    let O, F;
-    if (k(t, l[0]))
-      if (o(l))
-        O = w, F = _;
-      else if (N) {
-        const Ht = T(t, y), [, ...yt] = Ht.children, [zt, ...tt] = w.children;
-        if (x(t, zt, {
-          at: L.next(P),
-          select: !0
-        }), C(t, {
-          at: P
-        }), tt != null && tt.length)
-          if (yt != null && yt.length) {
-            const Ut = [...y, 1, 0];
-            x(t, tt[0].children, {
-              at: Ut,
-              select: !0
-            });
-          } else
-            x(t, tt, {
-              at: L.next(P),
-              select: !0
-            });
-        O = { text: "" }, F = _;
-      } else
-        O = { text: "" }, F = [w, ..._];
-    else
-      O = w, F = _;
-    return { textNode: O, listItemNodes: F };
-  };
-  return (l) => {
-    let f = G(t, {
-      match: { type: n },
-      mode: "lowest"
-    });
-    if (!f)
-      return e(
-        k(t, l[0]) ? [{ text: "" }, ...l] : l
-      );
-    if (e([{ text: "" }]), f = G(t, {
-      match: { type: n },
-      mode: "lowest"
-    }), !f)
-      return e(
-        k(t, l[0]) ? [{ text: "" }, ...l] : l
-      );
-    const h = G(t, {
-      match: { type: a },
-      mode: "lowest"
-    });
-    if (!h)
-      return e(
-        k(t, l[0]) ? [{ text: "" }, ...l] : l
-      );
-    const { textNode: y, listItemNodes: g } = i(
-      l,
-      f,
-      h
-    );
-    e([y]);
-    const [, P] = f;
-    return x(t, g, {
-      at: L.next(P),
-      select: !0
-    });
-  };
-}, Mt = (t, {
-  children: e
-}) => {
-  const s = [];
-  for (const n of e)
-    et(t, n[0]) ? s.push(
-      ...Mt(t, {
-        children: D(n)
-      })
-    ) : s.push(n);
-  return s;
-}, Ce = (t, {
-  listItem: e,
-  validLiChildrenTypes: s = []
-}) => {
-  let n = !1;
-  const a = /* @__PURE__ */ new Set([
-    m(t, Z),
-    m(t, d),
-    m(t, E),
-    ...s
-  ]), [, r] = e, c = D(e), u = c.filter(([f]) => !a.has(f.type)).map(([, f]) => J(t, f)), p = c[0], [o, i] = p ?? [];
-  if (!p || !et(t, o))
-    return qt(t, m(t, E), {
-      at: r.concat([0])
-    }), !0;
-  if (et(t, o) && !q(o, [], {
-    type: m(t, E)
-  })) {
-    if (q(o, [], {
-      type: I(t)
-    })) {
-      const f = b(t, e[1]), h = p;
-      return D(p).reverse().forEach((g) => {
-        $(t, {
-          list: h,
-          listItem: g
-        });
-      }), C(t, { at: [...f[1], 0] }), !0;
-    }
-    if (s.includes(o.type))
-      return !0;
-    B(
-      t,
-      {
-        type: m(t, E)
-      },
-      {
-        at: i
-      }
-    ), n = !0;
-  }
-  const l = D(p);
-  if (l.length > 0) {
-    const f = [], h = [];
-    for (const g of l) {
-      if (!et(t, g[0]))
-        break;
-      f.push(J(t, g[1])), h.push(
-        ...Mt(t, {
-          children: D(g)
-        })
-      );
-    }
-    const y = L.next(l.at(-1)[1]);
-    h.reverse().forEach(([, g]) => {
-      K(t, {
-        at: g,
-        to: y
-      });
-    }), f.forEach((g) => {
-      const P = g.unref();
-      P && C(t, {
-        at: P
-      });
-    }), f.length > 0 && (n = !0);
-  }
-  return n ? !0 : (u.reverse().forEach((f) => {
-    const h = f.unref();
-    h && K(t, {
-      at: h,
-      to: i.concat([0])
-    });
-  }), u.length > 0);
-}, Be = (t, { nestedListItem: e }) => {
-  const [, s] = e, n = b(t, s);
-  if (!(n && q(n[0], [], { type: I(t) })))
-    return !1;
-  let r;
-  try {
-    r = L.previous(s);
-  } catch {
-    return !1;
-  }
-  const c = R(
-    t,
-    r
-  );
-  if (c) {
-    const [, u] = c, p = u.concat([1]);
-    return K(t, {
-      at: s,
-      to: p
-    }), !0;
-  }
-}, Re = (t, { validLiChildrenTypes: e }) => {
-  const { normalizeNode: s } = t, n = m(t, v), a = m(t, E), r = m(t, X);
-  return ([c, u]) => {
-    var p;
-    if (!U(c))
-      return s([c, u]);
-    if (k(t, c)) {
-      const o = D([c, u]).find(
-        ([i]) => i.type !== n
-      );
-      if (o)
-        return M(
-          t,
-          { type: n, children: [] },
-          { at: o[1] }
-        );
-    }
-    if (q(c, [], { type: I(t) })) {
-      if (c.children.length === 0 || !c.children.some((h) => h.type === n))
-        return C(t, { at: u });
-      const o = L.next(u), i = T(t, o);
-      (i == null ? void 0 : i.type) === c.type && V(t, {
-        fromList: [i, o],
-        toList: [c, u],
-        deleteFromList: !0
-      });
-      const l = _t(u), f = T(t, l);
-      if ((f == null ? void 0 : f.type) === c.type) {
-        t.normalizeNode([f, l]);
-        return;
-      }
-      if (Be(t, { nestedListItem: [c, u] }))
-        return;
-    }
-    if (!(c.type === m(t, v) && Ce(t, {
-      listItem: [c, u],
-      validLiChildrenTypes: e
-    }))) {
-      if (c.type === a && a !== r && ((p = b(t, u)) == null ? void 0 : p[0].type) !== n) {
-        B(t, { type: r }, { at: u });
-        return;
-      }
-      s([c, u]);
-    }
-  };
-}, Oe = (t, { options: { validLiChildrenTypes: e } }) => {
-  const { insertBreak: s, deleteBackward: n, deleteForward: a, deleteFragment: r } = t;
-  return t.insertBreak = () => {
-    ke(t) || s();
-  }, t.deleteBackward = (c) => {
-    Se(t, c) || n(c);
-  }, t.deleteForward = (c) => {
-    Te(t, a, c) || a(c);
-  }, t.deleteFragment = (c) => {
-    _e(t) || r(c);
-  }, t.insertFragment = Ae(t), t.normalizeNode = Re(t, { validLiChildrenTypes: e }), t;
-}, Z = "ul", d = "ol", v = "li", E = "lic", je = ce({
-  key: "list",
-  plugins: [
-    {
-      key: Z,
-      isElement: !0,
-      handlers: {
-        onKeyDown: St
-      },
-      withOverrides: Oe,
-      deserializeHtml: {
-        rules: [
-          {
-            validNodeName: "UL"
-          }
-        ]
-      }
-    },
-    {
-      key: d,
-      isElement: !0,
-      handlers: {
-        onKeyDown: St
-      },
-      deserializeHtml: { rules: [{ validNodeName: "OL" }] }
-    },
-    {
-      key: v,
-      isElement: !0,
-      deserializeHtml: { rules: [{ validNodeName: "LI" }] },
-      then: (t, { type: e }) => ({
-        inject: {
-          pluginsByKey: {
-            [ue]: {
-              editor: {
-                insertData: {
-                  preInsert: () => st(t, { match: { type: e } })
-                }
-              }
-            }
-          }
-        }
-      })
-    },
-    {
-      key: E,
-      isElement: !0
-    }
-  ]
-}), Ve = ({ nodeType: t = Z } = {}) => ({
-  pressed: re(
-    (s) => !!s.selection && st(s, { match: { type: m(s, t) } }),
-    [t]
-  ),
-  nodeType: t
-}), We = (t) => {
-  const e = ie();
-  return {
-    props: {
-      pressed: t.pressed,
-      onMouseDown: (s) => {
-        s.preventDefault();
-      },
-      onClick: () => {
-        Dt(e, { type: t.nodeType });
-      }
-    }
-  };
-};
-export {
-  v as ELEMENT_LI,
-  E as ELEMENT_LIC,
-  d as ELEMENT_OL,
-  Z as ELEMENT_UL,
-  je as createListPlugin,
-  Se as deleteBackwardList,
-  Te as deleteForwardList,
-  _e as deleteFragmentList,
-  Mt as getDeepInlineChildren,
-  Ot as getHighestEmptyList,
-  Ie as getListItemContentType,
-  j as getListItemEntry,
-  Pe as getListItemType,
-  Ft as getListRoot,
-  I as getListTypes,
-  ge as getOrderedListType,
-  ve as getUnorderedListType,
-  Y as hasListChild,
-  ke as insertBreakList,
-  Ae as insertFragmentList,
-  we as insertListItem,
-  pt as isAcrossListItems,
-  ht as isListNested,
-  k as isListRoot,
-  Ee as moveListItemDown,
-  wt as moveListItemSublistItemsToListItemSublist,
-  $ as moveListItemUp,
-  Ne as moveListItems,
-  V as moveListItemsToList,
-  Re as normalizeList,
-  Ce as normalizeListItem,
-  Be as normalizeNestedList,
-  St as onKeyDownList,
-  mt as removeFirstListItem,
-  rt as removeListItem,
-  Dt as toggleList,
-  Q as unwrapList,
-  We as useListToolbarButton,
-  Ve as useListToolbarButtonState,
-  Oe as withList
-};
-//# sourceMappingURL=index.es.js.map