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