@sqlrooms/canvas 0.28.0 → 0.29.0-rc.0

package/dist/dag.js

@@ -1,124 +0,0 @@
-/**
- * Build a forward adjacency list for a directed graph.
- * Ensures that every node id exists in the adjacency map, even if it has no outgoing edges.
- *
- * @param nodes - The set of nodes to include in the graph.
- * @param edges - Directed edges where `source` points to `target`.
- * @returns A mapping from node id to an array of child node ids.
- */
-export function buildAdjacency(nodes, edges) {
-    const adjacency = {};
-    for (const n of nodes)
-        adjacency[n.id] = [];
-    for (const e of edges) {
-        const list = adjacency[e.source] || (adjacency[e.source] = []);
-        list.push(e.target);
-    }
-    return adjacency;
-}
-/**
- * Find a node by id in a list of nodes.
- *
- * @param nodes - Array of nodes with an `id` field.
- * @param id - The node id to find.
- * @returns The node if found, otherwise undefined.
- */
-export function findNodeById(nodes, id) {
-    return nodes.find((n) => n.id === id);
-}
-/**
- * Topologically sort all nodes in the graph using Kahn's algorithm.
- * If a cycle is detected, the remaining nodes are appended in arbitrary order,
- * and a warning is logged.
- *
- * @param nodes - The set of nodes to sort.
- * @param edges - Directed edges defining dependencies.
- * @returns An array of node ids in dependency order (parents before children).
- */
-export function topoSortAll(nodes, edges) {
-    const adjacency = buildAdjacency(nodes, edges);
-    const inDegree = {};
-    for (const n of nodes)
-        inDegree[n.id] = 0;
-    for (const e of edges) {
-        inDegree[e.target] = (inDegree[e.target] ?? 0) + 1;
-    }
-    const queue = Object.keys(inDegree).filter((id) => (inDegree[id] ?? 0) === 0);
-    const order = [];
-    while (queue.length) {
-        const cur = queue.shift();
-        order.push(cur);
-        const neighbors = adjacency[cur] || [];
-        for (const nb of neighbors) {
-            inDegree[nb] = (inDegree[nb] ?? 0) - 1;
-            if (inDegree[nb] === 0)
-                queue.push(nb);
-        }
-    }
-    if (order.length < nodes.length) {
-        const remaining = nodes
-            .map((n) => n.id)
-            .filter((id) => !order.includes(id));
-        console.warn('[dag.topoSortAll] Cycle detected; appending remaining nodes arbitrarily:', remaining);
-        order.push(...remaining);
-    }
-    return order;
-}
-/**
- * Get a topological order for the downstream subgraph reachable from `startId`.
- * Only nodes reachable from the start are included (the starting node is excluded).
- * If a cycle exists within the reachable subgraph, the remaining nodes are appended
- * at the end in arbitrary order and a warning is logged.
- *
- * @param startId - The node id to start traversal from.
- * @param nodes - The set of nodes in the full graph.
- * @param edges - Directed edges defining the full graph dependencies.
- * @returns Node ids reachable from `startId`, in dependency order.
- */
-export function topoSortDownstream(startId, nodes, edges) {
-    const adjacency = buildAdjacency(nodes, edges);
-    // Collect reachable nodes from startId (excluding start)
-    const reachable = new Set();
-    const queue = [...(adjacency[startId] || [])];
-    while (queue.length) {
-        const cur = queue.shift();
-        if (reachable.has(cur))
-            continue;
-        reachable.add(cur);
-        const neighbors = adjacency[cur] || [];
-        for (const nb of neighbors)
-            queue.push(nb);
-    }
-    if (reachable.size === 0)
-        return [];
-    // Kahn's algorithm for topological sort within subgraph
-    const inDegree = {};
-    for (const id of reachable)
-        inDegree[id] = 0;
-    for (const e of edges) {
-        if (reachable.has(e.source) && reachable.has(e.target)) {
-            inDegree[e.target] = (inDegree[e.target] ?? 0) + 1;
-        }
-    }
-    const queue2 = Array.from(reachable).filter((id) => (inDegree[id] ?? 0) === 0);
-    const order = [];
-    while (queue2.length) {
-        const cur = queue2.shift();
-        order.push(cur);
-        const neighbors = adjacency[cur] || [];
-        for (const nb of neighbors) {
-            if (!reachable.has(nb))
-                continue;
-            inDegree[nb] = (inDegree[nb] ?? 0) - 1;
-            if (inDegree[nb] === 0)
-                queue2.push(nb);
-        }
-    }
-    if (order.length < reachable.size) {
-        const remaining = Array.from(reachable).filter((id) => !order.includes(id));
-        console.warn('[dag.topoSortDownstream] Cycle detected in downstream graph:', remaining);
-        order.push(...remaining);
-    }
-    return order;
-}
-//# sourceMappingURL=dag.js.map

