@mx-space/cli 0.13.0 → 0.13.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +23 -1
- package/dist/{Lexical.dev-By5dOKBN.mjs → Lexical.dev-BsbWMhb3.mjs} +2265 -429
- package/dist/{Lexical.node-fXM8Jp7p.mjs → Lexical.node-DnR_u_Ke.mjs} +47 -10
- package/dist/Lexical.prod-B7L8eVsO.mjs +6816 -0
- package/dist/{LexicalClipboard.dev--HxGoSkO.mjs → LexicalClipboard.dev-BGSFbuTA.mjs} +131 -39
- package/dist/{LexicalClipboard.node-C3mRbrmW.mjs → LexicalClipboard.node-CUD_tpWb.mjs} +2 -2
- package/dist/LexicalClipboard.prod-DQXfRt3h.mjs +429 -0
- package/dist/{LexicalCodeCore.dev-DjSrd4A4.mjs → LexicalCodeCore.dev-B9lK_GSN.mjs} +81 -67
- package/dist/LexicalCodeCore.prod-CNWMPXhg.mjs +651 -0
- package/dist/LexicalDragon.dev-DRm2bGZ1.mjs +186 -0
- package/dist/{LexicalDragon.node-BVhw4C7s.mjs → LexicalDragon.node-d8gPruly.mjs} +3 -2
- package/dist/LexicalDragon.prod-ey3uKDJF.mjs +121 -0
- package/dist/{LexicalExtension.dev-BPNyvGqe.mjs → LexicalExtension.dev-CXtOJb83.mjs} +349 -35
- package/dist/{LexicalExtension.node-BVlcrgOx.mjs → LexicalExtension.node-CMsupJZs.mjs} +9 -4
- package/dist/{LexicalExtension.prod-DFKbiNt-.mjs → LexicalExtension.prod-BCLGhzcg.mjs} +477 -328
- package/dist/{LexicalHeadless.dev-B-cj7Pr5.mjs → LexicalHeadless.dev-yVDOBd64.mjs} +2 -2
- package/dist/{LexicalHeadless.prod-Byp1vNzT.mjs → LexicalHeadless.prod-B8qauuEA.mjs} +2 -2
- package/dist/{LexicalHtml.dev-prBAwszN.mjs → LexicalHtml.dev-3rdckXIU.mjs} +323 -265
- package/dist/{LexicalHtml.node-BvNF96jZ.mjs → LexicalHtml.node-DagZUjQ_.mjs} +6 -4
- package/dist/{LexicalHtml.prod-Sz3CW1ht.mjs → LexicalHtml.prod-B5AQaJDb.mjs} +354 -352
- package/dist/{LexicalLink.dev-NySTYhVR.mjs → LexicalLink.dev-CspSwLNB.mjs} +69 -58
- package/dist/{LexicalLink.prod-BuCM8gts.mjs → LexicalLink.prod-Da-ZW6H5.mjs} +210 -211
- package/dist/{LexicalList.dev-DIMOvSFD.mjs → LexicalList.dev-CNXmV6v8.mjs} +246 -198
- package/dist/LexicalList.prod-DgQzj4v9.mjs +944 -0
- package/dist/{LexicalMarkdown.dev-C7aylvCG.mjs → LexicalMarkdown.dev-0XURdo96.mjs} +129 -37
- package/dist/LexicalMarkdown.prod-qUsIQfJx.mjs +932 -0
- package/dist/{LexicalRichText.dev-DfICq6lU.mjs → LexicalRichText.dev-BqsEA7I9.mjs} +151 -122
- package/dist/{LexicalRichText.node-Bg9jND3Q.mjs → LexicalRichText.node-D73RR0Ck.mjs} +8 -11
- package/dist/LexicalRichText.prod-4Atyd7OR.mjs +538 -0
- package/dist/{LexicalSelection.dev-DGjj12wW.mjs → LexicalSelection.dev-DK5xfxKP.mjs} +10 -9
- package/dist/{LexicalSelection.node-BU5L4193.mjs → LexicalSelection.node-pyZyrANz.mjs} +4 -4
- package/dist/{LexicalSelection.prod-D-PwRbyK.mjs → LexicalSelection.prod-C5GrCbDC.mjs} +144 -146
- package/dist/{LexicalTable.dev-ChP7cugd.mjs → LexicalTable.dev-DiR_4rdI.mjs} +184 -119
- package/dist/LexicalTable.prod-Cbc5EasT.mjs +2336 -0
- package/dist/{LexicalUtils.dev-BiFU3789.mjs → LexicalUtils.dev-jhPjn1vQ.mjs} +375 -35
- package/dist/{LexicalUtils.node-j3Llm7Y3.mjs → LexicalUtils.node-Ck74ludK.mjs} +24 -12
- package/dist/LexicalUtils.prod-nuTBxnk_.mjs +504 -0
- package/dist/bin/mxs.mjs +1 -1
- package/dist/esm-BumPuCXw.mjs +2 -0
- package/dist/{esm-lpolVSUJ.mjs → esm-DupC6TTP.mjs} +172 -172
- package/dist/index.d.mts +16 -16
- package/dist/index.mjs +1 -1
- package/dist/{mxs-PFV8OJ-M.mjs → mxs-BgAyMQdq.mjs} +1595 -314
- package/package.json +17 -17
- package/dist/Lexical.prod-BlCvXPGa.mjs +0 -6088
- package/dist/LexicalClipboard.prod-DNJzFMcT.mjs +0 -371
- package/dist/LexicalCodeCore.prod-DTDShkR3.mjs +0 -642
- package/dist/LexicalDragon.dev-DwprRH0z.mjs +0 -88
- package/dist/LexicalDragon.prod-nh4J-8vn.mjs +0 -59
- package/dist/LexicalList.prod-MVqfA6Vo.mjs +0 -925
- package/dist/LexicalMarkdown.prod-CfQSM406.mjs +0 -868
- package/dist/LexicalRichText.prod-GsFzCK-o.mjs +0 -550
- package/dist/LexicalTable.prod-Bpr9YRXp.mjs +0 -2311
- package/dist/LexicalUtils.prod-DCvrA78p.mjs +0 -373
- package/dist/esm-DGvoYR6n.mjs +0 -2
|
@@ -1,925 +0,0 @@
|
|
|
1
|
-
import { f as namedSignals, l as effect } from "./LexicalExtension.node-BVlcrgOx.mjs";
|
|
2
|
-
import { $ as $isElementNode, $t as ElementNode, An as KEY_ARROW_UP_COMMAND, Bt as COMMAND_PRIORITY_LOW, Ct as $setPointFromCaret, Dn as KEY_ARROW_DOWN_COMMAND, Fn as KEY_SPACE_COMMAND, L as $getNearestNodeFromDOMNode, Mr as setDOMStyleFromCSS, On as KEY_ARROW_LEFT_COMMAND, Pn as KEY_ESCAPE_COMMAND, R as $getNodeByKey, Sr as isHTMLElement, St as $setFormatFromDOM, U as $getSelection, W as $getSiblingCaret, Yn as SKIP_DOM_SELECTION_TAG, Zn as SKIP_SELECTION_FOCUS_TAG, _ as $createTextNode, c as $copyNode, cn as INSERT_PARAGRAPH_COMMAND, cr as defineExtension, dr as getNearestEditorFromDOMNode, er as TextNode, f as $createParagraphNode, ft as $isTextNode, ht as $normalizeCaret, ir as createCommand, jr as safeCast, k as $getChildCaret, kr as normalizeClassNames, lt as $isRootOrShadowRoot, n as $applyNodeReplacement, nr as buildImportMap, nt as $isLeafNode, ot as $isParagraphNode, pr as getStyleObjectFromCSS, rr as configExtension, st as $isRangeSelection, t as $addUpdateTag, xt as $setDirectionFromDOM, yt as $rewindSiblingCaret } from "./Lexical.node-fXM8Jp7p.mjs";
|
|
3
|
-
import { a as CoreImportExtension, g as sel, h as isElementOfTag, o as DOMImportExtension, p as defineImportRule } from "./LexicalHtml.node-BvNF96jZ.mjs";
|
|
4
|
-
import { _ as removeClassNamesFromElement, a as $getNearestNodeOfType, d as addClassNamesToElement, f as calculateZoomLevel, h as mergeRegister, l as $insertNodeToNearestRootAtCaret, m as isHTMLElement$1, r as $findMatchingParent } from "./LexicalUtils.node-j3Llm7Y3.mjs";
|
|
5
|
-
//#region ../../node_modules/.pnpm/@lexical+list@0.45.0/node_modules/@lexical/list/dist/LexicalList.prod.mjs
|
|
6
|
-
/**
|
|
7
|
-
* Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
8
|
-
*
|
|
9
|
-
* This source code is licensed under the MIT license found in the
|
|
10
|
-
* LICENSE file in the root directory of this source tree.
|
|
11
|
-
*
|
|
12
|
-
*/
|
|
13
|
-
function re(e, ...t) {
|
|
14
|
-
const n = new URL("https://lexical.dev/docs/error"), r = new URLSearchParams();
|
|
15
|
-
r.append("code", e);
|
|
16
|
-
for (const e of t) r.append("v", e);
|
|
17
|
-
throw n.search = r.toString(), Error(`Minified Lexical error #${e}; visit ${n.toString()} for the full message or use the non-minified dev environment for full errors and additional helpful warnings.`);
|
|
18
|
-
}
|
|
19
|
-
function ie(e) {
|
|
20
|
-
let t = 1, n = e.getParent();
|
|
21
|
-
for (; null != n;) {
|
|
22
|
-
if (be(n)) {
|
|
23
|
-
const e = n.getParent();
|
|
24
|
-
if (Pe(e)) {
|
|
25
|
-
t++, n = e.getParent();
|
|
26
|
-
continue;
|
|
27
|
-
}
|
|
28
|
-
re(40);
|
|
29
|
-
}
|
|
30
|
-
return t;
|
|
31
|
-
}
|
|
32
|
-
return t;
|
|
33
|
-
}
|
|
34
|
-
function se(e) {
|
|
35
|
-
let t = e.getParent();
|
|
36
|
-
Pe(t) || re(40);
|
|
37
|
-
let n = t;
|
|
38
|
-
for (; null !== n;) n = n.getParent(), Pe(n) && (t = n);
|
|
39
|
-
return t;
|
|
40
|
-
}
|
|
41
|
-
function oe(e) {
|
|
42
|
-
let t = [];
|
|
43
|
-
const n = e.getChildren().filter(be);
|
|
44
|
-
for (let e = 0; e < n.length; e++) {
|
|
45
|
-
const r = n[e], i = r.getFirstChild();
|
|
46
|
-
Pe(i) ? t = t.concat(oe(i)) : t.push(r);
|
|
47
|
-
}
|
|
48
|
-
return t;
|
|
49
|
-
}
|
|
50
|
-
function le(e) {
|
|
51
|
-
return be(e) && Pe(e.getFirstChild());
|
|
52
|
-
}
|
|
53
|
-
function ce(e, t) {
|
|
54
|
-
return be(e) && (0 === t.length || 1 === t.length && e.is(t[0]) && 0 === e.getChildrenSize());
|
|
55
|
-
}
|
|
56
|
-
function ae(e) {
|
|
57
|
-
const t = $getSelection();
|
|
58
|
-
if (null !== t) {
|
|
59
|
-
let n = t.getNodes();
|
|
60
|
-
if ($isRangeSelection(t)) {
|
|
61
|
-
const [r] = t.getStartEndPoints(), i = r.getNode(), s = i.getParent();
|
|
62
|
-
if ($isRootOrShadowRoot(i)) {
|
|
63
|
-
const e = i.getFirstChild();
|
|
64
|
-
if (e) n = e.selectStart().getNodes();
|
|
65
|
-
else {
|
|
66
|
-
const e = $createParagraphNode();
|
|
67
|
-
i.append(e), n = e.select().getNodes();
|
|
68
|
-
}
|
|
69
|
-
} else if (ce(i, n)) {
|
|
70
|
-
const t = Fe(e);
|
|
71
|
-
if ($isRootOrShadowRoot(s)) {
|
|
72
|
-
i.replace(t);
|
|
73
|
-
const e = Te();
|
|
74
|
-
$isElementNode(i) && (e.setFormat(i.getFormatType()), e.setIndent(i.getIndent())), t.append(e);
|
|
75
|
-
} else if (be(i)) {
|
|
76
|
-
const e = i.getParentOrThrow();
|
|
77
|
-
ue(t, e.getChildren()), e.replace(t);
|
|
78
|
-
}
|
|
79
|
-
return;
|
|
80
|
-
}
|
|
81
|
-
}
|
|
82
|
-
const r = /* @__PURE__ */ new Set();
|
|
83
|
-
for (let t = 0; t < n.length; t++) {
|
|
84
|
-
const i = n[t];
|
|
85
|
-
if ($isElementNode(i) && i.isEmpty() && !be(i) && !r.has(i.getKey())) {
|
|
86
|
-
ge(i, e);
|
|
87
|
-
continue;
|
|
88
|
-
}
|
|
89
|
-
let s = $isLeafNode(i) ? i.getParent() : be(i) && i.isEmpty() ? i : null;
|
|
90
|
-
for (; null != s;) {
|
|
91
|
-
const t = s.getKey();
|
|
92
|
-
if (Pe(s)) {
|
|
93
|
-
if (!r.has(t)) {
|
|
94
|
-
const n = Fe(e);
|
|
95
|
-
ue(n, s.getChildren()), s.replace(n), r.add(t);
|
|
96
|
-
}
|
|
97
|
-
break;
|
|
98
|
-
}
|
|
99
|
-
{
|
|
100
|
-
const n = s.getParent();
|
|
101
|
-
if ($isRootOrShadowRoot(n) && !r.has(t)) {
|
|
102
|
-
r.add(t), ge(s, e);
|
|
103
|
-
break;
|
|
104
|
-
}
|
|
105
|
-
s = n;
|
|
106
|
-
}
|
|
107
|
-
}
|
|
108
|
-
}
|
|
109
|
-
}
|
|
110
|
-
}
|
|
111
|
-
function ue(e, t) {
|
|
112
|
-
e.splice(e.getChildrenSize(), 0, t);
|
|
113
|
-
}
|
|
114
|
-
function ge(e, t) {
|
|
115
|
-
if (Pe(e)) return e;
|
|
116
|
-
const n = e.getPreviousSibling(), r = e.getNextSibling(), i = Te();
|
|
117
|
-
let s;
|
|
118
|
-
if (ue(i, e.getChildren()), Pe(n) && t === n.getListType()) n.append(i), Pe(r) && t === r.getListType() && (ue(n, r.getChildren()), r.remove()), s = n;
|
|
119
|
-
else if (Pe(r) && t === r.getListType()) r.getFirstChildOrThrow().insertBefore(i), s = r;
|
|
120
|
-
else {
|
|
121
|
-
const n = Fe(t);
|
|
122
|
-
n.append(i), e.replace(n), s = n;
|
|
123
|
-
}
|
|
124
|
-
i.setFormat(e.getFormatType()), i.setIndent(e.getIndent());
|
|
125
|
-
const o = $getSelection();
|
|
126
|
-
return $isRangeSelection(o) && (s.getKey() === o.anchor.key && o.anchor.set(i.getKey(), o.anchor.offset, "element"), s.getKey() === o.focus.key && o.focus.set(i.getKey(), o.focus.offset, "element")), e.remove(), s;
|
|
127
|
-
}
|
|
128
|
-
function he(e, t) {
|
|
129
|
-
const n = e.getLastChild(), r = t.getFirstChild();
|
|
130
|
-
n && r && le(n) && le(r) && (he(n.getFirstChild(), r.getFirstChild()), r.remove());
|
|
131
|
-
const i = t.getChildren();
|
|
132
|
-
i.length > 0 && e.append(...i), t.remove();
|
|
133
|
-
}
|
|
134
|
-
function de() {
|
|
135
|
-
const t = $getSelection();
|
|
136
|
-
if ($isRangeSelection(t)) {
|
|
137
|
-
const n = /* @__PURE__ */ new Set(), r = t.getNodes(), i = t.anchor.getNode();
|
|
138
|
-
if (ce(i, r)) n.add(se(i));
|
|
139
|
-
else for (let t = 0; t < r.length; t++) {
|
|
140
|
-
const i = r[t];
|
|
141
|
-
if ($isLeafNode(i)) {
|
|
142
|
-
const t = $getNearestNodeOfType(i, ye);
|
|
143
|
-
null != t && n.add(se(t));
|
|
144
|
-
}
|
|
145
|
-
}
|
|
146
|
-
for (const e of n) {
|
|
147
|
-
let n = e;
|
|
148
|
-
const r = oe(e);
|
|
149
|
-
for (const e of r) {
|
|
150
|
-
const r = $createParagraphNode().setTextStyle(t.style).setTextFormat(t.format);
|
|
151
|
-
ue(r, e.getChildren()), n.insertAfter(r), n = r, e.__key === t.anchor.key && $setPointFromCaret(t.anchor, $normalizeCaret($getChildCaret(r, "next"))), e.__key === t.focus.key && $setPointFromCaret(t.focus, $normalizeCaret($getChildCaret(r, "next"))), e.remove();
|
|
152
|
-
}
|
|
153
|
-
e.remove();
|
|
154
|
-
}
|
|
155
|
-
}
|
|
156
|
-
}
|
|
157
|
-
function fe(e) {
|
|
158
|
-
const t = "check" !== e.getListType();
|
|
159
|
-
let n = e.getStart();
|
|
160
|
-
for (const r of e.getChildren()) be(r) && (r.getValue() !== n && r.setValue(n), t && null != r.getLatest().__checked && r.setChecked(void 0), Pe(r.getFirstChild()) || n++);
|
|
161
|
-
}
|
|
162
|
-
function pe(e) {
|
|
163
|
-
const t = /* @__PURE__ */ new Set();
|
|
164
|
-
if (le(e) || t.has(e.getKey())) return;
|
|
165
|
-
const n = e.getParent(), r = e.getNextSibling(), i = e.getPreviousSibling();
|
|
166
|
-
if (le(r) && le(i)) {
|
|
167
|
-
const n = i.getFirstChild();
|
|
168
|
-
if (Pe(n)) {
|
|
169
|
-
n.append(e);
|
|
170
|
-
const i = r.getFirstChild();
|
|
171
|
-
if (Pe(i)) ue(n, i.getChildren()), r.remove(), t.add(r.getKey());
|
|
172
|
-
}
|
|
173
|
-
} else if (le(r)) {
|
|
174
|
-
const t = r.getFirstChild();
|
|
175
|
-
if (Pe(t)) {
|
|
176
|
-
const n = t.getFirstChild();
|
|
177
|
-
null !== n && n.insertBefore(e);
|
|
178
|
-
}
|
|
179
|
-
} else if (le(i)) {
|
|
180
|
-
const t = i.getFirstChild();
|
|
181
|
-
Pe(t) && t.append(e);
|
|
182
|
-
} else if (Pe(n)) {
|
|
183
|
-
const t = $copyNode(e), s = $copyNode(n);
|
|
184
|
-
t.append(s), s.append(e), i ? i.insertAfter(t) : r ? r.insertBefore(t) : n.append(t);
|
|
185
|
-
}
|
|
186
|
-
}
|
|
187
|
-
function me(e) {
|
|
188
|
-
if (le(e)) return;
|
|
189
|
-
const t = e.getParent(), n = t ? t.getParent() : void 0;
|
|
190
|
-
if (Pe(n ? n.getParent() : void 0) && be(n) && Pe(t)) {
|
|
191
|
-
const r = t ? t.getFirstChild() : void 0, i = t ? t.getLastChild() : void 0;
|
|
192
|
-
if (e.is(r)) n.insertBefore(e), t.isEmpty() && n.remove();
|
|
193
|
-
else if (e.is(i)) n.insertAfter(e), t.isEmpty() && n.remove();
|
|
194
|
-
else {
|
|
195
|
-
const r = $copyNode(e), i = $copyNode(t);
|
|
196
|
-
r.append(i), e.getPreviousSiblings().forEach((e) => i.append(e));
|
|
197
|
-
const s = $copyNode(e), o = $copyNode(t);
|
|
198
|
-
s.append(o), ue(o, e.getNextSiblings()), n.insertBefore(r), n.insertAfter(s), n.replace(e);
|
|
199
|
-
}
|
|
200
|
-
}
|
|
201
|
-
}
|
|
202
|
-
function _e(e = !1) {
|
|
203
|
-
const t = $getSelection();
|
|
204
|
-
if (!$isRangeSelection(t) || !t.isCollapsed()) return !1;
|
|
205
|
-
const n = t.anchor.getNode();
|
|
206
|
-
let r = null;
|
|
207
|
-
if (be(n) && 0 === n.getChildrenSize()) r = n;
|
|
208
|
-
else if ($isTextNode(n)) {
|
|
209
|
-
const e = n.getParent();
|
|
210
|
-
be(e) && e.getChildren().every((e) => $isTextNode(e) && "" === e.getTextContent().trim()) && (r = e);
|
|
211
|
-
}
|
|
212
|
-
if (null === r) return !1;
|
|
213
|
-
const i = se(r), s = r.getParent();
|
|
214
|
-
Pe(s) || re(40);
|
|
215
|
-
const o = s.getParent();
|
|
216
|
-
let l;
|
|
217
|
-
if ($isRootOrShadowRoot(o)) l = $createParagraphNode(), i.insertAfter(l);
|
|
218
|
-
else {
|
|
219
|
-
if (!be(o)) return !1;
|
|
220
|
-
l = $copyNode(o), o.insertAfter(l);
|
|
221
|
-
}
|
|
222
|
-
l.setTextStyle(t.style).setTextFormat(t.format).select();
|
|
223
|
-
const f = r.getNextSiblings();
|
|
224
|
-
if (f.length > 0) {
|
|
225
|
-
const t = e ? function(e, t) {
|
|
226
|
-
return e.getStart() + t.getIndexWithinParent();
|
|
227
|
-
}(s, r) : 1, n = $copyNode(s).setStart(t);
|
|
228
|
-
if (be(l)) {
|
|
229
|
-
const e = $copyNode(l);
|
|
230
|
-
e.append(n), l.insertAfter(e);
|
|
231
|
-
} else l.insertAfter(n);
|
|
232
|
-
n.append(...f);
|
|
233
|
-
}
|
|
234
|
-
return function(e) {
|
|
235
|
-
let t = e;
|
|
236
|
-
for (; null == t.getNextSibling() && null == t.getPreviousSibling();) {
|
|
237
|
-
const e = t.getParent();
|
|
238
|
-
if (null == e || !be(e) && !Pe(e)) break;
|
|
239
|
-
t = e;
|
|
240
|
-
}
|
|
241
|
-
t.remove();
|
|
242
|
-
}(r), !0;
|
|
243
|
-
}
|
|
244
|
-
var ye = class extends ElementNode {
|
|
245
|
-
__value;
|
|
246
|
-
__checked;
|
|
247
|
-
$config() {
|
|
248
|
-
return this.config("listitem", {
|
|
249
|
-
$transform: (e) => {
|
|
250
|
-
const n = e.getParent();
|
|
251
|
-
if (Pe(n)) "check" !== n.getListType() && null != e.getChecked() && e.setChecked(void 0);
|
|
252
|
-
else if (n) {
|
|
253
|
-
const r = e.createParentElementNode();
|
|
254
|
-
Pe(r) || re(340);
|
|
255
|
-
const i = [e];
|
|
256
|
-
for (const t of ["previous", "next"]) {
|
|
257
|
-
i.reverse();
|
|
258
|
-
for (const { origin: n } of $getSiblingCaret(e, t)) {
|
|
259
|
-
if (!be(n)) break;
|
|
260
|
-
i.push(n);
|
|
261
|
-
}
|
|
262
|
-
}
|
|
263
|
-
e.insertBefore(r), r.splice(0, 0, i), $isRootOrShadowRoot(n) || ($insertNodeToNearestRootAtCaret(r, $rewindSiblingCaret($getSiblingCaret(r, "next")), {
|
|
264
|
-
$shouldSplit: () => !1,
|
|
265
|
-
removeEmptyDestination: !0
|
|
266
|
-
}), n.isEmpty() && n.isAttached() && n.remove());
|
|
267
|
-
}
|
|
268
|
-
},
|
|
269
|
-
extends: ElementNode,
|
|
270
|
-
importDOM: buildImportMap({ li: () => ({
|
|
271
|
-
conversion: Ce,
|
|
272
|
-
priority: 0
|
|
273
|
-
}) })
|
|
274
|
-
});
|
|
275
|
-
}
|
|
276
|
-
constructor(e = 1, t = void 0, n) {
|
|
277
|
-
super(n), this.__value = void 0 === e ? 1 : e, this.__checked = t;
|
|
278
|
-
}
|
|
279
|
-
afterCloneFrom(e) {
|
|
280
|
-
super.afterCloneFrom(e), this.__value = e.__value, this.__checked = e.__checked;
|
|
281
|
-
}
|
|
282
|
-
createDOM(e) {
|
|
283
|
-
const t = document.createElement("li");
|
|
284
|
-
return this.updateListItemDOM(null, t, e), t;
|
|
285
|
-
}
|
|
286
|
-
updateListItemDOM(e, t, i) {
|
|
287
|
-
(function(e, t) {
|
|
288
|
-
const n = t.getParent();
|
|
289
|
-
!Pe(n) || "check" !== n.getListType() || Pe(t.getFirstChild()) ? (e.removeAttribute("role"), e.removeAttribute("tabIndex"), e.removeAttribute("aria-checked")) : (e.setAttribute("role", "checkbox"), e.setAttribute("tabIndex", "-1"), e.setAttribute("aria-checked", t.getChecked() ? "true" : "false"));
|
|
290
|
-
})(t, this), t.value = this.__value, function(e, t, i) {
|
|
291
|
-
const s = t.list;
|
|
292
|
-
if (!s) return;
|
|
293
|
-
const o = s.listitem, l = s.nested && s.nested.listitem, c = i.getParent(), a = Pe(c) && "check" === c.getListType(), u = i.getChecked(), g = i.getChildren().some((e) => Pe(e)), h = [];
|
|
294
|
-
void 0 !== s.listitemChecked && h.push(s.listitemChecked);
|
|
295
|
-
void 0 !== s.listitemUnchecked && h.push(s.listitemUnchecked);
|
|
296
|
-
void 0 !== l && h.push(...normalizeClassNames(l));
|
|
297
|
-
h.length > 0 && removeClassNamesFromElement(e, ...h);
|
|
298
|
-
const d = [];
|
|
299
|
-
void 0 !== o && d.push(...normalizeClassNames(o));
|
|
300
|
-
if (a) {
|
|
301
|
-
const e = u ? s.listitemChecked : s.listitemUnchecked;
|
|
302
|
-
void 0 !== e && d.push(e);
|
|
303
|
-
}
|
|
304
|
-
void 0 !== l && g && d.push(...normalizeClassNames(l));
|
|
305
|
-
d.length > 0 && addClassNamesToElement(e, ...d);
|
|
306
|
-
}(t, i.theme, this);
|
|
307
|
-
const s = e ? e.__style : "", o = this.__style;
|
|
308
|
-
s !== o && setDOMStyleFromCSS(t.style, o, s), function(e, t, n) {
|
|
309
|
-
const r = t.__textStyle, i = n ? n.__textStyle : "";
|
|
310
|
-
if (null !== n && i === r) return;
|
|
311
|
-
const s = getStyleObjectFromCSS(r);
|
|
312
|
-
for (const t in s) e.style.setProperty(`--listitem-marker-${t}`, s[t]);
|
|
313
|
-
if ("" !== i) for (const t in getStyleObjectFromCSS(i)) t in s || e.style.removeProperty(`--listitem-marker-${t}`);
|
|
314
|
-
}(t, this, e);
|
|
315
|
-
}
|
|
316
|
-
updateDOM(e, t, n) {
|
|
317
|
-
const r = t;
|
|
318
|
-
return this.updateListItemDOM(e, r, n), !1;
|
|
319
|
-
}
|
|
320
|
-
updateFromJSON(e) {
|
|
321
|
-
return super.updateFromJSON(e).setValue(e.value).setChecked(e.checked);
|
|
322
|
-
}
|
|
323
|
-
exportDOM(e) {
|
|
324
|
-
const t = this.createDOM(e._config), n = this.getFormatType();
|
|
325
|
-
n && (t.style.textAlign = n);
|
|
326
|
-
const r = this.getDirection();
|
|
327
|
-
return r && (t.dir = r), le(this) ? {
|
|
328
|
-
after(e) {
|
|
329
|
-
if (isHTMLElement(e)) {
|
|
330
|
-
const t = e.previousElementSibling;
|
|
331
|
-
if (isHTMLElement(t) && "LI" === t.nodeName) {
|
|
332
|
-
for (; e.firstChild;) t.append(e.firstChild);
|
|
333
|
-
e.remove();
|
|
334
|
-
}
|
|
335
|
-
}
|
|
336
|
-
return e;
|
|
337
|
-
},
|
|
338
|
-
element: t
|
|
339
|
-
} : { element: t };
|
|
340
|
-
}
|
|
341
|
-
exportJSON() {
|
|
342
|
-
return {
|
|
343
|
-
...super.exportJSON(),
|
|
344
|
-
checked: this.getChecked(),
|
|
345
|
-
value: this.getValue()
|
|
346
|
-
};
|
|
347
|
-
}
|
|
348
|
-
append(...e) {
|
|
349
|
-
for (let t = 0; t < e.length; t++) {
|
|
350
|
-
const n = e[t];
|
|
351
|
-
if ($isElementNode(n) && this.canMergeWith(n)) {
|
|
352
|
-
const e = n.getChildren();
|
|
353
|
-
this.append(...e), n.remove();
|
|
354
|
-
} else super.append(n);
|
|
355
|
-
}
|
|
356
|
-
return this;
|
|
357
|
-
}
|
|
358
|
-
replace(e, t) {
|
|
359
|
-
if (be(e)) return super.replace(e);
|
|
360
|
-
this.setIndent(0);
|
|
361
|
-
const n = this.getParentOrThrow();
|
|
362
|
-
if (!Pe(n)) return e;
|
|
363
|
-
if (n.__first === this.getKey()) n.insertBefore(e);
|
|
364
|
-
else if (n.__last === this.getKey()) n.insertAfter(e);
|
|
365
|
-
else {
|
|
366
|
-
const t = $copyNode(n);
|
|
367
|
-
let r = this.getNextSibling();
|
|
368
|
-
for (; r;) {
|
|
369
|
-
const e = r;
|
|
370
|
-
r = r.getNextSibling(), t.append(e);
|
|
371
|
-
}
|
|
372
|
-
n.insertAfter(e), e.insertAfter(t);
|
|
373
|
-
}
|
|
374
|
-
const r = this.__key;
|
|
375
|
-
let i = 0;
|
|
376
|
-
if (t && ($isElementNode(e) || re(139), i = e.getChildrenSize(), e.splice(i, 0, this.getChildren())), t && $isElementNode(e)) {
|
|
377
|
-
const t = $getSelection();
|
|
378
|
-
if ($isRangeSelection(t)) for (const n of t.getStartEndPoints()) n.key === r && "element" === n.type && n.set(e.getKey(), i + n.offset, "element");
|
|
379
|
-
}
|
|
380
|
-
return this.remove(), 0 === n.getChildrenSize() && n.remove(), e;
|
|
381
|
-
}
|
|
382
|
-
insertAfter(e, t = !0) {
|
|
383
|
-
const n = this.getParentOrThrow();
|
|
384
|
-
if (Pe(n) || re(39), be(e)) return super.insertAfter(e, t);
|
|
385
|
-
const r = this.getNextSiblings();
|
|
386
|
-
if (n.insertAfter(e, t), 0 !== r.length) {
|
|
387
|
-
const i = $copyNode(n);
|
|
388
|
-
r.forEach((e) => i.append(e)), e.insertAfter(i, t);
|
|
389
|
-
}
|
|
390
|
-
return e;
|
|
391
|
-
}
|
|
392
|
-
remove(e) {
|
|
393
|
-
const t = this.getPreviousSibling(), n = this.getNextSibling();
|
|
394
|
-
super.remove(e), t && n && le(t) && le(n) && (he(t.getFirstChild(), n.getFirstChild()), n.remove());
|
|
395
|
-
}
|
|
396
|
-
resetOnCopyNodeFrom(e) {
|
|
397
|
-
super.resetOnCopyNodeFrom(e), e.getChecked() && this.setChecked(!1);
|
|
398
|
-
}
|
|
399
|
-
insertNewAfter(e, t = !0) {
|
|
400
|
-
const n = $copyNode(this);
|
|
401
|
-
return this.insertAfter(n, t), n;
|
|
402
|
-
}
|
|
403
|
-
collapseAtStart(e) {
|
|
404
|
-
const t = $createParagraphNode();
|
|
405
|
-
this.getChildren().forEach((e) => t.append(e));
|
|
406
|
-
const n = this.getParentOrThrow(), r = n.getParentOrThrow(), i = be(r);
|
|
407
|
-
if (1 === n.getChildrenSize()) if (i) n.remove(), r.select();
|
|
408
|
-
else {
|
|
409
|
-
n.insertBefore(t), n.remove();
|
|
410
|
-
const r = e.anchor, i = e.focus, s = t.getKey();
|
|
411
|
-
"element" === r.type && r.getNode().is(this) && r.set(s, r.offset, "element"), "element" === i.type && i.getNode().is(this) && i.set(s, i.offset, "element");
|
|
412
|
-
}
|
|
413
|
-
else n.insertBefore(t), this.remove();
|
|
414
|
-
return !0;
|
|
415
|
-
}
|
|
416
|
-
getValue() {
|
|
417
|
-
return this.getLatest().__value;
|
|
418
|
-
}
|
|
419
|
-
setValue(e) {
|
|
420
|
-
const t = this.getWritable();
|
|
421
|
-
return t.__value = e, t;
|
|
422
|
-
}
|
|
423
|
-
getChecked() {
|
|
424
|
-
const e = this.getLatest();
|
|
425
|
-
let t;
|
|
426
|
-
const n = this.getParent();
|
|
427
|
-
return Pe(n) && (t = n.getListType()), "check" === t ? Boolean(e.__checked) : void 0;
|
|
428
|
-
}
|
|
429
|
-
setChecked(e) {
|
|
430
|
-
const t = this.getWritable();
|
|
431
|
-
return t.__checked = e, t;
|
|
432
|
-
}
|
|
433
|
-
toggleChecked() {
|
|
434
|
-
const e = this.getWritable();
|
|
435
|
-
return e.setChecked(!e.__checked);
|
|
436
|
-
}
|
|
437
|
-
getIndent() {
|
|
438
|
-
const e = this.getParent();
|
|
439
|
-
if (null === e || !this.isAttached()) return this.getLatest().__indent;
|
|
440
|
-
let t = e.getParentOrThrow(), n = 0;
|
|
441
|
-
for (; be(t);) t = t.getParentOrThrow().getParentOrThrow(), n++;
|
|
442
|
-
return n;
|
|
443
|
-
}
|
|
444
|
-
setIndent(e) {
|
|
445
|
-
"number" != typeof e && re(117), (e = Math.floor(e)) >= 0 || re(199);
|
|
446
|
-
let t = this.getIndent();
|
|
447
|
-
for (; t !== e;) t < e ? (pe(this), t++) : (me(this), t--);
|
|
448
|
-
return this;
|
|
449
|
-
}
|
|
450
|
-
canInsertAfter(e) {
|
|
451
|
-
return be(e);
|
|
452
|
-
}
|
|
453
|
-
canReplaceWith(e) {
|
|
454
|
-
return be(e);
|
|
455
|
-
}
|
|
456
|
-
canMergeWith(e) {
|
|
457
|
-
return be(e) || $isParagraphNode(e);
|
|
458
|
-
}
|
|
459
|
-
extractWithChild(e, t) {
|
|
460
|
-
if (!$isRangeSelection(t)) return !1;
|
|
461
|
-
const n = t.anchor.getNode(), r = t.focus.getNode();
|
|
462
|
-
return this.isParentOf(n) && this.isParentOf(r) && this.getTextContent().length === t.getTextContent().length;
|
|
463
|
-
}
|
|
464
|
-
isParentRequired() {
|
|
465
|
-
return !0;
|
|
466
|
-
}
|
|
467
|
-
createParentElementNode() {
|
|
468
|
-
return Fe("bullet");
|
|
469
|
-
}
|
|
470
|
-
canMergeWhenEmpty() {
|
|
471
|
-
return !0;
|
|
472
|
-
}
|
|
473
|
-
};
|
|
474
|
-
function Ce(e) {
|
|
475
|
-
if (e.classList.contains("task-list-item")) {
|
|
476
|
-
for (const t of e.children) if ("INPUT" === t.tagName) return ve(t);
|
|
477
|
-
}
|
|
478
|
-
if (e.classList.contains("joplin-checkbox")) {
|
|
479
|
-
for (const t of e.children) if (t.classList.contains("checkbox-wrapper") && t.children.length > 0 && "INPUT" === t.children[0].tagName) return ve(t.children[0]);
|
|
480
|
-
}
|
|
481
|
-
const t = e.getAttribute("aria-checked"), n = Te("true" === t || "false" !== t && void 0);
|
|
482
|
-
return $setFormatFromDOM(n, e), {
|
|
483
|
-
after: ke.bind(null, n),
|
|
484
|
-
node: $setDirectionFromDOM(n, e)
|
|
485
|
-
};
|
|
486
|
-
}
|
|
487
|
-
function ve(e) {
|
|
488
|
-
if (!("checkbox" === e.getAttribute("type"))) return { node: null };
|
|
489
|
-
const t = Te(e.hasAttribute("checked"));
|
|
490
|
-
return {
|
|
491
|
-
after: ke.bind(null, t),
|
|
492
|
-
node: t
|
|
493
|
-
};
|
|
494
|
-
}
|
|
495
|
-
function ke(e, t) {
|
|
496
|
-
const n = t[0];
|
|
497
|
-
return 1 === t.length && $isParagraphNode(n) && !e.getFormatType() && n.getFormatType() ? (e.setFormat(n.getFormatType()), n.getChildren()) : t;
|
|
498
|
-
}
|
|
499
|
-
function Te(e) {
|
|
500
|
-
return $applyNodeReplacement(new ye(void 0, e));
|
|
501
|
-
}
|
|
502
|
-
function be(e) {
|
|
503
|
-
return e instanceof ye;
|
|
504
|
-
}
|
|
505
|
-
var Se = class extends ElementNode {
|
|
506
|
-
__tag;
|
|
507
|
-
__start;
|
|
508
|
-
__listType;
|
|
509
|
-
$config() {
|
|
510
|
-
return this.config("list", {
|
|
511
|
-
$transform: (e) => {
|
|
512
|
-
(function(e) {
|
|
513
|
-
const t = e.getNextSibling();
|
|
514
|
-
Pe(t) && e.getListType() === t.getListType() && he(e, t);
|
|
515
|
-
})(e), fe(e);
|
|
516
|
-
},
|
|
517
|
-
extends: ElementNode,
|
|
518
|
-
importDOM: buildImportMap({
|
|
519
|
-
ol: () => ({
|
|
520
|
-
conversion: Le,
|
|
521
|
-
priority: 0
|
|
522
|
-
}),
|
|
523
|
-
ul: () => ({
|
|
524
|
-
conversion: Le,
|
|
525
|
-
priority: 0
|
|
526
|
-
})
|
|
527
|
-
})
|
|
528
|
-
});
|
|
529
|
-
}
|
|
530
|
-
constructor(e = "number", t = 1, n) {
|
|
531
|
-
super(n);
|
|
532
|
-
const r = Ne[e] || e;
|
|
533
|
-
this.__listType = r, this.__tag = "number" === r ? "ol" : "ul", this.__start = t;
|
|
534
|
-
}
|
|
535
|
-
afterCloneFrom(e) {
|
|
536
|
-
super.afterCloneFrom(e), this.__listType = e.__listType, this.__tag = e.__tag, this.__start = e.__start;
|
|
537
|
-
}
|
|
538
|
-
getTag() {
|
|
539
|
-
return this.getLatest().__tag;
|
|
540
|
-
}
|
|
541
|
-
setListType(e) {
|
|
542
|
-
const t = this.getWritable();
|
|
543
|
-
return t.__listType = e, t.__tag = "number" === e ? "ol" : "ul", t;
|
|
544
|
-
}
|
|
545
|
-
getListType() {
|
|
546
|
-
return this.getLatest().__listType;
|
|
547
|
-
}
|
|
548
|
-
getStart() {
|
|
549
|
-
return this.getLatest().__start;
|
|
550
|
-
}
|
|
551
|
-
setStart(e) {
|
|
552
|
-
const t = this.getWritable();
|
|
553
|
-
return t.__start = e, t;
|
|
554
|
-
}
|
|
555
|
-
createDOM(e, t) {
|
|
556
|
-
const n = this.__tag, r = document.createElement(n);
|
|
557
|
-
return 1 !== this.__start && r.setAttribute("start", String(this.__start)), r.__lexicalListType = this.__listType, xe(r, e.theme, this), r;
|
|
558
|
-
}
|
|
559
|
-
updateDOM(e, t, n) {
|
|
560
|
-
return e.__tag !== this.__tag || e.__listType !== this.__listType || (xe(t, n.theme, this), e.__start !== this.__start && t.setAttribute("start", String(this.__start)), !1);
|
|
561
|
-
}
|
|
562
|
-
updateFromJSON(e) {
|
|
563
|
-
return super.updateFromJSON(e).setListType(e.listType).setStart(e.start);
|
|
564
|
-
}
|
|
565
|
-
exportDOM(e) {
|
|
566
|
-
const t = this.createDOM(e._config, e);
|
|
567
|
-
return isHTMLElement$1(t) && (1 !== this.__start && t.setAttribute("start", String(this.__start)), "check" === this.__listType && t.setAttribute("__lexicalListType", "check")), { element: t };
|
|
568
|
-
}
|
|
569
|
-
exportJSON() {
|
|
570
|
-
return {
|
|
571
|
-
...super.exportJSON(),
|
|
572
|
-
listType: this.getListType(),
|
|
573
|
-
start: this.getStart(),
|
|
574
|
-
tag: this.getTag()
|
|
575
|
-
};
|
|
576
|
-
}
|
|
577
|
-
canBeEmpty() {
|
|
578
|
-
return !1;
|
|
579
|
-
}
|
|
580
|
-
canIndent() {
|
|
581
|
-
return !1;
|
|
582
|
-
}
|
|
583
|
-
splice(e, t, n) {
|
|
584
|
-
let r = n;
|
|
585
|
-
for (let e = 0; e < n.length; e++) {
|
|
586
|
-
const t = n[e];
|
|
587
|
-
be(t) || (r === n && (r = [...n]), r[e] = this.createListItemNode().append(!$isElementNode(t) || Pe(t) || t.isInline() ? t : $createTextNode(t.getTextContent())));
|
|
588
|
-
}
|
|
589
|
-
return super.splice(e, t, r);
|
|
590
|
-
}
|
|
591
|
-
extractWithChild(e) {
|
|
592
|
-
return be(e);
|
|
593
|
-
}
|
|
594
|
-
createListItemNode() {
|
|
595
|
-
return Te();
|
|
596
|
-
}
|
|
597
|
-
};
|
|
598
|
-
function xe(e, t, i) {
|
|
599
|
-
const s = [], o = [], l = t.list;
|
|
600
|
-
if (void 0 !== l) {
|
|
601
|
-
const e = l[`${i.__tag}Depth`] || [], t = ie(i) - 1, n = t % e.length, r = e[n], c = l[i.__tag];
|
|
602
|
-
let a;
|
|
603
|
-
const u = l.nested, g = l.checklist;
|
|
604
|
-
if (void 0 !== u && u.list && (a = u.list), void 0 !== c && s.push(c), void 0 !== g && "check" === i.__listType && s.push(g), void 0 !== r) {
|
|
605
|
-
s.push(...normalizeClassNames(r));
|
|
606
|
-
for (let t = 0; t < e.length; t++) t !== n && o.push(i.__tag + t);
|
|
607
|
-
}
|
|
608
|
-
if (void 0 !== a) {
|
|
609
|
-
const e = normalizeClassNames(a);
|
|
610
|
-
t > 1 ? s.push(...e) : o.push(...e);
|
|
611
|
-
}
|
|
612
|
-
}
|
|
613
|
-
o.length > 0 && removeClassNamesFromElement(e, ...o), s.length > 0 && addClassNamesToElement(e, ...s);
|
|
614
|
-
}
|
|
615
|
-
function Le(e) {
|
|
616
|
-
let t;
|
|
617
|
-
if (function(e) {
|
|
618
|
-
return isHTMLElement$1(e) && "ol" === e.nodeName.toLowerCase();
|
|
619
|
-
}(e)) {
|
|
620
|
-
const n = e.start;
|
|
621
|
-
t = Fe("number", n);
|
|
622
|
-
} else t = function(e) {
|
|
623
|
-
if ("check" === e.getAttribute("__lexicallisttype") || e.classList.contains("contains-task-list") || "1" === e.getAttribute("data-is-checklist")) return !0;
|
|
624
|
-
for (const t of e.childNodes) if (isHTMLElement$1(t) && t.hasAttribute("aria-checked")) return !0;
|
|
625
|
-
return !1;
|
|
626
|
-
}(e) ? Fe("check") : Fe("bullet");
|
|
627
|
-
return $setDirectionFromDOM(t, e), {
|
|
628
|
-
after: (e) => function(e, t) {
|
|
629
|
-
const n = t.createListItemNode.bind(t), r = [];
|
|
630
|
-
for (let t = 0; t < e.length; t++) {
|
|
631
|
-
const i = e[t];
|
|
632
|
-
if (be(i)) {
|
|
633
|
-
r.push(i);
|
|
634
|
-
const e = i.getChildren();
|
|
635
|
-
e.length > 1 && e.forEach((e) => {
|
|
636
|
-
Pe(e) && r.push(n().append(e));
|
|
637
|
-
});
|
|
638
|
-
} else r.push(n().append(i));
|
|
639
|
-
}
|
|
640
|
-
return r;
|
|
641
|
-
}(e, t),
|
|
642
|
-
node: t
|
|
643
|
-
};
|
|
644
|
-
}
|
|
645
|
-
const Ne = {
|
|
646
|
-
ol: "number",
|
|
647
|
-
ul: "bullet"
|
|
648
|
-
};
|
|
649
|
-
function Fe(e = "number", t = 1) {
|
|
650
|
-
return $applyNodeReplacement(new Se(e, t));
|
|
651
|
-
}
|
|
652
|
-
function Pe(e) {
|
|
653
|
-
return e instanceof Se;
|
|
654
|
-
}
|
|
655
|
-
const Ae = createCommand("INSERT_CHECK_LIST_COMMAND");
|
|
656
|
-
function Ee(e, t) {
|
|
657
|
-
const n = t && t.disableTakeFocusOnClick || !1, r = "boolean" == typeof n ? () => n : n.peek.bind(n), l = (e) => {
|
|
658
|
-
const t = e.target;
|
|
659
|
-
if (!isHTMLElement$1(t)) return !1;
|
|
660
|
-
const n = t.__lexicalCheckListLastHandled;
|
|
661
|
-
return void 0 !== n && e.timeStamp - n < 500;
|
|
662
|
-
}, u = (e) => {
|
|
663
|
-
const t = e.target;
|
|
664
|
-
isHTMLElement$1(t) && (t.__lexicalCheckListLastHandled = e.timeStamp);
|
|
665
|
-
}, g = (e) => {
|
|
666
|
-
l(e) || (u(e), Ie(e, r()));
|
|
667
|
-
}, h = (e) => {
|
|
668
|
-
"touch" === e.pointerType && (l(e) || (u(e), Ie(e, r())));
|
|
669
|
-
}, d = (e) => {
|
|
670
|
-
(function(e, t) {
|
|
671
|
-
Oe(e, () => {
|
|
672
|
-
e.preventDefault(), t && e.stopPropagation();
|
|
673
|
-
});
|
|
674
|
-
})(e, r());
|
|
675
|
-
};
|
|
676
|
-
return mergeRegister(e.registerCommand(Ae, () => (ae("check"), !0), COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ARROW_DOWN_COMMAND, (t) => De(t, e, !1), COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ARROW_UP_COMMAND, (t) => De(t, e, !0), COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ESCAPE_COMMAND, () => {
|
|
677
|
-
if (null != we()) return e.getRootElement()?.focus(), !0;
|
|
678
|
-
return !1;
|
|
679
|
-
}, COMMAND_PRIORITY_LOW), e.registerCommand(KEY_SPACE_COMMAND, (t) => {
|
|
680
|
-
const n = we();
|
|
681
|
-
return !(null == n || !e.isEditable()) && (e.update(() => {
|
|
682
|
-
const e = $getNearestNodeFromDOMNode(n);
|
|
683
|
-
be(e) && (t.preventDefault(), e.toggleChecked());
|
|
684
|
-
}), !0);
|
|
685
|
-
}, COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ARROW_LEFT_COMMAND, (t) => e.getEditorState().read(() => {
|
|
686
|
-
const n = $getSelection();
|
|
687
|
-
if ($isRangeSelection(n) && n.isCollapsed()) {
|
|
688
|
-
const { anchor: r } = n, i = "element" === r.type;
|
|
689
|
-
if (i || 0 === r.offset) {
|
|
690
|
-
const n = r.getNode(), s = $findMatchingParent(n, (e) => $isElementNode(e) && !e.isInline());
|
|
691
|
-
if (be(s)) {
|
|
692
|
-
const r = s.getParent();
|
|
693
|
-
if (Pe(r) && "check" === r.getListType() && (i || s.getFirstDescendant() === n)) {
|
|
694
|
-
const n = e.getElementByKey(s.__key);
|
|
695
|
-
if (null != n && document.activeElement !== n) return n.focus(), t.preventDefault(), !0;
|
|
696
|
-
}
|
|
697
|
-
}
|
|
698
|
-
}
|
|
699
|
-
}
|
|
700
|
-
return !1;
|
|
701
|
-
}), COMMAND_PRIORITY_LOW), e.registerRootListener((e) => {
|
|
702
|
-
if (null !== e) return e.addEventListener("click", g), e.addEventListener("pointerup", h), e.addEventListener("pointerdown", d, { capture: !0 }), e.addEventListener("mousedown", d, { capture: !0 }), e.addEventListener("touchstart", d, {
|
|
703
|
-
capture: !0,
|
|
704
|
-
passive: !1
|
|
705
|
-
}), () => {
|
|
706
|
-
e.removeEventListener("click", g), e.removeEventListener("pointerup", h), e.removeEventListener("pointerdown", d, { capture: !0 }), e.removeEventListener("mousedown", d, { capture: !0 }), e.removeEventListener("touchstart", d, { capture: !0 });
|
|
707
|
-
};
|
|
708
|
-
}));
|
|
709
|
-
}
|
|
710
|
-
function Oe(e, t) {
|
|
711
|
-
const n = e.target;
|
|
712
|
-
if (!isHTMLElement$1(n)) return;
|
|
713
|
-
const r = n.firstChild;
|
|
714
|
-
if (isHTMLElement$1(r) && ("UL" === r.tagName || "OL" === r.tagName)) return;
|
|
715
|
-
const s = n.parentNode;
|
|
716
|
-
if (!s || "check" !== s.__lexicalListType) return;
|
|
717
|
-
let o = null, c = null;
|
|
718
|
-
if ("clientX" in e) o = e.clientX;
|
|
719
|
-
else if ("touches" in e) {
|
|
720
|
-
const t = e.touches;
|
|
721
|
-
t.length > 0 && (o = t[0].clientX, c = "touch");
|
|
722
|
-
}
|
|
723
|
-
if (null == o) return;
|
|
724
|
-
const a = n.getBoundingClientRect(), u = o / calculateZoomLevel(n), g = window.getComputedStyle ? window.getComputedStyle(n, "::before") : { width: "0px" }, h = parseFloat(g.width), d = "touch" === c || "pointerType" in e && "touch" === e.pointerType ? 32 : 0;
|
|
725
|
-
("rtl" === n.dir ? u < a.right + d && u > a.right - h - d : u > a.left - d && u < a.left + h + d) && t();
|
|
726
|
-
}
|
|
727
|
-
function Ie(e, t) {
|
|
728
|
-
Oe(e, () => {
|
|
729
|
-
if (isHTMLElement$1(e.target)) {
|
|
730
|
-
const n = e.target, r = getNearestEditorFromDOMNode(n);
|
|
731
|
-
null != r && r.isEditable() && r.update(() => {
|
|
732
|
-
const e = $getNearestNodeFromDOMNode(n);
|
|
733
|
-
be(e) && (t ? ($addUpdateTag(SKIP_SELECTION_FOCUS_TAG), $addUpdateTag(SKIP_DOM_SELECTION_TAG)) : n.focus(), e.toggleChecked());
|
|
734
|
-
});
|
|
735
|
-
}
|
|
736
|
-
});
|
|
737
|
-
}
|
|
738
|
-
function we() {
|
|
739
|
-
const e = document.activeElement;
|
|
740
|
-
return isHTMLElement$1(e) && "LI" === e.tagName && null != e.parentNode && "check" === e.parentNode.__lexicalListType ? e : null;
|
|
741
|
-
}
|
|
742
|
-
function De(e, t, n) {
|
|
743
|
-
const r = we();
|
|
744
|
-
return null != r && t.update(() => {
|
|
745
|
-
const i = $getNearestNodeFromDOMNode(r);
|
|
746
|
-
if (!be(i)) return;
|
|
747
|
-
const s = function(e, t) {
|
|
748
|
-
let n = t ? e.getPreviousSibling() : e.getNextSibling(), r = e;
|
|
749
|
-
for (; null == n && be(r);) r = r.getParentOrThrow().getParent(), null != r && (n = t ? r.getPreviousSibling() : r.getNextSibling());
|
|
750
|
-
for (; be(n);) {
|
|
751
|
-
const e = t ? n.getLastChild() : n.getFirstChild();
|
|
752
|
-
if (!Pe(e)) return n;
|
|
753
|
-
n = t ? e.getLastChild() : e.getFirstChild();
|
|
754
|
-
}
|
|
755
|
-
return null;
|
|
756
|
-
}(i, n);
|
|
757
|
-
if (null != s) {
|
|
758
|
-
s.selectStart();
|
|
759
|
-
const n = t.getElementByKey(s.__key);
|
|
760
|
-
null != n && (e.preventDefault(), setTimeout(() => {
|
|
761
|
-
n.focus();
|
|
762
|
-
}, 0));
|
|
763
|
-
}
|
|
764
|
-
}), !1;
|
|
765
|
-
}
|
|
766
|
-
const Me = createCommand("UPDATE_LIST_START_COMMAND"), $e = createCommand("INSERT_UNORDERED_LIST_COMMAND"), Re = createCommand("INSERT_ORDERED_LIST_COMMAND"), Ke = createCommand("REMOVE_LIST_COMMAND");
|
|
767
|
-
function Be(e, t) {
|
|
768
|
-
return mergeRegister(e.registerCommand(Re, () => (ae("number"), !0), COMMAND_PRIORITY_LOW), e.registerCommand(Me, (e) => {
|
|
769
|
-
const { listNodeKey: t, newStart: n } = e, r = $getNodeByKey(t);
|
|
770
|
-
return !!Pe(r) && ("number" === r.getListType() && (r.setStart(n), fe(r)), !0);
|
|
771
|
-
}, COMMAND_PRIORITY_LOW), e.registerCommand($e, () => (ae("bullet"), !0), COMMAND_PRIORITY_LOW), e.registerCommand(Ke, () => (de(), !0), COMMAND_PRIORITY_LOW), e.registerCommand(INSERT_PARAGRAPH_COMMAND, () => _e(!!(t && t.restoreNumbering)), COMMAND_PRIORITY_LOW), e.registerNodeTransform(ye, (e) => {
|
|
772
|
-
const t = e.getFirstChild();
|
|
773
|
-
if (t) {
|
|
774
|
-
if ($isTextNode(t)) {
|
|
775
|
-
const n = t.getStyle(), r = t.getFormat();
|
|
776
|
-
e.getTextStyle() !== n && e.setTextStyle(n), e.getTextFormat() !== r && e.setTextFormat(r);
|
|
777
|
-
}
|
|
778
|
-
} else {
|
|
779
|
-
const t = $getSelection();
|
|
780
|
-
$isRangeSelection(t) && (t.style !== e.getTextStyle() || t.format !== e.getTextFormat()) && t.isCollapsed() && e.is(t.anchor.getNode()) && e.setTextStyle(t.style).setTextFormat(t.format);
|
|
781
|
-
}
|
|
782
|
-
}), e.registerNodeTransform(TextNode, (e) => {
|
|
783
|
-
const t = e.getParent();
|
|
784
|
-
if (be(t) && e.is(t.getFirstChild())) {
|
|
785
|
-
const n = e.getStyle(), r = e.getFormat();
|
|
786
|
-
n === t.getTextStyle() && r === t.getTextFormat() || t.setTextStyle(n).setTextFormat(r);
|
|
787
|
-
}
|
|
788
|
-
}));
|
|
789
|
-
}
|
|
790
|
-
function We(e) {
|
|
791
|
-
const t = (e) => {
|
|
792
|
-
const t = e.getParent();
|
|
793
|
-
if (Pe(e.getFirstChild()) || !Pe(t)) return;
|
|
794
|
-
const n = $findMatchingParent(e, (e) => be(e) && Pe(e.getParent()) && be(e.getPreviousSibling()));
|
|
795
|
-
if (null === n && e.getIndent() > 0) e.setIndent(0);
|
|
796
|
-
else if (be(n)) {
|
|
797
|
-
const r = n.getPreviousSibling();
|
|
798
|
-
if (be(r)) {
|
|
799
|
-
const i = function(e) {
|
|
800
|
-
let t = e, n = t.getFirstChild();
|
|
801
|
-
for (; Pe(n);) {
|
|
802
|
-
const e = n.getLastChild();
|
|
803
|
-
if (!be(e)) break;
|
|
804
|
-
t = e, n = t.getFirstChild();
|
|
805
|
-
}
|
|
806
|
-
return t;
|
|
807
|
-
}(r).getParent();
|
|
808
|
-
if (Pe(i)) {
|
|
809
|
-
const n = ie(i);
|
|
810
|
-
n + 1 < ie(t) && e.setIndent(n);
|
|
811
|
-
}
|
|
812
|
-
}
|
|
813
|
-
}
|
|
814
|
-
};
|
|
815
|
-
return e.registerNodeTransform(Se, (e) => {
|
|
816
|
-
const n = [e];
|
|
817
|
-
for (; n.length > 0;) {
|
|
818
|
-
const e = n.shift();
|
|
819
|
-
if (Pe(e)) {
|
|
820
|
-
for (const r of e.getChildren()) if (be(r)) {
|
|
821
|
-
t(r);
|
|
822
|
-
const e = r.getFirstChild();
|
|
823
|
-
Pe(e) && n.push(e);
|
|
824
|
-
}
|
|
825
|
-
}
|
|
826
|
-
}
|
|
827
|
-
});
|
|
828
|
-
}
|
|
829
|
-
const Ue = defineExtension({
|
|
830
|
-
build: (e, t, n) => namedSignals(t),
|
|
831
|
-
config: safeCast({
|
|
832
|
-
hasStrictIndent: !1,
|
|
833
|
-
shouldPreserveNumbering: !1
|
|
834
|
-
}),
|
|
835
|
-
name: "@lexical/list/List",
|
|
836
|
-
nodes: () => [Se, ye],
|
|
837
|
-
register(e, t, n) {
|
|
838
|
-
const r = n.getOutput();
|
|
839
|
-
return mergeRegister(effect(() => Be(e, { restoreNumbering: r.shouldPreserveNumbering.value })), effect(() => r.hasStrictIndent.value ? We(e) : void 0));
|
|
840
|
-
}
|
|
841
|
-
}), Je = defineExtension({
|
|
842
|
-
build: (e, t) => namedSignals(t),
|
|
843
|
-
config: safeCast({ disableTakeFocusOnClick: !1 }),
|
|
844
|
-
dependencies: [Ue],
|
|
845
|
-
name: "@lexical/list/CheckList",
|
|
846
|
-
register: (e, t, n) => Ee(e, n.getOutput())
|
|
847
|
-
});
|
|
848
|
-
function Ve(e) {
|
|
849
|
-
const t = [];
|
|
850
|
-
for (const n of e) if (be(n)) {
|
|
851
|
-
t.push(n);
|
|
852
|
-
const e = n.getChildren();
|
|
853
|
-
if (e.length > 1) for (const n of e) Pe(n) && t.push(Te().append(n));
|
|
854
|
-
} else t.push(Te().append(n));
|
|
855
|
-
return t;
|
|
856
|
-
}
|
|
857
|
-
const qe = defineImportRule({
|
|
858
|
-
$import: (e, t) => {
|
|
859
|
-
let n;
|
|
860
|
-
var r;
|
|
861
|
-
return isElementOfTag(t, "ol") ? n = Fe("number", t.start) : n = (r = t).matches("[__lexicallisttype=\"check\"], .contains-task-list, [data-is-checklist=\"1\"]") || null !== r.querySelector(":scope > [aria-checked]") ? Fe("check") : Fe("bullet"), $setDirectionFromDOM(n, t), [n.splice(0, 0, Ve(e.$importChildren(t)))];
|
|
862
|
-
},
|
|
863
|
-
match: sel.tag("ol", "ul"),
|
|
864
|
-
name: "@lexical/list/list"
|
|
865
|
-
});
|
|
866
|
-
function ze(e, t) {
|
|
867
|
-
if (1 !== t.length) return t;
|
|
868
|
-
const n = t[0];
|
|
869
|
-
return $isParagraphNode(n) && !e.getFormatType() && n.getFormatType() ? (e.setFormat(n.getFormatType()), n.getChildren()) : t;
|
|
870
|
-
}
|
|
871
|
-
const He = defineImportRule({
|
|
872
|
-
$import: (e, t) => {
|
|
873
|
-
const n = t.getAttribute("aria-checked"), r = Te("true" === n || "false" !== n && void 0);
|
|
874
|
-
return $setFormatFromDOM(r, t), $setDirectionFromDOM(r, t), [r.splice(0, 0, ze(r, e.$importChildren(t)))];
|
|
875
|
-
},
|
|
876
|
-
match: sel.tag("li"),
|
|
877
|
-
name: "@lexical/list/li"
|
|
878
|
-
});
|
|
879
|
-
function je(e, t, n) {
|
|
880
|
-
const r = isElementOfTag(n, "input") ? n : n.querySelector("input[type=\"checkbox\"]");
|
|
881
|
-
if (!r || "checkbox" !== r.getAttribute("type")) return [];
|
|
882
|
-
const i = Te(r.hasAttribute("checked"));
|
|
883
|
-
return $setFormatFromDOM(i, t), $setDirectionFromDOM(i, t), [i.splice(0, 0, ze(i, e.$importChildren(t)))];
|
|
884
|
-
}
|
|
885
|
-
const Xe = {
|
|
886
|
-
$accepts: (e) => be(e) || Pe(e),
|
|
887
|
-
$packageRun: (e) => [Te().splice(0, 0, e)],
|
|
888
|
-
name: "ListSchema"
|
|
889
|
-
}, Ge = [
|
|
890
|
-
defineImportRule({
|
|
891
|
-
$import: (e, t, n) => {
|
|
892
|
-
const r = t.querySelector(":scope > input[type=\"checkbox\"]");
|
|
893
|
-
return r ? je(e, t, r) : n();
|
|
894
|
-
},
|
|
895
|
-
match: sel.tag("li").classAll("task-list-item"),
|
|
896
|
-
name: "@lexical/list/li-task-list-item"
|
|
897
|
-
}),
|
|
898
|
-
defineImportRule({
|
|
899
|
-
$import: (e, t, n) => {
|
|
900
|
-
const r = t.querySelector(":scope > .checkbox-wrapper");
|
|
901
|
-
if (!r) return n();
|
|
902
|
-
const i = r.querySelector(":scope > input[type=\"checkbox\"]");
|
|
903
|
-
return i ? je(e, t, i) : n();
|
|
904
|
-
},
|
|
905
|
-
match: sel.tag("li").classAll("joplin-checkbox"),
|
|
906
|
-
name: "@lexical/list/li-joplin-checkbox"
|
|
907
|
-
}),
|
|
908
|
-
qe,
|
|
909
|
-
He
|
|
910
|
-
], Qe = defineExtension({
|
|
911
|
-
dependencies: [
|
|
912
|
-
CoreImportExtension,
|
|
913
|
-
Ue,
|
|
914
|
-
configExtension(DOMImportExtension, { rules: Ge })
|
|
915
|
-
],
|
|
916
|
-
name: "@lexical/list/Import"
|
|
917
|
-
});
|
|
918
|
-
function Ye(e, t) {
|
|
919
|
-
e.update(() => ae(t));
|
|
920
|
-
}
|
|
921
|
-
function Ze(e) {
|
|
922
|
-
e.update(() => de());
|
|
923
|
-
}
|
|
924
|
-
//#endregion
|
|
925
|
-
export { Te as $createListItemNode, Fe as $createListNode, ie as $getListDepth, _e as $handleListInsertParagraph, ae as $insertList, be as $isListItemNode, Pe as $isListNode, de as $removeList, Je as CheckListExtension, Ae as INSERT_CHECK_LIST_COMMAND, Re as INSERT_ORDERED_LIST_COMMAND, $e as INSERT_UNORDERED_LIST_COMMAND, Ue as ListExtension, Qe as ListImportExtension, Ge as ListImportRules, ye as ListItemNode, Se as ListNode, Xe as ListSchema, Ke as REMOVE_LIST_COMMAND, Me as UPDATE_LIST_START_COMMAND, Ye as insertList, Ee as registerCheckList, Be as registerList, We as registerListStrictIndentTransform, Ze as removeList };
|