editate 0.6.12 → 0.6.13
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 +1 -1
- package/lib/doc/types.d.ts +3 -6
- package/lib/dom/index.d.ts +3 -0
- package/lib/index.cjs +227 -199
- package/lib/index.cjs.map +1 -1
- package/lib/index.js +336 -306
- package/lib/index.js.map +1 -1
- package/lib/keyboard.d.ts +1 -1
- package/lib/plugins/index.d.ts +1 -0
- package/lib/plugins/keymap.d.ts +1 -1
- package/lib/plugins/selectionRect.d.ts +5 -0
- package/package.json +2 -1
package/lib/index.cjs
CHANGED
|
@@ -110,7 +110,7 @@ function* x(t, n, r) {
|
|
|
110
110
|
for (const o of p(t, n, r)) e(o[0]) || (yield o);
|
|
111
111
|
}
|
|
112
112
|
|
|
113
|
-
var
|
|
113
|
+
var h = (t, e, n) => e >= n ? [] : a(a(t, n)[0], e)[1].children, y = ([t, e]) => t > e ? [ e, t ] : [ t, e ], k = ([t, e]) => t === e, g = ([t, e], [n, r]) => t < r && n < e;
|
|
114
114
|
|
|
115
115
|
function m(t, e) {
|
|
116
116
|
t.apply({
|
|
@@ -128,15 +128,18 @@ var _ = t => 1 === t.nodeType, b = t => 8 === t.nodeType, v = new Map([ [ "BR",
|
|
|
128
128
|
const n = t.getRangeAt(0);
|
|
129
129
|
if (e.contains(n.commonAncestorContainer)) return n;
|
|
130
130
|
}
|
|
131
|
-
}, N = (t, e, n,
|
|
132
|
-
const i =
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
131
|
+
}, N = (t, e, [n, r], o) => {
|
|
132
|
+
const s = B(t), c = 0 === o, i = o > 0, a = i ? n : r, l = C(t, e, i ? r : n), f = c ? l : C(t, e, a), u = s.createRange(), [d, p] = l, [x, h] = f;
|
|
133
|
+
return _(d) && t !== d ? p < 1 ? u.setStartBefore(d) : u.setStartAfter(d) : u.setStart(d, p),
|
|
134
|
+
_(x) && t !== x ? h < 1 ? u.setEndBefore(x) : u.setEndAfter(x) : u.setEnd(x, h),
|
|
135
|
+
u;
|
|
136
|
+
}, L = (t, e, n, r, o) => {
|
|
137
|
+
const s = I(t);
|
|
138
|
+
if (o || P(s, t)) {
|
|
139
|
+
const o = N(t, e, n, r), c = r > 0;
|
|
140
|
+
s.removeAllRanges(), s.addRange(o), c && (s.collapseToEnd(), s.extend(o.startContainer, o.startOffset));
|
|
138
141
|
}
|
|
139
|
-
},
|
|
142
|
+
}, C = (t, e, [n, r]) => e(({t: e, o, i: s, l: c}) => {
|
|
140
143
|
let i, a = 0;
|
|
141
144
|
for (;i = e(); ) if (4 === i) {
|
|
142
145
|
if (a < n.length) for (let t = n[a++]; t > 0; t--) o();
|
|
@@ -146,9 +149,9 @@ var _ = t => 1 === t.nodeType, b = t => 8 === t.nodeType, v = new Map([ [ "BR",
|
|
|
146
149
|
r -= t;
|
|
147
150
|
}
|
|
148
151
|
return [ t, 0 ];
|
|
149
|
-
}, t),
|
|
152
|
+
}, t), H = (t, e, n, r) => {
|
|
150
153
|
let o = !0;
|
|
151
|
-
if (t === n && !n.hasChildNodes()) return [ [
|
|
154
|
+
if (t === n && !n.hasChildNodes()) return [ [], 0 ];
|
|
152
155
|
if (_(n) && n.hasChildNodes()) {
|
|
153
156
|
const t = E(r, n.childNodes.length - 1);
|
|
154
157
|
n = n.childNodes[t], o = t === r, r = 0;
|
|
@@ -162,7 +165,7 @@ var _ = t => 1 === t.nodeType, b = t => 8 === t.nodeType, v = new Map([ [ "BR",
|
|
|
162
165
|
for (;a(), u(); ) t++;
|
|
163
166
|
e.unshift(t), i();
|
|
164
167
|
}
|
|
165
|
-
return e
|
|
168
|
+
return e;
|
|
166
169
|
});
|
|
167
170
|
let p = 0;
|
|
168
171
|
for (;s(); ) {
|
|
@@ -174,48 +177,51 @@ var _ = t => 1 === t.nodeType, b = t => 8 === t.nodeType, v = new Map([ [ "BR",
|
|
|
174
177
|
}
|
|
175
178
|
return [ d, p + r ];
|
|
176
179
|
}, t);
|
|
177
|
-
},
|
|
178
|
-
const c =
|
|
179
|
-
return [ c, r === s && n === o ? c :
|
|
180
|
+
}, F = (t, e, {startOffset: n, startContainer: r, endOffset: o, endContainer: s}) => {
|
|
181
|
+
const c = H(t, e, r, n);
|
|
182
|
+
return [ c, r === s && n === o ? c : H(t, e, s, o) ];
|
|
180
183
|
}, U = (n, r = e => t(e) ? e.text : "") => n.children.reduce((t, n, o) => {
|
|
181
184
|
const s = e(n);
|
|
182
185
|
return 0 !== o && s && (t += "\n"), t + (s ? n.children.reduce((t, e) => t + r(e), "") : "");
|
|
183
|
-
}, ""),
|
|
186
|
+
}, ""), V = (t, e, n) => t.split("\n").map(t => ({
|
|
184
187
|
...n,
|
|
185
188
|
children: [ {
|
|
186
189
|
...e,
|
|
187
190
|
text: t
|
|
188
191
|
} ]
|
|
189
|
-
})),
|
|
192
|
+
})), W = "delete", q = "insert_text", z = "insert_node", G = t => t.some(e), J = (t, e) => {
|
|
190
193
|
const n = T(t);
|
|
191
194
|
return n.length === T(e).length && n.every(n => n in e && ("text" === n || M(t[n], e[n])));
|
|
192
|
-
},
|
|
193
|
-
|
|
194
|
-
|
|
195
|
-
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
}
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
195
|
+
}, j = (n, r) => {
|
|
196
|
+
if (r.length) {
|
|
197
|
+
const o = n.length;
|
|
198
|
+
if (n.push(...r), o) {
|
|
199
|
+
const r = n[o - 1], s = n[o];
|
|
200
|
+
e(r) ? e(s) && ((t, e = 0, n = t.length - 1) => {
|
|
201
|
+
let r = e + 1;
|
|
202
|
+
for (;r <= n; ) {
|
|
203
|
+
const e = t[r - 1], o = t[r];
|
|
204
|
+
t[r - 1] = X(e, o), t.splice(r, 1), n--;
|
|
205
|
+
}
|
|
206
|
+
})(n, o - 1, o) : t(r) && t(s) && ((e, n = 0, r = e.length - 1) => {
|
|
207
|
+
let o = n + 1;
|
|
208
|
+
for (;o <= r; ) {
|
|
209
|
+
const n = e[o - 1], s = e[o];
|
|
210
|
+
t(n) && t(s) && J(n, s) ? (e[o - 1] = {
|
|
211
|
+
...n,
|
|
212
|
+
text: n.text + s.text
|
|
213
|
+
}, e.splice(o, 1), r--) : o++;
|
|
214
|
+
}
|
|
215
|
+
for (o = n; o <= r; ) {
|
|
216
|
+
const n = e[o];
|
|
217
|
+
t(n) && !n.text && e.length > 1 ? (e.splice(o, 1), r--) : o++;
|
|
218
|
+
}
|
|
219
|
+
})(n, o - 1, o);
|
|
220
|
+
}
|
|
215
221
|
}
|
|
216
222
|
}, X = (...t) => ({
|
|
217
223
|
...t[0],
|
|
218
|
-
children: t.reduce((t, e) => (j(t, e.children
|
|
224
|
+
children: t.reduce((t, e) => (j(t, e.children), t), [])
|
|
219
225
|
}), Y = (t, e, n, r = 0) => {
|
|
220
226
|
if (r < e.length) {
|
|
221
227
|
const o = e[r];
|
|
@@ -229,21 +235,25 @@ var _ = t => 1 === t.nodeType, b = t => 8 === t.nodeType, v = new Map([ [ "BR",
|
|
|
229
235
|
}
|
|
230
236
|
return n;
|
|
231
237
|
}, Z = (t, e, n, r) => {
|
|
232
|
-
const [o, s] = a(t, e), c = e < n ? a(t, n)[1] : s, i =
|
|
233
|
-
|
|
238
|
+
const [o, s] = a(t, e), c = e < n ? a(t, n)[1] : s, i = G(t.children);
|
|
239
|
+
G(r) ? i || (r = X(...r).children) : i && (r = [ {
|
|
240
|
+
children: r
|
|
241
|
+
} ]);
|
|
242
|
+
const l = o.children.slice();
|
|
243
|
+
return j(l, r), j(l, c.children), {
|
|
234
244
|
...t,
|
|
235
|
-
children:
|
|
245
|
+
children: l
|
|
236
246
|
};
|
|
237
247
|
}, K = (t, e) => e >= 0 && e <= o(t), Q = (t, e) => e.reduce((t, e) => $(t, e), t), $ = (t, e) => {
|
|
238
248
|
switch (e.type) {
|
|
239
|
-
case
|
|
249
|
+
case W:
|
|
240
250
|
{
|
|
241
251
|
const [n, r] = e.range;
|
|
242
252
|
if (t >= n) return r >= t ? n : t + n - r;
|
|
243
253
|
break;
|
|
244
254
|
}
|
|
245
255
|
|
|
246
|
-
case
|
|
256
|
+
case q:
|
|
247
257
|
{
|
|
248
258
|
const {at: n, text: r} = e;
|
|
249
259
|
if (t >= n) return t + r.length;
|
|
@@ -285,8 +295,7 @@ var _ = t => 1 === t.nodeType, b = t => 8 === t.nodeType, v = new Map([ [ "BR",
|
|
|
285
295
|
c = !0;
|
|
286
296
|
}
|
|
287
297
|
}), t => {
|
|
288
|
-
if (t.key.toLowerCase() === s && i === t.ctrlKey && a === t.metaKey && c === t.shiftKey && l === t.altKey) return e(t)
|
|
289
|
-
!0;
|
|
298
|
+
if (t.key.toLowerCase() === s && i === t.ctrlKey && a === t.metaKey && c === t.shiftKey && l === t.altKey) return !1 !== e(t);
|
|
290
299
|
};
|
|
291
300
|
};
|
|
292
301
|
|
|
@@ -332,147 +341,150 @@ function rt(t) {
|
|
|
332
341
|
|
|
333
342
|
var ot = [], st = () => {}, ct = t => {
|
|
334
343
|
throw Error(t);
|
|
335
|
-
}, it = ({doc:
|
|
336
|
-
let
|
|
337
|
-
const
|
|
338
|
-
if (!
|
|
344
|
+
}, it = ({doc: n, readonly: r = !1, schema: o, isBlock: i = R, onWarn: a = console.warn, onError: f = ct}) => {
|
|
345
|
+
let p = [ 0, 0 ];
|
|
346
|
+
const x = t => {
|
|
347
|
+
if (!o) return a("An unsafe operation was detected. We recommend using schema option."),
|
|
339
348
|
!0;
|
|
340
|
-
const e =
|
|
341
|
-
if (e instanceof Promise)
|
|
349
|
+
const e = o["~standard"].validate(t);
|
|
350
|
+
if (e instanceof Promise) f("async validate is not supported"); else {
|
|
342
351
|
if (!e.issues) return !0;
|
|
343
|
-
|
|
352
|
+
a(e.issues.map(t => t.message).join("\n"));
|
|
344
353
|
}
|
|
345
354
|
return !1;
|
|
346
355
|
};
|
|
347
|
-
|
|
348
|
-
const
|
|
349
|
-
const e =
|
|
350
|
-
e && (
|
|
351
|
-
|
|
356
|
+
o && !x(n) && f("Invalid document");
|
|
357
|
+
const g = new Map, m = new WeakMap, b = t => g.get(t) || ot, E = new Map, T = new Set, O = t => {
|
|
358
|
+
const e = E.get(t);
|
|
359
|
+
e && (T.size || A(() => {
|
|
360
|
+
T.forEach(t => {
|
|
352
361
|
t();
|
|
353
|
-
}),
|
|
362
|
+
}), T.clear();
|
|
354
363
|
}), e.forEach(t => {
|
|
355
|
-
|
|
364
|
+
T.add(t);
|
|
356
365
|
}));
|
|
357
|
-
},
|
|
358
|
-
if (!
|
|
366
|
+
}, N = t => {
|
|
367
|
+
if (!r) if (Array.isArray(t)) for (const e of t) C(e); else C(t);
|
|
359
368
|
return G;
|
|
360
|
-
},
|
|
361
|
-
const
|
|
362
|
-
let
|
|
369
|
+
}, C = r => {
|
|
370
|
+
const o = n, i = b("apply"), l = i.length;
|
|
371
|
+
let f = 0;
|
|
363
372
|
const u = () => {
|
|
364
|
-
if (
|
|
365
|
-
const t =
|
|
366
|
-
|
|
367
|
-
} else if (
|
|
368
|
-
|
|
373
|
+
if (f < l) {
|
|
374
|
+
const t = f;
|
|
375
|
+
i[f](r, d), t === f && d();
|
|
376
|
+
} else if (f === l) {
|
|
377
|
+
f++;
|
|
369
378
|
try {
|
|
370
|
-
const [
|
|
371
|
-
switch (
|
|
372
|
-
case
|
|
379
|
+
const [o, i] = ((n, r, o) => {
|
|
380
|
+
switch (o.type) {
|
|
381
|
+
case W:
|
|
373
382
|
{
|
|
374
|
-
const [t,
|
|
375
|
-
K(
|
|
383
|
+
const [t, e] = o.range;
|
|
384
|
+
K(n, t) && K(n, e) && t < e && (n = Z(n, t, e, []), r = tt(r, o));
|
|
376
385
|
break;
|
|
377
386
|
}
|
|
378
387
|
|
|
379
|
-
case
|
|
388
|
+
case q:
|
|
380
389
|
{
|
|
381
|
-
const {at:
|
|
382
|
-
if (K(
|
|
383
|
-
const [a, l] = c(
|
|
390
|
+
const {at: e, text: i} = o;
|
|
391
|
+
if (K(n, e) && i) {
|
|
392
|
+
const [a, l] = c(n, e), f = s(a, l - 1);
|
|
384
393
|
let u;
|
|
385
394
|
if (f) {
|
|
386
395
|
const e = f[0];
|
|
387
396
|
t(e) && (u = e);
|
|
388
397
|
}
|
|
389
|
-
|
|
398
|
+
n = Z(n, e, e, V(i, u, a)), r = tt(r, o);
|
|
390
399
|
}
|
|
391
400
|
break;
|
|
392
401
|
}
|
|
393
402
|
|
|
394
403
|
case z:
|
|
395
404
|
{
|
|
396
|
-
const {at: t, fragment:
|
|
397
|
-
K(
|
|
405
|
+
const {at: t, fragment: e} = o;
|
|
406
|
+
K(n, t) && e.length && (n = Z(n, t, t, e), r = tt(r, o));
|
|
398
407
|
break;
|
|
399
408
|
}
|
|
400
409
|
|
|
401
410
|
case "format":
|
|
402
411
|
{
|
|
403
|
-
const {range: [
|
|
404
|
-
if (K(
|
|
405
|
-
const [{children:
|
|
406
|
-
if (1 ===
|
|
407
|
-
const
|
|
408
|
-
t(
|
|
409
|
-
...
|
|
410
|
-
[
|
|
412
|
+
const {range: [r, s], key: i, value: a} = o;
|
|
413
|
+
if (K(n, r) && K(n, s) && r <= s) if (r === s) {
|
|
414
|
+
const [{children: e}, , o] = c(n, r);
|
|
415
|
+
if (1 === e.length) {
|
|
416
|
+
const r = e[0];
|
|
417
|
+
t(r) && !r.text && (n = Y(n, [ ...o, 0 ], {
|
|
418
|
+
...r,
|
|
419
|
+
[i]: a
|
|
411
420
|
}));
|
|
412
421
|
}
|
|
413
|
-
} else
|
|
414
|
-
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
|
|
419
|
-
|
|
422
|
+
} else {
|
|
423
|
+
const o = n => e(n) ? {
|
|
424
|
+
...n,
|
|
425
|
+
children: n.children.map(o)
|
|
426
|
+
} : t(n) ? {
|
|
427
|
+
...n,
|
|
428
|
+
[i]: a
|
|
429
|
+
} : n;
|
|
430
|
+
n = Z(n, r, s, h(n, r, s).map(o));
|
|
431
|
+
}
|
|
420
432
|
break;
|
|
421
433
|
}
|
|
422
434
|
|
|
423
435
|
case "patch_node":
|
|
424
436
|
{
|
|
425
|
-
const {path: t, key:
|
|
437
|
+
const {path: t, key: e, value: r} = o, s = ((t, e) => {
|
|
426
438
|
for (let n = 0; n < e.length; n++) t = t.children[e[n]];
|
|
427
439
|
return t;
|
|
428
|
-
})(
|
|
429
|
-
s && (
|
|
440
|
+
})(n, t);
|
|
441
|
+
s && (n = Y(n, t, {
|
|
430
442
|
...s,
|
|
431
|
-
[
|
|
443
|
+
[e]: r
|
|
432
444
|
}));
|
|
433
445
|
break;
|
|
434
446
|
}
|
|
435
447
|
}
|
|
436
|
-
return [
|
|
437
|
-
})(
|
|
438
|
-
(({type: t}) => t !==
|
|
439
|
-
} catch (
|
|
440
|
-
|
|
448
|
+
return [ n, r ];
|
|
449
|
+
})(n, p, r);
|
|
450
|
+
(({type: t}) => t !== q && t !== W)(r) && !x(o) || (n = o, U(i));
|
|
451
|
+
} catch (o) {
|
|
452
|
+
a("rollback operation: " + o);
|
|
441
453
|
}
|
|
442
454
|
}
|
|
443
455
|
}, d = t => {
|
|
444
|
-
t && (
|
|
456
|
+
t && (r = t), f++, u();
|
|
445
457
|
};
|
|
446
|
-
u(), M(
|
|
458
|
+
u(), M(o, n) || O("change");
|
|
447
459
|
}, U = t => {
|
|
448
|
-
!((t, [e, n]) => K(t, e) && K(t, n))(
|
|
449
|
-
|
|
460
|
+
!((t, [e, n]) => K(t, e) && K(t, n))(n, t) || p[0] === t[0] && p[1] === t[1] || (p = t,
|
|
461
|
+
O("selectionchange"));
|
|
450
462
|
}, G = {
|
|
451
463
|
get doc() {
|
|
452
|
-
return
|
|
464
|
+
return n;
|
|
453
465
|
},
|
|
454
466
|
get selection() {
|
|
455
|
-
return
|
|
467
|
+
return p;
|
|
456
468
|
},
|
|
457
469
|
set selection(t) {
|
|
458
470
|
U(t);
|
|
459
471
|
},
|
|
460
472
|
get readonly() {
|
|
461
|
-
return
|
|
473
|
+
return r;
|
|
462
474
|
},
|
|
463
475
|
set readonly(t) {
|
|
464
|
-
|
|
476
|
+
r = t, O("readonly");
|
|
465
477
|
},
|
|
466
|
-
apply:
|
|
478
|
+
apply: N,
|
|
467
479
|
on: (t, e) => {
|
|
468
|
-
let n =
|
|
469
|
-
return n ||
|
|
480
|
+
let n = E.get(t);
|
|
481
|
+
return n || E.set(t, n = new Set), n.add(e), () => {
|
|
470
482
|
n.delete(e);
|
|
471
483
|
};
|
|
472
484
|
},
|
|
473
485
|
hook: (t, e) => {
|
|
474
|
-
let n =
|
|
475
|
-
return n ||
|
|
486
|
+
let n = g.get(t);
|
|
487
|
+
return n || g.set(t, n = []), n.push(e), () => {
|
|
476
488
|
const t = n.indexOf(e);
|
|
477
489
|
-1 !== t && n.splice(t, 1);
|
|
478
490
|
};
|
|
@@ -481,14 +493,14 @@ var ot = [], st = () => {}, ct = t => {
|
|
|
481
493
|
const n = t(G, ...e);
|
|
482
494
|
return void 0 === n ? G : n;
|
|
483
495
|
},
|
|
484
|
-
get: t => (
|
|
485
|
-
set: (t, e) => (
|
|
496
|
+
get: t => (m.has(t) || f("No value found for key"), m.get(t)),
|
|
497
|
+
set: (t, e) => (m.set(t, e), G),
|
|
486
498
|
input: t => {
|
|
487
|
-
if (!window.InputEvent || !w(InputEvent.prototype.getTargetRanges)) return
|
|
499
|
+
if (!window.InputEvent || !w(InputEvent.prototype.getTargetRanges)) return a("beforeinput event is not supported."),
|
|
488
500
|
st;
|
|
489
|
-
const {contentEditable:
|
|
501
|
+
const {contentEditable: e, role: o, ariaMultiLine: s, ariaReadOnly: c} = t, f = t.style.whiteSpace;
|
|
490
502
|
t.role = "textbox", t.style.whiteSpace = "pre-wrap", t.ariaMultiLine = "true";
|
|
491
|
-
let x = !1,
|
|
503
|
+
let x = !1, h = null, g = !1, m = !1, E = !1;
|
|
492
504
|
const T = B(t), M = ((t, e) => {
|
|
493
505
|
let n = null, r = null, o = null;
|
|
494
506
|
const s = () => {
|
|
@@ -556,22 +568,22 @@ var ot = [], st = () => {}, ct = t => {
|
|
|
556
568
|
}
|
|
557
569
|
};
|
|
558
570
|
return l;
|
|
559
|
-
})(T,
|
|
560
|
-
t.contentEditable =
|
|
571
|
+
})(T, i), A = () => {
|
|
572
|
+
t.contentEditable = r ? "false" : "true", t.ariaReadOnly = r ? "true" : null;
|
|
561
573
|
};
|
|
562
574
|
A();
|
|
563
|
-
const
|
|
564
|
-
|
|
565
|
-
|
|
575
|
+
const O = G.on("change", () => {
|
|
576
|
+
m || requestAnimationFrame(() => {
|
|
577
|
+
m || t.focus({
|
|
566
578
|
preventScroll: !0
|
|
567
579
|
});
|
|
568
580
|
});
|
|
569
|
-
}),
|
|
570
|
-
for (const e of
|
|
581
|
+
}), R = G.on("readonly", A), C = t => {
|
|
582
|
+
for (const e of b("paste")) {
|
|
571
583
|
const n = e(t);
|
|
572
584
|
if (n) return n;
|
|
573
585
|
}
|
|
574
|
-
|
|
586
|
+
a("failed to serialize pasted data");
|
|
575
587
|
}, V = ((t, e) => {
|
|
576
588
|
let n = !1, r = [];
|
|
577
589
|
const o = t => {
|
|
@@ -609,37 +621,37 @@ var ot = [], st = () => {}, ct = t => {
|
|
|
609
621
|
}
|
|
610
622
|
};
|
|
611
623
|
})(t, () => {
|
|
612
|
-
|
|
624
|
+
L(t, M, d(n, p), p[0] - p[1]);
|
|
613
625
|
}), W = () => {
|
|
614
|
-
U(u(
|
|
626
|
+
U(u(n, ((t, e) => {
|
|
615
627
|
const n = I(t), r = P(n, t);
|
|
616
628
|
if (!r) return [ [ [ 0 ], 0 ], [ [ 0 ], 0 ] ];
|
|
617
|
-
const o =
|
|
629
|
+
const o = F(t, e, r), s = D(n.anchorNode, n.focusNode);
|
|
618
630
|
return (0 === s ? n.anchorOffset > n.focusOffset : 2 & s) ? [ o[1], o[0] ] : o;
|
|
619
631
|
})(t, M)));
|
|
620
|
-
},
|
|
621
|
-
const
|
|
622
|
-
V._(!1),
|
|
623
|
-
T.addEventListener("selectionchange", $)),
|
|
624
|
-
},
|
|
625
|
-
if (!g) for (const e of
|
|
632
|
+
}, q = () => {
|
|
633
|
+
const e = V.v();
|
|
634
|
+
V._(!1), e.length && (V.m(e), T.removeEventListener("selectionchange", $), L(t, M, d(n, p), p[0] - p[1], !0),
|
|
635
|
+
T.addEventListener("selectionchange", $)), h && (U(h[1]), N(h[0]), h = null), g = !1;
|
|
636
|
+
}, z = t => {
|
|
637
|
+
if (!g) for (const e of b("keyboard")) if (e(t)) return t.preventDefault(), void V._(!1);
|
|
626
638
|
}, J = () => {
|
|
627
|
-
g ||
|
|
628
|
-
}, j =
|
|
629
|
-
|
|
630
|
-
const r =
|
|
639
|
+
g || q();
|
|
640
|
+
}, j = e => {
|
|
641
|
+
e.preventDefault();
|
|
642
|
+
const r = e.inputType;
|
|
631
643
|
if (r.startsWith("format")) return;
|
|
632
644
|
if ("historyUndo" === r || "historyRedo" === r) return;
|
|
633
645
|
g ? V._(!0) : W();
|
|
634
|
-
const o =
|
|
646
|
+
const o = e.getTargetRanges()[0];
|
|
635
647
|
if (o) {
|
|
636
|
-
let s = "insertParagraph" === r || "insertLineBreak" === r ? "\n" :
|
|
648
|
+
let s = "insertParagraph" === r || "insertLineBreak" === r ? "\n" : e.data;
|
|
637
649
|
if (null == s) {
|
|
638
|
-
const t =
|
|
650
|
+
const t = e.dataTransfer;
|
|
639
651
|
t && (s = t.getData("text/plain"));
|
|
640
652
|
}
|
|
641
|
-
|
|
642
|
-
const c =
|
|
653
|
+
h || (h = [ [], p ]);
|
|
654
|
+
const c = h[0], i = u(n, F(t, M, o));
|
|
643
655
|
k(i) || c.push({
|
|
644
656
|
type: "delete",
|
|
645
657
|
range: i
|
|
@@ -649,31 +661,31 @@ var ot = [], st = () => {}, ct = t => {
|
|
|
649
661
|
text: s
|
|
650
662
|
});
|
|
651
663
|
}
|
|
652
|
-
g ||
|
|
664
|
+
g || q();
|
|
653
665
|
}, X = () => {
|
|
654
666
|
g || W(), g = !0;
|
|
655
667
|
}, Y = () => {
|
|
656
|
-
|
|
668
|
+
q();
|
|
657
669
|
}, Z = () => {
|
|
658
|
-
|
|
670
|
+
m = !0, W();
|
|
659
671
|
}, K = () => {
|
|
660
|
-
|
|
672
|
+
m = !1;
|
|
661
673
|
}, $ = () => {
|
|
662
|
-
|
|
674
|
+
m && !E && W();
|
|
663
675
|
}, tt = t => {
|
|
664
|
-
if (W(), !k(
|
|
676
|
+
if (W(), !k(p)) for (const e of b("copy")) e(t);
|
|
665
677
|
}, et = t => {
|
|
666
678
|
t.preventDefault(), tt(t.clipboardData);
|
|
667
679
|
}, nt = t => {
|
|
668
|
-
t.preventDefault(),
|
|
680
|
+
t.preventDefault(), r || (tt(t.clipboardData), N({
|
|
669
681
|
type: "delete",
|
|
670
|
-
range:
|
|
682
|
+
range: y(p)
|
|
671
683
|
}));
|
|
672
684
|
}, rt = t => {
|
|
673
685
|
t.preventDefault();
|
|
674
|
-
const e =
|
|
686
|
+
const e = C(t.clipboardData);
|
|
675
687
|
if (e) {
|
|
676
|
-
const t =
|
|
688
|
+
const t = y(p), n = t[0], r = [ {
|
|
677
689
|
type: "delete",
|
|
678
690
|
range: t
|
|
679
691
|
} ];
|
|
@@ -685,31 +697,31 @@ var ot = [], st = () => {}, ct = t => {
|
|
|
685
697
|
type: "insert_node",
|
|
686
698
|
at: n,
|
|
687
699
|
fragment: e
|
|
688
|
-
}),
|
|
700
|
+
}), N(r);
|
|
689
701
|
}
|
|
690
|
-
}, ot =
|
|
691
|
-
|
|
692
|
-
const r =
|
|
702
|
+
}, ot = e => {
|
|
703
|
+
e.preventDefault();
|
|
704
|
+
const r = e.dataTransfer, o = ((t, e, {clientX: n, clientY: r}) => {
|
|
693
705
|
const o = B(t);
|
|
694
706
|
if (o.caretPositionFromPoint) {
|
|
695
707
|
const s = o.caretPositionFromPoint(n, r);
|
|
696
|
-
if (s) return
|
|
708
|
+
if (s) return H(t, e, s.offsetNode, s.offset);
|
|
697
709
|
} else if (o.caretRangeFromPoint) {
|
|
698
710
|
const s = o.caretRangeFromPoint(n, r);
|
|
699
|
-
if (s) return
|
|
711
|
+
if (s) return H(t, e, s.startContainer, s.startOffset);
|
|
700
712
|
}
|
|
701
|
-
})(t, M,
|
|
713
|
+
})(t, M, e);
|
|
702
714
|
if (r && o) {
|
|
703
715
|
let t;
|
|
704
|
-
const
|
|
705
|
-
E &&
|
|
716
|
+
const e = [];
|
|
717
|
+
E && e.push({
|
|
706
718
|
type: "delete",
|
|
707
|
-
range:
|
|
719
|
+
range: y(p)
|
|
708
720
|
});
|
|
709
|
-
const s =
|
|
721
|
+
const s = C(r);
|
|
710
722
|
if (s) {
|
|
711
|
-
const r = l(
|
|
712
|
-
|
|
723
|
+
const r = l(n, o), c = Q(r, e);
|
|
724
|
+
e.push(S(s) ? {
|
|
713
725
|
type: "insert_text",
|
|
714
726
|
at: c,
|
|
715
727
|
text: s
|
|
@@ -717,28 +729,28 @@ var ot = [], st = () => {}, ct = t => {
|
|
|
717
729
|
type: "insert_node",
|
|
718
730
|
at: c,
|
|
719
731
|
fragment: s
|
|
720
|
-
}), t = [ c, Q(r,
|
|
732
|
+
}), t = [ c, Q(r, e) ];
|
|
721
733
|
}
|
|
722
|
-
|
|
734
|
+
N(e), t && U(t);
|
|
723
735
|
}
|
|
724
736
|
}, ct = t => {
|
|
725
737
|
E = !0, tt(t.dataTransfer);
|
|
726
738
|
}, it = () => {
|
|
727
739
|
E = !1;
|
|
728
740
|
};
|
|
729
|
-
T.addEventListener("selectionchange", $), t.addEventListener("keydown",
|
|
741
|
+
T.addEventListener("selectionchange", $), t.addEventListener("keydown", z), t.addEventListener("input", J),
|
|
730
742
|
t.addEventListener("beforeinput", j), t.addEventListener("compositionstart", X),
|
|
731
743
|
t.addEventListener("compositionend", Y), t.addEventListener("focus", Z), t.addEventListener("blur", K),
|
|
732
744
|
t.addEventListener("copy", et), t.addEventListener("cut", nt), t.addEventListener("paste", rt),
|
|
733
745
|
t.addEventListener("drop", ot), t.addEventListener("dragstart", ct), t.addEventListener("dragend", it);
|
|
734
746
|
const at = [];
|
|
735
|
-
return
|
|
747
|
+
return b("mount").forEach(e => {
|
|
736
748
|
const n = e(t, M);
|
|
737
749
|
n && at.push(n);
|
|
738
750
|
}), () => {
|
|
739
|
-
x || (x = !0,
|
|
740
|
-
t.ariaReadOnly =
|
|
741
|
-
t.removeEventListener("keydown",
|
|
751
|
+
x || (x = !0, O(), R(), t.contentEditable = e, t.role = o, t.ariaMultiLine = s,
|
|
752
|
+
t.ariaReadOnly = c, t.style.whiteSpace = f, V.T(), T.removeEventListener("selectionchange", $),
|
|
753
|
+
t.removeEventListener("keydown", z), t.removeEventListener("input", J), t.removeEventListener("beforeinput", j),
|
|
742
754
|
t.removeEventListener("compositionstart", X), t.removeEventListener("compositionend", Y),
|
|
743
755
|
t.removeEventListener("focus", Z), t.removeEventListener("blur", K), t.removeEventListener("copy", et),
|
|
744
756
|
t.removeEventListener("cut", nt), t.removeEventListener("paste", rt), t.removeEventListener("drop", ot),
|
|
@@ -755,7 +767,7 @@ function at(t, e) {
|
|
|
755
767
|
const n = e && e.serializer;
|
|
756
768
|
t.hook("copy", e => {
|
|
757
769
|
e.setData("text/plain", U({
|
|
758
|
-
children:
|
|
770
|
+
children: h(t.doc, ...y(t.selection))
|
|
759
771
|
}, n));
|
|
760
772
|
}), t.hook("paste", t => t.getData("text/plain"));
|
|
761
773
|
}
|
|
@@ -766,22 +778,26 @@ function ft(t) {
|
|
|
766
778
|
t.hook("mount", t => {
|
|
767
779
|
t.ariaMultiLine = null;
|
|
768
780
|
}), t.hook("apply", (t, e) => {
|
|
769
|
-
"insert_text" === t.type
|
|
781
|
+
if ("insert_text" === t.type) t = {
|
|
770
782
|
...t,
|
|
771
783
|
text: t.text.replaceAll("\n", "")
|
|
772
|
-
}
|
|
773
|
-
|
|
774
|
-
|
|
775
|
-
|
|
784
|
+
}; else if ("insert_node" === t.type) {
|
|
785
|
+
const e = t.fragment;
|
|
786
|
+
t = {
|
|
787
|
+
...t,
|
|
788
|
+
fragment: G(e) ? [ X(...e) ] : e
|
|
789
|
+
};
|
|
790
|
+
}
|
|
791
|
+
e(t);
|
|
776
792
|
});
|
|
777
793
|
}
|
|
778
794
|
|
|
779
|
-
exports.Delete = function(t, e =
|
|
795
|
+
exports.Delete = function(t, e = y(t.selection)) {
|
|
780
796
|
t.apply({
|
|
781
797
|
type: "delete",
|
|
782
798
|
range: e
|
|
783
799
|
});
|
|
784
|
-
}, exports.Format = function(t, e, n, r =
|
|
800
|
+
}, exports.Format = function(t, e, n, r = y(t.selection)) {
|
|
785
801
|
t.apply({
|
|
786
802
|
type: "format",
|
|
787
803
|
range: r,
|
|
@@ -806,8 +822,7 @@ exports.Delete = function(t, e = h(t.selection)) {
|
|
|
806
822
|
t.get(rt).redo();
|
|
807
823
|
}, exports.Redoable = function(t) {
|
|
808
824
|
return t.get(rt).redoable();
|
|
809
|
-
}, exports.ReplaceDoc = m, exports.ReplaceText = function(t, e) {
|
|
810
|
-
const n = h(t.selection);
|
|
825
|
+
}, exports.ReplaceDoc = m, exports.ReplaceText = function(t, e, n = y(t.selection)) {
|
|
811
826
|
t.apply({
|
|
812
827
|
type: "delete",
|
|
813
828
|
range: n
|
|
@@ -832,7 +847,7 @@ exports.Delete = function(t, e = h(t.selection)) {
|
|
|
832
847
|
key: e,
|
|
833
848
|
value: s[e] === n ? r : n
|
|
834
849
|
});
|
|
835
|
-
}, exports.ToggleFormat = function(e, n, r =
|
|
850
|
+
}, exports.ToggleFormat = function(e, n, r = y(e.selection)) {
|
|
836
851
|
let s = !1;
|
|
837
852
|
if (k(r)) {
|
|
838
853
|
const o = i(e.doc, r[0])?.[0];
|
|
@@ -861,7 +876,7 @@ exports.Delete = function(t, e = h(t.selection)) {
|
|
|
861
876
|
const o = it({
|
|
862
877
|
...r,
|
|
863
878
|
doc: {
|
|
864
|
-
children:
|
|
879
|
+
children: V(t)
|
|
865
880
|
}
|
|
866
881
|
}).exec(at);
|
|
867
882
|
return e && o.exec(ft), o.on("change", () => {
|
|
@@ -933,7 +948,7 @@ exports.htmlTransferPlugin = function(t, e) {
|
|
|
933
948
|
});
|
|
934
949
|
}, exports.internalTranferPlugin = function(t) {
|
|
935
950
|
t.hook("copy", e => {
|
|
936
|
-
e.setData(lt, JSON.stringify(
|
|
951
|
+
e.setData(lt, JSON.stringify(h(t.doc, ...y(t.selection))));
|
|
937
952
|
}), t.hook("paste", t => {
|
|
938
953
|
try {
|
|
939
954
|
return JSON.parse(t.getData(lt));
|
|
@@ -944,9 +959,22 @@ exports.htmlTransferPlugin = function(t, e) {
|
|
|
944
959
|
}, exports.iterLeaf = x, exports.iterNode = p, exports.keymapPlugin = function(t, e) {
|
|
945
960
|
T(e).forEach(n => {
|
|
946
961
|
const r = e[n];
|
|
947
|
-
t.hook("keyboard", nt(n,
|
|
948
|
-
|
|
949
|
-
|
|
962
|
+
t.hook("keyboard", nt(n, r));
|
|
963
|
+
});
|
|
964
|
+
}, exports.plainTransferPlugin = at, exports.selectionRectPlugin = function(t, e) {
|
|
965
|
+
t.hook("mount", (n, r) => {
|
|
966
|
+
let o = !0, s = !1;
|
|
967
|
+
const c = t.on("selectionchange", () => {
|
|
968
|
+
s || (s = !0, requestAnimationFrame(() => {
|
|
969
|
+
s = !1, o && e(() => {
|
|
970
|
+
const e = t.selection;
|
|
971
|
+
return N(n, r, d(t.doc, e), e[0] - e[1]).getBoundingClientRect();
|
|
972
|
+
});
|
|
973
|
+
}));
|
|
974
|
+
});
|
|
975
|
+
return () => {
|
|
976
|
+
o = !1, c();
|
|
977
|
+
};
|
|
950
978
|
});
|
|
951
|
-
}, exports.
|
|
979
|
+
}, exports.singlelinePlugin = ft;
|
|
952
980
|
//# sourceMappingURL=index.cjs.map
|