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