@mx-space/cli 0.7.8 → 0.8.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (55) hide show
  1. package/dist/{Lexical.dev-rcxzwpir.mjs → Lexical.dev-By5dOKBN.mjs} +1486 -356
  2. package/dist/{Lexical.node-BUsI9gWr.mjs → Lexical.node-fXM8Jp7p.mjs} +39 -17
  3. package/dist/{Lexical.prod-C8HtkSD6.mjs → Lexical.prod-BlCvXPGa.mjs} +2279 -1768
  4. package/dist/LexicalClipboard.dev--HxGoSkO.mjs +915 -0
  5. package/dist/{LexicalClipboard.node-CO-MCKx5.mjs → LexicalClipboard.node-C3mRbrmW.mjs} +10 -3
  6. package/dist/LexicalClipboard.prod-DNJzFMcT.mjs +371 -0
  7. package/dist/LexicalCodeCore.dev-DjSrd4A4.mjs +1109 -0
  8. package/dist/LexicalCodeCore.prod-DTDShkR3.mjs +642 -0
  9. package/dist/{LexicalDragon.dev-gBP8WSRS.mjs → LexicalDragon.dev-DwprRH0z.mjs} +3 -3
  10. package/dist/{LexicalDragon.node-OG6G55nl.mjs → LexicalDragon.node-BVhw4C7s.mjs} +2 -2
  11. package/dist/{LexicalDragon.prod-DP-_Q8cv.mjs → LexicalDragon.prod-nh4J-8vn.mjs} +3 -3
  12. package/dist/{LexicalExtension.dev-DVbjljrm.mjs → LexicalExtension.dev-BPNyvGqe.mjs} +335 -6
  13. package/dist/{LexicalExtension.node-CF3EAPN7.mjs → LexicalExtension.node-BVlcrgOx.mjs} +15 -8
  14. package/dist/{LexicalExtension.prod-DklHHErZ.mjs → LexicalExtension.prod-DFKbiNt-.mjs} +375 -265
  15. package/dist/{LexicalHeadless.dev-DdWLM7Nl.mjs → LexicalHeadless.dev-B-cj7Pr5.mjs} +2 -2
  16. package/dist/{LexicalHeadless.prod-CoiiTDzR.mjs → LexicalHeadless.prod-Byp1vNzT.mjs} +2 -2
  17. package/dist/LexicalHtml.dev-prBAwszN.mjs +2424 -0
  18. package/dist/LexicalHtml.node-BvNF96jZ.mjs +56 -0
  19. package/dist/LexicalHtml.prod-Sz3CW1ht.mjs +1207 -0
  20. package/dist/{LexicalLink.dev-BS1Bf-yD.mjs → LexicalLink.dev-NySTYhVR.mjs} +42 -8
  21. package/dist/{LexicalLink.prod-B_crkoHP.mjs → LexicalLink.prod-BuCM8gts.mjs} +209 -191
  22. package/dist/{LexicalList.dev-OMqmcnQ-.mjs → LexicalList.dev-DIMOvSFD.mjs} +252 -80
  23. package/dist/{LexicalList.prod-CpL1s8vS.mjs → LexicalList.prod-MVqfA6Vo.mjs} +364 -278
  24. package/dist/{LexicalMarkdown.dev-BHSdx_Gr.mjs → LexicalMarkdown.dev-C7aylvCG.mjs} +729 -552
  25. package/dist/LexicalMarkdown.prod-CfQSM406.mjs +868 -0
  26. package/dist/{LexicalRichText.dev-Bz9A_WbM.mjs → LexicalRichText.dev-DfICq6lU.mjs} +272 -77
  27. package/dist/{LexicalRichText.node-DDpwfE-P.mjs → LexicalRichText.node-Bg9jND3Q.mjs} +21 -8
  28. package/dist/LexicalRichText.prod-GsFzCK-o.mjs +550 -0
  29. package/dist/{LexicalSelection.dev-CQ380fnD.mjs → LexicalSelection.dev-DGjj12wW.mjs} +50 -38
  30. package/dist/{LexicalSelection.node-DesBMjIE.mjs → LexicalSelection.node-BU5L4193.mjs} +4 -4
  31. package/dist/{LexicalSelection.prod-D2jivCDB.mjs → LexicalSelection.prod-D-PwRbyK.mjs} +158 -140
  32. package/dist/{LexicalTable.dev-Ca7mQ7Jk.mjs → LexicalTable.dev-ChP7cugd.mjs} +215 -53
  33. package/dist/{LexicalTable.prod-DyPAcC7y.mjs → LexicalTable.prod-Bpr9YRXp.mjs} +668 -573
  34. package/dist/{LexicalUtils.dev-HxM8F0g6.mjs → LexicalUtils.dev-BiFU3789.mjs} +10 -47
  35. package/dist/{LexicalUtils.node-lCWjRjoG.mjs → LexicalUtils.node-j3Llm7Y3.mjs} +2 -2
  36. package/dist/{LexicalUtils.prod-Bti5w4ki.mjs → LexicalUtils.prod-DCvrA78p.mjs} +103 -105
  37. package/dist/bin/mxs.d.mts +1 -1
  38. package/dist/bin/mxs.mjs +1 -1
  39. package/dist/esm-By7trG9K.mjs +2 -0
  40. package/dist/{esm-CK9m5JKX.mjs → esm-Dg-WhPCe.mjs} +989 -989
  41. package/dist/index.d.mts +1 -1
  42. package/dist/index.mjs +1 -1
  43. package/dist/{mxs-BZt1cLW9.mjs → mxs-DT0oYk6U.mjs} +11935 -11866
  44. package/package.json +15 -14
  45. package/dist/LexicalClipboard.dev-BpqRwTLP.mjs +0 -494
  46. package/dist/LexicalClipboard.prod-B_xdeiAC.mjs +0 -291
  47. package/dist/LexicalCodeCore.dev-7_cexm39.mjs +0 -537
  48. package/dist/LexicalCodeCore.prod-Bd6WFHcO.mjs +0 -381
  49. package/dist/LexicalHtml.dev-C3ZSWBFZ.mjs +0 -684
  50. package/dist/LexicalHtml.node-D0TD152E.mjs +0 -24
  51. package/dist/LexicalHtml.prod-CX47X0zl.mjs +0 -430
  52. package/dist/LexicalMarkdown.prod-C-S7Ii6-.mjs +0 -754
  53. package/dist/LexicalRichText.prod-C8qXACDL.mjs +0 -427
  54. package/dist/esm-DRbkkY3r.mjs +0 -2
  55. /package/dist/{mxs-CM8-6uAr.d.mts → mxs-iqJBopvE.d.mts} +0 -0
