@etrepum/lexical-builder-table 0.0.33 → 0.0.34

package/dist/index.d.ts

@@ -1,4 +1,4 @@
-import { Store } from '@etrepum/lexical-builder';
+import { ReadableStore } from '@etrepum/lexical-builder';
 
 export declare const PACKAGE_VERSION: string;
 export interface TableConfig {
@@ -6,9 +6,10 @@ export interface TableConfig {
     hasCellBackgroundColor: boolean;
     hasTabHandler: boolean;
 }
-export declare const TablePlan: import('@etrepum/lexical-builder').LexicalPlan<TableConfig, "@lexical/table", unknown, {
-    hasCellMerge: Store<boolean>;
-    hasCellBackgroundColor: Store<boolean>;
-    hasTabHandler: Store<boolean>;
-}>;
+export interface TableOutput {
+    hasCellMerge: ReadableStore<boolean>;
+    hasCellBackgroundColor: ReadableStore<boolean>;
+    hasTabHandler: ReadableStore<boolean>;
+}
+export declare const TablePlan: import('@etrepum/lexical-builder').LexicalPlan<TableConfig, "@lexical/table", TableOutput, TableOutput>;
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAkCH,OAAO,EAIL,KAAK,EACN,MAAM,0BAA0B,CAAC;AAGlC,eAAO,MAAM,eAAe,EAAE,MAAwC,CAAC;AAEvE,MAAM,WAAW,WAAW;IAC1B,YAAY,EAAE,OAAO,CAAC;IACtB,sBAAsB,EAAE,OAAO,CAAC;IAChC,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,eAAO,MAAM,SAAS;;;;EAyLpB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAkCH,OAAO,EAGL,KAAK,aAAa,EAInB,MAAM,0BAA0B,CAAC;AAGlC,eAAO,MAAM,eAAe,EAAE,MAAwC,CAAC;AAEvE,MAAM,WAAW,WAAW;IAC1B,YAAY,EAAE,OAAO,CAAC;IACtB,sBAAsB,EAAE,OAAO,CAAC;IAChC,aAAa,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,WAAW;IAC1B,YAAY,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IACrC,sBAAsB,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;IAC/C,aAAa,EAAE,aAAa,CAAC,OAAO,CAAC,CAAC;CACvC;AAED,eAAO,MAAM,SAAS,yGA4LpB,CAAC"}

package/dist/index.js

@@ -1,17 +1,17 @@
-import { TableNode as N, TableRowNode as k, TableCellNode as T, INSERT_TABLE_COMMAND as x, $createTableNodeWithDimensions as y, $computeTableMapSkipCellCheck as B, $createTableCellNode as M, $isTableNode as _, $getNodeTriplet as A, $computeTableMap as I, $isTableRowNode as $, $isTableCellNode as D, applyTableHandlers as H } from "@lexical/table";
-import { mergeRegister as E, $insertNodeToNearestRoot as K, $insertFirst as L } from "@lexical/utils";
-import { $isTextNode as O, COMMAND_PRIORITY_EDITOR as P, $createParagraphNode as v, $getNodeByKey as F } from "lexical";
-import { definePlan as j, safeCast as z, Store as h, registerStoreToggle as m } from "@etrepum/lexical-builder";
-function w(a, c, ...u) {
+import { TableNode as N, TableRowNode as x, TableCellNode as T, INSERT_TABLE_COMMAND as y, $createTableNodeWithDimensions as B, $computeTableMapSkipCellCheck as _, $createTableCellNode as M, $isTableNode as A, $getNodeTriplet as I, $computeTableMap as D, $isTableRowNode as $, $isTableCellNode as H, applyTableHandlers as K } from "@lexical/table";
+import { mergeRegister as E, $insertNodeToNearestRoot as L, $insertFirst as O } from "@lexical/utils";
+import { $isTextNode as v, COMMAND_PRIORITY_EDITOR as P, $createParagraphNode as F, $getNodeByKey as j } from "lexical";
+import { definePlan as z, safeCast as V, Store as h, provideOutput as G, registerStoreToggle as m } from "@etrepum/lexical-builder";
+function w(a, c, ...C) {
   if (!a)
     throw new Error(
-      u.reduce((C, b) => C.replace("%s", String(b)), c || "")
+      C.reduce((f, p) => f.replace("%s", String(p)), c || "")
     );
 }
-const q = "0.0.33", J = j({
+const Q = "0.0.34", U = z({
   name: "@lexical/table",
-  nodes: [N, k, T],
-  config: z({
+  nodes: [N, x, T],
+  config: V({
     hasCellMerge: !0,
     hasCellBackgroundColor: !0,
     hasTabHandler: !0
@@ -23,133 +23,136 @@ const q = "0.0.33", J = j({
       hasTabHandler: new h(c.hasTabHandler)
     };
   },
-  register(a, c, u) {
-    const { hasCellMerge: C, hasCellBackgroundColor: b, hasTabHandler: R } = u.getInitResult();
-    return E(
-      a.registerCommand(
-        x,
-        ({ columns: t, rows: o, includeHeaders: r }) => {
-          const e = y(
-            Number(o),
-            Number(t),
-            r
-          );
-          K(e);
-          const l = e.getFirstDescendant();
-          return O(l) && l.select(), !0;
-        },
-        P
-      ),
-      a.registerNodeTransform(N, (t) => {
-        const [o] = B(t, null, null);
-        let r = 0;
-        for (const e of o)
-          r = Math.max(r, e.length);
-        for (const e of o) {
-          const l = e.length;
-          if (l === r || l === 0)
-            continue;
-          const n = e[l - 1].cell;
-          for (let s = l; s < r; ++s) {
-            const d = M(0);
-            d.append(v()), n.insertAfter(d);
-          }
-        }
-      }),
-      m(
-        R,
-        // Returning true mimics useEffect, we will call the register
-        // function any time the value changes
-        () => !0,
-        () => {
-          const t = R.get(), o = /* @__PURE__ */ new Map(), r = (e) => {
-            const l = e.getKey(), i = a.getElementByKey(
-              l
+  register(a, c, C) {
+    const f = C.getInitResult(), { hasCellMerge: p, hasCellBackgroundColor: k, hasTabHandler: R } = f;
+    return G(
+      f,
+      E(
+        a.registerCommand(
+          y,
+          ({ columns: t, rows: o, includeHeaders: r }) => {
+            const e = B(
+              Number(o),
+              Number(t),
+              r
             );
-            if (i && !o.has(l)) {
-              const n = H(
-                e,
-                i,
-                a,
-                t
-              );
-              o.set(l, n);
-            }
-          };
-          return E(
-            a.registerMutationListener(
-              N,
-              (e) => {
-                for (const [l, i] of e)
-                  if (i === "created")
-                    a.getEditorState().read(() => {
-                      const n = F(l);
-                      _(n) && r(n);
-                    });
-                  else if (i === "destroyed") {
-                    const n = o.get(l);
-                    n !== void 0 && (n.removeListeners(), o.delete(l));
-                  }
-              },
-              { skipInitialization: !1 }
-            ),
-            // Hook might be called multiple times so cleaning up tables listeners as well,
-            // as it'll be reinitialized during recurring call
-            () => {
-              for (const [, e] of o)
-                e.removeListeners();
+            L(e);
+            const l = e.getFirstDescendant();
+            return v(l) && l.select(), !0;
+          },
+          P
+        ),
+        a.registerNodeTransform(N, (t) => {
+          const [o] = _(t, null, null);
+          let r = 0;
+          for (const e of o)
+            r = Math.max(r, e.length);
+          for (const e of o) {
+            const l = e.length;
+            if (l === r || l === 0)
+              continue;
+            const n = e[l - 1].cell;
+            for (let s = l; s < r; ++s) {
+              const d = M(0);
+              d.append(F()), n.insertAfter(d);
             }
-          );
-        }
-      ),
-      m(
-        C,
-        (t) => t,
-        () => a.registerNodeTransform(T, (t) => {
-          if (t.getColSpan() > 1 || t.getRowSpan() > 1) {
-            const [, , o] = A(t), [r] = I(o, t, t);
-            let e = o.getFirstChild();
-            w(
-              $(e),
-              "Expected TableNode first child to be a RowNode"
+          }
+        }),
+        m(
+          R,
+          // Returning true mimics useEffect, we will call the register
+          // function any time the value changes
+          () => !0,
+          () => {
+            const t = R.get(), o = /* @__PURE__ */ new Map(), r = (e) => {
+              const l = e.getKey(), i = a.getElementByKey(
+                l
+              );
+              if (i && !o.has(l)) {
+                const n = K(
+                  e,
+                  i,
+                  a,
+                  t
+                );
+                o.set(l, n);
+              }
+            };
+            return E(
+              a.registerMutationListener(
+                N,
+                (e) => {
+                  for (const [l, i] of e)
+                    if (i === "created")
+                      a.getEditorState().read(() => {
+                        const n = j(l);
+                        A(n) && r(n);
+                      });
+                    else if (i === "destroyed") {
+                      const n = o.get(l);
+                      n !== void 0 && (n.removeListeners(), o.delete(l));
+                    }
+                },
+                { skipInitialization: !1 }
+              ),
+              // Hook might be called multiple times so cleaning up tables listeners as well,
+              // as it'll be reinitialized during recurring call
+              () => {
+                for (const [, e] of o)
+                  e.removeListeners();
+              }
             );
-            const l = r.length, i = r[0].length, n = [];
-            for (let s = 0; s < l; s++) {
-              s !== 0 && (e = e.getNextSibling(), w(
+          }
+        ),
+        m(
+          p,
+          (t) => t,
+          () => a.registerNodeTransform(T, (t) => {
+            if (t.getColSpan() > 1 || t.getRowSpan() > 1) {
+              const [, , o] = I(t), [r] = D(o, t, t);
+              let e = o.getFirstChild();
+              w(
                 $(e),
                 "Expected TableNode first child to be a RowNode"
-              ));
-              let d = null;
-              for (let f = 0; f < i; f++) {
-                const p = r[s][f], g = p.cell;
-                if (p.startRow === s && p.startColumn === f)
-                  d = g, n.push(g);
-                else if (g.getColSpan() > 1 || g.getRowSpan() > 1) {
-                  w(
-                    D(g),
-                    "Expected TableNode cell to be a TableCellNode"
-                  );
-                  const S = M(g.__headerState);
-                  d !== null ? d.insertAfter(S) : L(e, S);
+              );
+              const l = r.length, i = r[0].length, n = [];
+              for (let s = 0; s < l; s++) {
+                s !== 0 && (e = e.getNextSibling(), w(
+                  $(e),
+                  "Expected TableNode first child to be a RowNode"
+                ));
+                let d = null;
+                for (let u = 0; u < i; u++) {
+                  const b = r[s][u], g = b.cell;
+                  if (b.startRow === s && b.startColumn === u)
+                    d = g, n.push(g);
+                  else if (g.getColSpan() > 1 || g.getRowSpan() > 1) {
+                    w(
+                      H(g),
+                      "Expected TableNode cell to be a TableCellNode"
+                    );
+                    const S = M(g.__headerState);
+                    d !== null ? d.insertAfter(S) : O(e, S);
+                  }
                 }
               }
+              for (const s of n)
+                s.setColSpan(1), s.setRowSpan(1);
             }
-            for (const s of n)
-              s.setColSpan(1), s.setRowSpan(1);
-          }
-        })
-      ),
-      m(
-        b,
-        (t) => t,
-        () => a.registerNodeTransform(T, (t) => {
-          t.getBackgroundColor() !== null && t.setBackgroundColor(null);
-        })
+          })
+        ),
+        m(
+          k,
+          (t) => t,
+          () => a.registerNodeTransform(T, (t) => {
+            t.getBackgroundColor() !== null && t.setBackgroundColor(null);
+          })
+        )
       )
     );
   }
 });
 export {
-  q as PACKAGE_VERSION,
-  J as TablePlan
+  Q as PACKAGE_VERSION,
+  U as TablePlan
 };

package/package.json

@@ -15,7 +15,7 @@
     "test:watch": "vitest",
     "lint": "eslint"
   },
-  "version": "0.0.33",
+  "version": "0.0.34",
   "license": "MIT",
   "repository": {
     "type": "git",