package/dist/dag.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dag.js","sourceRoot":"","sources":["../src/dag.ts"],"names":[],"mappings":"AAOA;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,KAAgB,EAAE,KAAgB;IAC/D,MAAM,SAAS,GAAc,EAAE,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAU,EACV,EAAU;IAEV,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;AACxC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,KAAgB,EAAE,KAAgB;IAC5D,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/C,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,KAAK,GAAa,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAClD,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAClC,CAAC;IACF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAY,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,KAAK;aACpB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;aAChB,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,OAAO,CAAC,IAAI,CACV,0EAA0E,EAC1E,SAAS,CACV,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAAe,EACf,KAAgB,EAChB,KAAgB;IAEhB,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/C,yDAAyD;IACzD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,KAAK,GAAa,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxD,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAY,CAAC;QACpC,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACjC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,wDAAwD;IACxD,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,EAAE,IAAI,SAAS;QAAE,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IACD,MAAM,MAAM,GAAa,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CACnD,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAClC,CAAC;IACF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,EAAY,CAAC;QACrC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACjC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5E,OAAO,CAAC,IAAI,CACV,8DAA8D,EAC9D,SAAS,CACV,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/** A minimal graph node with an `id`. */\nexport type DagNode = {id: string};\n/** A directed edge from `source` to `target`. */\nexport type DagEdge = {source: string; target: string};\n/** Forward adjacency list mapping node id to its child node ids. */\nexport type Adjacency = Record<string, string[]>;\n\n/**\n * Build a forward adjacency list for a directed graph.\n * Ensures that every node id exists in the adjacency map, even if it has no outgoing edges.\n *\n * @param nodes - The set of nodes to include in the graph.\n * @param edges - Directed edges where `source` points to `target`.\n * @returns A mapping from node id to an array of child node ids.\n */\nexport function buildAdjacency(nodes: DagNode[], edges: DagEdge[]): Adjacency {\n  const adjacency: Adjacency = {};\n  for (const n of nodes) adjacency[n.id] = [];\n  for (const e of edges) {\n    const list = adjacency[e.source] || (adjacency[e.source] = []);\n    list.push(e.target);\n  }\n  return adjacency;\n}\n\n/**\n * Find a node by id in a list of nodes.\n *\n * @param nodes - Array of nodes with an `id` field.\n * @param id - The node id to find.\n * @returns The node if found, otherwise undefined.\n */\nexport function findNodeById<T extends {id: string}>(\n  nodes: T[],\n  id: string,\n): T | undefined {\n  return nodes.find((n) => n.id === id);\n}\n\n/**\n * Topologically sort all nodes in the graph using Kahn's algorithm.\n * If a cycle is detected, the remaining nodes are appended in arbitrary order,\n * and a warning is logged.\n *\n * @param nodes - The set of nodes to sort.\n * @param edges - Directed edges defining dependencies.\n * @returns An array of node ids in dependency order (parents before children).\n */\nexport function topoSortAll(nodes: DagNode[], edges: DagEdge[]): string[] {\n  const adjacency = buildAdjacency(nodes, edges);\n  const inDegree: Record<string, number> = {};\n  for (const n of nodes) inDegree[n.id] = 0;\n  for (const e of edges) {\n    inDegree[e.target] = (inDegree[e.target] ?? 0) + 1;\n  }\n\n  const queue: string[] = Object.keys(inDegree).filter(\n    (id) => (inDegree[id] ?? 0) === 0,\n  );\n  const order: string[] = [];\n  while (queue.length) {\n    const cur = queue.shift() as string;\n    order.push(cur);\n    const neighbors = adjacency[cur] || [];\n    for (const nb of neighbors) {\n      inDegree[nb] = (inDegree[nb] ?? 0) - 1;\n      if (inDegree[nb] === 0) queue.push(nb);\n    }\n  }\n\n  if (order.length < nodes.length) {\n    const remaining = nodes\n      .map((n) => n.id)\n      .filter((id) => !order.includes(id));\n    console.warn(\n      '[dag.topoSortAll] Cycle detected; appending remaining nodes arbitrarily:',\n      remaining,\n    );\n    order.push(...remaining);\n  }\n  return order;\n}\n\n/**\n * Get a topological order for the downstream subgraph reachable from `startId`.\n * Only nodes reachable from the start are included (the starting node is excluded).\n * If a cycle exists within the reachable subgraph, the remaining nodes are appended\n * at the end in arbitrary order and a warning is logged.\n *\n * @param startId - The node id to start traversal from.\n * @param nodes - The set of nodes in the full graph.\n * @param edges - Directed edges defining the full graph dependencies.\n * @returns Node ids reachable from `startId`, in dependency order.\n */\nexport function topoSortDownstream(\n  startId: string,\n  nodes: DagNode[],\n  edges: DagEdge[],\n): string[] {\n  const adjacency = buildAdjacency(nodes, edges);\n  // Collect reachable nodes from startId (excluding start)\n  const reachable = new Set<string>();\n  const queue: string[] = [...(adjacency[startId] || [])];\n  while (queue.length) {\n    const cur = queue.shift() as string;\n    if (reachable.has(cur)) continue;\n    reachable.add(cur);\n    const neighbors = adjacency[cur] || [];\n    for (const nb of neighbors) queue.push(nb);\n  }\n  if (reachable.size === 0) return [];\n\n  // Kahn's algorithm for topological sort within subgraph\n  const inDegree: Record<string, number> = {};\n  for (const id of reachable) inDegree[id] = 0;\n  for (const e of edges) {\n    if (reachable.has(e.source) && reachable.has(e.target)) {\n      inDegree[e.target] = (inDegree[e.target] ?? 0) + 1;\n    }\n  }\n  const queue2: string[] = Array.from(reachable).filter(\n    (id) => (inDegree[id] ?? 0) === 0,\n  );\n  const order: string[] = [];\n  while (queue2.length) {\n    const cur = queue2.shift() as string;\n    order.push(cur);\n    const neighbors = adjacency[cur] || [];\n    for (const nb of neighbors) {\n      if (!reachable.has(nb)) continue;\n      inDegree[nb] = (inDegree[nb] ?? 0) - 1;\n      if (inDegree[nb] === 0) queue2.push(nb);\n    }\n  }\n  if (order.length < reachable.size) {\n    const remaining = Array.from(reachable).filter((id) => !order.includes(id));\n    console.warn(\n      '[dag.topoSortDownstream] Cycle detected in downstream graph:',\n      remaining,\n    );\n    order.push(...remaining);\n  }\n  return order;\n}\n"]}

package/dist/nodes/SqlNode.d.ts

@@ -1,11 +0,0 @@
-import { FC } from 'react';
-import { CanvasNodeData } from '../CanvasSlice';
-type SqlData = Extract<CanvasNodeData, {
-    type: 'sql';
-}>;
-export declare const SqlNode: FC<{
-    id: string;
-    data: SqlData;
-}>;
-export {};
-//# sourceMappingURL=SqlNode.d.ts.map

package/dist/nodes/SqlNode.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SqlNode.d.ts","sourceRoot":"","sources":["../../src/nodes/SqlNode.tsx"],"names":[],"mappings":"AAGA,OAAO,EAAC,EAAE,EAAoB,MAAM,OAAO,CAAC;AAC5C,OAAO,EAAC,cAAc,EAAqB,MAAM,gBAAgB,CAAC;AAelE,KAAK,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE;IAAC,IAAI,EAAE,KAAK,CAAA;CAAC,CAAC,CAAC;AAEtD,eAAO,MAAM,OAAO,EAAE,EAAE,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,OAAO,CAAA;CAAC,CAgGnD,CAAC"}

package/dist/nodes/SqlNode.js

@@ -1,52 +0,0 @@
-import { jsx as _jsx, jsxs as _jsxs, Fragment as _Fragment } from "react/jsx-runtime";
-import { QueryDataTable } from '@sqlrooms/data-table';
-import { SqlMonacoEditor } from '@sqlrooms/sql-editor';
-import { Button, useToast } from '@sqlrooms/ui';
-import { useMemo, useState } from 'react';
-import { useStoreWithCanvas } from '../CanvasSlice';
-import { CanvasNodeContainer } from './CanvasNodeContainer';
-// import type * as Monaco from 'monaco-editor';
-// type EditorInstance = Monaco.editor.IStandaloneCodeEditor;
-// type MonacoInstance = typeof Monaco;
-const EDITOR_OPTIONS = {
-    minimap: { enabled: false },
-    lineNumbers: 'off',
-    scrollbar: {
-        handleMouseWheel: false,
-    },
-    fixedOverflowWidgets: false,
-};
-export const SqlNode = ({ id, data }) => {
-    const sql = data.sql || '';
-    const updateNode = useStoreWithCanvas((s) => s.canvas.updateNode);
-    const tables = useStoreWithCanvas((s) => s.db.tables);
-    const execute = useStoreWithCanvas((s) => s.canvas.executeSqlNodeQuery);
-    const result = useStoreWithCanvas((s) => s.canvas.sqlResults[id]);
-    const { toast } = useToast();
-    // const handleEditorMount = useCallback(
-    //   (editor: EditorInstance, monaco: MonacoInstance) => {
-    //     editor.addCommand(monaco.KeyMod.CtrlCmd | monaco.KeyCode.Enter, () => {
-    //       if (editor.hasTextFocus()) {
-    //         execute(id);
-    //       }
-    //     });
-    //   },
-    //   [execute],
-    // );
-    // const reactFlowContainerRef = useRef<HTMLDivElement>(null);
-    // useEffect(() => {
-    //   reactFlowContainerRef.current = document.querySelector<HTMLDivElement>(
-    //     '.react-flow__renderer',
-    //   );
-    // }, []);
-    const [overflowWidgetsDomNode, setOverflowWidgetsDomNode] = useState(null);
-    const editorOptions = useMemo(() => overflowWidgetsDomNode
-        ? {
-            ...EDITOR_OPTIONS,
-            overflowWidgetsDomNode: overflowWidgetsDomNode ?? undefined,
-            fixedOverflowWidgets: false,
-        }
-        : EDITOR_OPTIONS, [overflowWidgetsDomNode]);
-    return (_jsx(CanvasNodeContainer, { id: id, headerRight: _jsxs(_Fragment, { children: [_jsx(Button, { size: "sm", variant: "secondary", onClick: () => execute(id), children: "Run" }), _jsx("span", { className: "text-[10px] text-gray-500 uppercase", children: "SQL" })] }), children: _jsxs("div", { className: "flex h-full w-full flex-col", children: [_jsx("div", { className: "relative flex-1", children: _jsx(SqlMonacoEditor, { className: "absolute inset-0 p-1", value: sql, options: editorOptions, onChange: (v) => updateNode(id, (d) => ({ ...d, sql: v || '' })), tableSchemas: tables }) }), result?.status === 'error' && (_jsx("div", { className: "flex-1 overflow-auto border-t p-4 font-mono text-xs whitespace-pre-wrap text-red-600", children: result.error })), result?.status === 'success' && (_jsx("div", { className: "flex-2 overflow-hidden border-t", children: _jsx(QueryDataTable, { query: `SELECT * FROM ${result.tableName}`, fontSize: "text-xs" }) }))] }) }));
-};
-//# sourceMappingURL=SqlNode.js.map

package/dist/nodes/SqlNode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SqlNode.js","sourceRoot":"","sources":["../../src/nodes/SqlNode.tsx"],"names":[],"mappings":";AAAA,OAAO,EAAC,cAAc,EAAC,MAAM,sBAAsB,CAAC;AACpD,OAAO,EAAC,eAAe,EAAC,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAC,MAAM,EAAE,QAAQ,EAAC,MAAM,cAAc,CAAC;AAC9C,OAAO,EAAK,OAAO,EAAE,QAAQ,EAAC,MAAM,OAAO,CAAC;AAC5C,OAAO,EAAiB,kBAAkB,EAAC,MAAM,gBAAgB,CAAC;AAClE,OAAO,EAAC,mBAAmB,EAAC,MAAM,uBAAuB,CAAC;AAC1D,gDAAgD;AAChD,6DAA6D;AAC7D,uCAAuC;AAEvC,MAAM,cAAc,GAAqD;IACvE,OAAO,EAAE,EAAC,OAAO,EAAE,KAAK,EAAC;IACzB,WAAW,EAAE,KAAK;IAClB,SAAS,EAAE;QACT,gBAAgB,EAAE,KAAK;KACxB;IACD,oBAAoB,EAAE,KAAK;CAC5B,CAAC;AAIF,MAAM,CAAC,MAAM,OAAO,GAAoC,CAAC,EAAC,EAAE,EAAE,IAAI,EAAC,EAAE,EAAE;IACrE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;IAC3B,MAAM,UAAU,GAAG,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAClE,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IACtD,MAAM,OAAO,GAAG,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;IACxE,MAAM,MAAM,GAAG,kBAAkB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE,MAAM,EAAC,KAAK,EAAC,GAAG,QAAQ,EAAE,CAAC;IAE3B,yCAAyC;IACzC,0DAA0D;IAC1D,8EAA8E;IAC9E,qCAAqC;IACrC,uBAAuB;IACvB,UAAU;IACV,UAAU;IACV,OAAO;IACP,eAAe;IACf,KAAK;IAEL,8DAA8D;IAC9D,oBAAoB;IACpB,4EAA4E;IAC5E,+BAA+B;IAC/B,OAAO;IACP,UAAU;IACV,MAAM,CAAC,sBAAsB,EAAE,yBAAyB,CAAC,GACvD,QAAQ,CAAwB,IAAI,CAAC,CAAC;IAExC,MAAM,aAAa,GAAG,OAAO,CAC3B,GAA0B,EAAE,CAC1B,sBAAsB;QACpB,CAAC,CAAC;YACE,GAAG,cAAc;YACjB,sBAAsB,EAAE,sBAAsB,IAAI,SAAS;YAC3D,oBAAoB,EAAE,KAAK;SAC5B;QACH,CAAC,CAAC,cAAc,EACpB,CAAC,sBAAsB,CAAC,CACzB,CAAC;IAEF,OAAO,CACL,KAAC,mBAAmB,IAClB,EAAE,EAAE,EAAE,EACN,WAAW,EACT,8BACE,KAAC,MAAM,IAAC,IAAI,EAAC,IAAI,EAAC,OAAO,EAAC,WAAW,EAAC,OAAO,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,oBAEvD,EACT,eAAM,SAAS,EAAC,qCAAqC,oBAAW,IAC/D,YAGL,eAAK,SAAS,EAAC,6BAA6B,aAC1C,cAAK,SAAS,EAAC,iBAAiB,YAC9B,KAAC,eAAe,IACd,SAAS,EAAC,sBAAsB,EAChC,KAAK,EAAE,GAAG,EACV,OAAO,EAAE,aAAa,EACtB,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CACd,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAC,GAAI,CAAa,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,EAAC,CAAC,CAAC,EAE5D,YAAY,EAAE,MAAM,GAEpB,GACE,EACL,MAAM,EAAE,MAAM,KAAK,OAAO,IAAI,CAC7B,cAAK,SAAS,EAAC,sFAAsF,YAClG,MAAM,CAAC,KAAK,GACT,CACP,EACA,MAAM,EAAE,MAAM,KAAK,SAAS,IAAI,CAC/B,cAAK,SAAS,EAAC,iCAAiC,YAC9C,KAAC,cAAc,IACb,KAAK,EAAE,iBAAiB,MAAM,CAAC,SAAS,EAAE,EAC1C,QAAQ,EAAC,SAAS,GAClB,GACE,CACP,IACG,GAgBc,CACvB,CAAC;AACJ,CAAC,CAAC","sourcesContent":["import {QueryDataTable} from '@sqlrooms/data-table';\nimport {SqlMonacoEditor} from '@sqlrooms/sql-editor';\nimport {Button, useToast} from '@sqlrooms/ui';\nimport {FC, useMemo, useState} from 'react';\nimport {CanvasNodeData, useStoreWithCanvas} from '../CanvasSlice';\nimport {CanvasNodeContainer} from './CanvasNodeContainer';\n// import type * as Monaco from 'monaco-editor';\n// type EditorInstance = Monaco.editor.IStandaloneCodeEditor;\n// type MonacoInstance = typeof Monaco;\n\nconst EDITOR_OPTIONS: Parameters<typeof SqlMonacoEditor>[0]['options'] = {\n  minimap: {enabled: false},\n  lineNumbers: 'off',\n  scrollbar: {\n    handleMouseWheel: false,\n  },\n  fixedOverflowWidgets: false,\n};\n\ntype SqlData = Extract<CanvasNodeData, {type: 'sql'}>;\n\nexport const SqlNode: FC<{id: string; data: SqlData}> = ({id, data}) => {\n  const sql = data.sql || '';\n  const updateNode = useStoreWithCanvas((s) => s.canvas.updateNode);\n  const tables = useStoreWithCanvas((s) => s.db.tables);\n  const execute = useStoreWithCanvas((s) => s.canvas.executeSqlNodeQuery);\n  const result = useStoreWithCanvas((s) => s.canvas.sqlResults[id]);\n  const {toast} = useToast();\n\n  // const handleEditorMount = useCallback(\n  //   (editor: EditorInstance, monaco: MonacoInstance) => {\n  //     editor.addCommand(monaco.KeyMod.CtrlCmd | monaco.KeyCode.Enter, () => {\n  //       if (editor.hasTextFocus()) {\n  //         execute(id);\n  //       }\n  //     });\n  //   },\n  //   [execute],\n  // );\n\n  // const reactFlowContainerRef = useRef<HTMLDivElement>(null);\n  // useEffect(() => {\n  //   reactFlowContainerRef.current = document.querySelector<HTMLDivElement>(\n  //     '.react-flow__renderer',\n  //   );\n  // }, []);\n  const [overflowWidgetsDomNode, setOverflowWidgetsDomNode] =\n    useState<HTMLDivElement | null>(null);\n\n  const editorOptions = useMemo(\n    (): typeof EDITOR_OPTIONS =>\n      overflowWidgetsDomNode\n        ? {\n            ...EDITOR_OPTIONS,\n            overflowWidgetsDomNode: overflowWidgetsDomNode ?? undefined,\n            fixedOverflowWidgets: false,\n          }\n        : EDITOR_OPTIONS,\n    [overflowWidgetsDomNode],\n  );\n\n  return (\n    <CanvasNodeContainer\n      id={id}\n      headerRight={\n        <>\n          <Button size=\"sm\" variant=\"secondary\" onClick={() => execute(id)}>\n            Run\n          </Button>\n          <span className=\"text-[10px] text-gray-500 uppercase\">SQL</span>\n        </>\n      }\n    >\n      <div className=\"flex h-full w-full flex-col\">\n        <div className=\"relative flex-1\">\n          <SqlMonacoEditor\n            className=\"absolute inset-0 p-1\"\n            value={sql}\n            options={editorOptions}\n            onChange={(v) =>\n              updateNode(id, (d) => ({...(d as SqlData), sql: v || ''}))\n            }\n            tableSchemas={tables}\n            // onMount={handleEditorMount}\n          />\n        </div>\n        {result?.status === 'error' && (\n          <div className=\"flex-1 overflow-auto border-t p-4 font-mono text-xs whitespace-pre-wrap text-red-600\">\n            {result.error}\n          </div>\n        )}\n        {result?.status === 'success' && (\n          <div className=\"flex-2 overflow-hidden border-t\">\n            <QueryDataTable\n              query={`SELECT * FROM ${result.tableName}`}\n              fontSize=\"text-xs\"\n            />\n          </div>\n        )}\n      </div>\n      {/* {reactFlowContainerRef.current &&\n        createPortal(\n          <div\n            ref={(node) => {\n              if (node && !overflowWidgetsDomNode) {\n                setOverflowWidgetsDomNode(node);\n              }\n            }}\n            // CRITICAL: You must re-apply the monaco class here!\n            className=\"monaco-editor\"\n            // CRITICAL: Styles to ensure overlays position correctly relative to window\n            style={{position: 'absolute', top: 0, left: 0}}\n          />,\n          reactFlowContainerRef.current,\n        )} */}\n    </CanvasNodeContainer>\n  );\n};\n"]}

package/dist/nodes/VegaNode.d.ts

@@ -1,11 +0,0 @@
-import { FC } from 'react';
-import { CanvasNodeData } from '../CanvasSlice';
-type VegaData = Extract<CanvasNodeData, {
-    type: 'vega';
-}>;
-export declare const VegaNode: FC<{
-    id: string;
-    data: VegaData;
-}>;
-export {};
-//# sourceMappingURL=VegaNode.d.ts.map

package/dist/nodes/VegaNode.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"VegaNode.d.ts","sourceRoot":"","sources":["../../src/nodes/VegaNode.tsx"],"names":[],"mappings":"AACA,OAAO,EAAC,EAAE,EAAC,MAAM,OAAO,CAAC;AACzB,OAAO,EAAC,cAAc,EAAC,MAAM,gBAAgB,CAAC;AAG9C,KAAK,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE;IAAC,IAAI,EAAE,MAAM,CAAA;CAAC,CAAC,CAAC;AAExD,eAAO,MAAM,QAAQ,EAAE,EAAE,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,QAAQ,CAAA;CAAC,CA2BrD,CAAC"}

