editate 0.6.17 → 0.6.19

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