@milkdown/preset-gfm 7.1.0 → 7.1.2-next.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/lib/index.es.js CHANGED
@@ -1,20 +1,30 @@
1
- import { expectDomTypeError as $ } from "@milkdown/exception";
2
- import { paragraphSchema as W, listItemSchema as se } from "@milkdown/preset-commonmark";
3
- import { InputRule as K } from "@milkdown/prose/inputrules";
4
- import { $markAttr as ce, $markSchema as ae, $command as p, $useKeymap as L, $nodeSchema as w, $inputRule as z, $prose as _, $remark as ie } from "@milkdown/utils";
5
- import { commandsCtx as S } from "@milkdown/core";
6
- import { TextSelection as de, Selection as G, PluginKey as ue, Plugin as me } from "@milkdown/prose/state";
7
- import { TableMap as h, CellSelection as C, tableNodes as fe, goToNextCell as j, isInTable as y, deleteTable as pe, deleteColumn as he, deleteRow as ge, addColumnBefore as be, addColumnAfter as Ce, selectedRect as V, setCellAttr as we, columnResizing as ke, tableEditing as ye } from "@milkdown/prose/tables";
8
- import { findParentNode as Se, cloneTr as T, browser as D } from "@milkdown/prose";
9
- import { toggleMark as Te } from "@milkdown/prose/commands";
10
- import Ae from "remark-gfm";
11
- const Z = ce("strike_through"), U = ae("strike_through", (e) => ({
1
+ import { expectDomTypeError as O } from "@milkdown/exception";
2
+ import { paragraphSchema as Q, listItemSchema as Ie } from "@milkdown/preset-commonmark";
3
+ import { InputRule as Y } from "@milkdown/prose/inputrules";
4
+ 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";
5
+ import { commandsCtx as A } from "@milkdown/core";
6
+ import { TextSelection as Ee, Selection as oe, PluginKey as De, Plugin as Oe } from "@milkdown/prose/state";
7
+ 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";
8
+ import { findParentNode as Ze, cloneTr as M, browser as V } from "@milkdown/prose";
9
+ import { toggleMark as Ve } from "@milkdown/prose/commands";
10
+ import Ue from "remark-gfm";
11
+ const d = (e, t) => (Object.assign(e, {
12
+ meta: {
13
+ package: "@milkdown/preset-gfm",
14
+ ...t
15
+ }
16
+ }), e), K = $e("strike_through");
17
+ d(K, {
18
+ displayName: "Attr<strikethrough>",
19
+ group: "Strikethrough"
20
+ });
21
+ const x = _e("strike_through", (e) => ({
12
22
  inclusive: !1,
13
23
  parseDOM: [
14
24
  { tag: "del" },
15
25
  { style: "text-decoration", getAttrs: (t) => t === "line-through" }
16
26
  ],
17
- toDOM: (t) => ["del", e.get(Z.key)(t)],
27
+ toDOM: (t) => ["del", e.get(K.key)(t)],
18
28
  parseMarkdown: {
19
29
  match: (t) => t.type === "delete",
20
30
  runner: (t, n, o) => {
@@ -27,263 +37,286 @@ const Z = ce("strike_through"), U = ae("strike_through", (e) => ({
27
37
  t.withMark(n, "delete");
28
38
  }
29
39
  }
30
- })), X = p("ToggleStrikeThrough", () => () => Te(U.type())), Me = L("strikeThroughKeymap", {
40
+ }));
41
+ d(x.mark, {
42
+ displayName: "MarkSchema<strikethrough>",
43
+ group: "Strikethrough"
44
+ });
45
+ d(x.ctx, {
46
+ displayName: "MarkSchemaCtx<strikethrough>",
47
+ group: "Strikethrough"
48
+ });
49
+ const H = h("ToggleStrikeThrough", () => () => Ve(x.type()));
50
+ d(H, {
51
+ displayName: "Command<ToggleStrikethrough>",
52
+ group: "Strikethrough"
53
+ });
54
+ const L = ee("strikeThroughKeymap", {
31
55
  ToggleStrikethrough: {
32
56
  shortcuts: "Mod-Alt-x",
33
57
  command: (e) => {
34
- const t = e.get(S);
35
- return () => t.call(X.key);
58
+ const t = e.get(A);
59
+ return () => t.call(H.key);
36
60
  }
37
61
  }
38
- }), q = (e = 3, t = 3) => {
39
- const n = Array(t).fill(0).map(() => O.type().createAndFill()), o = Array(t).fill(0).map(() => oe.type().createAndFill()), l = Array(e).fill(0).map((r, s) => E.type().create(null, s === 0 ? o : n));
40
- return I.type().create(null, l);
41
- }, k = (e) => Se((t) => t.type.spec.tableRole === "table")(e), g = (e, t) => {
42
- const n = k(t);
62
+ });
63
+ d(L.ctx, {
64
+ displayName: "KeymapCtx<strikethrough>",
65
+ group: "Strikethrough"
66
+ });
67
+ d(L.shortcuts, {
68
+ displayName: "Keymap<strikethrough>",
69
+ group: "Strikethrough"
70
+ });
71
+ const re = (e = 3, t = 3) => {
72
+ 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));
73
+ return T.type().create(null, l);
74
+ }, w = (e) => Ze((t) => t.type.spec.tableRole === "table")(e), b = (e, t) => {
75
+ const n = w(t);
43
76
  if (!n)
44
77
  return;
45
- const o = h.get(n.node);
78
+ const o = g.get(n.node);
46
79
  if (!(e < 0 || e >= o.width))
47
80
  return o.cellsInRect({ left: e, right: e + 1, top: 0, bottom: o.height }).map((l) => {
48
81
  const r = n.node.nodeAt(l);
49
82
  if (!r)
50
83
  return;
51
- const s = l + n.start;
84
+ const a = l + n.start;
52
85
  return {
53
- pos: s,
54
- start: s + 1,
86
+ pos: a,
87
+ start: a + 1,
55
88
  node: r
56
89
  };
57
90
  }).filter((l) => l != null);
58
- }, b = (e, t) => {
59
- const n = k(t);
91
+ }, C = (e, t) => {
92
+ const n = w(t);
60
93
  if (!n)
61
94
  return;
62
- const o = h.get(n.node);
95
+ const o = g.get(n.node);
63
96
  if (!(e < 0 || e >= o.height))
64
97
  return o.cellsInRect({ left: 0, right: o.width, top: e, bottom: e + 1 }).map((l) => {
65
98
  const r = n.node.nodeAt(l);
66
99
  if (!r)
67
100
  return;
68
- const s = l + n.start;
101
+ const a = l + n.start;
69
102
  return {
70
- pos: s,
71
- start: s + 1,
103
+ pos: a,
104
+ start: a + 1,
72
105
  node: r
73
106
  };
74
107
  }).filter((l) => l != null);
75
- }, Re = (e) => {
76
- const t = k(e);
108
+ }, Xe = (e) => {
109
+ const t = w(e);
77
110
  if (!t)
78
111
  return;
79
- const n = h.get(t.node);
112
+ const n = g.get(t.node);
80
113
  return n.cellsInRect({
81
114
  left: 0,
82
115
  right: n.width,
83
116
  top: 0,
84
117
  bottom: n.height
85
118
  }).map((l) => {
86
- const r = t.node.nodeAt(l), s = l + t.start;
87
- return { pos: s, start: s + 1, node: r };
119
+ const r = t.node.nodeAt(l), a = l + t.start;
120
+ return { pos: a, start: a + 1, node: r };
88
121
  });
89
- }, ve = (e) => {
90
- const t = Re(e.selection);
122
+ }, qe = (e) => {
123
+ const t = Xe(e.selection);
91
124
  if (t && t[0]) {
92
125
  const n = e.doc.resolve(t[0].pos), o = t[t.length - 1];
93
126
  if (o) {
94
127
  const l = e.doc.resolve(o.pos);
95
- return T(e.setSelection(new C(l, n)));
128
+ return M(e.setSelection(new y(l, n)));
96
129
  }
97
130
  }
98
131
  return e;
99
132
  };
100
- function J(e, { map: t, tableStart: n, table: o }, l) {
101
- const r = Array(l).fill(0).reduce((i, a, d) => i + o.child(d).nodeSize, n), s = Array(t.width).fill(0).map((i, a) => {
102
- const d = o.nodeAt(t.map[a]);
103
- return O.type().createAndFill({ alignment: d == null ? void 0 : d.attrs.alignment });
133
+ function ae(e, { map: t, tableStart: n, table: o }, l) {
134
+ 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) => {
135
+ const m = o.nodeAt(t.map[c]);
136
+ return R.type().createAndFill({ alignment: m == null ? void 0 : m.attrs.alignment });
104
137
  });
105
- return e.insert(r, E.type().create(null, s)), e;
138
+ return e.insert(r, S.type().create(null, a)), e;
106
139
  }
107
- const Q = (e) => (t) => (n) => {
108
- const o = k(n.selection), l = e === "row";
140
+ const se = (e) => (t) => (n) => {
141
+ const o = w(n.selection), l = e === "row";
109
142
  if (o) {
110
- const r = h.get(o.node);
143
+ const r = g.get(o.node);
111
144
  if (t >= 0 && t < (l ? r.height : r.width)) {
112
- const s = r.positionAt(
145
+ const a = r.positionAt(
113
146
  l ? t : r.height - 1,
114
147
  l ? r.width - 1 : t,
115
148
  o.node
116
- ), i = n.doc.resolve(o.start + s), a = l ? C.rowSelection : C.colSelection, d = r.positionAt(l ? t : 0, l ? 0 : t, o.node), c = n.doc.resolve(o.start + d);
117
- return T(n.setSelection(a(i, c)));
149
+ ), 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);
150
+ return M(n.setSelection(c(i, s)));
118
151
  }
119
152
  }
120
153
  return n;
121
- }, Ne = Q("row"), xe = Q("col"), P = (e) => e[0].map((t, n) => e.map((o) => o[n])), Y = (e, t) => {
122
- const n = [], o = h.get(e);
154
+ }, Je = se("row"), Qe = se("col"), U = (e) => e[0].map((t, n) => e.map((o) => o[n])), ce = (e, t) => {
155
+ const n = [], o = g.get(e);
123
156
  for (let r = 0; r < o.height; r++) {
124
- const s = e.child(r), i = [];
125
- for (let a = 0; a < o.width; a++) {
126
- if (!t[r][a])
157
+ const a = e.child(r), i = [];
158
+ for (let c = 0; c < o.width; c++) {
159
+ if (!t[r][c])
127
160
  continue;
128
- const d = o.map[r * o.width + a], c = t[r][a], m = e.nodeAt(d).type.createChecked(
129
- Object.assign({}, c.attrs),
130
- c.content,
131
- c.marks
161
+ const m = o.map[r * o.width + c], s = t[r][c], p = e.nodeAt(m).type.createChecked(
162
+ Object.assign({}, s.attrs),
163
+ s.content,
164
+ s.marks
132
165
  );
133
- i.push(m);
166
+ i.push(p);
134
167
  }
135
- n.push(s.type.createChecked(s.attrs, i, s.marks));
168
+ n.push(a.type.createChecked(a.attrs, i, a.marks));
136
169
  }
137
170
  return e.type.createChecked(
138
171
  e.attrs,
139
172
  n,
140
173
  e.marks
141
174
  );
142
- }, ee = (e) => {
143
- const t = h.get(e), n = [];
175
+ }, ie = (e) => {
176
+ const t = g.get(e), n = [];
144
177
  for (let o = 0; o < t.height; o++) {
145
178
  const l = [], r = {};
146
- for (let s = 0; s < t.width; s++) {
147
- const i = t.map[o * t.width + s], a = e.nodeAt(i), d = t.findCell(i);
148
- if (r[i] || d.top !== o) {
179
+ for (let a = 0; a < t.width; a++) {
180
+ const i = t.map[o * t.width + a], c = e.nodeAt(i), m = t.findCell(i);
181
+ if (r[i] || m.top !== o) {
149
182
  l.push(null);
150
183
  continue;
151
184
  }
152
- r[i] = !0, l.push(a);
185
+ r[i] = !0, l.push(c);
153
186
  }
154
187
  n.push(l);
155
188
  }
156
189
  return n;
157
- }, te = (e, t, n, o) => {
158
- const l = t[0] > n[0] ? -1 : 1, r = e.splice(t[0], t.length), s = r.length % 2 === 0 ? 1 : 0;
190
+ }, de = (e, t, n, o) => {
191
+ const l = t[0] > n[0] ? -1 : 1, r = e.splice(t[0], t.length), a = r.length % 2 === 0 ? 1 : 0;
159
192
  let i;
160
- return o === -1 && l === 1 ? i = n[0] - 1 : o === 1 && l === -1 ? i = n[n.length - 1] - s + 1 : i = l === -1 ? n[0] : n[n.length - 1] - s, e.splice(i, 0, ...r), e;
161
- }, $e = (e, t, n, o) => {
162
- let l = P(ee(e.node));
163
- return l = te(l, t, n, o), l = P(l), Y(e.node, l);
164
- }, _e = (e, t, n, o) => {
165
- let l = ee(e.node);
166
- return l = te(l, t, n, o), Y(e.node, l);
167
- }, B = (e, t) => {
193
+ 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;
194
+ }, Ye = (e, t, n, o) => {
195
+ let l = U(ie(e.node));
196
+ return l = de(l, t, n, o), l = U(l), ce(e.node, l);
197
+ }, et = (e, t, n, o) => {
198
+ let l = ie(e.node);
199
+ return l = de(l, t, n, o), ce(e.node, l);
200
+ }, X = (e, t) => {
168
201
  let n = e, o = e;
169
- for (let c = e; c >= 0; c--) {
170
- const u = g(c, t.selection);
171
- u && u.forEach((m) => {
172
- const f = m.node.attrs.colspan + c - 1;
173
- f >= n && (n = c), f > o && (o = f);
202
+ for (let s = e; s >= 0; s--) {
203
+ const u = b(s, t.selection);
204
+ u && u.forEach((p) => {
205
+ const f = p.node.attrs.colspan + s - 1;
206
+ f >= n && (n = s), f > o && (o = f);
174
207
  });
175
208
  }
176
- for (let c = e; c <= o; c++) {
177
- const u = g(c, t.selection);
178
- u && u.forEach((m) => {
179
- const f = m.node.attrs.colspan + c - 1;
180
- m.node.attrs.colspan > 1 && f > o && (o = f);
209
+ for (let s = e; s <= o; s++) {
210
+ const u = b(s, t.selection);
211
+ u && u.forEach((p) => {
212
+ const f = p.node.attrs.colspan + s - 1;
213
+ p.node.attrs.colspan > 1 && f > o && (o = f);
181
214
  });
182
215
  }
183
216
  const l = [];
184
- for (let c = n; c <= o; c++) {
185
- const u = g(c, t.selection);
186
- u && u.length && l.push(c);
217
+ for (let s = n; s <= o; s++) {
218
+ const u = b(s, t.selection);
219
+ u && u.length && l.push(s);
187
220
  }
188
221
  n = l[0], o = l[l.length - 1];
189
- const r = g(n, t.selection), s = b(0, t.selection), i = t.doc.resolve(
222
+ const r = b(n, t.selection), a = C(0, t.selection), i = t.doc.resolve(
190
223
  r[r.length - 1].pos
191
224
  );
192
- let a;
193
- for (let c = o; c >= n; c--) {
194
- const u = g(c, t.selection);
225
+ let c;
226
+ for (let s = o; s >= n; s--) {
227
+ const u = b(s, t.selection);
195
228
  if (u && u.length) {
196
- for (let m = s.length - 1; m >= 0; m--)
197
- if (s[m].pos === u[0].pos) {
198
- a = u[0];
229
+ for (let p = a.length - 1; p >= 0; p--)
230
+ if (a[p].pos === u[0].pos) {
231
+ c = u[0];
199
232
  break;
200
233
  }
201
- if (a)
234
+ if (c)
202
235
  break;
203
236
  }
204
237
  }
205
- const d = t.doc.resolve(a.pos);
206
- return { $anchor: i, $head: d, indexes: l };
207
- }, F = (e, t) => {
238
+ const m = t.doc.resolve(c.pos);
239
+ return { $anchor: i, $head: m, indexes: l };
240
+ }, q = (e, t) => {
208
241
  let n = e, o = e;
209
- for (let c = e; c >= 0; c--)
210
- b(c, t.selection).forEach((m) => {
211
- const f = m.node.attrs.rowspan + c - 1;
212
- f >= n && (n = c), f > o && (o = f);
242
+ for (let s = e; s >= 0; s--)
243
+ C(s, t.selection).forEach((p) => {
244
+ const f = p.node.attrs.rowspan + s - 1;
245
+ f >= n && (n = s), f > o && (o = f);
213
246
  });
214
- for (let c = e; c <= o; c++)
215
- b(c, t.selection).forEach((m) => {
216
- const f = m.node.attrs.rowspan + c - 1;
217
- m.node.attrs.rowspan > 1 && f > o && (o = f);
247
+ for (let s = e; s <= o; s++)
248
+ C(s, t.selection).forEach((p) => {
249
+ const f = p.node.attrs.rowspan + s - 1;
250
+ p.node.attrs.rowspan > 1 && f > o && (o = f);
218
251
  });
219
252
  const l = [];
220
- for (let c = n; c <= o; c++) {
221
- const u = b(c, t.selection);
222
- u && u.length && l.push(c);
253
+ for (let s = n; s <= o; s++) {
254
+ const u = C(s, t.selection);
255
+ u && u.length && l.push(s);
223
256
  }
224
257
  n = l[0], o = l[l.length - 1];
225
- const r = b(n, t.selection), s = g(0, t.selection), i = t.doc.resolve(r[r.length - 1].pos);
226
- let a;
227
- for (let c = o; c >= n; c--) {
228
- const u = b(c, t.selection);
258
+ const r = C(n, t.selection), a = b(0, t.selection), i = t.doc.resolve(r[r.length - 1].pos);
259
+ let c;
260
+ for (let s = o; s >= n; s--) {
261
+ const u = C(s, t.selection);
229
262
  if (u && u.length) {
230
- for (let m = s.length - 1; m >= 0; m--)
231
- if (s[m].pos === u[0].pos) {
232
- a = u[0];
263
+ for (let p = a.length - 1; p >= 0; p--)
264
+ if (a[p].pos === u[0].pos) {
265
+ c = u[0];
233
266
  break;
234
267
  }
235
- if (a)
268
+ if (c)
236
269
  break;
237
270
  }
238
271
  }
239
- const d = t.doc.resolve(a.pos);
240
- return { $anchor: i, $head: d, indexes: l };
272
+ const m = t.doc.resolve(c.pos);
273
+ return { $anchor: i, $head: m, indexes: l };
241
274
  };
242
- function Ie(e, t, n, o = !0) {
243
- const l = k(e.selection);
275
+ function tt(e, t, n, o = !0) {
276
+ const l = w(e.selection);
244
277
  if (!l)
245
278
  return e;
246
- const { indexes: r } = B(t, e), { indexes: s } = B(n, e);
279
+ const { indexes: r } = X(t, e), { indexes: a } = X(n, e);
247
280
  if (r.includes(n))
248
281
  return e;
249
- const i = $e(
282
+ const i = Ye(
250
283
  l,
251
284
  r,
252
- s,
285
+ a,
253
286
  0
254
- ), a = T(e).replaceWith(
287
+ ), c = M(e).replaceWith(
255
288
  l.pos,
256
289
  l.pos + l.node.nodeSize,
257
290
  i
258
291
  );
259
292
  if (!o)
260
- return a;
261
- const d = h.get(i), c = l.start, u = n, m = d.positionAt(d.height - 1, u, i), f = a.doc.resolve(c + m), M = C.colSelection, R = d.positionAt(0, u, i), v = a.doc.resolve(c + R);
262
- return a.setSelection(M(f, v));
293
+ return c;
294
+ 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 + _);
295
+ return c.setSelection($(f, P));
263
296
  }
264
- function Ee(e, t, n, o = !0) {
265
- const l = k(e.selection);
297
+ function ot(e, t, n, o = !0) {
298
+ const l = w(e.selection);
266
299
  if (!l)
267
300
  return e;
268
- const { indexes: r } = F(t, e), { indexes: s } = F(n, e);
301
+ const { indexes: r } = q(t, e), { indexes: a } = q(n, e);
269
302
  if (r.includes(n))
270
303
  return e;
271
- const i = _e(
304
+ const i = et(
272
305
  l,
273
306
  r,
274
- s,
307
+ a,
275
308
  0
276
- ), a = T(e).replaceWith(
309
+ ), c = M(e).replaceWith(
277
310
  l.pos,
278
311
  l.pos + l.node.nodeSize,
279
312
  i
280
313
  );
281
314
  if (!o)
282
- return a;
283
- const d = h.get(i), c = l.start, u = n, m = d.positionAt(u, d.width - 1, i), f = a.doc.resolve(c + m), M = C.rowSelection, R = d.positionAt(u, 0, i), v = a.doc.resolve(c + R);
284
- return a.setSelection(M(f, v));
315
+ return c;
316
+ 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 + _);
317
+ return c.setSelection($(f, P));
285
318
  }
286
- const A = fe({
319
+ const v = Be({
287
320
  tableGroup: "block",
288
321
  cellContent: "paragraph",
289
322
  cellAttributes: {
@@ -295,15 +328,15 @@ const A = fe({
295
328
  }
296
329
  }
297
330
  }
298
- }), I = w("table", () => ({
299
- ...A.table,
331
+ }), T = k("table", () => ({
332
+ ...v.table,
300
333
  parseMarkdown: {
301
334
  match: (e) => e.type === "table",
302
335
  runner: (e, t, n) => {
303
- const o = t.align, l = t.children.map((r, s) => ({
336
+ const o = t.align, l = t.children.map((r, a) => ({
304
337
  ...r,
305
338
  align: o,
306
- isHeader: s === 0
339
+ isHeader: a === 0
307
340
  }));
308
341
  e.openNode(n), e.next(l), e.closeNode();
309
342
  }
@@ -321,14 +354,23 @@ const A = fe({
321
354
  }), e.openNode("table", void 0, { align: o }), e.next(t.content), e.closeNode();
322
355
  }
323
356
  }
324
- })), E = w("table_row", () => ({
325
- ...A.table_row,
357
+ }));
358
+ d(T.node, {
359
+ displayName: "NodeSchema<table>",
360
+ group: "Table"
361
+ });
362
+ d(T.ctx, {
363
+ displayName: "NodeSchemaCtx<table>",
364
+ group: "Table"
365
+ });
366
+ const S = k("table_row", () => ({
367
+ ...v.table_row,
326
368
  parseMarkdown: {
327
369
  match: (e) => e.type === "tableRow",
328
370
  runner: (e, t, n) => {
329
- const o = t.align, l = t.children.map((r, s) => ({
371
+ const o = t.align, l = t.children.map((r, a) => ({
330
372
  ...r,
331
- align: o[s],
373
+ align: o[a],
332
374
  isHeader: t.isHeader
333
375
  }));
334
376
  e.openNode(n), e.next(l), e.closeNode();
@@ -340,8 +382,17 @@ const A = fe({
340
382
  e.openNode("tableRow"), e.next(t.content), e.closeNode();
341
383
  }
342
384
  }
343
- })), O = w("table_cell", () => ({
344
- ...A.table_cell,
385
+ }));
386
+ d(S.node, {
387
+ displayName: "NodeSchema<tableRow>",
388
+ group: "Table"
389
+ });
390
+ d(S.ctx, {
391
+ displayName: "NodeSchemaCtx<tableRow>",
392
+ group: "Table"
393
+ });
394
+ const R = k("table_cell", () => ({
395
+ ...v.table_cell,
345
396
  parseMarkdown: {
346
397
  match: (e) => e.type === "tableCell" && !e.isHeader,
347
398
  runner: (e, t, n) => {
@@ -355,8 +406,17 @@ const A = fe({
355
406
  e.openNode("tableCell").next(t.content).closeNode();
356
407
  }
357
408
  }
358
- })), oe = w("table_header", () => ({
359
- ...A.table_header,
409
+ }));
410
+ d(R.node, {
411
+ displayName: "NodeSchema<tableCell>",
412
+ group: "Table"
413
+ });
414
+ d(R.ctx, {
415
+ displayName: "NodeSchemaCtx<tableCell>",
416
+ group: "Table"
417
+ });
418
+ const I = k("table_header", () => ({
419
+ ...v.table_header,
360
420
  parseMarkdown: {
361
421
  match: (e) => e.type === "tableCell" && !!e.isHeader,
362
422
  runner: (e, t, n) => {
@@ -370,87 +430,185 @@ const A = fe({
370
430
  e.openNode("tableCell"), e.next(t.content), e.closeNode();
371
431
  }
372
432
  }
373
- })), Oe = z(() => new K(
433
+ }));
434
+ d(I.node, {
435
+ displayName: "NodeSchema<tableHeader>",
436
+ group: "Table"
437
+ });
438
+ d(I.ctx, {
439
+ displayName: "NodeSchemaCtx<tableHeader>",
440
+ group: "Table"
441
+ });
442
+ const me = te(() => new Y(
374
443
  /^\|(?<col>\d+)[xX](?<row>\d+)\|\s$/,
375
444
  (e, t, n, o) => {
376
- var i, a;
445
+ var i, c;
377
446
  const l = e.doc.resolve(n);
378
- if (!l.node(-1).canReplaceWith(l.index(-1), l.indexAfter(-1), I.type()))
447
+ if (!l.node(-1).canReplaceWith(l.index(-1), l.indexAfter(-1), T.type()))
379
448
  return null;
380
- const r = q(
449
+ const r = re(
381
450
  Number((i = t.groups) == null ? void 0 : i.row),
382
- Number((a = t.groups) == null ? void 0 : a.col)
383
- ), s = e.tr.replaceRangeWith(n, o, r).scrollIntoView();
384
- return s.setSelection(de.create(s.doc, n + 3));
451
+ Number((c = t.groups) == null ? void 0 : c.col)
452
+ ), a = e.tr.replaceRangeWith(n, o, r).scrollIntoView();
453
+ return a.setSelection(Ee.create(a.doc, n + 3));
385
454
  }
386
- )), ne = p("GoToPrevTableCell", () => () => j(-1)), le = p("GoToNextTableCell", () => () => j(1)), re = p("BreakTable", () => () => (e, t) => {
387
- if (!y(e))
455
+ ));
456
+ d(me, {
457
+ displayName: "InputRule<insertTableInputRule>",
458
+ group: "Table"
459
+ });
460
+ const F = h("GoToPrevTableCell", () => () => ne(-1));
461
+ d(F, {
462
+ displayName: "Command<goToPrevTableCellCommand>",
463
+ group: "Table"
464
+ });
465
+ const W = h("GoToNextTableCell", () => () => ne(1));
466
+ d(W, {
467
+ displayName: "Command<goToNextTableCellCommand>",
468
+ group: "Table"
469
+ });
470
+ const z = h("BreakTable", () => () => (e, t) => {
471
+ if (!N(e))
388
472
  return !1;
389
- const { $head: n } = e.selection, o = n.after(), l = e.tr.replaceWith(o, o, W.type().createAndFill());
390
- return l.setSelection(G.near(l.doc.resolve(o), 1)).scrollIntoView(), t == null || t(l), !0;
391
- }), De = p("InsertTable", () => ({ row: e, col: t } = {}) => (n, o) => {
392
- const { selection: l, tr: r } = n, { from: s } = l, i = q(e, t), a = r.replaceSelectionWith(i), d = G.findFrom(a.doc.resolve(s), 1, !0);
393
- return d && (o == null || o(a.setSelection(d))), !0;
394
- }), Pe = p("MoveRow", () => ({ from: e, to: t } = {}) => (n, o) => {
395
- const { tr: l } = n, r = o == null ? void 0 : o(Ee(l, e ?? 0, t ?? 0, !0));
473
+ const { $head: n } = e.selection, o = n.after(), l = e.tr.replaceWith(o, o, Q.type().createAndFill());
474
+ return l.setSelection(oe.near(l.doc.resolve(o), 1)).scrollIntoView(), t == null || t(l), !0;
475
+ });
476
+ d(z, {
477
+ displayName: "Command<breakTableCommand>",
478
+ group: "Table"
479
+ });
480
+ const ue = h("InsertTable", () => ({ row: e, col: t } = {}) => (n, o) => {
481
+ 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);
482
+ return m && (o == null || o(c.setSelection(m))), !0;
483
+ });
484
+ d(ue, {
485
+ displayName: "Command<insertTableCommand>",
486
+ group: "Table"
487
+ });
488
+ const pe = h("MoveRow", () => ({ from: e, to: t } = {}) => (n, o) => {
489
+ const { tr: l } = n, r = o == null ? void 0 : o(ot(l, e ?? 0, t ?? 0, !0));
396
490
  return Boolean(r);
397
- }), Be = p("MoveCol", () => ({ from: e, to: t } = {}) => (n, o) => {
398
- const { tr: l } = n, r = o == null ? void 0 : o(Ie(l, e ?? 0, t ?? 0, !0));
491
+ });
492
+ d(pe, {
493
+ displayName: "Command<moveRowCommand>",
494
+ group: "Table"
495
+ });
496
+ const fe = h("MoveCol", () => ({ from: e, to: t } = {}) => (n, o) => {
497
+ const { tr: l } = n, r = o == null ? void 0 : o(tt(l, e ?? 0, t ?? 0, !0));
399
498
  return Boolean(r);
400
- }), Fe = p("SelectRow", () => (e = 0) => (t, n) => {
401
- const { tr: o } = t, l = n == null ? void 0 : n(Ne(e)(o));
499
+ });
500
+ d(fe, {
501
+ displayName: "Command<moveColCommand>",
502
+ group: "Table"
503
+ });
504
+ const he = h("SelectRow", () => (e = 0) => (t, n) => {
505
+ const { tr: o } = t, l = n == null ? void 0 : n(Je(e)(o));
402
506
  return Boolean(l);
403
- }), He = p("SelectCol", () => (e = 0) => (t, n) => {
404
- const { tr: o } = t, l = n == null ? void 0 : n(xe(e)(o));
507
+ });
508
+ d(he, {
509
+ displayName: "Command<selectRowCommand>",
510
+ group: "Table"
511
+ });
512
+ const ge = h("SelectCol", () => (e = 0) => (t, n) => {
513
+ const { tr: o } = t, l = n == null ? void 0 : n(Qe(e)(o));
405
514
  return Boolean(l);
406
- }), We = p("SelectTable", () => () => (e, t) => {
407
- const { tr: n } = e, o = t == null ? void 0 : t(ve(n));
515
+ });
516
+ d(ge, {
517
+ displayName: "Command<selectColCommand>",
518
+ group: "Table"
519
+ });
520
+ const be = h("SelectTable", () => () => (e, t) => {
521
+ const { tr: n } = e, o = t == null ? void 0 : t(qe(n));
408
522
  return Boolean(o);
409
- }), Ke = p("DeleteSelectedCells", () => () => (e, t) => {
523
+ });
524
+ d(be, {
525
+ displayName: "Command<selectTableCommand>",
526
+ group: "Table"
527
+ });
528
+ const Ce = h("DeleteSelectedCells", () => () => (e, t) => {
410
529
  const { selection: n } = e;
411
- if (!(n instanceof C))
530
+ if (!(n instanceof y))
412
531
  return !1;
413
532
  const o = n.isRowSelection(), l = n.isColSelection();
414
- return o && l ? pe(e, t) : l ? he(e, t) : ge(e, t);
415
- }), Le = p("AddColBefore", () => () => be), ze = p("AddColAfter", () => () => Ce), Ge = p("AddRowBefore", () => () => (e, t) => {
416
- if (!y(e))
533
+ return o && l ? Ke(e, t) : l ? He(e, t) : Le(e, t);
534
+ });
535
+ d(Ce, {
536
+ displayName: "Command<deleteSelectedCellsCommand>",
537
+ group: "Table"
538
+ });
539
+ const ye = h("AddColBefore", () => () => Fe);
540
+ d(ye, {
541
+ displayName: "Command<addColBeforeCommand>",
542
+ group: "Table"
543
+ });
544
+ const ke = h("AddColAfter", () => () => We);
545
+ d(ke, {
546
+ displayName: "Command<addColAfterCommand>",
547
+ group: "Table"
548
+ });
549
+ const we = h("AddRowBefore", () => () => (e, t) => {
550
+ if (!N(e))
417
551
  return !1;
418
552
  if (t) {
419
- const n = V(e);
420
- t(J(e.tr, n, n.top));
553
+ const n = le(e);
554
+ t(ae(e.tr, n, n.top));
421
555
  }
422
556
  return !0;
423
- }), je = p("AddRowAfter", () => () => (e, t) => {
424
- if (!y(e))
557
+ });
558
+ d(we, {
559
+ displayName: "Command<addRowBeforeCommand>",
560
+ group: "Table"
561
+ });
562
+ const Ne = h("AddRowAfter", () => () => (e, t) => {
563
+ if (!N(e))
425
564
  return !1;
426
565
  if (t) {
427
- const n = V(e);
428
- t(J(e.tr, n, n.bottom));
566
+ const n = le(e);
567
+ t(ae(e.tr, n, n.bottom));
429
568
  }
430
569
  return !0;
431
- }), Ve = p("SetAlign", () => (e = "left") => we("alignment", e)), Ze = L("tableKeymap", {
570
+ });
571
+ d(Ne, {
572
+ displayName: "Command<addRowAfterCommand>",
573
+ group: "Table"
574
+ });
575
+ const Te = h("SetAlign", () => (e = "left") => ze("alignment", e));
576
+ d(Te, {
577
+ displayName: "Command<setAlignCommand>",
578
+ group: "Table"
579
+ });
580
+ const G = ee("tableKeymap", {
432
581
  NextCell: {
433
582
  shortcuts: ["Mod-]", "Tab"],
434
583
  command: (e) => {
435
- const t = e.get(S);
436
- return () => t.call(le.key);
584
+ const t = e.get(A);
585
+ return () => t.call(W.key);
437
586
  }
438
587
  },
439
588
  PrevCell: {
440
589
  shortcuts: ["Mod-[", "Shift-Tab"],
441
590
  command: (e) => {
442
- const t = e.get(S);
443
- return () => t.call(ne.key);
591
+ const t = e.get(A);
592
+ return () => t.call(F.key);
444
593
  }
445
594
  },
446
595
  ExitTable: {
447
596
  shortcuts: ["Mod-Enter"],
448
597
  command: (e) => {
449
- const t = e.get(S);
450
- return () => t.call(re.key);
598
+ const t = e.get(A);
599
+ return () => t.call(z.key);
451
600
  }
452
601
  }
453
- }), N = "footnote_definition", H = "footnoteDefinition", Ue = w("footnote_definition", () => ({
602
+ });
603
+ d(G.ctx, {
604
+ displayName: "KeymapCtx<table>",
605
+ group: "Table"
606
+ });
607
+ d(G.shortcuts, {
608
+ displayName: "Keymap<table>",
609
+ group: "Table"
610
+ });
611
+ const E = "footnote_definition", J = "footnoteDefinition", j = k("footnote_definition", () => ({
454
612
  group: "block",
455
613
  content: "block+",
456
614
  defining: !0,
@@ -461,10 +619,10 @@ const A = fe({
461
619
  },
462
620
  parseDOM: [
463
621
  {
464
- tag: `dl[data-type="${N}"]`,
622
+ tag: `dl[data-type="${E}"]`,
465
623
  getAttrs: (e) => {
466
624
  if (!(e instanceof HTMLElement))
467
- throw $(e);
625
+ throw O(e);
468
626
  return {
469
627
  label: e.dataset.label
470
628
  };
@@ -478,14 +636,14 @@ const A = fe({
478
636
  "dl",
479
637
  {
480
638
  "data-label": t,
481
- "data-type": N
639
+ "data-type": E
482
640
  },
483
641
  ["dt", t],
484
642
  ["dd", 0]
485
643
  ];
486
644
  },
487
645
  parseMarkdown: {
488
- match: ({ type: e }) => e === H,
646
+ match: ({ type: e }) => e === J,
489
647
  runner: (e, t, n) => {
490
648
  e.openNode(n, {
491
649
  label: t.label
@@ -493,15 +651,24 @@ const A = fe({
493
651
  }
494
652
  },
495
653
  toMarkdown: {
496
- match: (e) => e.type.name === N,
654
+ match: (e) => e.type.name === E,
497
655
  runner: (e, t) => {
498
- e.openNode(H, void 0, {
656
+ e.openNode(J, void 0, {
499
657
  label: t.attrs.label,
500
658
  identifier: t.attrs.label
501
659
  }).next(t.content).closeNode();
502
660
  }
503
661
  }
504
- })), x = "footnote_reference", Xe = w("footnote_reference", () => ({
662
+ }));
663
+ d(j.ctx, {
664
+ displayName: "NodeSchemaCtx<footnodeDef>",
665
+ group: "footnote"
666
+ });
667
+ d(j.node, {
668
+ displayName: "NodeSchema<footnodeDef>",
669
+ group: "footnote"
670
+ });
671
+ const D = "footnote_reference", Z = k("footnote_reference", () => ({
505
672
  group: "inline",
506
673
  inline: !0,
507
674
  atom: !0,
@@ -512,10 +679,10 @@ const A = fe({
512
679
  },
513
680
  parseDOM: [
514
681
  {
515
- tag: `sup[data-type="${x}"]`,
682
+ tag: `sup[data-type="${D}"]`,
516
683
  getAttrs: (e) => {
517
684
  if (!(e instanceof HTMLElement))
518
- throw $(e);
685
+ throw O(e);
519
686
  return {
520
687
  label: e.dataset.label
521
688
  };
@@ -528,7 +695,7 @@ const A = fe({
528
695
  "sup",
529
696
  {
530
697
  "data-label": t,
531
- "data-type": x
698
+ "data-type": D
532
699
  },
533
700
  t
534
701
  ];
@@ -542,7 +709,7 @@ const A = fe({
542
709
  }
543
710
  },
544
711
  toMarkdown: {
545
- match: (e) => e.type.name === x,
712
+ match: (e) => e.type.name === D,
546
713
  runner: (e, t) => {
547
714
  e.addNode("footnoteReference", void 0, void 0, {
548
715
  label: t.attrs.label,
@@ -550,7 +717,16 @@ const A = fe({
550
717
  });
551
718
  }
552
719
  }
553
- })), qe = se.extendSchema((e) => (t) => {
720
+ }));
721
+ d(Z.ctx, {
722
+ displayName: "NodeSchemaCtx<footnodeRef>",
723
+ group: "footnote"
724
+ });
725
+ d(Z.node, {
726
+ displayName: "NodeSchema<footnodeRef>",
727
+ group: "footnote"
728
+ });
729
+ const Se = Ie.extendSchema((e) => (t) => {
554
730
  const n = e(t);
555
731
  return {
556
732
  ...n,
@@ -565,7 +741,7 @@ const A = fe({
565
741
  tag: 'li[data-item-type="task"]',
566
742
  getAttrs: (o) => {
567
743
  if (!(o instanceof HTMLElement))
568
- throw $(o);
744
+ throw O(o);
569
745
  return {
570
746
  label: o.dataset.label,
571
747
  listType: o.dataset["list-type"],
@@ -594,8 +770,8 @@ const A = fe({
594
770
  n.parseMarkdown.runner(o, l, r);
595
771
  return;
596
772
  }
597
- const s = l.label != null ? `${l.label}.` : "•", i = l.checked != null ? Boolean(l.checked) : null, a = l.label != null ? "ordered" : "bullet", d = l.spread != null ? `${l.spread}` : "true";
598
- o.openNode(r, { label: s, listType: a, spread: d, checked: i }), o.next(l.children), o.closeNode();
773
+ const a = l.label != null ? `${l.label}.` : "•", i = l.checked != null ? Boolean(l.checked) : null, c = l.label != null ? "ordered" : "bullet", m = l.spread != null ? `${l.spread}` : "true";
774
+ o.openNode(r, { label: a, listType: c, spread: m, checked: i }), o.next(l.children), o.closeNode();
599
775
  }
600
776
  },
601
777
  toMarkdown: {
@@ -605,124 +781,154 @@ const A = fe({
605
781
  n.toMarkdown.runner(o, l);
606
782
  return;
607
783
  }
608
- const r = l.attrs.label, s = l.attrs.listType, i = l.attrs.spread === "true", a = l.attrs.checked;
609
- o.openNode("listItem", void 0, { label: r, listType: s, spread: i, checked: a }), o.next(l.content), o.closeNode();
784
+ const r = l.attrs.label, a = l.attrs.listType, i = l.attrs.spread === "true", c = l.attrs.checked;
785
+ o.openNode("listItem", void 0, { label: r, listType: a, spread: i, checked: c }), o.next(l.content), o.closeNode();
610
786
  }
611
787
  }
612
788
  };
613
- }), Je = z(() => new K(/^\[(?<checked>\s|x)\]\s$/, (e, t, n, o) => {
614
- var c;
789
+ });
790
+ d(Se, {
791
+ displayName: "NodeSchema<listItem>",
792
+ group: "ListItem"
793
+ });
794
+ const Re = te(() => new Y(/^\[(?<checked>\s|x)\]\s$/, (e, t, n, o) => {
795
+ var s;
615
796
  const l = e.doc.resolve(n);
616
- let r = 0, s = l.node(r);
617
- for (; s && s.type.name !== "list_item"; )
618
- r--, s = l.node(r);
619
- if (!s || s.attrs.checked != null)
797
+ let r = 0, a = l.node(r);
798
+ for (; a && a.type.name !== "list_item"; )
799
+ r--, a = l.node(r);
800
+ if (!a || a.attrs.checked != null)
620
801
  return null;
621
- const i = Boolean(((c = t.groups) == null ? void 0 : c.checked) === "x"), a = l.before(r), d = e.tr;
622
- return d.deleteRange(n, o).setNodeMarkup(a, void 0, { ...s.attrs, checked: i }), d;
623
- })), Qe = [
624
- Me,
625
- Ze
626
- ].flat(), Ye = [
627
- Oe,
628
- Je
629
- ], et = _(() => {
630
- const e = new ue("MILKDOWN_AUTO_INSERT_ZERO_SPACE"), t = (o) => o.type === W.type(), n = (o) => t(o) && o.nodeSize === 2;
631
- return new me({
802
+ const i = Boolean(((s = t.groups) == null ? void 0 : s.checked) === "x"), c = l.before(r), m = e.tr;
803
+ return m.deleteRange(n, o).setNodeMarkup(c, void 0, { ...a.attrs, checked: i }), m;
804
+ }));
805
+ d(Re, {
806
+ displayName: "InputRule<wrapInTaskListInputRule>",
807
+ group: "ListItem"
808
+ });
809
+ const nt = [
810
+ L,
811
+ G
812
+ ].flat(), lt = [
813
+ me,
814
+ Re
815
+ ], Ae = B(() => {
816
+ const e = new De("MILKDOWN_AUTO_INSERT_ZERO_SPACE"), t = (o) => o.type === Q.type(), n = (o) => t(o) && o.nodeSize === 2;
817
+ return new Oe({
632
818
  key: e,
633
819
  props: {
634
820
  handleDOMEvents: {
635
821
  compositionstart(o) {
636
- const { state: l, dispatch: r } = o, { tr: s, selection: i } = l, { $from: a } = i;
637
- return D.safari && y(l) && i.empty && n(a.parent) && r(s.insertText("⁠", a.start())), !1;
822
+ const { state: l, dispatch: r } = o, { tr: a, selection: i } = l, { $from: c } = i;
823
+ return V.safari && N(l) && i.empty && n(c.parent) && r(a.insertText("⁠", c.start())), !1;
638
824
  },
639
825
  compositionend(o) {
640
- const { state: l, dispatch: r } = o, { tr: s, selection: i } = l, { $from: a } = i;
641
- return D.safari && y(l) && i.empty && t(a.parent) && a.parent.textContent.startsWith("⁠") && r(s.delete(a.start(), a.start() + 1)), !1;
826
+ const { state: l, dispatch: r } = o, { tr: a, selection: i } = l, { $from: c } = i;
827
+ return V.safari && N(l) && i.empty && t(c.parent) && c.parent.textContent.startsWith("⁠") && r(a.delete(c.start(), c.start() + 1)), !1;
642
828
  }
643
829
  }
644
830
  }
645
831
  });
646
- }), tt = _(() => ke({})), ot = _(() => ye()), nt = ie(() => Ae), lt = [
647
- et,
648
- tt,
649
- ot,
650
- nt
651
- ], rt = [
652
- qe,
832
+ });
833
+ d(Ae, {
834
+ displayName: "Prose<autoInsertZeroSpaceInTablePlugin>",
835
+ group: "Prose"
836
+ });
837
+ const Me = B(() => Ge({}));
838
+ d(Me, {
839
+ displayName: "Prose<columnResizingPlugin>",
840
+ group: "Prose"
841
+ });
842
+ const xe = B(() => je());
843
+ d(xe, {
844
+ displayName: "Prose<tableEditingPlugin>",
845
+ group: "Prose"
846
+ });
847
+ const ve = Pe(() => Ue);
848
+ d(ve, {
849
+ displayName: "Remark<remarkGFMPlugin>",
850
+ group: "Remark"
851
+ });
852
+ const rt = [
853
+ Ae,
854
+ Me,
855
+ xe,
856
+ ve
857
+ ], at = [
858
+ Se,
859
+ T,
860
+ S,
653
861
  I,
654
- E,
655
- oe,
656
- O,
657
- Ue,
658
- Xe,
862
+ R,
863
+ j,
659
864
  Z,
660
- U
865
+ K,
866
+ x
661
867
  ].flat(), st = [
662
- le,
663
- ne,
664
- re,
665
- De,
666
- Pe,
667
- Be,
668
- Fe,
669
- He,
670
- We,
671
- Ke,
672
- Ge,
673
- je,
674
- Le,
675
- ze,
676
- Ve,
677
- X
678
- ], bt = [rt, Ye, Qe, lt, st].flat();
868
+ W,
869
+ F,
870
+ z,
871
+ ue,
872
+ pe,
873
+ fe,
874
+ he,
875
+ ge,
876
+ be,
877
+ Ce,
878
+ we,
879
+ Ne,
880
+ ye,
881
+ ke,
882
+ Te,
883
+ H
884
+ ], Ct = [at, lt, nt, rt, st].flat();
679
885
  export {
680
- ze as addColAfterCommand,
681
- Le as addColBeforeCommand,
682
- je as addRowAfterCommand,
683
- Ge as addRowBeforeCommand,
684
- J as addRowWithAlignment,
685
- re as breakTableCommand,
886
+ ke as addColAfterCommand,
887
+ ye as addColBeforeCommand,
888
+ Ne as addRowAfterCommand,
889
+ we as addRowBeforeCommand,
890
+ ae as addRowWithAlignment,
891
+ z as breakTableCommand,
686
892
  st as commands,
687
- q as createTable,
688
- Ke as deleteSelectedCellsCommand,
689
- qe as extendListItemSchemaForTask,
690
- k as findTable,
691
- Ue as footnoteDefinitionSchema,
692
- Xe as footnoteReferenceSchema,
693
- Re as getAllCellsInTable,
694
- g as getCellsInCol,
695
- b as getCellsInRow,
696
- bt as gfm,
697
- le as goToNextTableCellCommand,
698
- ne as goToPrevTableCellCommand,
699
- Ye as inputrules,
700
- De as insertTableCommand,
701
- Oe as insertTableInputRule,
702
- Qe as keymap,
703
- Ie as moveCol,
704
- Be as moveColCommand,
705
- Ee as moveRow,
706
- Pe as moveRowCommand,
707
- lt as plugins,
708
- rt as schema,
709
- xe as selectCol,
710
- He as selectColCommand,
711
- Q as selectLine,
712
- Ne as selectRow,
713
- Fe as selectRowCommand,
714
- ve as selectTable,
715
- We as selectTableCommand,
716
- Ve as setAlignCommand,
717
- Z as strikethroughAttr,
718
- Me as strikethroughKeymap,
719
- U as strikethroughSchema,
720
- O as tableCellSchema,
721
- oe as tableHeaderSchema,
722
- Ze as tableKeymap,
723
- E as tableRowSchema,
724
- I as tableSchema,
725
- X as toggleStrikethroughCommand,
726
- Je as wrapInTaskListInputRule
893
+ re as createTable,
894
+ Ce as deleteSelectedCellsCommand,
895
+ Se as extendListItemSchemaForTask,
896
+ w as findTable,
897
+ j as footnoteDefinitionSchema,
898
+ Z as footnoteReferenceSchema,
899
+ Xe as getAllCellsInTable,
900
+ b as getCellsInCol,
901
+ C as getCellsInRow,
902
+ Ct as gfm,
903
+ W as goToNextTableCellCommand,
904
+ F as goToPrevTableCellCommand,
905
+ lt as inputrules,
906
+ ue as insertTableCommand,
907
+ me as insertTableInputRule,
908
+ nt as keymap,
909
+ tt as moveCol,
910
+ fe as moveColCommand,
911
+ ot as moveRow,
912
+ pe as moveRowCommand,
913
+ rt as plugins,
914
+ at as schema,
915
+ Qe as selectCol,
916
+ ge as selectColCommand,
917
+ se as selectLine,
918
+ Je as selectRow,
919
+ he as selectRowCommand,
920
+ qe as selectTable,
921
+ be as selectTableCommand,
922
+ Te as setAlignCommand,
923
+ K as strikethroughAttr,
924
+ L as strikethroughKeymap,
925
+ x as strikethroughSchema,
926
+ R as tableCellSchema,
927
+ I as tableHeaderSchema,
928
+ G as tableKeymap,
929
+ S as tableRowSchema,
930
+ T as tableSchema,
931
+ H as toggleStrikethroughCommand,
932
+ Re as wrapInTaskListInputRule
727
933
  };
728
934
  //# sourceMappingURL=index.es.js.map