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