@mx-space/cli 0.13.1 → 0.13.2

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.
Files changed (58) hide show
  1. package/README.md +59 -0
  2. package/ROADMAP.md +10 -7
  3. package/dist/{Lexical.dev-By5dOKBN.mjs → Lexical.dev-BsbWMhb3.mjs} +2265 -429
  4. package/dist/{Lexical.node-fXM8Jp7p.mjs → Lexical.node-DnR_u_Ke.mjs} +47 -10
  5. package/dist/Lexical.prod-B7L8eVsO.mjs +6816 -0
  6. package/dist/{LexicalClipboard.dev--HxGoSkO.mjs → LexicalClipboard.dev-BGSFbuTA.mjs} +131 -39
  7. package/dist/{LexicalClipboard.node-C3mRbrmW.mjs → LexicalClipboard.node-CUD_tpWb.mjs} +2 -2
  8. package/dist/LexicalClipboard.prod-DQXfRt3h.mjs +429 -0
  9. package/dist/{LexicalCodeCore.dev-DjSrd4A4.mjs → LexicalCodeCore.dev-B9lK_GSN.mjs} +81 -67
  10. package/dist/LexicalCodeCore.prod-CNWMPXhg.mjs +651 -0
  11. package/dist/LexicalDragon.dev-DRm2bGZ1.mjs +186 -0
  12. package/dist/{LexicalDragon.node-BVhw4C7s.mjs → LexicalDragon.node-d8gPruly.mjs} +3 -2
  13. package/dist/LexicalDragon.prod-ey3uKDJF.mjs +121 -0
  14. package/dist/{LexicalExtension.dev-BPNyvGqe.mjs → LexicalExtension.dev-CXtOJb83.mjs} +349 -35
  15. package/dist/{LexicalExtension.node-BVlcrgOx.mjs → LexicalExtension.node-CMsupJZs.mjs} +9 -4
  16. package/dist/{LexicalExtension.prod-DFKbiNt-.mjs → LexicalExtension.prod-BCLGhzcg.mjs} +477 -328
  17. package/dist/{LexicalHeadless.dev-B-cj7Pr5.mjs → LexicalHeadless.dev-yVDOBd64.mjs} +2 -2
  18. package/dist/{LexicalHeadless.prod-Byp1vNzT.mjs → LexicalHeadless.prod-B8qauuEA.mjs} +2 -2
  19. package/dist/{LexicalHtml.dev-prBAwszN.mjs → LexicalHtml.dev-3rdckXIU.mjs} +323 -265
  20. package/dist/{LexicalHtml.node-BvNF96jZ.mjs → LexicalHtml.node-DagZUjQ_.mjs} +6 -4
  21. package/dist/{LexicalHtml.prod-Sz3CW1ht.mjs → LexicalHtml.prod-B5AQaJDb.mjs} +354 -352
  22. package/dist/{LexicalLink.dev-NySTYhVR.mjs → LexicalLink.dev-CspSwLNB.mjs} +69 -58
  23. package/dist/{LexicalLink.prod-BuCM8gts.mjs → LexicalLink.prod-Da-ZW6H5.mjs} +210 -211
  24. package/dist/{LexicalList.dev-DIMOvSFD.mjs → LexicalList.dev-CNXmV6v8.mjs} +246 -198
  25. package/dist/LexicalList.prod-DgQzj4v9.mjs +944 -0
  26. package/dist/{LexicalMarkdown.dev-C7aylvCG.mjs → LexicalMarkdown.dev-0XURdo96.mjs} +129 -37
  27. package/dist/LexicalMarkdown.prod-qUsIQfJx.mjs +932 -0
  28. package/dist/{LexicalRichText.dev-DfICq6lU.mjs → LexicalRichText.dev-BqsEA7I9.mjs} +151 -122
  29. package/dist/{LexicalRichText.node-Bg9jND3Q.mjs → LexicalRichText.node-D73RR0Ck.mjs} +8 -11
  30. package/dist/LexicalRichText.prod-4Atyd7OR.mjs +538 -0
  31. package/dist/{LexicalSelection.dev-DGjj12wW.mjs → LexicalSelection.dev-DK5xfxKP.mjs} +10 -9
  32. package/dist/{LexicalSelection.node-BU5L4193.mjs → LexicalSelection.node-pyZyrANz.mjs} +4 -4
  33. package/dist/{LexicalSelection.prod-D-PwRbyK.mjs → LexicalSelection.prod-C5GrCbDC.mjs} +144 -146
  34. package/dist/{LexicalTable.dev-ChP7cugd.mjs → LexicalTable.dev-DiR_4rdI.mjs} +184 -119
  35. package/dist/LexicalTable.prod-Cbc5EasT.mjs +2336 -0
  36. package/dist/{LexicalUtils.dev-BiFU3789.mjs → LexicalUtils.dev-jhPjn1vQ.mjs} +375 -35
  37. package/dist/{LexicalUtils.node-j3Llm7Y3.mjs → LexicalUtils.node-Ck74ludK.mjs} +24 -12
  38. package/dist/LexicalUtils.prod-nuTBxnk_.mjs +504 -0
  39. package/dist/bin/mxs.mjs +1 -1
  40. package/dist/esm-BumPuCXw.mjs +2 -0
  41. package/dist/{esm-DFrz5rIo.mjs → esm-DupC6TTP.mjs} +214 -179
  42. package/dist/index.d.mts +46 -17
  43. package/dist/index.mjs +1 -1
  44. package/dist/{mxs-DXpzbUf4.mjs → mxs-BgAyMQdq.mjs} +8384 -6209
  45. package/package.json +17 -17
  46. package/skills/commands-ai.md +115 -0
  47. package/skills/overview.md +1 -0
  48. package/dist/Lexical.prod-BlCvXPGa.mjs +0 -6088
  49. package/dist/LexicalClipboard.prod-DNJzFMcT.mjs +0 -371
  50. package/dist/LexicalCodeCore.prod-DTDShkR3.mjs +0 -642
  51. package/dist/LexicalDragon.dev-DwprRH0z.mjs +0 -88
  52. package/dist/LexicalDragon.prod-nh4J-8vn.mjs +0 -59
  53. package/dist/LexicalList.prod-MVqfA6Vo.mjs +0 -925
  54. package/dist/LexicalMarkdown.prod-CfQSM406.mjs +0 -868
  55. package/dist/LexicalRichText.prod-GsFzCK-o.mjs +0 -550
  56. package/dist/LexicalTable.prod-Bpr9YRXp.mjs +0 -2311
  57. package/dist/LexicalUtils.prod-DCvrA78p.mjs +0 -373
  58. package/dist/esm-DXO9Afik.mjs +0 -2
