editate 0.6.14 → 0.6.15

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