editate 0.6.20 → 0.6.21
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/README.md +1 -0
- package/lib/index.cjs +457 -397
- package/lib/index.cjs.map +1 -1
- package/lib/index.js +414 -352
- package/lib/index.js.map +1 -1
- package/lib/plugins/index.d.ts +1 -0
- package/lib/plugins/scrollToSelection.d.ts +12 -0
- package/package.json +7 -3
package/lib/index.js
CHANGED
|
@@ -1,12 +1,12 @@
|
|
|
1
|
-
var {min: t, max: e} = Math, {keys: n, is:
|
|
1
|
+
var {min: t, max: e} = Math, {keys: n, is: o} = Object, r = t => "string" == typeof t, c = t => "function" == typeof t, s = c(queueMicrotask) ? queueMicrotask : t => {
|
|
2
2
|
Promise.resolve().then(t);
|
|
3
3
|
}, i = t => "text" in t, l = t => "children" in t, a = t => t.some(l), f = /* @__PURE__ */ new WeakMap, u = ({children: t}, e = 0, n = t.length) => {
|
|
4
|
-
let
|
|
4
|
+
let o = 0, r = 0;
|
|
5
5
|
for (let c = e; c < n; c++) {
|
|
6
6
|
const e = t[c];
|
|
7
|
-
|
|
7
|
+
o += d(e), 0 !== r && l(e) && o++, r++;
|
|
8
8
|
}
|
|
9
|
-
return
|
|
9
|
+
return o;
|
|
10
10
|
}, d = t => {
|
|
11
11
|
if (l(t)) {
|
|
12
12
|
let e = f.get(t);
|
|
@@ -14,35 +14,35 @@ var {min: t, max: e} = Math, {keys: n, is: r} = Object, o = t => "string" == typ
|
|
|
14
14
|
}
|
|
15
15
|
return i(t) ? t.text.length : 1;
|
|
16
16
|
}, p = ({children: t}, e, n) => {
|
|
17
|
-
const
|
|
18
|
-
for (let
|
|
19
|
-
const
|
|
20
|
-
let s = d(
|
|
17
|
+
const o = t.length;
|
|
18
|
+
for (let r = 0; r < o; r++) {
|
|
19
|
+
const o = t[r], c = l(o);
|
|
20
|
+
let s = d(o);
|
|
21
21
|
const i = 0 === s;
|
|
22
|
-
if (c && s++, s > e || s === e && !c && (n || i)) return [
|
|
22
|
+
if (c && s++, s > e || s === e && !c && (n || i)) return [ o, e, r ];
|
|
23
23
|
e -= s;
|
|
24
24
|
}
|
|
25
25
|
return null;
|
|
26
|
-
},
|
|
26
|
+
}, h = (t, e) => {
|
|
27
27
|
const n = [];
|
|
28
28
|
for (;t; ) {
|
|
29
|
-
const
|
|
30
|
-
if (!
|
|
31
|
-
const
|
|
32
|
-
if (!l(
|
|
33
|
-
e =
|
|
29
|
+
const o = p(t, e);
|
|
30
|
+
if (!o) break;
|
|
31
|
+
const r = o[0];
|
|
32
|
+
if (!l(r)) break;
|
|
33
|
+
e = o[1], t = r, n.push(o[2]);
|
|
34
34
|
}
|
|
35
35
|
return [ t, e, n ];
|
|
36
|
-
},
|
|
37
|
-
const [
|
|
36
|
+
}, y = (t, e, n) => {
|
|
37
|
+
const [o, r, c] = h(t, e), s = p(o, r, n);
|
|
38
38
|
return s ? (c.push(s[2]), [ s[0], s[1], c ]) : null;
|
|
39
|
-
},
|
|
40
|
-
const n = t.children,
|
|
41
|
-
if (
|
|
42
|
-
const [e,
|
|
39
|
+
}, m = (t, e) => {
|
|
40
|
+
const n = t.children, o = p(t, e);
|
|
41
|
+
if (o) {
|
|
42
|
+
const [e, r, c] = o;
|
|
43
43
|
if (l(e)) {
|
|
44
|
-
const [
|
|
45
|
-
return i.push(
|
|
44
|
+
const [o, s] = m(e, r), i = n.slice(0, c), l = n.slice(c + 1);
|
|
45
|
+
return i.push(o), l.unshift(s), [ {
|
|
46
46
|
...t,
|
|
47
47
|
children: i
|
|
48
48
|
}, {
|
|
@@ -51,10 +51,10 @@ var {min: t, max: e} = Math, {keys: n, is: r} = Object, o = t => "string" == typ
|
|
|
51
51
|
} ];
|
|
52
52
|
}
|
|
53
53
|
{
|
|
54
|
-
const
|
|
54
|
+
const o = n.slice(0, c), s = n.slice(c + 1);
|
|
55
55
|
if (i(e)) {
|
|
56
|
-
const t = e.text.slice(0,
|
|
57
|
-
!t &&
|
|
56
|
+
const t = e.text.slice(0, r), n = e.text.slice(r);
|
|
57
|
+
!t && o.length || o.push({
|
|
58
58
|
...e,
|
|
59
59
|
text: t
|
|
60
60
|
}), !n && s.length || s.unshift({
|
|
@@ -64,76 +64,76 @@ var {min: t, max: e} = Math, {keys: n, is: r} = Object, o = t => "string" == typ
|
|
|
64
64
|
} else s.unshift(e);
|
|
65
65
|
return [ {
|
|
66
66
|
...t,
|
|
67
|
-
children:
|
|
67
|
+
children: o
|
|
68
68
|
}, {
|
|
69
69
|
...t,
|
|
70
70
|
children: s
|
|
71
71
|
} ];
|
|
72
72
|
}
|
|
73
73
|
}
|
|
74
|
-
const
|
|
74
|
+
const r = n[n.length - 1];
|
|
75
75
|
return [ t, {
|
|
76
76
|
...t,
|
|
77
|
-
children: i(
|
|
78
|
-
...
|
|
77
|
+
children: i(r) ? [ {
|
|
78
|
+
...r,
|
|
79
79
|
text: ""
|
|
80
80
|
} ] : []
|
|
81
81
|
} ];
|
|
82
82
|
}, g = (t, [e, n]) => {
|
|
83
|
-
let
|
|
84
|
-
for (const
|
|
85
|
-
return
|
|
86
|
-
},
|
|
87
|
-
const [, n,
|
|
88
|
-
return [
|
|
89
|
-
},
|
|
83
|
+
let o = 0;
|
|
84
|
+
for (const r of e) o += u(t, 0, r), 0 !== r && o++, t = t.children[r];
|
|
85
|
+
return o + n;
|
|
86
|
+
}, k = (t, e) => {
|
|
87
|
+
const [, n, o] = h(t, e);
|
|
88
|
+
return [ o, n ];
|
|
89
|
+
}, _ = (t, [e, n]) => [ g(t, e), g(t, n) ];
|
|
90
90
|
|
|
91
|
-
function*
|
|
91
|
+
function* x(t, [e, n]) {
|
|
92
92
|
if (e >= n) return;
|
|
93
93
|
if (!l(t)) return;
|
|
94
|
-
const
|
|
95
|
-
if (
|
|
96
|
-
let
|
|
94
|
+
const o = p(t, e);
|
|
95
|
+
if (o) {
|
|
96
|
+
let r = e - o[1], c = o[2];
|
|
97
97
|
const s = t.children, i = s.length;
|
|
98
|
-
for (;
|
|
98
|
+
for (;r <= n && c < i; ) {
|
|
99
99
|
const t = s[c];
|
|
100
|
-
yield [ t,
|
|
100
|
+
yield [ t, r ], c++, r += d(t), l(t) && r++;
|
|
101
101
|
}
|
|
102
102
|
}
|
|
103
103
|
}
|
|
104
104
|
|
|
105
|
-
function*
|
|
106
|
-
if (!l(t) || a(t.children)) for (const n of
|
|
105
|
+
function* v(t, e) {
|
|
106
|
+
if (!l(t) || a(t.children)) for (const n of x(t, e)) {
|
|
107
107
|
const [t, e] = n;
|
|
108
|
-
for (const n of
|
|
108
|
+
for (const n of v(t, [ 0, d(t) ])) n[1] += e, yield n;
|
|
109
109
|
} else yield [ t, 0 ];
|
|
110
110
|
}
|
|
111
111
|
|
|
112
|
-
function*
|
|
113
|
-
if (l(t)) for (const [n,
|
|
112
|
+
function* b(t, e) {
|
|
113
|
+
if (l(t)) for (const [n, o] of x(t, e)) for (const t of b(n, [ 0, d(n) ])) t[1] += o,
|
|
114
114
|
yield t; else yield [ t, 0 ];
|
|
115
115
|
}
|
|
116
116
|
|
|
117
|
-
var T = (n,
|
|
118
|
-
let s = "", l =
|
|
119
|
-
for (const [a, f] of
|
|
117
|
+
var T = (n, o = 0, r = 1 / 0, c) => {
|
|
118
|
+
let s = "", l = o;
|
|
119
|
+
for (const [a, f] of b(n, [ o, r ])) {
|
|
120
120
|
for (let t = f - l; t > 0; t--) s += "\n";
|
|
121
121
|
const n = d(a), u = f + n;
|
|
122
122
|
if (i(a)) {
|
|
123
|
-
const c = e(f,
|
|
123
|
+
const c = e(f, o) - f, i = t(u, r) - f;
|
|
124
124
|
s += 0 === c && i === n ? a.text : a.text.slice(c, i);
|
|
125
125
|
} else c && (s += c(a));
|
|
126
126
|
l = u;
|
|
127
127
|
}
|
|
128
|
-
for (let e = t(
|
|
128
|
+
for (let e = t(r, d(n)) - l; e > 0; e--) s += "\n";
|
|
129
129
|
return s;
|
|
130
|
-
}, E = (t, e, n) => e >= n ? [] :
|
|
130
|
+
}, E = (t, e, n) => e >= n ? [] : m(m(t, n)[0], e)[1].children, M = ([t, e]) => t > e ? [ e, t ] : [ t, e ], S = ([t, e]) => t === e, w = ([t, e], [n, o]) => t < o && n < e;
|
|
131
131
|
|
|
132
132
|
function* A(t, e = M(t.selection)) {
|
|
133
133
|
if (S(e)) {
|
|
134
|
-
const n =
|
|
134
|
+
const n = y(t.doc, e[0])?.[0];
|
|
135
135
|
n && (yield n);
|
|
136
|
-
} else for (const [n,
|
|
136
|
+
} else for (const [n, o] of b(t.doc, e)) w(e, [ o, o + d(n) ]) && (yield n);
|
|
137
137
|
}
|
|
138
138
|
|
|
139
139
|
function O(t, e = M(t.selection)) {
|
|
@@ -181,94 +181,94 @@ function I(t, e) {
|
|
|
181
181
|
});
|
|
182
182
|
}
|
|
183
183
|
|
|
184
|
-
function
|
|
184
|
+
function L(t, e, n, o = M(t.selection)) {
|
|
185
185
|
t.apply({
|
|
186
186
|
type: "format",
|
|
187
|
-
range:
|
|
187
|
+
range: o,
|
|
188
188
|
key: e,
|
|
189
189
|
value: n
|
|
190
190
|
});
|
|
191
191
|
}
|
|
192
192
|
|
|
193
|
-
function
|
|
194
|
-
let
|
|
195
|
-
for (const c of t.exec(A, n)) if (i(c) && (
|
|
196
|
-
|
|
193
|
+
function P(t, e, n = M(t.selection)) {
|
|
194
|
+
let o = !1, r = !1;
|
|
195
|
+
for (const c of t.exec(A, n)) if (i(c) && (r = !0, !c[e])) {
|
|
196
|
+
o = !0;
|
|
197
197
|
break;
|
|
198
198
|
}
|
|
199
|
-
|
|
199
|
+
r && t.apply({
|
|
200
200
|
type: "format",
|
|
201
201
|
range: n,
|
|
202
202
|
key: e,
|
|
203
|
-
value:
|
|
203
|
+
value: o
|
|
204
204
|
});
|
|
205
205
|
}
|
|
206
206
|
|
|
207
|
-
function
|
|
208
|
-
const
|
|
207
|
+
function H(t, e, n, o = t.selection[0]) {
|
|
208
|
+
const r = h(t.doc, o)[2];
|
|
209
209
|
t.apply({
|
|
210
210
|
type: "patch_node",
|
|
211
|
-
path:
|
|
211
|
+
path: r,
|
|
212
212
|
key: e,
|
|
213
213
|
value: n
|
|
214
214
|
});
|
|
215
215
|
}
|
|
216
216
|
|
|
217
|
-
function
|
|
218
|
-
const [c, , s] =
|
|
217
|
+
function N(t, e, n, o, r = t.selection[0]) {
|
|
218
|
+
const [c, , s] = h(t.doc, r);
|
|
219
219
|
t.apply({
|
|
220
220
|
type: "patch_node",
|
|
221
221
|
path: s,
|
|
222
222
|
key: e,
|
|
223
|
-
value: c[e] === n ?
|
|
223
|
+
value: c[e] === n ? o : n
|
|
224
224
|
});
|
|
225
225
|
}
|
|
226
226
|
|
|
227
|
-
function
|
|
228
|
-
const
|
|
229
|
-
|
|
227
|
+
function C(t, e, n, o = t.selection[0]) {
|
|
228
|
+
const r = y(t.doc, o, !0);
|
|
229
|
+
r && !i(r[0]) && t.apply({
|
|
230
230
|
type: "patch_node",
|
|
231
|
-
path:
|
|
231
|
+
path: r[2],
|
|
232
232
|
key: e,
|
|
233
233
|
value: n
|
|
234
234
|
});
|
|
235
235
|
}
|
|
236
236
|
|
|
237
|
-
var
|
|
237
|
+
var W = t => 1 === t.nodeType, F = t => 8 === t.nodeType, U = new Map([ [ "BR", 1 ], [ "WBR", 1 ], [ "AREA", 2 ], [ "BASE", 2 ], [ "DATALIST", 2 ], [ "HEAD", 2 ], [ "LINK", 2 ], [ "META", 2 ], [ "RP", 2 ], [ "SCRIPT", 2 ], [ "STYLE", 2 ], [ "TEMPLATE", 2 ], [ "TITLE", 2 ], [ "COLGROUP", 2 ], [ "HR", 3 ], [ "AUDIO", 3 ], [ "CANVAS", 3 ], [ "EMBED", 3 ], [ "IFRAME", 3 ], [ "IMG", 3 ], [ "OBJECT", 3 ], [ "PICTURE", 3 ], [ "VIDEO", 3 ], [ "SVG", 3 ], [ "MATH", 3 ], [ "BUTTON", 3 ], [ "INPUT", 3 ], [ "METER", 3 ], [ "PROGRESS", 3 ], [ "SELECT", 3 ], [ "TEXTAREA", 3 ] ]), V = new Set([ "DIV", "H1", "H2", "H3", "H4", "H5", "H6", "P", "PRE", "LI", "DT", "DD", "TH", "TD" ]), q = t => V.has(t.tagName), z = (t, e) => t.compareDocumentPosition(e), G = t => t.ownerDocument, J = t => G(t).getSelection(), Y = (t, e) => {
|
|
238
238
|
if (t.rangeCount) {
|
|
239
239
|
const n = t.getRangeAt(0);
|
|
240
240
|
if (e.contains(n.commonAncestorContainer)) return n;
|
|
241
241
|
}
|
|
242
|
-
},
|
|
243
|
-
const [
|
|
244
|
-
return
|
|
245
|
-
|
|
242
|
+
}, X = (t, e, n, o) => {
|
|
243
|
+
const [r, c] = ((t, [e, n]) => [ k(t, e), k(t, n) ])(n, o), s = G(t), i = S(o), l = o[0] - o[1] > 0, a = l ? r : c, f = j(t, e, l ? c : r), u = i ? f : j(t, e, a), d = s.createRange(), [p, h] = f, [y, m] = u;
|
|
244
|
+
return W(p) && t !== p ? h < 1 ? d.setStartBefore(p) : d.setStartAfter(p) : d.setStart(p, h),
|
|
245
|
+
W(y) && t !== y ? m < 1 ? d.setEndBefore(y) : d.setEndAfter(y) : d.setEnd(y, m),
|
|
246
246
|
d;
|
|
247
|
-
}, Z = (t, e, n,
|
|
247
|
+
}, Z = (t, e, n, o, r) => {
|
|
248
248
|
const c = J(t);
|
|
249
|
-
if (
|
|
250
|
-
const
|
|
251
|
-
c.removeAllRanges(), c.addRange(
|
|
249
|
+
if (r || Y(c, t)) {
|
|
250
|
+
const r = X(t, e, n, o), s = o[0] - o[1] > 0;
|
|
251
|
+
c.removeAllRanges(), c.addRange(r), s && (c.collapseToEnd(), c.extend(r.startContainer, r.startOffset));
|
|
252
252
|
}
|
|
253
|
-
}, j = (t, e, [n,
|
|
253
|
+
}, j = (t, e, [n, o]) => e(({t: e, o: r, i: c, l: s}) => {
|
|
254
254
|
let i, l = 0;
|
|
255
255
|
for (;i = e(); ) if (4 === i) {
|
|
256
|
-
if (l < n.length) for (let t = n[l++]; t > 0; t--)
|
|
256
|
+
if (l < n.length) for (let t = n[l++]; t > 0; t--) r();
|
|
257
257
|
} else {
|
|
258
258
|
const t = s();
|
|
259
|
-
if (
|
|
260
|
-
|
|
259
|
+
if (o <= t) return [ c(), o ];
|
|
260
|
+
o -= t;
|
|
261
261
|
}
|
|
262
262
|
return [ t, 0 ];
|
|
263
|
-
}, t), K = (e, n,
|
|
263
|
+
}, t), K = (e, n, o, r) => {
|
|
264
264
|
let c = !0;
|
|
265
|
-
if (e ===
|
|
266
|
-
if (
|
|
267
|
-
const e = t(
|
|
268
|
-
|
|
265
|
+
if (e === o && !o.hasChildNodes()) return [ [], 0 ];
|
|
266
|
+
if (W(o) && o.hasChildNodes()) {
|
|
267
|
+
const e = t(r, o.childNodes.length - 1);
|
|
268
|
+
o = o.childNodes[e], c = e === r, r = 0;
|
|
269
269
|
}
|
|
270
|
-
return n(({t, u: s, p: i, h: l, i: a, l: f,
|
|
271
|
-
s(
|
|
270
|
+
return n(({t, u: s, p: i, h: l, i: a, l: f, m: u}) => {
|
|
271
|
+
s(o), 4 !== u() && i();
|
|
272
272
|
const d = n(() => {
|
|
273
273
|
const t = [];
|
|
274
274
|
for (;u() && a() !== e; ) {
|
|
@@ -280,49 +280,49 @@ var F = t => 1 === t.nodeType, U = t => 8 === t.nodeType, V = new Map([ [ "BR",
|
|
|
280
280
|
});
|
|
281
281
|
let p = 0;
|
|
282
282
|
for (;t(); ) {
|
|
283
|
-
const t = z(
|
|
283
|
+
const t = z(o, a());
|
|
284
284
|
if (0 === t || 16 & t) {
|
|
285
285
|
if (c) break;
|
|
286
286
|
} else if (4 & t) break;
|
|
287
287
|
p += f();
|
|
288
288
|
}
|
|
289
|
-
return [ d, p +
|
|
289
|
+
return [ d, p + r ];
|
|
290
290
|
}, e);
|
|
291
|
-
}, Q = (t, e, {startOffset: n, startContainer:
|
|
292
|
-
const s = K(t, e,
|
|
293
|
-
return [ s,
|
|
291
|
+
}, Q = (t, e, {startOffset: n, startContainer: o, endOffset: r, endContainer: c}) => {
|
|
292
|
+
const s = K(t, e, o, n);
|
|
293
|
+
return [ s, o === c && n === r ? s : K(t, e, c, r) ];
|
|
294
294
|
}, $ = (t, e, n) => t.split("\n").map(t => ({
|
|
295
295
|
...n,
|
|
296
296
|
children: [ {
|
|
297
297
|
...e,
|
|
298
298
|
text: t
|
|
299
299
|
} ]
|
|
300
|
-
})), tt = "delete", et = "insert_text", nt = "insert_node",
|
|
301
|
-
const
|
|
302
|
-
return
|
|
303
|
-
},
|
|
300
|
+
})), tt = "delete", et = "insert_text", nt = "insert_node", ot = (t, e) => {
|
|
301
|
+
const r = n(t);
|
|
302
|
+
return r.length === n(e).length && r.every(n => n in e && ("text" === n || o(t[n], e[n])));
|
|
303
|
+
}, rt = (t, e) => {
|
|
304
304
|
if (e.length) {
|
|
305
305
|
const n = t.length;
|
|
306
306
|
if (t.push(...e), n) {
|
|
307
|
-
const e = t[n - 1],
|
|
308
|
-
|
|
309
|
-
let
|
|
310
|
-
for (;
|
|
311
|
-
const e = t[
|
|
312
|
-
t[
|
|
307
|
+
const e = t[n - 1], o = t[n], r = l(e), c = l(o);
|
|
308
|
+
r ? c && ((t, e = 0, n = t.length - 1) => {
|
|
309
|
+
let o = e + 1;
|
|
310
|
+
for (;o <= n; ) {
|
|
311
|
+
const e = t[o - 1], r = t[o];
|
|
312
|
+
t[o - 1] = ct(e, r), t.splice(o, 1), n--;
|
|
313
313
|
}
|
|
314
|
-
})(t, n - 1, n) :
|
|
315
|
-
let
|
|
316
|
-
for (;
|
|
317
|
-
const e = t[
|
|
318
|
-
i(e) && i(
|
|
314
|
+
})(t, n - 1, n) : r || c || ((t, e = 0, n = t.length - 1) => {
|
|
315
|
+
let o = e + 1;
|
|
316
|
+
for (;o <= n; ) {
|
|
317
|
+
const e = t[o - 1], r = t[o];
|
|
318
|
+
i(e) && i(r) && ot(e, r) ? (t[o - 1] = {
|
|
319
319
|
...e,
|
|
320
|
-
text: e.text +
|
|
321
|
-
}, t.splice(
|
|
320
|
+
text: e.text + r.text
|
|
321
|
+
}, t.splice(o, 1), n--) : o++;
|
|
322
322
|
}
|
|
323
|
-
for (
|
|
324
|
-
const e = t[
|
|
325
|
-
i(e) && !e.text && t.length > 1 ? (t.splice(
|
|
323
|
+
for (o = e; o <= n; ) {
|
|
324
|
+
const e = t[o];
|
|
325
|
+
i(e) && !e.text && t.length > 1 ? (t.splice(o, 1), n--) : o++;
|
|
326
326
|
}
|
|
327
327
|
})(t, n - 1, n);
|
|
328
328
|
}
|
|
@@ -332,26 +332,23 @@ var F = t => 1 === t.nodeType, U = t => 8 === t.nodeType, V = new Map([ [ "BR",
|
|
|
332
332
|
});
|
|
333
333
|
}, ct = (...t) => ({
|
|
334
334
|
...t[0],
|
|
335
|
-
children: t.reduce((t, e) => (
|
|
336
|
-
}), st = (t, e, n,
|
|
337
|
-
if (
|
|
338
|
-
const
|
|
339
|
-
return ((
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
343
|
-
children: o
|
|
344
|
-
};
|
|
345
|
-
})(t, o, o, [ st(t.children[o], e, n, r + 1) ]);
|
|
335
|
+
children: t.reduce((t, e) => (rt(t, e.children), t), [])
|
|
336
|
+
}), st = (t, e, n, o = 0) => {
|
|
337
|
+
if (o < e.length) {
|
|
338
|
+
const r = e[o], c = t.children, s = c.slice();
|
|
339
|
+
return s.splice(r, 1, st(c[r], e, n, o + 1)), {
|
|
340
|
+
...t,
|
|
341
|
+
children: s
|
|
342
|
+
};
|
|
346
343
|
}
|
|
347
344
|
return n;
|
|
348
|
-
}, it = (t, e, n,
|
|
349
|
-
const [
|
|
350
|
-
a(
|
|
351
|
-
children:
|
|
345
|
+
}, it = (t, e, n, o) => {
|
|
346
|
+
const [r, c] = m(t, e), s = e < n ? m(t, n)[1] : c, i = a(t.children);
|
|
347
|
+
a(o) ? i || (o = ct(...o).children) : i && (o = [ {
|
|
348
|
+
children: o
|
|
352
349
|
} ]);
|
|
353
|
-
const l =
|
|
354
|
-
return
|
|
350
|
+
const l = r.children.slice();
|
|
351
|
+
return rt(l, o), rt(l, s.children), {
|
|
355
352
|
...t,
|
|
356
353
|
children: l
|
|
357
354
|
};
|
|
@@ -359,32 +356,32 @@ var F = t => 1 === t.nodeType, U = t => 8 === t.nodeType, V = new Map([ [ "BR",
|
|
|
359
356
|
switch (e.type) {
|
|
360
357
|
case tt:
|
|
361
358
|
{
|
|
362
|
-
const [n,
|
|
363
|
-
if (t >= n) return
|
|
359
|
+
const [n, o] = e.range;
|
|
360
|
+
if (t >= n) return o >= t ? n : t + n - o;
|
|
364
361
|
break;
|
|
365
362
|
}
|
|
366
363
|
|
|
367
364
|
case et:
|
|
368
365
|
{
|
|
369
|
-
const {at: n, text:
|
|
370
|
-
if (t >= n) return t +
|
|
366
|
+
const {at: n, text: o} = e;
|
|
367
|
+
if (t >= n) return t + o.length;
|
|
371
368
|
break;
|
|
372
369
|
}
|
|
373
370
|
|
|
374
371
|
case nt:
|
|
375
372
|
{
|
|
376
|
-
const {at: n, fragment:
|
|
373
|
+
const {at: n, fragment: o} = e;
|
|
377
374
|
if (t >= n) return t + d({
|
|
378
|
-
children:
|
|
375
|
+
children: o
|
|
379
376
|
});
|
|
380
377
|
break;
|
|
381
378
|
}
|
|
382
379
|
}
|
|
383
380
|
return t;
|
|
384
381
|
}, ut = ([t, e], n) => [ ft(t, n), ft(e, n) ], dt = "undefined" != typeof navigator && /Mac|iP(hone|od|ad)/.test(navigator.platform), pt = (t, e) => {
|
|
385
|
-
const n = t.endsWith("+"),
|
|
382
|
+
const n = t.endsWith("+"), o = (n ? t.slice(0, -2) : t).split("+"), r = n ? "+" : o.pop(), c = "Space" === r ? " " : r.toLowerCase();
|
|
386
383
|
let s = !1, i = !1, l = !1, a = !1;
|
|
387
|
-
return
|
|
384
|
+
return o.forEach(t => {
|
|
388
385
|
switch (t) {
|
|
389
386
|
case "Ctrl":
|
|
390
387
|
i = !0;
|
|
@@ -410,65 +407,80 @@ var F = t => 1 === t.nodeType, U = t => 8 === t.nodeType, V = new Map([ [ "BR",
|
|
|
410
407
|
};
|
|
411
408
|
};
|
|
412
409
|
|
|
413
|
-
function
|
|
414
|
-
let e = 0,
|
|
415
|
-
const
|
|
416
|
-
|
|
417
|
-
|
|
410
|
+
function ht(t) {
|
|
411
|
+
let e = 0, o = 0, r = !1;
|
|
412
|
+
const c = Date.now, s = [ [ t.doc, t.selection, [] ] ], i = () => s[e], l = () => e > 0, a = () => e < s.length - 1, f = e => {
|
|
413
|
+
t.exec(I, e.children);
|
|
414
|
+
const o = e, r = t.doc;
|
|
415
|
+
for (const c of n(o)) "children" !== c && r[c] !== o[c] && t.apply({
|
|
416
|
+
type: "patch_node",
|
|
417
|
+
path: [],
|
|
418
|
+
key: c,
|
|
419
|
+
value: o[c]
|
|
420
|
+
});
|
|
421
|
+
for (const c of n(r)) "children" === c || c in o || t.apply({
|
|
422
|
+
type: "patch_node",
|
|
423
|
+
path: [],
|
|
424
|
+
key: c,
|
|
425
|
+
value: void 0
|
|
426
|
+
});
|
|
427
|
+
}, u = () => {
|
|
428
|
+
if (l()) {
|
|
429
|
+
const n = i()[1];
|
|
418
430
|
e--;
|
|
419
431
|
const o = t.doc;
|
|
420
|
-
r = !0,
|
|
432
|
+
r = !0, f(i()[0]), r = !1, o !== t.doc && (t.selection = n);
|
|
421
433
|
}
|
|
422
|
-
},
|
|
423
|
-
if (
|
|
434
|
+
}, d = () => {
|
|
435
|
+
if (a()) {
|
|
424
436
|
e++;
|
|
425
|
-
const [n, o, c] =
|
|
426
|
-
r = !0,
|
|
437
|
+
const [n, o, c] = i(), s = t.doc;
|
|
438
|
+
r = !0, f(n), r = !1, s !== t.doc && (t.selection = [ at(o[0], c), at(o[1], c) ]);
|
|
427
439
|
}
|
|
428
440
|
};
|
|
429
|
-
t.hook("apply", (
|
|
441
|
+
t.hook("apply", (n, i) => {
|
|
430
442
|
if (r) return;
|
|
431
443
|
const l = t.doc, a = t.selection;
|
|
432
|
-
i(
|
|
444
|
+
i(n);
|
|
433
445
|
const f = t.doc;
|
|
434
446
|
if (l !== f) {
|
|
435
|
-
const t =
|
|
436
|
-
if (0 === e || t -
|
|
447
|
+
const t = c();
|
|
448
|
+
if (0 === e || t - o >= 500) {
|
|
437
449
|
e++;
|
|
438
450
|
const t = [ l, a, [] ];
|
|
439
|
-
e >=
|
|
451
|
+
e >= s.length ? s.push(t) : s[e] = t;
|
|
440
452
|
}
|
|
441
|
-
|
|
442
|
-
|
|
453
|
+
o = t, s[e][0] = f, s[e][2].push(n), s.length > e + 1 && (s.length = e + 1), e > 500 && (e--,
|
|
454
|
+
s.shift());
|
|
443
455
|
}
|
|
444
|
-
}), t.hook("keyboard", pt("Mod+Z",
|
|
445
|
-
t.set(
|
|
446
|
-
undo:
|
|
447
|
-
redo:
|
|
448
|
-
undoable:
|
|
449
|
-
redoable:
|
|
456
|
+
}), t.hook("keyboard", pt("Mod+Z", u)), t.hook("keyboard", pt("Shift+Mod+Z", d)),
|
|
457
|
+
t.set(ht, {
|
|
458
|
+
undo: u,
|
|
459
|
+
redo: d,
|
|
460
|
+
undoable: l,
|
|
461
|
+
redoable: a
|
|
450
462
|
});
|
|
451
463
|
}
|
|
452
464
|
|
|
453
|
-
function
|
|
454
|
-
t.get(
|
|
465
|
+
function yt(t) {
|
|
466
|
+
t.get(ht).undo();
|
|
455
467
|
}
|
|
456
468
|
|
|
457
|
-
function
|
|
458
|
-
t.get(
|
|
469
|
+
function mt(t) {
|
|
470
|
+
t.get(ht).redo();
|
|
459
471
|
}
|
|
460
472
|
|
|
461
473
|
function gt(t) {
|
|
462
|
-
return t.get(
|
|
474
|
+
return t.get(ht).undoable();
|
|
463
475
|
}
|
|
464
476
|
|
|
465
|
-
function
|
|
466
|
-
return t.get(
|
|
477
|
+
function kt(t) {
|
|
478
|
+
return t.get(ht).redoable();
|
|
467
479
|
}
|
|
468
480
|
|
|
469
|
-
var
|
|
481
|
+
var _t = [], xt = () => {}, vt = t => {
|
|
470
482
|
throw Error(t);
|
|
471
|
-
},
|
|
483
|
+
}, bt = ({doc: t, readonly: e = !1, schema: n, isBlock: o = q, onWarn: a = console.warn, onError: f = vt}) => {
|
|
472
484
|
let u = [ 0, 0 ];
|
|
473
485
|
const d = t => {
|
|
474
486
|
if (!n) return a("An unsafe operation was detected. We recommend using schema option."),
|
|
@@ -481,69 +493,69 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
481
493
|
return !1;
|
|
482
494
|
};
|
|
483
495
|
n && !d(t) && f("Invalid document");
|
|
484
|
-
const
|
|
485
|
-
const e =
|
|
486
|
-
e && (
|
|
487
|
-
|
|
496
|
+
const y = /* @__PURE__ */ new Map, m = /* @__PURE__ */ new WeakMap, k = t => y.get(t) || _t, x = /* @__PURE__ */ new Map, v = /* @__PURE__ */ new Set, b = t => {
|
|
497
|
+
const e = x.get(t);
|
|
498
|
+
e && (v.size || s(() => {
|
|
499
|
+
v.forEach(t => {
|
|
488
500
|
t();
|
|
489
|
-
}),
|
|
501
|
+
}), v.clear();
|
|
490
502
|
}), e.forEach(t => {
|
|
491
|
-
|
|
503
|
+
v.add(t);
|
|
492
504
|
}));
|
|
493
505
|
}, T = t => {
|
|
494
506
|
if (!e) if (Array.isArray(t)) for (const e of t) w(e); else w(t);
|
|
495
507
|
return O;
|
|
496
508
|
}, w = e => {
|
|
497
|
-
const n = t,
|
|
509
|
+
const n = t, o = k("apply"), r = o.length;
|
|
498
510
|
let c = 0;
|
|
499
511
|
const s = () => {
|
|
500
|
-
if (c <
|
|
512
|
+
if (c < r) {
|
|
501
513
|
const t = c;
|
|
502
|
-
|
|
503
|
-
} else if (c ===
|
|
514
|
+
o[c](e, f), t === c && f();
|
|
515
|
+
} else if (c === r) {
|
|
504
516
|
c++;
|
|
505
517
|
try {
|
|
506
|
-
const [n,
|
|
518
|
+
const [n, o] = ((t, e, n) => {
|
|
507
519
|
switch (n.type) {
|
|
508
520
|
case tt:
|
|
509
521
|
{
|
|
510
|
-
const [
|
|
511
|
-
lt(t,
|
|
522
|
+
const [o, r] = n.range;
|
|
523
|
+
lt(t, o) && lt(t, r) && o < r && (t = it(t, o, r, []), e = ut(e, n));
|
|
512
524
|
break;
|
|
513
525
|
}
|
|
514
526
|
|
|
515
527
|
case et:
|
|
516
528
|
{
|
|
517
|
-
const {at:
|
|
518
|
-
if (lt(t,
|
|
519
|
-
const [c, s] =
|
|
529
|
+
const {at: o, text: r} = n;
|
|
530
|
+
if (lt(t, o) && r) {
|
|
531
|
+
const [c, s] = h(t, o), l = p(c, s, !0);
|
|
520
532
|
let a;
|
|
521
533
|
if (l) {
|
|
522
534
|
const t = l[0];
|
|
523
535
|
i(t) && (a = t);
|
|
524
536
|
}
|
|
525
|
-
t = it(t,
|
|
537
|
+
t = it(t, o, o, $(r, a, c)), e = ut(e, n);
|
|
526
538
|
}
|
|
527
539
|
break;
|
|
528
540
|
}
|
|
529
541
|
|
|
530
542
|
case nt:
|
|
531
543
|
{
|
|
532
|
-
const {at:
|
|
533
|
-
lt(t,
|
|
544
|
+
const {at: o, fragment: r} = n;
|
|
545
|
+
lt(t, o) && r.length && (t = it(t, o, o, r), e = ut(e, n));
|
|
534
546
|
break;
|
|
535
547
|
}
|
|
536
548
|
|
|
537
549
|
case "format":
|
|
538
550
|
{
|
|
539
|
-
const {range: [e,
|
|
540
|
-
if (lt(t, e) && lt(t,
|
|
541
|
-
const [{children: n}, ,
|
|
551
|
+
const {range: [e, o], key: r, value: c} = n;
|
|
552
|
+
if (lt(t, e) && lt(t, o) && e <= o) if (e === o) {
|
|
553
|
+
const [{children: n}, , o] = h(t, e);
|
|
542
554
|
if (1 === n.length) {
|
|
543
555
|
const e = n[0];
|
|
544
|
-
i(e) && !e.text && (t = st(t, [ ...
|
|
556
|
+
i(e) && !e.text && (t = st(t, [ ...o, 0 ], {
|
|
545
557
|
...e,
|
|
546
|
-
[
|
|
558
|
+
[r]: c
|
|
547
559
|
}));
|
|
548
560
|
}
|
|
549
561
|
} else {
|
|
@@ -552,29 +564,29 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
552
564
|
children: t.children.map(n)
|
|
553
565
|
} : i(t) ? {
|
|
554
566
|
...t,
|
|
555
|
-
[
|
|
567
|
+
[r]: c
|
|
556
568
|
} : t;
|
|
557
|
-
t = it(t, e,
|
|
569
|
+
t = it(t, e, o, E(t, e, o).map(n));
|
|
558
570
|
}
|
|
559
571
|
break;
|
|
560
572
|
}
|
|
561
573
|
|
|
562
574
|
case "patch_node":
|
|
563
575
|
{
|
|
564
|
-
const {path: e, key:
|
|
576
|
+
const {path: e, key: o, value: r} = n, c = ((t, e) => {
|
|
565
577
|
for (let n = 0; n < e.length; n++) t = t.children[e[n]];
|
|
566
578
|
return t;
|
|
567
579
|
})(t, e);
|
|
568
580
|
c && (t = st(t, e, {
|
|
569
581
|
...c,
|
|
570
|
-
[
|
|
582
|
+
[o]: r
|
|
571
583
|
}));
|
|
572
584
|
break;
|
|
573
585
|
}
|
|
574
586
|
}
|
|
575
587
|
return [ t, e ];
|
|
576
588
|
})(t, u, e);
|
|
577
|
-
(({type: t}) => t !== et && t !== tt)(e) && !d(n) || (t = n, A(
|
|
589
|
+
(({type: t}) => t !== et && t !== tt)(e) && !d(n) || (t = n, A(o));
|
|
578
590
|
} catch (n) {
|
|
579
591
|
a("rollback operation: " + n);
|
|
580
592
|
}
|
|
@@ -582,10 +594,10 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
582
594
|
}, f = t => {
|
|
583
595
|
t && (e = t), c++, s();
|
|
584
596
|
};
|
|
585
|
-
s(), n !== t &&
|
|
597
|
+
s(), n !== t && b("change");
|
|
586
598
|
}, A = e => {
|
|
587
599
|
!((t, [e, n]) => lt(t, e) && lt(t, n))(t, e) || u[0] === e[0] && u[1] === e[1] || (u = e,
|
|
588
|
-
|
|
600
|
+
b("selectionchange"));
|
|
589
601
|
}, O = {
|
|
590
602
|
get doc() {
|
|
591
603
|
return t;
|
|
@@ -600,18 +612,18 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
600
612
|
return e;
|
|
601
613
|
},
|
|
602
614
|
set readonly(t) {
|
|
603
|
-
e = t,
|
|
615
|
+
e = t, b("readonly");
|
|
604
616
|
},
|
|
605
617
|
apply: T,
|
|
606
618
|
on: (t, e) => {
|
|
607
|
-
let n =
|
|
608
|
-
return n ||
|
|
619
|
+
let n = x.get(t);
|
|
620
|
+
return n || x.set(t, n = /* @__PURE__ */ new Set), n.add(e), () => {
|
|
609
621
|
n.delete(e);
|
|
610
622
|
};
|
|
611
623
|
},
|
|
612
624
|
hook: (t, e) => {
|
|
613
|
-
let n =
|
|
614
|
-
return n ||
|
|
625
|
+
let n = y.get(t);
|
|
626
|
+
return n || y.set(t, n = []), n.push(e), () => {
|
|
615
627
|
const t = n.indexOf(e);
|
|
616
628
|
-1 !== t && n.splice(t, 1);
|
|
617
629
|
};
|
|
@@ -620,44 +632,44 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
620
632
|
const n = t(O, ...e);
|
|
621
633
|
return void 0 === n ? O : n;
|
|
622
634
|
},
|
|
623
|
-
get: t => (
|
|
624
|
-
set: (t, e) => (
|
|
635
|
+
get: t => (m.has(t) || f("No value found for key"), m.get(t)),
|
|
636
|
+
set: (t, e) => (m.set(t, e), O),
|
|
625
637
|
input: n => {
|
|
626
638
|
if (!window.InputEvent || !c(InputEvent.prototype.getTargetRanges)) return a("beforeinput event is not supported."),
|
|
627
|
-
|
|
639
|
+
xt;
|
|
628
640
|
const {contentEditable: s, role: i, ariaMultiLine: l, ariaReadOnly: f} = n, d = n.style.whiteSpace;
|
|
629
641
|
n.role = "textbox", n.style.whiteSpace = "pre-wrap", n.ariaMultiLine = "true";
|
|
630
|
-
let p = !1,
|
|
642
|
+
let p = !1, h = null, y = !1, m = !1, x = !1, v = u, b = null;
|
|
631
643
|
const E = G(n), w = ((t, e) => {
|
|
632
|
-
let n = null,
|
|
644
|
+
let n = null, o = null, r = null;
|
|
633
645
|
const c = () => {
|
|
634
|
-
if (null !=
|
|
635
|
-
if (
|
|
636
|
-
const t =
|
|
637
|
-
if (t) return
|
|
638
|
-
} else if (
|
|
639
|
-
if ("false" ===
|
|
646
|
+
if (null != r) return r;
|
|
647
|
+
if (o) if ((t => 3 === t.nodeType)(o)) {
|
|
648
|
+
const t = o.data;
|
|
649
|
+
if (t) return r = "\n" === t ? i() ? 3 : 5 : 1;
|
|
650
|
+
} else if (W(o)) {
|
|
651
|
+
if ("false" === o.contentEditable) return r = 2;
|
|
640
652
|
{
|
|
641
|
-
const t =
|
|
642
|
-
if (null != t) return
|
|
643
|
-
if (e(
|
|
653
|
+
const t = U.get(o.tagName);
|
|
654
|
+
if (null != t) return r = 1 === t ? i() ? 3 : 5 : 3 === t ? 2 : 6;
|
|
655
|
+
if (e(o)) return r = 4;
|
|
644
656
|
}
|
|
645
|
-
} else if (!(t => 11 === t.nodeType)(
|
|
646
|
-
return
|
|
657
|
+
} else if (!(t => 11 === t.nodeType)(o)) return r = 6;
|
|
658
|
+
return r = 0;
|
|
647
659
|
}, s = () => {
|
|
648
660
|
const t = c();
|
|
649
|
-
if (
|
|
650
|
-
const t =
|
|
651
|
-
if (
|
|
652
|
-
return
|
|
661
|
+
if (r = null, 2 === t || 6 === t) {
|
|
662
|
+
const t = o;
|
|
663
|
+
if (o = n.nextSibling(), !o) for (;(o = n.nextNode()) && t.contains(o); ) ;
|
|
664
|
+
return o;
|
|
653
665
|
}
|
|
654
|
-
return
|
|
666
|
+
return o = n.nextNode();
|
|
655
667
|
}, i = () => {
|
|
656
|
-
const t =
|
|
668
|
+
const t = o.parentNode;
|
|
657
669
|
return a(() => {
|
|
658
|
-
for (
|
|
670
|
+
for (r = 0; s(); ) {
|
|
659
671
|
if (c()) return !0;
|
|
660
|
-
if (!t.contains(
|
|
672
|
+
if (!t.contains(o)) break;
|
|
661
673
|
}
|
|
662
674
|
return !1;
|
|
663
675
|
});
|
|
@@ -668,67 +680,67 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
668
680
|
if (t && 6 !== t) return t;
|
|
669
681
|
}
|
|
670
682
|
},
|
|
671
|
-
|
|
672
|
-
i: () =>
|
|
683
|
+
m: c,
|
|
684
|
+
i: () => o,
|
|
673
685
|
l: () => {
|
|
674
686
|
const t = c();
|
|
675
|
-
return 1 === t ?
|
|
687
|
+
return 1 === t ? o.data.length : 2 === t ? 1 : 0;
|
|
676
688
|
},
|
|
677
689
|
u: t => {
|
|
678
|
-
|
|
690
|
+
r = null, n.currentNode = o = t;
|
|
679
691
|
},
|
|
680
692
|
h: () => {
|
|
681
|
-
for (;(
|
|
693
|
+
for (;(r = null) || (o = n.previousSibling()); ) if (4 === c()) return;
|
|
682
694
|
},
|
|
683
695
|
o: () => {
|
|
684
|
-
for (;(
|
|
696
|
+
for (;(r = null) || (o = n.nextSibling()); ) if (4 === c()) return;
|
|
685
697
|
},
|
|
686
698
|
p: () => {
|
|
687
|
-
for (;(
|
|
699
|
+
for (;(r = null) || (o = n.parentNode()); ) if (4 === c()) return;
|
|
688
700
|
}
|
|
689
701
|
}, a = (e, c) => {
|
|
690
|
-
const s = n, i =
|
|
702
|
+
const s = n, i = o, a = r;
|
|
691
703
|
try {
|
|
692
|
-
return n || (n = t.createTreeWalker(
|
|
704
|
+
return n || (n = t.createTreeWalker(o = c, 5)), e(l);
|
|
693
705
|
} finally {
|
|
694
|
-
n = s,
|
|
706
|
+
n = s, o = i, r = a, n && i && (n.currentNode = i);
|
|
695
707
|
}
|
|
696
708
|
};
|
|
697
709
|
return a;
|
|
698
|
-
})(E,
|
|
710
|
+
})(E, o), R = () => {
|
|
699
711
|
n.contentEditable = e ? "false" : "true", n.ariaReadOnly = e ? "true" : null;
|
|
700
712
|
};
|
|
701
713
|
R();
|
|
702
714
|
const D = () => {
|
|
703
|
-
|
|
715
|
+
m || n.focus({
|
|
704
716
|
preventScroll: !0
|
|
705
717
|
});
|
|
706
718
|
}, B = () => {
|
|
707
|
-
|
|
719
|
+
b = null, u[0] === v[0] && u[1] === v[1] || (Z(n, w, t, u), v = u);
|
|
708
720
|
}, I = () => {
|
|
709
|
-
null !=
|
|
710
|
-
},
|
|
711
|
-
|
|
712
|
-
}),
|
|
713
|
-
u[0] ===
|
|
714
|
-
}),
|
|
715
|
-
for (const e of
|
|
721
|
+
null != b && clearTimeout(b);
|
|
722
|
+
}, L = O.on("change", () => {
|
|
723
|
+
m || requestAnimationFrame(D);
|
|
724
|
+
}), P = O.on("selectionchange", () => {
|
|
725
|
+
u[0] === v[0] && u[1] === v[1] || (I(), b = setTimeout(B, 50));
|
|
726
|
+
}), H = O.on("readonly", R), N = t => {
|
|
727
|
+
for (const e of k("paste")) {
|
|
716
728
|
const n = e(t);
|
|
717
729
|
if (n) return n;
|
|
718
730
|
}
|
|
719
731
|
a("failed to serialize pasted data");
|
|
720
|
-
},
|
|
721
|
-
let n = !1,
|
|
722
|
-
const
|
|
723
|
-
n &&
|
|
732
|
+
}, C = ((t, e) => {
|
|
733
|
+
let n = !1, o = [];
|
|
734
|
+
const r = t => {
|
|
735
|
+
n && o.push(...t);
|
|
724
736
|
}, c = new MutationObserver(t => {
|
|
725
|
-
|
|
737
|
+
r(t), n || e();
|
|
726
738
|
}), s = () => {
|
|
727
|
-
|
|
739
|
+
r(c.takeRecords());
|
|
728
740
|
}, i = () => {
|
|
729
741
|
s();
|
|
730
|
-
const t =
|
|
731
|
-
return
|
|
742
|
+
const t = o;
|
|
743
|
+
return o = [], t;
|
|
732
744
|
};
|
|
733
745
|
return c.observe(t, {
|
|
734
746
|
characterData: !0,
|
|
@@ -736,12 +748,12 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
736
748
|
childList: !0,
|
|
737
749
|
subtree: !0
|
|
738
750
|
}), {
|
|
739
|
-
|
|
751
|
+
k: t => {
|
|
740
752
|
let e;
|
|
741
753
|
for (;e = t.pop(); ) if ("childList" === e.type) {
|
|
742
|
-
const {target: t, removedNodes: n, addedNodes:
|
|
743
|
-
for (let e = n.length - 1; e >= 0; e--) t.insertBefore(n[e],
|
|
744
|
-
for (let e =
|
|
754
|
+
const {target: t, removedNodes: n, addedNodes: o, nextSibling: r} = e;
|
|
755
|
+
for (let e = n.length - 1; e >= 0; e--) t.insertBefore(n[e], r);
|
|
756
|
+
for (let e = o.length - 1; e >= 0; e--) t.removeChild(o[e]);
|
|
745
757
|
} else e.target.data = e.oldValue;
|
|
746
758
|
i();
|
|
747
759
|
},
|
|
@@ -750,41 +762,41 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
750
762
|
},
|
|
751
763
|
v: i,
|
|
752
764
|
T: () => {
|
|
753
|
-
|
|
765
|
+
o.length = 0, c.disconnect();
|
|
754
766
|
}
|
|
755
767
|
};
|
|
756
768
|
})(n, () => {
|
|
757
769
|
I(), Z(n, w, t, u);
|
|
758
|
-
}),
|
|
759
|
-
A(
|
|
760
|
-
const n = J(t),
|
|
761
|
-
if (!
|
|
762
|
-
const
|
|
763
|
-
return (0 === c ? n.anchorOffset > n.focusOffset : 2 & c) ? [
|
|
770
|
+
}), F = () => {
|
|
771
|
+
A(v = _(t, ((t, e) => {
|
|
772
|
+
const n = J(t), o = Y(n, t);
|
|
773
|
+
if (!o) return [ [ [ 0 ], 0 ], [ [ 0 ], 0 ] ];
|
|
774
|
+
const r = Q(t, e, o), c = z(n.anchorNode, n.focusNode);
|
|
775
|
+
return (0 === c ? n.anchorOffset > n.focusOffset : 2 & c) ? [ r[1], r[0] ] : r;
|
|
764
776
|
})(n, w)));
|
|
765
|
-
},
|
|
766
|
-
const e =
|
|
767
|
-
|
|
768
|
-
E.addEventListener("selectionchange",
|
|
777
|
+
}, V = () => {
|
|
778
|
+
const e = C.v();
|
|
779
|
+
C._(!1), e.length && (C.k(e), E.removeEventListener("selectionchange", ot), Z(n, w, t, u, !0),
|
|
780
|
+
E.addEventListener("selectionchange", ot)), h && (A(h[1]), T(h[0]), h = null), y = !1;
|
|
769
781
|
}, q = t => {
|
|
770
|
-
if (!
|
|
771
|
-
},
|
|
772
|
-
|
|
782
|
+
if (!y) for (const e of k("keyboard")) if (e(t)) return t.preventDefault(), void C._(!1);
|
|
783
|
+
}, X = () => {
|
|
784
|
+
y || V();
|
|
773
785
|
}, j = e => {
|
|
774
786
|
e.preventDefault();
|
|
775
|
-
const
|
|
776
|
-
if (
|
|
777
|
-
if ("historyUndo" ===
|
|
778
|
-
|
|
779
|
-
const
|
|
780
|
-
if (
|
|
781
|
-
let c = "insertParagraph" ===
|
|
787
|
+
const o = e.inputType;
|
|
788
|
+
if (o.startsWith("format")) return;
|
|
789
|
+
if ("historyUndo" === o || "historyRedo" === o) return;
|
|
790
|
+
y ? C._(!0) : F();
|
|
791
|
+
const r = e.getTargetRanges()[0];
|
|
792
|
+
if (r) {
|
|
793
|
+
let c = "insertParagraph" === o || "insertLineBreak" === o ? "\n" : e.data;
|
|
782
794
|
if (null == c) {
|
|
783
795
|
const t = e.dataTransfer;
|
|
784
796
|
t && (c = t.getData("text/plain"));
|
|
785
797
|
}
|
|
786
|
-
|
|
787
|
-
const s =
|
|
798
|
+
h || (h = [ [], u ]);
|
|
799
|
+
const s = h[0], i = _(t, Q(n, w, r));
|
|
788
800
|
S(i) || s.push({
|
|
789
801
|
type: "delete",
|
|
790
802
|
range: i
|
|
@@ -794,35 +806,35 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
794
806
|
text: c
|
|
795
807
|
});
|
|
796
808
|
}
|
|
797
|
-
|
|
809
|
+
y || V();
|
|
798
810
|
}, $ = () => {
|
|
799
|
-
|
|
811
|
+
y || F(), y = !0;
|
|
800
812
|
}, tt = () => {
|
|
801
|
-
|
|
813
|
+
V();
|
|
802
814
|
}, et = () => {
|
|
803
|
-
|
|
815
|
+
m = !0, F();
|
|
804
816
|
}, nt = () => {
|
|
805
|
-
|
|
806
|
-
},
|
|
807
|
-
!
|
|
808
|
-
},
|
|
809
|
-
if (
|
|
817
|
+
m = !1;
|
|
818
|
+
}, ot = () => {
|
|
819
|
+
!m || y || x || F();
|
|
820
|
+
}, rt = t => {
|
|
821
|
+
if (F(), !S(u)) for (const e of k("copy")) e(t);
|
|
810
822
|
}, ct = t => {
|
|
811
|
-
t.preventDefault(),
|
|
823
|
+
t.preventDefault(), rt(t.clipboardData);
|
|
812
824
|
}, st = t => {
|
|
813
|
-
t.preventDefault(), e || (
|
|
825
|
+
t.preventDefault(), e || (rt(t.clipboardData), T({
|
|
814
826
|
type: "delete",
|
|
815
827
|
range: M(u)
|
|
816
828
|
}));
|
|
817
829
|
}, it = t => {
|
|
818
830
|
t.preventDefault();
|
|
819
|
-
const e =
|
|
831
|
+
const e = N(t.clipboardData);
|
|
820
832
|
if (e) {
|
|
821
|
-
const t = M(u), n = t[0],
|
|
833
|
+
const t = M(u), n = t[0], o = [ {
|
|
822
834
|
type: "delete",
|
|
823
835
|
range: t
|
|
824
836
|
} ];
|
|
825
|
-
|
|
837
|
+
o.push(r(e) ? {
|
|
826
838
|
type: "insert_text",
|
|
827
839
|
at: n,
|
|
828
840
|
text: e
|
|
@@ -830,31 +842,31 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
830
842
|
type: "insert_node",
|
|
831
843
|
at: n,
|
|
832
844
|
fragment: e
|
|
833
|
-
}), T(
|
|
845
|
+
}), T(o);
|
|
834
846
|
}
|
|
835
847
|
}, lt = e => {
|
|
836
848
|
e.preventDefault();
|
|
837
|
-
const
|
|
838
|
-
const
|
|
839
|
-
if (
|
|
840
|
-
const c =
|
|
849
|
+
const o = e.dataTransfer, c = ((t, e, {clientX: n, clientY: o}) => {
|
|
850
|
+
const r = G(t);
|
|
851
|
+
if (r.caretPositionFromPoint) {
|
|
852
|
+
const c = r.caretPositionFromPoint(n, o);
|
|
841
853
|
if (c) return K(t, e, c.offsetNode, c.offset);
|
|
842
|
-
} else if (
|
|
843
|
-
const c =
|
|
854
|
+
} else if (r.caretRangeFromPoint) {
|
|
855
|
+
const c = r.caretRangeFromPoint(n, o);
|
|
844
856
|
if (c) return K(t, e, c.startContainer, c.startOffset);
|
|
845
857
|
}
|
|
846
858
|
})(n, w, e);
|
|
847
|
-
if (
|
|
859
|
+
if (o && c) {
|
|
848
860
|
let e;
|
|
849
861
|
const n = [];
|
|
850
|
-
|
|
862
|
+
x && n.push({
|
|
851
863
|
type: "delete",
|
|
852
864
|
range: M(u)
|
|
853
865
|
});
|
|
854
|
-
const s =
|
|
866
|
+
const s = N(o);
|
|
855
867
|
if (s) {
|
|
856
|
-
const
|
|
857
|
-
n.push(
|
|
868
|
+
const o = g(t, c), i = at(o, n);
|
|
869
|
+
n.push(r(s) ? {
|
|
858
870
|
type: "insert_text",
|
|
859
871
|
at: i,
|
|
860
872
|
text: s
|
|
@@ -862,29 +874,29 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
862
874
|
type: "insert_node",
|
|
863
875
|
at: i,
|
|
864
876
|
fragment: s
|
|
865
|
-
}), e = [ i, at(
|
|
877
|
+
}), e = [ i, at(o, n) ];
|
|
866
878
|
}
|
|
867
879
|
T(n), e && A(e);
|
|
868
880
|
}
|
|
869
|
-
|
|
881
|
+
x = !1;
|
|
870
882
|
}, ft = t => {
|
|
871
|
-
|
|
883
|
+
x = !0, rt(t.dataTransfer);
|
|
872
884
|
}, ut = () => {
|
|
873
|
-
|
|
885
|
+
x = !1;
|
|
874
886
|
};
|
|
875
|
-
E.addEventListener("selectionchange",
|
|
887
|
+
E.addEventListener("selectionchange", ot), n.addEventListener("keydown", q), n.addEventListener("input", X),
|
|
876
888
|
n.addEventListener("beforeinput", j), n.addEventListener("compositionstart", $),
|
|
877
889
|
n.addEventListener("compositionend", tt), n.addEventListener("focus", et), n.addEventListener("blur", nt),
|
|
878
890
|
n.addEventListener("copy", ct), n.addEventListener("cut", st), n.addEventListener("paste", it),
|
|
879
891
|
n.addEventListener("drop", lt), n.addEventListener("dragstart", ft), n.addEventListener("dragend", ut);
|
|
880
892
|
const dt = [];
|
|
881
|
-
return
|
|
893
|
+
return k("mount").forEach(t => {
|
|
882
894
|
const e = t(n, w);
|
|
883
895
|
e && dt.push(e);
|
|
884
896
|
}), () => {
|
|
885
|
-
p || (p = !0,
|
|
886
|
-
n.ariaReadOnly = f, n.style.whiteSpace = d,
|
|
887
|
-
n.removeEventListener("keydown", q), n.removeEventListener("input",
|
|
897
|
+
p || (p = !0, L(), P(), H(), n.contentEditable = s, n.role = i, n.ariaMultiLine = l,
|
|
898
|
+
n.ariaReadOnly = f, n.style.whiteSpace = d, C.T(), E.removeEventListener("selectionchange", ot),
|
|
899
|
+
n.removeEventListener("keydown", q), n.removeEventListener("input", X), n.removeEventListener("beforeinput", j),
|
|
888
900
|
n.removeEventListener("compositionstart", $), n.removeEventListener("compositionend", tt),
|
|
889
901
|
n.removeEventListener("focus", et), n.removeEventListener("blur", nt), n.removeEventListener("copy", ct),
|
|
890
902
|
n.removeEventListener("cut", st), n.removeEventListener("paste", it), n.removeEventListener("drop", lt),
|
|
@@ -894,7 +906,7 @@ var xt = [], _t = () => {}, bt = t => {
|
|
|
894
906
|
};
|
|
895
907
|
}
|
|
896
908
|
};
|
|
897
|
-
return O.exec(
|
|
909
|
+
return O.exec(ht), O;
|
|
898
910
|
}, Tt = (t, e) => {
|
|
899
911
|
t.hook("paste", t => {
|
|
900
912
|
for (const n of t.items) if ("file" === n.kind) {
|
|
@@ -918,14 +930,14 @@ function Et(t, e) {
|
|
|
918
930
|
}
|
|
919
931
|
|
|
920
932
|
function Mt(t, e) {
|
|
921
|
-
t.hook("mount", (n,
|
|
922
|
-
const
|
|
933
|
+
t.hook("mount", (n, o) => {
|
|
934
|
+
const r = t.hook("copy", t => {
|
|
923
935
|
const e = document.createElement("div");
|
|
924
|
-
e.appendChild(
|
|
936
|
+
e.appendChild(Y(J(n), n).cloneContents()), t.setData("text/html", e.innerHTML);
|
|
925
937
|
}), c = t.hook("paste", t => {
|
|
926
938
|
const n = t.getData("text/html");
|
|
927
939
|
return n ? ((t, e, n) => {
|
|
928
|
-
const
|
|
940
|
+
const o = n.text, r = t => {
|
|
929
941
|
const e = n[t.tagName.toLowerCase()];
|
|
930
942
|
if (e) {
|
|
931
943
|
const n = e(t);
|
|
@@ -933,12 +945,12 @@ function Mt(t, e) {
|
|
|
933
945
|
}
|
|
934
946
|
};
|
|
935
947
|
let c = (new DOMParser).parseFromString(t, "text/html").body, s = !1;
|
|
936
|
-
for (const i of [ ...c.childNodes ])
|
|
948
|
+
for (const i of [ ...c.childNodes ]) F(i) ? "StartFragment" === i.data ? (s = !0,
|
|
937
949
|
c = new DocumentFragment) : "EndFragment" === i.data && (s = !1) : s && c.appendChild(i);
|
|
938
950
|
return e(({t, i: e}) => {
|
|
939
951
|
let n, c = null, s = "", i = !1;
|
|
940
952
|
const l = [], a = () => {
|
|
941
|
-
s && (c || (c = []), c.push(
|
|
953
|
+
s && (c || (c = []), c.push(o(s)), s = "");
|
|
942
954
|
}, f = () => {
|
|
943
955
|
a(), !c && i && (c = []), c && l.push({
|
|
944
956
|
children: c
|
|
@@ -946,17 +958,17 @@ function Mt(t, e) {
|
|
|
946
958
|
};
|
|
947
959
|
for (;n = t(); ) if (4 === n) f(); else if (i = !0, 1 === n) s += e().data; else if (2 === n) {
|
|
948
960
|
a();
|
|
949
|
-
const t =
|
|
961
|
+
const t = r(e());
|
|
950
962
|
t && c.push(t);
|
|
951
963
|
} else 3 === n && f();
|
|
952
964
|
return f(), l.length || l.push({
|
|
953
965
|
children: []
|
|
954
966
|
}), l;
|
|
955
967
|
}, c);
|
|
956
|
-
})(n,
|
|
968
|
+
})(n, o, e.serializers) : null;
|
|
957
969
|
});
|
|
958
970
|
return () => {
|
|
959
|
-
|
|
971
|
+
r(), c();
|
|
960
972
|
};
|
|
961
973
|
});
|
|
962
974
|
}
|
|
@@ -987,29 +999,79 @@ function At(t) {
|
|
|
987
999
|
|
|
988
1000
|
function Ot(t, e) {
|
|
989
1001
|
n(e).forEach(n => {
|
|
990
|
-
const
|
|
991
|
-
t.hook("keyboard", pt(n,
|
|
1002
|
+
const o = e[n];
|
|
1003
|
+
t.hook("keyboard", pt(n, o));
|
|
992
1004
|
});
|
|
993
1005
|
}
|
|
994
1006
|
|
|
995
|
-
|
|
996
|
-
|
|
997
|
-
|
|
1007
|
+
var Rt = (t, e) => {
|
|
1008
|
+
const n = parseFloat(t);
|
|
1009
|
+
return n ? t.endsWith("%") ? n / 100 * e : n : 0;
|
|
1010
|
+
}, Dt = (t, e, n, o) => [ t + Rt(n, e), t + e - Rt(o, e) ], Bt = (t, e, [n, o]) => t < n ? t - n : e > o ? e - o : 0, It = (t, e, n) => Math.max(-e, Math.min(t, n - e)), Lt = (t, {smooth: e} = {}) => {
|
|
1011
|
+
const n = e ? "smooth" : "auto";
|
|
1012
|
+
t.hook("mount", (e, o) => {
|
|
1013
|
+
const r = G(e), c = r.defaultView, s = ((t, e, n) => {
|
|
1014
|
+
const {body: o, documentElement: r} = e;
|
|
1015
|
+
let c = t;
|
|
1016
|
+
for (;c && c !== o && c !== r; ) {
|
|
1017
|
+
const {overflowY: t} = n.getComputedStyle(c);
|
|
1018
|
+
if ("auto" === t || "scroll" === t || "overlay" === t) return c;
|
|
1019
|
+
c = c.parentElement;
|
|
1020
|
+
}
|
|
1021
|
+
return null;
|
|
1022
|
+
})(e, r, c);
|
|
1023
|
+
let i = null;
|
|
1024
|
+
const l = t.on("change", () => {
|
|
1025
|
+
null == i && (i = setTimeout(() => {
|
|
1026
|
+
i = null;
|
|
1027
|
+
const r = X(e, o, t.doc, t.selection);
|
|
1028
|
+
let l = r.getBoundingClientRect();
|
|
1029
|
+
if (!l.height) {
|
|
1030
|
+
const t = r.startContainer, e = W(t) ? t : t.parentElement;
|
|
1031
|
+
e && (l = e.getBoundingClientRect());
|
|
1032
|
+
}
|
|
1033
|
+
const a = s ? ((t, e, n, o) => {
|
|
1034
|
+
const {scrollLeft: r, scrollTop: c, scrollWidth: s, scrollHeight: i, clientLeft: l, clientTop: a, clientWidth: f, clientHeight: u} = e, d = e.getBoundingClientRect(), p = t.getComputedStyle(e), h = It(Bt(n.top, n.bottom, Dt(d.top + a, u, p.scrollPaddingTop, p.scrollPaddingBottom)), c, i - u), y = It(Bt(n.left, n.right, Dt(d.left + l, f, p.scrollPaddingLeft, p.scrollPaddingRight)), r, s - f);
|
|
1035
|
+
return (h || y) && e.scrollBy({
|
|
1036
|
+
top: h,
|
|
1037
|
+
left: y,
|
|
1038
|
+
behavior: o
|
|
1039
|
+
}), [ y, h ];
|
|
1040
|
+
})(c, s, l, n) : [ 0, 0 ];
|
|
1041
|
+
((t, e, [n, o], r) => {
|
|
1042
|
+
const {documentElement: c} = t.document, {clientWidth: s, clientHeight: i} = c, l = t.getComputedStyle(c), a = Bt(e.top - o, e.bottom - o, Dt(0, i, l.scrollPaddingTop, l.scrollPaddingBottom)), f = Bt(e.left - n, e.right - n, Dt(0, s, l.scrollPaddingLeft, l.scrollPaddingRight));
|
|
1043
|
+
(a || f) && t.scrollBy({
|
|
1044
|
+
top: a,
|
|
1045
|
+
left: f,
|
|
1046
|
+
behavior: r
|
|
1047
|
+
});
|
|
1048
|
+
})(c, l, a, n);
|
|
1049
|
+
}, 50));
|
|
1050
|
+
});
|
|
1051
|
+
return () => {
|
|
1052
|
+
null != i && clearTimeout(i), l();
|
|
1053
|
+
};
|
|
1054
|
+
});
|
|
1055
|
+
};
|
|
1056
|
+
|
|
1057
|
+
function Pt(t, e) {
|
|
1058
|
+
t.hook("mount", (n, o) => {
|
|
1059
|
+
let r = !0, c = !1;
|
|
998
1060
|
const s = t.on("selectionchange", () => {
|
|
999
1061
|
c || (c = !0, requestAnimationFrame(() => {
|
|
1000
|
-
c = !1,
|
|
1062
|
+
c = !1, r && e(() => {
|
|
1001
1063
|
const e = t.selection;
|
|
1002
|
-
return
|
|
1064
|
+
return X(n, o, t.doc, e).getBoundingClientRect();
|
|
1003
1065
|
});
|
|
1004
1066
|
}));
|
|
1005
1067
|
});
|
|
1006
1068
|
return () => {
|
|
1007
|
-
|
|
1069
|
+
r = !1, s();
|
|
1008
1070
|
};
|
|
1009
1071
|
});
|
|
1010
1072
|
}
|
|
1011
1073
|
|
|
1012
|
-
function
|
|
1074
|
+
function Ht(t) {
|
|
1013
1075
|
t.hook("mount", t => {
|
|
1014
1076
|
t.ariaMultiLine = null;
|
|
1015
1077
|
}), t.hook("apply", (t, e) => {
|
|
@@ -1027,17 +1089,17 @@ function Dt(t) {
|
|
|
1027
1089
|
});
|
|
1028
1090
|
}
|
|
1029
1091
|
|
|
1030
|
-
var
|
|
1031
|
-
const
|
|
1032
|
-
...
|
|
1092
|
+
var Nt = ({text: t, singleline: e, onChange: n, ...o}) => {
|
|
1093
|
+
const r = bt({
|
|
1094
|
+
...o,
|
|
1033
1095
|
doc: {
|
|
1034
1096
|
children: $(t)
|
|
1035
1097
|
}
|
|
1036
1098
|
}).exec(Et);
|
|
1037
|
-
return e &&
|
|
1038
|
-
n(T(
|
|
1039
|
-
}),
|
|
1099
|
+
return e && r.exec(Ht), r.on("change", () => {
|
|
1100
|
+
n(T(r.doc));
|
|
1101
|
+
}), r;
|
|
1040
1102
|
};
|
|
1041
1103
|
|
|
1042
|
-
export { O as Delete,
|
|
1104
|
+
export { O as Delete, L as Format, D as InsertNode, R as InsertText, A as LeavesInRange, mt as Redo, kt as Redoable, I as ReplaceDoc, B as ReplaceText, H as SetBlockAttr, C as SetVoidAttr, N as ToggleBlockAttr, P as ToggleFormat, yt as Undo, gt as Undoable, bt as createEditor, Nt as createPlainEditor, At as debugPlugin, Tt as fileTransferPlugin, p as getChildAt, y as getLeafAt, h as getLeafBlockAt, d as getNodeSize, Mt as htmlTransferPlugin, wt as internalTranferPlugin, v as iterLeafBlocks, b as iterLeaves, Ot as keymapPlugin, Et as plainTransferPlugin, Lt as scrollToSelectionPlugin, Pt as selectionRectPlugin, Ht as singlelinePlugin, T as sliceText };
|
|
1043
1105
|
//# sourceMappingURL=index.js.map
|