editate 0.6.6 → 0.6.8

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