editate 0.6.14 → 0.6.15

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