editate 0.6.6 → 0.6.7

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