@@ -1,7 +1,8 @@
1
- import { r as effect, s as namedSignals } from "./LexicalExtension.node-CF3EAPN7.mjs";
2
- import { $n as safeCast, At as COMMAND_PRIORITY_LOW, B as $getSiblingCaret, D as $getChildCaret, En as buildImportMap, Fn as getNearestEditorFromDOMNode, Gn as isHTMLElement, Ht as ElementNode, Ln as getStyleObjectFromCSS, Mn as defineExtension, N as $getNearestNodeFromDOMNode, On as createCommand, P as $getNodeByKey, Q as $isLeafNode, Y as $isElementNode, Zn as normalizeClassNames, Zt as INSERT_PARAGRAPH_COMMAND, _ as $createTextNode, _t as $setPointFromCaret, at as $isRootOrShadowRoot, bn as SKIP_DOM_SELECTION_TAG, c as $copyNode, cn as KEY_SPACE_COMMAND, ct as $isTextNode, dt as $normalizeCaret, en as KEY_ARROW_DOWN_COMMAND, er as setDOMStyleFromCSS, f as $createParagraphNode, ht as $rewindSiblingCaret, n as $applyNodeReplacement, nt as $isParagraphNode, rn as KEY_ARROW_UP_COMMAND, rt as $isRangeSelection, sn as KEY_ESCAPE_COMMAND, t as $addUpdateTag, tn as KEY_ARROW_LEFT_COMMAND, wn as TextNode, xn as SKIP_SELECTION_FOCUS_TAG, z as $getSelection } from "./Lexical.node-BUsI9gWr.mjs";
3
- 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-lCWjRjoG.mjs";
4
- //#region ../../node_modules/.pnpm/@lexical+list@0.44.0/node_modules/@lexical/list/LexicalList.prod.mjs
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
5
6
  /**
6
7
  * Copyright (c) Meta Platforms, Inc. and affiliates.
7
8
  *
@@ -9,76 +10,71 @@ import { _ as removeClassNamesFromElement, a as $getNearestNodeOfType, d as addC
9
10
  * LICENSE file in the root directory of this source tree.
10
11
  *
11
12
  */
