editate 0.6.18 → 0.6.20

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