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