12
- function q(e, ...t) {
13
+ function re(e, ...t) {
13
14
  const n = new URL("https://lexical.dev/docs/error"), r = new URLSearchParams();
14
15
  r.append("code", e);
15
16
  for (const e of t) r.append("v", e);
16
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.`);
17
18
  }
18
- function G(e) {
19
+ function ie(e) {
19
20
  let t = 1, n = e.getParent();
20
21
  for (; null != n;) {
21
- if (pe(n)) {
22
+ if (be(n)) {
22
23
  const e = n.getParent();
23
- if (Se(e)) {
24
+ if (Pe(e)) {
24
25
  t++, n = e.getParent();
25
26
  continue;
26
27
  }
27
- q(40);
28
+ re(40);
28
29
  }
29
30
  return t;
30
31
  }
31
32
  return t;
32
33
  }
33
- function Q(e) {
34
+ function se(e) {
34
35
  let t = e.getParent();
35
- Se(t) || q(40);
36
+ Pe(t) || re(40);
36
37
  let n = t;
37
- for (; null !== n;) n = n.getParent(), Se(n) && (t = n);
38
+ for (; null !== n;) n = n.getParent(), Pe(n) && (t = n);
38
39
  return t;
39
40
  }
40
- function Y(e) {
41
+ function oe(e) {
41
42
  let t = [];
42
- const n = e.getChildren().filter(pe);
43
+ const n = e.getChildren().filter(be);
43
44
  for (let e = 0; e < n.length; e++) {
44
45
  const r = n[e], i = r.getFirstChild();
45
- Se(i) ? t = t.concat(Y(i)) : t.push(r);
46
+ Pe(i) ? t = t.concat(oe(i)) : t.push(r);
46
47
  }
47
48
  return t;
48
49
  }
49
- function Z(e) {
50
- return pe(e) && Se(e.getFirstChild());
51
- }
52
- function ee(e) {
53
- return fe().append(e);
50
+ function le(e) {
51
+ return be(e) && Pe(e.getFirstChild());
54
52
  }
55
- function te(e, t) {
56
- return pe(e) && (0 === t.length || 1 === t.length && e.is(t[0]) && 0 === e.getChildrenSize());
53
+ function ce(e, t) {
54
+ return be(e) && (0 === t.length || 1 === t.length && e.is(t[0]) && 0 === e.getChildrenSize());
57
55
  }
58
- function ne(e) {
56
+ function ae(e) {
59
57
  const t = $getSelection();
60
58
  if (null !== t) {
61
59
  let n = t.getNodes();
62
60
  if ($isRangeSelection(t)) {
63
- const r = t.getStartEndPoints();
64
- null === r && q(143);
65
- const [i] = r, s = i.getNode(), o = s.getParent();
66
- if ($isRootOrShadowRoot(s)) {
67
- const e = s.getFirstChild();
61
+ const [r] = t.getStartEndPoints(), i = r.getNode(), s = i.getParent();
62
+ if ($isRootOrShadowRoot(i)) {
63
+ const e = i.getFirstChild();
68
64
  if (e) n = e.selectStart().getNodes();
69
65
  else {
70
66
  const e = $createParagraphNode();
71
- s.append(e), n = e.select().getNodes();
67
+ i.append(e), n = e.select().getNodes();
72
68
  }
73
- } else if (te(s, n)) {
74
- const t = Te(e);
75
- if ($isRootOrShadowRoot(o)) {
76
- s.replace(t);
77
- const e = fe();
78
- $isElementNode(s) && (e.setFormat(s.getFormatType()), e.setIndent(s.getIndent())), t.append(e);
79
- } else if (pe(s)) {
80
- const e = s.getParentOrThrow();
81
- re(t, e.getChildren()), e.replace(t);
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);
82
78
  }
83
79
  return;
84
80
  }
@@ -86,24 +82,24 @@ function ne(e) {
86
82
  const r = /* @__PURE__ */ new Set();
87
83
  for (let t = 0; t < n.length; t++) {
88
84
  const i = n[t];
89
- if ($isElementNode(i) && i.isEmpty() && !pe(i) && !r.has(i.getKey())) {
90
- ie(i, e);
85
+ if ($isElementNode(i) && i.isEmpty() && !be(i) && !r.has(i.getKey())) {
86
+ ge(i, e);
91
87
  continue;
92
88
  }
93
- let s = $isLeafNode(i) ? i.getParent() : pe(i) && i.isEmpty() ? i : null;
89
+ let s = $isLeafNode(i) ? i.getParent() : be(i) && i.isEmpty() ? i : null;
94
90
  for (; null != s;) {
95
91
  const t = s.getKey();
96
- if (Se(s)) {
92
+ if (Pe(s)) {
97
93
  if (!r.has(t)) {
98
- const n = Te(e);
99
- re(n, s.getChildren()), s.replace(n), r.add(t);
94
+ const n = Fe(e);
95
+ ue(n, s.getChildren()), s.replace(n), r.add(t);
100
96
  }
101
97
  break;
102
98
  }
103
99
  {
104
100
  const n = s.getParent();
105
101
  if ($isRootOrShadowRoot(n) && !r.has(t)) {
106
- r.add(t), ie(s, e);
102
+ r.add(t), ge(s, e);
107
103
  break;
108
104
  }
109
105
  s = n;
@@ -112,86 +108,86 @@ function ne(e) {
112
108
  }
113
109
  }
114
110
  }
115
- function re(e, t) {
111
+ function ue(e, t) {
116
112
  e.splice(e.getChildrenSize(), 0, t);
117
113
  }
118
- function ie(e, t) {
119
- if (Se(e)) return e;
120
- const n = e.getPreviousSibling(), r = e.getNextSibling(), i = fe();
114
+ function ge(e, t) {
115
+ if (Pe(e)) return e;
116
+ const n = e.getPreviousSibling(), r = e.getNextSibling(), i = Te();
121
117
  let s;
122
- if (re(i, e.getChildren()), Se(n) && t === n.getListType()) n.append(i), Se(r) && t === r.getListType() && (re(n, r.getChildren()), r.remove()), s = n;
123
- else if (Se(r) && t === r.getListType()) r.getFirstChildOrThrow().insertBefore(i), s = r;
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;
124
120
  else {
125
- const n = Te(t);
121
+ const n = Fe(t);
126
122
  n.append(i), e.replace(n), s = n;
127
123
  }
128
124
  i.setFormat(e.getFormatType()), i.setIndent(e.getIndent());
129
125
  const o = $getSelection();
130
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;
131
127
  }
132
- function se(e, t) {
128
+ function he(e, t) {
133
129
  const n = e.getLastChild(), r = t.getFirstChild();
134
- n && r && Z(n) && Z(r) && (se(n.getFirstChild(), r.getFirstChild()), r.remove());
130
+ n && r && le(n) && le(r) && (he(n.getFirstChild(), r.getFirstChild()), r.remove());
135
131
  const i = t.getChildren();
136
132
  i.length > 0 && e.append(...i), t.remove();
137
133
  }
138
- function oe() {
139
- const e = $getSelection();
140
- if ($isRangeSelection(e)) {
141
- const t = /* @__PURE__ */ new Set(), r = e.getNodes(), i = e.anchor.getNode();
142
- if (te(i, r)) t.add(Q(i));
143
- else for (let e = 0; e < r.length; e++) {
144
- const i = r[e];
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];
145
141
  if ($isLeafNode(i)) {
146
- const e = $getNearestNodeOfType(i, ge);
147
- null != e && t.add(Q(e));
142
+ const t = $getNearestNodeOfType(i, ye);
143
+ null != t && n.add(se(t));
148
144
  }
149
145
  }
150
- for (const n of t) {
151
- let t = n;
152
- const r = Y(n);
153
- for (const n of r) {
154
- const r = $createParagraphNode().setTextStyle(e.style).setTextFormat(e.format);
155
- re(r, n.getChildren()), t.insertAfter(r), t = r, n.__key === e.anchor.key && $setPointFromCaret(e.anchor, $normalizeCaret($getChildCaret(r, "next"))), n.__key === e.focus.key && $setPointFromCaret(e.focus, $normalizeCaret($getChildCaret(r, "next"))), n.remove();
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();
156
152
  }
157
- n.remove();
153
+ e.remove();
158
154
  }
159
155
  }
160
156
  }
161
- function le(e) {
157
+ function fe(e) {
162
158
  const t = "check" !== e.getListType();
163
159
  let n = e.getStart();
164
- for (const r of e.getChildren()) pe(r) && (r.getValue() !== n && r.setValue(n), t && null != r.getLatest().__checked && r.setChecked(void 0), Se(r.getFirstChild()) || n++);
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++);
165
161
  }
166
- function ce(e) {
162
+ function pe(e) {
167
163
  const t = /* @__PURE__ */ new Set();
168
- if (Z(e) || t.has(e.getKey())) return;
164
+ if (le(e) || t.has(e.getKey())) return;
169
165
  const n = e.getParent(), r = e.getNextSibling(), i = e.getPreviousSibling();
170
- if (Z(r) && Z(i)) {
166
+ if (le(r) && le(i)) {
171
167
  const n = i.getFirstChild();
172
- if (Se(n)) {
168
+ if (Pe(n)) {
173
169
  n.append(e);
174
170
  const i = r.getFirstChild();
175
- if (Se(i)) re(n, i.getChildren()), r.remove(), t.add(r.getKey());
171
+ if (Pe(i)) ue(n, i.getChildren()), r.remove(), t.add(r.getKey());
176
172
  }
177
- } else if (Z(r)) {
173
+ } else if (le(r)) {
178
174
  const t = r.getFirstChild();
179
- if (Se(t)) {
175
+ if (Pe(t)) {
180
176
  const n = t.getFirstChild();
181
177
  null !== n && n.insertBefore(e);
182
178
  }
183
- } else if (Z(i)) {
179
+ } else if (le(i)) {
184
180
  const t = i.getFirstChild();
185
- Se(t) && t.append(e);
186
- } else if (Se(n)) {
181
+ Pe(t) && t.append(e);
182
+ } else if (Pe(n)) {
187
183
  const t = $copyNode(e), s = $copyNode(n);
188
184
  t.append(s), s.append(e), i ? i.insertAfter(t) : r ? r.insertBefore(t) : n.append(t);
189
185
  }
190
186
  }
191
- function ae(e) {
192
- if (Z(e)) return;
187
+ function me(e) {
188
+ if (le(e)) return;
193
189
  const t = e.getParent(), n = t ? t.getParent() : void 0;
194
- if (Se(n ? n.getParent() : void 0) && pe(n) && Se(t)) {
190
+ if (Pe(n ? n.getParent() : void 0) && be(n) && Pe(t)) {
195
191
  const r = t ? t.getFirstChild() : void 0, i = t ? t.getLastChild() : void 0;
196
192
  if (e.is(r)) n.insertBefore(e), t.isEmpty() && n.remove();
197
193
  else if (e.is(i)) n.insertAfter(e), t.isEmpty() && n.remove();
@@ -199,80 +195,80 @@ function ae(e) {
199
195
  const r = $copyNode(e), i = $copyNode(t);
200
196
  r.append(i), e.getPreviousSiblings().forEach((e) => i.append(e));
201
197
  const s = $copyNode(e), o = $copyNode(t);
202
- s.append(o), re(o, e.getNextSiblings()), n.insertBefore(r), n.insertAfter(s), n.replace(e);
198
+ s.append(o), ue(o, e.getNextSiblings()), n.insertBefore(r), n.insertAfter(s), n.replace(e);
203
199
  }
204
200
  }
205
201
  }
206
- function ue(e = !1) {
202
+ function _e(e = !1) {
207
203
  const t = $getSelection();
208
204
  if (!$isRangeSelection(t) || !t.isCollapsed()) return !1;
209
205
  const n = t.anchor.getNode();
210
206
  let r = null;
211
- if (pe(n) && 0 === n.getChildrenSize()) r = n;
207
+ if (be(n) && 0 === n.getChildrenSize()) r = n;
212
208
  else if ($isTextNode(n)) {
213
209
  const e = n.getParent();
214
- pe(e) && e.getChildren().every((e) => $isTextNode(e) && "" === e.getTextContent().trim()) && (r = e);
210
+ be(e) && e.getChildren().every((e) => $isTextNode(e) && "" === e.getTextContent().trim()) && (r = e);
215
211
  }
216
212
  if (null === r) return !1;
217
- const i = Q(r), s = r.getParent();
218
- Se(s) || q(40);
213
+ const i = se(r), s = r.getParent();
214
+ Pe(s) || re(40);
219
215
  const o = s.getParent();
220
216
  let l;
221
217
  if ($isRootOrShadowRoot(o)) l = $createParagraphNode(), i.insertAfter(l);
222
218
  else {
223
- if (!pe(o)) return !1;
219
+ if (!be(o)) return !1;
224
220
  l = $copyNode(o), o.insertAfter(l);
225
221
  }
226
222
  l.setTextStyle(t.style).setTextFormat(t.format).select();
227
- const c = r.getNextSiblings();
228
- if (c.length > 0) {
223
+ const f = r.getNextSiblings();
224
+ if (f.length > 0) {
229
225
  const t = e ? function(e, t) {
230
226
  return e.getStart() + t.getIndexWithinParent();
231
227
  }(s, r) : 1, n = $copyNode(s).setStart(t);
232
- if (pe(l)) {
228
+ if (be(l)) {
233
229
  const e = $copyNode(l);
234
230
  e.append(n), l.insertAfter(e);
235
231
  } else l.insertAfter(n);
236
- n.append(...c);
232
+ n.append(...f);
237
233
  }
238
234
  return function(e) {
239
235
  let t = e;
240
236
  for (; null == t.getNextSibling() && null == t.getPreviousSibling();) {
241
237
  const e = t.getParent();
242
- if (null == e || !pe(e) && !Se(e)) break;
238
+ if (null == e || !be(e) && !Pe(e)) break;
243
239
  t = e;
244
240
  }
245
241
  t.remove();
246
242
  }(r), !0;
247
243
  }
248
- var ge = class extends ElementNode {
244
+ var ye = class extends ElementNode {
249
245
  __value;
250
246
  __checked;
251
247
  $config() {
252
248
  return this.config("listitem", {
253
249
  $transform: (e) => {
254
- const t = e.getParent();
255
- if (Se(t)) "check" !== t.getListType() && null != e.getChecked() && e.setChecked(void 0);
256
- else if (t) {
257
- const n = e.createParentElementNode();
258
- Se(n) || q(340);
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);
259
255
  const i = [e];
260
256
  for (const t of ["previous", "next"]) {
261
257
  i.reverse();
262
258
  for (const { origin: n } of $getSiblingCaret(e, t)) {
263
- if (!pe(n)) break;
259
+ if (!be(n)) break;
264
260
  i.push(n);
265
261
  }
266
262
  }
267
- e.insertBefore(n), n.splice(0, 0, i), $isRootOrShadowRoot(t) || ($insertNodeToNearestRootAtCaret(n, $rewindSiblingCaret($getSiblingCaret(n, "next")), {
263
+ e.insertBefore(r), r.splice(0, 0, i), $isRootOrShadowRoot(n) || ($insertNodeToNearestRootAtCaret(r, $rewindSiblingCaret($getSiblingCaret(r, "next")), {
268
264
  $shouldSplit: () => !1,
269
265
  removeEmptyDestination: !0
270
- }), t.isEmpty() && t.isAttached() && t.remove());
266
+ }), n.isEmpty() && n.isAttached() && n.remove());
271
267
  }
272
268
  },
273
269
  extends: ElementNode,
274
270
  importDOM: buildImportMap({ li: () => ({
275
- conversion: he,
271
+ conversion: Ce,
276
272
  priority: 0
277
273
  }) })
278
274
  });
@@ -287,28 +283,29 @@ var ge = class extends ElementNode {
287
283
  const t = document.createElement("li");
288
284
  return this.updateListItemDOM(null, t, e), t;
289
285
  }
290
- updateListItemDOM(e, t, n) {
291
- (function(e, t, n) {
292
- const r = t.getParent();
293
- !Se(r) || "check" !== r.getListType() || Se(t.getFirstChild()) ? (e.removeAttribute("role"), e.removeAttribute("tabIndex"), e.removeAttribute("aria-checked")) : (e.setAttribute("role", "checkbox"), e.setAttribute("tabIndex", "-1"), n && t.__checked === n.__checked || e.setAttribute("aria-checked", t.getChecked() ? "true" : "false"));
294
- })(t, this, e), t.value = this.__value, function(e, t, n) {
295
- const r = [], o = [], l = t.list, c = l ? l.listitem : void 0;
296
- let a;
297
- l && l.nested && (a = l.nested.listitem);
298
- void 0 !== c && r.push(...normalizeClassNames(c));
299
- if (l) {
300
- const e = n.getParent(), t = Se(e) && "check" === e.getListType(), i = n.getChecked();
301
- t && !i || o.push(l.listitemUnchecked), t && i || o.push(l.listitemChecked), t && r.push(i ? l.listitemChecked : l.listitemUnchecked);
302
- }
303
- if (void 0 !== a) {
304
- const e = normalizeClassNames(a);
305
- n.getChildren().some((e) => Se(e)) ? r.push(...e) : o.push(...e);
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);
306
303
  }
307
- o.length > 0 && removeClassNamesFromElement(e, ...o);
308
- r.length > 0 && addClassNamesToElement(e, ...r);
309
- }(t, n.theme, this);
310
- const r = e ? e.__style : "", o = this.__style;
311
- r !== o && setDOMStyleFromCSS(t.style, o, r), function(e, t, n) {
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) {
312
309
  const r = t.__textStyle, i = n ? n.__textStyle : "";
313
310
  if (null !== n && i === r) return;
314
311
  const s = getStyleObjectFromCSS(r);
@@ -327,7 +324,7 @@ var ge = class extends ElementNode {
327
324
  const t = this.createDOM(e._config), n = this.getFormatType();
328
325
  n && (t.style.textAlign = n);
329
326
  const r = this.getDirection();
330
- return r && (t.dir = r), Z(this) ? {
327
+ return r && (t.dir = r), le(this) ? {
331
328
  after(e) {
332
329
  if (isHTMLElement(e)) {
333
330
  const t = e.previousElementSibling;
@@ -359,10 +356,10 @@ var ge = class extends ElementNode {
359
356
  return this;
360
357
  }
361
358
  replace(e, t) {
362
- if (pe(e)) return super.replace(e);
359
+ if (be(e)) return super.replace(e);
363
360
  this.setIndent(0);
364
361
  const n = this.getParentOrThrow();
365
- if (!Se(n)) return e;
362
+ if (!Pe(n)) return e;
366
363
  if (n.__first === this.getKey()) n.insertBefore(e);
367
364
  else if (n.__last === this.getKey()) n.insertAfter(e);
368
365
  else {
@@ -374,13 +371,17 @@ var ge = class extends ElementNode {
374
371
  }
375
372
  n.insertAfter(e), e.insertAfter(t);
376
373
  }
377
- return t && ($isElementNode(e) || q(139), this.getChildren().forEach((t) => {
378
- e.append(t);
379
- })), this.remove(), 0 === n.getChildrenSize() && n.remove(), e;
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;
380
381
  }
381
382
  insertAfter(e, t = !0) {
382
383
  const n = this.getParentOrThrow();
383
- if (Se(n) || q(39), pe(e)) return super.insertAfter(e, t);
384
+ if (Pe(n) || re(39), be(e)) return super.insertAfter(e, t);
384
385
  const r = this.getNextSiblings();
385
386
  if (n.insertAfter(e, t), 0 !== r.length) {
386
387
  const i = $copyNode(n);
@@ -390,7 +391,7 @@ var ge = class extends ElementNode {
390
391
  }
391
392
  remove(e) {
392
393
  const t = this.getPreviousSibling(), n = this.getNextSibling();
393
- super.remove(e), t && n && Z(t) && Z(n) && (se(t.getFirstChild(), n.getFirstChild()), n.remove());
394
+ super.remove(e), t && n && le(t) && le(n) && (he(t.getFirstChild(), n.getFirstChild()), n.remove());
394
395
  }
395
396
  resetOnCopyNodeFrom(e) {
396
397
  super.resetOnCopyNodeFrom(e), e.getChecked() && this.setChecked(!1);
@@ -402,7 +403,7 @@ var ge = class extends ElementNode {
402
403
  collapseAtStart(e) {
403
404
  const t = $createParagraphNode();
404
405
  this.getChildren().forEach((e) => t.append(e));
405
- const n = this.getParentOrThrow(), r = n.getParentOrThrow(), i = pe(r);
406
+ const n = this.getParentOrThrow(), r = n.getParentOrThrow(), i = be(r);
406
407
  if (1 === n.getChildrenSize()) if (i) n.remove(), r.select();
407
408
  else {
408
409
  n.insertBefore(t), n.remove();
@@ -423,7 +424,7 @@ var ge = class extends ElementNode {
423
424
  const e = this.getLatest();
424
425
  let t;
425
426
  const n = this.getParent();
426
- return Se(n) && (t = n.getListType()), "check" === t ? Boolean(e.__checked) : void 0;
427
+ return Pe(n) && (t = n.getListType()), "check" === t ? Boolean(e.__checked) : void 0;
427
428
  }
428
429
  setChecked(e) {
429
430
  const t = this.getWritable();
@@ -437,23 +438,23 @@ var ge = class extends ElementNode {
437
438
  const e = this.getParent();
438
439
  if (null === e || !this.isAttached()) return this.getLatest().__indent;
439
440
  let t = e.getParentOrThrow(), n = 0;
440
- for (; pe(t);) t = t.getParentOrThrow().getParentOrThrow(), n++;
441
+ for (; be(t);) t = t.getParentOrThrow().getParentOrThrow(), n++;
441
442
  return n;
442
443
  }
443
444
  setIndent(e) {
444
- "number" != typeof e && q(117), (e = Math.floor(e)) >= 0 || q(199);
445
+ "number" != typeof e && re(117), (e = Math.floor(e)) >= 0 || re(199);
445
446
  let t = this.getIndent();
446
- for (; t !== e;) t < e ? (ce(this), t++) : (ae(this), t--);
447
+ for (; t !== e;) t < e ? (pe(this), t++) : (me(this), t--);
447
448
  return this;
448
449
  }
449
450
  canInsertAfter(e) {
450
- return pe(e);
451
+ return be(e);
451
452
  }
452
453
  canReplaceWith(e) {
453
- return pe(e);
454
+ return be(e);
454
455
  }
455
456
  canMergeWith(e) {
456
- return pe(e) || $isParagraphNode(e);
457
+ return be(e) || $isParagraphNode(e);
457
458
  }
458
459
  extractWithChild(e, t) {
459
460
  if (!$isRangeSelection(t)) return !1;
@@ -464,33 +465,44 @@ var ge = class extends ElementNode {
464
465
  return !0;
465
466
  }
466
467
  createParentElementNode() {
467
- return Te("bullet");
468
+ return Fe("bullet");
468
469
  }
469
470
  canMergeWhenEmpty() {
470
471
  return !0;
471
472
  }
472
473
  };
473
- function he(e) {
474
+ function Ce(e) {
474
475
  if (e.classList.contains("task-list-item")) {
475
- for (const t of e.children) if ("INPUT" === t.tagName) return de(t);
476
+ for (const t of e.children) if ("INPUT" === t.tagName) return ve(t);
476
477
  }
477
478
  if (e.classList.contains("joplin-checkbox")) {
478
- for (const t of e.children) if (t.classList.contains("checkbox-wrapper") && t.children.length > 0 && "INPUT" === t.children[0].tagName) return de(t.children[0]);
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]);
479
480
  }
480
- const t = e.getAttribute("aria-checked");
481
- return { node: fe("true" === t || "false" !== t && void 0) };
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
+ };
482
486
  }
483
- function de(e) {
487
+ function ve(e) {
484
488
  if (!("checkbox" === e.getAttribute("type"))) return { node: null };
485
- return { node: fe(e.hasAttribute("checked")) };
489
+ const t = Te(e.hasAttribute("checked"));
490
+ return {
491
+ after: ke.bind(null, t),
492
+ node: t
493
+ };
486
494
  }
487
- function fe(e) {
488
- return $applyNodeReplacement(new ge(void 0, e));
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;
489
498
  }
490
- function pe(e) {
491
- return e instanceof ge;
499
+ function Te(e) {
500
+ return $applyNodeReplacement(new ye(void 0, e));
501
+ }
502
+ function be(e) {
503
+ return e instanceof ye;
492
504
  }
493
- var me = class extends ElementNode {
505
+ var Se = class extends ElementNode {
494
506
  __tag;
495
507
  __start;
496
508
  __listType;
@@ -499,17 +511,17 @@ var me = class extends ElementNode {
499
511
  $transform: (e) => {
500
512
  (function(e) {
501
513
  const t = e.getNextSibling();
502
- Se(t) && e.getListType() === t.getListType() && se(e, t);
503
- })(e), le(e);
514
+ Pe(t) && e.getListType() === t.getListType() && he(e, t);
515
+ })(e), fe(e);
504
516
  },
505
517
  extends: ElementNode,
506
518
  importDOM: buildImportMap({
507
519
  ol: () => ({
508
- conversion: ye,
520
+ conversion: Le,
509
521
  priority: 0
510
522
  }),
511
523
  ul: () => ({
512
- conversion: ye,
524
+ conversion: Le,
513
525
  priority: 0
514
526
  })
515
527
  })
@@ -517,7 +529,7 @@ var me = class extends ElementNode {
517
529
  }
518
530
  constructor(e = "number", t = 1, n) {
519
531
  super(n);
520
- const r = ve[e] || e;
532
+ const r = Ne[e] || e;
521
533
  this.__listType = r, this.__tag = "number" === r ? "ol" : "ul", this.__start = t;
522
534
  }
523
535
  afterCloneFrom(e) {
@@ -542,10 +554,10 @@ var me = class extends ElementNode {
542
554
  }
543
555
  createDOM(e, t) {
544
556
  const n = this.__tag, r = document.createElement(n);
545
- return 1 !== this.__start && r.setAttribute("start", String(this.__start)), r.__lexicalListType = this.__listType, _e(r, e.theme, this), r;
557
+ return 1 !== this.__start && r.setAttribute("start", String(this.__start)), r.__lexicalListType = this.__listType, xe(r, e.theme, this), r;
546
558
  }
547
559
  updateDOM(e, t, n) {
548
- return e.__tag !== this.__tag || e.__listType !== this.__listType || (_e(t, n.theme, this), e.__start !== this.__start && t.setAttribute("start", String(this.__start)), !1);
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);
549
561
  }
550
562
  updateFromJSON(e) {
551
563
  return super.updateFromJSON(e).setListType(e.listType).setStart(e.start);
@@ -569,102 +581,106 @@ var me = class extends ElementNode {
569
581
  return !1;
570
582
  }
571
583
  splice(e, t, n) {
572
- const r = n.find(pe) ?? this.getChildren().find(pe), i = r ? () => $copyNode(r) : fe;
573
- let s = n;
584
+ let r = n;
574
585
  for (let e = 0; e < n.length; e++) {
575
586
  const t = n[e];
576
- pe(t) || (s === n && (s = [...n]), s[e] = i().append(!$isElementNode(t) || Se(t) || t.isInline() ? t : $createTextNode(t.getTextContent())));
587
+ be(t) || (r === n && (r = [...n]), r[e] = this.createListItemNode().append(!$isElementNode(t) || Pe(t) || t.isInline() ? t : $createTextNode(t.getTextContent())));
577
588
  }
578
- return super.splice(e, t, s);
589
+ return super.splice(e, t, r);
579
590
  }
580
591
  extractWithChild(e) {
581
- return pe(e);
592
+ return be(e);
593
+ }
594
+ createListItemNode() {
595
+ return Te();
582
596
  }
583
597
  };
584
- function _e(e, t, n) {
585
- const r = [], o = [], l = t.list;
598
+ function xe(e, t, i) {
599
+ const s = [], o = [], l = t.list;
586
600
  if (void 0 !== l) {
587
- const e = l[`${n.__tag}Depth`] || [], t = G(n) - 1, i = t % e.length, s = e[i], c = l[n.__tag];
601
+ const e = l[`${i.__tag}Depth`] || [], t = ie(i) - 1, n = t % e.length, r = e[n], c = l[i.__tag];
588
602
  let a;
589
603
  const u = l.nested, g = l.checklist;
590
- 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 !== s) {
591
- r.push(...normalizeClassNames(s));
592
- for (let t = 0; t < e.length; t++) t !== i && o.push(n.__tag + t);
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);
593
607
  }
594
608
  if (void 0 !== a) {
595
609
  const e = normalizeClassNames(a);
596
- t > 1 ? r.push(...e) : o.push(...e);
610
+ t > 1 ? s.push(...e) : o.push(...e);
597
611
  }
598
612
  }
599
- o.length > 0 && removeClassNamesFromElement(e, ...o), r.length > 0 && addClassNamesToElement(e, ...r);
600
- }
601
- function Ce(e) {
602
- const t = [];
603
- for (let n = 0; n < e.length; n++) {
604
- const r = e[n];
605
- if (pe(r)) {
606
- t.push(r);
607
- const e = r.getChildren();
608
- e.length > 1 && e.forEach((e) => {
609
- Se(e) && t.push(ee(e));
610
- });
611
- } else t.push(ee(r));
612
- }
613
- return t;
613
+ o.length > 0 && removeClassNamesFromElement(e, ...o), s.length > 0 && addClassNamesToElement(e, ...s);
614
614
  }
615
- function ye(e) {
616
- const t = e.nodeName.toLowerCase();
617
- let n = null;
618
- if ("ol" === t) n = Te("number", e.start);
619
- else "ul" === t && (n = function(e) {
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) {
620
623
  if ("check" === e.getAttribute("__lexicallisttype") || e.classList.contains("contains-task-list") || "1" === e.getAttribute("data-is-checklist")) return !0;
621
624
  for (const t of e.childNodes) if (isHTMLElement$1(t) && t.hasAttribute("aria-checked")) return !0;
622
625
  return !1;
623
- }(e) ? Te("check") : Te("bullet"));
624
- return {
625
- after: Ce,
626
- node: n
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
627
643
  };
628
644
  }
629
- const ve = {
645
+ const Ne = {
630
646
  ol: "number",
631
647
  ul: "bullet"
632
648
  };
633
- function Te(e = "number", t = 1) {
634
- return $applyNodeReplacement(new me(e, t));
649
+ function Fe(e = "number", t = 1) {
650
+ return $applyNodeReplacement(new Se(e, t));
635
651
  }
636
- function Se(e) {
637
- return e instanceof me;
652
+ function Pe(e) {
653
+ return e instanceof Se;
638
654
  }
639
- const ke = createCommand("INSERT_CHECK_LIST_COMMAND");
640
- function be(e, t) {
641
- const n = t && t.disableTakeFocusOnClick || !1, r = "boolean" == typeof n ? () => n : n.peek.bind(n), i = (e) => {
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) => {
642
658
  const t = e.target;
643
659
  if (!isHTMLElement$1(t)) return !1;
644
660
  const n = t.__lexicalCheckListLastHandled;
645
661
  return void 0 !== n && e.timeStamp - n < 500;
646
- }, s = (e) => {
662
+ }, u = (e) => {
647
663
  const t = e.target;
648
664
  isHTMLElement$1(t) && (t.__lexicalCheckListLastHandled = e.timeStamp);
649
- }, a = (e) => {
650
- i(e) || (s(e), Le(e, r()));
651
- }, u = (e) => {
652
- "touch" === e.pointerType && (i(e) || (s(e), Le(e, r())));
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())));
653
669
  }, d = (e) => {
654
670
  (function(e, t) {
655
- xe(e, () => {
671
+ Oe(e, () => {
656
672
  e.preventDefault(), t && e.stopPropagation();
657
673
  });
658
674
  })(e, r());
659
675
  };
660
- return mergeRegister(e.registerCommand(ke, () => (ne("check"), !0), COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ARROW_DOWN_COMMAND, (t) => Pe(t, e, !1), COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ARROW_UP_COMMAND, (t) => Pe(t, e, !0), COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ESCAPE_COMMAND, () => {
661
- if (null != Ne()) return e.getRootElement()?.focus(), !0;
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;
662
678
  return !1;
663
679
  }, COMMAND_PRIORITY_LOW), e.registerCommand(KEY_SPACE_COMMAND, (t) => {
664
- const n = Ne();
680
+ const n = we();
665
681
  return !(null == n || !e.isEditable()) && (e.update(() => {
666
682
  const e = $getNearestNodeFromDOMNode(n);
667
- pe(e) && (t.preventDefault(), e.toggleChecked());
683
+ be(e) && (t.preventDefault(), e.toggleChecked());
668
684
  }), !0);
669
685
  }, COMMAND_PRIORITY_LOW), e.registerCommand(KEY_ARROW_LEFT_COMMAND, (t) => e.getEditorState().read(() => {
670
686
  const n = $getSelection();
@@ -672,9 +688,9 @@ function be(e, t) {
672
688
  const { anchor: r } = n, i = "element" === r.type;
673
689
  if (i || 0 === r.offset) {
674
690
  const n = r.getNode(), s = $findMatchingParent(n, (e) => $isElementNode(e) && !e.isInline());
675
- if (pe(s)) {
691
+ if (be(s)) {
676
692
  const r = s.getParent();
677
- if (Se(r) && "check" === r.getListType() && (i || s.getFirstDescendant() === n)) {
693
+ if (Pe(r) && "check" === r.getListType() && (i || s.getFirstDescendant() === n)) {
678
694
  const n = e.getElementByKey(s.__key);
679
695
  if (null != n && document.activeElement !== n) return n.focus(), t.preventDefault(), !0;
680
696
  }
@@ -683,57 +699,57 @@ function be(e, t) {
683
699
  }
684
700
  return !1;
685
701
  }), COMMAND_PRIORITY_LOW), e.registerRootListener((e) => {
686
- if (null !== e) return e.addEventListener("click", a), e.addEventListener("pointerup", u), e.addEventListener("pointerdown", d, { capture: !0 }), e.addEventListener("mousedown", d, { capture: !0 }), e.addEventListener("touchstart", d, {
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, {
687
703
  capture: !0,
688
704
  passive: !1
689
705
  }), () => {
690
- e.removeEventListener("click", a), e.removeEventListener("pointerup", u), e.removeEventListener("pointerdown", d, { capture: !0 }), e.removeEventListener("mousedown", d, { capture: !0 }), e.removeEventListener("touchstart", d, { capture: !0 });
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 });
691
707
  };
692
708
  }));
693
709
  }
694
- function xe(e, t) {
710
+ function Oe(e, t) {
695
711
  const n = e.target;
696
712
  if (!isHTMLElement$1(n)) return;
697
713
  const r = n.firstChild;
698
714
  if (isHTMLElement$1(r) && ("UL" === r.tagName || "OL" === r.tagName)) return;
699
- const i = n.parentNode;
700
- if (!i || "check" !== i.__lexicalListType) return;
701
- let s = null, l = null;
702
- if ("clientX" in e) s = e.clientX;
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;
703
719
  else if ("touches" in e) {
704
720
  const t = e.touches;
705
- t.length > 0 && (s = t[0].clientX, l = "touch");
721
+ t.length > 0 && (o = t[0].clientX, c = "touch");
706
722
  }
707
- if (null == s) return;
708
- const c = n.getBoundingClientRect(), u = s / calculateZoomLevel(n), g = window.getComputedStyle ? window.getComputedStyle(n, "::before") : { width: "0px" }, h = parseFloat(g.width), d = "touch" === l || "pointerType" in e && "touch" === e.pointerType ? 32 : 0;
709
- ("rtl" === n.dir ? u < c.right + d && u > c.right - h - d : u > c.left - d && u < c.left + h + d) && t();
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();
710
726
  }
711
- function Le(e, t) {
712
- xe(e, () => {
727
+ function Ie(e, t) {
728
+ Oe(e, () => {
713
729
  if (isHTMLElement$1(e.target)) {
714
730
  const n = e.target, r = getNearestEditorFromDOMNode(n);
715
731
  null != r && r.isEditable() && r.update(() => {
716
732
  const e = $getNearestNodeFromDOMNode(n);
717
- pe(e) && (t ? ($addUpdateTag(SKIP_SELECTION_FOCUS_TAG), $addUpdateTag(SKIP_DOM_SELECTION_TAG)) : n.focus(), e.toggleChecked());
733
+ be(e) && (t ? ($addUpdateTag(SKIP_SELECTION_FOCUS_TAG), $addUpdateTag(SKIP_DOM_SELECTION_TAG)) : n.focus(), e.toggleChecked());
718
734
  });
719
735
  }
720
736
  });
721
737
  }
722
- function Ne() {
738
+ function we() {
723
739
  const e = document.activeElement;
724
740
  return isHTMLElement$1(e) && "LI" === e.tagName && null != e.parentNode && "check" === e.parentNode.__lexicalListType ? e : null;
725
741
  }
726
- function Pe(e, t, n) {
727
- const r = Ne();
742
+ function De(e, t, n) {
743
+ const r = we();
728
744
  return null != r && t.update(() => {
729
745
  const i = $getNearestNodeFromDOMNode(r);
730
- if (!pe(i)) return;
746
+ if (!be(i)) return;
731
747
  const s = function(e, t) {
732
748
  let n = t ? e.getPreviousSibling() : e.getNextSibling(), r = e;
733
- for (; null == n && pe(r);) r = r.getParentOrThrow().getParent(), null != r && (n = t ? r.getPreviousSibling() : r.getNextSibling());
734
- for (; pe(n);) {
749
+ for (; null == n && be(r);) r = r.getParentOrThrow().getParent(), null != r && (n = t ? r.getPreviousSibling() : r.getNextSibling());
750
+ for (; be(n);) {
735
751
  const e = t ? n.getLastChild() : n.getFirstChild();
736
- if (!Se(e)) return n;
752
+ if (!Pe(e)) return n;
737
753
  n = t ? e.getLastChild() : e.getFirstChild();
738
754
  }
739
755
  return null;
@@ -747,12 +763,12 @@ function Pe(e, t, n) {
747
763
  }
748
764
  }), !1;
749
765
  }
750
- const Fe = createCommand("UPDATE_LIST_START_COMMAND"), Ee = createCommand("INSERT_UNORDERED_LIST_COMMAND"), Oe = createCommand("INSERT_ORDERED_LIST_COMMAND"), Ae = createCommand("REMOVE_LIST_COMMAND");
751
- function Ie(e, t) {
752
- return mergeRegister(e.registerCommand(Oe, () => (ne("number"), !0), COMMAND_PRIORITY_LOW), e.registerCommand(Fe, (e) => {
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) => {
753
769
  const { listNodeKey: t, newStart: n } = e, r = $getNodeByKey(t);
754
- return !!Se(r) && ("number" === r.getListType() && (r.setStart(n), le(r)), !0);
755
- }, COMMAND_PRIORITY_LOW), e.registerCommand(Ee, () => (ne("bullet"), !0), COMMAND_PRIORITY_LOW), e.registerCommand(Ae, () => (oe(), !0), COMMAND_PRIORITY_LOW), e.registerCommand(INSERT_PARAGRAPH_COMMAND, () => ue(!!(t && t.restoreNumbering)), COMMAND_PRIORITY_LOW), e.registerNodeTransform(ge, (e) => {
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) => {
756
772
  const t = e.getFirstChild();
757
773
  if (t) {
758
774
  if ($isTextNode(t)) {
@@ -765,75 +781,145 @@ function Ie(e, t) {
765
781
  }
766
782
  }), e.registerNodeTransform(TextNode, (e) => {
767
783
  const t = e.getParent();
768
- if (pe(t) && e.is(t.getFirstChild())) {
784
+ if (be(t) && e.is(t.getFirstChild())) {
769
785
  const n = e.getStyle(), r = e.getFormat();
770
786
  n === t.getTextStyle() && r === t.getTextFormat() || t.setTextStyle(n).setTextFormat(r);
771
787
  }
772
788
  }));
773
789
  }
774
- function we(e) {
790
+ function We(e) {
775
791
  const t = (e) => {
776
792
  const t = e.getParent();
777
- if (Se(e.getFirstChild()) || !Se(t)) return;
778
- const n = $findMatchingParent(e, (e) => pe(e) && Se(e.getParent()) && pe(e.getPreviousSibling()));
793
+ if (Pe(e.getFirstChild()) || !Pe(t)) return;
794
+ const n = $findMatchingParent(e, (e) => be(e) && Pe(e.getParent()) && be(e.getPreviousSibling()));
779
795
  if (null === n && e.getIndent() > 0) e.setIndent(0);
780
- else if (pe(n)) {
796
+ else if (be(n)) {
781
797
  const r = n.getPreviousSibling();
782
- if (pe(r)) {
798
+ if (be(r)) {
783
799
  const i = function(e) {
784
800
  let t = e, n = t.getFirstChild();
785
- for (; Se(n);) {
801
+ for (; Pe(n);) {
786
802
  const e = n.getLastChild();
787
- if (!pe(e)) break;
803
+ if (!be(e)) break;
788
804
  t = e, n = t.getFirstChild();
789
805
  }
790
806
  return t;
791
807
  }(r).getParent();
792
- if (Se(i)) {
793
- const n = G(i);
794
- n + 1 < G(t) && e.setIndent(n);
808
+ if (Pe(i)) {
809
+ const n = ie(i);
810
+ n + 1 < ie(t) && e.setIndent(n);
795
811
  }
796
812
  }
797
813
  }
798
814
  };
799
- return e.registerNodeTransform(me, (e) => {
815
+ return e.registerNodeTransform(Se, (e) => {
800
816
  const n = [e];
801
817
  for (; n.length > 0;) {
802
818
  const e = n.shift();
803
- if (Se(e)) {
804
- for (const r of e.getChildren()) if (pe(r)) {
819
+ if (Pe(e)) {
820
+ for (const r of e.getChildren()) if (be(r)) {
805
821
  t(r);
806
822
  const e = r.getFirstChild();
807
- Se(e) && n.push(e);
823
+ Pe(e) && n.push(e);
808
824
  }
809
825
  }
810
826
  }
811
827
  });
812
828
  }
813
- function De(e, t) {
814
- e.update(() => ne(t));
815
- }
816
- function Me(e) {
817
- e.update(() => oe());
818
- }
819
- const Re = defineExtension({
820
- build: (e, n, r) => namedSignals(n),
829
+ const Ue = defineExtension({
830
+ build: (e, t, n) => namedSignals(t),
821
831
  config: safeCast({
822
832
  hasStrictIndent: !1,
823
833
  shouldPreserveNumbering: !1
824
834
  }),
825
835
  name: "@lexical/list/List",
826
- nodes: () => [me, ge],
827
- register(t, n, r) {
828
- const i = r.getOutput();
829
- return mergeRegister(effect(() => Ie(t, { restoreNumbering: i.shouldPreserveNumbering.value })), effect(() => i.hasStrictIndent.value ? we(t) : void 0));
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));
830
840
  }
831
- }), Ke = defineExtension({
832
- build: (e, n) => namedSignals(n),
841
+ }), Je = defineExtension({
842
+ build: (e, t) => namedSignals(t),
833
843
  config: safeCast({ disableTakeFocusOnClick: !1 }),
834
- dependencies: [Re],
844
+ dependencies: [Ue],
835
845
  name: "@lexical/list/CheckList",
836
- register: (e, t, n) => be(e, n.getOutput())
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"
837
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
+ }
838
924
  //#endregion
839
- export { fe as $createListItemNode, Te as $createListNode, G as $getListDepth, ue as $handleListInsertParagraph, ne as $insertList, pe as $isListItemNode, Se as $isListNode, oe as $removeList, Ke as CheckListExtension, ke as INSERT_CHECK_LIST_COMMAND, Oe as INSERT_ORDERED_LIST_COMMAND, Ee as INSERT_UNORDERED_LIST_COMMAND, Re as ListExtension, ge as ListItemNode, me as ListNode, Ae as REMOVE_LIST_COMMAND, Fe as UPDATE_LIST_START_COMMAND, De as insertList, be as registerCheckList, Ie as registerList, we as registerListStrictIndentTransform, Me as removeList };
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 };