editate 0.6.15 → 0.6.16

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