editate 0.6.15 → 0.6.17

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