editate 0.6.7 → 0.6.8

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