editate 0.6.7 → 0.6.9

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