editate 0.6.18 → 0.6.19

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