editate 0.6.18 → 0.6.20

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