@etrepum/lexical-builder-markdown 0.0.27-nightly.20240701.0 → 0.0.28-nightly.20240702.0

package/dist/MarkdownExport.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MarkdownExport.d.ts","sourceRoot":"","sources":["../src/MarkdownExport.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAOH,OAAO,KAAK,EACV,WAAW,EAIZ,MAAM,SAAS,CAAC;AAajB,OAAO,KAAK,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAE9E;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,kBAAkB,EAC1B,EAAE,sBAAsB,EAAE,EAAE,0BAA0B,GACrD,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,MAAM,CAsChC"}
+{"version":3,"file":"MarkdownExport.d.ts","sourceRoot":"","sources":["../src/MarkdownExport.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH,OAAO,KAAK,EACV,WAAW,EAIZ,MAAM,SAAS,CAAC;AAWjB,OAAO,KAAK,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAE9E;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,kBAAkB,EAC1B,EAAE,sBAAsB,EAAE,EAAE,0BAA0B,GACrD,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,MAAM,CAsChC"}

package/dist/MarkdownImport.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MarkdownImport.d.ts","sourceRoot":"","sources":["../src/MarkdownImport.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAmBH,OAAO,EAML,WAAW,EACZ,MAAM,SAAS,CAAC;AAIjB,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AASzE;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,kBAAkB,EAC1B,cAAc,EAAE,0BAA0B,GACzC,CACD,cAAc,EAAE,MAAM,EACtB,OAAO,CAAC,EAAE,0BAA0B,KACjC,WAAW,EAAE,CA0DjB"}
+{"version":3,"file":"MarkdownImport.d.ts","sourceRoot":"","sources":["../src/MarkdownImport.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAUH,OAAO,EAOL,KAAK,WAAW,EACjB,MAAM,SAAS,CAAC;AAYjB,OAAO,EACL,KAAK,0BAA0B,EAC/B,KAAK,kBAAkB,EACxB,MAAM,SAAS,CAAC;AASjB;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,kBAAkB,EAC1B,cAAc,EAAE,0BAA0B,GACzC,CACD,cAAc,EAAE,MAAM,EACtB,OAAO,CAAC,EAAE,0BAA0B,KACjC,WAAW,EAAE,CA0DjB"}

package/dist/MarkdownShortcutsPlan.d.ts

@@ -3,11 +3,11 @@ import { TransformersByType } from './types';
 
 export declare function registerMarkdownShortcuts(editor: LexicalEditor, byType: TransformersByType): () => void;
 export interface MarkdownShortcutsConfig {
-    enabled: boolean;
+    disabled: boolean;
 }
 export interface MarkdownShortcutsOutput {
-    getEnabled: () => boolean;
-    setEnabled: (enabled: boolean) => void;
+    isDisabled: () => boolean;
+    setDisabled: (disabled: boolean) => void;
 }
 export declare const MarkdownShortcutsPlan: import('@etrepum/lexical-builder').LexicalPlan<MarkdownShortcutsConfig, "@etrepum/lexical-builder-markdown/MarkdownShortcuts", MarkdownShortcutsOutput, unknown>;
 //# sourceMappingURL=MarkdownShortcutsPlan.d.ts.map

package/dist/MarkdownShortcutsPlan.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MarkdownShortcutsPlan.d.ts","sourceRoot":"","sources":["../src/MarkdownShortcutsPlan.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH,OAAO,EAEL,KAAK,aAAa,EAUnB,MAAM,SAAS,CAAC;AAKjB,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AA0SlD,wBAAgB,yBAAyB,CACvC,MAAM,EAAE,aAAa,EACrB,MAAM,EAAE,kBAAkB,GACzB,MAAM,IAAI,CA+FZ;AAED,MAAM,WAAW,uBAAuB;IACtC,OAAO,EAAE,OAAO,CAAC;CAClB;AACD,MAAM,WAAW,uBAAuB;IACtC,UAAU,EAAE,MAAM,OAAO,CAAC;IAC1B,UAAU,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,IAAI,CAAC;CACxC;AAED,eAAO,MAAM,qBAAqB,kKA6BhC,CAAC"}
+{"version":3,"file":"MarkdownShortcutsPlan.d.ts","sourceRoot":"","sources":["../src/MarkdownShortcutsPlan.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAQH,OAAO,EAEL,KAAK,aAAa,EAUnB,MAAM,SAAS,CAAC;AASjB,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AA0SlD,wBAAgB,yBAAyB,CACvC,MAAM,EAAE,aAAa,EACrB,MAAM,EAAE,kBAAkB,GACzB,MAAM,IAAI,CA+FZ;AAED,MAAM,WAAW,uBAAuB;IACtC,QAAQ,EAAE,OAAO,CAAC;CACnB;AACD,MAAM,WAAW,uBAAuB;IACtC,UAAU,EAAE,MAAM,OAAO,CAAC;IAC1B,WAAW,EAAE,CAAC,QAAQ,EAAE,OAAO,KAAK,IAAI,CAAC;CAC1C;AAED,eAAO,MAAM,qBAAqB,kKAmBhC,CAAC"}

package/dist/MarkdownTransformersPlan.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MarkdownTransformersPlan.d.ts","sourceRoot":"","sources":["../src/MarkdownTransformersPlan.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AACxD,OAAO,KAAK,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAC9E,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAGxD,MAAM,MAAM,0BAA0B,GAAG,0BAA0B,GAAG;KACnE,CAAC,IAAI,MAAM,kBAAkB,IAAI,GAAG,CAAC,cAAc,GAAG,kBAAkB,CAAC,CAAC,CAAC;CAC7E,CAAC;AASF,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,kBAAkB,EAAE,0BAA0B,CAAC;IACxD,QAAQ,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAChD,QAAQ,CAAC,eAAe,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;IAClE,QAAQ,CAAC,eAAe,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;CACnE;AAED,eAAO,MAAM,wBAAwB,8LAuCnC,CAAC"}
+{"version":3,"file":"MarkdownTransformersPlan.d.ts","sourceRoot":"","sources":["../src/MarkdownTransformersPlan.ts"],"names":[],"mappings":"AAmBA,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AACxD,OAAO,KAAK,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AAC9E,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAGxD,MAAM,MAAM,0BAA0B,GAAG,0BAA0B,GAAG;KACnE,CAAC,IAAI,MAAM,kBAAkB,IAAI,GAAG,CAAC,cAAc,GAAG,kBAAkB,CAAC,CAAC,CAAC;CAC7E,CAAC;AAYF,MAAM,WAAW,0BAA0B;IACzC,QAAQ,CAAC,kBAAkB,EAAE,0BAA0B,CAAC;IACxD,QAAQ,CAAC,kBAAkB,EAAE,kBAAkB,CAAC;IAChD,QAAQ,CAAC,eAAe,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;IAClE,QAAQ,CAAC,eAAe,EAAE,UAAU,CAAC,OAAO,oBAAoB,CAAC,CAAC;CACnE;AAED,eAAO,MAAM,wBAAwB,8LAsDnC,CAAC"}

package/dist/index.js

@@ -1,242 +1,242 @@
-import { definePlan as G, RichTextPlan as rt, safeCast as U, getKnownTypesAndNodes as st, provideOutput as q } from "@etrepum/lexical-builder";
-import { ELEMENT_TRANSFORMERS as it, TEXT_FORMAT_TRANSFORMERS as ct, TEXT_MATCH_TRANSFORMERS as lt } from "@lexical/markdown";
-import { $createCodeNode as at, $isCodeNode as ft } from "@lexical/code";
-import { $isListNode as B, $isListItemNode as ut } from "@lexical/list";
-import { $isQuoteNode as gt } from "@lexical/rich-text";
-import { $findMatchingParent as dt, IS_SAFARI as O, IS_IOS as A, IS_APPLE_WEBKIT as y } from "@lexical/utils";
-import { $getSelection as N, $setSelection as H, $isParagraphNode as Q, $isTextNode as x, $createParagraphNode as V, $isElementNode as E, $createTextNode as Y, $createLineBreakNode as pt, $isRootOrShadowRoot as J, $getRoot as mt, $isDecoratorNode as Z, $isLineBreakNode as tt, $isRangeSelection as v, $createRangeSelection as ht } from "lexical";
-function L(t, o) {
-  const r = {};
-  for (const e of t) {
-    const i = o(e);
-    r[i] ? r[i].push(e) : r[i] = [e];
+import { definePlan as G, RichTextPlan as se, declarePeerDependency as ie, safeCast as H, getKnownTypesAndNodes as ce, provideOutput as q, disabledToggle as le } from "@etrepum/lexical-builder";
+import { ELEMENT_TRANSFORMERS as ae, TEXT_FORMAT_TRANSFORMERS as fe, TEXT_MATCH_TRANSFORMERS as ue, UNORDERED_LIST as ge, CHECK_LIST as de } from "@lexical/markdown";
+import { $getSelection as C, $setSelection as Q, $isParagraphNode as V, $isTextNode as x, $createParagraphNode as Y, $isElementNode as N, $createTextNode as J, $createLineBreakNode as pe, $isRootOrShadowRoot as Z, $getRoot as me, $isDecoratorNode as ee, $isLineBreakNode as te, $isRangeSelection as P, $createRangeSelection as he } from "lexical";
+import { $createCodeNode as xe, $isCodeNode as Te } from "@lexical/code";
+import { $isListNode as L, $isListItemNode as Se } from "@lexical/list";
+import { $isQuoteNode as Ce } from "@lexical/rich-text";
+import { $findMatchingParent as Ne, IS_SAFARI as O, IS_IOS as A, IS_APPLE_WEBKIT as B } from "@lexical/utils";
+function y(e, t) {
+  const n = {};
+  for (const r of e) {
+    const i = t(r);
+    n[i] ? n[i].push(r) : n[i] = [r];
   }
-  return r;
+  return n;
 }
-const $ = /[!-/:-@[-`{-~\s]/, xt = /^\s{0,3}$/;
-function k(t) {
-  if (!Q(t))
+const $ = /[!-/:-@[-`{-~\s]/, Ee = /^\s{0,3}$/;
+function _(e) {
+  if (!V(e))
     return !1;
-  const o = t.getFirstChild();
-  return o == null || t.getChildrenSize() === 1 && x(o) && xt.test(o.getTextContent());
+  const t = e.getFirstChild();
+  return t == null || e.getChildrenSize() === 1 && x(t) && Ee.test(t.getTextContent());
 }
-function Tt(t) {
-  return function(...r) {
-    const e = N(), i = e ? e.clone() : null, n = t(...r), c = N(), s = i && i.is(e) && !Object.isFrozen(e) ? e : i;
-    return c !== s && H(s), n;
+function $e(e) {
+  return function(...n) {
+    const r = C(), i = r ? r.clone() : null, o = e(...n), c = C(), s = i && i.is(r) && !Object.isFrozen(r) ? r : i;
+    return c !== s && Q(s), o;
   };
 }
-function T(t, o, ...r) {
-  if (!t)
+function T(e, t, ...n) {
+  if (!e)
     throw new Error(
-      r.reduce((e, i) => e.replace("%s", String(i)), o || "")
+      n.reduce((r, i) => r.replace("%s", String(i)), t || "")
     );
 }
 const D = /^[ \t]*```(\w{1,10})?\s?$/;
-function St(t, o) {
-  const r = $t(
-    t.textFormat || []
+function we(e, t) {
+  const n = _e(
+    e.textFormat
   );
-  return function(i, { shouldPreserveNewlines: n } = o) {
+  return function(i, { shouldPreserveNewlines: o } = t) {
     const c = i.split(`
-`), s = c.length, l = V();
+`), s = c.length, l = Y();
     for (let f = 0; f < s; f++) {
-      const m = c[f], [g, u] = Et(c, f, l);
+      const m = c[f], [g, u] = Me(c, f, l);
       if (g != null) {
         f = u;
         continue;
       }
-      Nt(
+      Re(
         m,
         l,
-        t.element,
-        r,
-        t.textMatch
+        e.element,
+        n,
+        e.textMatch
       );
     }
     const a = [];
     for (let f = l.getFirstChild(); f; f = f.getNextSibling())
       T(
-        E(f),
+        N(f),
         "markdownImport: Expected child of type %s to be an ElementNode",
         f.getType()
-      ), (n || !k(f)) && a.push(f);
+      ), (o || !_(f)) && a.push(f);
     return l.clear(), a;
   };
 }
-function Nt(t, o, r, e, i) {
-  const n = t.trim(), c = Y(n), s = V();
-  s.append(c), o.append(s);
-  for (const { regExp: l, replace: a } of r) {
-    const f = t.match(l);
+function Re(e, t, n, r, i) {
+  const o = e.trim(), c = J(o), s = Y();
+  s.append(c), t.append(s);
+  for (const { regExp: l, replace: a } of n) {
+    const f = e.match(l);
     if (f) {
-      c.setTextContent(t.slice(f[0].length)), a(s, [c], f, !0);
+      c.setTextContent(e.slice(f[0].length)), a(s, [c], f, !0);
       break;
     }
   }
-  if (C(
+  if (E(
     c,
-    e,
+    r,
     i
-  ), s.isAttached() && n.length > 0) {
+  ), s.isAttached() && o.length > 0) {
     const l = s.getPreviousSibling();
-    if (Q(l) || gt(l) || B(l)) {
+    if (V(l) || Ce(l) || L(l)) {
       let a = l;
-      if (B(l)) {
+      if (L(l)) {
         const f = l.getLastDescendant();
-        f == null ? a = null : a = dt(f, ut);
+        f == null ? a = null : a = Ne(f, Se);
       }
       a != null && a.getTextContentSize() > 0 && (a.splice(a.getChildrenSize(), 0, [
-        pt(),
+        pe(),
         ...s.getChildren()
       ]), s.remove());
     }
   }
 }
-function Et(t, o, r) {
-  const e = t[o].match(D);
-  if (e) {
-    let i = o;
-    const n = t.length;
-    for (; ++i < n; )
-      if (t[i].match(D)) {
-        const s = at(e[1]), l = Y(
-          t.slice(o + 1, i).join(`
+function Me(e, t, n) {
+  const r = D.exec(e[t]);
+  if (r) {
+    let i = t;
+    const o = e.length;
+    for (; ++i < o; )
+      if (D.exec(e[i])) {
+        const s = xe(r[1]), l = J(
+          e.slice(t + 1, i).join(`
 `)
         );
-        return s.append(l), r.append(s), [s, i];
+        return s.append(l), n.append(s), [s, i];
       }
   }
-  return [null, o];
+  return [null, t];
 }
-function C(t, o, r) {
-  const e = t.getTextContent(), i = Ct(e, o);
+function E(e, t, n) {
+  const r = e.getTextContent(), i = Pe(r, t);
   if (!i) {
-    et(t, r);
+    ne(e, n);
     return;
   }
   T(
     i[1] !== void 0 && i[2] !== void 0,
     "importTextMatchTransformers: expecting match with two groups"
   );
-  let n, c, s;
-  if (i[0] === e)
-    n = t;
+  let o, c, s;
+  if (i[0] === r)
+    o = e;
   else {
     const a = i.index || 0, f = a + i[0].length;
-    a === 0 ? [n, c] = t.splitText(f) : [s, n, c] = t.splitText(
+    a === 0 ? [o, c] = e.splitText(f) : [s, o, c] = e.splitText(
       a,
       f
     );
   }
   T(
-    n !== void 0,
+    o !== void 0,
     "importTextMatchTransformers: currentNode must be defined"
-  ), n.setTextContent(i[2]);
-  const l = o.transformersByTag[i[1]];
+  ), o.setTextContent(i[2]);
+  const l = t.transformersByTag[i[1]];
   if (l)
     for (const a of l.format)
-      n.hasFormat(a) || n.toggleFormat(a);
-  n.hasFormat("code") || C(
-    n,
+      o.hasFormat(a) || o.toggleFormat(a);
+  o.hasFormat("code") || E(
     o,
-    r
-  ), s && C(
+    t,
+    n
+  ), s && E(
     s,
-    o,
-    r
-  ), c && C(
+    t,
+    n
+  ), c && E(
     c,
-    o,
-    r
+    t,
+    n
   );
 }
-function et(t, o) {
-  let r = t;
-  t: for (; r; ) {
-    for (const e of o) {
-      const i = r.getTextContent().match(e.importRegExp);
+function ne(e, t) {
+  let n = e;
+  e: for (; n; ) {
+    for (const r of t) {
+      const i = n.getTextContent().match(r.importRegExp);
       if (!i)
         continue;
-      const n = i.index || 0, c = n + i[0].length;
+      const o = i.index || 0, c = o + i[0].length;
       let s, l;
-      if (n === 0) {
-        const a = r.splitText(c);
+      if (o === 0) {
+        const a = n.splitText(c);
         T(
-          a[0] !== void 0 && a[1] !== void 0,
-          "importTextMatchTransformers: splitText expected two nodes"
-        ), [s, r] = a;
+          a[0] !== void 0,
+          "importTextMatchTransformers: splitText expected at least one node"
+        ), [s, n] = a;
       } else {
-        const a = r.splitText(n, c);
+        const a = n.splitText(o, c);
         T(
-          a[1] !== void 0 && a[2] !== void 0,
-          "importTextMatchTransformers: splitText expected three nodes"
-        ), [, s, l] = a, l && et(l, o);
+          a[1] !== void 0,
+          "importTextMatchTransformers: splitText expected at least two nodes"
+        ), [, s, l] = a, l && ne(l, t);
       }
-      e.replace(s, i);
-      continue t;
+      r.replace(s, i);
+      continue e;
     }
     break;
   }
 }
-function Ct(t, o) {
-  const r = t.match(o.openTagsRegExp);
-  if (r == null)
+function Pe(e, t) {
+  const n = e.match(t.openTagsRegExp);
+  if (n == null)
     return null;
-  for (const e of r) {
-    const i = e.replace(/^\s/, ""), n = o.fullMatchRegExpByTag[i];
-    if (n == null)
+  for (const r of n) {
+    const i = r.replace(/^\s/, ""), o = t.fullMatchRegExpByTag[i];
+    if (o == null)
       continue;
-    const c = t.match(n), s = o.transformersByTag[i];
+    const c = e.match(o), s = t.transformersByTag[i];
     if (c != null && s != null) {
       if (s.intraword !== !1)
         return c;
-      const { index: l = 0 } = c, a = t[l - 1], f = t[l + c[0].length];
+      const { index: l = 0 } = c, a = e[l - 1], f = e[l + c[0].length];
       if ((!a || $.test(a)) && (!f || $.test(f)))
         return c;
     }
   }
   return null;
 }
-function $t(t) {
-  const o = {}, r = {}, e = [], i = "(?<![\\\\])";
-  for (const n of t) {
-    const { tag: c } = n;
-    o[c] = n;
+function _e(e) {
+  const t = {}, n = {}, r = [], i = "(?<![\\\\])";
+  for (const o of e) {
+    const { tag: c } = o;
+    t[c] = o;
     const s = c.replace(/(\*|\^|\+)/g, "\\$1");
-    e.push(s), O || A || y ? r[c] = new RegExp(
+    r.push(s), O || A || B ? n[c] = new RegExp(
       `(${s})(?![${s}\\s])(.*?[^${s}\\s])${s}(?!${s})`
-    ) : r[c] = new RegExp(
+    ) : n[c] = new RegExp(
       `(?<![\\\\${s}])(${s})((\\\\${s})?.*?[^${s}\\s](\\\\${s})?)((?<!\\\\)|(?<=\\\\\\\\))(${s})(?![\\\\${s}])`
     );
   }
   return {
     // Reg exp to find open tag + content + close tag
-    fullMatchRegExpByTag: r,
+    fullMatchRegExpByTag: n,
     // Reg exp to find opening tags
     openTagsRegExp: new RegExp(
-      (O || A || y ? "" : `${i}`) + "(" + e.join("|") + ")",
+      `${O || A || B ? "" : i}(${r.join("|")})`,
       "g"
     ),
-    transformersByTag: o
+    transformersByTag: t
   };
 }
-function wt(t, { shouldPreserveNewlines: o }) {
-  const r = !o, e = t.textFormat.filter(
+function ke(e, { shouldPreserveNewlines: t }) {
+  const n = !t, r = e.textFormat.filter(
     (i) => i.format.length === 1
   );
-  return function(n = mt()) {
-    const c = [], s = J(n) ? n.getChildren() : [n];
+  return function(o = me()) {
+    const c = [], s = Z(o) ? o.getChildren() : [o];
     for (let l = 0; l < s.length; l++) {
-      const a = s[l], f = Rt(
+      const a = s[l], f = Fe(
         a,
-        t.element,
-        e,
-        t.textMatch
+        e.element,
+        r,
+        e.textMatch
       );
       f != null && c.push(
         // separate consecutive group of texts with a line break: eg. ["hello", "world"] -> ["hello", "\nworld"]
-        r && l > 0 && !k(a) && !k(s[l - 1]) ? `
+        n && l > 0 && !_(a) && !_(s[l - 1]) ? `
 `.concat(f) : f
       );
     }
@@ -244,158 +244,169 @@ function wt(t, { shouldPreserveNewlines: o }) {
 `);
   };
 }
-function Rt(t, o, r, e) {
-  for (const i of o) {
-    const n = i.export(
-      t,
-      (c) => w(c, r, e)
+function Fe(e, t, n, r) {
+  for (const i of t) {
+    const o = i.export(
+      e,
+      (c) => w(c, n, r)
     );
-    if (n != null)
-      return n;
+    if (o != null)
+      return o;
   }
-  return E(t) ? w(t, r, e) : Z(t) ? t.getTextContent() : null;
+  return N(e) ? w(e, n, r) : ee(e) ? e.getTextContent() : null;
 }
-function w(t, o, r) {
-  const e = [], i = t.getChildren();
-  t: for (const n of i) {
-    for (const c of r) {
+function w(e, t, n) {
+  const r = [], i = e.getChildren();
+  e: for (const o of i) {
+    for (const c of n) {
       const s = c.export(
-        n,
+        o,
         (l) => w(
           l,
-          o,
-          r
+          t,
+          n
         ),
-        (l, a) => K(l, a, o)
+        (l, a) => K(l, a, t)
       );
       if (s != null) {
-        e.push(s);
-        continue t;
+        r.push(s);
+        continue e;
       }
     }
-    tt(n) ? e.push(`
-`) : x(n) ? e.push(
-      K(n, n.getTextContent(), o)
-    ) : E(n) ? e.push(
-      w(n, o, r)
-    ) : Z(n) && e.push(n.getTextContent());
+    te(o) ? r.push(`
+`) : x(o) ? r.push(
+      K(o, o.getTextContent(), t)
+    ) : N(o) ? r.push(
+      w(o, t, n)
+    ) : ee(o) && r.push(o.getTextContent());
   }
-  return e.join("");
+  return r.join("");
 }
-function K(t, o, r) {
-  const e = o.trim();
-  let i = e;
-  const n = /* @__PURE__ */ new Set();
-  for (const c of r) {
+function K(e, t, n) {
+  const r = t.trim();
+  let i = r;
+  const o = /* @__PURE__ */ new Set();
+  for (const c of n) {
     const s = c.format[0], l = c.tag;
     if (T(
       s !== void 0,
       "TextFormatTransformer for tag %s has empty format array",
       l
-    ), M(t, s) && !n.has(s)) {
-      n.add(s);
-      const a = j(t, !0);
+    ), M(e, s) && !o.has(s)) {
+      o.add(s);
+      const a = j(e, !0);
       M(a, s) || (i = l + i);
-      const f = j(t, !1);
+      const f = j(e, !1);
       M(f, s) || (i += l);
     }
   }
-  return o.replace(e, () => i);
+  return t.replace(r, () => i);
 }
-function j(t, o) {
-  let r = o ? t.getPreviousSibling() : t.getNextSibling();
-  if (!r) {
-    const e = t.getParentOrThrow();
-    e.isInline() && (r = o ? e.getPreviousSibling() : e.getNextSibling());
+function j(e, t) {
+  let n = t ? e.getPreviousSibling() : e.getNextSibling();
+  if (!n) {
+    const r = e.getParentOrThrow();
+    r.isInline() && (n = t ? r.getPreviousSibling() : r.getNextSibling());
   }
-  for (; r; ) {
-    if (E(r)) {
-      if (!r.isInline())
+  for (; n; ) {
+    if (N(n)) {
+      if (!n.isInline())
         break;
-      const e = o ? r.getLastDescendant() : r.getFirstDescendant();
-      if (x(e))
-        return e;
-      r = o ? r.getPreviousSibling() : r.getNextSibling();
+      const r = t ? n.getLastDescendant() : n.getFirstDescendant();
+      if (x(r))
+        return r;
+      n = t ? n.getPreviousSibling() : n.getNextSibling();
     }
-    if (x(r))
-      return r;
-    if (!E(r))
+    if (x(n))
+      return n;
+    if (!N(n))
       return null;
   }
   return null;
 }
-function M(t, o) {
-  return x(t) && t.hasFormat(o);
+function M(e, t) {
+  return x(e) && e.hasFormat(t);
 }
-function z({ nodes: t }, o) {
-  const r = t.has.bind(t);
-  return o.filter((e) => e.dependencies.every(r));
+function z({ nodes: e }, t) {
+  const n = e.has.bind(e);
+  return t.filter((r) => r.dependencies.every(n));
 }
-const W = G({
+const U = "@etrepum/lexical-builder-list/CheckList", W = G({
   name: "@etrepum/lexical-builder-markdown/MarkdownTransformers",
-  dependencies: [rt],
-  config: U({
-    elementTransformers: it,
-    textFormatTransformers: ct,
-    textMatchTransformers: lt,
+  dependencies: [se],
+  peerDependencies: [
+    ie(U)
+  ],
+  config: H({
+    elementTransformers: ae,
+    textFormatTransformers: fe,
+    textMatchTransformers: ue,
     shouldPreserveNewlines: !1
   }),
   // For now we replace the transformer arrays with the default
   // shallowMergeConfig. I think ideally these should be additive
-  init(t, o, r) {
-    const e = st(t), i = {
-      shouldPreserveNewlines: o.shouldPreserveNewlines
-    }, n = {
+  init(e, t, n) {
+    const r = ce(e), i = {
+      shouldPreserveNewlines: t.shouldPreserveNewlines
+    }, o = z(
+      r,
+      t.elementTransformers
+    );
+    if (n.getPeer(U)) {
+      const a = o.indexOf(ge);
+      a >= 0 && o.splice(a, 0, de);
+    }
+    const c = {
       // Only register transforms for nodes that are configured
-      element: z(e, o.elementTransformers),
-      textMatch: z(e, o.textMatchTransformers),
-      textFormat: o.textFormatTransformers
-    }, c = Tt(
-      St(n, i)
-    ), s = wt(
-      n,
+      element: o,
+      textMatch: z(r, t.textMatchTransformers),
+      textFormat: t.textFormatTransformers
+    }, s = $e(
+      we(c, i)
+    ), l = ke(
+      c,
       i
     );
     return {
       transformerOptions: i,
-      transformersByType: n,
-      $markdownExport: s,
-      $markdownImport: c
+      transformersByType: c,
+      $markdownExport: l,
+      $markdownImport: s
     };
   },
-  register: (t, o, r) => q(r.getInitResult())
+  register: (e, t, n) => q(n.getInitResult())
 });
-function Mt(t, o, r, e) {
-  const i = t.getParent();
-  if (!J(i) || t.getFirstChild() !== o)
+function ve(e, t, n, r) {
+  const i = e.getParent();
+  if (!Z(i) || e.getFirstChild() !== t)
     return !1;
-  const n = o.getTextContent();
-  if (n[r - 1] !== " ")
+  const o = t.getTextContent();
+  if (o[n - 1] !== " ")
     return !1;
-  for (const { regExp: c, replace: s } of e) {
-    const l = n.match(c);
-    if (l && l[0].length === r) {
-      const a = o.getNextSiblings(), [f, m] = o.splitText(r);
+  for (const { regExp: c, replace: s } of r) {
+    const l = o.match(c);
+    if (l && l[0].length === n) {
+      const a = t.getNextSiblings(), [f, m] = t.splitText(n);
       f.remove();
       const g = m ? [m, ...a] : a;
-      return s(t, g, l, !1), !0;
+      return s(e, g, l, !1), !0;
     }
   }
   return !1;
 }
-function vt(t, o, r) {
-  let e = t.getTextContent();
-  const i = e[o - 1], n = r[i];
-  if (n == null)
+function be(e, t, n) {
+  let r = e.getTextContent();
+  const i = r[t - 1], o = n[i];
+  if (o == null)
     return !1;
-  o < e.length && (e = e.slice(0, o));
-  for (const c of n) {
-    const s = e.match(c.regExp);
+  t < r.length && (r = r.slice(0, t));
+  for (const c of o) {
+    const s = r.match(c.regExp);
     if (s === null)
       continue;
     const l = s.index || 0, a = l + s[0].length;
     let f;
-    return l === 0 ? f = t.splitText(a)[0] : f = t.splitText(l, a)[1], T(
+    return l === 0 ? f = e.splitText(a)[0] : f = e.splitText(l, a)[1], T(
       x(f),
       "MarkdownShortcuts: splitText(%s, %s)[%s] did not return the expected TextNode",
       String(l),
@@ -405,24 +416,24 @@ function vt(t, o, r) {
   }
   return !1;
 }
-function kt(t, o, r) {
-  const e = t.getTextContent(), i = o - 1, n = e[i], c = r[n];
+function Ie(e, t, n) {
+  const r = e.getTextContent(), i = t - 1, o = r[i], c = n[o];
   if (!c)
     return !1;
   for (const s of c) {
     const { tag: l } = s, a = l.length, f = i - a + 1;
-    if (a > 1 && !nt(e, f, l, 0, a) || e[f - 1] === " ")
+    if (a > 1 && !oe(r, f, l, 0, a) || r[f - 1] === " ")
       continue;
-    const m = e[i + 1];
+    const m = r[i + 1];
     if (s.intraword === !1 && m && !$.test(m))
       continue;
-    const g = t;
+    const g = e;
     let u = g, d = X(
-      e,
+      r,
       f,
       l
     ), S = u;
-    for (; d < 0 && (S = S.getPreviousSibling()) && !tt(S); )
+    for (; d < 0 && (S = S.getPreviousSibling()) && !te(S); )
       if (x(S)) {
         const h = S.getTextContent();
         u = S, d = X(
@@ -434,21 +445,21 @@ function kt(t, o, r) {
     if (d < 0 || u === g && d + a === f)
       continue;
     const R = u.getTextContent();
-    if (d > 0 && R[d - 1] === n)
+    if (d > 0 && R[d - 1] === o)
       continue;
-    const F = R[d - 1];
-    if (s.intraword === !1 && F && !$.test(F))
+    const k = R[d - 1];
+    if (s.intraword === !1 && k && !$.test(k))
       continue;
-    const P = g.getTextContent(), _ = P.slice(0, f) + P.slice(i + 1);
-    g.setTextContent(_);
-    const b = u === g ? _ : R;
+    const F = g.getTextContent(), v = F.slice(0, f) + F.slice(i + 1);
+    g.setTextContent(v);
+    const b = u === g ? v : R;
     u.setTextContent(
       b.slice(0, d) + b.slice(d + a)
     );
-    const I = N(), p = ht();
-    H(p);
-    const ot = i - a * (u === g ? 2 : 1) + 1;
-    p.anchor.set(u.__key, d, "text"), p.focus.set(g.__key, ot, "text");
+    const I = C(), p = he();
+    Q(p);
+    const re = i - a * (u === g ? 2 : 1) + 1;
+    p.anchor.set(u.__key, d, "text"), p.focus.set(g.__key, re, "text");
     for (const h of s.format)
       p.hasFormat(h) || p.formatText(h);
     p.anchor.set(
@@ -458,91 +469,86 @@ function kt(t, o, r) {
     );
     for (const h of s.format)
       p.hasFormat(h) && p.toggleFormat(h);
-    return v(I) && (p.format = I.format), !0;
+    return P(I) && (p.format = I.format), !0;
   }
   return !1;
 }
-function X(t, o, r) {
-  const e = r.length;
-  for (let i = o; i >= e; i--) {
-    const n = i - e;
-    if (nt(t, n, r, 0, e) && // Space after opening tag cancels transformation
-    t[n + e] !== " ")
-      return n;
+function X(e, t, n) {
+  const r = n.length;
+  for (let i = t; i >= r; i--) {
+    const o = i - r;
+    if (oe(e, o, n, 0, r) && // Space after opening tag cancels transformation
+    e[o + r] !== " ")
+      return o;
   }
   return -1;
 }
-function nt(t, o, r, e, i) {
-  for (let n = 0; n < i; n++)
-    if (t[o + n] !== r[e + n])
+function oe(e, t, n, r, i) {
+  for (let o = 0; o < i; o++)
+    if (e[t + o] !== n[r + o])
       return !1;
   return !0;
 }
-function Ft(t, o) {
-  const r = L(
-    o.textFormat,
-    ({ tag: n }) => n[n.length - 1]
-  ), e = L(
-    o.textMatch,
-    ({ trigger: n }) => n
-  ), i = (n, c, s) => {
-    Mt(
-      n,
+function Le(e, t) {
+  const n = y(
+    t.textFormat,
+    ({ tag: o }) => o[o.length - 1]
+  ), r = y(
+    t.textMatch,
+    ({ trigger: o }) => o
+  ), i = (o, c, s) => {
+    ve(
+      o,
       c,
       s,
-      o.element
-    ) || vt(
+      t.element
+    ) || be(
       c,
       s,
-      e
-    ) || kt(
+      r
+    ) || Ie(
       c,
       s,
-      r
+      n
     );
   };
-  return t.registerUpdateListener(
-    ({ tags: n, dirtyLeaves: c, editorState: s, prevEditorState: l }) => {
-      if (n.has("collaboration") || n.has("historic") || t.isComposing())
+  return e.registerUpdateListener(
+    ({ tags: o, dirtyLeaves: c, editorState: s, prevEditorState: l }) => {
+      if (o.has("collaboration") || o.has("historic") || e.isComposing())
         return;
-      const a = s.read(N), f = l.read(N);
-      if (!v(f) || !v(a) || !a.isCollapsed())
+      const a = s.read(C), f = l.read(C);
+      if (!P(f) || !P(a) || !a.isCollapsed())
         return;
       const m = a.anchor.key, g = a.anchor.offset, u = s._nodeMap.get(m);
-      !x(u) || !c.has(m) || g !== 1 && g > f.anchor.offset + 1 || t.update(() => {
+      !x(u) || !c.has(m) || g !== 1 && g > f.anchor.offset + 1 || e.update(() => {
         if (u.hasFormat("code"))
           return;
         const d = u.getParent();
-        d === null || ft(d) || i(d, u, a.anchor.offset);
+        d === null || Te(d) || i(d, u, a.anchor.offset);
       });
     }
   );
 }
-const yt = G({
+const ze = G({
   name: "@etrepum/lexical-builder-markdown/MarkdownShortcuts",
   dependencies: [W],
-  config: U({
-    enabled: !0
+  config: H({
+    disabled: !1
   }),
-  register(t, o, r) {
-    let e = null;
-    function i() {
-      return e !== null;
-    }
-    function n(c) {
-      c && e === null ? e = Ft(
-        t,
-        r.getDependency(W).output.transformersByType
-      ) : !c && e !== null && (e(), e = null);
-    }
-    return n(o.enabled), q(
-      { getEnabled: i, setEnabled: n },
-      () => n(!1)
+  register(e, t, n) {
+    return q(
+      ...le({
+        disabled: t.disabled,
+        register: () => Le(
+          e,
+          n.getDependency(W).output.transformersByType
+        )
+      })
     );
   }
-}), Lt = "0.0.27-nightly.20240701.0";
+}), Ue = "0.0.28-nightly.20240702.0";
 export {
-  yt as MarkdownShortcutsPlan,
+  ze as MarkdownShortcutsPlan,
   W as MarkdownTransformersPlan,
-  Lt as PACKAGE_VERSION
+  Ue as PACKAGE_VERSION
 };

package/package.json

@@ -16,7 +16,7 @@
     "test": "vitest run",
     "test:watch": "vitest"
   },
-  "version": "0.0.27-nightly.20240701.0",
+  "version": "0.0.28-nightly.20240702.0",
   "license": "MIT",
   "repository": {
     "type": "git",
@@ -28,15 +28,16 @@
   },
   "homepage": "https://github.com/etrepum/lexical-builder",
   "dependencies": {
-    "@etrepum/lexical-builder": "*"
+    "@etrepum/lexical-builder": "*",
+    "@etrepum/lexical-builder-list": "*"
   },
   "peerDependencies": {
-    "@lexical/code": ">=0.16.0-0",
-    "@lexical/list": ">=0.16.0-0",
-    "@lexical/markdown": ">=0.16.0-0",
-    "@lexical/rich-text": ">=0.16.0-0",
-    "@lexical/utils": ">=0.16.0-0",
-    "lexical": ">=0.16.0-0"
+    "@lexical/code": ">=0.16.1-nightly.20240626",
+    "@lexical/list": ">=0.16.1-nightly.20240626",
+    "@lexical/markdown": ">=0.16.1-nightly.20240626",
+    "@lexical/rich-text": ">=0.16.1-nightly.20240626",
+    "@lexical/utils": ">=0.16.1-nightly.20240626",
+    "lexical": ">=0.16.1-nightly.20240626"
   },
   "sideEffects": false,
   "devDependencies": {