editate 0.0.0 → 0.6.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/LICENSE +1 -1
- package/README.md +257 -1
- package/lib/commands.d.ts +42 -0
- package/lib/doc/edit.d.ts +37 -0
- package/lib/doc/position.d.ts +1 -0
- package/lib/doc/types.d.ts +31 -0
- package/lib/doc/utils.d.ts +1 -0
- package/lib/dom/default.d.ts +1 -0
- package/lib/dom/index.d.ts +2 -0
- package/lib/dom/mutation.d.ts +1 -0
- package/lib/dom/parser.d.ts +1 -0
- package/lib/editor.d.ts +103 -0
- package/lib/index.cjs +866 -0
- package/lib/index.cjs.map +1 -0
- package/lib/index.d.ts +6 -0
- package/lib/index.js +890 -3
- package/lib/index.js.map +1 -0
- package/lib/keyboard.d.ts +6 -0
- package/lib/plugins/debug.d.ts +2 -0
- package/lib/plugins/history.d.ts +1 -0
- package/lib/plugins/index.d.ts +4 -0
- package/lib/plugins/keymap.d.ts +3 -0
- package/lib/plugins/singleline.d.ts +5 -0
- package/lib/plugins/transfer/fileTransfer.d.ts +6 -0
- package/lib/plugins/transfer/htmlTransfer.d.ts +9 -0
- package/lib/plugins/transfer/index.d.ts +4 -0
- package/lib/plugins/transfer/internalTransfer.d.ts +5 -0
- package/lib/plugins/transfer/plainTransfer.d.ts +8 -0
- package/lib/presets/index.d.ts +2 -0
- package/lib/presets/plain.d.ts +27 -0
- package/lib/utils.d.ts +1 -0
- package/package.json +85 -11
- package/lib/index.mjs +0 -3
package/lib/index.js
CHANGED
|
@@ -1,5 +1,892 @@
|
|
|
1
|
-
|
|
1
|
+
const t = ([t, e]) => t > e ? [ e, t ] : [ t, e ], e = ([t, e]) => t === e, n = Math.min, {keys: r, is: o} = Object, c = t => "string" == typeof t, s = t => "function" == typeof t, i = s(queueMicrotask) ? queueMicrotask : t => {
|
|
2
|
+
Promise.resolve().then(t);
|
|
3
|
+
}, a = (t, e = t => h(t) ? t.text : "") => t.children.reduce((t, n, r) => {
|
|
4
|
+
const o = g(n);
|
|
5
|
+
return 0 !== r && o && (t += "\n"), t + (o ? n.children.reduce((t, n) => t + e(n), "") : "");
|
|
6
|
+
}, ""), l = (t, e, n) => t.split("\n").map(t => ({
|
|
7
|
+
...n,
|
|
8
|
+
children: [ {
|
|
9
|
+
...e,
|
|
10
|
+
text: t
|
|
11
|
+
} ]
|
|
12
|
+
})), f = "delete", u = "insert_text", d = "insert_node", p = "set_attr", y = "set_node_attr", h = t => "text" in t, g = t => "children" in t, k = (t, e) => {
|
|
13
|
+
const n = r(t);
|
|
14
|
+
return n.length === r(e).length && n.every(n => n in e && ("text" === n || o(t[n], e[n])));
|
|
15
|
+
}, x = new WeakMap, _ = ({children: t}, e = 0, n = t.length) => {
|
|
16
|
+
let r = 0, o = 0;
|
|
17
|
+
for (let c = e; c < n; c++) {
|
|
18
|
+
const e = t[c];
|
|
19
|
+
r += b(e), 0 !== o && g(e) && r++, o++;
|
|
20
|
+
}
|
|
21
|
+
return r;
|
|
22
|
+
}, b = t => {
|
|
23
|
+
if (g(t)) {
|
|
24
|
+
let e = x.get(t);
|
|
25
|
+
return null == e && x.set(t, e = _(t)), e;
|
|
26
|
+
}
|
|
27
|
+
return h(t) ? t.text.length : 1;
|
|
28
|
+
}, m = (t, [e, n]) => {
|
|
29
|
+
let r = 0;
|
|
30
|
+
for (const n of e) r += _(t, 0, n), 0 !== n && r++, t = t.children[n];
|
|
31
|
+
return r + n;
|
|
32
|
+
}, w = (t, e) => {
|
|
33
|
+
const n = [];
|
|
34
|
+
for (;t; ) {
|
|
35
|
+
const r = A(t, e);
|
|
36
|
+
if (!r) break;
|
|
37
|
+
const o = r.t, c = r.o;
|
|
38
|
+
if (!g(c)) break;
|
|
39
|
+
e = r.i, n.push(o), t = c;
|
|
40
|
+
}
|
|
41
|
+
return [ n, e ];
|
|
42
|
+
}, v = (t, [e, n]) => [ m(t, e), m(t, n) ], M = (t, [e, n]) => [ w(t, e), w(t, n) ], S = (t, e = 0, n = t.length - 1) => {
|
|
43
|
+
let r = e + 1;
|
|
44
|
+
for (;r <= n; ) {
|
|
45
|
+
const e = t[r - 1], o = t[r];
|
|
46
|
+
h(e) && h(o) && k(e, o) ? (t[r - 1] = {
|
|
47
|
+
...e,
|
|
48
|
+
text: e.text + o.text
|
|
49
|
+
}, t.splice(r, 1), n--) : r++;
|
|
50
|
+
}
|
|
51
|
+
for (r = e; r <= n; ) {
|
|
52
|
+
const e = t[r];
|
|
53
|
+
h(e) && !e.text && t.length > 1 ? (t.splice(r, 1), n--) : r++;
|
|
54
|
+
}
|
|
55
|
+
}, D = (t, e = 0, n = t.length - 1) => {
|
|
56
|
+
let r = e + 1;
|
|
57
|
+
for (;r <= n; ) {
|
|
58
|
+
const e = t[r - 1], o = t[r];
|
|
59
|
+
t[r - 1] = O(e, o), t.splice(r, 1), n--;
|
|
60
|
+
}
|
|
61
|
+
}, E = (t, e, n) => {
|
|
62
|
+
if (e.length) {
|
|
63
|
+
const r = t.length;
|
|
64
|
+
t.push(...e), r && n(t, r - 1, r);
|
|
65
|
+
}
|
|
66
|
+
}, O = (...t) => ({
|
|
67
|
+
...t[0],
|
|
68
|
+
children: t.reduce((t, e) => (E(t, e.children, S), t), [])
|
|
69
|
+
}), A = ({children: t}, e) => {
|
|
70
|
+
for (let n = 0; n < t.length; n++) {
|
|
71
|
+
const r = t[n];
|
|
72
|
+
let o = b(r);
|
|
73
|
+
if (g(r) && o++, o > e) return {
|
|
74
|
+
o: r,
|
|
75
|
+
t: n,
|
|
76
|
+
i: e
|
|
77
|
+
};
|
|
78
|
+
e -= o;
|
|
79
|
+
}
|
|
80
|
+
return null;
|
|
81
|
+
}, I = (t, e) => {
|
|
82
|
+
const n = t.children, r = A(t, e);
|
|
83
|
+
if (r) {
|
|
84
|
+
const {o: e, i: o, t: c} = r;
|
|
85
|
+
if (g(e)) {
|
|
86
|
+
const [r, s] = I(e, o), i = n.slice(0, c), a = n.slice(c + 1);
|
|
87
|
+
return i.push(r), a.unshift(s), [ {
|
|
88
|
+
...t,
|
|
89
|
+
children: i
|
|
90
|
+
}, {
|
|
91
|
+
...t,
|
|
92
|
+
children: a
|
|
93
|
+
} ];
|
|
94
|
+
}
|
|
95
|
+
{
|
|
96
|
+
const r = n.slice(0, c), s = n.slice(c + 1);
|
|
97
|
+
if (h(e)) {
|
|
98
|
+
const t = e.text.slice(0, o), n = e.text.slice(o);
|
|
99
|
+
!t && r.length || r.push({
|
|
100
|
+
...e,
|
|
101
|
+
text: t
|
|
102
|
+
}), !n && s.length || s.unshift({
|
|
103
|
+
...e,
|
|
104
|
+
text: n
|
|
105
|
+
});
|
|
106
|
+
} else s.unshift(e);
|
|
107
|
+
return [ {
|
|
108
|
+
...t,
|
|
109
|
+
children: r
|
|
110
|
+
}, {
|
|
111
|
+
...t,
|
|
112
|
+
children: s
|
|
113
|
+
} ];
|
|
114
|
+
}
|
|
115
|
+
}
|
|
116
|
+
return [ t, {
|
|
117
|
+
...t,
|
|
118
|
+
children: []
|
|
119
|
+
} ];
|
|
120
|
+
}, P = (t, e) => {
|
|
121
|
+
for (let n = 0; n < e.length; n++) t = t.children[e[n]];
|
|
122
|
+
return t;
|
|
123
|
+
}, C = (t, e, n, r = 0) => {
|
|
124
|
+
if (r < e.length) {
|
|
125
|
+
const o = e[r];
|
|
126
|
+
return ((t, e, n, r) => {
|
|
127
|
+
const o = t.children.slice();
|
|
128
|
+
return o.splice(e, n - e + 1, ...r), {
|
|
129
|
+
...t,
|
|
130
|
+
children: o
|
|
131
|
+
};
|
|
132
|
+
})(t, o, o, [ C(t.children[o], e, n, r + 1) ]);
|
|
133
|
+
}
|
|
134
|
+
return n;
|
|
135
|
+
}, H = (t, e, n, r) => {
|
|
136
|
+
const [o, c] = I(t, e), s = e < n ? I(t, n)[1] : c, i = o.children.slice();
|
|
137
|
+
return E(i, r, D), E(i, s.children, D), {
|
|
138
|
+
...t,
|
|
139
|
+
children: i
|
|
140
|
+
};
|
|
141
|
+
}, R = (t, e, n) => e >= n ? [] : I(I(t, n)[0], e)[1].children, B = (t, e) => e >= 0 && e <= b(t), V = (t, e) => e.reduce((t, e) => F(t, e), t), F = (t, e) => {
|
|
142
|
+
switch (e.type) {
|
|
143
|
+
case f:
|
|
144
|
+
{
|
|
145
|
+
const [n, r] = e.range;
|
|
146
|
+
if (t >= n) return r >= t ? n : t + n - r;
|
|
147
|
+
break;
|
|
148
|
+
}
|
|
2
149
|
|
|
3
|
-
|
|
150
|
+
case u:
|
|
151
|
+
{
|
|
152
|
+
const {at: n, text: r} = e;
|
|
153
|
+
if (t >= n) return t + r.length;
|
|
154
|
+
break;
|
|
155
|
+
}
|
|
4
156
|
|
|
5
|
-
|
|
157
|
+
case d:
|
|
158
|
+
{
|
|
159
|
+
const {at: n, fragment: r} = e;
|
|
160
|
+
if (t >= n) return t + b({
|
|
161
|
+
children: r
|
|
162
|
+
});
|
|
163
|
+
break;
|
|
164
|
+
}
|
|
165
|
+
}
|
|
166
|
+
return t;
|
|
167
|
+
}, L = ([t, e], n) => [ F(t, n), F(e, n) ];
|
|
168
|
+
|
|
169
|
+
function N(e, n = t(e.selection)) {
|
|
170
|
+
e.apply({
|
|
171
|
+
type: "delete",
|
|
172
|
+
range: n
|
|
173
|
+
});
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
function T(t, e, n = t.selection[0]) {
|
|
177
|
+
t.apply({
|
|
178
|
+
type: "insert_text",
|
|
179
|
+
at: n,
|
|
180
|
+
text: e
|
|
181
|
+
});
|
|
182
|
+
}
|
|
183
|
+
|
|
184
|
+
function q(t, e, n = t.selection[0]) {
|
|
185
|
+
t.apply({
|
|
186
|
+
type: "insert_node",
|
|
187
|
+
at: n,
|
|
188
|
+
fragment: [ {
|
|
189
|
+
children: [ e ]
|
|
190
|
+
} ]
|
|
191
|
+
});
|
|
192
|
+
}
|
|
193
|
+
|
|
194
|
+
function J(e, n) {
|
|
195
|
+
const r = t(e.selection);
|
|
196
|
+
e.apply({
|
|
197
|
+
type: "delete",
|
|
198
|
+
range: r
|
|
199
|
+
}).apply({
|
|
200
|
+
type: "insert_text",
|
|
201
|
+
at: r[0],
|
|
202
|
+
text: n
|
|
203
|
+
});
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
function U(t, e) {
|
|
207
|
+
t.apply({
|
|
208
|
+
type: "delete",
|
|
209
|
+
range: [ 0, b(t.doc) ]
|
|
210
|
+
}).apply({
|
|
211
|
+
type: "insert_node",
|
|
212
|
+
at: 0,
|
|
213
|
+
fragment: e
|
|
214
|
+
});
|
|
215
|
+
}
|
|
216
|
+
|
|
217
|
+
function G(e, n, r, o = t(e.selection)) {
|
|
218
|
+
e.apply({
|
|
219
|
+
type: "set_attr",
|
|
220
|
+
range: o,
|
|
221
|
+
key: n,
|
|
222
|
+
value: r
|
|
223
|
+
});
|
|
224
|
+
}
|
|
225
|
+
|
|
226
|
+
function W(e, n, r = t(e.selection)) {
|
|
227
|
+
const o = R(e.doc, ...r).flatMap(t => t.children.filter(h));
|
|
228
|
+
o.length && e.apply({
|
|
229
|
+
type: "set_attr",
|
|
230
|
+
range: r,
|
|
231
|
+
key: n,
|
|
232
|
+
value: !!o.some(t => !t[n])
|
|
233
|
+
});
|
|
234
|
+
}
|
|
235
|
+
|
|
236
|
+
function Z(t, e, n, r = w(t.doc, t.selection[0])[0]) {
|
|
237
|
+
t.apply({
|
|
238
|
+
type: "set_node_attr",
|
|
239
|
+
path: r,
|
|
240
|
+
key: e,
|
|
241
|
+
value: n
|
|
242
|
+
});
|
|
243
|
+
}
|
|
244
|
+
|
|
245
|
+
function j(t, e, n, r, o = w(t.doc, t.selection[0])[0]) {
|
|
246
|
+
const c = P(t.doc, o);
|
|
247
|
+
t.apply({
|
|
248
|
+
type: "set_node_attr",
|
|
249
|
+
path: o,
|
|
250
|
+
key: e,
|
|
251
|
+
value: c[e] === n ? r : n
|
|
252
|
+
});
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
let z = null, X = null, Y = null, K = null, Q = null;
|
|
256
|
+
|
|
257
|
+
const $ = t => 1 === t.nodeType, tt = t => 8 === t.nodeType, et = () => X, nt = () => {
|
|
258
|
+
const t = rt();
|
|
259
|
+
return 1 === t ? X.data.length : 2 === t ? 1 : 0;
|
|
260
|
+
}, rt = () => {
|
|
261
|
+
if (null != Y) return Y;
|
|
262
|
+
if (X) if ((t => 3 === t.nodeType)(X)) {
|
|
263
|
+
const t = X.data;
|
|
264
|
+
if (t) return Y = "\n" === t ? it() ? 3 : 6 : 1;
|
|
265
|
+
} else if ($(X)) {
|
|
266
|
+
if ("BR" === X.tagName) return Y = it() ? 3 : 5;
|
|
267
|
+
if (K.l(X)) return Y = 2;
|
|
268
|
+
if (K.u(X)) return Y = 4;
|
|
269
|
+
}
|
|
270
|
+
return Y = 0;
|
|
271
|
+
}, ot = () => (Y = null, X = z.nextNode()), ct = () => {
|
|
272
|
+
for (;(Y = null) || (X = z.nextSibling()); ) if (4 === rt()) return;
|
|
273
|
+
}, st = () => {
|
|
274
|
+
for (;(Y = null) || (X = z.parentNode()); ) if (4 === rt()) return;
|
|
275
|
+
}, it = () => {
|
|
276
|
+
const t = X.parentNode;
|
|
277
|
+
return Q(() => {
|
|
278
|
+
for (;ot(); ) {
|
|
279
|
+
if (rt()) return !0;
|
|
280
|
+
if (!t.contains(X)) break;
|
|
281
|
+
}
|
|
282
|
+
return !1;
|
|
283
|
+
});
|
|
284
|
+
}, at = () => {
|
|
285
|
+
for (;;) {
|
|
286
|
+
if (2 === rt()) {
|
|
287
|
+
const t = X;
|
|
288
|
+
for (;ot() && t.contains(X); ) ;
|
|
289
|
+
} else ot();
|
|
290
|
+
if (!X) break;
|
|
291
|
+
const t = rt();
|
|
292
|
+
if (t) return t;
|
|
293
|
+
}
|
|
294
|
+
}, lt = new Set([ "DIV", "H1", "H2", "H3", "H4", "H5", "H6", "P", "PRE", "LI", "DT", "DD", "TR" ]), ft = t => lt.has(t.tagName), ut = new Set([ "EMBED", "IMG", "PICTURE", "AUDIO", "VIDEO", "SVG", "CANVAS", "MATH", "IFRAME", "OBJECT" ]), dt = t => "false" === t.contentEditable || ut.has(t.tagName), pt = (t, e) => t.compareDocumentPosition(e), yt = t => t.ownerDocument, ht = t => yt(t).getSelection(), gt = (t, e) => {
|
|
295
|
+
if (t.rangeCount) {
|
|
296
|
+
const n = t.getRangeAt(0);
|
|
297
|
+
if (e.contains(n.commonAncestorContainer)) return n;
|
|
298
|
+
}
|
|
299
|
+
}, kt = (t, e, n, r) => {
|
|
300
|
+
const o = ht(t);
|
|
301
|
+
(n || gt(o, t)) && (o.removeAllRanges(), o.addRange(e), r && (o.collapseToEnd(),
|
|
302
|
+
o.extend(e.startContainer, e.startOffset)));
|
|
303
|
+
}, xt = (t, e, [n, r], o, c, s) => {
|
|
304
|
+
const i = 0 === o, a = o > 0, l = a ? r : n, f = a ? n : r;
|
|
305
|
+
if (0 === l[0].length && 0 === l[1] && i && !e.hasChildNodes()) {
|
|
306
|
+
const n = t.createRange();
|
|
307
|
+
return n.setStart(e, 0), n.setEnd(e, 0), kt(e, n, s);
|
|
308
|
+
}
|
|
309
|
+
const u = _t(e, l, c);
|
|
310
|
+
if (!u) return;
|
|
311
|
+
const d = i ? u : _t(e, f, c);
|
|
312
|
+
if (!d) return;
|
|
313
|
+
const p = t.createRange(), [y, h] = u, [g, k] = d;
|
|
314
|
+
$(y) ? h < 1 ? p.setStartBefore(y) : p.setStartAfter(y) : p.setStart(y, h), $(g) ? k < 1 ? p.setEndBefore(g) : p.setEndAfter(g) : p.setEnd(g, k),
|
|
315
|
+
kt(e, p, s, a);
|
|
316
|
+
}, _t = (t, [e, n], r) => r(() => {
|
|
317
|
+
let t, r = 0;
|
|
318
|
+
for (;t = at(); ) if (4 === t) {
|
|
319
|
+
if (r < e.length) for (let t = e[r++]; t > 0; t--) ct();
|
|
320
|
+
} else {
|
|
321
|
+
const t = nt();
|
|
322
|
+
if (n <= t) return [ et(), n ];
|
|
323
|
+
n -= t;
|
|
324
|
+
}
|
|
325
|
+
}, t), bt = (t, e, r, o) => {
|
|
326
|
+
let c = !0;
|
|
327
|
+
if (t === e && !e.hasChildNodes()) return [ [ 0 ], 0 ];
|
|
328
|
+
if ($(e) && e.hasChildNodes()) {
|
|
329
|
+
const t = n(r, e.childNodes.length - 1);
|
|
330
|
+
e = e.childNodes[t], c = t === r, r = 0;
|
|
331
|
+
}
|
|
332
|
+
return o(() => {
|
|
333
|
+
4 !== rt() && st();
|
|
334
|
+
const n = o(() => {
|
|
335
|
+
const e = [];
|
|
336
|
+
let n;
|
|
337
|
+
for (;(n = et()) && n !== t; ) e.unshift(n), st();
|
|
338
|
+
if (!e.length) return [ 0 ];
|
|
339
|
+
let r = 0, o = e[e.length - 1];
|
|
340
|
+
for (;o = o.previousElementSibling; ) r++;
|
|
341
|
+
return [ r ];
|
|
342
|
+
});
|
|
343
|
+
let s = 0;
|
|
344
|
+
for (;at(); ) {
|
|
345
|
+
const t = pt(e, et());
|
|
346
|
+
if (0 === t || 16 & t) {
|
|
347
|
+
if (c) break;
|
|
348
|
+
} else if (4 & t) break;
|
|
349
|
+
s += nt();
|
|
350
|
+
}
|
|
351
|
+
return [ n, s + r ];
|
|
352
|
+
}, t, e);
|
|
353
|
+
}, mt = (t, e, {startOffset: n, startContainer: r, endOffset: o, endContainer: c}) => {
|
|
354
|
+
const s = bt(t, r, n, e);
|
|
355
|
+
return [ s, r === c && n === o ? s : bt(t, c, o, e) ];
|
|
356
|
+
}, wt = "undefined" != typeof navigator && /Mac|iP(hone|od|ad)/.test(navigator.platform), vt = (t, e) => {
|
|
357
|
+
const n = t.endsWith("+"), r = (n ? t.slice(0, -2) : t).split("+"), o = n ? "+" : r.pop(), c = "Space" === o ? " " : o.toLowerCase();
|
|
358
|
+
let s = !1, i = !1, a = !1, l = !1;
|
|
359
|
+
return r.forEach(t => {
|
|
360
|
+
switch (t) {
|
|
361
|
+
case "Ctrl":
|
|
362
|
+
i = !0;
|
|
363
|
+
break;
|
|
364
|
+
|
|
365
|
+
case "Meta":
|
|
366
|
+
a = !0;
|
|
367
|
+
break;
|
|
368
|
+
|
|
369
|
+
case "Mod":
|
|
370
|
+
wt ? a = !0 : i = !0;
|
|
371
|
+
break;
|
|
372
|
+
|
|
373
|
+
case "Alt":
|
|
374
|
+
l = !0;
|
|
375
|
+
break;
|
|
376
|
+
|
|
377
|
+
case "Shift":
|
|
378
|
+
s = !0;
|
|
379
|
+
}
|
|
380
|
+
}), t => {
|
|
381
|
+
if (t.key.toLowerCase() === c && i === t.ctrlKey && a === t.metaKey && s === t.shiftKey && l === t.altKey) return e(t),
|
|
382
|
+
!0;
|
|
383
|
+
};
|
|
384
|
+
};
|
|
385
|
+
|
|
386
|
+
function Mt(t) {
|
|
387
|
+
let e = 0, n = 0, r = !1;
|
|
388
|
+
const c = Date.now, s = [ [ t.doc, t.selection, [] ] ], i = () => s[e];
|
|
389
|
+
t.hook("apply", (i, a) => {
|
|
390
|
+
if (r) return;
|
|
391
|
+
const l = t.doc, f = t.selection;
|
|
392
|
+
a(i);
|
|
393
|
+
const u = t.doc;
|
|
394
|
+
if (!o(l, u)) {
|
|
395
|
+
const t = c();
|
|
396
|
+
if (0 === e || t - n >= 500) {
|
|
397
|
+
e++;
|
|
398
|
+
const t = [ l, f, [] ];
|
|
399
|
+
e >= s.length ? s.push(t) : s[e] = t;
|
|
400
|
+
}
|
|
401
|
+
n = t, s[e][0] = u, s[e][2].push(i), s.splice(e + 1), e > 500 && (e--, s.shift());
|
|
402
|
+
}
|
|
403
|
+
}), t.hook("keyboard", vt("Mod+Z", () => {
|
|
404
|
+
if (e > 0) {
|
|
405
|
+
const n = i()[1];
|
|
406
|
+
e--;
|
|
407
|
+
const c = t.doc;
|
|
408
|
+
r = !0, t.exec(U, i()[0].children), r = !1, o(c, t.doc) || (t.selection = n);
|
|
409
|
+
}
|
|
410
|
+
})), t.hook("keyboard", vt("Shift+Mod+Z", () => {
|
|
411
|
+
if (e < s.length - 1) {
|
|
412
|
+
e++;
|
|
413
|
+
const [n, c, s] = i(), a = t.doc;
|
|
414
|
+
r = !0, t.exec(U, n.children), r = !1, o(a, t.doc) || (t.selection = [ V(c[0], s), V(c[1], s) ]);
|
|
415
|
+
}
|
|
416
|
+
}));
|
|
417
|
+
}
|
|
418
|
+
|
|
419
|
+
const St = [], Dt = () => {}, Et = ({doc: n, readonly: r = !1, schema: a, isBlock: g = ft, onError: k = console.error}) => {
|
|
420
|
+
let x = [ 0, 0 ];
|
|
421
|
+
const _ = (t, e) => {
|
|
422
|
+
if (!a) return e("An unsafe operation was detected. We recommend using schema option."),
|
|
423
|
+
!0;
|
|
424
|
+
const n = a["~standard"].validate(t);
|
|
425
|
+
if (n instanceof Promise) e("async validate is not supported."); else {
|
|
426
|
+
if (!n.issues) return !0;
|
|
427
|
+
e(n.issues.map(t => t.message).join("\n"));
|
|
428
|
+
}
|
|
429
|
+
return !1;
|
|
430
|
+
};
|
|
431
|
+
let b;
|
|
432
|
+
if (!_(n, t => {
|
|
433
|
+
b = t;
|
|
434
|
+
}) && b) throw Error(b);
|
|
435
|
+
const S = new Map, D = t => S.get(t) || St, E = new Map, O = t => {
|
|
436
|
+
const e = E.get(t);
|
|
437
|
+
e && !e[1] && (e[1] = !0, i(() => {
|
|
438
|
+
e[1] = !1, e[0].forEach(t => {
|
|
439
|
+
t();
|
|
440
|
+
});
|
|
441
|
+
}));
|
|
442
|
+
}, I = t => {
|
|
443
|
+
if (!r) if (Array.isArray(t)) for (const e of t) F(e); else F(t);
|
|
444
|
+
return T;
|
|
445
|
+
}, F = t => {
|
|
446
|
+
const e = n, r = D("apply"), c = r.length;
|
|
447
|
+
let s = 0;
|
|
448
|
+
const i = () => {
|
|
449
|
+
if (s < c) {
|
|
450
|
+
const e = s;
|
|
451
|
+
r[s](t, a), e === s && a();
|
|
452
|
+
} else if (s === c) {
|
|
453
|
+
s++;
|
|
454
|
+
try {
|
|
455
|
+
const [e, r] = ((t, e, n) => {
|
|
456
|
+
switch (n.type) {
|
|
457
|
+
case f:
|
|
458
|
+
{
|
|
459
|
+
const [r, o] = n.range;
|
|
460
|
+
B(t, r) && B(t, o) && r < o && (t = H(t, r, o, []), e = L(e, n));
|
|
461
|
+
break;
|
|
462
|
+
}
|
|
463
|
+
|
|
464
|
+
case u:
|
|
465
|
+
{
|
|
466
|
+
const {at: r, text: o} = n;
|
|
467
|
+
if (B(t, r) && o) {
|
|
468
|
+
const [c, s] = w(t, r), i = P(t, c), a = A(i, s - 1);
|
|
469
|
+
let f;
|
|
470
|
+
if (a) {
|
|
471
|
+
const t = a.o;
|
|
472
|
+
h(t) && (f = t);
|
|
473
|
+
}
|
|
474
|
+
t = H(t, r, r, l(o, f, i)), e = L(e, n);
|
|
475
|
+
}
|
|
476
|
+
break;
|
|
477
|
+
}
|
|
478
|
+
|
|
479
|
+
case d:
|
|
480
|
+
{
|
|
481
|
+
const {at: r, fragment: o} = n;
|
|
482
|
+
B(t, r) && o.length && (t = H(t, r, r, o), e = L(e, n));
|
|
483
|
+
break;
|
|
484
|
+
}
|
|
485
|
+
|
|
486
|
+
case p:
|
|
487
|
+
{
|
|
488
|
+
const {range: [e, r], key: o, value: c} = n;
|
|
489
|
+
B(t, e) && B(t, r) && e < r && (t = H(t, e, r, R(t, e, r).map(t => ({
|
|
490
|
+
...t,
|
|
491
|
+
children: t.children.map(t => h(t) ? {
|
|
492
|
+
...t,
|
|
493
|
+
[o]: c
|
|
494
|
+
} : t)
|
|
495
|
+
}))));
|
|
496
|
+
break;
|
|
497
|
+
}
|
|
498
|
+
|
|
499
|
+
case y:
|
|
500
|
+
{
|
|
501
|
+
const {path: e, key: r, value: o} = n, c = P(t, e);
|
|
502
|
+
c && (t = C(t, e, {
|
|
503
|
+
...c,
|
|
504
|
+
[r]: o
|
|
505
|
+
}));
|
|
506
|
+
break;
|
|
507
|
+
}
|
|
508
|
+
}
|
|
509
|
+
return [ t, e ];
|
|
510
|
+
})(n, x, t);
|
|
511
|
+
(({type: t}) => t === d || t === p || t === y)(t) && !_(e, k) || (n = e, x = r);
|
|
512
|
+
} catch (t) {
|
|
513
|
+
k("rollback operation: " + t);
|
|
514
|
+
}
|
|
515
|
+
}
|
|
516
|
+
}, a = e => {
|
|
517
|
+
e && (t = e), s++, i();
|
|
518
|
+
};
|
|
519
|
+
i(), o(e, n) || O("change");
|
|
520
|
+
}, N = t => {
|
|
521
|
+
!((t, [e, n]) => B(t, e) && B(t, n))(n, t) || x[0] === t[0] && x[1] === t[1] || (x = t,
|
|
522
|
+
O("selectionchange"));
|
|
523
|
+
}, T = {
|
|
524
|
+
get doc() {
|
|
525
|
+
return n;
|
|
526
|
+
},
|
|
527
|
+
get selection() {
|
|
528
|
+
return x;
|
|
529
|
+
},
|
|
530
|
+
set selection(t) {
|
|
531
|
+
N(t);
|
|
532
|
+
},
|
|
533
|
+
get readonly() {
|
|
534
|
+
return r;
|
|
535
|
+
},
|
|
536
|
+
set readonly(t) {
|
|
537
|
+
r = t, O("readonly");
|
|
538
|
+
},
|
|
539
|
+
apply: I,
|
|
540
|
+
on: (t, e) => {
|
|
541
|
+
let n = E.get(t);
|
|
542
|
+
n || E.set(t, n = [ new Set, !1 ]);
|
|
543
|
+
const r = n[0];
|
|
544
|
+
return r.add(e), () => {
|
|
545
|
+
r.delete(e);
|
|
546
|
+
};
|
|
547
|
+
},
|
|
548
|
+
hook: (t, e) => {
|
|
549
|
+
let n = S.get(t);
|
|
550
|
+
return n || S.set(t, n = []), n.push(e), () => {
|
|
551
|
+
const t = n.indexOf(e);
|
|
552
|
+
-1 !== t && n.splice(t, 1);
|
|
553
|
+
};
|
|
554
|
+
},
|
|
555
|
+
exec: (t, ...e) => {
|
|
556
|
+
const n = t(T, ...e);
|
|
557
|
+
return void 0 === n ? T : n;
|
|
558
|
+
},
|
|
559
|
+
input: o => {
|
|
560
|
+
if (!window.InputEvent || !s(InputEvent.prototype.getTargetRanges)) return k("beforeinput event is not supported."),
|
|
561
|
+
Dt;
|
|
562
|
+
const {contentEditable: i, role: a, ariaMultiLine: l, ariaReadOnly: f} = o, u = o.style.whiteSpace;
|
|
563
|
+
o.role = "textbox", o.style.whiteSpace = "pre-wrap", o.ariaMultiLine = "true";
|
|
564
|
+
let d = !1, p = null, y = !1, h = !1, _ = !1;
|
|
565
|
+
const b = yt(o), w = (t => {
|
|
566
|
+
const e = (n, r, o) => {
|
|
567
|
+
const c = K, s = Q, i = z, a = X, l = Y;
|
|
568
|
+
try {
|
|
569
|
+
return z || (K = t, Q = e, z = K.p.createTreeWalker(r, 5)), o && (z.currentNode = X = o),
|
|
570
|
+
n();
|
|
571
|
+
} finally {
|
|
572
|
+
K = c, Q = s, z = i, X = a, Y = l, z && a && (z.currentNode = a);
|
|
573
|
+
}
|
|
574
|
+
};
|
|
575
|
+
return e;
|
|
576
|
+
})({
|
|
577
|
+
p: b,
|
|
578
|
+
u: g,
|
|
579
|
+
l: dt
|
|
580
|
+
}), S = () => {
|
|
581
|
+
o.contentEditable = r ? "false" : "true", o.ariaReadOnly = r ? "true" : null;
|
|
582
|
+
};
|
|
583
|
+
S();
|
|
584
|
+
const E = T.on("change", () => {
|
|
585
|
+
h || requestAnimationFrame(() => {
|
|
586
|
+
h || o.focus({
|
|
587
|
+
preventScroll: !0
|
|
588
|
+
});
|
|
589
|
+
});
|
|
590
|
+
}), O = T.on("readonly", S), A = t => {
|
|
591
|
+
for (const e of D("paste")) {
|
|
592
|
+
const n = e(t, w);
|
|
593
|
+
if (n) return n;
|
|
594
|
+
}
|
|
595
|
+
k("failed to serialize pasted data");
|
|
596
|
+
}, P = ((t, e) => {
|
|
597
|
+
let n = !1;
|
|
598
|
+
const r = [], o = t => {
|
|
599
|
+
n && r.push(...t);
|
|
600
|
+
}, c = new MutationObserver(t => {
|
|
601
|
+
o(t), n || e();
|
|
602
|
+
}), s = () => {
|
|
603
|
+
o(c.takeRecords());
|
|
604
|
+
}, i = () => (s(), r.splice(0));
|
|
605
|
+
return c.observe(t, {
|
|
606
|
+
characterData: !0,
|
|
607
|
+
characterDataOldValue: !0,
|
|
608
|
+
childList: !0,
|
|
609
|
+
subtree: !0
|
|
610
|
+
}), {
|
|
611
|
+
h: t => {
|
|
612
|
+
let e;
|
|
613
|
+
for (;e = t.pop(); ) if ("childList" === e.type) {
|
|
614
|
+
const {target: t, removedNodes: n, addedNodes: r, nextSibling: o} = e;
|
|
615
|
+
for (let e = n.length - 1; e >= 0; e--) t.insertBefore(n[e], o);
|
|
616
|
+
for (let e = r.length - 1; e >= 0; e--) t.removeChild(r[e]);
|
|
617
|
+
} else e.target.data = e.oldValue;
|
|
618
|
+
i();
|
|
619
|
+
},
|
|
620
|
+
k: t => {
|
|
621
|
+
!n && t && s(), n = t;
|
|
622
|
+
},
|
|
623
|
+
_: i,
|
|
624
|
+
m: () => {
|
|
625
|
+
r.splice(0), c.disconnect();
|
|
626
|
+
}
|
|
627
|
+
};
|
|
628
|
+
})(o, () => {
|
|
629
|
+
xt(b, o, M(n, x), x[0] - x[1], w);
|
|
630
|
+
}), C = () => {
|
|
631
|
+
N(v(n, ((t, e) => {
|
|
632
|
+
const n = ht(t), r = gt(n, t);
|
|
633
|
+
if (!r) return [ [ [ 0 ], 0 ], [ [ 0 ], 0 ] ];
|
|
634
|
+
const o = mt(t, e, r), c = pt(n.anchorNode, n.focusNode);
|
|
635
|
+
return (0 === c ? n.anchorOffset > n.focusOffset : 2 & c) ? [ o[1], o[0] ] : o;
|
|
636
|
+
})(o, w)));
|
|
637
|
+
}, H = () => {
|
|
638
|
+
const t = P._();
|
|
639
|
+
P.k(!1), t.length && (P.h(t), b.removeEventListener("selectionchange", W), xt(b, o, M(n, x), x[0] - x[1], w, !0),
|
|
640
|
+
b.addEventListener("selectionchange", W)), p && (N(p[1]), I(p[0]), p = null), y = !1;
|
|
641
|
+
}, B = t => {
|
|
642
|
+
if (!y) for (const e of D("keyboard")) if (e(t)) return t.preventDefault(), void P.k(!1);
|
|
643
|
+
}, F = () => {
|
|
644
|
+
y || H();
|
|
645
|
+
}, L = t => {
|
|
646
|
+
t.preventDefault();
|
|
647
|
+
const r = t.inputType;
|
|
648
|
+
if (r.startsWith("format")) return;
|
|
649
|
+
if ("historyUndo" === r || "historyRedo" === r) return;
|
|
650
|
+
y ? P.k(!0) : C();
|
|
651
|
+
const c = t.getTargetRanges()[0];
|
|
652
|
+
if (c) {
|
|
653
|
+
const s = v(n, mt(o, w, c));
|
|
654
|
+
let i, a = "insertParagraph" === r || "insertLineBreak" === r ? "\n" : t.data;
|
|
655
|
+
if (null == a) {
|
|
656
|
+
const e = t.dataTransfer;
|
|
657
|
+
e && (a = e.getData("text/plain"));
|
|
658
|
+
}
|
|
659
|
+
p || (p = [ [], x ]), i = p[0], e(s) || i.push({
|
|
660
|
+
type: "delete",
|
|
661
|
+
range: s
|
|
662
|
+
}), a && i.push({
|
|
663
|
+
type: "insert_text",
|
|
664
|
+
at: s[0],
|
|
665
|
+
text: a
|
|
666
|
+
});
|
|
667
|
+
}
|
|
668
|
+
y || H();
|
|
669
|
+
}, q = () => {
|
|
670
|
+
y || C(), y = !0;
|
|
671
|
+
}, J = () => {
|
|
672
|
+
H();
|
|
673
|
+
}, U = () => {
|
|
674
|
+
h = !0, C();
|
|
675
|
+
}, G = () => {
|
|
676
|
+
h = !1;
|
|
677
|
+
}, W = () => {
|
|
678
|
+
!h || y || _ || C();
|
|
679
|
+
}, Z = r => {
|
|
680
|
+
if (C(), !e(x)) {
|
|
681
|
+
const e = R(n, ...t(x));
|
|
682
|
+
for (const t of D("copy")) t(r, e, o);
|
|
683
|
+
}
|
|
684
|
+
}, j = t => {
|
|
685
|
+
t.preventDefault(), Z(t.clipboardData);
|
|
686
|
+
}, $ = e => {
|
|
687
|
+
e.preventDefault(), r || (Z(e.clipboardData), I({
|
|
688
|
+
type: "delete",
|
|
689
|
+
range: t(x)
|
|
690
|
+
}));
|
|
691
|
+
}, tt = e => {
|
|
692
|
+
e.preventDefault();
|
|
693
|
+
const n = A(e.clipboardData);
|
|
694
|
+
if (n) {
|
|
695
|
+
const e = t(x), r = e[0], o = [ {
|
|
696
|
+
type: "delete",
|
|
697
|
+
range: e
|
|
698
|
+
} ];
|
|
699
|
+
o.push(c(n) ? {
|
|
700
|
+
type: "insert_text",
|
|
701
|
+
at: r,
|
|
702
|
+
text: n
|
|
703
|
+
} : {
|
|
704
|
+
type: "insert_node",
|
|
705
|
+
at: r,
|
|
706
|
+
fragment: n
|
|
707
|
+
}), I(o);
|
|
708
|
+
}
|
|
709
|
+
}, et = e => {
|
|
710
|
+
e.preventDefault();
|
|
711
|
+
const r = e.dataTransfer, s = ((t, e, {clientX: n, clientY: r}, o) => {
|
|
712
|
+
if (t.caretPositionFromPoint) {
|
|
713
|
+
const c = t.caretPositionFromPoint(n, r);
|
|
714
|
+
if (c) return bt(e, c.offsetNode, c.offset, o);
|
|
715
|
+
} else if (t.caretRangeFromPoint) {
|
|
716
|
+
const c = t.caretRangeFromPoint(n, r);
|
|
717
|
+
if (c) return bt(e, c.startContainer, c.startOffset, o);
|
|
718
|
+
}
|
|
719
|
+
})(b, o, e, w);
|
|
720
|
+
if (r && s) {
|
|
721
|
+
let e;
|
|
722
|
+
const o = [];
|
|
723
|
+
_ && o.push({
|
|
724
|
+
type: "delete",
|
|
725
|
+
range: t(x)
|
|
726
|
+
});
|
|
727
|
+
const i = A(r);
|
|
728
|
+
if (i) {
|
|
729
|
+
const t = m(n, s), r = V(t, o);
|
|
730
|
+
o.push(c(i) ? {
|
|
731
|
+
type: "insert_text",
|
|
732
|
+
at: r,
|
|
733
|
+
text: i
|
|
734
|
+
} : {
|
|
735
|
+
type: "insert_node",
|
|
736
|
+
at: r,
|
|
737
|
+
fragment: i
|
|
738
|
+
}), e = [ r, V(t, o) ];
|
|
739
|
+
}
|
|
740
|
+
I(o), e && N(e);
|
|
741
|
+
}
|
|
742
|
+
}, nt = t => {
|
|
743
|
+
_ = !0, Z(t.dataTransfer);
|
|
744
|
+
}, rt = () => {
|
|
745
|
+
_ = !1;
|
|
746
|
+
};
|
|
747
|
+
b.addEventListener("selectionchange", W), o.addEventListener("keydown", B), o.addEventListener("input", F),
|
|
748
|
+
o.addEventListener("beforeinput", L), o.addEventListener("compositionstart", q),
|
|
749
|
+
o.addEventListener("compositionend", J), o.addEventListener("focus", U), o.addEventListener("blur", G),
|
|
750
|
+
o.addEventListener("copy", j), o.addEventListener("cut", $), o.addEventListener("paste", tt),
|
|
751
|
+
o.addEventListener("drop", et), o.addEventListener("dragstart", nt), o.addEventListener("dragend", rt);
|
|
752
|
+
const ot = [];
|
|
753
|
+
return D("mount").forEach(t => {
|
|
754
|
+
const e = t(o);
|
|
755
|
+
e && ot.push(e);
|
|
756
|
+
}), () => {
|
|
757
|
+
d || (d = !0, E(), O(), o.contentEditable = i, o.role = a, o.ariaMultiLine = l,
|
|
758
|
+
o.ariaReadOnly = f, o.style.whiteSpace = u, P.m(), b.removeEventListener("selectionchange", W),
|
|
759
|
+
o.removeEventListener("keydown", B), o.removeEventListener("input", F), o.removeEventListener("beforeinput", L),
|
|
760
|
+
o.removeEventListener("compositionstart", q), o.removeEventListener("compositionend", J),
|
|
761
|
+
o.removeEventListener("focus", U), o.removeEventListener("blur", G), o.removeEventListener("copy", j),
|
|
762
|
+
o.removeEventListener("cut", $), o.removeEventListener("paste", tt), o.removeEventListener("drop", et),
|
|
763
|
+
o.removeEventListener("dragstart", nt), o.removeEventListener("dragend", rt), ot.forEach(t => {
|
|
764
|
+
t();
|
|
765
|
+
}));
|
|
766
|
+
};
|
|
767
|
+
}
|
|
768
|
+
};
|
|
769
|
+
return T.exec(Mt), T;
|
|
770
|
+
}, Ot = (t, e) => {
|
|
771
|
+
t.hook("paste", t => {
|
|
772
|
+
for (const n of t.items) if ("file" === n.kind) {
|
|
773
|
+
const t = e[n.type];
|
|
774
|
+
if (t) {
|
|
775
|
+
const e = n.getAsFile();
|
|
776
|
+
if (e) return [ {
|
|
777
|
+
children: [ t(e) ]
|
|
778
|
+
} ];
|
|
779
|
+
}
|
|
780
|
+
}
|
|
781
|
+
return null;
|
|
782
|
+
});
|
|
783
|
+
};
|
|
784
|
+
|
|
785
|
+
function At(t, e) {
|
|
786
|
+
const n = e && e.serializer;
|
|
787
|
+
t.hook("copy", (t, e) => {
|
|
788
|
+
t.setData("text/plain", a({
|
|
789
|
+
children: e
|
|
790
|
+
}, n));
|
|
791
|
+
}), t.hook("paste", t => t.getData("text/plain"));
|
|
792
|
+
}
|
|
793
|
+
|
|
794
|
+
function It(t, e) {
|
|
795
|
+
t.hook("copy", (t, e, n) => {
|
|
796
|
+
const r = document.createElement("div");
|
|
797
|
+
r.appendChild(gt(ht(n), n).cloneContents()), t.setData("text/html", r.innerHTML);
|
|
798
|
+
}), t.hook("paste", ((t, e = []) => (n, r) => {
|
|
799
|
+
const o = n.getData("text/html");
|
|
800
|
+
if (o) {
|
|
801
|
+
let n = (new DOMParser).parseFromString(o, "text/html").body, c = !1;
|
|
802
|
+
for (const t of [ ...n.childNodes ]) tt(t) ? "StartFragment" === t.data ? (c = !0,
|
|
803
|
+
n = new DocumentFragment) : "EndFragment" === t.data && (c = !1) : c && n.appendChild(t);
|
|
804
|
+
return ((t, e, n, r) => e(() => {
|
|
805
|
+
let t, e = null, o = "", c = !1;
|
|
806
|
+
const s = [], i = () => {
|
|
807
|
+
o && (e || (e = []), e.push(n(o)), o = "");
|
|
808
|
+
}, a = () => {
|
|
809
|
+
i(), !e && c && (e = []), e && s.push({
|
|
810
|
+
children: e
|
|
811
|
+
}), e = null, c = !1;
|
|
812
|
+
};
|
|
813
|
+
for (;t = at(); ) if (4 === t) a(); else if (c = !0, 1 === t) o += et().data; else if (2 === t) {
|
|
814
|
+
i();
|
|
815
|
+
const t = r(et());
|
|
816
|
+
t && e.push(t);
|
|
817
|
+
} else 3 === t && a();
|
|
818
|
+
return a(), s.length || s.push({
|
|
819
|
+
children: []
|
|
820
|
+
}), s;
|
|
821
|
+
}, t))(n, r, t, t => {
|
|
822
|
+
for (const n of e) {
|
|
823
|
+
const e = n(t);
|
|
824
|
+
if (e) return e;
|
|
825
|
+
}
|
|
826
|
+
});
|
|
827
|
+
}
|
|
828
|
+
return null;
|
|
829
|
+
})(e.serializeText, e.serializers));
|
|
830
|
+
}
|
|
831
|
+
|
|
832
|
+
const Pt = "application/x-editate-editor";
|
|
833
|
+
|
|
834
|
+
function Ct(t) {
|
|
835
|
+
t.hook("copy", (t, e) => {
|
|
836
|
+
t.setData(Pt, JSON.stringify(e));
|
|
837
|
+
}), t.hook("paste", t => {
|
|
838
|
+
try {
|
|
839
|
+
return JSON.parse(t.getData(Pt));
|
|
840
|
+
} catch (t) {
|
|
841
|
+
return null;
|
|
842
|
+
}
|
|
843
|
+
});
|
|
844
|
+
}
|
|
845
|
+
|
|
846
|
+
function Ht(t) {
|
|
847
|
+
t.hook("apply", t => {
|
|
848
|
+
console.log("apply", t);
|
|
849
|
+
}), t.on("change", () => {
|
|
850
|
+
console.log("change", t.doc);
|
|
851
|
+
}), t.on("selectionchange", () => {
|
|
852
|
+
console.log("selectionchange", t.selection);
|
|
853
|
+
});
|
|
854
|
+
}
|
|
855
|
+
|
|
856
|
+
function Rt(t, e) {
|
|
857
|
+
r(e).forEach(n => {
|
|
858
|
+
const r = e[n];
|
|
859
|
+
t.hook("keyboard", vt(n, () => {
|
|
860
|
+
r();
|
|
861
|
+
}));
|
|
862
|
+
});
|
|
863
|
+
}
|
|
864
|
+
|
|
865
|
+
function Bt(t) {
|
|
866
|
+
t.hook("mount", t => {
|
|
867
|
+
t.ariaMultiLine = null;
|
|
868
|
+
}), t.hook("apply", (t, e) => {
|
|
869
|
+
"insert_text" === t.type ? t = {
|
|
870
|
+
...t,
|
|
871
|
+
text: t.text.replaceAll("\n", "")
|
|
872
|
+
} : "insert_node" === t.type && (t = {
|
|
873
|
+
...t,
|
|
874
|
+
fragment: [ O(...t.fragment) ]
|
|
875
|
+
}), e(t);
|
|
876
|
+
});
|
|
877
|
+
}
|
|
878
|
+
|
|
879
|
+
const Vt = ({text: t, singleline: e, onChange: n, ...r}) => {
|
|
880
|
+
const o = Et({
|
|
881
|
+
...r,
|
|
882
|
+
doc: {
|
|
883
|
+
children: l(t)
|
|
884
|
+
}
|
|
885
|
+
}).exec(At);
|
|
886
|
+
return o.on("change", () => {
|
|
887
|
+
n(a(o.doc));
|
|
888
|
+
}), e && o.exec(Bt), o;
|
|
889
|
+
};
|
|
890
|
+
|
|
891
|
+
export { N as Delete, G as Format, q as InsertNode, T as InsertText, U as ReplaceDoc, J as ReplaceText, Z as SetBlockAttr, j as ToggleBlockAttr, W as ToggleFormat, Et as createEditor, Vt as createPlainEditor, Ht as debugPlugin, Ot as fileTransferPlugin, It as htmlTransferPlugin, Ct as internalTranferPlugin, Rt as keymapPlugin, At as plainTransferPlugin, Bt as singlelinePlugin };
|
|
892
|
+
//# sourceMappingURL=index.js.map
|