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