editate 0.6.20 → 0.6.21

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