@mx-space/cli 0.7.8 → 0.9.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/README.md +30 -0
- package/ROADMAP.md +1 -0
- 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 +11 -2
- package/dist/index.mjs +1 -1
- package/dist/{mxs-BZt1cLW9.mjs → mxs-BR5Y5ash.mjs} +25141 -24672
- package/package.json +15 -14
- package/skills/commands-auth.md +1 -1
- package/skills/commands-category.md +1 -1
- package/skills/commands-comment.md +1 -1
- package/skills/commands-config.md +1 -1
- package/skills/commands-preview.md +1 -1
- package/skills/commands-profile.md +1 -1
- package/skills/commands-project.md +57 -0
- package/skills/commands-topic.md +1 -1
- package/skills/output-modes.md +1 -1
- package/skills/overview.md +2 -1
- package/skills/safety.md +10 -0
- 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,7 +1,8 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import { $
|
|
3
|
-
import {
|
|
4
|
-
|
|
1
|
+
import { f as namedSignals, l as effect } from "./LexicalExtension.node-BVlcrgOx.mjs";
|
|
2
|
+
import { $ as $isElementNode, $t as ElementNode, Bt as COMMAND_PRIORITY_LOW, Ct as $setPointFromCaret, Fr as shallowMergeConfig, L as $getNearestNodeFromDOMNode, Rt as COMMAND_PRIORITY_EDITOR, U as $getSelection, Vn as PASTE_COMMAND, _ as $createTextNode, at as $isNodeSelection, c as $copyNode, cr as defineExtension, dr as getNearestEditorFromDOMNode, er as TextNode, ft as $isTextNode, gt as $normalizeSelection__EXPERIMENTAL, ht as $normalizeCaret, ir as createCommand, it as $isLineBreakNode, jr as safeCast, k as $getChildCaret, n as $applyNodeReplacement, r as $caretFromPoint, rr as configExtension, st as $isRangeSelection, ut as $isSiblingCaret, vr as isDOMNode, wt as $setSelection, yt as $rewindSiblingCaret } from "./Lexical.node-fXM8Jp7p.mjs";
|
|
3
|
+
import { a as CoreImportExtension, g as sel, o as DOMImportExtension, p as defineImportRule, t as $distributeInlineWrapper } from "./LexicalHtml.node-BvNF96jZ.mjs";
|
|
4
|
+
import { d as addClassNamesToElement, g as objectKlassEquals, h as mergeRegister, l as $insertNodeToNearestRootAtCaret, p as isHTMLAnchorElement, r as $findMatchingParent } from "./LexicalUtils.node-j3Llm7Y3.mjs";
|
|
5
|
+
//#region ../../node_modules/.pnpm/@lexical+link@0.45.0/node_modules/@lexical/link/dist/LexicalLink.prod.mjs
|
|
5
6
|
/**
|
|
6
7
|
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
7
8
|
*
|
|
@@ -9,14 +10,14 @@ import { d as addClassNamesToElement, g as objectKlassEquals, h as mergeRegister
|
|
|
9
10
|
* LICENSE file in the root directory of this source tree.
|
|
10
11
|
*
|
|
11
12
|
*/
|
|
12
|
-
const
|
|
13
|
+
const B = new Set([
|
|
13
14
|
"http:",
|
|
14
15
|
"https:",
|
|
15
16
|
"mailto:",
|
|
16
17
|
"sms:",
|
|
17
18
|
"tel:"
|
|
18
19
|
]);
|
|
19
|
-
var
|
|
20
|
+
var z = class z extends ElementNode {
|
|
20
21
|
__url;
|
|
21
22
|
__target;
|
|
22
23
|
__rel;
|
|
@@ -25,7 +26,7 @@ var F = class F extends ElementNode {
|
|
|
25
26
|
return "link";
|
|
26
27
|
}
|
|
27
28
|
static clone(t) {
|
|
28
|
-
return new
|
|
29
|
+
return new z(t.__url, {
|
|
29
30
|
rel: t.__rel,
|
|
30
31
|
target: t.__target,
|
|
31
32
|
title: t.__title
|
|
@@ -33,8 +34,8 @@ var F = class F extends ElementNode {
|
|
|
33
34
|
}
|
|
34
35
|
constructor(t = "", e = {}, n) {
|
|
35
36
|
super(n);
|
|
36
|
-
const { target: r = null, rel: i = null, title:
|
|
37
|
-
this.__url = t, this.__target = r, this.__rel = i, this.__title =
|
|
37
|
+
const { target: r = null, rel: i = null, title: l = null } = e;
|
|
38
|
+
this.__url = t, this.__target = r, this.__rel = i, this.__title = l;
|
|
38
39
|
}
|
|
39
40
|
afterCloneFrom(t) {
|
|
40
41
|
super.afterCloneFrom(t), this.__url = t.__url, this.__rel = t.__rel, this.__target = t.__target, this.__title = t.__title;
|
|
@@ -61,21 +62,21 @@ var F = class F extends ElementNode {
|
|
|
61
62
|
}
|
|
62
63
|
static importDOM() {
|
|
63
64
|
return { a: (t) => ({
|
|
64
|
-
conversion:
|
|
65
|
+
conversion: Z,
|
|
65
66
|
priority: 1
|
|
66
67
|
}) };
|
|
67
68
|
}
|
|
68
69
|
static importJSON(t) {
|
|
69
|
-
return
|
|
70
|
+
return q().updateFromJSON(t);
|
|
70
71
|
}
|
|
71
72
|
updateFromJSON(t) {
|
|
72
73
|
return super.updateFromJSON(t).setURL(t.url).setRel(t.rel || null).setTarget(t.target || null).setTitle(t.title || null);
|
|
73
74
|
}
|
|
74
75
|
sanitizeUrl(t) {
|
|
75
|
-
t =
|
|
76
|
+
t = it(t);
|
|
76
77
|
try {
|
|
77
|
-
const e = new URL(
|
|
78
|
-
if (!
|
|
78
|
+
const e = new URL(it(t));
|
|
79
|
+
if (!B.has(e.protocol)) return "about:blank";
|
|
79
80
|
} catch (e) {
|
|
80
81
|
return t;
|
|
81
82
|
}
|
|
@@ -149,60 +150,60 @@ var F = class F extends ElementNode {
|
|
|
149
150
|
return this.getType() === t.getType() && this.__url === t.__url && this.__target === t.__target && this.__rel === t.__rel && this.__title === t.__title;
|
|
150
151
|
}
|
|
151
152
|
};
|
|
152
|
-
function
|
|
153
|
+
function j(t) {
|
|
153
154
|
const e = $caretFromPoint(t, "next");
|
|
154
155
|
return [e, e.getFlipped()];
|
|
155
156
|
}
|
|
156
|
-
function
|
|
157
|
+
function H(t, e) {
|
|
157
158
|
for (const n of e) if (n.origin.isAttached()) {
|
|
158
159
|
$setPointFromCaret(t, $normalizeCaret(n));
|
|
159
160
|
return;
|
|
160
161
|
}
|
|
161
162
|
}
|
|
162
|
-
function
|
|
163
|
+
function G(t) {
|
|
163
164
|
const e = $getSelection();
|
|
164
165
|
let n = null, i = null;
|
|
165
|
-
function
|
|
166
|
-
$isRangeSelection(e) && (
|
|
166
|
+
function l() {
|
|
167
|
+
$isRangeSelection(e) && (H(e.anchor, n), H(e.focus, i), $normalizeSelection__EXPERIMENTAL(e));
|
|
167
168
|
}
|
|
168
|
-
$isRangeSelection(e) && (n =
|
|
169
|
-
let
|
|
169
|
+
$isRangeSelection(e) && (n = j(e.anchor), i = j(e.focus));
|
|
170
|
+
let s = !1;
|
|
170
171
|
for (const e of $getChildCaret(t, "next")) {
|
|
171
172
|
const n = e.origin;
|
|
172
173
|
if ($isElementNode(n) && !n.isInline()) {
|
|
173
174
|
const i = n.getChildren();
|
|
174
175
|
if (i.length > 0) {
|
|
175
176
|
const e = $copyNode(t);
|
|
176
|
-
e.append(...i), n.append(e),
|
|
177
|
+
e.append(...i), n.append(e), s = !0;
|
|
177
178
|
}
|
|
178
179
|
$insertNodeToNearestRootAtCaret(n, $rewindSiblingCaret(e), { $shouldSplit: () => !1 });
|
|
179
180
|
}
|
|
180
181
|
}
|
|
181
182
|
function a(t, e, n) {
|
|
182
|
-
const [r, i] = t,
|
|
183
|
-
if (!
|
|
184
|
-
const
|
|
185
|
-
return [
|
|
183
|
+
const [r, i] = t, l = (t) => $isSiblingCaret(t) && t.origin.is(e);
|
|
184
|
+
if (!l(r) && !l(i)) return t;
|
|
185
|
+
const s = $normalizeCaret($getChildCaret(n, "next"));
|
|
186
|
+
return [s, s.getFlipped()];
|
|
186
187
|
}
|
|
187
188
|
if (t.isAttached()) {
|
|
188
189
|
const e = t.getPreviousSibling();
|
|
189
|
-
if (
|
|
190
|
+
if (Q(e) && e.shouldMergeAdjacentLink(t)) return n && (n = a(n, e, t)), i && (i = a(i, e, t)), e.append(...t.getChildren()), t.remove(), void l();
|
|
190
191
|
const r = t.getNextSibling();
|
|
191
|
-
|
|
192
|
+
Q(r) && t.shouldMergeAdjacentLink(r) && (n && (n = a(n, t, r)), i && (i = a(i, t, r)), t.append(...r.getChildren()), r.remove(), s = !0);
|
|
192
193
|
}
|
|
193
|
-
if (
|
|
194
|
+
if (s) {
|
|
194
195
|
if (!t.canBeEmpty() && t.isEmpty()) {
|
|
195
196
|
const e = t.getParent();
|
|
196
197
|
t.remove(), e && e.isEmpty() && e.remove();
|
|
197
198
|
}
|
|
198
|
-
|
|
199
|
+
l();
|
|
199
200
|
}
|
|
200
201
|
}
|
|
201
|
-
function
|
|
202
|
+
function Z(t) {
|
|
202
203
|
let n = null;
|
|
203
204
|
if (isHTMLAnchorElement(t)) {
|
|
204
205
|
const e = t.textContent;
|
|
205
|
-
(null !== e && "" !== e || t.children.length > 0) && (n =
|
|
206
|
+
(null !== e && "" !== e || t.children.length > 0) && (n = q(t.getAttribute("href") || "", {
|
|
206
207
|
rel: t.getAttribute("rel"),
|
|
207
208
|
target: t.getAttribute("target"),
|
|
208
209
|
title: t.getAttribute("title")
|
|
@@ -210,13 +211,13 @@ function K(t) {
|
|
|
210
211
|
}
|
|
211
212
|
return { node: n };
|
|
212
213
|
}
|
|
213
|
-
function
|
|
214
|
-
return $applyNodeReplacement(new
|
|
214
|
+
function q(t = "", e) {
|
|
215
|
+
return $applyNodeReplacement(new z(t, e));
|
|
215
216
|
}
|
|
216
|
-
function
|
|
217
|
-
return t instanceof
|
|
217
|
+
function Q(t) {
|
|
218
|
+
return t instanceof z;
|
|
218
219
|
}
|
|
219
|
-
var
|
|
220
|
+
var V = class V extends z {
|
|
220
221
|
__isUnlinked;
|
|
221
222
|
constructor(t = "", e = {}, n) {
|
|
222
223
|
super(t, e, n), this.__isUnlinked = void 0 !== e.isUnlinked && null !== e.isUnlinked && e.isUnlinked;
|
|
@@ -228,7 +229,7 @@ var j = class j extends F {
|
|
|
228
229
|
return "autolink";
|
|
229
230
|
}
|
|
230
231
|
static clone(t) {
|
|
231
|
-
return new
|
|
232
|
+
return new V(t.__url, {
|
|
232
233
|
isUnlinked: t.__isUnlinked,
|
|
233
234
|
rel: t.__rel,
|
|
234
235
|
target: t.__target,
|
|
@@ -252,7 +253,7 @@ var j = class j extends F {
|
|
|
252
253
|
return super.updateDOM(t, e, n) || t.__isUnlinked !== this.__isUnlinked;
|
|
253
254
|
}
|
|
254
255
|
static importJSON(t) {
|
|
255
|
-
return
|
|
256
|
+
return X().updateFromJSON(t);
|
|
256
257
|
}
|
|
257
258
|
updateFromJSON(t) {
|
|
258
259
|
return super.updateFromJSON(t).setIsUnlinked(t.isUnlinked || !1);
|
|
@@ -267,7 +268,7 @@ var j = class j extends F {
|
|
|
267
268
|
};
|
|
268
269
|
}
|
|
269
270
|
insertNewAfter(t, e = !0) {
|
|
270
|
-
const n =
|
|
271
|
+
const n = X(this.__url, {
|
|
271
272
|
isUnlinked: this.__isUnlinked,
|
|
272
273
|
rel: this.__rel,
|
|
273
274
|
target: this.__target,
|
|
@@ -276,14 +277,14 @@ var j = class j extends F {
|
|
|
276
277
|
return this.insertAfter(n, e), n;
|
|
277
278
|
}
|
|
278
279
|
};
|
|
279
|
-
function
|
|
280
|
-
return $applyNodeReplacement(new
|
|
280
|
+
function X(t = "", e) {
|
|
281
|
+
return $applyNodeReplacement(new V(t, e));
|
|
281
282
|
}
|
|
282
|
-
function
|
|
283
|
-
return t instanceof
|
|
283
|
+
function Y(t) {
|
|
284
|
+
return t instanceof V;
|
|
284
285
|
}
|
|
285
|
-
const
|
|
286
|
-
function
|
|
286
|
+
const tt = createCommand("TOGGLE_LINK_COMMAND");
|
|
287
|
+
function et(t, e) {
|
|
287
288
|
if ("element" === t.type) {
|
|
288
289
|
const n = t.getNode();
|
|
289
290
|
$isElementNode(n) || function(t, ...e) {
|
|
@@ -296,7 +297,7 @@ function q(t, e) {
|
|
|
296
297
|
}
|
|
297
298
|
return null;
|
|
298
299
|
}
|
|
299
|
-
function
|
|
300
|
+
function nt(t, e = {}) {
|
|
300
301
|
let r;
|
|
301
302
|
if (t && "object" == typeof t) {
|
|
302
303
|
const { url: n, ...i } = t;
|
|
@@ -305,21 +306,21 @@ function Q(t, e = {}) {
|
|
|
305
306
|
...e
|
|
306
307
|
};
|
|
307
308
|
} else r = t;
|
|
308
|
-
const { target: i, title:
|
|
309
|
+
const { target: i, title: l } = e, s = void 0 === e.rel ? "noreferrer" : e.rel, a = $getSelection();
|
|
309
310
|
if (null === a || !$isRangeSelection(a) && !$isNodeSelection(a)) return;
|
|
310
311
|
if ($isNodeSelection(a)) {
|
|
311
312
|
const t = a.getNodes();
|
|
312
313
|
if (0 === t.length) return;
|
|
313
314
|
t.forEach((t) => {
|
|
314
315
|
if (null === r) {
|
|
315
|
-
const e = $findMatchingParent(t, (t) => !
|
|
316
|
+
const e = $findMatchingParent(t, (t) => !Y(t) && Q(t));
|
|
316
317
|
e && (e.insertBefore(t), 0 === e.getChildren().length && e.remove());
|
|
317
318
|
} else {
|
|
318
|
-
const e = $findMatchingParent(t, (t) => !
|
|
319
|
-
if (e) e.setURL(r), void 0 !== i && e.setTarget(i), void 0 !==
|
|
319
|
+
const e = $findMatchingParent(t, (t) => !Y(t) && Q(t));
|
|
320
|
+
if (e) e.setURL(r), void 0 !== i && e.setTarget(i), void 0 !== s && e.setRel(s);
|
|
320
321
|
else {
|
|
321
|
-
const e =
|
|
322
|
-
rel:
|
|
322
|
+
const e = q(r, {
|
|
323
|
+
rel: s,
|
|
323
324
|
target: i
|
|
324
325
|
});
|
|
325
326
|
t.insertBefore(e), e.append(t);
|
|
@@ -329,32 +330,30 @@ function Q(t, e = {}) {
|
|
|
329
330
|
return;
|
|
330
331
|
}
|
|
331
332
|
if (a.isCollapsed() && null === r) for (const t of a.getNodes()) {
|
|
332
|
-
const e = $findMatchingParent(t, (t) => !
|
|
333
|
-
null !== e && (e.
|
|
334
|
-
e.insertBefore(t);
|
|
335
|
-
}), e.remove());
|
|
333
|
+
const e = $findMatchingParent(t, (t) => !Y(t) && Q(t));
|
|
334
|
+
null !== e && (e.getParentOrThrow().splice(e.getIndexWithinParent(), 0, e.getChildren()), e.remove());
|
|
336
335
|
return;
|
|
337
336
|
}
|
|
338
337
|
const c = a.extract();
|
|
339
338
|
if (null === r) {
|
|
340
339
|
const t = /* @__PURE__ */ new Set();
|
|
341
340
|
c.forEach((e) => {
|
|
342
|
-
const r = $findMatchingParent(e, (t) => !
|
|
341
|
+
const r = $findMatchingParent(e, (t) => !Y(t) && Q(t));
|
|
343
342
|
if (null !== r) {
|
|
344
343
|
const e = r.getKey();
|
|
345
344
|
if (t.has(e)) return;
|
|
346
345
|
(function(t, e) {
|
|
347
|
-
const n = new Set(e.filter((e) => t.isParentOf(e)).map((t) => t.getKey())), r = t.getChildren(), i = (r) => n.has(r.getKey()) || $isElementNode(r) && e.some((e) => t.isParentOf(e) && r.isParentOf(e)),
|
|
348
|
-
if (
|
|
349
|
-
const
|
|
350
|
-
if (a)
|
|
351
|
-
else if (c) for (let e =
|
|
346
|
+
const n = new Set(e.filter((e) => t.isParentOf(e)).map((t) => t.getKey())), r = t.getChildren(), i = (r) => n.has(r.getKey()) || $isElementNode(r) && e.some((e) => t.isParentOf(e) && r.isParentOf(e)), l = r.filter(i);
|
|
347
|
+
if (l.length === r.length) return r.forEach((e) => t.insertBefore(e)), void t.remove();
|
|
348
|
+
const s = r.findIndex(i), u = r.findLastIndex(i), a = 0 === s, c = u === r.length - 1;
|
|
349
|
+
if (a) l.forEach((e) => t.insertBefore(e));
|
|
350
|
+
else if (c) for (let e = l.length - 1; e >= 0; e--) t.insertAfter(l[e]);
|
|
352
351
|
else {
|
|
353
|
-
for (let e =
|
|
352
|
+
for (let e = l.length - 1; e >= 0; e--) t.insertAfter(l[e]);
|
|
354
353
|
const e = r.slice(u + 1);
|
|
355
354
|
if (e.length > 0) {
|
|
356
355
|
const n = $copyNode(t);
|
|
357
|
-
|
|
356
|
+
l[l.length - 1].insertAfter(n), e.forEach((t) => n.append(t));
|
|
358
357
|
}
|
|
359
358
|
}
|
|
360
359
|
})(r, c), t.add(e);
|
|
@@ -362,19 +361,19 @@ function Q(t, e = {}) {
|
|
|
362
361
|
});
|
|
363
362
|
return;
|
|
364
363
|
}
|
|
365
|
-
const
|
|
366
|
-
|
|
364
|
+
const p = /* @__PURE__ */ new Set(), m = (t) => {
|
|
365
|
+
p.has(t.getKey()) || (p.add(t.getKey()), t.setURL(r), void 0 !== i && t.setTarget(i), void 0 !== s && t.setRel(s), void 0 !== l && t.setTitle(l));
|
|
367
366
|
};
|
|
368
367
|
if (1 === c.length) {
|
|
369
|
-
const t = c[0], e = $findMatchingParent(t,
|
|
368
|
+
const t = c[0], e = $findMatchingParent(t, Q);
|
|
370
369
|
if (null !== e) return m(e);
|
|
371
370
|
}
|
|
372
371
|
(function(t) {
|
|
373
372
|
const e = $getSelection();
|
|
374
373
|
if (!$isRangeSelection(e)) return t();
|
|
375
|
-
const n = $normalizeSelection__EXPERIMENTAL(e), r = n.isBackward(), i =
|
|
374
|
+
const n = $normalizeSelection__EXPERIMENTAL(e), r = n.isBackward(), i = et(n.anchor, r ? -1 : 0), l = et(n.focus, r ? 0 : -1);
|
|
376
375
|
t();
|
|
377
|
-
if (i ||
|
|
376
|
+
if (i || l) {
|
|
378
377
|
const t = $getSelection();
|
|
379
378
|
if ($isRangeSelection(t)) {
|
|
380
379
|
const e = t.clone();
|
|
@@ -382,9 +381,9 @@ function Q(t, e = {}) {
|
|
|
382
381
|
const t = i.getParent();
|
|
383
382
|
t && e.anchor.set(t.getKey(), i.getIndexWithinParent() + (r ? 1 : 0), "element");
|
|
384
383
|
}
|
|
385
|
-
if (
|
|
386
|
-
const t =
|
|
387
|
-
t && e.focus.set(t.getKey(),
|
|
384
|
+
if (l) {
|
|
385
|
+
const t = l.getParent();
|
|
386
|
+
t && e.focus.set(t.getKey(), l.getIndexWithinParent() + (r ? 0 : 1), "element");
|
|
388
387
|
}
|
|
389
388
|
$setSelection($normalizeSelection__EXPERIMENTAL(e));
|
|
390
389
|
}
|
|
@@ -393,15 +392,15 @@ function Q(t, e = {}) {
|
|
|
393
392
|
let t = null;
|
|
394
393
|
for (const e of c) {
|
|
395
394
|
if (!e.isAttached()) continue;
|
|
396
|
-
const o = $findMatchingParent(e,
|
|
395
|
+
const o = $findMatchingParent(e, Q);
|
|
397
396
|
if (o) {
|
|
398
397
|
m(o);
|
|
399
398
|
continue;
|
|
400
399
|
}
|
|
401
400
|
if ($isElementNode(e)) {
|
|
402
401
|
if (!e.isInline()) continue;
|
|
403
|
-
if (
|
|
404
|
-
if (!(
|
|
402
|
+
if (Q(e)) {
|
|
403
|
+
if (!(Y(e) || null !== t && t.getParentOrThrow().isParentOf(e))) {
|
|
405
404
|
m(e), t = e;
|
|
406
405
|
continue;
|
|
407
406
|
}
|
|
@@ -411,30 +410,30 @@ function Q(t, e = {}) {
|
|
|
411
410
|
}
|
|
412
411
|
}
|
|
413
412
|
const u = e.getPreviousSibling();
|
|
414
|
-
|
|
415
|
-
rel:
|
|
413
|
+
Q(u) && u.is(t) ? u.append(e) : (t = q(r, {
|
|
414
|
+
rel: s,
|
|
416
415
|
target: i,
|
|
417
|
-
title:
|
|
416
|
+
title: l
|
|
418
417
|
}), e.insertAfter(t), t.append(e));
|
|
419
418
|
}
|
|
420
419
|
});
|
|
421
420
|
}
|
|
422
|
-
const
|
|
423
|
-
function
|
|
424
|
-
return t.match(/^[a-z][a-z0-9+.-]*:/i) || t.match(/^[/#.]/) ? t : t.includes("@") ? `mailto:${t}` :
|
|
421
|
+
const rt = /^\+?[0-9\s()-]{5,}$/;
|
|
422
|
+
function it(t) {
|
|
423
|
+
return t.match(/^[a-z][a-z0-9+.-]*:/i) || t.match(/^[/#.]/) ? t : t.includes("@") ? `mailto:${t}` : rt.test(t) ? `tel:${t}` : `https://${t}`;
|
|
425
424
|
}
|
|
426
|
-
function
|
|
427
|
-
return mergeRegister(t.registerNodeTransform(
|
|
425
|
+
function lt(t, e) {
|
|
426
|
+
return mergeRegister(t.registerNodeTransform(z, G), t.registerCommand(tt, (t) => {
|
|
428
427
|
const n = e.validateUrl.peek(), r = e.attributes.peek();
|
|
429
|
-
if (null === t) return
|
|
430
|
-
if ("string" == typeof t) return !(void 0 !== n && !n(t)) && (
|
|
428
|
+
if (null === t) return nt(null), !0;
|
|
429
|
+
if ("string" == typeof t) return !(void 0 !== n && !n(t)) && (nt(t, r), !0);
|
|
431
430
|
{
|
|
432
|
-
const { url: e, target: n, rel: i, title:
|
|
433
|
-
return
|
|
431
|
+
const { url: e, target: n, rel: i, title: l } = t;
|
|
432
|
+
return nt(e, {
|
|
434
433
|
...r,
|
|
435
434
|
rel: i,
|
|
436
435
|
target: n,
|
|
437
|
-
title:
|
|
436
|
+
title: l
|
|
438
437
|
}), !0;
|
|
439
438
|
}
|
|
440
439
|
}, COMMAND_PRIORITY_EDITOR), effect(() => {
|
|
@@ -445,15 +444,15 @@ function Y(t, e) {
|
|
|
445
444
|
const i = $getSelection();
|
|
446
445
|
if (!$isRangeSelection(i) || i.isCollapsed() || !objectKlassEquals(e, ClipboardEvent)) return !1;
|
|
447
446
|
if (null === e.clipboardData) return !1;
|
|
448
|
-
const
|
|
449
|
-
return !!n(
|
|
447
|
+
const s = e.clipboardData.getData("text");
|
|
448
|
+
return !!n(s) && !i.getNodes().some((t) => $isElementNode(t)) && (t.dispatchCommand(tt, {
|
|
450
449
|
...r,
|
|
451
|
-
url:
|
|
450
|
+
url: s
|
|
452
451
|
}), e.preventDefault(), !0);
|
|
453
452
|
}, COMMAND_PRIORITY_LOW);
|
|
454
453
|
}));
|
|
455
454
|
}
|
|
456
|
-
const
|
|
455
|
+
const st = defineExtension({
|
|
457
456
|
build: (t, e, n) => namedSignals(e),
|
|
458
457
|
config: {
|
|
459
458
|
attributes: void 0,
|
|
@@ -464,21 +463,21 @@ const tt = defineExtension({
|
|
|
464
463
|
return t.attributes && (n.attributes = shallowMergeConfig(t.attributes, n.attributes)), n;
|
|
465
464
|
},
|
|
466
465
|
name: "@lexical/link/Link",
|
|
467
|
-
nodes: () => [
|
|
468
|
-
register: (t, e, n) =>
|
|
466
|
+
nodes: () => [z],
|
|
467
|
+
register: (t, e, n) => lt(t, n.getOutput())
|
|
469
468
|
});
|
|
470
|
-
function
|
|
471
|
-
const
|
|
472
|
-
const
|
|
473
|
-
if (!isDOMNode(
|
|
474
|
-
const
|
|
475
|
-
if (null ===
|
|
469
|
+
function ot(t, r, i = {}) {
|
|
470
|
+
const l = (i) => {
|
|
471
|
+
const l = i.target;
|
|
472
|
+
if (!isDOMNode(l)) return;
|
|
473
|
+
const s = getNearestEditorFromDOMNode(l);
|
|
474
|
+
if (null === s) return;
|
|
476
475
|
let o = null, a = null;
|
|
477
|
-
if (
|
|
478
|
-
const t = $getNearestNodeFromDOMNode(
|
|
476
|
+
if (s.update(() => {
|
|
477
|
+
const t = $getNearestNodeFromDOMNode(l);
|
|
479
478
|
if (null !== t) {
|
|
480
479
|
const i = $findMatchingParent(t, $isElementNode);
|
|
481
|
-
if (!r.disabled.peek()) if (
|
|
480
|
+
if (!r.disabled.peek()) if (Q(i)) o = i.sanitizeUrl(i.getURL()), a = i.getTarget();
|
|
482
481
|
else {
|
|
483
482
|
const t = function(t, e) {
|
|
484
483
|
let n = t;
|
|
@@ -487,7 +486,7 @@ function et(t, r, i = {}) {
|
|
|
487
486
|
n = n.parentNode;
|
|
488
487
|
}
|
|
489
488
|
return null;
|
|
490
|
-
}(
|
|
489
|
+
}(l, isHTMLAnchorElement);
|
|
491
490
|
null !== t && (o = t.href, a = t.target);
|
|
492
491
|
}
|
|
493
492
|
}
|
|
@@ -496,26 +495,26 @@ function et(t, r, i = {}) {
|
|
|
496
495
|
if ($isRangeSelection(c) && !c.isCollapsed()) return void i.preventDefault();
|
|
497
496
|
const f = "auxclick" === i.type && 1 === i.button;
|
|
498
497
|
window.open(o, r.newTab.peek() || f || i.metaKey || i.ctrlKey || "_blank" === a ? "_blank" : "_self"), i.preventDefault();
|
|
499
|
-
},
|
|
500
|
-
1 === t.button &&
|
|
498
|
+
}, s = (t) => {
|
|
499
|
+
1 === t.button && l(t);
|
|
501
500
|
};
|
|
502
501
|
return t.registerRootListener((t) => {
|
|
503
|
-
if (t) return t.addEventListener("click",
|
|
504
|
-
t.removeEventListener("click",
|
|
502
|
+
if (t) return t.addEventListener("click", l, i), t.addEventListener("mouseup", s, i), () => {
|
|
503
|
+
t.removeEventListener("click", l), t.removeEventListener("mouseup", s);
|
|
505
504
|
};
|
|
506
505
|
});
|
|
507
506
|
}
|
|
508
|
-
const
|
|
507
|
+
const ut = defineExtension({
|
|
509
508
|
build: (t, e, n) => namedSignals(e),
|
|
510
509
|
config: safeCast({
|
|
511
510
|
disabled: !1,
|
|
512
511
|
newTab: !1
|
|
513
512
|
}),
|
|
514
|
-
dependencies: [
|
|
513
|
+
dependencies: [st],
|
|
515
514
|
name: "@lexical/link/ClickableLink",
|
|
516
|
-
register: (t, e, n) =>
|
|
515
|
+
register: (t, e, n) => ot(t, n.getOutput())
|
|
517
516
|
});
|
|
518
|
-
function
|
|
517
|
+
function at(t, e = (t) => t) {
|
|
519
518
|
return (n) => {
|
|
520
519
|
const r = t.exec(n);
|
|
521
520
|
return null === r ? null : {
|
|
@@ -526,86 +525,86 @@ function rt(t, e = (t) => t) {
|
|
|
526
525
|
};
|
|
527
526
|
};
|
|
528
527
|
}
|
|
529
|
-
function
|
|
528
|
+
function ct(t, e) {
|
|
530
529
|
for (let n = 0; n < e.length; n++) {
|
|
531
530
|
const r = e[n](t);
|
|
532
531
|
if (r) return r;
|
|
533
532
|
}
|
|
534
533
|
return null;
|
|
535
534
|
}
|
|
536
|
-
const
|
|
537
|
-
function
|
|
535
|
+
const gt = /[.,;\s]/;
|
|
536
|
+
function ft(t, e) {
|
|
538
537
|
return e.test(t);
|
|
539
538
|
}
|
|
540
|
-
function
|
|
541
|
-
return
|
|
539
|
+
function dt(t, e) {
|
|
540
|
+
return ft(t[t.length - 1], e);
|
|
542
541
|
}
|
|
543
|
-
function
|
|
544
|
-
return
|
|
542
|
+
function ht(t, e) {
|
|
543
|
+
return ft(t[0], e);
|
|
545
544
|
}
|
|
546
|
-
function
|
|
545
|
+
function pt(t, e) {
|
|
547
546
|
let n = t.getPreviousSibling();
|
|
548
|
-
return $isElementNode(n) && (n = n.getLastDescendant()), null === n || $isLineBreakNode(n) || $isTextNode(n) &&
|
|
547
|
+
return $isElementNode(n) && (n = n.getLastDescendant()), null === n || $isLineBreakNode(n) || $isTextNode(n) && dt(n.getTextContent(), e);
|
|
549
548
|
}
|
|
550
|
-
function
|
|
549
|
+
function _t(t, e) {
|
|
551
550
|
let n = t.getNextSibling();
|
|
552
|
-
return $isElementNode(n) && (n = n.getFirstDescendant()), null === n || $isLineBreakNode(n) || $isTextNode(n) &&
|
|
551
|
+
return $isElementNode(n) && (n = n.getFirstDescendant()), null === n || $isLineBreakNode(n) || $isTextNode(n) && ht(n.getTextContent(), e);
|
|
553
552
|
}
|
|
554
|
-
function
|
|
555
|
-
if (!(t > 0 ?
|
|
556
|
-
return e < r.length ?
|
|
553
|
+
function mt(t, e, n, r, i) {
|
|
554
|
+
if (!(t > 0 ? ft(r[t - 1], n) : pt(i[0], n))) return !1;
|
|
555
|
+
return e < r.length ? ft(r[e], n) : _t(i[i.length - 1], n);
|
|
557
556
|
}
|
|
558
|
-
function
|
|
559
|
-
const r = [], i = [],
|
|
560
|
-
let
|
|
557
|
+
function xt(t, e, n) {
|
|
558
|
+
const r = [], i = [], l = [];
|
|
559
|
+
let s = 0, o = 0;
|
|
561
560
|
const u = [...t];
|
|
562
561
|
for (; u.length > 0;) {
|
|
563
562
|
const t = u[0], a = t.getTextContent().length, c = o;
|
|
564
|
-
o + a <= e ? (r.push(t),
|
|
563
|
+
o + a <= e ? (r.push(t), s += a) : c >= n ? l.push(t) : i.push(t), o += a, u.shift();
|
|
565
564
|
}
|
|
566
565
|
return [
|
|
567
|
-
|
|
566
|
+
s,
|
|
568
567
|
r,
|
|
569
568
|
i,
|
|
570
|
-
|
|
569
|
+
l
|
|
571
570
|
];
|
|
572
571
|
}
|
|
573
|
-
function
|
|
574
|
-
const i =
|
|
572
|
+
function kt(t, e, n, r) {
|
|
573
|
+
const i = X(r.url, r.attributes);
|
|
575
574
|
if (1 === t.length) {
|
|
576
|
-
let
|
|
577
|
-
0 === e ? [
|
|
575
|
+
let l, s = t[0];
|
|
576
|
+
0 === e ? [l, s] = s.splitText(n) : [, l, s] = s.splitText(e, n);
|
|
578
577
|
const o = $createTextNode(r.text);
|
|
579
|
-
return o.setFormat(
|
|
578
|
+
return o.setFormat(l.getFormat()), o.setDetail(l.getDetail()), o.setStyle(l.getStyle()), i.append(o), l.replace(i), s;
|
|
580
579
|
}
|
|
581
580
|
if (t.length > 1) {
|
|
582
581
|
const r = t[0];
|
|
583
|
-
let
|
|
584
|
-
0 === e ?
|
|
582
|
+
let l, s = r.getTextContent().length;
|
|
583
|
+
0 === e ? l = r : [, l] = r.splitText(e);
|
|
585
584
|
const o = [];
|
|
586
585
|
let a;
|
|
587
586
|
for (let e = 1; e < t.length; e++) {
|
|
588
|
-
const r = t[e], i = r.getTextContent().length,
|
|
589
|
-
if (
|
|
587
|
+
const r = t[e], i = r.getTextContent().length, l = s;
|
|
588
|
+
if (l < n) if (s + i <= n) o.push(r);
|
|
590
589
|
else {
|
|
591
|
-
const [t, e] = r.splitText(n -
|
|
590
|
+
const [t, e] = r.splitText(n - l);
|
|
592
591
|
o.push(t), a = e;
|
|
593
592
|
}
|
|
594
|
-
|
|
593
|
+
s += i;
|
|
595
594
|
}
|
|
596
|
-
const c = $getSelection(), d = c ? c.getNodes().find($isTextNode) : void 0, h = $createTextNode(
|
|
597
|
-
return h.setFormat(
|
|
595
|
+
const c = $getSelection(), d = c ? c.getNodes().find($isTextNode) : void 0, h = $createTextNode(l.getTextContent());
|
|
596
|
+
return h.setFormat(l.getFormat()), h.setDetail(l.getDetail()), h.setStyle(l.getStyle()), i.append(h, ...o), d && d === l && ($isRangeSelection(c) ? h.select(c.anchor.offset, c.focus.offset) : $isNodeSelection(c) && h.select(0, h.getTextContent().length)), l.replace(i), a;
|
|
598
597
|
}
|
|
599
598
|
}
|
|
600
|
-
function
|
|
601
|
-
const i = t.getChildren(),
|
|
602
|
-
for (let e = 0; e <
|
|
599
|
+
function bt(t, e, n, r) {
|
|
600
|
+
const i = t.getChildren(), l = i.length;
|
|
601
|
+
for (let e = 0; e < l; e++) {
|
|
603
602
|
const r = i[e];
|
|
604
|
-
if (!$isTextNode(r) || !r.isSimpleText()) return
|
|
603
|
+
if (!$isTextNode(r) || !r.isSimpleText()) return vt(t), void n(null, t.getURL());
|
|
605
604
|
}
|
|
606
|
-
const
|
|
607
|
-
if (null === o || o.text !==
|
|
608
|
-
if (!
|
|
605
|
+
const s = t.getTextContent(), o = ct(s, e);
|
|
606
|
+
if (null === o || o.text !== s) return vt(t), void n(null, t.getURL());
|
|
607
|
+
if (!pt(t, r) || !_t(t, r)) return vt(t), void n(null, t.getURL());
|
|
609
608
|
const u = t.getURL();
|
|
610
609
|
if (u !== o.url && (t.setURL(o.url), n(o.url, u)), o.attributes) {
|
|
611
610
|
const e = t.getRel();
|
|
@@ -614,41 +613,41 @@ function ht(t, e, n, r) {
|
|
|
614
613
|
r !== o.attributes.target && (t.setTarget(o.attributes.target || null), n(o.attributes.target || null, r));
|
|
615
614
|
}
|
|
616
615
|
}
|
|
617
|
-
function
|
|
616
|
+
function vt(t) {
|
|
618
617
|
const e = t.getChildren();
|
|
619
618
|
for (let n = e.length - 1; n >= 0; n--) t.insertAfter(e[n]);
|
|
620
619
|
return t.remove(), e.map((t) => t.getLatest());
|
|
621
620
|
}
|
|
622
|
-
const
|
|
621
|
+
const Ut = {
|
|
623
622
|
changeHandlers: [],
|
|
624
623
|
excludeParents: [],
|
|
625
624
|
matchers: [],
|
|
626
|
-
separatorRegex:
|
|
625
|
+
separatorRegex: gt
|
|
627
626
|
};
|
|
628
|
-
function
|
|
629
|
-
const { matchers: n, changeHandlers: r, excludeParents:
|
|
627
|
+
function Tt(t, e = Ut) {
|
|
628
|
+
const { matchers: n, changeHandlers: r, excludeParents: l, separatorRegex: s = gt } = e, o = (t, e) => {
|
|
630
629
|
for (const n of r) n(t, e);
|
|
631
630
|
};
|
|
632
631
|
return mergeRegister(t.registerNodeTransform(TextNode, (t) => {
|
|
633
632
|
const e = t.getParentOrThrow(), r = t.getPreviousSibling();
|
|
634
|
-
if (
|
|
635
|
-
else if (!
|
|
636
|
-
if (t.isSimpleText() && (
|
|
633
|
+
if (Y(e)) bt(e, n, o, s);
|
|
634
|
+
else if (!Q(e) && !l.some((t) => t(e))) {
|
|
635
|
+
if (t.isSimpleText() && (ht(t.getTextContent(), s) || !Y(r))) (function(t, e, n, r) {
|
|
637
636
|
for (const e of t) {
|
|
638
637
|
const t = e.getParent();
|
|
639
|
-
if (
|
|
638
|
+
if (Y(t) && !t.getIsUnlinked()) return;
|
|
640
639
|
}
|
|
641
640
|
let i = [...t];
|
|
642
|
-
const
|
|
643
|
-
let
|
|
644
|
-
for (; (
|
|
645
|
-
const t =
|
|
646
|
-
if (
|
|
647
|
-
const [r, ,
|
|
641
|
+
const l = i.map((t) => t.getTextContent()).join("");
|
|
642
|
+
let s, o = l, u = 0;
|
|
643
|
+
for (; (s = ct(o, e)) && null !== s;) {
|
|
644
|
+
const t = s.index, e = t + s.length;
|
|
645
|
+
if (mt(u + t, u + e, r, l, i)) {
|
|
646
|
+
const [r, , l, a] = xt(i, u + t, u + e);
|
|
648
647
|
let c = !1;
|
|
649
|
-
for (const t of
|
|
648
|
+
for (const t of l) {
|
|
650
649
|
const e = t.getParent();
|
|
651
|
-
if (
|
|
650
|
+
if (Y(e) && !e.getIsUnlinked()) {
|
|
652
651
|
c = !0;
|
|
653
652
|
break;
|
|
654
653
|
}
|
|
@@ -657,8 +656,8 @@ function mt(t, e = pt) {
|
|
|
657
656
|
u += e, o = o.substring(e);
|
|
658
657
|
continue;
|
|
659
658
|
}
|
|
660
|
-
const g =
|
|
661
|
-
i = g ? [g, ...a] : a, n(
|
|
659
|
+
const g = kt(l, u + t - r, u + e - r, s);
|
|
660
|
+
i = g ? [g, ...a] : a, n(s.url, null), u = 0;
|
|
662
661
|
} else u += e;
|
|
663
662
|
o = o.substring(e);
|
|
664
663
|
}
|
|
@@ -667,34 +666,34 @@ function mt(t, e = pt) {
|
|
|
667
666
|
let n = t.getNextSibling();
|
|
668
667
|
for (; null !== n && $isTextNode(n) && n.isSimpleText() && (e.push(n), !/[\s]/.test(n.getTextContent()));) n = n.getNextSibling();
|
|
669
668
|
return e;
|
|
670
|
-
}(t), n, o,
|
|
669
|
+
}(t), n, o, s);
|
|
671
670
|
(function(t, e, n, r) {
|
|
672
|
-
const i = t.getParent(),
|
|
673
|
-
if (!
|
|
674
|
-
if (
|
|
675
|
-
if (!
|
|
676
|
-
if (u = o,
|
|
677
|
-
const i =
|
|
678
|
-
null !==
|
|
671
|
+
const i = t.getParent(), l = t.getPreviousSibling(), s = t.getNextSibling(), o = t.getTextContent();
|
|
672
|
+
if (!Y(i) || i.getIsUnlinked()) {
|
|
673
|
+
if (Y(l) && !l.getIsUnlinked() && l.is(t.getPreviousSibling()) && t.getParent() === l.getParent()) {
|
|
674
|
+
if (!ht(o, r)) return vt(l), void n(null, l.getURL());
|
|
675
|
+
if (u = o, l.isEmailURI() ? /^\.[a-zA-Z]{2,}/.test(u) : /^\.[a-zA-Z0-9]{1,}/.test(u)) {
|
|
676
|
+
const i = l.getTextContent() + o, s = ct(i, e);
|
|
677
|
+
null !== s && s.text === i && (l.append(t), bt(l, e, n, r), n(null, l.getURL()));
|
|
679
678
|
}
|
|
680
679
|
}
|
|
681
680
|
var u;
|
|
682
|
-
!
|
|
681
|
+
!Y(s) || s.getIsUnlinked() || dt(o, r) || s.is(t.getNextSibling()) && t.getParent() === s.getParent() && (vt(s), n(null, s.getURL()));
|
|
683
682
|
}
|
|
684
|
-
})(t, n, o,
|
|
683
|
+
})(t, n, o, s);
|
|
685
684
|
}
|
|
686
|
-
}), t.registerCommand(
|
|
685
|
+
}), t.registerCommand(tt, (t) => {
|
|
687
686
|
const e = $getSelection();
|
|
688
687
|
if (null !== t || !$isRangeSelection(e)) return !1;
|
|
689
688
|
return e.extract().forEach((t) => {
|
|
690
689
|
const e = t.getParent();
|
|
691
|
-
|
|
690
|
+
Y(e) && (e.setIsUnlinked(!e.getIsUnlinked()), e.markDirty());
|
|
692
691
|
}), !1;
|
|
693
692
|
}, COMMAND_PRIORITY_LOW));
|
|
694
693
|
}
|
|
695
|
-
const
|
|
696
|
-
config:
|
|
697
|
-
dependencies: [
|
|
694
|
+
const Ct = defineExtension({
|
|
695
|
+
config: Ut,
|
|
696
|
+
dependencies: [st],
|
|
698
697
|
mergeConfig(t, e) {
|
|
699
698
|
const n = shallowMergeConfig(t, e);
|
|
700
699
|
for (const r of [
|
|
@@ -708,8 +707,27 @@ const xt = defineExtension({
|
|
|
708
707
|
return n;
|
|
709
708
|
},
|
|
710
709
|
name: "@lexical/link/AutoLink",
|
|
711
|
-
nodes: [
|
|
712
|
-
register:
|
|
713
|
-
}),
|
|
710
|
+
nodes: [V],
|
|
711
|
+
register: Tt
|
|
712
|
+
}), Lt = [defineImportRule({
|
|
713
|
+
$import: (t, e) => {
|
|
714
|
+
if (!e.textContent && 0 === e.children.length) return [];
|
|
715
|
+
const n = e.getAttribute("href") || "", r = {
|
|
716
|
+
rel: e.getAttribute("rel"),
|
|
717
|
+
target: e.getAttribute("target"),
|
|
718
|
+
title: e.getAttribute("title")
|
|
719
|
+
};
|
|
720
|
+
return $distributeInlineWrapper(t.$importChildren(e), () => q(n, r));
|
|
721
|
+
},
|
|
722
|
+
match: sel.tag("a"),
|
|
723
|
+
name: "@lexical/link/a"
|
|
724
|
+
})], St = defineExtension({
|
|
725
|
+
dependencies: [
|
|
726
|
+
CoreImportExtension,
|
|
727
|
+
st,
|
|
728
|
+
configExtension(DOMImportExtension, { rules: Lt })
|
|
729
|
+
],
|
|
730
|
+
name: "@lexical/link/Import"
|
|
731
|
+
}), Ot = nt;
|
|
714
732
|
//#endregion
|
|
715
|
-
export {
|
|
733
|
+
export { X as $createAutoLinkNode, q as $createLinkNode, Y as $isAutoLinkNode, Q as $isLinkNode, nt as $toggleLink, Ct as AutoLinkExtension, V as AutoLinkNode, ut as ClickableLinkExtension, st as LinkExtension, St as LinkImportExtension, Lt as LinkImportRules, z as LinkNode, tt as TOGGLE_LINK_COMMAND, at as createLinkMatcherWithRegExp, it as formatUrl, Tt as registerAutoLink, ot as registerClickableLink, lt as registerLink, Ot as toggleLink };
|