editate 0.6.13 → 0.6.14

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