@etrepum/lexical-builder-markdown 0.0.36-nightly.20250430.0 → 0.0.36-nightly.20250502.0

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;AACjB,OAAO,EAGL,KAAK,oBAAoB,EAG1B,MAAM,0BAA0B,CAAC;AAGlC,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,MAAM,uBAAuB,GAAG,oBAAoB,CAAC;AAE3D,eAAO,MAAM,qBAAqB,+JAmBhC,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;AACjB,OAAO,EAGL,KAAK,oBAAoB,EAG1B,MAAM,0BAA0B,CAAC;AAGlC,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,SAAS,CAAC;AA0SlD,wBAAgB,yBAAyB,CACvC,MAAM,EAAE,aAAa,EACrB,MAAM,EAAE,kBAAkB,GACzB,MAAM,IAAI,CAkGZ;AAED,MAAM,WAAW,uBAAuB;IACtC,QAAQ,EAAE,OAAO,CAAC;CACnB;AACD,MAAM,MAAM,uBAAuB,GAAG,oBAAoB,CAAC;AAE3D,eAAO,MAAM,qBAAqB,+JAmBhC,CAAC"}

package/dist/MarkdownTransformersPlan.d.ts.map

@@ -1 +1 @@
-{"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"}
+{"version":3,"file":"MarkdownTransformersPlan.d.ts","sourceRoot":"","sources":["../src/MarkdownTransformersPlan.ts"],"names":[],"mappings":"AAqBA,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;AAeF,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,8LA2DnC,CAAC"}

package/dist/index.js