package/dist/nodes/VegaNode.js

@@ -1,12 +0,0 @@
-import { jsx as _jsx } from "react/jsx-runtime";
-import { VegaLiteChart } from '@sqlrooms/vega';
-import { CanvasNodeContainer } from './CanvasNodeContainer';
-export const VegaNode = ({ id, data }) => {
-    const spec = (data.vegaSpec || {
-        mark: 'point',
-        data: { values: [] },
-    });
-    const { vegaSpec, sql } = data;
-    return (_jsx(CanvasNodeContainer, { id: id, headerRight: _jsx("span", { className: "text-[10px] uppercase text-gray-500", children: "Vega" }), children: _jsx("div", { className: "h-full flex-1 overflow-hidden p-2", children: sql && vegaSpec ? (_jsx(VegaLiteChart, { spec: vegaSpec, sqlQuery: sql, aspectRatio: 16 / 9, className: "h-full" })) : null }) }));
-};
-//# sourceMappingURL=VegaNode.js.map

package/dist/nodes/VegaNode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"VegaNode.js","sourceRoot":"","sources":["../../src/nodes/VegaNode.tsx"],"names":[],"mappings":";AAAA,OAAO,EAAC,aAAa,EAAyB,MAAM,gBAAgB,CAAC;AAGrE,OAAO,EAAC,mBAAmB,EAAC,MAAM,uBAAuB,CAAC;AAI1D,MAAM,CAAC,MAAM,QAAQ,GAAqC,CAAC,EAAC,EAAE,EAAE,IAAI,EAAC,EAAE,EAAE;IACvE,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI;QAC7B,IAAI,EAAE,OAAO;QACb,IAAI,EAAE,EAAC,MAAM,EAAE,EAAE,EAAC;KACnB,CAAsB,CAAC;IAExB,MAAM,EAAC,QAAQ,EAAE,GAAG,EAAC,GAAG,IAAI,CAAC;IAE7B,OAAO,CACL,KAAC,mBAAmB,IAClB,EAAE,EAAE,EAAE,EACN,WAAW,EACT,eAAM,SAAS,EAAC,qCAAqC,qBAAY,YAGnE,cAAK,SAAS,EAAC,mCAAmC,YAC/C,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,CACjB,KAAC,aAAa,IACZ,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,WAAW,EAAE,EAAE,GAAG,CAAC,EACnB,SAAS,EAAC,QAAQ,GAClB,CACH,CAAC,CAAC,CAAC,IAAI,GACJ,GACc,CACvB,CAAC;AACJ,CAAC,CAAC","sourcesContent":["import {VegaLiteChart, type VisualizationSpec} from '@sqlrooms/vega';\nimport {FC} from 'react';\nimport {CanvasNodeData} from '../CanvasSlice';\nimport {CanvasNodeContainer} from './CanvasNodeContainer';\n\ntype VegaData = Extract<CanvasNodeData, {type: 'vega'}>;\n\nexport const VegaNode: FC<{id: string; data: VegaData}> = ({id, data}) => {\n  const spec = (data.vegaSpec || {\n    mark: 'point',\n    data: {values: []},\n  }) as VisualizationSpec;\n\n  const {vegaSpec, sql} = data;\n\n  return (\n    <CanvasNodeContainer\n      id={id}\n      headerRight={\n        <span className=\"text-[10px] uppercase text-gray-500\">Vega</span>\n      }\n    >\n      <div className=\"h-full flex-1 overflow-hidden p-2\">\n        {sql && vegaSpec ? (\n          <VegaLiteChart\n            spec={vegaSpec}\n            sqlQuery={sql}\n            aspectRatio={16 / 9}\n            className=\"h-full\"\n          />\n        ) : null}\n      </div>\n    </CanvasNodeContainer>\n  );\n};\n"]}