@mx-space/cli 0.14.2 → 0.15.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/LICENSE +33 -0
- package/README.md +35 -11
- package/dist/{Lexical.dev-CtGmYDoh.mjs → Lexical.dev-Cck4n26y.mjs} +240 -325
- package/dist/{Lexical.node-8sRFmq2X.mjs → Lexical.node-D6wf2D5M.mjs} +2 -2
- package/dist/{Lexical.prod-D-VfeKDz.mjs → Lexical.prod-DCwS1oTq.mjs} +1753 -1783
- package/dist/{LexicalClipboard.dev-CzQ15z6E.mjs → LexicalClipboard.dev-CMkPHV7O.mjs} +6 -6
- package/dist/{LexicalClipboard.node-D4gMGws6.mjs → LexicalClipboard.node-m4nZ7IYw.mjs} +2 -2
- package/dist/{LexicalClipboard.prod-CltkQpzS.mjs → LexicalClipboard.prod-B_rN1vE1.mjs} +6 -6
- package/dist/{LexicalCodeCore.dev-DkYBZRGB.mjs → LexicalCodeCore.dev-DyJw3i8V.mjs} +56 -68
- package/dist/{LexicalCodeCore.prod-COc3_QL8.mjs → LexicalCodeCore.prod-DPXLHQLF.mjs} +144 -156
- package/dist/{LexicalDragon.dev-Dv5_WUae.mjs → LexicalDragon.dev-ZkNfMwrE.mjs} +3 -3
- package/dist/{LexicalDragon.node-DgjrmWkd.mjs → LexicalDragon.node-Ds9oLUFh.mjs} +2 -2
- package/dist/{LexicalDragon.prod-DnpbDe-_.mjs → LexicalDragon.prod-B58ic2av.mjs} +3 -3
- package/dist/{LexicalExtension.dev-JMH_6-OZ.mjs → LexicalExtension.dev-DvwHs1Xv.mjs} +10 -19
- package/dist/{LexicalExtension.node-BUozzx4t.mjs → LexicalExtension.node-5OymZQfy.mjs} +2 -2
- package/dist/{LexicalExtension.prod-UiyDgmou.mjs → LexicalExtension.prod-Ce0T5smQ.mjs} +73 -82
- package/dist/{LexicalHeadless.dev-BfLGciiX.mjs → LexicalHeadless.dev-DA0WldSR.mjs} +2 -2
- package/dist/{LexicalHeadless.prod-CWF7edmQ.mjs → LexicalHeadless.prod-1kQgKB6c.mjs} +2 -2
- package/dist/{LexicalHtml.dev-D5EF5PGW.mjs → LexicalHtml.dev-BDB7CUrx.mjs} +6 -6
- package/dist/{LexicalHtml.node-BYbzHNVe.mjs → LexicalHtml.node-DpVNt7It.mjs} +2 -2
- package/dist/{LexicalHtml.prod-D_FfkvVD.mjs → LexicalHtml.prod-HkxM5scw.mjs} +6 -6
- package/dist/{LexicalLink.dev-D3Pgh6ik.mjs → LexicalLink.dev-C5zNJlrm.mjs} +17 -41
- package/dist/{LexicalLink.prod-XZoAYVYD.mjs → LexicalLink.prod-Bkt9hQAt.mjs} +113 -137
- package/dist/{LexicalList.dev-B5d3ObhB.mjs → LexicalList.dev-B7VgME-m.mjs} +15 -47
- package/dist/{LexicalList.prod-OQDpVAEb.mjs → LexicalList.prod-B8c7TDjH.mjs} +208 -224
- package/dist/{LexicalMarkdown.dev-BkM8G3DG.mjs → LexicalMarkdown.dev-B5z9kLbV.mjs} +5 -4
- package/dist/{LexicalMarkdown.prod-DcVXCex6.mjs → LexicalMarkdown.prod-wKzw7FFH.mjs} +5 -4
- package/dist/{LexicalRichText.dev-DppD7IrA.mjs → LexicalRichText.dev-CUd6Li5F.mjs} +76 -82
- package/dist/{LexicalRichText.node-CPSn7dkg.mjs → LexicalRichText.node-BKfaQ-CH.mjs} +8 -8
- package/dist/{LexicalRichText.prod-h7JPxFNp.mjs → LexicalRichText.prod-SBewjJHx.mjs} +86 -96
- package/dist/{LexicalSelection.dev-CD0SLbxP.mjs → LexicalSelection.dev-D27JOCqj.mjs} +2 -2
- package/dist/{LexicalSelection.node-CGlJgUlZ.mjs → LexicalSelection.node-DBEwPjBu.mjs} +2 -2
- package/dist/{LexicalSelection.prod-DbVZN5AV.mjs → LexicalSelection.prod-OaYhXHOL.mjs} +2 -2
- package/dist/{LexicalTable.dev-D0HU14UV.mjs → LexicalTable.dev-6IFFOAE0.mjs} +260 -131
- package/dist/{LexicalTable.prod-BcPNSrxP.mjs → LexicalTable.prod-2CaLZ7fH.mjs} +686 -630
- package/dist/{LexicalUtils.dev-iKy_TrRT.mjs → LexicalUtils.dev-DJA7J_7v.mjs} +3 -3
- package/dist/{LexicalUtils.node-CIgMS8cG.mjs → LexicalUtils.node-Df9oPTlA.mjs} +2 -2
- package/dist/{LexicalUtils.prod-DIAsKJzu.mjs → LexicalUtils.prod-Bb7V4Ewg.mjs} +3 -3
- package/dist/bin/mxs.mjs +1 -1
- package/dist/esm-CDcJmHkG.mjs +2 -0
- package/dist/{esm-CwXl1N0a.mjs → esm-DLzrv7gD.mjs} +165 -131
- package/dist/index.d.mts +16 -16
- package/dist/index.mjs +1 -1
- package/dist/{mxs-iW9DgqSZ.mjs → mxs-BIRW5Axj.mjs} +1434 -2233
- package/dist/vendor/litexml/cli.mjs +2462 -2557
- package/dist/vendor/litexml/litexml-html-preview-client.css +80 -47
- package/dist/vendor/litexml/litexml-html-preview-client.js +5276 -4906
- package/dist/vendor/litexml/style.css +6 -2
- package/package.json +31 -32
- package/skills/commands-ai.md +45 -12
- package/skills/overview.md +1 -1
- package/dist/esm-CH7CrOvh.mjs +0 -2
|
@@ -1,8 +1,8 @@
|
|
|
1
|
-
import { f as namedSignals, l as effect } from "./LexicalExtension.node-
|
|
2
|
-
import { $r as isHTMLElement, $t as COMMAND_PRIORITY_LOW, A as $getChildCaret, At as $rewindSiblingCaret, B as $getNodeByKey, Et as $normalizeCaret, G as $getSelection, Hr as getStyleObjectFromCSS, I as $getDocument, K as $getSiblingCaret, Kn as KEY_ARROW_UP_COMMAND, Lr as getNearestEditorFromDOMNode, Mt as $setDirectionFromDOM, Nt as $setFormatFromDOM, Or as getActiveElement, Pt as $setPointFromCaret, St as $isTextNode, Tr as defineExtension, Un as KEY_ARROW_DOWN_COMMAND, Wn as KEY_ARROW_LEFT_COMMAND, Xn as KEY_ESCAPE_COMMAND, Yt as COMMAND_PRIORITY_BEFORE_EDITOR, Zn as KEY_SPACE_COMMAND, _r as TextNode, b as $findMatchingParent, br as configExtension, ci as mergeRegister, d as $createLineBreakNode, di as registerEventListeners, et as $insertNodeToNearestRootAtCaret, fi as removeClassNamesFromElement, fr as SKIP_DOM_SELECTION_TAG, gt as $isRootOrShadowRoot, hn as ElementNode,
|
|
3
|
-
import { a as $isBlockLevel, c as CoreImportExtension, g as defineImportRule, l as DOMImportExtension, o as $propagateTextAlignToBlockChildren, v as isElementOfTag, y as sel } from "./LexicalHtml.node-
|
|
4
|
-
import { f as calculateZoomLevel, i as $getNearestNodeOfType } from "./LexicalUtils.node-
|
|
5
|
-
//#region ../../node_modules/.pnpm/@lexical+list@0.
|
|
1
|
+
import { f as namedSignals, l as effect } from "./LexicalExtension.node-5OymZQfy.mjs";
|
|
2
|
+
import { $r as isHTMLElement, $t as COMMAND_PRIORITY_LOW, A as $getChildCaret, At as $rewindSiblingCaret, B as $getNodeByKey, Et as $normalizeCaret, G as $getSelection, Hr as getStyleObjectFromCSS, I as $getDocument, K as $getSiblingCaret, Kn as KEY_ARROW_UP_COMMAND, Lr as getNearestEditorFromDOMNode, Mt as $setDirectionFromDOM, Nt as $setFormatFromDOM, Or as getActiveElement, Pt as $setPointFromCaret, St as $isTextNode, Tr as defineExtension, Un as KEY_ARROW_DOWN_COMMAND, Wn as KEY_ARROW_LEFT_COMMAND, Xn as KEY_ESCAPE_COMMAND, Yt as COMMAND_PRIORITY_BEFORE_EDITOR, Zn as KEY_SPACE_COMMAND, _r as TextNode, b as $findMatchingParent, br as configExtension, ci as mergeRegister, d as $createLineBreakNode, di as registerEventListeners, et as $insertNodeToNearestRootAtCaret, fi as removeClassNamesFromElement, fr as SKIP_DOM_SELECTION_TAG, gt as $isRootOrShadowRoot, hn as ElementNode, l as $copyNode, li as normalizeClassNames, lt as $isLeafNode, mi as setDOMStyleFromCSS, mr as SKIP_SELECTION_FOCUS_TAG, mt as $isRangeSelection, n as $applyNodeReplacement, ot as $isElementNode, p as $createParagraphNode, pi as safeCast, pt as $isParagraphNode, qn as KEY_BACKSPACE_COMMAND, t as $addUpdateTag, ui as registerEventListener, v as $createTextNode, vr as addClassNamesToElement, wn as INSERT_PARAGRAPH_COMMAND, xr as createCommand, yr as buildImportMap, z as $getNearestNodeFromDOMNode } from "./Lexical.node-D6wf2D5M.mjs";
|
|
3
|
+
import { a as $isBlockLevel, c as CoreImportExtension, g as defineImportRule, l as DOMImportExtension, o as $propagateTextAlignToBlockChildren, v as isElementOfTag, y as sel } from "./LexicalHtml.node-DpVNt7It.mjs";
|
|
4
|
+
import { f as calculateZoomLevel, i as $getNearestNodeOfType } from "./LexicalUtils.node-Df9oPTlA.mjs";
|
|
5
|
+
//#region ../../node_modules/.pnpm/@lexical+list@0.49.0_typescript@6.0.3/node_modules/@lexical/list/dist/LexicalList.prod.mjs
|
|
6
6
|
/**
|
|
7
7
|
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
8
8
|
*
|
|
@@ -10,50 +10,50 @@ import { f as calculateZoomLevel, i as $getNearestNodeOfType } from "./LexicalUt
|
|
|
10
10
|
* LICENSE file in the root directory of this source tree.
|
|
11
11
|
*
|
|
12
12
|
*/
|
|
13
|
-
function
|
|
13
|
+
function gt(t, ...e) {
|
|
14
14
|
const n = new URL("https://lexical.dev/docs/error"), r = new URLSearchParams();
|
|
15
15
|
r.append("code", t);
|
|
16
16
|
for (const t of e) r.append("v", t);
|
|
17
17
|
throw n.search = r.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.`);
|
|
18
18
|
}
|
|
19
|
-
function
|
|
19
|
+
function ht(t) {
|
|
20
20
|
let e = 1, n = t.getParent();
|
|
21
21
|
for (; null != n;) {
|
|
22
|
-
if (
|
|
22
|
+
if (Ot(n)) {
|
|
23
23
|
const t = n.getParent();
|
|
24
|
-
if (
|
|
24
|
+
if ($t(t)) {
|
|
25
25
|
e++, n = t.getParent();
|
|
26
26
|
continue;
|
|
27
27
|
}
|
|
28
|
-
|
|
28
|
+
gt(40);
|
|
29
29
|
}
|
|
30
30
|
return e;
|
|
31
31
|
}
|
|
32
32
|
return e;
|
|
33
33
|
}
|
|
34
|
-
function
|
|
34
|
+
function ft(t) {
|
|
35
35
|
const e = t.getParent();
|
|
36
|
-
|
|
36
|
+
$t(e) || gt(40);
|
|
37
37
|
let n = e, r = e;
|
|
38
|
-
for (; null !== r;) r = r.getParent(),
|
|
38
|
+
for (; null !== r;) r = r.getParent(), $t(r) && (n = r);
|
|
39
39
|
return n;
|
|
40
40
|
}
|
|
41
|
-
function
|
|
41
|
+
function dt(t) {
|
|
42
42
|
let e = [];
|
|
43
|
-
const n = t.getChildren().filter(
|
|
43
|
+
const n = t.getChildren().filter(Ot);
|
|
44
44
|
for (let t = 0; t < n.length; t++) {
|
|
45
45
|
const r = n[t], i = r.getFirstChild();
|
|
46
|
-
|
|
46
|
+
$t(i) ? e = e.concat(dt(i)) : e.push(r);
|
|
47
47
|
}
|
|
48
48
|
return e;
|
|
49
49
|
}
|
|
50
|
-
function
|
|
51
|
-
return
|
|
50
|
+
function pt(t) {
|
|
51
|
+
return Ot(t) && $t(t.getFirstChild());
|
|
52
52
|
}
|
|
53
|
-
function
|
|
54
|
-
return
|
|
53
|
+
function mt(t, e) {
|
|
54
|
+
return Ot(t) && (0 === e.length || 1 === e.length && t.is(e[0]) && 0 === t.getChildrenSize());
|
|
55
55
|
}
|
|
56
|
-
function
|
|
56
|
+
function _t(t) {
|
|
57
57
|
const e = $getSelection();
|
|
58
58
|
if (null !== e) {
|
|
59
59
|
let n = e.getNodes();
|
|
@@ -66,15 +66,15 @@ function yt(t) {
|
|
|
66
66
|
const t = $createParagraphNode();
|
|
67
67
|
i.append(t), n = t.select().getNodes();
|
|
68
68
|
}
|
|
69
|
-
} else if (
|
|
70
|
-
const e =
|
|
69
|
+
} else if (mt(i, n)) {
|
|
70
|
+
const e = Mt(t);
|
|
71
71
|
if ($isRootOrShadowRoot(l)) {
|
|
72
72
|
i.replace(e);
|
|
73
|
-
const t =
|
|
73
|
+
const t = At();
|
|
74
74
|
$isElementNode(i) && (t.setFormat(i.getFormatType()), t.setIndent(i.getIndent())), e.append(t);
|
|
75
|
-
} else if (
|
|
75
|
+
} else if (Ot(i)) {
|
|
76
76
|
const t = i.getParentOrThrow();
|
|
77
|
-
|
|
77
|
+
yt(e, t.getChildren()), t.replace(e);
|
|
78
78
|
}
|
|
79
79
|
return;
|
|
80
80
|
}
|
|
@@ -82,24 +82,24 @@ function yt(t) {
|
|
|
82
82
|
const i = /* @__PURE__ */ new Set();
|
|
83
83
|
for (let e = 0; e < n.length; e++) {
|
|
84
84
|
const r = n[e];
|
|
85
|
-
if ($isElementNode(r) && r.isEmpty() && !
|
|
86
|
-
|
|
85
|
+
if ($isElementNode(r) && r.isEmpty() && !Ot(r) && !i.has(r.getKey())) {
|
|
86
|
+
Ct(r, t);
|
|
87
87
|
continue;
|
|
88
88
|
}
|
|
89
|
-
let o = $isLeafNode(r) ? r.getParent() :
|
|
89
|
+
let o = $isLeafNode(r) ? r.getParent() : Ot(r) && r.isEmpty() ? r : null;
|
|
90
90
|
for (; null != o;) {
|
|
91
91
|
const e = o.getKey();
|
|
92
|
-
if (
|
|
92
|
+
if ($t(o)) {
|
|
93
93
|
if (!i.has(e)) {
|
|
94
|
-
const n =
|
|
95
|
-
|
|
94
|
+
const n = Mt(t);
|
|
95
|
+
yt(n, o.getChildren()), o.replace(n), i.add(e);
|
|
96
96
|
}
|
|
97
97
|
break;
|
|
98
98
|
}
|
|
99
99
|
{
|
|
100
100
|
const n = o.getParent();
|
|
101
101
|
if ($isRootOrShadowRoot(n) && !i.has(e)) {
|
|
102
|
-
i.add(e),
|
|
102
|
+
i.add(e), Ct(o, t);
|
|
103
103
|
break;
|
|
104
104
|
}
|
|
105
105
|
o = n;
|
|
@@ -108,86 +108,86 @@ function yt(t) {
|
|
|
108
108
|
}
|
|
109
109
|
}
|
|
110
110
|
}
|
|
111
|
-
function
|
|
111
|
+
function yt(t, e) {
|
|
112
112
|
t.splice(t.getChildrenSize(), 0, e);
|
|
113
113
|
}
|
|
114
|
-
function
|
|
115
|
-
if (
|
|
116
|
-
const i = t.getPreviousSibling(), s = t.getNextSibling(), o =
|
|
114
|
+
function Ct(t, e) {
|
|
115
|
+
if ($t(t)) return t;
|
|
116
|
+
const i = t.getPreviousSibling(), s = t.getNextSibling(), o = At();
|
|
117
117
|
let l;
|
|
118
|
-
if (
|
|
119
|
-
else if (
|
|
118
|
+
if (yt(o, t.getChildren()), $t(i) && e === i.getListType()) i.append(o), $t(s) && e === s.getListType() && (yt(i, s.getChildren()), s.remove()), l = i;
|
|
119
|
+
else if ($t(s) && e === s.getListType()) s.getFirstChildOrThrow().insertBefore(o), l = s;
|
|
120
120
|
else {
|
|
121
|
-
const n =
|
|
121
|
+
const n = Mt(e);
|
|
122
122
|
n.append(o), t.replace(n), l = n;
|
|
123
123
|
}
|
|
124
124
|
o.setFormat(t.getFormatType()), o.setIndent(t.getIndent());
|
|
125
125
|
const c = $getSelection();
|
|
126
126
|
return $isRangeSelection(c) && (l.getKey() === c.anchor.key && c.anchor.set(o.getKey(), c.anchor.offset, "element"), l.getKey() === c.focus.key && c.focus.set(o.getKey(), c.focus.offset, "element")), t.remove(), l;
|
|
127
127
|
}
|
|
128
|
-
function
|
|
128
|
+
function kt(t, e) {
|
|
129
129
|
const n = t.getLastChild(), r = e.getFirstChild();
|
|
130
|
-
n && r &&
|
|
130
|
+
n && r && pt(n) && pt(r) && (kt(n.getFirstChild(), r.getFirstChild()), r.remove());
|
|
131
131
|
const i = e.getChildren();
|
|
132
132
|
i.length > 0 && t.append(...i), e.remove();
|
|
133
133
|
}
|
|
134
|
-
function
|
|
134
|
+
function bt() {
|
|
135
135
|
const e = $getSelection();
|
|
136
136
|
if ($isRangeSelection(e)) {
|
|
137
137
|
const n = /* @__PURE__ */ new Set(), r = e.getNodes(), i = e.anchor.getNode();
|
|
138
|
-
if (
|
|
138
|
+
if (mt(i, r)) n.add(ft(i));
|
|
139
139
|
else for (let e = 0; e < r.length; e++) {
|
|
140
140
|
const i = r[e];
|
|
141
141
|
if ($isLeafNode(i)) {
|
|
142
|
-
const e = $getNearestNodeOfType(i,
|
|
143
|
-
null != e && n.add(
|
|
142
|
+
const e = $getNearestNodeOfType(i, Nt);
|
|
143
|
+
null != e && n.add(ft(e));
|
|
144
144
|
}
|
|
145
145
|
}
|
|
146
146
|
for (const t of n) {
|
|
147
147
|
let n = t;
|
|
148
|
-
const r =
|
|
148
|
+
const r = dt(t);
|
|
149
149
|
for (const t of r) {
|
|
150
150
|
const r = $createParagraphNode().setTextStyle(e.style).setTextFormat(e.format);
|
|
151
|
-
|
|
151
|
+
yt(r, t.getChildren()), n.insertAfter(r), n = r, t.__key === e.anchor.key && $setPointFromCaret(e.anchor, $normalizeCaret($getChildCaret(r, "next"))), t.__key === e.focus.key && $setPointFromCaret(e.focus, $normalizeCaret($getChildCaret(r, "next"))), t.remove();
|
|
152
152
|
}
|
|
153
153
|
t.remove();
|
|
154
154
|
}
|
|
155
155
|
}
|
|
156
156
|
}
|
|
157
|
-
function
|
|
157
|
+
function St(t) {
|
|
158
158
|
const e = "check" !== t.getListType();
|
|
159
159
|
let n = t.getStart();
|
|
160
|
-
for (const r of t.getChildren())
|
|
160
|
+
for (const r of t.getChildren()) Ot(r) && (r.getValue() !== n && r.setValue(n), e && null != r.getLatest().__checked && r.setChecked(void 0), $t(r.getFirstChild()) || n++);
|
|
161
161
|
}
|
|
162
162
|
function Tt(t) {
|
|
163
163
|
const e = /* @__PURE__ */ new Set();
|
|
164
|
-
if (
|
|
164
|
+
if (pt(t) || e.has(t.getKey())) return;
|
|
165
165
|
const n = t.getParent(), r = t.getNextSibling(), i = t.getPreviousSibling();
|
|
166
|
-
if (
|
|
166
|
+
if (pt(r) && pt(i)) {
|
|
167
167
|
const n = i.getFirstChild();
|
|
168
|
-
if (
|
|
168
|
+
if ($t(n)) {
|
|
169
169
|
n.append(t);
|
|
170
170
|
const i = r.getFirstChild();
|
|
171
|
-
if (
|
|
171
|
+
if ($t(i)) yt(n, i.getChildren()), r.remove(), e.add(r.getKey());
|
|
172
172
|
}
|
|
173
|
-
} else if (
|
|
173
|
+
} else if (pt(r)) {
|
|
174
174
|
const e = r.getFirstChild();
|
|
175
|
-
if (
|
|
175
|
+
if ($t(e)) {
|
|
176
176
|
const n = e.getFirstChild();
|
|
177
177
|
null !== n && n.insertBefore(t);
|
|
178
178
|
}
|
|
179
|
-
} else if (
|
|
179
|
+
} else if (pt(i)) {
|
|
180
180
|
const e = i.getFirstChild();
|
|
181
|
-
|
|
182
|
-
} else if (
|
|
181
|
+
$t(e) && e.append(t);
|
|
182
|
+
} else if ($t(n)) {
|
|
183
183
|
const e = $copyNode(t), s = $copyNode(n);
|
|
184
184
|
e.append(s), s.append(t), i ? i.insertAfter(e) : r ? r.insertBefore(e) : n.append(e);
|
|
185
185
|
}
|
|
186
186
|
}
|
|
187
|
-
function
|
|
188
|
-
if (
|
|
187
|
+
function vt(t) {
|
|
188
|
+
if (pt(t)) return;
|
|
189
189
|
const e = t.getParent(), n = e ? e.getParent() : void 0;
|
|
190
|
-
if (
|
|
190
|
+
if ($t(n ? n.getParent() : void 0) && Ot(n) && $t(e)) {
|
|
191
191
|
const r = e ? e.getFirstChild() : void 0, i = e ? e.getLastChild() : void 0;
|
|
192
192
|
if (t.is(r)) n.insertBefore(t), e.isEmpty() && n.remove();
|
|
193
193
|
else if (t.is(i)) n.insertAfter(t), e.isEmpty() && n.remove();
|
|
@@ -195,28 +195,28 @@ function xt(t) {
|
|
|
195
195
|
const r = $copyNode(t), i = $copyNode(e);
|
|
196
196
|
r.append(i), t.getPreviousSiblings().forEach((t) => i.append(t));
|
|
197
197
|
const s = $copyNode(t), o = $copyNode(e);
|
|
198
|
-
s.append(o),
|
|
198
|
+
s.append(o), yt(o, t.getNextSiblings()), n.insertBefore(r), n.insertAfter(s), n.replace(t);
|
|
199
199
|
}
|
|
200
200
|
}
|
|
201
201
|
}
|
|
202
|
-
function
|
|
202
|
+
function xt(t = !1) {
|
|
203
203
|
const e = $getSelection();
|
|
204
204
|
if (!$isRangeSelection(e) || !e.isCollapsed()) return !1;
|
|
205
205
|
const c = e.anchor.getNode();
|
|
206
206
|
let a = null;
|
|
207
|
-
if (
|
|
207
|
+
if (Ot(c) && 0 === c.getChildrenSize()) a = c;
|
|
208
208
|
else if ($isTextNode(c)) {
|
|
209
209
|
const t = c.getParent();
|
|
210
|
-
|
|
210
|
+
Ot(t) && t.getChildren().every((t) => $isTextNode(t) && "" === t.getTextContent().trim()) && (a = t);
|
|
211
211
|
}
|
|
212
212
|
if (null === a) return !1;
|
|
213
|
-
const u =
|
|
214
|
-
|
|
213
|
+
const u = ft(a), g = a.getParent();
|
|
214
|
+
$t(g) || gt(40);
|
|
215
215
|
const h = g.getParent();
|
|
216
216
|
let f;
|
|
217
217
|
if ($isRootOrShadowRoot(h)) f = $createParagraphNode(), u.insertAfter(f);
|
|
218
218
|
else {
|
|
219
|
-
if (!
|
|
219
|
+
if (!Ot(h)) return !1;
|
|
220
220
|
f = $copyNode(h), h.insertAfter(f);
|
|
221
221
|
}
|
|
222
222
|
f.setTextStyle(e.style).setTextFormat(e.format).select();
|
|
@@ -225,7 +225,7 @@ function Nt(t = !1) {
|
|
|
225
225
|
const e = t ? function(t, e) {
|
|
226
226
|
return t.getStart() + e.getIndexWithinParent();
|
|
227
227
|
}(g, a) : 1, n = $copyNode(g).setStart(e);
|
|
228
|
-
if (
|
|
228
|
+
if (Ot(f)) {
|
|
229
229
|
const t = $copyNode(f);
|
|
230
230
|
t.append(n), f.insertAfter(t);
|
|
231
231
|
} else f.insertAfter(n);
|
|
@@ -235,28 +235,28 @@ function Nt(t = !1) {
|
|
|
235
235
|
let e = t;
|
|
236
236
|
for (; null == e.getNextSibling() && null == e.getPreviousSibling();) {
|
|
237
237
|
const t = e.getParent();
|
|
238
|
-
if (null == t || !
|
|
238
|
+
if (null == t || !Ot(t) && !$t(t)) break;
|
|
239
239
|
e = t;
|
|
240
240
|
}
|
|
241
241
|
e.remove();
|
|
242
242
|
}(a), !0;
|
|
243
243
|
}
|
|
244
|
-
var
|
|
244
|
+
var Nt = class extends ElementNode {
|
|
245
245
|
__value;
|
|
246
246
|
__checked;
|
|
247
247
|
$config() {
|
|
248
248
|
return this.config("listitem", {
|
|
249
249
|
$transform: (t) => {
|
|
250
250
|
const e = t.getParent();
|
|
251
|
-
if (
|
|
251
|
+
if ($t(e)) "check" !== e.getListType() && null != t.getChecked() && t.setChecked(void 0);
|
|
252
252
|
else if (e) {
|
|
253
253
|
const n = t.createParentElementNode();
|
|
254
|
-
|
|
254
|
+
$t(n) || gt(340);
|
|
255
255
|
const r = [t];
|
|
256
256
|
for (const e of ["previous", "next"]) {
|
|
257
257
|
r.reverse();
|
|
258
258
|
for (const { origin: n } of $getSiblingCaret(t, e)) {
|
|
259
|
-
if (!
|
|
259
|
+
if (!Ot(n)) break;
|
|
260
260
|
r.push(n);
|
|
261
261
|
}
|
|
262
262
|
}
|
|
@@ -268,7 +268,7 @@ var Pt = class extends ElementNode {
|
|
|
268
268
|
},
|
|
269
269
|
extends: ElementNode,
|
|
270
270
|
importDOM: buildImportMap({ li: () => ({
|
|
271
|
-
conversion:
|
|
271
|
+
conversion: Pt,
|
|
272
272
|
priority: 0
|
|
273
273
|
}) })
|
|
274
274
|
});
|
|
@@ -286,11 +286,11 @@ var Pt = class extends ElementNode {
|
|
|
286
286
|
updateListItemDOM(t, e, n) {
|
|
287
287
|
(function(t, e) {
|
|
288
288
|
const n = e.getParent();
|
|
289
|
-
|
|
289
|
+
!$t(n) || "check" !== n.getListType() || $t(e.getFirstChild()) ? (t.removeAttribute("role"), t.removeAttribute("tabIndex"), t.removeAttribute("aria-checked")) : (t.setAttribute("role", "checkbox"), t.setAttribute("tabIndex", "-1"), t.setAttribute("aria-checked", e.getChecked() ? "true" : "false"));
|
|
290
290
|
})(e, this), e.value = this.__value, function(t, e, n) {
|
|
291
291
|
const r = e.list;
|
|
292
292
|
if (!r) return;
|
|
293
|
-
const i = r.listitem, s = r.nested && r.nested.listitem, o = n.getParent(), l =
|
|
293
|
+
const i = r.listitem, s = r.nested && r.nested.listitem, o = n.getParent(), l = $t(o) && "check" === o.getListType(), c = n.getChecked(), a = n.getChildren().some((t) => $t(t)), u = [];
|
|
294
294
|
void 0 !== r.listitemChecked && u.push(r.listitemChecked);
|
|
295
295
|
void 0 !== r.listitemUnchecked && u.push(r.listitemUnchecked);
|
|
296
296
|
void 0 !== s && u.push(...normalizeClassNames(s));
|
|
@@ -324,7 +324,7 @@ var Pt = class extends ElementNode {
|
|
|
324
324
|
const e = this.createDOM(t._config), n = this.getFormatType();
|
|
325
325
|
n && (e.style.textAlign = n);
|
|
326
326
|
const r = this.getDirection();
|
|
327
|
-
return r && (e.dir = r),
|
|
327
|
+
return r && (e.dir = r), pt(this) ? {
|
|
328
328
|
after(t) {
|
|
329
329
|
if (isHTMLElement(t)) {
|
|
330
330
|
const e = t.previousElementSibling;
|
|
@@ -356,10 +356,10 @@ var Pt = class extends ElementNode {
|
|
|
356
356
|
return this;
|
|
357
357
|
}
|
|
358
358
|
replace(t, e) {
|
|
359
|
-
if (
|
|
359
|
+
if (Ot(t)) return super.replace(t);
|
|
360
360
|
this.setIndent(0);
|
|
361
361
|
const i = this.getParentOrThrow();
|
|
362
|
-
if (
|
|
362
|
+
if (!$t(i)) return t;
|
|
363
363
|
if (i.__first === this.getKey()) i.insertBefore(t);
|
|
364
364
|
else if (i.__last === this.getKey()) i.insertAfter(t);
|
|
365
365
|
else {
|
|
@@ -373,7 +373,7 @@ var Pt = class extends ElementNode {
|
|
|
373
373
|
}
|
|
374
374
|
const s = this.__key;
|
|
375
375
|
let o = 0;
|
|
376
|
-
if (e && ($isElementNode(t) ||
|
|
376
|
+
if (e && ($isElementNode(t) || gt(139), o = t.getChildrenSize(), t.splice(o, 0, this.getChildren())), e && $isElementNode(t)) {
|
|
377
377
|
const e = $getSelection();
|
|
378
378
|
if ($isRangeSelection(e)) for (const n of e.getStartEndPoints()) n.key === s && "element" === n.type && n.set(t.getKey(), o + n.offset, "element");
|
|
379
379
|
}
|
|
@@ -381,7 +381,7 @@ var Pt = class extends ElementNode {
|
|
|
381
381
|
}
|
|
382
382
|
insertAfter(t, e = !0) {
|
|
383
383
|
const n = this.getParentOrThrow();
|
|
384
|
-
if (
|
|
384
|
+
if ($t(n) || gt(39), Ot(t)) return super.insertAfter(t, e);
|
|
385
385
|
const r = this.getNextSiblings();
|
|
386
386
|
if (n.insertAfter(t, e), 0 !== r.length) {
|
|
387
387
|
const i = $copyNode(n);
|
|
@@ -391,7 +391,7 @@ var Pt = class extends ElementNode {
|
|
|
391
391
|
}
|
|
392
392
|
remove(t) {
|
|
393
393
|
const e = this.getPreviousSibling(), n = this.getNextSibling();
|
|
394
|
-
super.remove(t), e && n &&
|
|
394
|
+
super.remove(t), e && n && pt(e) && pt(n) && (kt(e.getFirstChild(), n.getFirstChild()), n.remove());
|
|
395
395
|
}
|
|
396
396
|
resetOnCopyNodeFrom(t) {
|
|
397
397
|
super.resetOnCopyNodeFrom(t), t.getChecked() && this.setChecked(!1);
|
|
@@ -401,9 +401,9 @@ var Pt = class extends ElementNode {
|
|
|
401
401
|
return this.insertAfter(n, e), n;
|
|
402
402
|
}
|
|
403
403
|
collapseAtStart(t) {
|
|
404
|
-
if (
|
|
404
|
+
if (pt(this)) return !1;
|
|
405
405
|
const e = this.getParentOrThrow();
|
|
406
|
-
if (
|
|
406
|
+
if (Ot(e.getParentOrThrow())) return vt(this), !0;
|
|
407
407
|
const n = $createParagraphNode().append(...this.getChildren()), r = this.getNextSiblings();
|
|
408
408
|
if (r.length > 0) {
|
|
409
409
|
const t = $copyNode(e);
|
|
@@ -422,7 +422,7 @@ var Pt = class extends ElementNode {
|
|
|
422
422
|
const t = this.getLatest();
|
|
423
423
|
let e;
|
|
424
424
|
const n = this.getParent();
|
|
425
|
-
return
|
|
425
|
+
return $t(n) && (e = n.getListType()), "check" === e ? Boolean(t.__checked) : void 0;
|
|
426
426
|
}
|
|
427
427
|
setChecked(t) {
|
|
428
428
|
const e = this.getWritable();
|
|
@@ -436,23 +436,23 @@ var Pt = class extends ElementNode {
|
|
|
436
436
|
const t = this.getParent();
|
|
437
437
|
if (null === t || !this.isAttached()) return this.getLatest().__indent;
|
|
438
438
|
let e = t.getParentOrThrow(), n = 0;
|
|
439
|
-
for (;
|
|
439
|
+
for (; Ot(e);) e = e.getParentOrThrow().getParentOrThrow(), n++;
|
|
440
440
|
return n;
|
|
441
441
|
}
|
|
442
442
|
setIndent(t) {
|
|
443
|
-
"number" != typeof t &&
|
|
443
|
+
"number" != typeof t && gt(117), (t = Math.floor(t)) >= 0 || gt(199);
|
|
444
444
|
let e = this.getIndent();
|
|
445
|
-
for (; e !== t;) e < t ? (Tt(this), e++) : (
|
|
445
|
+
for (; e !== t;) e < t ? (Tt(this), e++) : (vt(this), e--);
|
|
446
446
|
return this;
|
|
447
447
|
}
|
|
448
448
|
canInsertAfter(t) {
|
|
449
|
-
return
|
|
449
|
+
return Ot(t);
|
|
450
450
|
}
|
|
451
451
|
canReplaceWith(t) {
|
|
452
|
-
return
|
|
452
|
+
return Ot(t);
|
|
453
453
|
}
|
|
454
454
|
canMergeWith(t) {
|
|
455
|
-
return
|
|
455
|
+
return Ot(t) || $isParagraphNode(t);
|
|
456
456
|
}
|
|
457
457
|
extractWithChild(t, e) {
|
|
458
458
|
if (!$isRangeSelection(e)) return !1;
|
|
@@ -463,44 +463,44 @@ var Pt = class extends ElementNode {
|
|
|
463
463
|
return !0;
|
|
464
464
|
}
|
|
465
465
|
createParentElementNode() {
|
|
466
|
-
return
|
|
466
|
+
return Mt("bullet");
|
|
467
467
|
}
|
|
468
468
|
canMergeWhenEmpty() {
|
|
469
469
|
return !0;
|
|
470
470
|
}
|
|
471
471
|
};
|
|
472
|
-
function
|
|
472
|
+
function Pt(t) {
|
|
473
473
|
if (t.classList.contains("task-list-item")) {
|
|
474
474
|
for (const e of t.children) if ("INPUT" === e.tagName) return Lt(e);
|
|
475
475
|
}
|
|
476
476
|
if (t.classList.contains("joplin-checkbox")) {
|
|
477
477
|
for (const e of t.children) if (e.classList.contains("checkbox-wrapper") && e.children.length > 0 && "INPUT" === e.children[0].tagName) return Lt(e.children[0]);
|
|
478
478
|
}
|
|
479
|
-
const e = t.getAttribute("aria-checked"), n =
|
|
479
|
+
const e = t.getAttribute("aria-checked"), n = At("true" === e || "false" !== e && void 0);
|
|
480
480
|
return $setFormatFromDOM(n, t), {
|
|
481
|
-
after:
|
|
481
|
+
after: Ft.bind(null, n),
|
|
482
482
|
node: $setDirectionFromDOM(n, t)
|
|
483
483
|
};
|
|
484
484
|
}
|
|
485
485
|
function Lt(t) {
|
|
486
486
|
if (!("checkbox" === t.getAttribute("type"))) return { node: null };
|
|
487
|
-
const e =
|
|
487
|
+
const e = At(t.hasAttribute("checked"));
|
|
488
488
|
return {
|
|
489
|
-
after:
|
|
489
|
+
after: Ft.bind(null, e),
|
|
490
490
|
node: e
|
|
491
491
|
};
|
|
492
492
|
}
|
|
493
|
-
function
|
|
493
|
+
function Ft(t, e) {
|
|
494
494
|
const n = e[0];
|
|
495
495
|
return 1 === e.length && $isParagraphNode(n) && !t.getFormatType() && n.getFormatType() ? (t.setFormat(n.getFormatType()), n.getChildren()) : e;
|
|
496
496
|
}
|
|
497
|
-
function
|
|
498
|
-
return $applyNodeReplacement(new
|
|
497
|
+
function At(t) {
|
|
498
|
+
return $applyNodeReplacement(new Nt(void 0, t));
|
|
499
499
|
}
|
|
500
|
-
function
|
|
501
|
-
return t instanceof
|
|
500
|
+
function Ot(t) {
|
|
501
|
+
return t instanceof Nt;
|
|
502
502
|
}
|
|
503
|
-
var
|
|
503
|
+
var It = class extends ElementNode {
|
|
504
504
|
__tag;
|
|
505
505
|
__start;
|
|
506
506
|
__listType;
|
|
@@ -509,17 +509,17 @@ var Et = class extends ElementNode {
|
|
|
509
509
|
$transform: (t) => {
|
|
510
510
|
(function(t) {
|
|
511
511
|
const e = t.getNextSibling();
|
|
512
|
-
|
|
513
|
-
})(t),
|
|
512
|
+
$t(e) && t.getListType() === e.getListType() && kt(t, e);
|
|
513
|
+
})(t), St(t);
|
|
514
514
|
},
|
|
515
515
|
extends: ElementNode,
|
|
516
516
|
importDOM: buildImportMap({
|
|
517
517
|
ol: () => ({
|
|
518
|
-
conversion:
|
|
518
|
+
conversion: Dt,
|
|
519
519
|
priority: 0
|
|
520
520
|
}),
|
|
521
521
|
ul: () => ({
|
|
522
|
-
conversion:
|
|
522
|
+
conversion: Dt,
|
|
523
523
|
priority: 0
|
|
524
524
|
})
|
|
525
525
|
})
|
|
@@ -527,7 +527,7 @@ var Et = class extends ElementNode {
|
|
|
527
527
|
}
|
|
528
528
|
constructor(t = "number", e = 1, n) {
|
|
529
529
|
super(n);
|
|
530
|
-
const r =
|
|
530
|
+
const r = wt[t] || t;
|
|
531
531
|
this.__listType = r, this.__tag = "number" === r ? "ol" : "ul", this.__start = e;
|
|
532
532
|
}
|
|
533
533
|
afterCloneFrom(t) {
|
|
@@ -552,10 +552,10 @@ var Et = class extends ElementNode {
|
|
|
552
552
|
}
|
|
553
553
|
createDOM(t, e) {
|
|
554
554
|
const n = this.__tag, r = $getDocument().createElement(n);
|
|
555
|
-
return 1 !== this.__start && r.setAttribute("start", String(this.__start)), r.__lexicalListType = this.__listType,
|
|
555
|
+
return 1 !== this.__start && r.setAttribute("start", String(this.__start)), r.__lexicalListType = this.__listType, Et(r, t.theme, this), r;
|
|
556
556
|
}
|
|
557
557
|
updateDOM(t, e, n) {
|
|
558
|
-
return t.__tag !== this.__tag || t.__listType !== this.__listType || (
|
|
558
|
+
return t.__tag !== this.__tag || t.__listType !== this.__listType || (Et(e, n.theme, this), t.__start !== this.__start && e.setAttribute("start", String(this.__start)), !1);
|
|
559
559
|
}
|
|
560
560
|
updateFromJSON(t) {
|
|
561
561
|
return super.updateFromJSON(t).setListType(t.listType).setStart(t.start);
|
|
@@ -582,21 +582,21 @@ var Et = class extends ElementNode {
|
|
|
582
582
|
let r = n;
|
|
583
583
|
for (let t = 0; t < n.length; t++) {
|
|
584
584
|
const e = n[t];
|
|
585
|
-
|
|
585
|
+
Ot(e) || (r === n && (r = [...n]), r[t] = this.createListItemNode().append(!$isElementNode(e) || $t(e) || e.isInline() ? e : $createTextNode(e.getTextContent())));
|
|
586
586
|
}
|
|
587
587
|
return super.splice(t, e, r);
|
|
588
588
|
}
|
|
589
589
|
extractWithChild(t) {
|
|
590
|
-
return
|
|
590
|
+
return Ot(t);
|
|
591
591
|
}
|
|
592
592
|
createListItemNode() {
|
|
593
|
-
return
|
|
593
|
+
return At();
|
|
594
594
|
}
|
|
595
595
|
};
|
|
596
|
-
function
|
|
596
|
+
function Et(t, e, n) {
|
|
597
597
|
const r = [], i = [], s = e.list;
|
|
598
598
|
if (void 0 !== s) {
|
|
599
|
-
const t = s[`${n.__tag}Depth`] || [], e =
|
|
599
|
+
const t = s[`${n.__tag}Depth`] || [], e = ht(n) - 1, o = e % t.length, l = t[o], c = s[n.__tag];
|
|
600
600
|
let a;
|
|
601
601
|
const u = s.nested, g = s.checklist;
|
|
602
602
|
if (void 0 !== u && u.list && (a = u.list), void 0 !== c && r.push(c), void 0 !== g && "check" === n.__listType && r.push(g), void 0 !== l) {
|
|
@@ -610,28 +610,28 @@ function Dt(t, e, n) {
|
|
|
610
610
|
}
|
|
611
611
|
i.length > 0 && removeClassNamesFromElement(t, ...i), r.length > 0 && addClassNamesToElement(t, ...r);
|
|
612
612
|
}
|
|
613
|
-
function
|
|
613
|
+
function Dt(t) {
|
|
614
614
|
let e;
|
|
615
615
|
if (function(t) {
|
|
616
616
|
return isHTMLElement(t) && "ol" === t.nodeName.toLowerCase();
|
|
617
617
|
}(t)) {
|
|
618
618
|
const n = t.start;
|
|
619
|
-
e =
|
|
619
|
+
e = Mt("number", n);
|
|
620
620
|
} else e = function(t) {
|
|
621
621
|
if ("check" === t.getAttribute("__lexicallisttype") || t.classList.contains("contains-task-list") || "1" === t.getAttribute("data-is-checklist")) return !0;
|
|
622
622
|
for (const e of t.childNodes) if (isHTMLElement(e) && e.hasAttribute("aria-checked")) return !0;
|
|
623
623
|
return !1;
|
|
624
|
-
}(t) ?
|
|
624
|
+
}(t) ? Mt("check") : Mt("bullet");
|
|
625
625
|
return $setDirectionFromDOM(e, t), {
|
|
626
626
|
after: (t) => function(t, e) {
|
|
627
627
|
const n = e.createListItemNode.bind(e), r = [];
|
|
628
628
|
for (let e = 0; e < t.length; e++) {
|
|
629
629
|
const i = t[e];
|
|
630
|
-
if (
|
|
630
|
+
if (Ot(i)) {
|
|
631
631
|
r.push(i);
|
|
632
632
|
const t = i.getChildren();
|
|
633
633
|
t.length > 1 && t.forEach((t) => {
|
|
634
|
-
|
|
634
|
+
$t(t) && r.push(n().append(t));
|
|
635
635
|
});
|
|
636
636
|
} else r.push(n().append(i));
|
|
637
637
|
}
|
|
@@ -640,18 +640,18 @@ function wt(t) {
|
|
|
640
640
|
node: e
|
|
641
641
|
};
|
|
642
642
|
}
|
|
643
|
-
const
|
|
643
|
+
const wt = {
|
|
644
644
|
ol: "number",
|
|
645
645
|
ul: "bullet"
|
|
646
646
|
};
|
|
647
|
-
function
|
|
648
|
-
return $applyNodeReplacement(new
|
|
647
|
+
function Mt(t = "number", e = 1) {
|
|
648
|
+
return $applyNodeReplacement(new It(t, e));
|
|
649
649
|
}
|
|
650
|
-
function
|
|
651
|
-
return t instanceof
|
|
650
|
+
function $t(t) {
|
|
651
|
+
return t instanceof It;
|
|
652
652
|
}
|
|
653
|
-
const
|
|
654
|
-
function
|
|
653
|
+
const Rt = /* @__PURE__ */ createCommand("INSERT_CHECK_LIST_COMMAND");
|
|
654
|
+
function Kt(t, e) {
|
|
655
655
|
const i = e && e.disableTakeFocusOnClick || !1, s = "boolean" == typeof i ? () => i : i.peek.bind(i), o = (t) => {
|
|
656
656
|
const e = t.target;
|
|
657
657
|
if (!isHTMLElement(e)) return !1;
|
|
@@ -661,24 +661,24 @@ function Bt(t, e) {
|
|
|
661
661
|
const e = t.target;
|
|
662
662
|
isHTMLElement(e) && (e.__lexicalCheckListLastHandled = t.timeStamp);
|
|
663
663
|
}, a = (t) => {
|
|
664
|
-
o(t) || (l(t),
|
|
664
|
+
o(t) || (l(t), Wt(t, s()));
|
|
665
665
|
}, u = (t) => {
|
|
666
|
-
"touch" === t.pointerType && (o(t) || (l(t),
|
|
666
|
+
"touch" === t.pointerType && (o(t) || (l(t), Wt(t, s())));
|
|
667
667
|
}, g = (t) => {
|
|
668
668
|
(function(t, e) {
|
|
669
|
-
|
|
669
|
+
Bt(t, () => {
|
|
670
670
|
t.preventDefault(), e && t.stopPropagation();
|
|
671
671
|
});
|
|
672
672
|
})(t, s());
|
|
673
673
|
};
|
|
674
|
-
return mergeRegister(t.registerCommand(
|
|
675
|
-
if (null !=
|
|
674
|
+
return mergeRegister(t.registerCommand(Rt, () => (_t("check"), !0), COMMAND_PRIORITY_LOW), t.registerCommand(KEY_ARROW_DOWN_COMMAND, (e) => Jt(e, t, !1), COMMAND_PRIORITY_LOW), t.registerCommand(KEY_ARROW_UP_COMMAND, (e) => Jt(e, t, !0), COMMAND_PRIORITY_LOW), t.registerCommand(KEY_ESCAPE_COMMAND, () => {
|
|
675
|
+
if (null != Ut(t)) return t.getRootElement()?.focus(), !0;
|
|
676
676
|
return !1;
|
|
677
677
|
}, COMMAND_PRIORITY_LOW), t.registerCommand(KEY_SPACE_COMMAND, (e) => {
|
|
678
|
-
const n =
|
|
678
|
+
const n = Ut(t);
|
|
679
679
|
return !(null == n || !t.isEditable()) && (t.update(() => {
|
|
680
680
|
const t = $getNearestNodeFromDOMNode(n);
|
|
681
|
-
|
|
681
|
+
Ot(t) && (e.preventDefault(), t.toggleChecked());
|
|
682
682
|
}), !0);
|
|
683
683
|
}, COMMAND_PRIORITY_LOW), t.registerCommand(KEY_ARROW_LEFT_COMMAND, (e) => t.read("latest", () => {
|
|
684
684
|
const i = $getSelection();
|
|
@@ -686,9 +686,9 @@ function Bt(t, e) {
|
|
|
686
686
|
const { anchor: n } = i, r = "element" === n.type;
|
|
687
687
|
if (r || 0 === n.offset) {
|
|
688
688
|
const i = n.getNode(), s = $findMatchingParent(i, (t) => $isElementNode(t) && !t.isInline());
|
|
689
|
-
if (
|
|
689
|
+
if (Ot(s)) {
|
|
690
690
|
const n = s.getParent();
|
|
691
|
-
if (
|
|
691
|
+
if ($t(n) && "check" === n.getListType() && (r || s.getFirstDescendant() === i)) {
|
|
692
692
|
const n = t.getElementByKey(s.__key);
|
|
693
693
|
if (null != n && getActiveElement(n) !== n) return n.focus(), e.preventDefault(), !0;
|
|
694
694
|
}
|
|
@@ -709,7 +709,7 @@ function Bt(t, e) {
|
|
|
709
709
|
}));
|
|
710
710
|
}));
|
|
711
711
|
}
|
|
712
|
-
function
|
|
712
|
+
function Bt(t, n) {
|
|
713
713
|
const r = t.target;
|
|
714
714
|
if (!isHTMLElement(r)) return;
|
|
715
715
|
const i = r.firstChild;
|
|
@@ -726,32 +726,32 @@ function Wt(t, n) {
|
|
|
726
726
|
const c = r.getBoundingClientRect(), a = o / calculateZoomLevel(r), u = r.ownerDocument.defaultView, g = u ? u.getComputedStyle(r, "::before") : { width: "0px" }, h = parseFloat(g.width), f = "touch" === l || "pointerType" in t && "touch" === t.pointerType ? 32 : 0;
|
|
727
727
|
("rtl" === r.dir ? a < c.right + f && a > c.right - h - f : a > c.left - f && a < c.left + h + f) && n();
|
|
728
728
|
}
|
|
729
|
-
function
|
|
730
|
-
|
|
729
|
+
function Wt(t, e) {
|
|
730
|
+
Bt(t, () => {
|
|
731
731
|
if (isHTMLElement(t.target)) {
|
|
732
732
|
const n = t.target, r = getNearestEditorFromDOMNode(n);
|
|
733
733
|
null != r && r.isEditable() && r.update(() => {
|
|
734
734
|
const t = $getNearestNodeFromDOMNode(n);
|
|
735
|
-
|
|
735
|
+
Ot(t) && (e ? ($addUpdateTag(SKIP_SELECTION_FOCUS_TAG), $addUpdateTag(SKIP_DOM_SELECTION_TAG)) : n.focus(), t.toggleChecked());
|
|
736
736
|
});
|
|
737
737
|
}
|
|
738
738
|
});
|
|
739
739
|
}
|
|
740
|
-
function
|
|
740
|
+
function Ut(t) {
|
|
741
741
|
const e = t.getRootElement(), n = e ? getActiveElement(e) : null;
|
|
742
742
|
return isHTMLElement(n) && "LI" === n.tagName && null != n.parentNode && "check" === n.parentNode.__lexicalListType ? n : null;
|
|
743
743
|
}
|
|
744
|
-
function
|
|
745
|
-
const r =
|
|
744
|
+
function Jt(t, e, n) {
|
|
745
|
+
const r = Ut(e);
|
|
746
746
|
return null != r && e.update(() => {
|
|
747
747
|
const i = $getNearestNodeFromDOMNode(r);
|
|
748
|
-
if (!
|
|
748
|
+
if (!Ot(i)) return;
|
|
749
749
|
const s = function(t, e) {
|
|
750
750
|
let n = e ? t.getPreviousSibling() : t.getNextSibling(), r = t;
|
|
751
|
-
for (; null == n &&
|
|
752
|
-
for (;
|
|
751
|
+
for (; null == n && Ot(r);) r = r.getParentOrThrow().getParent(), null != r && (n = e ? r.getPreviousSibling() : r.getNextSibling());
|
|
752
|
+
for (; Ot(n);) {
|
|
753
753
|
const t = e ? n.getLastChild() : n.getFirstChild();
|
|
754
|
-
if (
|
|
754
|
+
if (!$t(t)) return n;
|
|
755
755
|
n = e ? t.getLastChild() : t.getFirstChild();
|
|
756
756
|
}
|
|
757
757
|
return null;
|
|
@@ -765,31 +765,31 @@ function Vt(t, e, n) {
|
|
|
765
765
|
}
|
|
766
766
|
}), !1;
|
|
767
767
|
}
|
|
768
|
-
function
|
|
768
|
+
function Vt(t) {
|
|
769
769
|
const e = [];
|
|
770
|
-
for (const n of t) if (
|
|
770
|
+
for (const n of t) if (Ot(n)) {
|
|
771
771
|
e.push(n);
|
|
772
772
|
const t = n.getChildren();
|
|
773
|
-
if (t.length > 1) for (const n of t)
|
|
774
|
-
} else e.push(
|
|
773
|
+
if (t.length > 1) for (const n of t) $t(n) && e.push(At().append(n));
|
|
774
|
+
} else e.push(At().append(n));
|
|
775
775
|
return e;
|
|
776
776
|
}
|
|
777
|
-
const
|
|
777
|
+
const qt = /* @__PURE__ */ defineImportRule({
|
|
778
778
|
$import: (t, e) => {
|
|
779
779
|
let n;
|
|
780
780
|
var r;
|
|
781
|
-
return isElementOfTag(e, "ol") ? n =
|
|
781
|
+
return isElementOfTag(e, "ol") ? n = Mt("number", e.start) : n = (r = e).matches("[__lexicallisttype=\"check\"], .contains-task-list, [data-is-checklist=\"1\"]") || null !== r.querySelector(":scope > [aria-checked]") ? Mt("check") : Mt("bullet"), $setDirectionFromDOM(n, e), [n.splice(0, 0, $propagateTextAlignToBlockChildren(Vt(t.$importChildren(e)), e))];
|
|
782
782
|
},
|
|
783
783
|
match: sel.tag("ol", "ul"),
|
|
784
784
|
name: "@lexical/list/list"
|
|
785
785
|
});
|
|
786
|
-
function
|
|
786
|
+
function zt(t, e) {
|
|
787
787
|
if (1 !== e.length) return e;
|
|
788
788
|
const n = e[0];
|
|
789
789
|
return $isParagraphNode(n) && !t.getFormatType() && n.getFormatType() ? (t.setFormat(n.getFormatType()), n.getChildren()) : e;
|
|
790
790
|
}
|
|
791
|
-
function
|
|
792
|
-
const e = (t) => $isBlockLevel(t) &&
|
|
791
|
+
function jt(t) {
|
|
792
|
+
const e = (t) => $isBlockLevel(t) && !$t(t);
|
|
793
793
|
if (!t.some(e)) return t;
|
|
794
794
|
const n = [];
|
|
795
795
|
let r = [];
|
|
@@ -802,30 +802,30 @@ function Ht(t) {
|
|
|
802
802
|
for (const t of n) s.length > 0 && s.push($createLineBreakNode()), s.push(...t);
|
|
803
803
|
return s;
|
|
804
804
|
}
|
|
805
|
-
const
|
|
805
|
+
const Ht = /* @__PURE__ */ defineImportRule({
|
|
806
806
|
$import: (t, e) => {
|
|
807
|
-
const n = e.getAttribute("aria-checked"), r =
|
|
808
|
-
return $setFormatFromDOM(r, e), $setDirectionFromDOM(r, e), [r.splice(0, 0,
|
|
807
|
+
const n = e.getAttribute("aria-checked"), r = At("true" === n || "false" !== n && void 0);
|
|
808
|
+
return $setFormatFromDOM(r, e), $setDirectionFromDOM(r, e), [r.splice(0, 0, jt(zt(r, t.$importChildren(e))))];
|
|
809
809
|
},
|
|
810
810
|
match: sel.tag("li"),
|
|
811
811
|
name: "@lexical/list/li"
|
|
812
812
|
});
|
|
813
|
-
function
|
|
813
|
+
function Xt(t, e, n) {
|
|
814
814
|
const r = isElementOfTag(n, "input") ? n : n.querySelector("input[type=\"checkbox\"]");
|
|
815
815
|
if (!r || "checkbox" !== r.getAttribute("type")) return [];
|
|
816
|
-
const i =
|
|
817
|
-
return $setFormatFromDOM(i, e), $setDirectionFromDOM(i, e), [i.splice(0, 0,
|
|
816
|
+
const i = At(r.hasAttribute("checked"));
|
|
817
|
+
return $setFormatFromDOM(i, e), $setDirectionFromDOM(i, e), [i.splice(0, 0, jt(zt(i, t.$importChildren(e))))];
|
|
818
818
|
}
|
|
819
|
-
const
|
|
820
|
-
$accepts: (t) =>
|
|
821
|
-
$packageRun: (t) => [
|
|
819
|
+
const Gt = {
|
|
820
|
+
$accepts: (t) => Ot(t) || $t(t),
|
|
821
|
+
$packageRun: (t) => [At().splice(0, 0, t)],
|
|
822
822
|
name: "ListSchema"
|
|
823
823
|
};
|
|
824
|
-
const
|
|
824
|
+
const Qt = [
|
|
825
825
|
/* @__PURE__ */ defineImportRule({
|
|
826
826
|
$import: (t, e, n) => {
|
|
827
827
|
const r = e.querySelector(":scope > input[type=\"checkbox\"]");
|
|
828
|
-
return r ?
|
|
828
|
+
return r ? Xt(t, e, r) : n();
|
|
829
829
|
},
|
|
830
830
|
match: sel.tag("li").classAll("task-list-item"),
|
|
831
831
|
name: "@lexical/list/li-task-list-item"
|
|
@@ -835,52 +835,36 @@ const Yt = [
|
|
|
835
835
|
const r = e.querySelector(":scope > .checkbox-wrapper");
|
|
836
836
|
if (!r) return n();
|
|
837
837
|
const i = r.querySelector(":scope > input[type=\"checkbox\"]");
|
|
838
|
-
return i ?
|
|
838
|
+
return i ? Xt(t, e, i) : n();
|
|
839
839
|
},
|
|
840
840
|
match: sel.tag("li").classAll("joplin-checkbox"),
|
|
841
841
|
name: "@lexical/list/li-joplin-checkbox"
|
|
842
842
|
}),
|
|
843
|
-
|
|
844
|
-
|
|
843
|
+
qt,
|
|
844
|
+
Ht
|
|
845
845
|
];
|
|
846
|
-
const
|
|
847
|
-
const
|
|
848
|
-
const
|
|
849
|
-
const
|
|
850
|
-
function
|
|
851
|
-
return mergeRegister(t.registerCommand(
|
|
846
|
+
const Yt = /* @__PURE__ */ createCommand("UPDATE_LIST_START_COMMAND");
|
|
847
|
+
const Zt = /* @__PURE__ */ createCommand("INSERT_UNORDERED_LIST_COMMAND");
|
|
848
|
+
const te = /* @__PURE__ */ createCommand("INSERT_ORDERED_LIST_COMMAND");
|
|
849
|
+
const ee = /* @__PURE__ */ createCommand("REMOVE_LIST_COMMAND");
|
|
850
|
+
function ne(t, e) {
|
|
851
|
+
return mergeRegister(t.registerCommand(te, () => (_t("number"), !0), COMMAND_PRIORITY_LOW), t.registerCommand(Yt, (t) => {
|
|
852
852
|
const { listNodeKey: e, newStart: n } = t, r = $getNodeByKey(e);
|
|
853
|
-
return
|
|
854
|
-
}, COMMAND_PRIORITY_LOW), t.registerCommand(
|
|
855
|
-
if (function() {
|
|
856
|
-
const t = $getSelection();
|
|
857
|
-
if (!$isRangeSelection(t) || !t.isCollapsed() || 0 !== t.anchor.offset) return !1;
|
|
858
|
-
const e = t.anchor.getNode(), i = $findMatchingParent(e, It);
|
|
859
|
-
if (!It(i)) return !1;
|
|
860
|
-
const s = i.getFirstDescendant();
|
|
861
|
-
if (null === s) return !1;
|
|
862
|
-
if (!i.is(e) && !s.is(e)) return !1;
|
|
863
|
-
const l = i.getParent();
|
|
864
|
-
if (!Rt(l) || !i.is(l.getFirstChild())) return !1;
|
|
865
|
-
const c = l.getPreviousSibling();
|
|
866
|
-
if (!$isDecoratorNode(c) || c.isIsolated() || !c.isKeyboardSelectable() && c.isInline()) return !1;
|
|
867
|
-
const a = $createParagraphNode().append(...i.getChildren());
|
|
868
|
-
l.insertBefore(a), i.remove(), l.isEmpty() && l.remove();
|
|
869
|
-
return a.selectStart(), !0;
|
|
870
|
-
}()) return t.preventDefault(), !0;
|
|
853
|
+
return !!$t(r) && ("number" === r.getListType() && (r.setStart(n), St(r)), !0);
|
|
854
|
+
}, COMMAND_PRIORITY_LOW), t.registerCommand(Zt, () => (_t("bullet"), !0), COMMAND_PRIORITY_LOW), t.registerCommand(ee, () => (bt(), !0), COMMAND_PRIORITY_LOW), t.registerCommand(INSERT_PARAGRAPH_COMMAND, () => xt(!!(e && e.restoreNumbering)), COMMAND_PRIORITY_LOW), t.registerCommand(KEY_BACKSPACE_COMMAND, (t) => {
|
|
871
855
|
const e = $getSelection();
|
|
872
856
|
if (!$isRangeSelection(e) || !e.isCollapsed()) return !1;
|
|
873
857
|
const { anchor: i } = e;
|
|
874
858
|
if (0 !== i.offset) return !1;
|
|
875
859
|
let s = i.getNode();
|
|
876
|
-
for (; !
|
|
860
|
+
for (; !Ot(s);) {
|
|
877
861
|
if (null !== s.getPreviousSibling()) return !1;
|
|
878
862
|
const t = s.getParent();
|
|
879
863
|
if (null === t) return !1;
|
|
880
864
|
s = t;
|
|
881
865
|
}
|
|
882
|
-
return !(!
|
|
883
|
-
}, COMMAND_PRIORITY_BEFORE_EDITOR), t.registerNodeTransform(
|
|
866
|
+
return !(!Ot(s) || !s.collapseAtStart(e)) && (t.preventDefault(), !0);
|
|
867
|
+
}, COMMAND_PRIORITY_BEFORE_EDITOR), t.registerNodeTransform(Nt, (t) => {
|
|
884
868
|
const e = t.getFirstChild();
|
|
885
869
|
if (e) {
|
|
886
870
|
if ($isTextNode(e)) {
|
|
@@ -893,75 +877,75 @@ function re(t, e) {
|
|
|
893
877
|
}
|
|
894
878
|
}), t.registerNodeTransform(TextNode, (t) => {
|
|
895
879
|
const e = t.getParent();
|
|
896
|
-
if (
|
|
880
|
+
if (Ot(e) && t.is(e.getFirstChild())) {
|
|
897
881
|
const n = t.getStyle(), r = t.getFormat();
|
|
898
882
|
n === e.getTextStyle() && r === e.getTextFormat() || e.setTextStyle(n).setTextFormat(r);
|
|
899
883
|
}
|
|
900
884
|
}));
|
|
901
885
|
}
|
|
902
|
-
function
|
|
886
|
+
function re(t) {
|
|
903
887
|
const e = (t) => {
|
|
904
888
|
const e = t.getParent();
|
|
905
|
-
if (
|
|
906
|
-
const n = $findMatchingParent(t, (t) =>
|
|
889
|
+
if ($t(t.getFirstChild()) || !$t(e)) return;
|
|
890
|
+
const n = $findMatchingParent(t, (t) => Ot(t) && $t(t.getParent()) && Ot(t.getPreviousSibling()));
|
|
907
891
|
if (null === n && t.getIndent() > 0) t.setIndent(0);
|
|
908
|
-
else if (
|
|
892
|
+
else if (Ot(n)) {
|
|
909
893
|
const r = n.getPreviousSibling();
|
|
910
|
-
if (
|
|
894
|
+
if (Ot(r)) {
|
|
911
895
|
const i = function(t) {
|
|
912
896
|
let e = t, n = e.getFirstChild();
|
|
913
|
-
for (;
|
|
897
|
+
for (; $t(n);) {
|
|
914
898
|
const t = n.getLastChild();
|
|
915
|
-
if (!
|
|
899
|
+
if (!Ot(t)) break;
|
|
916
900
|
e = t, n = e.getFirstChild();
|
|
917
901
|
}
|
|
918
902
|
return e;
|
|
919
903
|
}(r).getParent();
|
|
920
|
-
if (
|
|
921
|
-
const n =
|
|
922
|
-
n + 1 <
|
|
904
|
+
if ($t(i)) {
|
|
905
|
+
const n = ht(i);
|
|
906
|
+
n + 1 < ht(e) && t.setIndent(n);
|
|
923
907
|
}
|
|
924
908
|
}
|
|
925
909
|
}
|
|
926
910
|
};
|
|
927
|
-
return t.registerNodeTransform(
|
|
911
|
+
return t.registerNodeTransform(It, (t) => {
|
|
928
912
|
const n = [t];
|
|
929
913
|
for (; n.length > 0;) {
|
|
930
914
|
const t = n.shift();
|
|
931
|
-
if (
|
|
932
|
-
for (const r of t.getChildren()) if (
|
|
915
|
+
if ($t(t)) {
|
|
916
|
+
for (const r of t.getChildren()) if (Ot(r)) {
|
|
933
917
|
e(r);
|
|
934
918
|
const t = r.getFirstChild();
|
|
935
|
-
|
|
919
|
+
$t(t) && n.push(t);
|
|
936
920
|
}
|
|
937
921
|
}
|
|
938
922
|
}
|
|
939
923
|
});
|
|
940
924
|
}
|
|
941
|
-
const
|
|
925
|
+
const ie = /* @__PURE__ */ defineExtension({
|
|
942
926
|
build: (t, e, n) => namedSignals(e),
|
|
943
927
|
config: /* @__PURE__ */ safeCast({
|
|
944
928
|
hasStrictIndent: !1,
|
|
945
929
|
shouldPreserveNumbering: !1
|
|
946
930
|
}),
|
|
947
|
-
dependencies: [CoreImportExtension, /* @__PURE__ */ configExtension(DOMImportExtension, { rules:
|
|
931
|
+
dependencies: [CoreImportExtension, /* @__PURE__ */ configExtension(DOMImportExtension, { rules: Qt })],
|
|
948
932
|
name: "@lexical/list/List",
|
|
949
|
-
nodes: () => [
|
|
933
|
+
nodes: () => [It, Nt],
|
|
950
934
|
register(t, e, n) {
|
|
951
935
|
const r = n.getOutput();
|
|
952
|
-
return mergeRegister(effect(() =>
|
|
936
|
+
return mergeRegister(effect(() => ne(t, { restoreNumbering: r.shouldPreserveNumbering.value })), effect(() => r.hasStrictIndent.value ? re(t) : void 0));
|
|
953
937
|
}
|
|
954
938
|
});
|
|
955
|
-
const
|
|
939
|
+
const se = /* @__PURE__ */ defineExtension({
|
|
956
940
|
build: (t, e) => namedSignals(e),
|
|
957
941
|
config: /* @__PURE__ */ safeCast({ disableTakeFocusOnClick: !1 }),
|
|
958
|
-
dependencies: [
|
|
942
|
+
dependencies: [ie],
|
|
959
943
|
name: "@lexical/list/CheckList",
|
|
960
|
-
register: (t, e, n) =>
|
|
944
|
+
register: (t, e, n) => Kt(t, n.getOutput())
|
|
961
945
|
});
|
|
962
|
-
const
|
|
963
|
-
dependencies: [
|
|
946
|
+
const oe = /* @__PURE__ */ defineExtension({
|
|
947
|
+
dependencies: [ie],
|
|
964
948
|
name: "@lexical/list/Import"
|
|
965
949
|
});
|
|
966
950
|
//#endregion
|
|
967
|
-
export {
|
|
951
|
+
export { At as $createListItemNode, Mt as $createListNode, ht as $getListDepth, xt as $handleListInsertParagraph, _t as $insertList, Ot as $isListItemNode, $t as $isListNode, bt as $removeList, se as CheckListExtension, Rt as INSERT_CHECK_LIST_COMMAND, te as INSERT_ORDERED_LIST_COMMAND, Zt as INSERT_UNORDERED_LIST_COMMAND, ie as ListExtension, oe as ListImportExtension, Qt as ListImportRules, Nt as ListItemNode, It as ListNode, Gt as ListSchema, ee as REMOVE_LIST_COMMAND, Yt as UPDATE_LIST_START_COMMAND, Kt as registerCheckList, ne as registerList, re as registerListStrictIndentTransform };
|