@@ -1,213 +1,214 @@
 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, n) {
+import { ELEMENT_TRANSFORMERS as ae, TEXT_FORMAT_TRANSFORMERS as fe, TEXT_MATCH_TRANSFORMERS as ue, MULTILINE_ELEMENT_TRANSFORMERS as ge, UNORDERED_LIST as de, CHECK_LIST as pe } from "@lexical/markdown";
+import { $getSelection as S, $setSelection as Q, $isParagraphNode as V, $isTextNode as x, $createParagraphNode as Y, $isElementNode as N, $createTextNode as J, $createLineBreakNode as me, $isRootOrShadowRoot as Z, $getRoot as he, $isDecoratorNode as ee, $isLineBreakNode as te, $isRangeSelection as P, $createRangeSelection as xe } from "lexical";
+import { $createCodeNode as Te, $isCodeNode as Ee } from "@lexical/code";
+import { $isListNode as O, $isListItemNode as Se } from "@lexical/list";
+import { $isQuoteNode as Ne } from "@lexical/rich-text";
+import { $findMatchingParent as Ce, IS_SAFARI as A, IS_IOS as B, IS_APPLE_WEBKIT as y } from "@lexical/utils";
+function D(e, t) {
   const o = {};
   for (const r of e) {
-    const i = n(r), t = o[i];
-    t ? t.push(r) : o[i] = [r];
+    const c = t(r), n = o[c];
+    n ? n.push(r) : o[c] = [r];
   }
   return o;
 }
-const $ = /[!-/:-@[-`{-~\s]/, Ee = /^\s{0,3}$/;
-function _(e) {
+const $ = /[!-/:-@[-`{-~\s]/, $e = /^\s{0,3}$/;
+function k(e) {
   if (!V(e))
     return !1;
-  const n = e.getFirstChild();
-  return n == null || e.getChildrenSize() === 1 && x(n) && Ee.test(n.getTextContent());
+  const t = e.getFirstChild();
+  return t == null || e.getChildrenSize() === 1 && x(t) && $e.test(t.getTextContent());
 }
-function $e(e) {
+function we(e) {
   return function(...o) {
-    const r = C(), i = r ? r.clone() : null, t = e(...o), c = C(), s = i && i.is(r) && !Object.isFrozen(r) ? r : i;
-    return c !== s && Q(s), t;
+    const r = S(), c = r ? r.clone() : null, n = e(...o), i = S(), s = c && c.is(r) && !Object.isFrozen(r) ? r : c;
+    return i !== s && Q(s), n;
   };
 }
-function T(e, n, ...o) {
+function T(e, t, ...o) {
   if (!e)
     throw new Error(
-      o.reduce((r, i) => r.replace("%s", String(i)), n || "")
+      o.reduce((r, c) => r.replace("%s", String(c)), t || "")
     );
 }
-const D = /^[ \t]*```(\w{1,10})?\s?$/;
-function we(e, n) {
-  const o = _e(
+const K = /^[ \t]*```(\w{1,10})?\s?$/;
+function Re(e, t) {
+  const o = ke(
     e.textFormat
   );
-  return function(i, { shouldPreserveNewlines: t } = n) {
-    const c = i.split(`
-`), s = c.length, l = Y();
+  return function(c, { shouldPreserveNewlines: n } = t) {
+    const i = c.split(`
+`), s = i.length, a = Y();
     for (let f = 0; f < s; f++) {
-      const m = c[f], [g, u] = Me(c, f, l);
-      if (g != null) {
-        f = u;
+      const u = i[f], [d, g] = _e(i, f, a);
+      if (d != null) {
+        f = g;
         continue;
       }
-      Re(
-        m,
-        l,
+      Me(
+        u,
+        a,
         e.element,
         o,
         e.textMatch
       );
     }
-    const a = [];
-    for (let f = l.getFirstChild(); f; f = f.getNextSibling())
+    const l = [];
+    for (let f = a.getFirstChild(); f; f = f.getNextSibling())
       T(
         N(f),
         "markdownImport: Expected child of type %s to be an ElementNode",
         f.getType()
-      ), (t || !_(f)) && a.push(f);
-    return l.clear(), a;
+      ), (n || !k(f)) && l.push(f);
+    return a.clear(), l;
   };
 }
-function Re(e, n, o, r, i) {
-  const t = e.trim(), c = J(t), s = Y();
-  s.append(c), n.append(s);
-  for (const { regExp: l, replace: a } of o) {
-    const f = e.match(l);
+function Me(e, t, o, r, c) {
+  const n = e.trim(), i = J(n), s = Y();
+  s.append(i), t.append(s);
+  for (const { regExp: a, replace: l } of o) {
+    const f = e.match(a);
     if (f) {
-      c.setTextContent(e.slice(f[0].length)), a(s, [c], f, !0);
+      i.setTextContent(e.slice(f[0].length)), l(s, [i], f, !0);
       break;
     }
   }
-  if (E(
-    c,
+  if (C(
+    i,
     r,
-    i
-  ), s.isAttached() && t.length > 0) {
-    const l = s.getPreviousSibling();
-    if (V(l) || Ce(l) || L(l)) {
-      let a = l;
-      if (L(l)) {
-        const f = l.getLastDescendant();
-        f == null ? a = null : a = Ne(f, Se);
+    c
+  ), s.isAttached() && n.length > 0) {
+    const a = s.getPreviousSibling();
+    if (V(a) || Ne(a) || O(a)) {
+      let l = a;
+      if (O(a)) {
+        const f = a.getLastDescendant();
+        f == null ? l = null : l = Ce(f, Se);
       }
-      a != null && a.getTextContentSize() > 0 && (a.splice(a.getChildrenSize(), 0, [
-        pe(),
+      l != null && l.getTextContentSize() > 0 && (l.splice(l.getChildrenSize(), 0, [
+        me(),
         ...s.getChildren()
       ]), s.remove());
     }
   }
 }
-function Me(e, n, o) {
-  const r = D.exec(e[n]);
+function _e(e, t, o) {
+  const r = K.exec(e[t]);
   if (r) {
-    let i = n;
-    const t = e.length;
-    for (; ++i < t; )
-      if (D.exec(e[i])) {
-        const s = xe(r[1]), l = J(
-          e.slice(n + 1, i).join(`
+    let c = t;
+    const n = e.length;
+    for (; ++c < n; )
+      if (K.exec(e[c])) {
+        const s = Te(r[1]), a = J(
+          e.slice(t + 1, c).join(`
 `)
         );
-        return s.append(l), o.append(s), [s, i];
+        return s.append(a), o.append(s), [s, c];
       }
   }
-  return [null, n];
+  return [null, t];
 }
-function E(e, n, o) {
-  const r = e.getTextContent(), i = Pe(r, n);
-  if (!i) {
+function C(e, t, o) {
+  const r = e.getTextContent(), c = Pe(r, t);
+  if (!c) {
     ne(e, o);
     return;
   }
   T(
-    i[1] !== void 0 && i[2] !== void 0,
+    c[1] !== void 0 && c[2] !== void 0,
     "importTextMatchTransformers: expecting match with two groups"
   );
-  let t, c, s;
-  if (i[0] === r)
-    t = e;
+  let n, i, s;
+  if (c[0] === r)
+    n = e;
   else {
-    const a = i.index || 0, f = a + i[0].length;
-    a === 0 ? [t, c] = e.splitText(f) : [s, t, c] = e.splitText(
-      a,
+    const l = c.index || 0, f = l + c[0].length;
+    l === 0 ? [n, i] = e.splitText(f) : [s, n, i] = e.splitText(
+      l,
       f
     );
   }
   T(
-    t !== void 0,
+    n !== void 0,
     "importTextMatchTransformers: currentNode must be defined"
-  ), t.setTextContent(i[2]);
-  const l = n.transformersByTag[i[1]];
-  if (l)
-    for (const a of l.format)
-      t.hasFormat(a) || t.toggleFormat(a);
-  t.hasFormat("code") || E(
-    t,
+  ), n.setTextContent(c[2]);
+  const a = t.transformersByTag[c[1]];
+  if (a)
+    for (const l of a.format)
+      n.hasFormat(l) || n.toggleFormat(l);
+  n.hasFormat("code") || C(
     n,
+    t,
     o
-  ), s && E(
+  ), s && C(
     s,
-    n,
+    t,
     o
-  ), c && E(
-    c,
-    n,
+  ), i && C(
+    i,
+    t,
     o
   );
 }
-function ne(e, n) {
+function ne(e, t) {
+  var r;
   let o = e;
   e: for (; o; ) {
-    const r = o.getTextContent();
-    for (const i of n) {
-      const t = r.match(i.importRegExp);
-      if (!t)
+    const c = o.getTextContent();
+    for (const n of t) {
+      const i = n.importRegExp && c.match(n.importRegExp);
+      if (!i)
         continue;
-      const c = t.index || 0, s = c + t[0].length;
-      let l, a;
-      if (c === 0) {
-        const f = o.splitText(s);
+      const s = i.index || 0, a = s + i[0].length;
+      let l, f;
+      if (s === 0) {
+        const u = o.splitText(a);
         T(
-          f[0] !== void 0,
+          u[0] !== void 0,
           "importTextMatchTransformers: splitText expected at least one node"
-        ), [l, o] = f;
+        ), [l, o] = u;
       } else {
-        const f = o.splitText(c, s);
+        const u = o.splitText(s, a);
         T(
-          f[1] !== void 0,
+          u[1] !== void 0,
           "importTextMatchTransformers: splitText expected at least two nodes"
-        ), [, l, a] = f, a && ne(a, n);
+        ), [, l, f] = u, f && ne(f, t);
       }
-      i.replace(l, t);
+      (r = n.replace) == null || r.call(n, l, i);
       continue e;
     }
     break;
   }
 }
-function Pe(e, n) {
-  const o = e.match(n.openTagsRegExp);
+function Pe(e, t) {
+  const o = e.match(t.openTagsRegExp);
   if (o == null)
     return null;
   for (const r of o) {
-    const i = r.replace(/^\s/, ""), t = n.fullMatchRegExpByTag[i];
-    if (t == null)
+    const c = r.replace(/^\s/, ""), n = t.fullMatchRegExpByTag[c];
+    if (n == null)
       continue;
-    const c = e.match(t), s = n.transformersByTag[i];
-    if (c != null && s != null) {
+    const i = e.match(n), s = t.transformersByTag[c];
+    if (i != null && s != null) {
       if (s.intraword !== !1)
-        return c;
-      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 i;
+      const { index: a = 0 } = i, l = e[a - 1], f = e[a + i[0].length];
+      if ((!l || $.test(l)) && (!f || $.test(f)))
+        return i;
     }
   }
   return null;
 }
-function _e(e) {
-  const n = {}, o = {}, r = [], i = "(?<![\\\\])";
-  for (const t of e) {
-    const { tag: c } = t;
-    n[c] = t;
-    const s = c.replace(/(\*|\^|\+)/g, "\\$1");
-    r.push(s), O || A || B ? o[c] = new RegExp(
+function ke(e) {
+  const t = {}, o = {}, r = [], c = "(?<![\\\\])";
+  for (const n of e) {
+    const { tag: i } = n;
+    t[i] = n;
+    const s = i.replace(/(\*|\^|\+)/g, "\\$1");
+    r.push(s), A || B || y ? o[i] = new RegExp(
       `(${s})(?![${s}\\s])(.*?[^${s}\\s])${s}(?!${s})`
-    ) : o[c] = new RegExp(
+    ) : o[i] = new RegExp(
       `(?<![\\\\${s}])(${s})((\\\\${s})?.*?[^${s}\\s](\\\\${s})?)((?<!\\\\)|(?<=\\\\\\\\))(${s})(?![\\\\${s}])`
     );
   }
@@ -216,107 +217,109 @@ function _e(e) {
     fullMatchRegExpByTag: o,
     // Reg exp to find opening tags
     openTagsRegExp: new RegExp(
-      `${O || A || B ? "" : i}(${r.join("|")})`,
+      `${A || B || y ? "" : c}(${r.join("|")})`,
       "g"
     ),
-    transformersByTag: n
+    transformersByTag: t
   };
 }
-function ke(e, { shouldPreserveNewlines: n }) {
-  const o = !n, r = e.textFormat.filter(
-    (i) => i.format.length === 1
+function Fe(e, { shouldPreserveNewlines: t }) {
+  const o = !t, r = e.textFormat.filter(
+    (c) => c.format.length === 1
   );
-  return function(t = me()) {
-    const c = [], s = Z(t) ? t.getChildren() : [t];
-    for (let l = 0; l < s.length; l++) {
-      const a = s[l], f = Fe(
-        a,
+  return function(n = he()) {
+    const i = [], s = Z(n) ? n.getChildren() : [n];
+    for (let a = 0; a < s.length; a++) {
+      const l = s[a], f = ve(
+        l,
         e.element,
         r,
         e.textMatch
       );
-      f != null && c.push(
+      f != null && i.push(
         // separate consecutive group of texts with a line break: eg. ["hello", "world"] -> ["hello", "\nworld"]
-        o && l > 0 && !_(a) && !_(s[l - 1]) ? `
+        o && a > 0 && !k(l) && !k(s[a - 1]) ? `
 `.concat(f) : f
       );
     }
-    return c.join(`
+    return i.join(`
 `);
   };
 }
-function Fe(e, n, o, r) {
-  for (const i of n) {
-    const t = i.export(
+function ve(e, t, o, r) {
+  for (const c of t) {
+    const n = c.export(
       e,
-      (c) => w(c, o, r)
+      (i) => w(i, o, r)
     );
-    if (t != null)
-      return t;
+    if (n != null)
+      return n;
   }
   return N(e) ? w(e, o, r) : ee(e) ? e.getTextContent() : null;
 }
-function w(e, n, o) {
-  const r = [], i = e.getChildren();
-  e: for (const t of i) {
-    for (const c of o) {
-      const s = c.export(
-        t,
+function w(e, t, o) {
+  var n;
+  const r = [], c = e.getChildren();
+  e: for (const i of c) {
+    for (const s of o) {
+      const a = (n = s.export) == null ? void 0 : n.call(
+        s,
+        i,
         (l) => w(
           l,
-          n,
+          t,
           o
         ),
-        (l, a) => K(l, a, n)
+        (l, f) => j(l, f, t)
       );
-      if (s != null) {
-        r.push(s);
+      if (a != null) {
+        r.push(a);
         continue e;
       }
     }
-    te(t) ? r.push(`
-`) : x(t) ? r.push(
-      K(t, t.getTextContent(), n)
-    ) : N(t) ? r.push(
-      w(t, n, o)
-    ) : ee(t) && r.push(t.getTextContent());
+    te(i) ? r.push(`
+`) : x(i) ? r.push(
+      j(i, i.getTextContent(), t)
+    ) : N(i) ? r.push(
+      w(i, t, o)
+    ) : ee(i) && r.push(i.getTextContent());
   }
   return r.join("");
 }
-function K(e, n, o) {
-  const r = n.trim();
-  let i = r;
-  const t = /* @__PURE__ */ new Set();
-  for (const c of o) {
-    const s = c.format[0], l = c.tag;
+function j(e, t, o) {
+  const r = t.trim();
+  let c = r;
+  const n = /* @__PURE__ */ new Set();
+  for (const i of o) {
+    const s = i.format[0], a = i.tag;
     if (T(
       s !== void 0,
       "TextFormatTransformer for tag %s has empty format array",
-      l
-    ), M(e, s) && !t.has(s)) {
-      t.add(s);
-      const a = j(e, !0);
-      M(a, s) || (i = l + i);
-      const f = j(e, !1);
-      M(f, s) || (i += l);
+      a
+    ), M(e, s) && !n.has(s)) {
+      n.add(s);
+      const l = z(e, !0);
+      M(l, s) || (c = a + c);
+      const f = z(e, !1);
+      M(f, s) || (c += a);
     }
   }
-  return n.replace(r, () => i);
+  return t.replace(r, () => c);
 }
-function j(e, n) {
-  let o = n ? e.getPreviousSibling() : e.getNextSibling();
+function z(e, t) {
+  let o = t ? e.getPreviousSibling() : e.getNextSibling();
   if (!o) {
     const r = e.getParentOrThrow();
-    r.isInline() && (o = n ? r.getPreviousSibling() : r.getNextSibling());
+    r.isInline() && (o = t ? r.getPreviousSibling() : r.getNextSibling());
   }
   for (; o; ) {
     if (N(o)) {
       if (!o.isInline())
         break;
-      const r = n ? o.getLastDescendant() : o.getFirstDescendant();
+      const r = t ? o.getLastDescendant() : o.getFirstDescendant();
       if (x(r))
         return r;
-      o = n ? o.getPreviousSibling() : o.getNextSibling();
+      o = t ? o.getPreviousSibling() : o.getNextSibling();
     }
     if (x(o))
       return o;
@@ -325,12 +328,12 @@ function j(e, n) {
   }
   return null;
 }
-function M(e, n) {
-  return x(e) && e.hasFormat(n);
+function M(e, t) {
+  return x(e) && e.hasFormat(t);
 }
-function z({ nodes: e }, n) {
+function _({ nodes: e }, t) {
   const o = e.has.bind(e);
-  return n.filter((r) => r.dependencies.every(o));
+  return t.filter((r) => r.dependencies.every(o));
 }
 const U = "@etrepum/lexical-builder-list/CheckList", W = G({
   name: "@etrepum/lexical-builder-markdown/MarkdownTransformers",
@@ -342,214 +345,222 @@ const U = "@etrepum/lexical-builder-list/CheckList", W = G({
     elementTransformers: ae,
     textFormatTransformers: fe,
     textMatchTransformers: ue,
+    multilineElementTransformers: ge,
     shouldPreserveNewlines: !1
   }),
   // For now we replace the transformer arrays with the default
   // shallowMergeConfig. I think ideally these should be additive
-  init(e, n, o) {
-    const r = ce(e), i = {
-      shouldPreserveNewlines: n.shouldPreserveNewlines
-    }, t = z(
+  init(e, t, o) {
+    const r = ce(e), c = {
+      shouldPreserveNewlines: t.shouldPreserveNewlines
+    }, n = _(
       r,
-      n.elementTransformers
+      t.elementTransformers
     );
     if (o.getPeer(U)) {
-      const a = t.indexOf(ge);
-      a >= 0 && t.splice(a, 0, de);
+      const l = n.indexOf(de);
+      l >= 0 && n.splice(l, 0, pe);
     }
-    const c = {
+    const i = {
       // Only register transforms for nodes that are configured
-      element: t,
-      textMatch: z(r, n.textMatchTransformers),
-      textFormat: n.textFormatTransformers
-    }, s = $e(
-      we(c, i)
-    ), l = ke(
-      c,
-      i
+      element: n,
+      textMatch: _(r, t.textMatchTransformers),
+      multilineElement: _(
+        r,
+        t.multilineElementTransformers
+      ),
+      textFormat: t.textFormatTransformers
+    }, s = we(
+      Re(i, c)
+    ), a = Fe(
+      i,
+      c
     );
     return {
-      transformerOptions: i,
-      transformersByType: c,
-      $markdownExport: l,
+      transformerOptions: c,
+      transformersByType: i,
+      $markdownExport: a,
       $markdownImport: s
     };
   },
-  register: (e, n, o) => q(o.getInitResult())
+  register: (e, t, o) => q(o.getInitResult())
 });
-function ve(e, n, o, r) {
-  const i = e.getParent();
-  if (!Z(i) || e.getFirstChild() !== n)
+function Ie(e, t, o, r) {
+  const c = e.getParent();
+  if (!Z(c) || e.getFirstChild() !== t)
     return !1;
-  const t = n.getTextContent();
-  if (t[o - 1] !== " ")
+  const n = t.getTextContent();
+  if (n[o - 1] !== " ")
     return !1;
-  for (const { regExp: c, replace: s } of r) {
-    const l = t.match(c);
-    if (l && l[0].length === o) {
-      const a = n.getNextSiblings(), [f, m] = n.splitText(o);
+  for (const { regExp: i, replace: s } of r) {
+    const a = n.match(i);
+    if (a && a[0].length === o) {
+      const l = t.getNextSiblings(), [f, u] = t.splitText(o);
       f.remove();
-      const g = m ? [m, ...a] : a;
-      return s(e, g, l, !1), !0;
+      const d = u ? [u, ...l] : l;
+      return s(e, d, a, !1), !0;
     }
   }
   return !1;
 }
-function be(e, n, o) {
+function be(e, t, o) {
+  var i;
   let r = e.getTextContent();
-  const i = r[n - 1], t = o[i];
-  if (t == null)
+  const c = r[t - 1], n = o[c];
+  if (n == null)
     return !1;
-  n < r.length && (r = r.slice(0, n));
-  for (const c of t) {
-    const s = r.match(c.regExp);
-    if (s === null)
+  t < r.length && (r = r.slice(0, t));
+  for (const s of n) {
+    const a = r.match(s.regExp);
+    if (a === null)
       continue;
-    const l = s.index || 0, a = l + s[0].length;
-    let f;
-    return l === 0 ? f = e.splitText(a)[0] : f = e.splitText(l, a)[1], T(
-      x(f),
+    const l = a.index || 0, f = l + a[0].length;
+    let u;
+    return l === 0 ? u = e.splitText(f)[0] : u = e.splitText(l, f)[1], T(
+      x(u),
       "MarkdownShortcuts: splitText(%s, %s)[%s] did not return the expected TextNode",
       String(l),
-      String(a),
+      String(f),
       String(l === 0 ? 0 : 1)
-    ), f.selectNext(0, 0), c.replace(f, s), !0;
+    ), u.selectNext(0, 0), (i = s.replace) == null || i.call(s, u, a), !0;
   }
   return !1;
 }
-function Ie(e, n, o) {
-  const r = e.getTextContent(), i = n - 1, t = r[i], c = o[t];
-  if (!c)
+function Le(e, t, o) {
+  const r = e.getTextContent(), c = t - 1, n = r[c], i = o[n];
+  if (!i)
     return !1;
-  for (const s of c) {
-    const { tag: l } = s, a = l.length, f = i - a + 1;
-    if (a > 1 && !oe(r, f, l, 0, a) || r[f - 1] === " ")
+  for (const s of i) {
+    const { tag: a } = s, l = a.length, f = c - l + 1;
+    if (l > 1 && !oe(r, f, a, 0, l) || r[f - 1] === " ")
       continue;
-    const m = r[i + 1];
-    if (s.intraword === !1 && m && !$.test(m))
+    const u = r[c + 1];
+    if (s.intraword === !1 && u && !$.test(u))
       continue;
-    const g = e;
-    let u = g, d = X(
+    const d = e;
+    let g = d, p = X(
       r,
       f,
-      l
-    ), S = u;
-    for (; d < 0 && (S = S.getPreviousSibling()) && !te(S); )
-      if (x(S)) {
-        const h = S.getTextContent();
-        u = S, d = X(
+      a
+    ), E = g;
+    for (; p < 0 && (E = E.getPreviousSibling()) && !te(E); )
+      if (x(E)) {
+        const h = E.getTextContent();
+        g = E, p = X(
           h,
           h.length,
-          l
+          a
         );
       }
-    if (d < 0 || u === g && d + a === f)
+    if (p < 0 || g === d && p + l === f)
       continue;
-    const R = u.getTextContent();
-    if (d > 0 && R[d - 1] === t)
+    const R = g.getTextContent();
+    if (p > 0 && R[p - 1] === n)
       continue;
-    const k = R[d - 1];
-    if (s.intraword === !1 && k && !$.test(k))
+    const F = R[p - 1];
+    if (s.intraword === !1 && F && !$.test(F))
       continue;
-    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 v = d.getTextContent(), I = v.slice(0, f) + v.slice(c + 1);
+    d.setTextContent(I);
+    const b = g === d ? I : R;
+    g.setTextContent(
+      b.slice(0, p) + b.slice(p + l)
     );
-    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");
+    const L = S(), m = xe();
+    Q(m);
+    const re = c - l * (g === d ? 2 : 1) + 1;
+    m.anchor.set(g.__key, p, "text"), m.focus.set(d.__key, re, "text");
     for (const h of s.format)
-      p.hasFormat(h) || p.formatText(h);
-    p.anchor.set(
-      p.focus.key,
-      p.focus.offset,
-      p.focus.type
+      m.hasFormat(h) || m.formatText(h);
+    m.anchor.set(
+      m.focus.key,
+      m.focus.offset,
+      m.focus.type
     );
     for (const h of s.format)
-      p.hasFormat(h) && p.toggleFormat(h);
-    return P(I) && (p.format = I.format), !0;
+      m.hasFormat(h) && m.toggleFormat(h);
+    return P(L) && (m.format = L.format), !0;
   }
   return !1;
 }
-function X(e, n, o) {
+function X(e, t, o) {
   const r = o.length;
-  for (let i = n; i >= r; i--) {
-    const t = i - r;
-    if (oe(e, t, o, 0, r) && // Space after opening tag cancels transformation
-    e[t + r] !== " ")
-      return t;
+  for (let c = t; c >= r; c--) {
+    const n = c - r;
+    if (oe(e, n, o, 0, r) && // Space after opening tag cancels transformation
+    e[n + r] !== " ")
+      return n;
   }
   return -1;
 }
-function oe(e, n, o, r, i) {
-  for (let t = 0; t < i; t++)
-    if (e[n + t] !== o[r + t])
+function oe(e, t, o, r, c) {
+  for (let n = 0; n < c; n++)
+    if (e[t + n] !== o[r + n])
       return !1;
   return !0;
 }
-function Le(e, n) {
-  const o = y(
-    n.textFormat,
-    ({ tag: t }) => t[t.length - 1]
-  ), r = y(
-    n.textMatch,
-    ({ trigger: t }) => t
-  ), i = (t, c, s) => {
-    ve(
-      t,
-      c,
+function Oe(e, t) {
+  const o = D(
+    t.textFormat,
+    ({ tag: n }) => n[n.length - 1]
+  ), r = D(
+    t.textMatch.filter(
+      (n) => !!n.trigger
+    ),
+    ({ trigger: n }) => n
+  ), c = (n, i, s) => {
+    Ie(
+      n,
+      i,
       s,
-      n.element
+      t.element
     ) || be(
-      c,
+      i,
       s,
       r
-    ) || Ie(
-      c,
+    ) || Le(
+      i,
       s,
       o
     );
   };
   return e.registerUpdateListener(
-    ({ tags: t, dirtyLeaves: c, editorState: s, prevEditorState: l }) => {
-      if (t.has("collaboration") || t.has("historic") || e.isComposing())
+    ({ tags: n, dirtyLeaves: i, editorState: s, prevEditorState: a }) => {
+      if (n.has("collaboration") || n.has("historic") || e.isComposing())
         return;
-      const a = s.read(C), f = l.read(C);
-      if (!P(f) || !P(a) || !a.isCollapsed())
+      const l = s.read(S), f = a.read(S);
+      if (!P(f) || !P(l) || !l.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 || e.update(() => {
-        if (u.hasFormat("code"))
+      const u = l.anchor.key, d = l.anchor.offset, g = s._nodeMap.get(u);
+      !x(g) || !i.has(u) || d !== 1 && d > f.anchor.offset + 1 || e.update(() => {
+        if (g.hasFormat("code"))
           return;
-        const d = u.getParent();
-        d === null || Te(d) || i(d, u, a.anchor.offset);
+        const p = g.getParent();
+        p === null || Ee(p) || c(p, g, l.anchor.offset);
       });
     }
   );
 }
-const ze = G({
+const Ue = G({
   name: "@etrepum/lexical-builder-markdown/MarkdownShortcuts",
   dependencies: [W],
   config: H({
     disabled: !1
   }),
-  register(e, n, o) {
+  register(e, t, o) {
     return q(
       ...le({
-        disabled: n.disabled,
-        register: () => Le(
+        disabled: t.disabled,
+        register: () => Oe(
           e,
           o.getDependency(W).output.transformersByType
         )
       })
     );
   }
-}), Ue = "0.0.36-nightly.20250430.0";
+}), We = "0.0.36-nightly.20250502.0";
 export {
-  ze as MarkdownShortcutsPlan,
+  Ue as MarkdownShortcutsPlan,
   W as MarkdownTransformersPlan,
-  Ue as PACKAGE_VERSION
+  We as PACKAGE_VERSION
 };

package/package.json

@@ -16,7 +16,7 @@
     "test": "vitest run",
     "test:watch": "vitest"
   },
-  "version": "0.0.36-nightly.20250430.0",
+  "version": "0.0.36-nightly.20250502.0",
   "license": "MIT",
   "repository": {
     "type": "git",
@@ -32,12 +32,12 @@
     "@etrepum/lexical-builder-list": "*"
   },
   "peerDependencies": {
-    "@lexical/code": ">=0.17.2-nightly.20240906.0",
-    "@lexical/list": ">=0.17.2-nightly.20240906.0",
-    "@lexical/markdown": ">=0.17.2-nightly.20240906.0",
-    "@lexical/rich-text": ">=0.17.2-nightly.20240906.0",
-    "@lexical/utils": ">=0.17.2-nightly.20240906.0",
-    "lexical": ">=0.17.2-nightly.20240906.0"
+    "@lexical/code": ">=0.31.0 || >=0.31.1-nightly.0",
+    "@lexical/list": ">=0.31.0 || >=0.31.1-nightly.0",
+    "@lexical/markdown": ">=0.31.0 || >=0.31.1-nightly.0",
+    "@lexical/rich-text": ">=0.31.0 || >=0.31.1-nightly.0",
+    "@lexical/utils": ">=0.31.0 || >=0.31.1-nightly.0",
+    "lexical": ">=0.31.0 || >=0.31.1-nightly.0"
   },
   "sideEffects": false,
   "devDependencies": {