@mx-space/cli 0.7.8 → 0.8.0
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/dist/{Lexical.dev-rcxzwpir.mjs → Lexical.dev-By5dOKBN.mjs} +1486 -356
- package/dist/{Lexical.node-BUsI9gWr.mjs → Lexical.node-fXM8Jp7p.mjs} +39 -17
- package/dist/{Lexical.prod-C8HtkSD6.mjs → Lexical.prod-BlCvXPGa.mjs} +2279 -1768
- package/dist/LexicalClipboard.dev--HxGoSkO.mjs +915 -0
- package/dist/{LexicalClipboard.node-CO-MCKx5.mjs → LexicalClipboard.node-C3mRbrmW.mjs} +10 -3
- package/dist/LexicalClipboard.prod-DNJzFMcT.mjs +371 -0
- package/dist/LexicalCodeCore.dev-DjSrd4A4.mjs +1109 -0
- package/dist/LexicalCodeCore.prod-DTDShkR3.mjs +642 -0
- package/dist/{LexicalDragon.dev-gBP8WSRS.mjs → LexicalDragon.dev-DwprRH0z.mjs} +3 -3
- package/dist/{LexicalDragon.node-OG6G55nl.mjs → LexicalDragon.node-BVhw4C7s.mjs} +2 -2
- package/dist/{LexicalDragon.prod-DP-_Q8cv.mjs → LexicalDragon.prod-nh4J-8vn.mjs} +3 -3
- package/dist/{LexicalExtension.dev-DVbjljrm.mjs → LexicalExtension.dev-BPNyvGqe.mjs} +335 -6
- package/dist/{LexicalExtension.node-CF3EAPN7.mjs → LexicalExtension.node-BVlcrgOx.mjs} +15 -8
- package/dist/{LexicalExtension.prod-DklHHErZ.mjs → LexicalExtension.prod-DFKbiNt-.mjs} +375 -265
- package/dist/{LexicalHeadless.dev-DdWLM7Nl.mjs → LexicalHeadless.dev-B-cj7Pr5.mjs} +2 -2
- package/dist/{LexicalHeadless.prod-CoiiTDzR.mjs → LexicalHeadless.prod-Byp1vNzT.mjs} +2 -2
- package/dist/LexicalHtml.dev-prBAwszN.mjs +2424 -0
- package/dist/LexicalHtml.node-BvNF96jZ.mjs +56 -0
- package/dist/LexicalHtml.prod-Sz3CW1ht.mjs +1207 -0
- package/dist/{LexicalLink.dev-BS1Bf-yD.mjs → LexicalLink.dev-NySTYhVR.mjs} +42 -8
- package/dist/{LexicalLink.prod-B_crkoHP.mjs → LexicalLink.prod-BuCM8gts.mjs} +209 -191
- package/dist/{LexicalList.dev-OMqmcnQ-.mjs → LexicalList.dev-DIMOvSFD.mjs} +252 -80
- package/dist/{LexicalList.prod-CpL1s8vS.mjs → LexicalList.prod-MVqfA6Vo.mjs} +364 -278
- package/dist/{LexicalMarkdown.dev-BHSdx_Gr.mjs → LexicalMarkdown.dev-C7aylvCG.mjs} +729 -552
- package/dist/LexicalMarkdown.prod-CfQSM406.mjs +868 -0
- package/dist/{LexicalRichText.dev-Bz9A_WbM.mjs → LexicalRichText.dev-DfICq6lU.mjs} +272 -77
- package/dist/{LexicalRichText.node-DDpwfE-P.mjs → LexicalRichText.node-Bg9jND3Q.mjs} +21 -8
- package/dist/LexicalRichText.prod-GsFzCK-o.mjs +550 -0
- package/dist/{LexicalSelection.dev-CQ380fnD.mjs → LexicalSelection.dev-DGjj12wW.mjs} +50 -38
- package/dist/{LexicalSelection.node-DesBMjIE.mjs → LexicalSelection.node-BU5L4193.mjs} +4 -4
- package/dist/{LexicalSelection.prod-D2jivCDB.mjs → LexicalSelection.prod-D-PwRbyK.mjs} +158 -140
- package/dist/{LexicalTable.dev-Ca7mQ7Jk.mjs → LexicalTable.dev-ChP7cugd.mjs} +215 -53
- package/dist/{LexicalTable.prod-DyPAcC7y.mjs → LexicalTable.prod-Bpr9YRXp.mjs} +668 -573
- package/dist/{LexicalUtils.dev-HxM8F0g6.mjs → LexicalUtils.dev-BiFU3789.mjs} +10 -47
- package/dist/{LexicalUtils.node-lCWjRjoG.mjs → LexicalUtils.node-j3Llm7Y3.mjs} +2 -2
- package/dist/{LexicalUtils.prod-Bti5w4ki.mjs → LexicalUtils.prod-DCvrA78p.mjs} +103 -105
- package/dist/bin/mxs.d.mts +1 -1
- package/dist/bin/mxs.mjs +1 -1
- package/dist/esm-By7trG9K.mjs +2 -0
- package/dist/{esm-CK9m5JKX.mjs → esm-Dg-WhPCe.mjs} +989 -989
- package/dist/index.d.mts +1 -1
- package/dist/index.mjs +1 -1
- package/dist/{mxs-BZt1cLW9.mjs → mxs-DT0oYk6U.mjs} +11935 -11866
- package/package.json +15 -14
- package/dist/LexicalClipboard.dev-BpqRwTLP.mjs +0 -494
- package/dist/LexicalClipboard.prod-B_xdeiAC.mjs +0 -291
- package/dist/LexicalCodeCore.dev-7_cexm39.mjs +0 -537
- package/dist/LexicalCodeCore.prod-Bd6WFHcO.mjs +0 -381
- package/dist/LexicalHtml.dev-C3ZSWBFZ.mjs +0 -684
- package/dist/LexicalHtml.node-D0TD152E.mjs +0 -24
- package/dist/LexicalHtml.prod-CX47X0zl.mjs +0 -430
- package/dist/LexicalMarkdown.prod-C-S7Ii6-.mjs +0 -754
- package/dist/LexicalRichText.prod-C8qXACDL.mjs +0 -427
- package/dist/esm-DRbkkY3r.mjs +0 -2
- /package/dist/{mxs-CM8-6uAr.d.mts → mxs-iqJBopvE.d.mts} +0 -0
|
@@ -1,430 +0,0 @@
|
|
|
1
|
-
import { a as getKnownTypesAndNodes, i as getExtensionDependencyFromEditor, n as LexicalBuilder } from "./LexicalExtension.node-CF3EAPN7.mjs";
|
|
2
|
-
import { $ as $isLexicalNode, An as createState, Ct as ArtificialNode__DO_NOT_USE, G as $isBlockElementNode, Gn as isHTMLElement, In as getStaticNodeConfig, Kn as isInlineDomNode, M as $getEditorDOMRenderConfig, Mn as defineExtension, Pt as DEFAULT_EDITOR_DOM_CONFIG, R as $getRoot, Un as isDocumentFragment, Vn as isDOMDocumentNode, Y as $isElementNode, at as $isRootOrShadowRoot, ct as $isTextNode, f as $createParagraphNode, gn as RootNode, j as $getEditor, rr as shallowMergeConfig, u as $createLineBreakNode, zn as isBlockDomNode } from "./Lexical.node-BUsI9gWr.mjs";
|
|
3
|
-
import { a as $sliceSelectedTextNodeContent } from "./LexicalSelection.node-DesBMjIE.mjs";
|
|
4
|
-
//#region ../../node_modules/.pnpm/@lexical+html@0.44.0/node_modules/@lexical/html/LexicalHtml.prod.mjs
|
|
5
|
-
/**
|
|
6
|
-
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
7
|
-
*
|
|
8
|
-
* This source code is licensed under the MIT license found in the
|
|
9
|
-
* LICENSE file in the root directory of this source tree.
|
|
10
|
-
*
|
|
11
|
-
*/
|
|
12
|
-
function D(t, ...n) {
|
|
13
|
-
const e = new URL("https://lexical.dev/docs/error"), o = new URLSearchParams();
|
|
14
|
-
o.append("code", t);
|
|
15
|
-
for (const t of n) o.append("v", t);
|
|
16
|
-
throw e.search = o.toString(), Error(`Minified Lexical error #${t}; visit ${e.toString()} for the full message or use the non-minified dev environment for full errors and additional helpful warnings.`);
|
|
17
|
-
}
|
|
18
|
-
let C;
|
|
19
|
-
function A(t, n) {
|
|
20
|
-
const { key: e } = n;
|
|
21
|
-
return t && e in t ? t[e] : n.defaultValue;
|
|
22
|
-
}
|
|
23
|
-
function E(t) {
|
|
24
|
-
return C && C.editor === t ? C : void 0;
|
|
25
|
-
}
|
|
26
|
-
function N(t, n) {
|
|
27
|
-
if ("cfg" in n) {
|
|
28
|
-
const { cfg: e, updater: o } = n;
|
|
29
|
-
return [e, o(A(t, e))];
|
|
30
|
-
}
|
|
31
|
-
return n;
|
|
32
|
-
}
|
|
33
|
-
function P(t, n) {
|
|
34
|
-
let e = n;
|
|
35
|
-
for (const o of t) {
|
|
36
|
-
const [t, r] = N(e, o), c = t.key;
|
|
37
|
-
if (e === n && A(e, t) === r) continue;
|
|
38
|
-
const s = e || T(n);
|
|
39
|
-
s[c] = r, e = s;
|
|
40
|
-
}
|
|
41
|
-
return e;
|
|
42
|
-
}
|
|
43
|
-
function T(t) {
|
|
44
|
-
return Object.create(t || null);
|
|
45
|
-
}
|
|
46
|
-
function j(t, n) {
|
|
47
|
-
return [t, n];
|
|
48
|
-
}
|
|
49
|
-
function k(t, n) {
|
|
50
|
-
return {
|
|
51
|
-
cfg: t,
|
|
52
|
-
updater: n
|
|
53
|
-
};
|
|
54
|
-
}
|
|
55
|
-
const L = "@lexical/html/DOM", F = Symbol.for("@lexical/html/DOMExportContext"), I = () => !0;
|
|
56
|
-
function R(t) {
|
|
57
|
-
return (n) => n instanceof t;
|
|
58
|
-
}
|
|
59
|
-
function W(t, { nodes: n }) {
|
|
60
|
-
if ("*" === n) return I;
|
|
61
|
-
let e = {};
|
|
62
|
-
const o = [];
|
|
63
|
-
for (const r of n) if ("getType" in r) {
|
|
64
|
-
const n = r.getType();
|
|
65
|
-
if (e) {
|
|
66
|
-
const o = t[n];
|
|
67
|
-
void 0 === o && D(339, r.name, n), e = Object.assign(e, o.types);
|
|
68
|
-
}
|
|
69
|
-
o.push(R(r));
|
|
70
|
-
} else e = void 0, o.push(r);
|
|
71
|
-
return e || (1 === o.length ? o[0] : (t) => {
|
|
72
|
-
for (const n of o) if (n(t)) return !0;
|
|
73
|
-
return !1;
|
|
74
|
-
});
|
|
75
|
-
}
|
|
76
|
-
function q(t) {
|
|
77
|
-
return (n, e, o) => t(n, o);
|
|
78
|
-
}
|
|
79
|
-
function B(t) {
|
|
80
|
-
return (n, e, o, r) => t(n, e, r);
|
|
81
|
-
}
|
|
82
|
-
function U(t) {
|
|
83
|
-
return (n, e, o, r, c) => t(n, e, o, c);
|
|
84
|
-
}
|
|
85
|
-
function V(t) {
|
|
86
|
-
return (n, e, o, r, c, s) => t(n, e, o, r, s);
|
|
87
|
-
}
|
|
88
|
-
function H(t, n) {
|
|
89
|
-
return (e, o) => {
|
|
90
|
-
const r = () => t(e, o), c = n(e);
|
|
91
|
-
return c ? c(e, r, o) : r();
|
|
92
|
-
};
|
|
93
|
-
}
|
|
94
|
-
function Y(t, n) {
|
|
95
|
-
return (e, o, r) => {
|
|
96
|
-
const c = () => t(e, o, r), s = n(e);
|
|
97
|
-
return s ? s(e, o, c, r) : c();
|
|
98
|
-
};
|
|
99
|
-
}
|
|
100
|
-
function _(t, n) {
|
|
101
|
-
return (e, o, r, c) => {
|
|
102
|
-
const s = () => t(e, o, r, c), u = n(e);
|
|
103
|
-
return u ? u(e, o, r, s, c) : s();
|
|
104
|
-
};
|
|
105
|
-
}
|
|
106
|
-
function z(t, n) {
|
|
107
|
-
return (e, o, r, c, s) => {
|
|
108
|
-
const u = () => t(e, o, r, c, s), i = n(e);
|
|
109
|
-
return i ? i(e, o, r, c, u, s) : u();
|
|
110
|
-
};
|
|
111
|
-
}
|
|
112
|
-
function G(t, n) {
|
|
113
|
-
return (e, o, r, c) => {
|
|
114
|
-
t(e, o, r, c);
|
|
115
|
-
const s = n(e);
|
|
116
|
-
s && s(e, o, r, c);
|
|
117
|
-
};
|
|
118
|
-
}
|
|
119
|
-
function J(t, n, e, o, r) {
|
|
120
|
-
let c = e[n];
|
|
121
|
-
for (const e of t[n]) if ("function" == typeof e[0]) {
|
|
122
|
-
const [t, n] = e;
|
|
123
|
-
c = o(c, (e) => t(e) && n || void 0);
|
|
124
|
-
} else {
|
|
125
|
-
const t = e[1], n = {};
|
|
126
|
-
for (const e in t) {
|
|
127
|
-
const r = t[e];
|
|
128
|
-
r && (n[e] = r.reduce((t, n) => o(t, () => n), c));
|
|
129
|
-
}
|
|
130
|
-
c = o(c, (t) => {
|
|
131
|
-
const e = n[t.getType()];
|
|
132
|
-
return e && r(e);
|
|
133
|
-
});
|
|
134
|
-
}
|
|
135
|
-
e[n] = c;
|
|
136
|
-
}
|
|
137
|
-
function K(t, n, e, o) {
|
|
138
|
-
if (!o) return;
|
|
139
|
-
const r = t[n];
|
|
140
|
-
if ("function" == typeof e) r.push([e, o]);
|
|
141
|
-
else {
|
|
142
|
-
const t = r[r.length - 1];
|
|
143
|
-
let n;
|
|
144
|
-
t && "types" === t[0] ? n = t[1] : (n = {}, r.push(["types", n]));
|
|
145
|
-
for (const t in e) {
|
|
146
|
-
const e = n[t] || [];
|
|
147
|
-
n[t] = e, e.push(o);
|
|
148
|
-
}
|
|
149
|
-
}
|
|
150
|
-
}
|
|
151
|
-
function Q(t) {
|
|
152
|
-
return "*" === t.nodes;
|
|
153
|
-
}
|
|
154
|
-
function X(t, n) {
|
|
155
|
-
const e = function(t) {
|
|
156
|
-
const n = {}, { nodes: e } = getKnownTypesAndNodes(t);
|
|
157
|
-
for (const t of e) n[t.getType()] = {
|
|
158
|
-
klass: t,
|
|
159
|
-
types: {}
|
|
160
|
-
};
|
|
161
|
-
for (const t of Object.values(n)) if (t) {
|
|
162
|
-
const e = t.klass.getType();
|
|
163
|
-
for (let { klass: o } = t; $isLexicalNode(o.prototype); o = Object.getPrototypeOf(o)) {
|
|
164
|
-
const { ownNodeType: t } = getStaticNodeConfig(o), r = t && n[t];
|
|
165
|
-
r && (r.types[e] = !0);
|
|
166
|
-
}
|
|
167
|
-
}
|
|
168
|
-
return n;
|
|
169
|
-
}(t), o = {
|
|
170
|
-
$createDOM: [],
|
|
171
|
-
$decorateDOM: [],
|
|
172
|
-
$exportDOM: [],
|
|
173
|
-
$extractWithChild: [],
|
|
174
|
-
$getDOMSlot: [],
|
|
175
|
-
$shouldExclude: [],
|
|
176
|
-
$shouldInclude: [],
|
|
177
|
-
$updateDOM: []
|
|
178
|
-
};
|
|
179
|
-
for (const t of function(t) {
|
|
180
|
-
const n = [], e = [], o = [];
|
|
181
|
-
for (const c of t) if (Q(c)) n.push(c);
|
|
182
|
-
else if (Array.isArray(c.nodes)) for (const t of c.nodes) $isLexicalNode(t.prototype) ? o.push(1 === c.nodes.length ? c : {
|
|
183
|
-
...c,
|
|
184
|
-
nodes: [t]
|
|
185
|
-
}) : e.push(1 === c.nodes.length ? c : {
|
|
186
|
-
...c,
|
|
187
|
-
nodes: [t]
|
|
188
|
-
});
|
|
189
|
-
const c = /* @__PURE__ */ new Map(), s = (t) => {
|
|
190
|
-
let n = c.get(t);
|
|
191
|
-
if (void 0 === n) {
|
|
192
|
-
n = 0;
|
|
193
|
-
for (let e = t; $isLexicalNode(e.prototype); e = Object.getPrototypeOf(e)) n++;
|
|
194
|
-
c.set(t, n);
|
|
195
|
-
}
|
|
196
|
-
return n;
|
|
197
|
-
};
|
|
198
|
-
return o.sort((t, n) => s(t.nodes[0]) - s(n.nodes[0])), [
|
|
199
|
-
...o,
|
|
200
|
-
...e,
|
|
201
|
-
...n
|
|
202
|
-
];
|
|
203
|
-
}(n)) {
|
|
204
|
-
const n = W(e, t);
|
|
205
|
-
for (const e in o) K(o, e, n, t[e]);
|
|
206
|
-
}
|
|
207
|
-
return o;
|
|
208
|
-
}
|
|
209
|
-
function Z(t) {
|
|
210
|
-
return t;
|
|
211
|
-
}
|
|
212
|
-
const tt = defineExtension({
|
|
213
|
-
build: (t, n, e) => ({ defaults: P(n.contextDefaults, void 0) }),
|
|
214
|
-
config: {
|
|
215
|
-
contextDefaults: [],
|
|
216
|
-
overrides: []
|
|
217
|
-
},
|
|
218
|
-
html: { export: new Map([[RootNode, () => {
|
|
219
|
-
const t = document.createElement("div");
|
|
220
|
-
return t.role = "textbox", { element: t };
|
|
221
|
-
}]]) },
|
|
222
|
-
init(t, n) {
|
|
223
|
-
t.dom = function(t, { overrides: n }) {
|
|
224
|
-
const e = X(t, n), r = {
|
|
225
|
-
...DEFAULT_EDITOR_DOM_CONFIG,
|
|
226
|
-
...t.dom
|
|
227
|
-
};
|
|
228
|
-
return J(e, "$createDOM", r, H, q), J(e, "$exportDOM", r, H, q), J(e, "$extractWithChild", r, z, V), J(e, "$getDOMSlot", r, Y, B), J(e, "$shouldExclude", r, Y, B), J(e, "$shouldInclude", r, Y, B), J(e, "$updateDOM", r, _, U), J(e, "$decorateDOM", r, G, Z), r;
|
|
229
|
-
}(t, n);
|
|
230
|
-
},
|
|
231
|
-
mergeConfig(t, n) {
|
|
232
|
-
const e = shallowMergeConfig(t, n);
|
|
233
|
-
for (const o of ["overrides", "contextDefaults"]) n[o] && (e[o] = [...t[o], ...n[o]]);
|
|
234
|
-
return e;
|
|
235
|
-
},
|
|
236
|
-
name: L
|
|
237
|
-
});
|
|
238
|
-
function nt(t, n, o) {
|
|
239
|
-
return function(t, n, o, r) {
|
|
240
|
-
return Object.assign(createState(Symbol(n), {
|
|
241
|
-
isEqual: r,
|
|
242
|
-
parse: o
|
|
243
|
-
}), { [t]: !0 });
|
|
244
|
-
}(F, t, n, o);
|
|
245
|
-
}
|
|
246
|
-
const et = nt("root", Boolean), ot = nt("isExport", Boolean);
|
|
247
|
-
function rt(t) {
|
|
248
|
-
const n = LexicalBuilder.maybeFromEditor(t);
|
|
249
|
-
return n && n.hasExtensionByName(L) ? getExtensionDependencyFromEditor(t, tt).output.defaults : void 0;
|
|
250
|
-
}
|
|
251
|
-
function ct(t) {
|
|
252
|
-
return function(t, n) {
|
|
253
|
-
const e = E(n);
|
|
254
|
-
return e && e[t];
|
|
255
|
-
}(F, t) || rt(t);
|
|
256
|
-
}
|
|
257
|
-
function st(t, e = $getEditor()) {
|
|
258
|
-
return A(ct(e), t);
|
|
259
|
-
}
|
|
260
|
-
const ut = function(t, e = () => {}) {
|
|
261
|
-
return (o, r = $getEditor()) => (c) => {
|
|
262
|
-
const s = E(r), u = s && s[t], i = P(o, u || e(r));
|
|
263
|
-
return i && i !== u ? function(t, e, o, r = $getEditor()) {
|
|
264
|
-
const c = C, s = E(r);
|
|
265
|
-
try {
|
|
266
|
-
return C = {
|
|
267
|
-
...s,
|
|
268
|
-
editor: r,
|
|
269
|
-
[t]: e
|
|
270
|
-
}, o();
|
|
271
|
-
} finally {
|
|
272
|
-
C = c;
|
|
273
|
-
}
|
|
274
|
-
}(t, i, c, r) : c();
|
|
275
|
-
};
|
|
276
|
-
}(F, rt);
|
|
277
|
-
function it(t, n) {
|
|
278
|
-
return {
|
|
279
|
-
...n,
|
|
280
|
-
nodes: t
|
|
281
|
-
};
|
|
282
|
-
}
|
|
283
|
-
function lt(t) {
|
|
284
|
-
return t.constructor.name === CSSStyleRule.name;
|
|
285
|
-
}
|
|
286
|
-
const ft = new Set(["STYLE", "SCRIPT"]);
|
|
287
|
-
function dt(t, n) {
|
|
288
|
-
isDOMDocumentNode(n) && function(t) {
|
|
289
|
-
if (null === t.querySelector("style")) return;
|
|
290
|
-
const n = /* @__PURE__ */ new Map();
|
|
291
|
-
function e(t) {
|
|
292
|
-
let e = n.get(t);
|
|
293
|
-
if (void 0 === e) {
|
|
294
|
-
e = /* @__PURE__ */ new Set();
|
|
295
|
-
for (let n = 0; n < t.style.length; n++) e.add(t.style[n]);
|
|
296
|
-
n.set(t, e);
|
|
297
|
-
}
|
|
298
|
-
return e;
|
|
299
|
-
}
|
|
300
|
-
try {
|
|
301
|
-
for (const n of Array.from(t.styleSheets)) {
|
|
302
|
-
let o;
|
|
303
|
-
try {
|
|
304
|
-
o = n.cssRules;
|
|
305
|
-
} catch (t) {
|
|
306
|
-
continue;
|
|
307
|
-
}
|
|
308
|
-
for (const n of Array.from(o)) {
|
|
309
|
-
if (!lt(n)) continue;
|
|
310
|
-
let o;
|
|
311
|
-
try {
|
|
312
|
-
o = t.querySelectorAll(n.selectorText);
|
|
313
|
-
} catch (t) {
|
|
314
|
-
continue;
|
|
315
|
-
}
|
|
316
|
-
for (const t of Array.from(o)) {
|
|
317
|
-
if (!isHTMLElement(t)) continue;
|
|
318
|
-
const o = e(t);
|
|
319
|
-
for (let e = 0; e < n.style.length; e++) {
|
|
320
|
-
const r = n.style[e];
|
|
321
|
-
o.has(r) || t.style.setProperty(r, n.style.getPropertyValue(r), n.style.getPropertyPriority(r));
|
|
322
|
-
}
|
|
323
|
-
}
|
|
324
|
-
}
|
|
325
|
-
}
|
|
326
|
-
} catch (t) {}
|
|
327
|
-
}(n);
|
|
328
|
-
const e = isDOMDocumentNode(n) ? n.body.childNodes : n.childNodes, o = [], r = [];
|
|
329
|
-
for (const n of e) if (!ft.has(n.nodeName)) {
|
|
330
|
-
const e = gt(n, t, r, !1);
|
|
331
|
-
if (null !== e) for (const t of e) o.push(t);
|
|
332
|
-
}
|
|
333
|
-
return function(t) {
|
|
334
|
-
for (const n of t) n.getParent() && n.getNextSibling() instanceof ArtificialNode__DO_NOT_USE && n.insertAfter($createLineBreakNode());
|
|
335
|
-
for (const n of t) {
|
|
336
|
-
const t = n.getParent();
|
|
337
|
-
t && t.splice(n.getIndexWithinParent(), 1, n.getChildren());
|
|
338
|
-
}
|
|
339
|
-
}(r), o;
|
|
340
|
-
}
|
|
341
|
-
function at(t, e = null, o = $getEditor()) {
|
|
342
|
-
return ut([j(ot, !0)], o)(() => {
|
|
343
|
-
const n = $getRoot(), r = $getEditorDOMRenderConfig(o), c = t.append.bind(t);
|
|
344
|
-
for (const t of n.getChildren()) yt(o, t, c, e, r);
|
|
345
|
-
return t;
|
|
346
|
-
});
|
|
347
|
-
}
|
|
348
|
-
function pt(t, e = $getRoot()) {
|
|
349
|
-
const o = $getEditor();
|
|
350
|
-
return ut([j(ot, !0), j(et, !0)], o)(() => {
|
|
351
|
-
const n = $getEditorDOMRenderConfig(o);
|
|
352
|
-
return yt(o, e, t.append.bind(t), null, n), t;
|
|
353
|
-
});
|
|
354
|
-
}
|
|
355
|
-
function ht(t, n = null) {
|
|
356
|
-
return ("undefined" == typeof document || "undefined" == typeof window && void 0 === global.window) && D(338), at(document.createElement("div"), n, t).innerHTML;
|
|
357
|
-
}
|
|
358
|
-
function yt(n, e, o, r = null, c = $getEditorDOMRenderConfig(n)) {
|
|
359
|
-
let s = c.$shouldInclude(e, r, n);
|
|
360
|
-
const u = c.$shouldExclude(e, r, n);
|
|
361
|
-
let i = e;
|
|
362
|
-
null !== r && $isTextNode(e) && (i = $sliceSelectedTextNodeContent(r, e, "clone"));
|
|
363
|
-
const { element: d, after: g, append: m, $getChildNodes: x } = c.$exportDOM(i, n);
|
|
364
|
-
if (!d) return !1;
|
|
365
|
-
const v = document.createDocumentFragment(), $ = x ? x() : $isElementNode(i) ? i.getChildren() : [], b = v.append.bind(v);
|
|
366
|
-
for (const t of $) {
|
|
367
|
-
const o = yt(n, t, b, r, c);
|
|
368
|
-
!s && o && c.$extractWithChild(e, t, r, "html", n) && (s = !0);
|
|
369
|
-
}
|
|
370
|
-
if (s && !u) {
|
|
371
|
-
if ((isHTMLElement(d) || isDocumentFragment(d)) && (m ? m(v) : d.append(v)), o(d), g) {
|
|
372
|
-
const t = g.call(i, d);
|
|
373
|
-
t && (isDocumentFragment(d) ? d.replaceChildren(t) : d.replaceWith(t));
|
|
374
|
-
}
|
|
375
|
-
} else o(v);
|
|
376
|
-
return s;
|
|
377
|
-
}
|
|
378
|
-
function gt(t, n, e, o, r = /* @__PURE__ */ new Map(), c) {
|
|
379
|
-
const s = [];
|
|
380
|
-
if (ft.has(t.nodeName)) return s;
|
|
381
|
-
let u = null;
|
|
382
|
-
const i = function(t, n) {
|
|
383
|
-
const { nodeName: e } = t, o = n._htmlConversions.get(e.toLowerCase());
|
|
384
|
-
let r = null;
|
|
385
|
-
if (void 0 !== o) for (const n of o) {
|
|
386
|
-
const e = n(t);
|
|
387
|
-
null !== e && (null === r || (r.priority || 0) <= (e.priority || 0)) && (r = e);
|
|
388
|
-
}
|
|
389
|
-
return null !== r ? r.conversion : null;
|
|
390
|
-
}(t, n), l = i ? i(t) : null;
|
|
391
|
-
let f = null;
|
|
392
|
-
if (null !== l) {
|
|
393
|
-
f = l.after;
|
|
394
|
-
const n = l.node;
|
|
395
|
-
if (u = Array.isArray(n) ? n[n.length - 1] : n, null !== u) {
|
|
396
|
-
for (const [, t] of r) if (u = t(u, c), !u) break;
|
|
397
|
-
u && s.push(...Array.isArray(n) ? n : [u]);
|
|
398
|
-
}
|
|
399
|
-
null != l.forChild && r.set(t.nodeName, l.forChild);
|
|
400
|
-
}
|
|
401
|
-
const d = t.childNodes;
|
|
402
|
-
let a = [];
|
|
403
|
-
const h = (null == u || !$isRootOrShadowRoot(u)) && (null != u && $isBlockElementNode(u) || o);
|
|
404
|
-
for (let t = 0; t < d.length; t++) a.push(...gt(d[t], n, e, h, new Map(r), u));
|
|
405
|
-
if (null != f && (a = f(a)), isBlockDomNode(t) && (a = mt(t, a, h ? () => {
|
|
406
|
-
const t = new ArtificialNode__DO_NOT_USE();
|
|
407
|
-
return e.push(t), t;
|
|
408
|
-
} : $createParagraphNode)), null == u) if (a.length > 0) for (const t of a) s.push(t);
|
|
409
|
-
else isBlockDomNode(t) && function(t) {
|
|
410
|
-
if (null == t.nextSibling || null == t.previousSibling) return !1;
|
|
411
|
-
return isInlineDomNode(t.nextSibling) && isInlineDomNode(t.previousSibling);
|
|
412
|
-
}(t) && s.push($createLineBreakNode());
|
|
413
|
-
else $isElementNode(u) && u.append(...a);
|
|
414
|
-
return s;
|
|
415
|
-
}
|
|
416
|
-
function mt(t, n, e) {
|
|
417
|
-
const o = t.style.textAlign, r = [];
|
|
418
|
-
let c = [];
|
|
419
|
-
for (let t = 0; t < n.length; t++) {
|
|
420
|
-
const s = n[t];
|
|
421
|
-
if ($isBlockElementNode(s)) o && !s.getFormat() && s.setFormat(o), r.push(s);
|
|
422
|
-
else if (c.push(s), t === n.length - 1 || t < n.length - 1 && $isBlockElementNode(n[t + 1])) {
|
|
423
|
-
const t = e();
|
|
424
|
-
t.setFormat(o), t.append(...c), r.push(t), c = [];
|
|
425
|
-
}
|
|
426
|
-
}
|
|
427
|
-
return r;
|
|
428
|
-
}
|
|
429
|
-
//#endregion
|
|
430
|
-
export { at as $generateDOMFromNodes, pt as $generateDOMFromRoot, ht as $generateHtmlFromNodes, dt as $generateNodesFromDOM, st as $getRenderContextValue, ut as $withRenderContext, tt as DOMRenderExtension, ot as RenderContextExport, et as RenderContextRoot, k as contextUpdater, j as contextValue, nt as createRenderState, it as domOverride };
|