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