@milkdown/preset-gfm 7.2.3 → 7.2.4

package/lib/index.es.js

@@ -2,10 +2,11 @@ import { expectDomTypeError as O } from "@milkdown/exception";
 import { paragraphSchema as Q, listItemSchema as Ie } from "@milkdown/preset-commonmark";
 import { InputRule as Y } from "@milkdown/prose/inputrules";
 import { $markAttr as $e, $markSchema as _e, $command as h, $useKeymap as ee, $nodeSchema as k, $inputRule as te, $prose as B, $remark as Pe } from "@milkdown/utils";
-import { commandsCtx as M } from "@milkdown/core";
+import { commandsCtx as A } from "@milkdown/core";
 import { TextSelection as Ee, Selection as oe, PluginKey as De, Plugin as Oe } from "@milkdown/prose/state";
 import { TableMap as g, CellSelection as y, tableNodes as Be, goToNextCell as ne, isInTable as N, deleteTable as Ke, deleteColumn as He, deleteRow as Le, addColumnBefore as Fe, addColumnAfter as We, selectedRect as le, setCellAttr as ze, columnResizing as Ge, tableEditing as je } from "@milkdown/prose/tables";
-import { toggleMarkdownMark as Ze, findParentNode as Ve, cloneTr as A, browser as V } from "@milkdown/prose";
+import { findParentNode as Ze, cloneTr as M, browser as V } from "@milkdown/prose";
+import { toggleMark as Ve } from "@milkdown/prose/commands";
 import Ue from "remark-gfm";
 const d = (e, t) => (Object.assign(e, {
   meta: {
@@ -44,10 +45,7 @@ d(x.ctx, {
   displayName: "MarkSchemaCtx<strikethrough>",
   group: "Strikethrough"
 });
-const H = h("ToggleStrikeThrough", () => () => {
-  const e = x.type();
-  return Ze(e, "~~");
-});
+const H = h("ToggleStrikeThrough", (e) => () => Ve(x.type(e)));
 d(H, {
   displayName: "Command<ToggleStrikethrough>",
   group: "Strikethrough"
@@ -56,7 +54,7 @@ const L = ee("strikeThroughKeymap", {
   ToggleStrikethrough: {
     shortcuts: "Mod-Alt-x",
     command: (e) => {
-      const t = e.get(M);
+      const t = e.get(A);
       return () => t.call(H.key);
     }
   }
@@ -69,10 +67,10 @@ d(L.shortcuts, {
   displayName: "Keymap<strikethrough>",
   group: "Strikethrough"
 });
-const re = (e = 3, t = 3) => {
-  const n = Array(t).fill(0).map(() => R.type().createAndFill()), o = Array(t).fill(0).map(() => I.type().createAndFill()), l = Array(e).fill(0).map((r, a) => S.type().create(null, a === 0 ? o : n));
-  return T.type().create(null, l);
-}, w = (e) => Ve((t) => t.type.spec.tableRole === "table")(e), b = (e, t) => {
+const re = (e, t = 3, n = 3) => {
+  const o = Array(n).fill(0).map(() => R.type(e).createAndFill()), l = Array(n).fill(0).map(() => I.type(e).createAndFill()), r = Array(t).fill(0).map((s, c) => S.type(e).create(null, c === 0 ? l : o));
+  return T.type(e).create(null, r);
+}, w = (e) => Ze((t) => t.type.spec.tableRole === "table")(e), b = (e, t) => {
   const n = w(t);
   if (!n)
     return;
@@ -82,10 +80,10 @@ const re = (e = 3, t = 3) => {
       const r = n.node.nodeAt(l);
       if (!r)
         return;
-      const a = l + n.start;
+      const s = l + n.start;
       return {
-        pos: a,
-        start: a + 1,
+        pos: s,
+        start: s + 1,
         node: r
       };
     }).filter((l) => l != null);
@@ -99,10 +97,10 @@ const re = (e = 3, t = 3) => {
       const r = n.node.nodeAt(l);
       if (!r)
         return;
-      const a = l + n.start;
+      const s = l + n.start;
       return {
-        pos: a,
-        start: a + 1,
+        pos: s,
+        start: s + 1,
         node: r
       };
     }).filter((l) => l != null);
@@ -117,8 +115,8 @@ const re = (e = 3, t = 3) => {
     top: 0,
     bottom: n.height
   }).map((l) => {
-    const r = t.node.nodeAt(l), a = l + t.start;
-    return { pos: a, start: a + 1, node: r };
+    const r = t.node.nodeAt(l), s = l + t.start;
+    return { pos: s, start: s + 1, node: r };
   });
 }, qe = (e) => {
   const t = Xe(e.selection);
@@ -126,47 +124,47 @@ const re = (e = 3, t = 3) => {
     const n = e.doc.resolve(t[0].pos), o = t[t.length - 1];
     if (o) {
       const l = e.doc.resolve(o.pos);
-      return A(e.setSelection(new y(l, n)));
+      return M(e.setSelection(new y(l, n)));
     }
   }
   return e;
 };
-function ae(e, { map: t, tableStart: n, table: o }, l) {
-  const r = Array(l).fill(0).reduce((i, c, m) => i + o.child(m).nodeSize, n), a = Array(t.width).fill(0).map((i, c) => {
-    const m = o.nodeAt(t.map[c]);
-    return R.type().createAndFill({ alignment: m == null ? void 0 : m.attrs.alignment });
+function ae(e, t, { map: n, tableStart: o, table: l }, r) {
+  const s = Array(r).fill(0).reduce((i, m, a) => i + l.child(a).nodeSize, o), c = Array(n.width).fill(0).map((i, m) => {
+    const a = l.nodeAt(n.map[m]);
+    return R.type(e).createAndFill({ alignment: a == null ? void 0 : a.attrs.alignment });
   });
-  return e.insert(r, S.type().create(null, a)), e;
+  return t.insert(s, S.type(e).create(null, c)), t;
 }
 const se = (e) => (t) => (n) => {
   const o = w(n.selection), l = e === "row";
   if (o) {
     const r = g.get(o.node);
     if (t >= 0 && t < (l ? r.height : r.width)) {
-      const a = r.positionAt(
+      const s = r.positionAt(
         l ? t : r.height - 1,
         l ? r.width - 1 : t,
         o.node
-      ), i = n.doc.resolve(o.start + a), c = l ? y.rowSelection : y.colSelection, m = r.positionAt(l ? t : 0, l ? 0 : t, o.node), s = n.doc.resolve(o.start + m);
-      return A(n.setSelection(c(i, s)));
+      ), c = n.doc.resolve(o.start + s), i = l ? y.rowSelection : y.colSelection, m = r.positionAt(l ? t : 0, l ? 0 : t, o.node), a = n.doc.resolve(o.start + m);
+      return M(n.setSelection(i(c, a)));
     }
   }
   return n;
 }, Je = se("row"), Qe = se("col"), U = (e) => e[0].map((t, n) => e.map((o) => o[n])), ce = (e, t) => {
   const n = [], o = g.get(e);
   for (let r = 0; r < o.height; r++) {
-    const a = e.child(r), i = [];
-    for (let c = 0; c < o.width; c++) {
-      if (!t[r][c])
+    const s = e.child(r), c = [];
+    for (let i = 0; i < o.width; i++) {
+      if (!t[r][i])
         continue;
-      const m = o.map[r * o.width + c], s = t[r][c], p = e.nodeAt(m).type.createChecked(
-        Object.assign({}, s.attrs),
-        s.content,
-        s.marks
+      const m = o.map[r * o.width + i], a = t[r][i], p = e.nodeAt(m).type.createChecked(
+        Object.assign({}, a.attrs),
+        a.content,
+        a.marks
       );
-      i.push(p);
+      c.push(p);
     }
-    n.push(a.type.createChecked(a.attrs, i, a.marks));
+    n.push(s.type.createChecked(s.attrs, c, s.marks));
   }
   return e.type.createChecked(
     e.attrs,
@@ -177,21 +175,21 @@ const se = (e) => (t) => (n) => {
   const t = g.get(e), n = [];
   for (let o = 0; o < t.height; o++) {
     const l = [], r = {};
-    for (let a = 0; a < t.width; a++) {
-      const i = t.map[o * t.width + a], c = e.nodeAt(i), m = t.findCell(i);
-      if (r[i] || m.top !== o) {
+    for (let s = 0; s < t.width; s++) {
+      const c = t.map[o * t.width + s], i = e.nodeAt(c), m = t.findCell(c);
+      if (r[c] || m.top !== o) {
         l.push(null);
         continue;
       }
-      r[i] = !0, l.push(c);
+      r[c] = !0, l.push(i);
     }
     n.push(l);
   }
   return n;
 }, de = (e, t, n, o) => {
-  const l = t[0] > n[0] ? -1 : 1, r = e.splice(t[0], t.length), a = r.length % 2 === 0 ? 1 : 0;
-  let i;
-  return o === -1 && l === 1 ? i = n[0] - 1 : o === 1 && l === -1 ? i = n[n.length - 1] - a + 1 : i = l === -1 ? n[0] : n[n.length - 1] - a, e.splice(i, 0, ...r), e;
+  const l = t[0] > n[0] ? -1 : 1, r = e.splice(t[0], t.length), s = r.length % 2 === 0 ? 1 : 0;
+  let c;
+  return o === -1 && l === 1 ? c = n[0] - 1 : o === 1 && l === -1 ? c = n[n.length - 1] - s + 1 : c = l === -1 ? n[0] : n[n.length - 1] - s, e.splice(c, 0, ...r), e;
 }, Ye = (e, t, n, o) => {
   let l = U(ie(e.node));
   return l = de(l, t, n, o), l = U(l), ce(e.node, l);
@@ -200,122 +198,122 @@ const se = (e) => (t) => (n) => {
   return l = de(l, t, n, o), ce(e.node, l);
 }, X = (e, t) => {
   let n = e, o = e;
-  for (let s = e; s >= 0; s--) {
-    const u = b(s, t.selection);
+  for (let a = e; a >= 0; a--) {
+    const u = b(a, t.selection);
     u && u.forEach((p) => {
-      const f = p.node.attrs.colspan + s - 1;
-      f >= n && (n = s), f > o && (o = f);
+      const f = p.node.attrs.colspan + a - 1;
+      f >= n && (n = a), f > o && (o = f);
     });
   }
-  for (let s = e; s <= o; s++) {
-    const u = b(s, t.selection);
+  for (let a = e; a <= o; a++) {
+    const u = b(a, t.selection);
     u && u.forEach((p) => {
-      const f = p.node.attrs.colspan + s - 1;
+      const f = p.node.attrs.colspan + a - 1;
       p.node.attrs.colspan > 1 && f > o && (o = f);
     });
   }
   const l = [];
-  for (let s = n; s <= o; s++) {
-    const u = b(s, t.selection);
-    u && u.length && l.push(s);
+  for (let a = n; a <= o; a++) {
+    const u = b(a, t.selection);
+    u && u.length && l.push(a);
   }
   n = l[0], o = l[l.length - 1];
-  const r = b(n, t.selection), a = C(0, t.selection), i = t.doc.resolve(
+  const r = b(n, t.selection), s = C(0, t.selection), c = t.doc.resolve(
     r[r.length - 1].pos
   );
-  let c;
-  for (let s = o; s >= n; s--) {
-    const u = b(s, t.selection);
+  let i;
+  for (let a = o; a >= n; a--) {
+    const u = b(a, t.selection);
     if (u && u.length) {
-      for (let p = a.length - 1; p >= 0; p--)
-        if (a[p].pos === u[0].pos) {
-          c = u[0];
+      for (let p = s.length - 1; p >= 0; p--)
+        if (s[p].pos === u[0].pos) {
+          i = u[0];
           break;
         }
-      if (c)
+      if (i)
         break;
     }
   }
-  const m = t.doc.resolve(c.pos);
-  return { $anchor: i, $head: m, indexes: l };
+  const m = t.doc.resolve(i.pos);
+  return { $anchor: c, $head: m, indexes: l };
 }, q = (e, t) => {
   let n = e, o = e;
-  for (let s = e; s >= 0; s--)
-    C(s, t.selection).forEach((p) => {
-      const f = p.node.attrs.rowspan + s - 1;
-      f >= n && (n = s), f > o && (o = f);
+  for (let a = e; a >= 0; a--)
+    C(a, t.selection).forEach((p) => {
+      const f = p.node.attrs.rowspan + a - 1;
+      f >= n && (n = a), f > o && (o = f);
     });
-  for (let s = e; s <= o; s++)
-    C(s, t.selection).forEach((p) => {
-      const f = p.node.attrs.rowspan + s - 1;
+  for (let a = e; a <= o; a++)
+    C(a, t.selection).forEach((p) => {
+      const f = p.node.attrs.rowspan + a - 1;
       p.node.attrs.rowspan > 1 && f > o && (o = f);
     });
   const l = [];
-  for (let s = n; s <= o; s++) {
-    const u = C(s, t.selection);
-    u && u.length && l.push(s);
+  for (let a = n; a <= o; a++) {
+    const u = C(a, t.selection);
+    u && u.length && l.push(a);
   }
   n = l[0], o = l[l.length - 1];
-  const r = C(n, t.selection), a = b(0, t.selection), i = t.doc.resolve(r[r.length - 1].pos);
-  let c;
-  for (let s = o; s >= n; s--) {
-    const u = C(s, t.selection);
+  const r = C(n, t.selection), s = b(0, t.selection), c = t.doc.resolve(r[r.length - 1].pos);
+  let i;
+  for (let a = o; a >= n; a--) {
+    const u = C(a, t.selection);
     if (u && u.length) {
-      for (let p = a.length - 1; p >= 0; p--)
-        if (a[p].pos === u[0].pos) {
-          c = u[0];
+      for (let p = s.length - 1; p >= 0; p--)
+        if (s[p].pos === u[0].pos) {
+          i = u[0];
           break;
         }
-      if (c)
+      if (i)
         break;
     }
   }
-  const m = t.doc.resolve(c.pos);
-  return { $anchor: i, $head: m, indexes: l };
+  const m = t.doc.resolve(i.pos);
+  return { $anchor: c, $head: m, indexes: l };
 };
 function tt(e, t, n, o = !0) {
   const l = w(e.selection);
   if (!l)
     return e;
-  const { indexes: r } = X(t, e), { indexes: a } = X(n, e);
+  const { indexes: r } = X(t, e), { indexes: s } = X(n, e);
   if (r.includes(n))
     return e;
-  const i = Ye(
+  const c = Ye(
     l,
     r,
-    a,
+    s,
     0
-  ), c = A(e).replaceWith(
+  ), i = M(e).replaceWith(
     l.pos,
     l.pos + l.node.nodeSize,
-    i
+    c
   );
   if (!o)
-    return c;
-  const m = g.get(i), s = l.start, u = n, p = m.positionAt(m.height - 1, u, i), f = c.doc.resolve(s + p), $ = y.colSelection, _ = m.positionAt(0, u, i), P = c.doc.resolve(s + _);
-  return c.setSelection($(f, P));
+    return i;
+  const m = g.get(c), a = l.start, u = n, p = m.positionAt(m.height - 1, u, c), f = i.doc.resolve(a + p), $ = y.colSelection, _ = m.positionAt(0, u, c), P = i.doc.resolve(a + _);
+  return i.setSelection($(f, P));
 }
 function ot(e, t, n, o = !0) {
   const l = w(e.selection);
   if (!l)
     return e;
-  const { indexes: r } = q(t, e), { indexes: a } = q(n, e);
+  const { indexes: r } = q(t, e), { indexes: s } = q(n, e);
   if (r.includes(n))
     return e;
-  const i = et(
+  const c = et(
     l,
     r,
-    a,
+    s,
     0
-  ), c = A(e).replaceWith(
+  ), i = M(e).replaceWith(
     l.pos,
     l.pos + l.node.nodeSize,
-    i
+    c
   );
   if (!o)
-    return c;
-  const m = g.get(i), s = l.start, u = n, p = m.positionAt(u, m.width - 1, i), f = c.doc.resolve(s + p), $ = y.rowSelection, _ = m.positionAt(u, 0, i), P = c.doc.resolve(s + _);
-  return c.setSelection($(f, P));
+    return i;
+  const m = g.get(c), a = l.start, u = n, p = m.positionAt(u, m.width - 1, c), f = i.doc.resolve(a + p), $ = y.rowSelection, _ = m.positionAt(u, 0, c), P = i.doc.resolve(a + _);
+  return i.setSelection($(f, P));
 }
 const v = Be({
   tableGroup: "block",
@@ -334,10 +332,10 @@ const v = Be({
   parseMarkdown: {
     match: (e) => e.type === "table",
     runner: (e, t, n) => {
-      const o = t.align, l = t.children.map((r, a) => ({
+      const o = t.align, l = t.children.map((r, s) => ({
         ...r,
         align: o,
-        isHeader: a === 0
+        isHeader: s === 0
       }));
       e.openNode(n), e.next(l), e.closeNode();
     }
@@ -369,9 +367,9 @@ const S = k("table_row", () => ({
   parseMarkdown: {
     match: (e) => e.type === "tableRow",
     runner: (e, t, n) => {
-      const o = t.align, l = t.children.map((r, a) => ({
+      const o = t.align, l = t.children.map((r, s) => ({
         ...r,
-        align: o[a],
+        align: o[s],
         isHeader: t.isHeader
       }));
       e.openNode(n), e.next(l), e.closeNode();
@@ -440,18 +438,19 @@ d(I.ctx, {
   displayName: "NodeSchemaCtx<tableHeader>",
   group: "Table"
 });
-const me = te(() => new Y(
+const me = te((e) => new Y(
   /^\|(?<col>\d+)[xX](?<row>\d+)\|\s$/,
-  (e, t, n, o) => {
-    var i, c;
-    const l = e.doc.resolve(n);
-    if (!l.node(-1).canReplaceWith(l.index(-1), l.indexAfter(-1), T.type()))
+  (t, n, o, l) => {
+    var i, m;
+    const r = t.doc.resolve(o);
+    if (!r.node(-1).canReplaceWith(r.index(-1), r.indexAfter(-1), T.type(e)))
       return null;
-    const r = re(
-      Number((i = t.groups) == null ? void 0 : i.row),
-      Number((c = t.groups) == null ? void 0 : c.col)
-    ), a = e.tr.replaceRangeWith(n, o, r).scrollIntoView();
-    return a.setSelection(Ee.create(a.doc, n + 3));
+    const s = re(
+      e,
+      Number((i = n.groups) == null ? void 0 : i.row),
+      Number((m = n.groups) == null ? void 0 : m.col)
+    ), c = t.tr.replaceRangeWith(o, l, s);
+    return c.setSelection(Ee.create(c.doc, o + 3)).scrollIntoView();
   }
 ));
 d(me, {
@@ -468,19 +467,19 @@ d(W, {
   displayName: "Command<goToNextTableCellCommand>",
   group: "Table"
 });
-const z = h("BreakTable", () => () => (e, t) => {
-  if (!N(e))
+const z = h("BreakTable", (e) => () => (t, n) => {
+  if (!N(t))
     return !1;
-  const { $head: n } = e.selection, o = n.after(), l = e.tr.replaceWith(o, o, Q.type().createAndFill());
-  return l.setSelection(oe.near(l.doc.resolve(o), 1)).scrollIntoView(), t == null || t(l), !0;
+  const { $head: o } = t.selection, l = o.after(), r = t.tr.replaceWith(l, l, Q.type(e).createAndFill());
+  return r.setSelection(oe.near(r.doc.resolve(l), 1)).scrollIntoView(), n == null || n(r), !0;
 });
 d(z, {
   displayName: "Command<breakTableCommand>",
   group: "Table"
 });
-const ue = h("InsertTable", () => ({ row: e, col: t } = {}) => (n, o) => {
-  const { selection: l, tr: r } = n, { from: a } = l, i = re(e, t), c = r.replaceSelectionWith(i), m = oe.findFrom(c.doc.resolve(a), 1, !0);
-  return m && (o == null || o(c.setSelection(m))), !0;
+const ue = h("InsertTable", (e) => ({ row: t, col: n } = {}) => (o, l) => {
+  const { selection: r, tr: s } = o, { from: c } = r, i = re(e, t, n), m = s.replaceSelectionWith(i), a = oe.findFrom(m.doc.resolve(c), 1, !0);
+  return a && m.setSelection(a), l == null || l(m), !0;
 });
 d(ue, {
   displayName: "Command<insertTableCommand>",
@@ -547,12 +546,12 @@ d(ke, {
   displayName: "Command<addColAfterCommand>",
   group: "Table"
 });
-const we = h("AddRowBefore", () => () => (e, t) => {
-  if (!N(e))
+const we = h("AddRowBefore", (e) => () => (t, n) => {
+  if (!N(t))
     return !1;
-  if (t) {
-    const n = le(e);
-    t(ae(e.tr, n, n.top));
+  if (n) {
+    const o = le(t);
+    n(ae(e, t.tr, o, o.top));
   }
   return !0;
 });
@@ -560,12 +559,12 @@ d(we, {
   displayName: "Command<addRowBeforeCommand>",
   group: "Table"
 });
-const Ne = h("AddRowAfter", () => () => (e, t) => {
-  if (!N(e))
+const Ne = h("AddRowAfter", (e) => () => (t, n) => {
+  if (!N(t))
     return !1;
-  if (t) {
-    const n = le(e);
-    t(ae(e.tr, n, n.bottom));
+  if (n) {
+    const o = le(t);
+    n(ae(e, t.tr, o, o.bottom));
   }
   return !0;
 });
@@ -582,21 +581,21 @@ const G = ee("tableKeymap", {
   NextCell: {
     shortcuts: ["Mod-]", "Tab"],
     command: (e) => {
-      const t = e.get(M);
+      const t = e.get(A);
       return () => t.call(W.key);
     }
   },
   PrevCell: {
     shortcuts: ["Mod-[", "Shift-Tab"],
     command: (e) => {
-      const t = e.get(M);
+      const t = e.get(A);
       return () => t.call(F.key);
     }
   },
   ExitTable: {
     shortcuts: ["Mod-Enter"],
     command: (e) => {
-      const t = e.get(M);
+      const t = e.get(A);
       return () => t.call(z.key);
     }
   }
@@ -773,8 +772,8 @@ const Se = Ie.extendSchema((e) => (t) => {
           n.parseMarkdown.runner(o, l, r);
           return;
         }
-        const a = l.label != null ? `${l.label}.` : "•", i = l.checked != null ? !!l.checked : null, c = l.label != null ? "ordered" : "bullet", m = l.spread != null ? `${l.spread}` : "true";
-        o.openNode(r, { label: a, listType: c, spread: m, checked: i }), o.next(l.children), o.closeNode();
+        const s = l.label != null ? `${l.label}.` : "•", c = l.checked != null ? !!l.checked : null, i = l.label != null ? "ordered" : "bullet", m = l.spread != null ? `${l.spread}` : "true";
+        o.openNode(r, { label: s, listType: i, spread: m, checked: c }), o.next(l.children), o.closeNode();
       }
     },
     toMarkdown: {
@@ -784,8 +783,8 @@ const Se = Ie.extendSchema((e) => (t) => {
           n.toMarkdown.runner(o, l);
           return;
         }
-        const r = l.attrs.label, a = l.attrs.listType, i = l.attrs.spread === "true", c = l.attrs.checked;
-        o.openNode("listItem", void 0, { label: r, listType: a, spread: i, checked: c }), o.next(l.content), o.closeNode();
+        const r = l.attrs.label, s = l.attrs.listType, c = l.attrs.spread === "true", i = l.attrs.checked;
+        o.openNode("listItem", void 0, { label: r, listType: s, spread: c, checked: i }), o.next(l.content), o.closeNode();
       }
     }
   };
@@ -795,15 +794,15 @@ d(Se, {
   group: "ListItem"
 });
 const Re = te(() => new Y(/^\[(?<checked>\s|x)\]\s$/, (e, t, n, o) => {
-  var s;
+  var a;
   const l = e.doc.resolve(n);
-  let r = 0, a = l.node(r);
-  for (; a && a.type.name !== "list_item"; )
-    r--, a = l.node(r);
-  if (!a || a.attrs.checked != null)
+  let r = 0, s = l.node(r);
+  for (; s && s.type.name !== "list_item"; )
+    r--, s = l.node(r);
+  if (!s || s.attrs.checked != null)
     return null;
-  const i = ((s = t.groups) == null ? void 0 : s.checked) === "x", c = l.before(r), m = e.tr;
-  return m.deleteRange(n, o).setNodeMarkup(c, void 0, { ...a.attrs, checked: i }), m;
+  const c = ((a = t.groups) == null ? void 0 : a.checked) === "x", i = l.before(r), m = e.tr;
+  return m.deleteRange(n, o).setNodeMarkup(i, void 0, { ...s.attrs, checked: c }), m;
 }));
 d(Re, {
   displayName: "InputRule<wrapInTaskListInputRule>",
@@ -815,30 +814,30 @@ const nt = [
 ].flat(), lt = [
   me,
   Re
-], Me = B(() => {
-  const e = new De("MILKDOWN_AUTO_INSERT_ZERO_SPACE"), t = (o) => o.type === Q.type(), n = (o) => t(o) && o.nodeSize === 2;
+], Ae = B((e) => {
+  const t = new De("MILKDOWN_AUTO_INSERT_ZERO_SPACE"), n = (l) => l.type === Q.type(e), o = (l) => n(l) && l.nodeSize === 2;
   return new Oe({
-    key: e,
+    key: t,
     props: {
       handleDOMEvents: {
-        compositionstart(o) {
-          const { state: l, dispatch: r } = o, { tr: a, selection: i } = l, { $from: c } = i;
-          return V.safari && N(l) && i.empty && n(c.parent) && r(a.insertText("⁠", c.start())), !1;
+        compositionstart(l) {
+          const { state: r, dispatch: s } = l, { tr: c, selection: i } = r, { $from: m } = i;
+          return V.safari && N(r) && i.empty && o(m.parent) && s(c.insertText("⁠", m.start())), !1;
         },
-        compositionend(o) {
-          const { state: l, dispatch: r } = o, { tr: a, selection: i } = l, { $from: c } = i;
-          return V.safari && N(l) && i.empty && t(c.parent) && c.parent.textContent.startsWith("⁠") && r(a.delete(c.start(), c.start() + 1)), !1;
+        compositionend(l) {
+          const { state: r, dispatch: s } = l, { tr: c, selection: i } = r, { $from: m } = i;
+          return V.safari && N(r) && i.empty && n(m.parent) && m.parent.textContent.startsWith("⁠") && s(c.delete(m.start(), m.start() + 1)), !1;
         }
       }
     }
   });
 });
-d(Me, {
+d(Ae, {
   displayName: "Prose<autoInsertZeroSpaceInTablePlugin>",
   group: "Prose"
 });
-const Ae = B(() => Ge({}));
-d(Ae, {
+const Me = B(() => Ge({}));
+d(Me, {
   displayName: "Prose<columnResizingPlugin>",
   group: "Prose"
 });
@@ -853,8 +852,8 @@ d(ve, {
   group: "Remark"
 });
 const rt = [
-  Me,
   Ae,
+  Me,
   xe,
   ve
 ], at = [
@@ -884,7 +883,7 @@ const rt = [
   ke,
   Te,
   H
-], bt = [at, lt, nt, rt, st].flat();
+], Ct = [at, lt, nt, rt, st].flat();
 export {
   ke as addColAfterCommand,
   ye as addColBeforeCommand,
@@ -902,7 +901,7 @@ export {
   Xe as getAllCellsInTable,
   b as getCellsInCol,
   C as getCellsInRow,
-  bt as gfm,
+  Ct as gfm,
   W as goToNextTableCellCommand,
   F as goToPrevTableCellCommand,
   lt as inputrules,