@@ -1,373 +0,0 @@
1
- import { $ as $isElementNode, Ar as removeClassNamesFromElement, D as $getCaretRangeInDirection, Dr as makeStepwiseIterator, Dt as $splitAtPointCaretNext, E as $getCaretRange, Et as $setState, G as $getState, H as $getRoot, M as $getCollapsedCaretRange, Mt as CAN_USE_DOM, N as $getDOMSlot, Or as mergeRegister, Ot as $splitNode, P as $getDOMTextNode, S as $getAdjacentChildCaret, Sn as IS_SAFARI, Sr as isHTMLElement, T as $getCaretInDirection, Tt as $setSelectionFromCaretRange, U as $getSelection, V as $getPreviousSelection, W as $getSiblingCaret, X as $isChildCaret, a as $cloneWithProperties, b as $fullReconcile, bn as IS_IOS, dn as IS_ANDROID, f as $createParagraphNode, fn as IS_ANDROID_CHROME, ft as $isTextNode, gn as IS_CHROME, hr as isBlockDomNode, ht as $normalizeCaret, i as $caretRangeFromSelection, j as $getChildCaretOrSelf, jt as CAN_USE_BEFORE_INPUT, k as $getChildCaret, mn as IS_APPLE_WEBKIT, pn as IS_APPLE, pt as $isTextPointCaret, r as $caretFromPoint, st as $isRangeSelection, tr as addClassNamesToElement, ur as getDOMTextNode, ut as $isSiblingCaret, vn as IS_FIREFOX, vt as $removeTextFromCaretRange, w as $getAdjacentSiblingOrParentSiblingCaret, wr as isInlineDomNode, wt as $setSelection, xr as isHTMLAnchorElement, y as $findMatchingParent, yt as $rewindSiblingCaret } from "./Lexical.node-fXM8Jp7p.mjs";
2
- import { a as createRectsFromDOMRange } from "./LexicalSelection.node-BU5L4193.mjs";
3
- //#region ../../node_modules/.pnpm/@lexical+utils@0.45.0/node_modules/@lexical/utils/dist/LexicalUtils.prod.mjs
4
- /**
5
- * Copyright (c) Meta Platforms, Inc. and affiliates.
6
- *
7
- * This source code is licensed under the MIT license found in the
8
- * LICENSE file in the root directory of this source tree.
9
- *
10
- */
11
- function k(t, ...e) {
12
- const n = new URL("https://lexical.dev/docs/error"), o = new URLSearchParams();
13
- o.append("code", t);
14
- for (const t of e) o.append("v", t);
15
- throw n.search = o.toString(), Error(`Minified Lexical error #${t}; visit ${n.toString()} for the full message or use the non-minified dev environment for full errors and additional helpful warnings.`);
16
- }
17
- function U(t) {
18
- return `${t}px`;
19
- }
20
- const j = {
21
- attributes: !0,
22
- characterData: !0,
23
- childList: !0,
24
- subtree: !0
25
- };
26
- function z(e, n, o) {
27
- let r = null, i = null, l = null, s = [];
28
- const u = document.createElement("div");
29
- function c() {
30
- null === r && k(182), null === i && k(183);
31
- const { left: t, top: l } = i.getBoundingClientRect(), c = createRectsFromDOMRange(e, n);
32
- var f, a;
33
- u.isConnected || (a = u, (f = i).insertBefore(a, f.firstChild));
34
- let d = !1;
35
- for (let e = 0; e < c.length; e++) {
36
- const n = c[e], o = s[e] || document.createElement("div"), r = o.style;
37
- "absolute" !== r.position && (r.position = "absolute", d = !0);
38
- const i = U(n.left - t);
39
- r.left !== i && (r.left = i, d = !0);
40
- const f = U(n.top - l);
41
- r.top !== f && (o.style.top = f, d = !0);
42
- const a = U(n.width);
43
- r.width !== a && (o.style.width = a, d = !0);
44
- const g = U(n.height);
45
- r.height !== g && (o.style.height = g, d = !0), o.parentNode !== u && (u.append(o), d = !0), s[e] = o;
46
- }
47
- for (; s.length > c.length;) s.pop();
48
- d && o(s);
49
- }
50
- function f() {
51
- i = null, r = null, null !== l && l.disconnect(), l = null, u.remove();
52
- for (const t of s) t.remove();
53
- s = [];
54
- }
55
- u.style.position = "relative";
56
- const a = e.registerRootListener(function n() {
57
- const o = e.getRootElement();
58
- if (null === o) return f();
59
- const s = o.parentElement;
60
- if (!isHTMLElement(s)) return f();
61
- f(), r = o, i = s, l = new MutationObserver((t) => {
62
- const o = e.getRootElement(), l = o && o.parentElement;
63
- if (o !== r || l !== i) return n();
64
- for (const e of t) if (!u.contains(e.target)) return c();
65
- }), l.observe(s, j), c();
66
- });
67
- return () => {
68
- a(), f();
69
- };
70
- }
71
- function W(t, e, n, o) {
72
- if ("text" !== e.type && $isElementNode(n)) {
73
- const r = $getDOMSlot(n, o, t);
74
- return [r.element, r.getFirstChildOffset() + e.offset];
75
- }
76
- return [($isTextNode(n) ? $getDOMTextNode(n, o, t) : getDOMTextNode(o)) || o, e.offset];
77
- }
78
- function G(t) {
79
- for (const e of t) {
80
- const t = e.style;
81
- "Highlight" !== t.background && (t.background = "Highlight"), "HighlightText" !== t.color && (t.color = "HighlightText"), t.marginTop !== U(-1.5) && (t.marginTop = U(-1.5)), t.paddingTop !== U(4) && (t.paddingTop = U(4)), t.paddingBottom !== U(0) && (t.paddingBottom = U(0));
82
- }
83
- }
84
- function V(t, r = G) {
85
- let i = null, l = null, s = null, u = null, c = null, f = null, a = () => {};
86
- function d(e) {
87
- e.read(() => {
88
- const e = $getSelection();
89
- if (!$isRangeSelection(e)) return i = null, s = null, u = null, f = null, a(), void (a = () => {});
90
- const [d, g] = function(t) {
91
- const e = t.getStartEndPoints();
92
- return t.isBackward() ? [e[1], e[0]] : e;
93
- }(e), p = d.getNode(), m = p.getKey(), h = d.offset, y = g.getNode(), v = y.getKey(), E = g.offset, S = t.getElementByKey(m), x = t.getElementByKey(v), C = null === i || S !== l || h !== s || m !== i.getKey(), N = null === u || x !== c || E !== f || v !== u.getKey();
94
- if ((C || N) && null !== S && null !== x) {
95
- const e = function(t, e, n, o, r, i, l) {
96
- const s = (t._window ? t._window.document : document).createRange();
97
- return s.setStart(...W(t, e, n, o)), s.setEnd(...W(t, r, i, l)), s;
98
- }(t, d, p, S, g, y, x);
99
- a(), a = z(t, e, r);
100
- }
101
- i = p, l = S, s = h, u = y, c = x, f = E;
102
- }, { editor: t });
103
- }
104
- return d(t.getEditorState()), mergeRegister(t.registerUpdateListener(({ editorState: t }) => d(t)), () => {
105
- a();
106
- });
107
- }
108
- function X(t, e) {
109
- let n = null;
110
- const o = () => {
111
- const o = getSelection(), r = o && o.anchorNode, i = t.getRootElement();
112
- null !== r && null !== i && i.contains(r) ? null !== n && (n(), n = null) : null === n && (n = V(t, e));
113
- };
114
- return t.registerRootListener((t) => {
115
- if (t) {
116
- const e = t.ownerDocument;
117
- return e.addEventListener("selectionchange", o), o(), () => {
118
- null !== n && n(), e.removeEventListener("selectionchange", o);
119
- };
120
- }
121
- });
122
- }
123
- function q(t, e) {
124
- for (const n of e) if (t.type.startsWith(n)) return !0;
125
- return !1;
126
- }
127
- function J(t, e) {
128
- const n = t[Symbol.iterator]();
129
- return new Promise((t, o) => {
130
- const r = [], i = () => {
131
- const { done: l, value: s } = n.next();
132
- if (l) return t(r);
133
- const u = new FileReader();
134
- u.addEventListener("error", o), u.addEventListener("load", () => {
135
- const t = u.result;
136
- "string" == typeof t && r.push({
137
- file: s,
138
- result: t
139
- }), i();
140
- }), q(s, e) ? u.readAsDataURL(s) : i();
141
- };
142
- i();
143
- });
144
- }
145
- function Q(t, e) {
146
- return Array.from(tt(t, e));
147
- }
148
- function Y(t) {
149
- return t ? t.getAdjacentCaret() : null;
150
- }
151
- function Z(t, e) {
152
- return Array.from(lt(t, e));
153
- }
154
- function tt(t, e) {
155
- return nt("next", t, e);
156
- }
157
- function et(t, e) {
158
- const n = $getAdjacentSiblingOrParentSiblingCaret($getSiblingCaret(t, e));
159
- return n && n[0];
160
- }
161
- function nt(t, e, n) {
162
- const o = $getRoot(), i = e || o, l = $isElementNode(i) ? $getChildCaret(i, t) : $getSiblingCaret(i, t), s = rt(i), u = n ? $getAdjacentChildCaret($getChildCaretOrSelf($getSiblingCaret(n, t))) || et(n, t) : et(i, t);
163
- let f = s;
164
- return makeStepwiseIterator({
165
- hasNext: (t) => null !== t,
166
- initial: l,
167
- map: (t) => ({
168
- depth: f,
169
- node: t.origin
170
- }),
171
- step: (t) => {
172
- if (t.isSameNodeCaret(u)) return null;
173
- $isChildCaret(t) && f++;
174
- const e = $getAdjacentSiblingOrParentSiblingCaret(t);
175
- return !e || e[0].isSameNodeCaret(u) ? null : (f += e[1], e[0]);
176
- }
177
- });
178
- }
179
- function ot(t) {
180
- const e = $getAdjacentSiblingOrParentSiblingCaret($getSiblingCaret(t, "next"));
181
- return e && [e[0].origin, e[1]];
182
- }
183
- function rt(t) {
184
- let e = -1;
185
- for (let n = t; null !== n; n = n.getParent()) e++;
186
- return e;
187
- }
188
- function it(t) {
189
- const n = $getAdjacentSiblingOrParentSiblingCaret($getChildCaretOrSelf($getSiblingCaret(t, "previous")), "root");
190
- return n && n[0].origin;
191
- }
192
- function lt(t, e) {
193
- return nt("previous", t, e);
194
- }
195
- function st(t, e) {
196
- let n = t;
197
- for (; null != n;) {
198
- if (n instanceof e) return n;
199
- n = n.getParent();
200
- }
201
- return null;
202
- }
203
- function ut(t) {
204
- const e = $findMatchingParent(t, (t) => $isElementNode(t) && !t.isInline());
205
- return $isElementNode(e) || k(4, t.__key), e;
206
- }
207
- function ct(t, e, n, o) {
208
- const r = (t) => t instanceof e;
209
- return t.registerNodeTransform(e, (t) => {
210
- const e = ((t) => {
211
- const e = t.getChildren();
212
- for (let t = 0; t < e.length; t++) {
213
- const n = e[t];
214
- if (r(n)) return null;
215
- }
216
- let n = t, o = t;
217
- for (; null !== n;) if (o = n, n = n.getParent(), r(n)) return {
218
- child: o,
219
- parent: n
220
- };
221
- return null;
222
- })(t);
223
- if (null !== e) {
224
- const { child: r, parent: i } = e;
225
- if (r.is(t)) {
226
- o(i, t);
227
- const e = r.getNextSiblings(), l = e.length;
228
- if (i.insertAfter(r), 0 !== l) {
229
- const t = n(i);
230
- r.insertAfter(t);
231
- for (let n = 0; n < l; n++) t.append(e[n]);
232
- }
233
- i.canBeEmpty() || 0 !== i.getChildrenSize() || i.remove();
234
- }
235
- }
236
- });
237
- }
238
- function ft(t, e) {
239
- const n = /* @__PURE__ */ new Map(), o = t._pendingEditorState;
240
- for (const [t, o] of e._nodeMap) n.set(t, $cloneWithProperties(o));
241
- o && (o._nodeMap = n), $fullReconcile();
242
- const r = e._selection;
243
- $setSelection(null === r ? null : r.clone());
244
- }
245
- function at(t) {
246
- const e = $getSelection() || $getPreviousSelection();
247
- let r;
248
- if ($isRangeSelection(e)) r = $caretFromPoint(e.focus, "next");
249
- else {
250
- if (null != e) {
251
- const t = e.getNodes(), n = t[t.length - 1];
252
- n && (r = $getSiblingCaret(n, "next"));
253
- }
254
- r = r || $getChildCaret($getRoot(), "previous").getFlipped().insert($createParagraphNode());
255
- }
256
- const i = dt(t, r), l = $getAdjacentChildCaret(i);
257
- return $setSelectionFromCaretRange($getCollapsedCaretRange($isChildCaret(l) ? $normalizeCaret(l) : i)), t.getLatest();
258
- }
259
- function dt(t, e, n) {
260
- let o = $getCaretInDirection(e, "next");
261
- $isTextPointCaret(o) && (0 === o.offset ? o = $getSiblingCaret(o.origin, "previous").getFlipped() : o.offset === o.origin.getTextContentSize() && (o = $getSiblingCaret(o.origin, "next"))), o.origin.is(t) && ($isSiblingCaret(o) || k(342, t.getKey(), t.getType()), o = $rewindSiblingCaret(o)), (t.is(o.getNodeAtCaret()) || t.is(o.getFlipped().getNodeAtCaret())) && t.remove(!0);
262
- for (let t = o; t; t = $splitAtPointCaretNext(t, n)) o = t;
263
- return $isTextPointCaret(o) && k(283), o.insert(t.isInline() ? $createParagraphNode().append(t) : t), $getCaretInDirection($getSiblingCaret(t.getLatest(), "next"), e.direction);
264
- }
265
- function gt(t) {
266
- const e = $getSelection();
267
- if (!$isRangeSelection(e)) return void (e && e.insertNodes([t]));
268
- let i = $getCaretRangeInDirection($removeTextFromCaretRange($caretRangeFromSelection(e)), "next").anchor;
269
- if ($isTextPointCaret(i)) {
270
- const t = $splitAtPointCaretNext(i);
271
- if (!t) return;
272
- i = t;
273
- }
274
- const l = i.getFlipped();
275
- l.insert(t), $setSelectionFromCaretRange($getCaretRange(l, l));
276
- }
277
- function pt(t, e) {
278
- const n = e();
279
- return t.replace(n), n.append(t), n;
280
- }
281
- function mt(t, e) {
282
- return null !== t && Object.getPrototypeOf(t).constructor.name === e.name;
283
- }
284
- function ht(t, e) {
285
- const n = [];
286
- for (let o = 0; o < t.length; o++) {
287
- const r = e(t[o]);
288
- null !== r && n.push(r);
289
- }
290
- return n;
291
- }
292
- function yt(t) {
293
- const e = $getSelection();
294
- if (!$isRangeSelection(e)) return !1;
295
- const i = /* @__PURE__ */ new Set(), l = e.getNodes();
296
- for (let e = 0; e < l.length; e++) {
297
- const n = l[e], o = n.getKey();
298
- if (i.has(o)) continue;
299
- const s = $findMatchingParent(n, (t) => $isElementNode(t) && !t.isInline());
300
- if (null === s) continue;
301
- const u = s.getKey();
302
- s.canIndent() && !i.has(u) && (i.add(u), t(s));
303
- }
304
- return i.size > 0;
305
- }
306
- function vt(t, e) {
307
- $getChildCaret(t, "next").insert(e);
308
- }
309
- let Et = !(IS_FIREFOX || !CAN_USE_DOM) && void 0;
310
- function St(t, e = !1) {
311
- let n = 1;
312
- if (function() {
313
- if (void 0 === Et) {
314
- const t = document.createElement("div");
315
- t.style.position = "absolute", t.style.opacity = "0", t.style.width = "100px", t.style.left = "-1000px", document.body.appendChild(t);
316
- const e = t.getBoundingClientRect();
317
- t.style.setProperty("zoom", "2"), Et = t.getBoundingClientRect().width === e.width, document.body.removeChild(t);
318
- }
319
- return Et;
320
- }() || e) for (; t;) n *= Number(window.getComputedStyle(t).getPropertyValue("zoom")), t = t.parentElement;
321
- return n;
322
- }
323
- function xt(t) {
324
- return null !== t._parentEditor;
325
- }
326
- function Ct(t, e) {
327
- return Nt(t, e, null);
328
- }
329
- function Nt(t, e, n) {
330
- let o = !1;
331
- for (const i of At(t)) e(i) ? null !== n && n(i) : (o = !0, $isElementNode(i) && Nt(i, e, n || ((t) => i.insertAfter(t))), i.remove());
332
- return o;
333
- }
334
- function _t(t, e) {
335
- const n = [], o = Array.from(t).reverse();
336
- for (let t = o.pop(); void 0 !== t; t = o.pop()) if (e(t)) n.push(t);
337
- else if ($isElementNode(t)) for (const e of At(t)) o.push(e);
338
- return n;
339
- }
340
- function wt(t) {
341
- return Rt($getChildCaret(t, "next"));
342
- }
343
- function At(t) {
344
- return Rt($getChildCaret(t, "previous"));
345
- }
346
- function Rt(t) {
347
- return makeStepwiseIterator({
348
- hasNext: $isSiblingCaret,
349
- initial: t.getAdjacentCaret(),
350
- map: (t) => t.origin.getLatest(),
351
- step: (t) => t.getAdjacentCaret()
352
- });
353
- }
354
- function It(t) {
355
- $rewindSiblingCaret($getSiblingCaret(t, "next")).splice(1, t.getChildren());
356
- }
357
- function Lt(t) {
358
- const e = (e) => $getState(e, t), n = (e, n) => $setState(e, t, n);
359
- return {
360
- $get: e,
361
- $set: n,
362
- accessors: [e, n],
363
- makeGetterMethod: () => function() {
364
- return e(this);
365
- },
366
- makeSetterMethod: () => function(t) {
367
- return n(this, t);
368
- },
369
- stateConfig: t
370
- };
371
- }
372
- //#endregion
373
- export { _t as $descendantsMatching, Q as $dfs, tt as $dfsIterator, ht as $filter, $findMatchingParent, wt as $firstToLastIterator, Y as $getAdjacentCaret, $getAdjacentSiblingOrParentSiblingCaret, rt as $getDepth, ut as $getNearestBlockElementAncestorOrThrow, st as $getNearestNodeOfType, it as $getNextRightPreorderNode, ot as $getNextSiblingOrParentSibling, yt as $handleIndentAndOutdent, vt as $insertFirst, gt as $insertNodeIntoLeaf, at as $insertNodeToNearestRoot, dt as $insertNodeToNearestRootAtCaret, xt as $isEditorIsNestedEditor, At as $lastToFirstIterator, ft as $restoreEditorState, Z as $reverseDfs, lt as $reverseDfsIterator, $splitNode, Ct as $unwrapAndFilterDescendants, It as $unwrapNode, pt as $wrapNodeInElement, CAN_USE_BEFORE_INPUT, CAN_USE_DOM, IS_ANDROID, IS_ANDROID_CHROME, IS_APPLE, IS_APPLE_WEBKIT, IS_CHROME, IS_FIREFOX, IS_IOS, IS_SAFARI, addClassNamesToElement, St as calculateZoomLevel, isBlockDomNode, isHTMLAnchorElement, isHTMLElement, isInlineDomNode, q as isMimeType, Lt as makeStateWrapper, V as markSelection, J as mediaFileReader, mergeRegister, mt as objectKlassEquals, z as positionNodeOnRange, ct as registerNestedElementResolver, removeClassNamesFromElement, X as selectionAlwaysOnDisplay };
@@ -1,2 +0,0 @@
1
- import { E as Schema_exports } from "./esm-DFrz5rIo.mjs";
2
- export { Schema_exports as Schema };