@etrepum/lexical-builder-markdown 0.0.28-nightly.20240708.0 → 0.0.29-nightly.20240709.0

package/dist/index.js

@@ -5,39 +5,39 @@ 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 = {};
+function y(e, n) {
+  const o = {};
   for (const r of e) {
-    const i = t(r);
-    n[i] ? n[i].push(r) : n[i] = [r];
+    const i = n(r), t = o[i];
+    t ? t.push(r) : o[i] = [r];
   }
-  return n;
+  return o;
 }
 const $ = /[!-/:-@[-`{-~\s]/, Ee = /^\s{0,3}$/;
 function _(e) {
   if (!V(e))
     return !1;
-  const t = e.getFirstChild();
-  return t == null || e.getChildrenSize() === 1 && x(t) && Ee.test(t.getTextContent());
+  const n = e.getFirstChild();
+  return n == null || e.getChildrenSize() === 1 && x(n) && Ee.test(n.getTextContent());
 }
 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;
+  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;
   };
 }
-function T(e, t, ...n) {
+function T(e, n, ...o) {
   if (!e)
     throw new Error(
-      n.reduce((r, i) => r.replace("%s", String(i)), t || "")
+      o.reduce((r, i) => r.replace("%s", String(i)), n || "")
     );
 }
 const D = /^[ \t]*```(\w{1,10})?\s?$/;
-function we(e, t) {
-  const n = _e(
+function we(e, n) {
+  const o = _e(
     e.textFormat
   );
-  return function(i, { shouldPreserveNewlines: o } = t) {
+  return function(i, { shouldPreserveNewlines: t } = n) {
     const c = i.split(`
 `), s = c.length, l = Y();
     for (let f = 0; f < s; f++) {
@@ -50,7 +50,7 @@ function we(e, t) {
         m,
         l,
         e.element,
-        n,
+        o,
         e.textMatch
       );
     }
@@ -60,14 +60,14 @@ function we(e, t) {
         N(f),
         "markdownImport: Expected child of type %s to be an ElementNode",
         f.getType()
-      ), (o || !_(f)) && a.push(f);
+      ), (t || !_(f)) && a.push(f);
     return l.clear(), a;
   };
 }
-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) {
+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);
     if (f) {
       c.setTextContent(e.slice(f[0].length)), a(s, [c], f, !0);
@@ -78,7 +78,7 @@ function Re(e, t, n, r, i) {
     c,
     r,
     i
-  ), s.isAttached() && o.length > 0) {
+  ), s.isAttached() && t.length > 0) {
     const l = s.getPreviousSibling();
     if (V(l) || Ce(l) || L(l)) {
       let a = l;
@@ -93,85 +93,85 @@ function Re(e, t, n, r, i) {
     }
   }
 }
-function Me(e, t, n) {
-  const r = D.exec(e[t]);
+function Me(e, n, o) {
+  const r = D.exec(e[n]);
   if (r) {
-    let i = t;
-    const o = e.length;
-    for (; ++i < o; )
+    let i = n;
+    const t = e.length;
+    for (; ++i < t; )
       if (D.exec(e[i])) {
         const s = xe(r[1]), l = J(
-          e.slice(t + 1, i).join(`
+          e.slice(n + 1, i).join(`
 `)
         );
-        return s.append(l), n.append(s), [s, i];
+        return s.append(l), o.append(s), [s, i];
       }
   }
-  return [null, t];
+  return [null, n];
 }
-function E(e, t, n) {
-  const r = e.getTextContent(), i = Pe(r, t);
+function E(e, n, o) {
+  const r = e.getTextContent(), i = Pe(r, n);
   if (!i) {
-    ne(e, n);
+    ne(e, o);
     return;
   }
   T(
     i[1] !== void 0 && i[2] !== void 0,
     "importTextMatchTransformers: expecting match with two groups"
   );
-  let o, c, s;
+  let t, c, s;
   if (i[0] === r)
-    o = e;
+    t = e;
   else {
     const a = i.index || 0, f = a + i[0].length;
-    a === 0 ? [o, c] = e.splitText(f) : [s, o, c] = e.splitText(
+    a === 0 ? [t, c] = e.splitText(f) : [s, t, c] = e.splitText(
       a,
       f
     );
   }
   T(
-    o !== void 0,
+    t !== void 0,
     "importTextMatchTransformers: currentNode must be defined"
-  ), o.setTextContent(i[2]);
-  const l = t.transformersByTag[i[1]];
+  ), t.setTextContent(i[2]);
+  const l = n.transformersByTag[i[1]];
   if (l)
     for (const a of l.format)
-      o.hasFormat(a) || o.toggleFormat(a);
-  o.hasFormat("code") || E(
-    o,
+      t.hasFormat(a) || t.toggleFormat(a);
+  t.hasFormat("code") || E(
     t,
-    n
+    n,
+    o
   ), s && E(
     s,
-    t,
-    n
+    n,
+    o
   ), c && E(
     c,
-    t,
-    n
+    n,
+    o
   );
 }
-function ne(e, t) {
-  let n = e;
-  e: for (; n; ) {
-    for (const r of t) {
-      const i = n.getTextContent().match(r.importRegExp);
+function ne(e, n) {
+  let o = e;
+  e: for (; o; ) {
+    for (const r of n) {
+      const i = o.getTextContent().match(r.importRegExp);
       if (!i)
         continue;
-      const o = i.index || 0, c = o + i[0].length;
+      const t = i.index || 0, c = t + i[0].length;
       let s, l;
-      if (o === 0) {
-        const a = n.splitText(c);
+      if (t === 0) {
+        const a = o.splitText(c);
         T(
           a[0] !== void 0,
           "importTextMatchTransformers: splitText expected at least one node"
-        ), [s, n] = a;
+        ), [s, o] = a;
       } else {
-        const a = n.splitText(o, c);
+        const a = o.splitText(t, c);
         T(
           a[1] !== void 0,
           "importTextMatchTransformers: splitText expected at least two nodes"
-        ), [, s, l] = a, l && ne(l, t);
+        ), [, s, l] = a, l && ne(l, n);
       }
       r.replace(s, i);
       continue e;
@@ -179,15 +179,15 @@ function ne(e, t) {
     break;
   }
 }
-function Pe(e, t) {
-  const n = e.match(t.openTagsRegExp);
-  if (n == null)
+function Pe(e, n) {
+  const o = e.match(n.openTagsRegExp);
+  if (o == null)
     return null;
-  for (const r of n) {
-    const i = r.replace(/^\s/, ""), o = t.fullMatchRegExpByTag[i];
-    if (o == null)
+  for (const r of o) {
+    const i = r.replace(/^\s/, ""), t = n.fullMatchRegExpByTag[i];
+    if (t == null)
       continue;
-    const c = e.match(o), s = t.transformersByTag[i];
+    const c = e.match(t), s = n.transformersByTag[i];
     if (c != null && s != null) {
       if (s.intraword !== !1)
         return c;
@@ -199,34 +199,34 @@ function Pe(e, t) {
   return null;
 }
 function _e(e) {
-  const t = {}, n = {}, r = [], i = "(?<![\\\\])";
-  for (const o of e) {
-    const { tag: c } = o;
-    t[c] = o;
+  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 ? n[c] = new RegExp(
+    r.push(s), O || A || B ? o[c] = new RegExp(
       `(${s})(?![${s}\\s])(.*?[^${s}\\s])${s}(?!${s})`
-    ) : n[c] = new RegExp(
+    ) : o[c] = new RegExp(
       `(?<![\\\\${s}])(${s})((\\\\${s})?.*?[^${s}\\s](\\\\${s})?)((?<!\\\\)|(?<=\\\\\\\\))(${s})(?![\\\\${s}])`
     );
   }
   return {
     // Reg exp to find open tag + content + close tag
-    fullMatchRegExpByTag: n,
+    fullMatchRegExpByTag: o,
     // Reg exp to find opening tags
     openTagsRegExp: new RegExp(
       `${O || A || B ? "" : i}(${r.join("|")})`,
       "g"
     ),
-    transformersByTag: t
+    transformersByTag: n
   };
 }
-function ke(e, { shouldPreserveNewlines: t }) {
-  const n = !t, r = e.textFormat.filter(
+function ke(e, { shouldPreserveNewlines: n }) {
+  const o = !n, r = e.textFormat.filter(
     (i) => i.format.length === 1
   );
-  return function(o = me()) {
-    const c = [], s = Z(o) ? o.getChildren() : [o];
+  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,
@@ -236,7 +236,7 @@ function ke(e, { shouldPreserveNewlines: t }) {
       );
       f != null && c.push(
         // separate consecutive group of texts with a line break: eg. ["hello", "world"] -> ["hello", "\nworld"]
-        n && l > 0 && !_(a) && !_(s[l - 1]) ? `
+        o && l > 0 && !_(a) && !_(s[l - 1]) ? `
 `.concat(f) : f
       );
     }
@@ -244,92 +244,92 @@ function ke(e, { shouldPreserveNewlines: t }) {
 `);
   };
 }
-function Fe(e, t, n, r) {
-  for (const i of t) {
-    const o = i.export(
+function Fe(e, n, o, r) {
+  for (const i of n) {
+    const t = i.export(
       e,
-      (c) => w(c, n, r)
+      (c) => w(c, o, r)
     );
-    if (o != null)
-      return o;
+    if (t != null)
+      return t;
   }
-  return N(e) ? w(e, n, r) : ee(e) ? e.getTextContent() : null;
+  return N(e) ? w(e, o, r) : ee(e) ? e.getTextContent() : null;
 }
-function w(e, t, n) {
+function w(e, n, o) {
   const r = [], i = e.getChildren();
-  e: for (const o of i) {
-    for (const c of n) {
+  e: for (const t of i) {
+    for (const c of o) {
       const s = c.export(
-        o,
+        t,
         (l) => w(
           l,
-          t,
-          n
+          n,
+          o
         ),
-        (l, a) => K(l, a, t)
+        (l, a) => K(l, a, n)
       );
       if (s != null) {
         r.push(s);
         continue e;
       }
     }
-    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());
+    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());
   }
   return r.join("");
 }
-function K(e, t, n) {
-  const r = t.trim();
+function K(e, n, o) {
+  const r = n.trim();
   let i = r;
-  const o = /* @__PURE__ */ new Set();
-  for (const c of n) {
+  const t = /* @__PURE__ */ new Set();
+  for (const c of o) {
     const s = c.format[0], l = c.tag;
     if (T(
       s !== void 0,
       "TextFormatTransformer for tag %s has empty format array",
       l
-    ), M(e, s) && !o.has(s)) {
-      o.add(s);
+    ), 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);
     }
   }
-  return t.replace(r, () => i);
+  return n.replace(r, () => i);
 }
-function j(e, t) {
-  let n = t ? e.getPreviousSibling() : e.getNextSibling();
-  if (!n) {
+function j(e, n) {
+  let o = n ? e.getPreviousSibling() : e.getNextSibling();
+  if (!o) {
     const r = e.getParentOrThrow();
-    r.isInline() && (n = t ? r.getPreviousSibling() : r.getNextSibling());
+    r.isInline() && (o = n ? r.getPreviousSibling() : r.getNextSibling());
   }
-  for (; n; ) {
-    if (N(n)) {
-      if (!n.isInline())
+  for (; o; ) {
+    if (N(o)) {
+      if (!o.isInline())
         break;
-      const r = t ? n.getLastDescendant() : n.getFirstDescendant();
+      const r = n ? o.getLastDescendant() : o.getFirstDescendant();
       if (x(r))
         return r;
-      n = t ? n.getPreviousSibling() : n.getNextSibling();
+      o = n ? o.getPreviousSibling() : o.getNextSibling();
     }
-    if (x(n))
-      return n;
-    if (!N(n))
+    if (x(o))
+      return o;
+    if (!N(o))
       return null;
   }
   return null;
 }
-function M(e, t) {
-  return x(e) && e.hasFormat(t);
+function M(e, n) {
+  return x(e) && e.hasFormat(n);
 }
-function z({ nodes: e }, t) {
-  const n = e.has.bind(e);
-  return t.filter((r) => r.dependencies.every(n));
+function z({ nodes: e }, n) {
+  const o = e.has.bind(e);
+  return n.filter((r) => r.dependencies.every(o));
 }
 const U = "@etrepum/lexical-builder-list/CheckList", W = G({
   name: "@etrepum/lexical-builder-markdown/MarkdownTransformers",
@@ -345,22 +345,22 @@ const U = "@etrepum/lexical-builder-list/CheckList", W = G({
   }),
   // For now we replace the transformer arrays with the default
   // shallowMergeConfig. I think ideally these should be additive
-  init(e, t, n) {
+  init(e, n, o) {
     const r = ce(e), i = {
-      shouldPreserveNewlines: t.shouldPreserveNewlines
-    }, o = z(
+      shouldPreserveNewlines: n.shouldPreserveNewlines
+    }, t = z(
       r,
-      t.elementTransformers
+      n.elementTransformers
     );
-    if (n.getPeer(U)) {
-      const a = o.indexOf(ge);
-      a >= 0 && o.splice(a, 0, de);
+    if (o.getPeer(U)) {
+      const a = t.indexOf(ge);
+      a >= 0 && t.splice(a, 0, de);
     }
     const c = {
       // Only register transforms for nodes that are configured
-      element: o,
-      textMatch: z(r, t.textMatchTransformers),
-      textFormat: t.textFormatTransformers
+      element: t,
+      textMatch: z(r, n.textMatchTransformers),
+      textFormat: n.textFormatTransformers
     }, s = $e(
       we(c, i)
     ), l = ke(
@@ -374,19 +374,19 @@ const U = "@etrepum/lexical-builder-list/CheckList", W = G({
       $markdownImport: s
     };
   },
-  register: (e, t, n) => q(n.getInitResult())
+  register: (e, n, o) => q(o.getInitResult())
 });
-function ve(e, t, n, r) {
+function ve(e, n, o, r) {
   const i = e.getParent();
-  if (!Z(i) || e.getFirstChild() !== t)
+  if (!Z(i) || e.getFirstChild() !== n)
     return !1;
-  const o = t.getTextContent();
-  if (o[n - 1] !== " ")
+  const t = n.getTextContent();
+  if (t[o - 1] !== " ")
     return !1;
   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);
+    const l = t.match(c);
+    if (l && l[0].length === o) {
+      const a = n.getNextSiblings(), [f, m] = n.splitText(o);
       f.remove();
       const g = m ? [m, ...a] : a;
       return s(e, g, l, !1), !0;
@@ -394,13 +394,13 @@ function ve(e, t, n, r) {
   }
   return !1;
 }
-function be(e, t, n) {
+function be(e, n, o) {
   let r = e.getTextContent();
-  const i = r[t - 1], o = n[i];
-  if (o == null)
+  const i = r[n - 1], t = o[i];
+  if (t == null)
     return !1;
-  t < r.length && (r = r.slice(0, t));
-  for (const c of o) {
+  n < r.length && (r = r.slice(0, n));
+  for (const c of t) {
     const s = r.match(c.regExp);
     if (s === null)
       continue;
@@ -416,8 +416,8 @@ function be(e, t, n) {
   }
   return !1;
 }
-function Ie(e, t, n) {
-  const r = e.getTextContent(), i = t - 1, o = r[i], c = n[o];
+function Ie(e, n, o) {
+  const r = e.getTextContent(), i = n - 1, t = r[i], c = o[t];
   if (!c)
     return !1;
   for (const s of c) {
@@ -445,7 +445,7 @@ function Ie(e, t, n) {
     if (d < 0 || u === g && d + a === f)
       continue;
     const R = u.getTextContent();
-    if (d > 0 && R[d - 1] === o)
+    if (d > 0 && R[d - 1] === t)
       continue;
     const k = R[d - 1];
     if (s.intraword === !1 && k && !$.test(k))
@@ -473,35 +473,35 @@ function Ie(e, t, n) {
   }
   return !1;
 }
-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;
+function X(e, n, 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;
   }
   return -1;
 }
-function oe(e, t, n, r, i) {
-  for (let o = 0; o < i; o++)
-    if (e[t + o] !== n[r + o])
+function oe(e, n, o, r, i) {
+  for (let t = 0; t < i; t++)
+    if (e[n + t] !== o[r + t])
       return !1;
   return !0;
 }
-function Le(e, t) {
-  const n = y(
-    t.textFormat,
-    ({ tag: o }) => o[o.length - 1]
+function Le(e, n) {
+  const o = y(
+    n.textFormat,
+    ({ tag: t }) => t[t.length - 1]
   ), r = y(
-    t.textMatch,
-    ({ trigger: o }) => o
-  ), i = (o, c, s) => {
+    n.textMatch,
+    ({ trigger: t }) => t
+  ), i = (t, c, s) => {
     ve(
-      o,
+      t,
       c,
       s,
-      t.element
+      n.element
     ) || be(
       c,
       s,
@@ -509,12 +509,12 @@ function Le(e, t) {
     ) || Ie(
       c,
       s,
-      n
+      o
     );
   };
   return e.registerUpdateListener(
-    ({ tags: o, dirtyLeaves: c, editorState: s, prevEditorState: l }) => {
-      if (o.has("collaboration") || o.has("historic") || e.isComposing())
+    ({ tags: t, dirtyLeaves: c, editorState: s, prevEditorState: l }) => {
+      if (t.has("collaboration") || t.has("historic") || e.isComposing())
         return;
       const a = s.read(C), f = l.read(C);
       if (!P(f) || !P(a) || !a.isCollapsed())
@@ -535,18 +535,18 @@ const ze = G({
   config: H({
     disabled: !1
   }),
-  register(e, t, n) {
+  register(e, n, o) {
     return q(
       ...le({
-        disabled: t.disabled,
+        disabled: n.disabled,
         register: () => Le(
           e,
-          n.getDependency(W).output.transformersByType
+          o.getDependency(W).output.transformersByType
         )
       })
     );
   }
-}), Ue = "0.0.28-nightly.20240708.0";
+}), Ue = "0.0.29-nightly.20240709.0";
 export {
   ze as MarkdownShortcutsPlan,
   W as MarkdownTransformersPlan,

package/dist/utils.d.ts

@@ -1,6 +1,6 @@
 import { ParagraphNode, Spread, LexicalNode } from 'lexical';
 
-export declare function indexBy<T>(list: Array<T>, callback: (arg0: T) => string): Readonly<Record<string, Array<T>>>;
+export declare function indexBy<T>(list: T[], callback: (arg0: T) => string): Readonly<Record<string, T[]>>;
 export declare const PUNCTUATION_OR_SPACE: RegExp;
 declare const EmptyParagraphNodeBrand: unique symbol;
 export declare function $isEmptyParagraph(node: LexicalNode | undefined | null): node is Spread<{
@@ -13,7 +13,7 @@ export declare function $isEmptyParagraph(node: LexicalNode | undefined | null):
  * update you're running includes selection modifications that you do not
  * want.
  *
- * This is useful because the existing @lexical/markdown importers
+ * This is useful because the existing \@lexical/markdown importers
  * mangle the selection because of legacy mistakes.
  */
 export declare function $wrapWithIgnoreSelection<Parameters extends any[], Returns>($update: (...args: Parameters) => Returns): (...args: Parameters) => Returns;

package/dist/utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAGL,KAAK,aAAa,EAClB,KAAK,MAAM,EACX,KAAK,WAAW,EAGjB,MAAM,SAAS,CAAC;AAEjB,wBAAgB,OAAO,CAAC,CAAC,EACvB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAC5B,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAcpC;AAED,eAAO,MAAM,oBAAoB,QAAqB,CAAC;AAIvD,QAAA,MAAM,uBAAuB,EAAE,OAAO,MAErC,CAAC;AAEF,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,WAAW,GAAG,SAAS,GAAG,IAAI,GACnC,IAAI,IAAI,MAAM,CAAC;IAAE,CAAC,uBAAuB,CAAC,EAAE,KAAK,CAAA;CAAE,EAAE,aAAa,CAAC,CAYrE;AAED;;;;;;;;;GASG;AACH,wBAAgB,wBAAwB,CAAC,UAAU,SAAS,GAAG,EAAE,EAAE,OAAO,EACxE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,KAAK,OAAO,GACxC,CAAC,GAAG,IAAI,EAAE,UAAU,KAAK,OAAO,CAqBlC"}
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../src/utils.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAGL,KAAK,aAAa,EAClB,KAAK,MAAM,EACX,KAAK,WAAW,EAGjB,MAAM,SAAS,CAAC;AAEjB,wBAAgB,OAAO,CAAC,CAAC,EACvB,IAAI,EAAE,CAAC,EAAE,EACT,QAAQ,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAC5B,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAc/B;AAED,eAAO,MAAM,oBAAoB,QAAqB,CAAC;AAIvD,QAAA,MAAM,uBAAuB,EAAE,OAAO,MAErC,CAAC;AAEF,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,WAAW,GAAG,SAAS,GAAG,IAAI,GACnC,IAAI,IAAI,MAAM,CAAC;IAAE,CAAC,uBAAuB,CAAC,EAAE,KAAK,CAAA;CAAE,EAAE,aAAa,CAAC,CAYrE;AAED;;;;;;;;;GASG;AAEH,wBAAgB,wBAAwB,CAAC,UAAU,SAAS,GAAG,EAAE,EAAE,OAAO,EACxE,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,KAAK,OAAO,GACxC,CAAC,GAAG,IAAI,EAAE,UAAU,KAAK,OAAO,CAqBlC"}

package/package.json

@@ -16,7 +16,7 @@
     "test": "vitest run",
     "test:watch": "vitest"
   },
-  "version": "0.0.28-nightly.20240708.0",
+  "version": "0.0.29-nightly.20240709.0",
   "license": "MIT",
   "repository": {
     "type": "git",