editate 0.6.27 → 0.7.1

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.js CHANGED
@@ -1,248 +1,337 @@
1
- var {min: t, max: e} = Math, {keys: n, is: r} = Object, o = t => "string" == typeof t, c = t => "function" == typeof t, s = c(queueMicrotask) ? queueMicrotask : t => {
1
+ var {min: t, max: e} = Math, {keys: n, is: r} = Object, o = t => "string" == typeof t, c = t => "function" == typeof t, i = c(queueMicrotask) ? queueMicrotask : t => {
2
2
  Promise.resolve().then(t);
3
- }, i = t => "text" in t, l = t => "children" in t, a = t => t.some(l), u = /* @__PURE__ */ new WeakMap, f = ({children: t}, e = 0, n = t.length) => {
4
- let r = 0, o = 0;
5
- for (let c = e; c < n; c++) {
6
- const e = t[c];
7
- r += d(e), 0 !== o && l(e) && r++, o++;
8
- }
9
- return r;
10
- }, d = t => {
3
+ }, s = t => "text" in t, l = t => "children" in t, a = t => t.some(l), f = /* @__PURE__ */ new WeakMap, u = t => {
11
4
  if (l(t)) {
12
- let e = u.get(t);
13
- return null == e && u.set(t, e = f(t)), e;
5
+ let e = f.get(t);
6
+ if (null == e) {
7
+ const {children: n} = t;
8
+ e = 0;
9
+ for (let t = 0; t < n.length; t++) {
10
+ const r = n[t];
11
+ e += u(r), 0 !== t && l(r) && e++;
12
+ }
13
+ f.set(t, e);
14
+ }
15
+ return e;
14
16
  }
15
- return i(t) ? t.text.length : 1;
16
- }, p = ({children: t}, e, n) => {
17
- const r = t.length;
18
- for (let o = 0; o < r; o++) {
19
- const r = t[o], c = l(r);
20
- let s = d(r);
21
- const i = 0 === s;
22
- if (c && s++, s > e || s === e && !c && (n || i)) return [ r, e, o ];
23
- e -= s;
17
+ return s(t) ? t.text.length : 1;
18
+ }, d = ({children: t}, e, n) => {
19
+ for (let r = 0; r < t.length; r++) {
20
+ const o = t[r], c = l(o), i = u(o);
21
+ if (e < i || e === i && (c || n || !i)) return [ o, e, r ];
22
+ e -= i, c && e--;
24
23
  }
25
24
  return null;
26
- }, h = (t, e) => {
25
+ }, p = (t, e) => {
27
26
  const n = [];
28
- for (;t; ) {
29
- const r = p(t, e);
30
- if (!r) break;
31
- const o = r[0];
32
- if (!l(o)) break;
33
- e = r[1], t = o, n.push(r[2]);
34
- }
27
+ let r;
28
+ for (;(r = d(t, e)) && l(r[0]); ) e = r[1], t = r[0], n.push(r[2]);
35
29
  return [ t, e, n ];
36
30
  }, y = (t, e, n) => {
37
- const [r, o, c] = h(t, e), s = p(r, o, n);
38
- return s ? (c.push(s[2]), [ s[0], s[1], c ]) : null;
39
- }, k = (t, e) => {
40
- let n = 0, r = 0;
41
- for (const o of t.children) {
42
- const t = l(o);
43
- if (t && 0 !== r && n++, o === e) return n;
44
- if (t) {
45
- const t = k(o, e);
31
+ const [r, o, c] = p(t, e), i = d(r, o, n);
32
+ return i ? (c.push(i[2]), [ i[0], i[1], c ]) : null;
33
+ }, h = (t, e) => {
34
+ let n = 0;
35
+ for (const r of t.children) {
36
+ if (r === e) return n;
37
+ if (l(r)) {
38
+ const t = h(r, e);
46
39
  if (null != t) return n + t;
40
+ n++;
47
41
  }
48
- n += d(o), r++;
42
+ n += u(r);
49
43
  }
50
44
  return null;
51
- }, m = (t, e) => {
52
- const n = t.children, r = p(t, e);
53
- if (r) {
54
- const [e, o, c] = r;
55
- if (l(e)) {
56
- const [r, s] = m(e, o), i = n.slice(0, c), l = n.slice(c + 1);
57
- return i.push(r), l.unshift(s), [ {
58
- ...t,
59
- children: i
60
- }, {
61
- ...t,
62
- children: l
63
- } ];
64
- }
65
- {
66
- const r = n.slice(0, c), s = n.slice(c + 1);
67
- if (i(e)) {
68
- const t = e.text.slice(0, o), n = e.text.slice(o);
69
- !t && r.length || r.push({
70
- ...e,
71
- text: t
72
- }), !n && s.length || s.unshift({
73
- ...e,
74
- text: n
75
- });
76
- } else s.unshift(e);
77
- return [ {
78
- ...t,
79
- children: r
80
- }, {
81
- ...t,
82
- children: s
83
- } ];
84
- }
45
+ }, g = (t, e, n = !0) => {
46
+ const r = t.children, o = d(t, e);
47
+ if (!o) {
48
+ const e = r[r.length - 1];
49
+ return [ t, {
50
+ ...t,
51
+ children: n && s(e) ? [ {
52
+ ...e,
53
+ text: ""
54
+ } ] : []
55
+ } ];
85
56
  }
86
- const o = n[n.length - 1];
87
- return [ t, {
57
+ const [c, i, a] = o, f = r.slice(0, a), u = r.slice(a + 1);
58
+ if (l(c)) {
59
+ const [t, e] = g(c, i, n);
60
+ f.push(t), u.unshift(e);
61
+ } else if (s(c)) {
62
+ const t = c.text.slice(0, i), e = c.text.slice(i);
63
+ !t && f.length || f.push({
64
+ ...c,
65
+ text: t
66
+ }), (e || n && !u.length) && u.unshift({
67
+ ...c,
68
+ text: e
69
+ });
70
+ } else u.unshift(c);
71
+ return [ {
72
+ ...t,
73
+ children: f
74
+ }, {
88
75
  ...t,
89
- children: i(o) ? [ {
90
- ...o,
91
- text: ""
92
- } ] : []
76
+ children: u
93
77
  } ];
94
- }, g = (t, [e, n]) => {
95
- let r = 0;
96
- for (const o of e) r += f(t, 0, o), 0 !== o && r++, t = t.children[o];
97
- return r + n;
98
- }, _ = (t, e) => {
99
- const [, n, r] = h(t, e);
78
+ }, m = (t, [e, n]) => {
79
+ for (const r of e) {
80
+ for (let e = 0; e < r; e++) n += u(t.children[e]) + 1;
81
+ t = t.children[r];
82
+ }
83
+ return n;
84
+ }, k = (t, e) => {
85
+ const [, n, r] = p(t, e);
100
86
  return [ r, n ];
101
- }, x = (t, [e, n]) => [ g(t, e), g(t, n) ];
87
+ }, x = (t, [e, n]) => [ m(t, e), m(t, n) ];
102
88
 
103
- function* b(t, [e, n]) {
104
- if (e >= n) return;
105
- if (!l(t)) return;
106
- const r = p(t, e);
107
- if (r) {
108
- let o = e - r[1], c = r[2];
109
- const s = t.children, i = s.length;
110
- for (;o <= n && c < i; ) {
111
- const t = s[c];
112
- yield [ t, o ], c++, o += d(t), l(t) && o++;
89
+ function* v(n, [r, o]) {
90
+ if (r > o || !l(n)) return;
91
+ const c = d(n, r) || d(n, r, !0);
92
+ if (c) {
93
+ let i = r - c[1], s = c[2];
94
+ const a = n.children, f = a.length;
95
+ for (;i <= o && s < f; ) {
96
+ const n = a[s], c = u(n);
97
+ yield [ n, i, s, [ e(r - i, 0), t(o - i, c) ] ], s++, i += c, l(n) && i++;
113
98
  }
114
99
  }
115
100
  }
116
101
 
117
- function* v(t, e) {
118
- if (!l(t) || a(t.children)) for (const n of b(t, e)) {
119
- const [t, e] = n;
120
- for (const n of v(t, [ 0, d(t) ])) n[1] += e, yield n;
121
- } else yield [ t, 0 ];
102
+ function* _(t, e) {
103
+ if (!l(t) || a(t.children)) for (const [n, r, , o] of v(t, e)) for (const t of _(n, o)) t[1] += r,
104
+ yield t; else yield [ t, 0, e ];
122
105
  }
123
106
 
124
- function* T(t, e) {
125
- if (l(t)) for (const [n, r] of b(t, e)) for (const t of T(n, [ 0, d(n) ])) t[1] += r,
126
- yield t; else yield [ t, 0 ];
107
+ function* b(t, e) {
108
+ if (l(t)) for (const [n, r, , o] of v(t, e)) for (const t of b(n, o)) t[1] += r,
109
+ yield t; else yield [ t, 0, e ];
127
110
  }
128
111
 
129
- var E = (n, r = 0, o = 1 / 0, c) => {
130
- let s = "", l = r;
131
- for (const [a, u] of T(n, [ r, o ])) {
132
- for (let t = u - l; t > 0; t--) s += "\n";
133
- const n = d(a), f = u + n;
134
- if (i(a)) {
135
- const c = e(u, r) - u, i = t(f, o) - u;
136
- s += 0 === c && i === n ? a.text : a.text.slice(c, i);
137
- } else c && (s += c(a));
138
- l = f;
112
+ var w = (e, n = 0, r = 1 / 0, o) => {
113
+ let c = "", i = n;
114
+ for (const [t, l, [a, f]] of b(e, [ n, r ])) {
115
+ for (let t = l - i; t > 0; t--) c += "\n";
116
+ s(t) ? c += t.text.slice(a, f) : o && a < f && (c += o(t)), i = l + u(t);
139
117
  }
140
- for (let e = t(o, d(n)) - l; e > 0; e--) s += "\n";
141
- return s;
142
- }, w = (t, e, n) => e >= n ? [] : m(m(t, n)[0], e)[1].children, M = (t, e, n) => t.split("\n").map(t => ({
118
+ for (let s = t(r, u(e)) - i; s > 0; s--) c += "\n";
119
+ return c;
120
+ }, T = (t, e, n) => e >= n ? [] : g(g(t, n)[0], e)[1].children, E = ([t, e]) => t > e ? [ e, t ] : [ t, e ], M = ([t, e]) => t === e, S = ([t, e], n) => n ? t < e : t <= e, A = (t, e, n) => t.split("\n").map(t => ({
143
121
  ...n,
144
122
  children: [ {
145
123
  ...e,
146
124
  text: t
147
125
  } ]
148
- })), S = "delete", A = "insert_text", O = "insert_node", R = (t, e) => {
126
+ })), O = "delete", R = "insert_text", D = "insert_node", B = "format", I = ({type: t}) => t !== R && t !== O, L = (t, e) => {
149
127
  const o = n(t);
150
128
  return o.length === n(e).length && o.every(n => n in e && ("text" === n || r(t[n], e[n])));
151
- }, D = (t, e) => {
152
- if (e.length) {
153
- const n = t.length;
154
- if (t.push(...e), n) {
155
- const e = t[n - 1], r = t[n], o = l(e), c = l(r);
156
- o ? c && ((t, e = 0, n = t.length - 1) => {
157
- let r = e + 1;
158
- for (;r <= n; ) {
159
- const e = t[r - 1], o = t[r];
160
- t[r - 1] = B(e, o), t.splice(r, 1), n--;
161
- }
162
- })(t, n - 1, n) : o || c || ((t, e = 0, n = t.length - 1) => {
163
- let r = e + 1;
164
- for (;r <= n; ) {
165
- const e = t[r - 1], o = t[r];
166
- i(e) && i(o) && R(e, o) ? (t[r - 1] = {
167
- ...e,
168
- text: e.text + o.text
169
- }, t.splice(r, 1), n--) : r++;
170
- }
171
- for (r = e; r <= n; ) {
172
- const e = t[r];
173
- i(e) && !e.text && t.length > 1 ? (t.splice(r, 1), n--) : r++;
174
- }
175
- })(t, n - 1, n);
129
+ }, P = t => {
130
+ const e = [];
131
+ let n;
132
+ for (let r of t) {
133
+ if (s(r)) {
134
+ if (!r.text) continue;
135
+ n && s(n) && L(n, r) && (r = {
136
+ ...n,
137
+ text: n.text + r.text
138
+ }, e.pop());
176
139
  }
140
+ e.push(n = r);
177
141
  }
178
- t.length || t.push({
142
+ return e.length ? e : t.slice(-1);
143
+ }, N = (t, e) => {
144
+ const n = t.length - 1, r = t.concat(e);
145
+ if (n >= 0 && e.length) {
146
+ const e = l(r[n]);
147
+ if (e === l(r[n + 1])) {
148
+ if (!e) return t.slice(0, n).concat(P(r.slice(n)));
149
+ r.splice(n, 2, W(r.slice(n, n + 2)));
150
+ }
151
+ }
152
+ return r.length || r.push({
179
153
  text: ""
180
- });
181
- }, B = (...t) => ({
154
+ }), r;
155
+ }, W = t => ({
182
156
  ...t[0],
183
- children: t.reduce((t, e) => (D(t, e.children), t), [])
184
- }), I = (t, e, n, r = 0) => {
185
- if (r < e.length) {
186
- const o = e[r], c = t.children, s = c.slice();
187
- return s.splice(o, 1, I(c[o], e, n, r + 1)), {
188
- ...t,
189
- children: s
190
- };
191
- }
192
- return n;
193
- }, L = (t, e, n, r) => {
194
- const [o, c] = m(t, e), s = e < n ? m(t, n)[1] : c, i = a(t.children);
195
- a(r) ? i || (r = B(...r).children) : i && (r = [ {
157
+ children: t.reduce((t, e) => N(t, e.children), [])
158
+ }), H = (t, {range: e, depth: n = -1}, r) => {
159
+ const o = M(e), c = (t, e) => n < 0 ? !!(t & 1 << -n - 1) : n === e, i = (t, e, n, a) => {
160
+ let f = 0, d = !1, p = 0, y = 0;
161
+ const h = [];
162
+ for (const [m, k, x, _] of v(t, e)) {
163
+ h.length || (p = x);
164
+ const t = S(_, u(m)), e = a + k;
165
+ let g = m;
166
+ if (l(m)) {
167
+ let t;
168
+ [g, t] = i(m, _, n + 1, e), f |= t << 1;
169
+ } else if ((t || o) && (f |= 2), t && c(1, n + 1)) {
170
+ const [t, o] = _, c = [ e + t, e + o ];
171
+ s(m) ? (t > 0 && h.push({
172
+ ...m,
173
+ text: m.text.slice(0, t)
174
+ }), g = r({
175
+ ...m,
176
+ text: m.text.slice(t, o)
177
+ }, n + 1, c), o < m.text.length && (h.push(g), g = {
178
+ ...m,
179
+ text: m.text.slice(o)
180
+ })) : g = r(m, n + 1, c);
181
+ }
182
+ g !== m && (d = !0), h.push(g), y = x;
183
+ }
184
+ let g = t;
185
+ if (d) {
186
+ const {children: e} = t, n = e.slice(0, p).concat(h, e.slice(y + 1));
187
+ g = {
188
+ ...t,
189
+ children: P(n)
190
+ };
191
+ }
192
+ return c(f, n) && (g = r(g, n, [ a + e[0], a + e[1] ])), [ g, f ];
193
+ };
194
+ return i(t, e, 0, 0)[0];
195
+ }, C = (t, e, n, r) => {
196
+ const o = !r.length, [c, i] = g(t, e, o), s = e < n ? g(t, n, o)[1] : i, l = a(r);
197
+ return l !== a(t.children) && (r = l ? W(r).children : [ {
196
198
  children: r
197
- } ]);
198
- const l = o.children.slice();
199
- return D(l, r), D(l, s.children), {
199
+ } ]), {
200
200
  ...t,
201
- children: l
201
+ children: N(N(c.children, r), s.children)
202
202
  };
203
- }, P = (t, e) => e >= 0 && e <= d(t), H = (t, e) => e.reduce((t, e) => N(t, e), t), N = (t, e, n) => {
203
+ }, F = (t, e) => e >= 0 && e <= u(t), U = (t, e) => e.reduce((t, e) => q(t, e), t), q = (t, e, n) => {
204
204
  switch (e.type) {
205
- case S:
205
+ case O:
206
206
  {
207
207
  const [n, r] = e.range;
208
208
  if (t >= n) return r >= t ? n : t + n - r;
209
209
  break;
210
210
  }
211
211
 
212
- case A:
212
+ case R:
213
+ case D:
213
214
  {
214
- const {at: r, text: o} = e;
215
- if (n ? t > r : t >= r) return t + o.length;
215
+ const {at: r} = e;
216
+ if (n ? t > r : t >= r) return t + (e.type === R ? e.text.length : u({
217
+ children: e.fragment
218
+ }));
216
219
  break;
217
220
  }
218
-
221
+ }
222
+ return t;
223
+ }, z = ([t, e], n) => [ q(t, n), q(e, n) ], V = (t, [e, n]) => F(t, e) && F(t, n), G = (t, e, n) => {
224
+ switch (n.type) {
219
225
  case O:
220
226
  {
221
- const {at: r, fragment: o} = e;
222
- if (n ? t > r : t >= r) return t + d({
223
- children: o
224
- });
227
+ const [r, o] = n.range;
228
+ V(t, n.range) && r < o && (t = C(t, r, o, []), e = z(e, n));
229
+ break;
230
+ }
231
+
232
+ case R:
233
+ {
234
+ const {at: r, text: o} = n;
235
+ if (F(t, r) && o) {
236
+ const [c, i] = p(t, r), l = d(c, i, !0);
237
+ t = C(t, r, r, A(o, l && s(l[0]) ? l[0] : void 0, c)), e = z(e, n);
238
+ }
239
+ break;
240
+ }
241
+
242
+ case D:
243
+ {
244
+ const {at: r, fragment: o} = n;
245
+ F(t, r) && o.length && (t = C(t, r, r, o), e = z(e, n));
246
+ break;
247
+ }
248
+
249
+ case B:
250
+ {
251
+ const {range: e, key: r, value: o, depth: c} = n;
252
+ "text" !== r && ("children" !== r || 0 === c) && V(t, e) && e[0] <= e[1] && (t = H(t, n, t => {
253
+ if (void 0 !== o) return {
254
+ ...t,
255
+ [r]: o
256
+ };
257
+ const {[r]: e, ...n} = t;
258
+ return n;
259
+ }));
225
260
  break;
226
261
  }
227
262
  }
228
- return t;
229
- }, C = ([t, e], n) => [ N(t, n), N(e, n) ], W = ([t, e]) => t > e ? [ e, t ] : [ t, e ], F = ([t, e]) => t === e, U = ([t, e], [n, r]) => t < r && n < e;
263
+ return [ t, e ];
264
+ }, J = (t, e) => {
265
+ switch (e.type) {
266
+ case O:
267
+ {
268
+ const {range: n} = e;
269
+ return [ {
270
+ type: D,
271
+ at: n[0],
272
+ fragment: T(t, ...n)
273
+ } ];
274
+ }
230
275
 
231
- function* V(t, e = W(t.selection)) {
232
- if (F(e)) {
276
+ case R:
277
+ case D:
278
+ {
279
+ const {at: n} = e, r = [ {
280
+ type: O,
281
+ range: [ n, q(n, e) ]
282
+ } ], [o] = p(t, n);
283
+ return u(o) || r.push({
284
+ type: D,
285
+ at: n,
286
+ fragment: o.children
287
+ }), r;
288
+ }
289
+
290
+ case B:
291
+ {
292
+ const {key: n} = e, o = [];
293
+ let c;
294
+ return H(t, e, (t, e, i) => {
295
+ const s = t[n];
296
+ return c && c.depth === e && r(c.value, s) && i[0] - c.range[1] <= 1 && (i = [ c.range[0], i[1] ],
297
+ o.pop()), c = {
298
+ type: B,
299
+ range: i,
300
+ key: n,
301
+ value: s,
302
+ depth: e
303
+ }, o.push(c), t;
304
+ }), o;
305
+ }
306
+
307
+ default:
308
+ return e;
309
+ }
310
+ };
311
+
312
+ function* X(t, e = E(t.selection)) {
313
+ if (M(e)) {
233
314
  const n = y(t.doc, e[0])?.[0];
234
315
  n && (yield n);
235
- } else for (const [n, r] of T(t.doc, e)) U(e, [ r, r + d(n) ]) && (yield n);
316
+ } else for (const [n, , r] of b(t.doc, e)) S(r, u(n)) && (yield n);
236
317
  }
237
318
 
238
- function q(t, e = W(t.selection)) {
319
+ function* Y(t, e = E(t.selection)) {
320
+ const n = t.doc;
321
+ if (M(e)) {
322
+ const [t, r] = p(n, e[0]);
323
+ yield [ t, e[0] - r, [ r, r ] ];
324
+ } else for (const r of _(n, e)) S(r[2], u(r[0])) && (yield r);
325
+ }
326
+
327
+ function Z(t, e = E(t.selection)) {
239
328
  t.apply({
240
329
  type: "delete",
241
330
  range: e
242
331
  });
243
332
  }
244
333
 
245
- function z(t, e, n = t.selection[0]) {
334
+ function j(t, e, n = t.selection[0]) {
246
335
  t.apply({
247
336
  type: "insert_text",
248
337
  at: n,
@@ -250,7 +339,7 @@ function z(t, e, n = t.selection[0]) {
250
339
  });
251
340
  }
252
341
 
253
- function G(t, e, n = t.selection[0]) {
342
+ function K(t, e, n = t.selection[0]) {
254
343
  t.apply({
255
344
  type: "insert_node",
256
345
  at: n,
@@ -260,143 +349,160 @@ function G(t, e, n = t.selection[0]) {
260
349
  });
261
350
  }
262
351
 
263
- function J(t, e, n = W(t.selection)) {
264
- t.apply({
352
+ function Q(t, e, n = E(t.selection)) {
353
+ t.apply([ {
265
354
  type: "delete",
266
355
  range: n
267
- }).apply({
356
+ }, {
268
357
  type: "insert_text",
269
358
  at: n[0],
270
359
  text: e
271
- });
360
+ } ]);
272
361
  }
273
362
 
274
- function X(t, e) {
363
+ function $(t, e) {
275
364
  t.apply({
276
- type: "patch_node",
277
- path: [],
365
+ type: "format",
366
+ range: [ 0, 0 ],
278
367
  key: "children",
279
- value: e
368
+ value: e,
369
+ depth: 0
280
370
  });
281
371
  }
282
372
 
283
- function Y(t, e, n, r = W(t.selection)) {
284
- t.apply({
373
+ function* tt(t, [e, n]) {
374
+ if (e >= n) return void (yield [ e, n ]);
375
+ let r = e;
376
+ for (const [o, c, i] of b(t.doc, [ e, n ])) !s(o) && S(i, u(o)) && (r < c && (yield [ r, c ]),
377
+ r = c + 1);
378
+ r < n && (yield [ r, n ]);
379
+ }
380
+
381
+ function et(t, e, n, r = E(t.selection)) {
382
+ for (const o of tt(t, r)) t.apply({
285
383
  type: "format",
286
- range: r,
384
+ range: o,
287
385
  key: e,
288
386
  value: n
289
387
  });
290
388
  }
291
389
 
292
- function Z(t, e, n = W(t.selection)) {
390
+ function nt(t, e, n = E(t.selection)) {
293
391
  let r = !1, o = !1;
294
- for (const c of t.exec(V, n)) if (i(c) && (o = !0, !c[e])) {
392
+ for (const c of t.exec(X, n)) if (s(c) && (o = !0, !c[e])) {
295
393
  r = !0;
296
394
  break;
297
395
  }
298
- o && t.apply({
396
+ if (o) for (const c of tt(t, n)) t.apply({
299
397
  type: "format",
300
- range: n,
398
+ range: c,
301
399
  key: e,
302
400
  value: r
303
401
  });
304
402
  }
305
403
 
306
- function j(t, e, n, r = t.selection[0]) {
307
- const o = h(t.doc, r)[2];
404
+ function rt(t, e, n, r = E(t.selection)) {
308
405
  t.apply({
309
- type: "patch_node",
310
- path: o,
406
+ type: "format",
407
+ range: r,
311
408
  key: e,
312
- value: n
409
+ value: n,
410
+ depth: -2
313
411
  });
314
412
  }
315
413
 
316
- function K(t, e, n, r, o = t.selection[0]) {
317
- const [c, , s] = h(t.doc, o);
414
+ function ot(t, e, n, r, o = E(t.selection)) {
415
+ let c = !1;
416
+ for (const [i] of t.exec(Y, o)) if (i[e] !== n) {
417
+ c = !0;
418
+ break;
419
+ }
318
420
  t.apply({
319
- type: "patch_node",
320
- path: s,
421
+ type: "format",
422
+ range: o,
321
423
  key: e,
322
- value: c[e] === n ? r : n
424
+ value: c ? n : r,
425
+ depth: -2
323
426
  });
324
427
  }
325
428
 
326
- function Q(t, e, n, r = t.selection[0]) {
429
+ function ct(t, e, n, r = t.selection[0]) {
327
430
  const o = y(t.doc, r, !0);
328
- o && !i(o[0]) && t.apply({
329
- type: "patch_node",
330
- path: o[2],
331
- key: e,
332
- value: n
333
- });
431
+ if (o && !s(o[0])) {
432
+ const c = r - o[1];
433
+ t.apply({
434
+ type: "format",
435
+ range: [ c, c + 1 ],
436
+ key: e,
437
+ value: n
438
+ });
439
+ }
334
440
  }
335
441
 
336
- var $ = t => 1 === t.nodeType, tt = t => 8 === t.nodeType, et = 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 ] ]), nt = new Set([ "DIV", "H1", "H2", "H3", "H4", "H5", "H6", "P", "PRE", "LI", "DT", "DD", "TH", "TD" ]), rt = t => nt.has(t.tagName), ot = (t, e) => t.compareDocumentPosition(e), ct = t => t.ownerDocument, st = t => ct(t).getSelection(), it = (t, e) => {
442
+ var it = t => 1 === t.nodeType, st = t => 8 === t.nodeType, lt = /* @__PURE__ */ 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 ] ]), at = /* @__PURE__ */ new Set([ "DIV", "H1", "H2", "H3", "H4", "H5", "H6", "P", "PRE", "LI", "DT", "DD", "TH", "TD" ]), ft = t => at.has(t.tagName), ut = (t, e) => t.compareDocumentPosition(e), dt = t => t.ownerDocument, pt = t => dt(t).getSelection(), yt = (t, e) => {
337
443
  if (t.rangeCount) {
338
444
  const n = t.getRangeAt(0);
339
445
  if (e.contains(n.commonAncestorContainer)) return n;
340
446
  }
341
- }, lt = (t, e, n, r) => {
342
- const [o, c] = ((t, [e, n]) => [ _(t, e), _(t, n) ])(n, r), s = ct(t), i = F(r), l = r[0] - r[1] > 0, a = l ? o : c, u = ut(t, e, l ? c : o), f = i ? u : ut(t, e, a), d = s.createRange(), [p, h] = u, [y, k] = f;
343
- return $(p) && t !== p ? h < 1 ? d.setStartBefore(p) : d.setStartAfter(p) : d.setStart(p, h),
344
- $(y) && t !== y ? k < 1 ? d.setEndBefore(y) : d.setEndAfter(y) : d.setEnd(y, k),
447
+ }, ht = (t, e, n, r) => {
448
+ const [o, c] = ((t, [e, n]) => [ k(t, e), k(t, n) ])(n, r), i = dt(t), s = M(r), l = r[0] - r[1] > 0, a = l ? o : c, f = mt(t, e, l ? c : o), u = s ? f : mt(t, e, a), d = i.createRange(), [p, y] = f, [h, g] = u;
449
+ return it(p) && t !== p ? y < 1 ? d.setStartBefore(p) : d.setStartAfter(p) : d.setStart(p, y),
450
+ it(h) && t !== h ? g < 1 ? d.setEndBefore(h) : d.setEndAfter(h) : d.setEnd(h, g),
345
451
  d;
346
- }, at = (t, e, n, r, o) => {
347
- const c = st(t);
348
- if (o || it(c, t)) {
349
- const o = lt(t, e, n, r), s = r[0] - r[1] > 0;
350
- c.removeAllRanges(), c.addRange(o), s && (c.collapseToEnd(), c.extend(o.startContainer, o.startOffset));
452
+ }, gt = (t, e, n, r, o) => {
453
+ const c = pt(t);
454
+ if (o || yt(c, t)) {
455
+ const o = ht(t, e, n, r), i = r[0] - r[1] > 0;
456
+ c.removeAllRanges(), c.addRange(o), i && (c.collapseToEnd(), c.extend(o.startContainer, o.startOffset));
351
457
  }
352
- }, ut = (t, e, [n, r]) => e(({t: e, o, i: c, l: s}) => {
353
- let i, l = 0;
354
- for (;i = e(); ) if (4 === i) {
458
+ }, mt = (t, e, [n, r]) => e(({t: e, o, i: c, l: i}) => {
459
+ let s, l = 0;
460
+ for (;s = e(); ) if (4 === s) {
355
461
  if (l < n.length) for (let t = n[l++]; t > 0; t--) o();
356
462
  } else {
357
- const t = s();
463
+ const t = i();
358
464
  if (r <= t) return [ c(), r ];
359
465
  r -= t;
360
466
  }
361
467
  return [ t, 0 ];
362
- }, t), ft = (e, n, r, o) => {
468
+ }, t), kt = (e, n, r, o) => {
363
469
  let c = !0;
364
470
  if (e === r && !r.hasChildNodes()) return [ [], 0 ];
365
- if ($(r) && r.hasChildNodes()) {
471
+ if (it(r) && r.hasChildNodes()) {
366
472
  const e = t(o, r.childNodes.length - 1);
367
473
  r = r.childNodes[e], c = e === o, o = 0;
368
474
  }
369
- return n(({t, u: s, p: i, h: l, i: a, l: u, k: f}) => {
370
- s(r), 4 !== f() && i();
475
+ return n(({t, u: i, p: s, h: l, i: a, l: f, m: u}) => {
476
+ i(r), 4 !== u() && s();
371
477
  const d = n(() => {
372
478
  const t = [];
373
- for (;f() && a() !== e; ) {
479
+ for (;u() && a() !== e; ) {
374
480
  let e = 0;
375
- for (;l(), f(); ) e++;
376
- t.unshift(e), i();
481
+ for (;l(), u(); ) e++;
482
+ t.unshift(e), s();
377
483
  }
378
484
  return t;
379
485
  });
380
486
  let p = 0;
381
487
  for (;t(); ) {
382
- const t = ot(r, a());
488
+ const t = ut(r, a());
383
489
  if (0 === t || 16 & t) {
384
490
  if (c) break;
385
491
  } else if (4 & t) break;
386
- p += u();
492
+ p += f();
387
493
  }
388
494
  return [ d, p + o ];
389
495
  }, e);
390
- }, dt = (t, e, {startOffset: n, startContainer: r, endOffset: o, endContainer: c}) => {
391
- const s = ft(t, e, r, n);
392
- return [ s, r === c && n === o ? s : ft(t, e, c, o) ];
393
- }, pt = "undefined" != typeof navigator && /Mac|iP(hone|od|ad)/.test(navigator.platform), ht = (t, e) => {
496
+ }, xt = (t, e, {startOffset: n, startContainer: r, endOffset: o, endContainer: c}) => {
497
+ const i = kt(t, e, r, n);
498
+ return [ i, r === c && n === o ? i : kt(t, e, c, o) ];
499
+ }, vt = "undefined" != typeof navigator && /Mac|iP(hone|od|ad)/.test(navigator.platform), _t = (t, e) => {
394
500
  const n = t.endsWith("+"), r = (n ? t.slice(0, -2) : t).split("+"), o = n ? "+" : r.pop(), c = "Space" === o ? " " : o.toLowerCase();
395
- let s = !1, i = !1, l = !1, a = !1;
501
+ let i = !1, s = !1, l = !1, a = !1;
396
502
  return r.forEach(t => {
397
503
  switch (t) {
398
504
  case "Ctrl":
399
- i = !0;
505
+ s = !0;
400
506
  break;
401
507
 
402
508
  case "Meta":
@@ -404,7 +510,7 @@ var $ = t => 1 === t.nodeType, tt = t => 8 === t.nodeType, et = new Map([ [ "BR"
404
510
  break;
405
511
 
406
512
  case "Mod":
407
- pt ? l = !0 : i = !0;
513
+ vt ? l = !0 : s = !0;
408
514
  break;
409
515
 
410
516
  case "Alt":
@@ -412,270 +518,191 @@ var $ = t => 1 === t.nodeType, tt = t => 8 === t.nodeType, et = new Map([ [ "BR"
412
518
  break;
413
519
 
414
520
  case "Shift":
415
- s = !0;
521
+ i = !0;
416
522
  }
417
523
  }), t => {
418
- if (t.key.toLowerCase() === c && i === t.ctrlKey && l === t.metaKey && s === t.shiftKey && a === t.altKey) return !1 !== e(t);
524
+ if (t.key.toLowerCase() === c && s === t.ctrlKey && l === t.metaKey && i === t.shiftKey && a === t.altKey) return !1 !== e(t);
419
525
  };
420
526
  };
421
527
 
422
- function yt(t) {
423
- let e = 0, r = 0, o = !1;
424
- const c = Date.now, s = [ [ t.doc, t.selection, [] ] ], i = () => s[e], l = () => e > 0, a = () => e < s.length - 1, u = e => {
425
- t.exec(X, e.children);
426
- const r = e, o = t.doc;
427
- for (const c of n(r)) "children" !== c && o[c] !== r[c] && t.apply({
428
- type: "patch_node",
429
- path: [],
430
- key: c,
431
- value: r[c]
432
- });
433
- for (const c of n(o)) "children" === c || c in r || t.apply({
434
- type: "patch_node",
435
- path: [],
436
- key: c,
437
- value: void 0
438
- });
439
- }, f = () => {
440
- if (l()) {
441
- const n = i()[1];
442
- e--;
443
- const r = t.doc;
444
- o = !0, u(i()[0]), o = !1, r !== t.doc && (t.selection = n);
528
+ function bt(t) {
529
+ let e = 0, n = /* @__PURE__ */ new WeakMap;
530
+ const r = Date.now, o = [], c = [], i = ([t, e], [, n]) => [ t, n.concat(e) ], s = () => {
531
+ const e = n.get(t.doc);
532
+ return n = /* @__PURE__ */ new WeakMap, e;
533
+ }, l = () => {
534
+ let t = s();
535
+ if (t) {
536
+ const n = r();
537
+ o.length && n - e < 500 && (t = i(o.pop(), t)), e = n, o.push(t), c.length = 0,
538
+ o.length > 100 && o.shift();
445
539
  }
446
- }, d = () => {
447
- if (a()) {
448
- e++;
449
- const [n, r, c] = i(), s = t.doc;
450
- o = !0, u(n), o = !1, s !== t.doc && (t.selection = [ H(r[0], c), H(r[1], c) ]);
540
+ }, a = (e, n) => {
541
+ if (l(), e.length) {
542
+ const [r, o] = e[e.length - 1];
543
+ t.apply(o);
544
+ const c = s();
545
+ c && (e.pop(), n.push(c), t.selection = r);
451
546
  }
547
+ }, f = () => {
548
+ a(o, c);
549
+ }, u = () => {
550
+ a(c, o);
452
551
  };
453
- t.hook("apply", (n, i) => {
454
- if (o) return;
455
- const l = t.doc, a = t.selection;
456
- i(n);
457
- const u = t.doc;
458
- if (l !== u) {
459
- const t = c();
460
- if (0 === e || t - r >= 500) {
461
- e++;
462
- const t = [ l, a, [] ];
463
- e >= s.length ? s.push(t) : s[e] = t;
464
- }
465
- r = t, s[e][0] = u, s[e][2].push(n), s.length > e + 1 && (s.length = e + 1), e > 500 && (e--,
466
- s.shift());
552
+ t.hook("apply", (e, r) => {
553
+ const o = t.doc, c = t.selection, s = r(e), l = t.doc;
554
+ if (s && o !== l) {
555
+ const t = [ c, J(o, s) ], e = n.get(o);
556
+ n.set(l, e ? i(e, t) : t);
467
557
  }
468
- }), t.hook("keyboard", ht("Mod+Z", f)), t.hook("keyboard", ht("Shift+Mod+Z", d)),
469
- t.set(yt, {
558
+ }), t.on("change", l), t.hook("keyboard", _t("Mod+Z", f)), t.hook("keyboard", _t("Shift+Mod+Z", u)),
559
+ t.set(bt, {
470
560
  undo: f,
471
- redo: d,
472
- undoable: l,
473
- redoable: a,
474
- clear: () => {
475
- s.length = 0, s.push([ t.doc, t.selection, [] ]), e = 0, r = 0;
476
- }
561
+ redo: u,
562
+ stack: t => (l(), t ? c : o)
477
563
  });
478
564
  }
479
565
 
480
- function kt(t) {
481
- t.get(yt).undo();
566
+ function wt(t) {
567
+ t.get(bt).undo();
482
568
  }
483
569
 
484
- function mt(t) {
485
- t.get(yt).redo();
570
+ function Tt(t) {
571
+ t.get(bt).redo();
486
572
  }
487
573
 
488
- function gt(t) {
489
- return t.get(yt).undoable();
574
+ function Et(t) {
575
+ return !!t.get(bt).stack().length;
490
576
  }
491
577
 
492
- function _t(t) {
493
- return t.get(yt).redoable();
578
+ function Mt(t) {
579
+ return !!t.get(bt).stack(!0).length;
494
580
  }
495
581
 
496
- function xt(t) {
497
- t.get(yt).clear();
582
+ function St(t) {
583
+ const {stack: e} = t.get(bt);
584
+ e().length = 0, e(!0).length = 0;
498
585
  }
499
586
 
500
- var bt = [], vt = () => {}, Tt = t => {
587
+ var At = [], Ot = () => {}, Rt = t => {
501
588
  throw Error(t);
502
- }, Et = ({doc: t, readonly: e = !1, schema: n, isBlock: r = rt, onWarn: a = console.warn, onError: u = Tt}) => {
503
- let f = [ 0, 0 ];
504
- const d = t => {
505
- if (!n) return a("An unsafe operation was detected. We recommend using schema option."),
589
+ }, Dt = ({doc: t, readonly: e = !1, schema: n, isBlock: r = ft, onWarn: s = console.warn, onError: l = Rt}) => {
590
+ let a = [ 0, 0 ];
591
+ const f = t => {
592
+ if (!n) return s("An unsafe operation was detected. We recommend using schema option."),
506
593
  !0;
507
594
  const e = n["~standard"].validate(t);
508
- if (e instanceof Promise) u("async validate is not supported"); else {
595
+ if (e instanceof Promise) l("async validate is not supported"); else {
509
596
  if (!e.issues) return !0;
510
- a(e.issues.map(t => t.message).join("\n"));
597
+ s(e.issues.map(t => t.message).join("\n"));
511
598
  }
512
599
  return !1;
513
600
  };
514
- n && !d(t) && u("Invalid document");
515
- const y = /* @__PURE__ */ new Map, k = /* @__PURE__ */ new WeakMap, m = t => y.get(t) || bt, _ = /* @__PURE__ */ new Map, b = /* @__PURE__ */ new Set, v = t => {
516
- const e = _.get(t);
517
- e && (b.size || s(() => {
518
- b.forEach(t => {
601
+ n && !f(t) && l("Invalid document");
602
+ const u = /* @__PURE__ */ new Map, d = /* @__PURE__ */ new WeakMap, p = t => u.get(t) || At, y = /* @__PURE__ */ new Map;
603
+ let h = /* @__PURE__ */ new Set;
604
+ const g = t => {
605
+ const e = y.get(t);
606
+ e && (h.size || i(() => {
607
+ const t = h;
608
+ h = /* @__PURE__ */ new Set, t.forEach(t => {
519
609
  t();
520
- }), b.clear();
610
+ });
521
611
  }), e.forEach(t => {
522
- b.add(t);
612
+ h.add(t);
523
613
  }));
524
- }, T = t => {
525
- if (!e) if (Array.isArray(t)) for (const e of t) E(e); else E(t);
526
- return D;
527
- }, E = e => {
528
- const n = t, r = m("apply"), o = r.length;
529
- let c = 0;
530
- const s = () => {
531
- if (c < o) {
532
- const t = c;
533
- r[c](e, u), t === c && u(e);
534
- } else if (c === o) {
535
- c++;
536
- try {
537
- const [n, r] = ((t, e, n) => {
538
- switch (n.type) {
539
- case S:
540
- {
541
- const [r, o] = n.range;
542
- P(t, r) && P(t, o) && r < o && (t = L(t, r, o, []), e = C(e, n));
543
- break;
544
- }
545
-
546
- case A:
547
- {
548
- const {at: r, text: o} = n;
549
- if (P(t, r) && o) {
550
- const [c, s] = h(t, r), l = p(c, s, !0);
551
- let a;
552
- if (l) {
553
- const t = l[0];
554
- i(t) && (a = t);
555
- }
556
- t = L(t, r, r, M(o, a, c)), e = C(e, n);
557
- }
558
- break;
559
- }
560
-
561
- case O:
562
- {
563
- const {at: r, fragment: o} = n;
564
- P(t, r) && o.length && (t = L(t, r, r, o), e = C(e, n));
565
- break;
566
- }
567
-
568
- case "format":
569
- {
570
- const {range: [e, r], key: o, value: c} = n;
571
- if (P(t, e) && P(t, r) && e <= r) if (e === r) {
572
- const [{children: n}, , r] = h(t, e);
573
- if (1 === n.length) {
574
- const e = n[0];
575
- i(e) && !e.text && (t = I(t, [ ...r, 0 ], {
576
- ...e,
577
- [o]: c
578
- }));
579
- }
580
- } else {
581
- const n = t => l(t) ? {
582
- ...t,
583
- children: t.children.map(n)
584
- } : i(t) ? {
585
- ...t,
586
- [o]: c
587
- } : t;
588
- t = L(t, e, r, w(t, e, r).map(n));
589
- }
590
- break;
591
- }
592
-
593
- case "patch_node":
594
- {
595
- const {path: e, key: r, value: o} = n, c = ((t, e) => {
596
- for (let n = 0; n < e.length; n++) t = t.children[e[n]];
597
- return t;
598
- })(t, e);
599
- c && (t = I(t, e, {
600
- ...c,
601
- [r]: o
602
- }));
603
- break;
614
+ }, k = n => {
615
+ if (!e) {
616
+ const e = p("apply"), r = e.length, o = t, c = a;
617
+ let i = !1;
618
+ try {
619
+ let o = !1;
620
+ for (let c of Array.isArray(n) ? n : [ n ]) {
621
+ let n = 0, i = null;
622
+ const l = () => {
623
+ if (n < r) {
624
+ const t = n;
625
+ e[n](c, f), t === n && f(c);
626
+ } else if (n === r) {
627
+ n++;
628
+ try {
629
+ const [e, n] = G(t, a, c);
630
+ t = e, v(n), i = c, I(c) && (o = !0);
631
+ } catch (l) {
632
+ s("rollback operation: " + l);
604
633
  }
605
634
  }
606
- return [ t, e ];
607
- })(t, f, e);
608
- (({type: t}) => t !== A && t !== S)(e) && !d(n) || (t = n, R(r));
609
- } catch (n) {
610
- a("rollback operation: " + n);
635
+ }, f = t => (null == t ? n = r + 1 : (c = t, n++, l()), i);
636
+ if (l(), !i) return _;
611
637
  }
638
+ i = !o || f(t);
639
+ } finally {
640
+ i || (t = o, a = c);
612
641
  }
613
- }, u = t => {
614
- null != t ? (e = t, c++, s()) : c = o + 1;
615
- };
616
- s(), n !== t && v("change");
617
- }, R = e => {
618
- !((t, [e, n]) => P(t, e) && P(t, n))(t, e) || f[0] === e[0] && f[1] === e[1] || (f = e,
619
- v("selectionchange"));
620
- }, D = {
642
+ t !== o && g("change");
643
+ }
644
+ return _;
645
+ }, v = e => {
646
+ !V(t, e) || a[0] === e[0] && a[1] === e[1] || (a = e, g("selectionchange"));
647
+ }, _ = {
621
648
  get doc() {
622
649
  return t;
623
650
  },
624
651
  get selection() {
625
- return f;
652
+ return a;
626
653
  },
627
654
  set selection(t) {
628
- R(t);
655
+ v(t);
629
656
  },
630
657
  get readonly() {
631
658
  return e;
632
659
  },
633
660
  set readonly(t) {
634
- e = t, v("readonly");
661
+ e = t, g("readonly");
635
662
  },
636
- apply: T,
663
+ apply: k,
637
664
  on: (t, e) => {
638
- let n = _.get(t);
639
- return n || _.set(t, n = /* @__PURE__ */ new Set), n.add(e), () => {
665
+ let n = y.get(t);
666
+ return n || y.set(t, n = /* @__PURE__ */ new Set), n.add(e), () => {
640
667
  n.delete(e);
641
668
  };
642
669
  },
643
670
  hook: (t, e) => {
644
- let n = y.get(t);
645
- return n || y.set(t, n = []), n.push(e), () => {
671
+ let n = u.get(t);
672
+ return n || u.set(t, n = []), n.push(e), () => {
646
673
  const t = n.indexOf(e);
647
674
  -1 !== t && n.splice(t, 1);
648
675
  };
649
676
  },
650
677
  exec: (t, ...e) => {
651
- const n = t(D, ...e);
652
- return void 0 === n ? D : n;
678
+ const n = t(_, ...e);
679
+ return void 0 === n ? _ : n;
653
680
  },
654
- get: t => (k.has(t) || u("No value found for key"), k.get(t)),
655
- set: (t, e) => (k.set(t, e), D),
681
+ get: t => (d.has(t) || l("No value found for key"), d.get(t)),
682
+ set: (t, e) => (d.set(t, e), _),
656
683
  input: n => {
657
- if (!window.InputEvent || !c(InputEvent.prototype.getTargetRanges)) return a("beforeinput event is not supported."),
658
- vt;
659
- const {contentEditable: s, role: i, ariaMultiLine: l, ariaReadOnly: u} = n, d = n.style.whiteSpace;
684
+ if (!window.InputEvent || !c(InputEvent.prototype.getTargetRanges)) return s("beforeinput event is not supported."),
685
+ Ot;
686
+ const {contentEditable: i, role: l, ariaMultiLine: f, ariaReadOnly: u} = n, d = n.style.whiteSpace;
660
687
  n.role = "textbox", n.style.whiteSpace = "pre-wrap", n.ariaMultiLine = "true";
661
- let p = !1, h = null, y = !1, k = !1, _ = !1, b = f, v = null;
662
- const E = ct(n), w = ((t, e) => {
688
+ let y = !1, h = null, g = !1, b = !1, w = !1, T = a, S = null;
689
+ const A = dt(n), O = ((t, e) => {
663
690
  let n = null, r = null, o = null;
664
691
  const c = () => {
665
692
  if (null != o) return o;
666
693
  if (r) if ((t => 3 === t.nodeType)(r)) {
667
694
  const t = r.data;
668
- if (t) return o = "\n" === t ? i() ? 3 : 5 : 1;
669
- } else if ($(r)) {
695
+ if (t) return o = "\n" === t ? s() ? 3 : 5 : 1;
696
+ } else if (it(r)) {
670
697
  if ("false" === r.contentEditable) return o = 2;
671
698
  {
672
- const t = et.get(r.tagName);
673
- if (null != t) return o = 1 === t ? i() ? 3 : 5 : 3 === t ? 2 : 6;
699
+ const t = lt.get(r.tagName);
700
+ if (null != t) return o = 1 === t ? s() ? 3 : 5 : 3 === t ? 2 : 6;
674
701
  if (e(r)) return o = 4;
675
702
  }
676
703
  } else if (!(t => 11 === t.nodeType)(r)) return o = 6;
677
704
  return o = 0;
678
- }, s = () => {
705
+ }, i = () => {
679
706
  const t = c();
680
707
  if (o = null, 2 === t || 6 === t) {
681
708
  const t = r;
@@ -683,10 +710,10 @@ var bt = [], vt = () => {}, Tt = t => {
683
710
  return r;
684
711
  }
685
712
  return r = n.nextNode();
686
- }, i = () => {
713
+ }, s = () => {
687
714
  const t = r.parentNode;
688
- return f(() => {
689
- for (o = 0; s(); ) {
715
+ return u(() => {
716
+ for (o = 0; i(); ) {
690
717
  if (c()) return !0;
691
718
  if (!t.contains(r)) break;
692
719
  }
@@ -698,14 +725,14 @@ var bt = [], vt = () => {}, Tt = t => {
698
725
  }, a = (t, e) => {
699
726
  for (;(o = null) || (r = t ? n.previousSibling() : n.nextSibling()); ) if (e ? 4 === c() : !l()) return !0;
700
727
  return !1;
701
- }, u = {
728
+ }, f = {
702
729
  t: () => {
703
- for (;s(); ) {
730
+ for (;i(); ) {
704
731
  const t = c();
705
732
  if (t && 6 !== t) return t;
706
733
  }
707
734
  },
708
- k: c,
735
+ m: c,
709
736
  i: () => r,
710
737
  l: () => {
711
738
  const t = c();
@@ -724,50 +751,50 @@ var bt = [], vt = () => {}, Tt = t => {
724
751
  p: () => {
725
752
  for (;(o = null) || (r = n.parentNode()); ) if (4 === c()) return;
726
753
  }
727
- }, f = (e, c) => {
728
- const s = n, i = r, l = o;
754
+ }, u = (e, c) => {
755
+ const i = n, s = r, l = o;
729
756
  try {
730
- return n || (n = t.createTreeWalker(r = c, 5)), e(u);
757
+ return n || (n = t.createTreeWalker(r = c, 5)), e(f);
731
758
  } finally {
732
- n = s, r = i, o = l, n && i && (n.currentNode = i);
759
+ n = i, r = s, o = l, n && s && (n.currentNode = s);
733
760
  }
734
761
  };
735
- return f;
736
- })(E, r), M = () => {
762
+ return u;
763
+ })(A, r), R = () => {
737
764
  n.contentEditable = e ? "false" : "true", n.ariaReadOnly = e ? "true" : null;
738
765
  };
739
- M();
740
- const S = () => {
741
- k || n.focus({
766
+ R();
767
+ const D = () => {
768
+ b || (gt(n, O, t, a, !0), T = a, n.focus({
742
769
  preventScroll: !0
743
- });
744
- }, A = () => {
745
- v = null, f[0] === b[0] && f[1] === b[1] || (at(n, w, t, f), b = f);
746
- }, O = () => {
747
- null != v && clearTimeout(v);
748
- }, B = D.on("change", () => {
749
- k || requestAnimationFrame(S);
750
- }), I = D.on("selectionchange", () => {
751
- f[0] === b[0] && f[1] === b[1] || (O(), v = setTimeout(A, 50));
752
- }), L = D.on("readonly", M), P = t => {
753
- for (const e of m("paste")) {
770
+ }));
771
+ }, B = () => {
772
+ S = null, a[0] === T[0] && a[1] === T[1] || (gt(n, O, t, a), T = a);
773
+ }, I = () => {
774
+ null != S && clearTimeout(S);
775
+ }, L = _.on("change", () => {
776
+ b || requestAnimationFrame(D);
777
+ }), P = _.on("selectionchange", () => {
778
+ a[0] === T[0] && a[1] === T[1] || (I(), S = setTimeout(B, 50));
779
+ }), N = _.on("readonly", R), W = t => {
780
+ for (const e of p("paste")) {
754
781
  const n = e(t);
755
782
  if (n) {
756
783
  if (!0 === n) return;
757
784
  return n;
758
785
  }
759
786
  }
760
- a("failed to serialize pasted data");
761
- }, N = ((t, e) => {
787
+ s("failed to serialize pasted data");
788
+ }, H = ((t, e) => {
762
789
  let n = !1, r = [];
763
790
  const o = t => {
764
791
  n && r.push(...t);
765
792
  }, c = new MutationObserver(t => {
766
793
  o(t), n || e();
767
- }), s = () => {
794
+ }), i = () => {
768
795
  o(c.takeRecords());
769
- }, i = () => {
770
- s();
796
+ }, s = () => {
797
+ i();
771
798
  const t = r;
772
799
  return r = [], t;
773
800
  };
@@ -777,46 +804,46 @@ var bt = [], vt = () => {}, Tt = t => {
777
804
  childList: !0,
778
805
  subtree: !0
779
806
  }), {
780
- m: t => {
807
+ k: t => {
781
808
  let e;
782
809
  for (;e = t.pop(); ) if ("childList" === e.type) {
783
810
  const {target: t, removedNodes: n, addedNodes: r, nextSibling: o} = e;
784
811
  for (let e = n.length - 1; e >= 0; e--) t.insertBefore(n[e], o);
785
812
  for (let e = r.length - 1; e >= 0; e--) t.removeChild(r[e]);
786
813
  } else e.target.data = e.oldValue;
787
- i();
814
+ s();
788
815
  },
789
- _: t => {
790
- !n && t && s(), n = t;
816
+ v: t => {
817
+ !n && t && i(), n = t;
791
818
  },
792
- v: i,
819
+ _: s,
793
820
  T: () => {
794
821
  r.length = 0, c.disconnect();
795
822
  }
796
823
  };
797
824
  })(n, () => {
798
- O(), at(n, w, t, f);
825
+ I(), gt(n, O, t, a);
799
826
  }), C = () => {
800
- R(b = x(t, ((t, e) => {
801
- const n = st(t), r = it(n, t);
827
+ v(T = x(t, ((t, e) => {
828
+ const n = pt(t), r = yt(n, t);
802
829
  if (!r) return [ [ [ 0 ], 0 ], [ [ 0 ], 0 ] ];
803
- const o = dt(t, e, r), c = ot(n.anchorNode, n.focusNode);
830
+ const o = xt(t, e, r), c = ut(n.anchorNode, n.focusNode);
804
831
  return (0 === c ? n.anchorOffset > n.focusOffset : 2 & c) ? [ o[1], o[0] ] : o;
805
- })(n, w)));
806
- }, U = () => {
807
- const e = N.v();
808
- N._(!1), e.length && (N.m(e), E.removeEventListener("selectionchange", Z), at(n, w, t, f, !0),
809
- E.addEventListener("selectionchange", Z)), h && (R(h[1]), T(h[0]), h = null), y = !1;
810
- }, V = t => {
811
- if (!y) for (const e of m("keyboard")) if (e(t)) return t.preventDefault(), void N._(!1);
812
- }, q = () => {
813
- y || U();
814
- }, z = e => {
832
+ })(n, O)));
833
+ }, F = () => {
834
+ const e = H._();
835
+ H.v(!1), e.length && (H.k(e), A.removeEventListener("selectionchange", Z), gt(n, O, t, a, !0),
836
+ A.addEventListener("selectionchange", Z)), h && (v(h[1]), k(h[0]), h = null), g = !1;
837
+ }, q = t => {
838
+ if (!g) for (const e of p("keyboard")) if (e(t)) return t.preventDefault(), void H.v(!1);
839
+ }, z = () => {
840
+ g || F();
841
+ }, V = e => {
815
842
  e.preventDefault();
816
843
  const r = e.inputType;
817
844
  if (r.startsWith("format")) return;
818
845
  if ("historyUndo" === r || "historyRedo" === r) return;
819
- y ? N._(!0) : C();
846
+ g ? H.v(!0) : C();
820
847
  const o = e.getTargetRanges()[0];
821
848
  if (o) {
822
849
  let c = "insertParagraph" === r || "insertLineBreak" === r ? "\n" : e.data;
@@ -824,42 +851,42 @@ var bt = [], vt = () => {}, Tt = t => {
824
851
  const t = e.dataTransfer;
825
852
  t && (c = t.getData("text/plain"));
826
853
  }
827
- h || (h = [ [], f ]);
828
- const s = h[0], i = x(t, dt(n, w, o));
829
- F(i) || s.push({
854
+ h || (h = [ [], a ]);
855
+ const i = h[0], s = x(t, xt(n, O, o));
856
+ M(s) || i.push({
830
857
  type: "delete",
831
- range: i
832
- }), c && s.push({
858
+ range: s
859
+ }), c && i.push({
833
860
  type: "insert_text",
834
- at: i[0],
861
+ at: s[0],
835
862
  text: c
836
863
  });
837
864
  }
838
- y || U();
865
+ g || F();
839
866
  }, G = () => {
840
- y || C(), y = !0;
867
+ g || C(), g = !0;
841
868
  }, J = () => {
842
- U();
869
+ F();
843
870
  }, X = () => {
844
- k = !0, C();
871
+ b = !0, C();
845
872
  }, Y = () => {
846
- k = !1;
873
+ b = !1;
847
874
  }, Z = () => {
848
- !k || y || _ || C();
875
+ !b || g || w || C();
849
876
  }, j = t => {
850
- if (C(), !F(f)) for (const e of m("copy")) e(t);
877
+ if (C(), !M(a)) for (const e of p("copy")) e(t);
851
878
  }, K = t => {
852
879
  t.preventDefault(), j(t.clipboardData);
853
880
  }, Q = t => {
854
- t.preventDefault(), e || (j(t.clipboardData), T({
881
+ t.preventDefault(), e || (j(t.clipboardData), k({
855
882
  type: "delete",
856
- range: W(f)
883
+ range: E(a)
857
884
  }));
858
- }, tt = t => {
885
+ }, $ = t => {
859
886
  t.preventDefault();
860
- const e = P(t.clipboardData);
887
+ const e = W(t.clipboardData);
861
888
  if (e) {
862
- const t = W(f), n = t[0], r = [ {
889
+ const t = E(a), n = t[0], r = [ {
863
890
  type: "delete",
864
891
  range: t
865
892
  } ];
@@ -871,72 +898,72 @@ var bt = [], vt = () => {}, Tt = t => {
871
898
  type: "insert_node",
872
899
  at: n,
873
900
  fragment: e
874
- }), T(r);
901
+ }), k(r);
875
902
  }
876
- }, nt = e => {
903
+ }, tt = e => {
877
904
  e.preventDefault();
878
905
  const r = e.dataTransfer, c = ((t, e, {clientX: n, clientY: r}) => {
879
- const o = ct(t);
906
+ const o = dt(t);
880
907
  if (o.caretPositionFromPoint) {
881
908
  const c = o.caretPositionFromPoint(n, r);
882
- if (c) return ft(t, e, c.offsetNode, c.offset);
909
+ if (c) return kt(t, e, c.offsetNode, c.offset);
883
910
  } else if (o.caretRangeFromPoint) {
884
911
  const c = o.caretRangeFromPoint(n, r);
885
- if (c) return ft(t, e, c.startContainer, c.startOffset);
912
+ if (c) return kt(t, e, c.startContainer, c.startOffset);
886
913
  }
887
- })(n, w, e);
914
+ })(n, O, e);
888
915
  if (r && c) {
889
916
  let e;
890
917
  const n = [];
891
- _ && n.push({
918
+ w && n.push({
892
919
  type: "delete",
893
- range: W(f)
920
+ range: E(a)
894
921
  });
895
- const s = P(r);
896
- if (s) {
897
- const r = g(t, c), i = H(r, n);
898
- n.push(o(s) ? {
922
+ const i = W(r);
923
+ if (i) {
924
+ const r = m(t, c), s = U(r, n);
925
+ n.push(o(i) ? {
899
926
  type: "insert_text",
900
- at: i,
901
- text: s
927
+ at: s,
928
+ text: i
902
929
  } : {
903
930
  type: "insert_node",
904
- at: i,
905
- fragment: s
906
- }), e = [ i, H(r, n) ];
931
+ at: s,
932
+ fragment: i
933
+ }), e = [ s, U(r, n) ];
907
934
  }
908
- T(n), e && R(e);
935
+ k(n), e && v(e);
909
936
  }
910
- _ = !1;
911
- }, rt = t => {
912
- _ = !0, j(t.dataTransfer);
913
- }, lt = () => {
914
- _ = !1;
937
+ w = !1;
938
+ }, et = t => {
939
+ w = !0, j(t.dataTransfer);
940
+ }, nt = () => {
941
+ w = !1;
915
942
  };
916
- E.addEventListener("selectionchange", Z), n.addEventListener("keydown", V), n.addEventListener("input", q),
917
- n.addEventListener("beforeinput", z), n.addEventListener("compositionstart", G),
943
+ A.addEventListener("selectionchange", Z), n.addEventListener("keydown", q), n.addEventListener("input", z),
944
+ n.addEventListener("beforeinput", V), n.addEventListener("compositionstart", G),
918
945
  n.addEventListener("compositionend", J), n.addEventListener("focus", X), n.addEventListener("blur", Y),
919
- n.addEventListener("copy", K), n.addEventListener("cut", Q), n.addEventListener("paste", tt),
920
- n.addEventListener("drop", nt), n.addEventListener("dragstart", rt), n.addEventListener("dragend", lt);
921
- const ut = [];
922
- return m("mount").forEach(t => {
923
- const e = t(n, w);
924
- e && ut.push(e);
946
+ n.addEventListener("copy", K), n.addEventListener("cut", Q), n.addEventListener("paste", $),
947
+ n.addEventListener("drop", tt), n.addEventListener("dragstart", et), n.addEventListener("dragend", nt);
948
+ const rt = [];
949
+ return p("mount").forEach(t => {
950
+ const e = t(n, O);
951
+ e && rt.push(e);
925
952
  }), () => {
926
- p || (p = !0, B(), I(), L(), n.contentEditable = s, n.role = i, n.ariaMultiLine = l,
927
- n.ariaReadOnly = u, n.style.whiteSpace = d, N.T(), E.removeEventListener("selectionchange", Z),
928
- n.removeEventListener("keydown", V), n.removeEventListener("input", q), n.removeEventListener("beforeinput", z),
953
+ y || (y = !0, L(), P(), N(), n.contentEditable = i, n.role = l, n.ariaMultiLine = f,
954
+ n.ariaReadOnly = u, n.style.whiteSpace = d, H.T(), A.removeEventListener("selectionchange", Z),
955
+ n.removeEventListener("keydown", q), n.removeEventListener("input", z), n.removeEventListener("beforeinput", V),
929
956
  n.removeEventListener("compositionstart", G), n.removeEventListener("compositionend", J),
930
957
  n.removeEventListener("focus", X), n.removeEventListener("blur", Y), n.removeEventListener("copy", K),
931
- n.removeEventListener("cut", Q), n.removeEventListener("paste", tt), n.removeEventListener("drop", nt),
932
- n.removeEventListener("dragstart", rt), n.removeEventListener("dragend", lt), ut.forEach(t => {
958
+ n.removeEventListener("cut", Q), n.removeEventListener("paste", $), n.removeEventListener("drop", tt),
959
+ n.removeEventListener("dragstart", et), n.removeEventListener("dragend", nt), rt.forEach(t => {
933
960
  t();
934
961
  }));
935
962
  };
936
963
  }
937
964
  };
938
- return D.exec(yt), D;
939
- }, wt = (t, e) => {
965
+ return _.exec(bt), _;
966
+ }, Bt = (t, e) => {
940
967
  t.hook("paste", t => {
941
968
  for (const n of t.items) if ("file" === n.kind) {
942
969
  const t = e[n.type];
@@ -951,61 +978,61 @@ var bt = [], vt = () => {}, Tt = t => {
951
978
  });
952
979
  };
953
980
 
954
- function Mt(t, e) {
981
+ function It(t, e) {
955
982
  const n = e && e.voidToString;
956
983
  t.hook("copy", e => {
957
- e.setData("text/plain", E(t.doc, ...W(t.selection), n));
984
+ e.setData("text/plain", w(t.doc, ...E(t.selection), n));
958
985
  }), t.hook("paste", t => t.getData("text/plain"));
959
986
  }
960
987
 
961
- function St(t, e) {
962
- t.hook("mount", (n, r) => {
963
- const o = t.hook("copy", t => {
964
- const e = document.createElement("div");
965
- e.appendChild(it(st(n), n).cloneContents()), t.setData("text/html", e.innerHTML);
966
- }), c = t.hook("paste", t => {
967
- const n = t.getData("text/html");
968
- return n ? ((t, e, n) => {
969
- const r = n.text, o = t => {
970
- const e = n[t.tagName.toLowerCase()];
971
- if (e) {
972
- const n = e(t);
973
- if (n) return n;
974
- }
988
+ function Lt(t, e) {
989
+ let n;
990
+ t.hook("mount", (t, e) => (n = [ t, e ], () => {
991
+ n = void 0;
992
+ })), t.hook("copy", t => {
993
+ if (n) {
994
+ const e = n[0], r = document.createElement("div");
995
+ r.appendChild(yt(pt(e), e).cloneContents()), t.setData("text/html", r.innerHTML);
996
+ }
997
+ }), t.hook("paste", t => {
998
+ const r = t.getData("text/html");
999
+ return n && r ? ((t, e, n) => {
1000
+ const r = n.text, o = t => {
1001
+ const e = n[t.tagName.toLowerCase()];
1002
+ if (e) {
1003
+ const n = e(t);
1004
+ if (n) return n;
1005
+ }
1006
+ };
1007
+ let c = (new DOMParser).parseFromString(t, "text/html").body, i = !1;
1008
+ for (const s of [ ...c.childNodes ]) st(s) ? "StartFragment" === s.data ? (i = !0,
1009
+ c = new DocumentFragment) : "EndFragment" === s.data && (i = !1) : i && c.appendChild(s);
1010
+ return e(({t, i: e}) => {
1011
+ let n, c = null, i = "", s = !1;
1012
+ const l = [], a = () => {
1013
+ i && (c || (c = []), c.push(r(i)), i = "");
1014
+ }, f = () => {
1015
+ a(), !c && s && (c = []), c && l.push({
1016
+ children: c
1017
+ }), c = null, s = !1;
975
1018
  };
976
- let c = (new DOMParser).parseFromString(t, "text/html").body, s = !1;
977
- for (const i of [ ...c.childNodes ]) tt(i) ? "StartFragment" === i.data ? (s = !0,
978
- c = new DocumentFragment) : "EndFragment" === i.data && (s = !1) : s && c.appendChild(i);
979
- return e(({t, i: e}) => {
980
- let n, c = null, s = "", i = !1;
981
- const l = [], a = () => {
982
- s && (c || (c = []), c.push(r(s)), s = "");
983
- }, u = () => {
984
- a(), !c && i && (c = []), c && l.push({
985
- children: c
986
- }), c = null, i = !1;
987
- };
988
- for (;n = t(); ) if (4 === n) u(); else if (i = !0, 1 === n) s += e().data; else if (2 === n) {
989
- a();
990
- const t = o(e());
991
- t && c.push(t);
992
- } else 3 === n && u();
993
- return u(), l.length || l.push({
994
- children: []
995
- }), l;
996
- }, c);
997
- })(n, r, e.serializers) : null;
998
- });
999
- return () => {
1000
- o(), c();
1001
- };
1019
+ for (;n = t(); ) if (4 === n) f(); else if (s = !0, 1 === n) i += e().data; else if (2 === n) {
1020
+ a();
1021
+ const t = o(e());
1022
+ t && c.push(t);
1023
+ } else 3 === n && f();
1024
+ return f(), l.length || l.push({
1025
+ children: []
1026
+ }), l;
1027
+ }, c);
1028
+ })(r, n[1], e.serializers) : null;
1002
1029
  });
1003
1030
  }
1004
1031
 
1005
- function At(t, e) {
1032
+ function Pt(t, e) {
1006
1033
  const n = e && e.mime || "application/x-editate-editor";
1007
1034
  t.hook("copy", e => {
1008
- e.setData(n, JSON.stringify(w(t.doc, ...W(t.selection))));
1035
+ e.setData(n, JSON.stringify(T(t.doc, ...E(t.selection))));
1009
1036
  }), t.hook("paste", t => {
1010
1037
  try {
1011
1038
  return JSON.parse(t.getData(n));
@@ -1015,165 +1042,164 @@ function At(t, e) {
1015
1042
  });
1016
1043
  }
1017
1044
 
1018
- function Ot(t, e) {
1019
- const n = e.isLocked, r = e => n(h(t.doc, e)[0]), o = (e, r) => {
1020
- const [o, c] = e;
1021
- for (const [s, i] of v(t.doc, e)) {
1022
- const t = i + d(s);
1023
- if ((r ? c >= i && o <= t : c > i && o < t) && n(s)) return !0;
1024
- }
1045
+ function Nt(t, e) {
1046
+ const n = e.isLocked, r = e => {
1047
+ for (const [r] of _(t.doc, e)) if (n(r)) return !0;
1025
1048
  return !1;
1026
1049
  };
1027
- let c = !1;
1028
- t.hook("apply", (e, i) => {
1029
- const a = c;
1030
- switch (c = !1, e.type) {
1031
- case "delete":
1032
- if (o(W(e.range), !0)) return c = !0, s(() => {
1033
- c = !1;
1034
- }), i(null);
1035
- break;
1036
-
1037
- case "insert_text":
1038
- case "insert_node":
1039
- if (a || r(e.at)) return i(null);
1040
- break;
1041
-
1042
- case "format":
1043
- {
1044
- const t = W(e.range);
1045
- if (F(t) ? r(t[0]) : o(t, !1)) return i(null);
1046
- break;
1050
+ t.hook("apply", (e, o) => {
1051
+ o((e => {
1052
+ if ("format" !== e.type) return r("delete" === e.type ? E(e.range) : [ e.at, e.at ]);
1053
+ const o = t.doc, c = 0 === e.depth ? [ 0, u(o) ] : E(e.range), i = _(G(o, t.selection, e)[0], c);
1054
+ for (const [t] of _(o, c)) {
1055
+ const e = i.next().value?.[0];
1056
+ if (e && t !== e && n(t) && n(e)) return !0;
1047
1057
  }
1048
-
1049
- case "patch_node":
1050
- {
1051
- const r = e.path;
1052
- let o = t.doc;
1053
- for (let t = 0; t < r.length; t++) {
1054
- const e = o.children?.[r[t]];
1055
- if (!e) break;
1056
- if (o = e, t < r.length - 1 && l(o) && n(o)) return i(null);
1057
- }
1058
- if (o !== t.doc && l(o) && n(o) && n({
1059
- ...o,
1060
- [e.key]: e.value
1061
- })) return i(null);
1062
- break;
1063
- }
1064
- }
1065
- i(e);
1066
- }), t.set(Ot, {
1067
- locked: t => F(t) ? r(t[0]) : o(t, !0)
1058
+ return !1;
1059
+ })(e) ? null : e);
1060
+ }), t.set(Nt, {
1061
+ locked: r
1068
1062
  });
1069
1063
  }
1070
1064
 
1071
- function Rt(t, e = W(t.selection)) {
1072
- return t.get(Ot).locked(e);
1065
+ function Wt(t, e = E(t.selection)) {
1066
+ return t.get(Nt).locked(e);
1073
1067
  }
1074
1068
 
1075
- function Dt(t) {
1076
- t.hook("apply", t => {
1077
- console.log("apply", t);
1069
+ function Ht(t) {
1070
+ let e = /* @__PURE__ */ new WeakMap;
1071
+ t.hook("apply", (n, r) => {
1072
+ const o = t.doc, c = r(n);
1073
+ c && o !== t.doc && e.set(t.doc, (e.get(o) || []).concat(c));
1078
1074
  }), t.on("change", () => {
1079
- console.log("change", t.doc);
1075
+ console.log("apply", e.get(t.doc)), e = /* @__PURE__ */ new WeakMap, console.log("change", t.doc);
1080
1076
  }), t.on("selectionchange", () => {
1081
1077
  console.log("selectionchange", t.selection);
1082
1078
  });
1083
1079
  }
1084
1080
 
1085
- function Bt(t, e) {
1081
+ function Ct(t, e) {
1086
1082
  n(e).forEach(n => {
1087
1083
  const r = e[n];
1088
- t.hook("keyboard", ht(n, r));
1084
+ t.hook("keyboard", _t(n, r));
1089
1085
  });
1090
1086
  }
1091
1087
 
1092
- var It = (t, e) => {
1088
+ var Ft = (t, e) => {
1093
1089
  const n = parseFloat(t);
1094
1090
  return n ? t.endsWith("%") ? n / 100 * e : n : 0;
1095
- }, Lt = (t, e, n, r) => [ t + It(n, e), t + e - It(r, e) ], Pt = t => "auto" === t || "scroll" === t || "overlay" === t, Ht = (t, e, [n, r]) => t < n ? t - n : e > r ? e - r : 0, Nt = (t, e, n, r) => {
1096
- const o = r ? -n : 0;
1097
- return Math.max(o - e, Math.min(t, o + n - e));
1098
- }, Ct = (t, [e, n], r) => {
1091
+ }, Ut = (t, e, n, r) => [ t + Ft(n, e), t + e - Ft(r, e) ], qt = t => "auto" === t || "scroll" === t || "overlay" === t, zt = (t, e, [n, r]) => t < n ? t - n : e > r ? e - r : 0, Vt = (n, r, o, c) => {
1092
+ const i = c ? -o : 0;
1093
+ return e(i - r, t(n, i + o - r));
1094
+ }, Gt = (t, e, n) => {
1099
1095
  (n || e) && t.scrollBy({
1100
1096
  top: n,
1101
1097
  left: e,
1102
- behavior: r
1098
+ behavior: "auto"
1103
1099
  });
1104
- }, Wt = t => {
1105
- const e = "auto";
1106
- t.hook("mount", (n, r) => {
1107
- const o = ct(n), c = o.defaultView, {documentElement: s} = o, i = ((t, e, n) => {
1108
- const {body: r, documentElement: o} = e;
1109
- let c = t;
1110
- for (;c && c !== r && c !== o; ) {
1111
- const {overflowX: t, overflowY: e} = n.getComputedStyle(c);
1112
- if (Pt(t) || Pt(e)) return c;
1113
- c = c.parentElement;
1100
+ }, Jt = t => {
1101
+ t.hook("mount", (e, n) => {
1102
+ const r = dt(e), o = r.defaultView, {body: c, documentElement: i} = r;
1103
+ let s, l;
1104
+ for (let t = e; t && t !== c && t !== i; t = t.parentElement) {
1105
+ const e = o.getComputedStyle(t);
1106
+ if (qt(e.overflowX) || qt(e.overflowY)) {
1107
+ s = t, l = e;
1108
+ break;
1114
1109
  }
1115
- return null;
1116
- })(n, o, c), l = i && c.getComputedStyle(i), a = c.getComputedStyle(s);
1117
- let u = null;
1118
- const f = t.on("change", () => {
1119
- null == u && (u = setTimeout(() => {
1120
- u = null;
1121
- const o = lt(n, r, t.doc, t.selection);
1122
- let f = o.getBoundingClientRect();
1123
- if (!f.width && !f.height) {
1124
- const t = o.startContainer, e = $(t) ? t : t.parentElement;
1125
- e && (f = e.getBoundingClientRect());
1110
+ }
1111
+ const a = o.getComputedStyle(i);
1112
+ let f = null;
1113
+ const u = t.on("change", () => {
1114
+ null == f && (f = setTimeout(() => {
1115
+ f = null;
1116
+ const r = ht(e, n, t.doc, t.selection);
1117
+ let c = r.getBoundingClientRect();
1118
+ if (!c.width && !c.height) {
1119
+ const t = r.startContainer, e = it(t) ? t : t.parentElement;
1120
+ e && (c = e.getBoundingClientRect());
1126
1121
  }
1127
- const d = i && l ? ((t, e, n) => {
1128
- const {scrollLeft: r, scrollTop: o, scrollWidth: c, scrollHeight: s, clientLeft: i, clientTop: l, clientWidth: a, clientHeight: u} = t, f = t.getBoundingClientRect(), [d, p] = (t => {
1129
- const e = "rtl" === t.direction;
1130
- switch (t.writingMode) {
1131
- case "vertical-rl":
1132
- case "sideways-rl":
1133
- return [ !0, e ];
1134
-
1135
- case "vertical-lr":
1136
- return [ !1, e ];
1122
+ let u = 0, d = 0;
1123
+ if (s && l) {
1124
+ const {scrollLeft: t, scrollTop: e, scrollWidth: n, scrollHeight: r, clientLeft: o, clientTop: i, clientWidth: a, clientHeight: f} = s, p = s.getBoundingClientRect(), y = "rtl" === l.direction;
1125
+ let h = y, g = !1;
1126
+ switch (l.writingMode) {
1127
+ case "vertical-rl":
1128
+ case "sideways-rl":
1129
+ h = !0, g = y;
1130
+ break;
1137
1131
 
1138
- case "sideways-lr":
1139
- return [ !1, !e ];
1132
+ case "vertical-lr":
1133
+ h = !1, g = y;
1134
+ break;
1140
1135
 
1141
- default:
1142
- return [ e, !1 ];
1143
- }
1144
- })(e), h = Nt(Ht(n.top, n.bottom, Lt(f.top + l, u, e.scrollPaddingTop, e.scrollPaddingBottom)), o, s - u, p);
1145
- return [ Nt(Ht(n.left, n.right, Lt(f.left + i, a, e.scrollPaddingLeft, e.scrollPaddingRight)), r, c - a, d), h ];
1146
- })(i, l, f) : [ 0, 0 ], p = ((t, e, n, [r, o]) => {
1147
- const {clientWidth: c, clientHeight: s} = t, i = Ht(n.top - o, n.bottom - o, Lt(0, s, e.scrollPaddingTop, e.scrollPaddingBottom));
1148
- return [ Ht(n.left - r, n.right - r, Lt(0, c, e.scrollPaddingLeft, e.scrollPaddingRight)), i ];
1149
- })(s, a, f, d);
1150
- i && Ct(i, d, e), Ct(c, p, e);
1136
+ case "sideways-lr":
1137
+ h = !1, g = !y;
1138
+ }
1139
+ d = Vt(zt(c.top, c.bottom, Ut(p.top + i, f, l.scrollPaddingTop, l.scrollPaddingBottom)), e, r - f, g),
1140
+ u = Vt(zt(c.left, c.right, Ut(p.left + o, a, l.scrollPaddingLeft, l.scrollPaddingRight)), t, n - a, h);
1141
+ }
1142
+ const {clientWidth: p, clientHeight: y} = i, h = zt(c.top - d, c.bottom - d, Ut(0, y, a.scrollPaddingTop, a.scrollPaddingBottom)), g = zt(c.left - u, c.right - u, Ut(0, p, a.scrollPaddingLeft, a.scrollPaddingRight));
1143
+ s && Gt(s, u, d), Gt(o, g, h);
1151
1144
  }, 50));
1152
1145
  });
1153
1146
  return () => {
1154
- null != u && clearTimeout(u), f();
1147
+ null != f && clearTimeout(f), u();
1155
1148
  };
1156
1149
  });
1150
+ }, Xt = (t, e, n) => {
1151
+ let r = e;
1152
+ for (let o = e + 1; o < n; o++) u(t[o]) > u(t[r]) && (r = o);
1153
+ return r;
1157
1154
  };
1158
1155
 
1159
- function Ft(t, e) {
1156
+ function Yt(t) {
1157
+ let e = 0, n = t.doc;
1158
+ const r = /* @__PURE__ */ new WeakMap, o = (t, e) => {
1159
+ if (t === e) return;
1160
+ let n = 0, c = t.length, i = e.length;
1161
+ for (;n < c && n < i && t[n] === e[n]; ) n++;
1162
+ for (;n < c && n < i && t[c - 1] === e[i - 1]; ) c--, i--;
1163
+ const s = new Set(e.slice(n, i)), a = c - n, f = i - n;
1164
+ for (let u = n; u < c && u < i; u++) {
1165
+ const d = t[1 === f ? Xt(t, n, c) : u], p = e[1 === a ? Xt(e, n, i) : u];
1166
+ if (s.has(d) || r.has(p)) continue;
1167
+ const y = r.get(d);
1168
+ null != y && (r.delete(d), r.set(p, y)), l(d) && l(p) && o(d.children, p.children);
1169
+ }
1170
+ };
1171
+ t.set(Yt, {
1172
+ id: c => {
1173
+ const i = t.doc;
1174
+ if (i !== n) {
1175
+ const t = n;
1176
+ n = i, o(t.children, i.children);
1177
+ }
1178
+ let s = r.get(c);
1179
+ return null == s && r.set(c, s = ++e + ""), s;
1180
+ }
1181
+ });
1182
+ }
1183
+
1184
+ function Zt(t, e) {
1185
+ return t.get(Yt).id(e);
1186
+ }
1187
+
1188
+ function jt(t, e) {
1160
1189
  t.hook("mount", (n, r) => {
1161
1190
  let o = !0, c = !1;
1162
- const s = t.on("selectionchange", () => {
1191
+ const i = t.on("selectionchange", () => {
1163
1192
  c || (c = !0, requestAnimationFrame(() => {
1164
- c = !1, o && e(() => {
1165
- const e = t.selection;
1166
- return lt(n, r, t.doc, e).getBoundingClientRect();
1167
- });
1193
+ c = !1, o && e(() => ht(n, r, t.doc, t.selection).getBoundingClientRect());
1168
1194
  }));
1169
1195
  });
1170
1196
  return () => {
1171
- o = !1, s();
1197
+ o = !1, i();
1172
1198
  };
1173
1199
  });
1174
1200
  }
1175
1201
 
1176
- function Ut(t) {
1202
+ function Kt(t) {
1177
1203
  t.hook("mount", t => {
1178
1204
  t.ariaMultiLine = null;
1179
1205
  }), t.hook("apply", (t, e) => {
@@ -1184,24 +1210,24 @@ function Ut(t) {
1184
1210
  const e = t.fragment;
1185
1211
  t = {
1186
1212
  ...t,
1187
- fragment: a(e) ? [ B(...e) ] : e
1213
+ fragment: a(e) ? [ W(e) ] : e
1188
1214
  };
1189
1215
  }
1190
1216
  e(t);
1191
1217
  });
1192
1218
  }
1193
1219
 
1194
- var Vt = ({text: t, singleline: e, onChange: n, ...r}) => {
1195
- const o = Et({
1220
+ var Qt = ({text: t, singleline: e, onChange: n, ...r}) => {
1221
+ const o = Dt({
1196
1222
  ...r,
1197
1223
  doc: {
1198
- children: M(t)
1224
+ children: A(t)
1199
1225
  }
1200
- }).exec(Mt);
1201
- return e && o.exec(Ut), o.on("change", () => {
1202
- n(E(o.doc));
1226
+ }).exec(It);
1227
+ return e && o.exec(Kt), o.on("change", () => {
1228
+ n(w(o.doc));
1203
1229
  }), o;
1204
1230
  };
1205
1231
 
1206
- export { xt as ClearHistory, q as Delete, Y as Format, G as InsertNode, z as InsertText, V as LeavesInRange, Rt as LockedInRange, mt as Redo, _t as Redoable, X as ReplaceDoc, J as ReplaceText, j as SetBlockAttr, Q as SetVoidAttr, K as ToggleBlockAttr, Z as ToggleFormat, kt as Undo, gt as Undoable, Ot as blockLockPlugin, Et as createEditor, Vt as createPlainEditor, Dt as debugPlugin, wt as fileTransferPlugin, p as getChildAt, y as getLeafAt, h as getLeafBlockAt, k as getNodeOffset, d as getNodeSize, St as htmlTransferPlugin, At as internalTransferPlugin, v as iterLeafBlocks, T as iterLeaves, Bt as keymapPlugin, N as mapPosition, Mt as plainTransferPlugin, Wt as scrollToSelectionPlugin, Ft as selectionRectPlugin, Ut as singlelinePlugin, E as sliceText };
1232
+ export { Y as BlocksInRange, St as ClearHistory, Z as Delete, et as Format, K as InsertNode, j as InsertText, X as LeavesInRange, Wt as LockedInRange, Zt as NodeId, Tt as Redo, Mt as Redoable, $ as ReplaceDoc, Q as ReplaceText, rt as SetBlockAttr, ct as SetVoidAttr, ot as ToggleBlockAttr, nt as ToggleFormat, wt as Undo, Et as Undoable, Nt as blockLockPlugin, Dt as createEditor, Qt as createPlainEditor, Ht as debugPlugin, Bt as fileTransferPlugin, d as getChildAt, y as getLeafAt, p as getLeafBlockAt, h as getNodeOffset, u as getNodeSize, Lt as htmlTransferPlugin, Pt as internalTransferPlugin, _ as iterLeafBlocks, b as iterLeaves, Ct as keymapPlugin, q as mapPosition, Yt as nodeIdPlugin, It as plainTransferPlugin, Jt as scrollToSelectionPlugin, jt as selectionRectPlugin, Kt as singlelinePlugin, w as sliceText };
1207
1233
  //# sourceMappingURL=index.js.map