@sqlrooms/canvas 0.24.17

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (39) hide show
  1. package/LICENSE.md +9 -0
  2. package/README.md +6 -0
  3. package/dist/Canvas.d.ts +4 -0
  4. package/dist/Canvas.d.ts.map +1 -0
  5. package/dist/Canvas.js +28 -0
  6. package/dist/Canvas.js.map +1 -0
  7. package/dist/CanvasAssistantDrawer.d.ts +3 -0
  8. package/dist/CanvasAssistantDrawer.d.ts.map +1 -0
  9. package/dist/CanvasAssistantDrawer.js +14 -0
  10. package/dist/CanvasAssistantDrawer.js.map +1 -0
  11. package/dist/CanvasSlice.d.ts +807 -0
  12. package/dist/CanvasSlice.d.ts.map +1 -0
  13. package/dist/CanvasSlice.js +338 -0
  14. package/dist/CanvasSlice.js.map +1 -0
  15. package/dist/dag.d.ts +53 -0
  16. package/dist/dag.d.ts.map +1 -0
  17. package/dist/dag.js +126 -0
  18. package/dist/dag.js.map +1 -0
  19. package/dist/index.d.ts +9 -0
  20. package/dist/index.d.ts.map +1 -0
  21. package/dist/index.js +8 -0
  22. package/dist/index.js.map +1 -0
  23. package/dist/nodes/AddNodePopover.d.ts +6 -0
  24. package/dist/nodes/AddNodePopover.d.ts.map +1 -0
  25. package/dist/nodes/AddNodePopover.js +18 -0
  26. package/dist/nodes/AddNodePopover.js.map +1 -0
  27. package/dist/nodes/CanvasNodeContainer.d.ts +13 -0
  28. package/dist/nodes/CanvasNodeContainer.d.ts.map +1 -0
  29. package/dist/nodes/CanvasNodeContainer.js +31 -0
  30. package/dist/nodes/CanvasNodeContainer.js.map +1 -0
  31. package/dist/nodes/SqlNode.d.ts +11 -0
  32. package/dist/nodes/SqlNode.d.ts.map +1 -0
  33. package/dist/nodes/SqlNode.js +36 -0
  34. package/dist/nodes/SqlNode.js.map +1 -0
  35. package/dist/nodes/VegaNode.d.ts +11 -0
  36. package/dist/nodes/VegaNode.d.ts.map +1 -0
  37. package/dist/nodes/VegaNode.js +12 -0
  38. package/dist/nodes/VegaNode.js.map +1 -0
  39. package/package.json +45 -0
@@ -0,0 +1 @@
1
+ {"version":3,"file":"CanvasSlice.d.ts","sourceRoot":"","sources":["../src/CanvasSlice.ts"],"names":[],"mappings":"AACA,OAAO,EAEL,YAAY,EACZ,aAAa,EAEd,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,cAAc,EAEd,mBAAmB,EAEpB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,KAAK,EAAC,QAAQ,EAAE,UAAU,EAAC,MAAM,eAAe,CAAC;AACxD,OAAO,EAIL,UAAU,EACV,KAAK,UAAU,EACf,KAAK,UAAU,EAChB,MAAM,eAAe,CAAC;AAEvB,OAAO,EAAC,CAAC,EAAC,MAAM,KAAK,CAAC;AAOtB,eAAO,MAAM,eAAe,4BAA0B,CAAC;AACvD,MAAM,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,eAAe,CAAC,CAAC;AAE9D,eAAO,MAAM,cAAc;;;;;;;;;;;;;;;;;;;;;;;;;;;IAYzB,CAAC;AACH,MAAM,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,cAAc,CAAC,CAAC;AAuB5D,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAO3B,CAAC;AACH,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,gBAAgB,CAAC,CAAC;AAEhE,eAAO,MAAM,gBAAgB;;;;;;;;;;;;EAI3B,CAAC;AACH,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,gBAAgB,CAAC,CAAC;AAEhE,MAAM,MAAM,kBAAkB,GAC1B;IAAC,MAAM,EAAE,MAAM,CAAA;CAAC,GAChB;IAAC,MAAM,EAAE,SAAS,CAAA;CAAC,GACnB;IAAC,MAAM,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAC,GAChC;IAAC,MAAM,EAAE,SAAS,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,kBAAkB,EAAE,MAAM,CAAA;CAAC,CAAC;AAEvE,eAAO,MAAM,iBAAiB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;mCA9CH,CAAC;sCAED,CAAC;;;;mCAKL,CAAC;sCAGjB,CAAC;;;;;;;;;;;;;gCAuBD,CAAA;kCACD,CAAA;;;;;gCASJ,CAAA;kCACI,CAAC;;;;;;;;;;gCAiBY,CAAC;kCAEhB,CAAF;;mCACuC,CAAC;sCAE5B,CAAC;;;;;;;gCAQX,CAAA;kCAAyC,CAAC;;mCAGxC,CAAC;sCACI,CAAC;;;;;;;;;;;;;;;yBA8BI,CAAC;;;mCAKX,CAAA;sCAGa,CAAC;;;;;;;gCAWY,CAAA;kCACxB,CAAC;;mCACoB,CAAC;sCAEW,CAAC;;;;;;;yBAON,CAAC;;;mCAED,CAAC;sCAG1B,CAAC;;;;;;;gCAaJ,CAAL;kCACkB,CAAC;;mCAEL,CAAC;sCACJ,CAAA;;;;;;;yBASoC,CAAC;;;mCAG3B,CAAC;sCACQ,CAAC;;;;;;;gCAOlB,CAAD;kCAAyC,CAAC;;mCACzB,CAAC;sCACqB,CAAC;;;;;;;;;;;;;;;;;;;;yBAyBnC,CAApB;;;mCAIoB,CAAb;sCACyB,CAAC;;;;;;;gCAWzB,CAAD;kCAID,CAAA;;mCACY,CAAC;sCACS,CAAC;;;;;;;4BAMA,CAAC;;;;;;;6BAQpB,CAAF;4BACI,CAAF;;;;;;;;;;;;;;;yBAmBA,CAAC;;;mCACoD,CAAC;sCAExD,CAAN;;;;;;;gCAUM,CAAH;kCAAyC,CAAC;;mCAG/B,CAAC;sCAA6D,CAAC;;;;;;;4BAYxC,CAAC;;;;2BAGnB,CAAC;mBACU,CAAC;qBAEnB,CAAA;;;;;;;;;;6BAO4C,CAAC;4BACpC,CAAC;;;;2BAEI,CAAC;mBAAyC,CAAC;qBAIxD,CAAC;;;;;;;;;;;yBASmB,CAAC;;;mCAG1B,CAAC;sCACI,CAAC;;;;;;;gCASF,CAAR;kCACM,CAAF;;mCACsD,CAAC;sCACZ,CAAA;;;;;;;4BAWrC,CAAC;;;;2BAG4C,CAAC;mBACtB,CAAC;qBAC3B,CAAL;;;;;;;;;;;;;;yBAgBiB,CAAC;;;mCAIjB,CAAH;sCAI2B,CAAA;;;;;;;gCAYd,CAAC;kCAET,CAAV;;mCAEM,CAAH;sCAIK,CAAC;;;;;;;4BAUC,CAAR;;;;2BAKO,CAAC;mBACF,CAAC;qBAA2C,CAAC;;wBAEnC,CAAC;;;wBAET,CAAL;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;yBAhDmB,CAAC;;;mCAIjB,CAAH;sCAI2B,CAAA;;;;;;;gCAYd,CAAC;kCAET,CAAV;;mCAEM,CAAH;sCAIK,CAAC;;;;;;;4BAUC,CAAR;;;;2BAKO,CAAC;mBACF,CAAC;qBAA2C,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAlWhC,CAAC;AACxB,MAAM,MAAM,iBAAiB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,iBAAiB,CAAC,CAAC;AAElE,MAAM,MAAM,gBAAgB,GAAG,YAAY,GAAG;IAC5C,MAAM,EAAE;QACN,eAAe,EAAE,OAAO,CAAC;QACzB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;QAC/C,UAAU,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;QAChC,WAAW,EAAE,CAAC,QAAQ,EAAE,QAAQ,KAAK,IAAI,CAAC;QAC1C,gBAAgB,EAAE,CAAC,eAAe,EAAE,OAAO,KAAK,IAAI,CAAC;QACrD,OAAO,EAAE,CAAC,MAAM,EAAE;YAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;YAClB,QAAQ,CAAC,EAAE,eAAe,CAAC;YAC3B,eAAe,CAAC,EAAE,UAAU,CAAC;SAC9B,KAAK,MAAM,CAAC;QACb,qBAAqB,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;QACzD,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;QAChE,UAAU,EAAE,CACV,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,CAAC,IAAI,EAAE,cAAc,KAAK,cAAc,KAC9C,IAAI,CAAC;QACV,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,CAAC;QACrC,gBAAgB,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC,gBAAgB,CAAC,EAAE,KAAK,IAAI,CAAC;QACpE,gBAAgB,EAAE,CAAC,OAAO,EAAE,UAAU,CAAC,gBAAgB,CAAC,EAAE,KAAK,IAAI,CAAC;QACpE,OAAO,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,IAAI,CAAC;QACpC,mBAAmB,EAAE,CACnB,MAAM,EAAE,MAAM,EACd,IAAI,CAAC,EAAE;YAAC,OAAO,CAAC,EAAE,OAAO,CAAA;SAAC,KACvB,OAAO,CAAC,IAAI,CAAC,CAAC;KACpB,CAAC;CACH,CAAC;AAEF,wBAAgB,yBAAyB,CACvC,KAAK,GAAE,OAAO,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAM,GAC/C,iBAAiB,CAUnB;AAED,wBAAgB,iBAAiB,CAC/B,EAAE,SAAS,cAAc,GAAG,iBAAiB,EAC7C,KAAK,EAAE,UAAU,CAAC,OAAO,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,oDAgW/C;AAGD,MAAM,MAAM,oBAAoB,GAAG,cAAc,GAAG,iBAAiB,CAAC;AACtE,MAAM,MAAM,6BAA6B,GACvC,mBAAmB,CAAC,oBAAoB,CAAC,GAAG,gBAAgB,CAAC;AAE/D,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,QAAQ,EAAE,CAAC,KAAK,EAAE,6BAA6B,KAAK,CAAC,GACpD,CAAC,CAMH"}
@@ -0,0 +1,338 @@
1
+ import { createId } from '@paralleldrive/cuid2';
2
+ import { AiSliceConfig, createAiSlice, createDefaultAiConfig, } from '@sqlrooms/ai';
3
+ import { escapeId } from '@sqlrooms/duckdb';
4
+ import { createSlice, useBaseRoomShellStore, } from '@sqlrooms/room-shell';
5
+ import { createVegaChartTool } from '@sqlrooms/vega';
6
+ import { addEdge, applyEdgeChanges, applyNodeChanges, } from '@xyflow/react';
7
+ import { produce } from 'immer';
8
+ import { z } from 'zod';
9
+ import { findNodeById, topoSortAll, topoSortDownstream } from './dag';
10
+ const DEFAULT_NODE_WIDTH = 800;
11
+ const DEFAULT_NODE_HEIGHT = 600;
12
+ const CANVAS_SCHEMA_NAME = 'canvas';
13
+ export const CanvasNodeTypes = z.enum(['sql', 'vega']);
14
+ export const CanvasNodeData = z.discriminatedUnion('type', [
15
+ z.object({
16
+ title: z.string().default('Untitled'),
17
+ type: z.literal('sql'),
18
+ sql: z.string().optional(),
19
+ }),
20
+ z.object({
21
+ title: z.string().default('Untitled'),
22
+ type: z.literal('vega'),
23
+ sql: z.string().optional(),
24
+ vegaSpec: z.any().optional(),
25
+ }),
26
+ ]);
27
+ function isSqlData(data) {
28
+ return data.type === 'sql';
29
+ }
30
+ function getUniqueSqlTitle(nodes, baseTitle, excludeNodeId) {
31
+ const existing = new Set(nodes
32
+ .filter((n) => n.type === 'sql' && n.id !== (excludeNodeId || ''))
33
+ .map((n) => n.data.title || ''));
34
+ if (!existing.has(baseTitle))
35
+ return baseTitle;
36
+ let counter = 1;
37
+ while (existing.has(`${baseTitle} ${counter}`))
38
+ counter += 1;
39
+ return `${baseTitle} ${counter}`;
40
+ }
41
+ export const CanvasNodeSchema = z.object({
42
+ id: z.string(),
43
+ position: z.object({ x: z.number(), y: z.number() }),
44
+ type: CanvasNodeTypes,
45
+ data: CanvasNodeData,
46
+ width: z.number(),
47
+ height: z.number(),
48
+ });
49
+ export const CanvasEdgeSchema = z.object({
50
+ id: z.string(),
51
+ source: z.string(),
52
+ target: z.string(),
53
+ });
54
+ export const CanvasSliceConfig = z
55
+ .object({
56
+ canvas: z.object({
57
+ viewport: z.object({
58
+ x: z.number(),
59
+ y: z.number(),
60
+ zoom: z.number(),
61
+ }),
62
+ nodes: z.array(CanvasNodeSchema).default([]),
63
+ edges: z.array(CanvasEdgeSchema).default([]),
64
+ }),
65
+ })
66
+ .merge(AiSliceConfig);
67
+ export function createDefaultCanvasConfig(props = {}) {
68
+ return {
69
+ canvas: {
70
+ viewport: { x: 0, y: 0, zoom: 1 },
71
+ nodes: [],
72
+ edges: [],
73
+ ...props,
74
+ },
75
+ ...createDefaultAiConfig({}),
76
+ };
77
+ }
78
+ export function createCanvasSlice(props) {
79
+ return createSlice((set, get, store) => ({
80
+ ...createAiSlice({
81
+ ...props,
82
+ customTools: {
83
+ chart: createVegaChartTool(),
84
+ ...props.customTools,
85
+ },
86
+ })(set, get, store),
87
+ canvas: {
88
+ isAssistantOpen: false,
89
+ sqlResults: {},
90
+ setAssistantOpen: (isAssistantOpen) => {
91
+ set((state) => produce(state, (draft) => {
92
+ draft.canvas.isAssistantOpen = isAssistantOpen;
93
+ }));
94
+ },
95
+ async initialize() {
96
+ // Execute SQL nodes in topological order based on edges
97
+ const nodes = get().config.canvas.nodes;
98
+ const edges = get().config.canvas.edges;
99
+ const order = topoSortAll(nodes, edges);
100
+ // Execute SQL nodes sequentially to ensure parents finish before children
101
+ for (const nodeId of order) {
102
+ const node = findNodeById(get().config.canvas.nodes, nodeId);
103
+ if (!node || !isSqlData(node.data))
104
+ continue;
105
+ const sqlText = node.data.sql || '';
106
+ if (!sqlText.trim())
107
+ continue;
108
+ // Await ensures table creation completes before children execute
109
+ await get().canvas.executeSqlNodeQuery(nodeId, { cascade: false });
110
+ }
111
+ await get().db.refreshTableSchemas();
112
+ },
113
+ addNode: ({ parentId, nodeType = 'sql', initialPosition, }) => {
114
+ const newId = createId();
115
+ set((state) => produce(state, (draft) => {
116
+ const parent = parentId
117
+ ? findNodeById(draft.config.canvas.nodes, parentId)
118
+ : undefined;
119
+ const position = initialPosition
120
+ ? initialPosition
121
+ : parent
122
+ ? {
123
+ x: parent.position.x + parent.width + 100,
124
+ y: parent.position.y,
125
+ }
126
+ : {
127
+ x: draft.config.canvas.viewport.x + 100,
128
+ y: draft.config.canvas.viewport.y + 100,
129
+ };
130
+ const firstTable = draft.db.tables.find((t) => t.table.schema === 'main');
131
+ const getInitialSqlForNewSqlNode = () => {
132
+ if (parent && isSqlData(parent.data)) {
133
+ const parentResults = draft.canvas.sqlResults[parent.id];
134
+ const parentTitle = parent.data.title || 'Query';
135
+ const fallbackParentTable = `${CANVAS_SCHEMA_NAME}.${escapeId(parentTitle)}`;
136
+ const parentTableName = parentResults && parentResults.status === 'success'
137
+ ? parentResults.tableName
138
+ : fallbackParentTable;
139
+ return `SELECT * FROM ${parentTableName}`;
140
+ }
141
+ return firstTable
142
+ ? `SELECT * FROM ${firstTable.table.table}`
143
+ : `SELECT 1`;
144
+ };
145
+ const newSqlTitle = getUniqueSqlTitle(draft.config.canvas.nodes, 'Query');
146
+ const initialSql = getInitialSqlForNewSqlNode();
147
+ draft.config.canvas.nodes.push({
148
+ id: newId,
149
+ position,
150
+ width: DEFAULT_NODE_WIDTH,
151
+ height: DEFAULT_NODE_HEIGHT,
152
+ type: nodeType,
153
+ data: (nodeType === 'sql'
154
+ ? {
155
+ title: newSqlTitle,
156
+ type: 'sql',
157
+ sql: initialSql,
158
+ }
159
+ : {
160
+ title: 'Chart',
161
+ type: 'vega',
162
+ }),
163
+ });
164
+ if (parentId) {
165
+ draft.config.canvas.edges.push({
166
+ id: `${parentId}-${newId}`,
167
+ source: parentId,
168
+ target: newId,
169
+ });
170
+ }
171
+ }));
172
+ return newId;
173
+ },
174
+ executeDownstreamFrom: async (nodeId) => {
175
+ const allNodes = get().config.canvas.nodes;
176
+ const allEdges = get().config.canvas.edges;
177
+ const downstreamOrder = topoSortDownstream(nodeId, allNodes, allEdges);
178
+ for (const childId of downstreamOrder) {
179
+ const child = findNodeById(allNodes, childId);
180
+ if (!child || !isSqlData(child.data))
181
+ continue;
182
+ const text = child.data.sql || '';
183
+ if (!text.trim())
184
+ continue;
185
+ await get().canvas.executeSqlNodeQuery(childId, { cascade: false });
186
+ }
187
+ await get().db.refreshTableSchemas();
188
+ },
189
+ addEdge: (connection) => {
190
+ set((state) => produce(state, (draft) => {
191
+ draft.config.canvas.edges = addEdge(connection, draft.config.canvas.edges);
192
+ }));
193
+ },
194
+ updateNode: (nodeId, updater) => {
195
+ set((state) => produce(state, (draft) => {
196
+ const node = findNodeById(draft.config.canvas.nodes, nodeId);
197
+ if (node) {
198
+ node.data = updater(node.data);
199
+ }
200
+ }));
201
+ },
202
+ renameNode: async (nodeId, newTitle) => {
203
+ const node = findNodeById(get().config.canvas.nodes, nodeId);
204
+ if (!node)
205
+ throw new Error('Node not found');
206
+ if (!isSqlData(node.data)) {
207
+ set((state) => produce(state, (draft) => {
208
+ const dnode = findNodeById(draft.config.canvas.nodes, nodeId);
209
+ if (dnode)
210
+ dnode.data.title = newTitle;
211
+ }));
212
+ return;
213
+ }
214
+ const prevTitle = node.data.title || 'result';
215
+ if (prevTitle === newTitle)
216
+ return;
217
+ // Ensure title uniqueness among SQL nodes by adjusting to a unique variant
218
+ const uniqueTitle = getUniqueSqlTitle(get().config.canvas.nodes, newTitle, nodeId);
219
+ const connector = await get().db.getConnector();
220
+ await connector.query(`CREATE SCHEMA IF NOT EXISTS ${CANVAS_SCHEMA_NAME}`);
221
+ const result = get().canvas.sqlResults[nodeId];
222
+ const oldTableName = result && result.status === 'success'
223
+ ? result.tableName
224
+ : `${CANVAS_SCHEMA_NAME}.${escapeId(prevTitle)}`;
225
+ await connector.query(`ALTER TABLE ${oldTableName} RENAME TO ${escapeId(uniqueTitle)}`);
226
+ const newQualified = `${CANVAS_SCHEMA_NAME}.${escapeId(uniqueTitle)}`;
227
+ set((state) => produce(state, (draft) => {
228
+ const dnode = findNodeById(draft.config.canvas.nodes, nodeId);
229
+ if (dnode)
230
+ dnode.data.title = uniqueTitle;
231
+ const r = draft.canvas.sqlResults[nodeId];
232
+ if (r && r.status === 'success')
233
+ r.tableName = newQualified;
234
+ }));
235
+ await get().db.refreshTableSchemas();
236
+ // Recompute children since upstream table name changed
237
+ await get().canvas.executeDownstreamFrom(nodeId);
238
+ },
239
+ deleteNode: (nodeId) => {
240
+ const current = get();
241
+ const node = findNodeById(current.config.canvas.nodes, nodeId);
242
+ let tableToDrop;
243
+ if (node && isSqlData(node.data)) {
244
+ const title = node.data.title || 'result';
245
+ const res = current.canvas.sqlResults[nodeId];
246
+ tableToDrop =
247
+ res && res.status === 'success'
248
+ ? res.tableName
249
+ : `${CANVAS_SCHEMA_NAME}.${escapeId(title)}`;
250
+ }
251
+ set((state) => produce(state, (draft) => {
252
+ draft.config.canvas.nodes = draft.config.canvas.nodes.filter((n) => n.id !== nodeId);
253
+ draft.config.canvas.edges = draft.config.canvas.edges.filter((e) => e.source !== nodeId && e.target !== nodeId);
254
+ // Clear stored result for the node
255
+ delete draft.canvas.sqlResults[nodeId];
256
+ if (draft.config.canvas.nodes.length === 0) {
257
+ draft.config.canvas.viewport.x = 0;
258
+ draft.config.canvas.viewport.y = 0;
259
+ }
260
+ }));
261
+ if (tableToDrop) {
262
+ (async () => {
263
+ try {
264
+ const connector = await get().db.getConnector();
265
+ await connector.query(`DROP TABLE IF EXISTS ${tableToDrop}`);
266
+ await get().db.refreshTableSchemas();
267
+ }
268
+ catch (e) {
269
+ // eslint-disable-next-line no-console
270
+ console.warn('[canvas.deleteNode] Failed to drop table for node', nodeId, e);
271
+ }
272
+ })();
273
+ }
274
+ },
275
+ applyNodeChanges: (changes) => {
276
+ set((state) => produce(state, (draft) => {
277
+ draft.config.canvas.nodes = applyNodeChanges(changes, draft.config.canvas.nodes);
278
+ }));
279
+ },
280
+ applyEdgeChanges: (changes) => {
281
+ set((state) => produce(state, (draft) => {
282
+ draft.config.canvas.edges = applyEdgeChanges(changes, draft.config.canvas.edges);
283
+ }));
284
+ },
285
+ setViewport: (viewport) => {
286
+ set((state) => produce(state, (draft) => {
287
+ draft.config.canvas.viewport = viewport;
288
+ }));
289
+ },
290
+ executeSqlNodeQuery: async (nodeId, opts) => {
291
+ const node = findNodeById(get().config.canvas.nodes, nodeId);
292
+ if (!node || !isSqlData(node.data))
293
+ return;
294
+ const sql = node.data.sql || '';
295
+ const title = node.data.title || 'result';
296
+ set((state) => produce(state, (draft) => {
297
+ draft.canvas.sqlResults[nodeId] = { status: 'loading' };
298
+ }));
299
+ try {
300
+ // Validate it's a single select
301
+ const parsed = await get().db.sqlSelectToJson(sql);
302
+ if (parsed.error) {
303
+ throw new Error(parsed.error_message || 'Not a valid SELECT statement');
304
+ }
305
+ // Create schema and table
306
+ const connector = await get().db.getConnector();
307
+ await connector.query(`CREATE SCHEMA IF NOT EXISTS ${CANVAS_SCHEMA_NAME}`);
308
+ const tableName = `${CANVAS_SCHEMA_NAME}.${escapeId(title)}`;
309
+ await connector.query(`CREATE OR REPLACE TABLE ${tableName} AS ${sql}`);
310
+ set((state) => produce(state, (draft) => {
311
+ draft.canvas.sqlResults[nodeId] = {
312
+ status: 'success',
313
+ tableName,
314
+ lastQueryStatement: sql,
315
+ };
316
+ }));
317
+ // Cascade execution to downstream SQL nodes (topologically) unless disabled
318
+ if (opts?.cascade !== false) {
319
+ await get().canvas.executeDownstreamFrom(nodeId);
320
+ }
321
+ }
322
+ catch (e) {
323
+ const message = e instanceof Error ? e.message : String(e);
324
+ set((state) => produce(state, (draft) => {
325
+ draft.canvas.sqlResults[nodeId] = {
326
+ status: 'error',
327
+ error: message,
328
+ };
329
+ }));
330
+ }
331
+ },
332
+ },
333
+ }));
334
+ }
335
+ export function useStoreWithCanvas(selector) {
336
+ return useBaseRoomShellStore((state) => selector(state));
337
+ }
338
+ //# sourceMappingURL=CanvasSlice.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"CanvasSlice.js","sourceRoot":"","sources":["../src/CanvasSlice.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAC,MAAM,sBAAsB,CAAC;AAC9C,OAAO,EACL,aAAa,EAEb,aAAa,EACb,qBAAqB,GACtB,MAAM,cAAc,CAAC;AACtB,OAAO,EAAC,QAAQ,EAAC,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAEL,WAAW,EAEX,qBAAqB,GACtB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAC,mBAAmB,EAAC,MAAM,gBAAgB,CAAC;AAEnD,OAAO,EACL,OAAO,EACP,gBAAgB,EAChB,gBAAgB,GAIjB,MAAM,eAAe,CAAC;AACvB,OAAO,EAAC,OAAO,EAAC,MAAM,OAAO,CAAC;AAC9B,OAAO,EAAC,CAAC,EAAC,MAAM,KAAK,CAAC;AACtB,OAAO,EAAC,YAAY,EAAE,WAAW,EAAE,kBAAkB,EAAC,MAAM,OAAO,CAAC;AAEpE,MAAM,kBAAkB,GAAG,GAAG,CAAC;AAC/B,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAChC,MAAM,kBAAkB,GAAG,QAAQ,CAAC;AAEpC,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AAGvD,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE;IACzD,CAAC,CAAC,MAAM,CAAC;QACP,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC;QACrC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;QACtB,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;KAC3B,CAAC;IACF,CAAC,CAAC,MAAM,CAAC;QACP,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC;QACrC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;QACvB,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;QAC1B,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE;KAC7B,CAAC;CACH,CAAC,CAAC;AAIH,SAAS,SAAS,CAAC,IAAoB;IACrC,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC;AAC7B,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAyB,EACzB,SAAiB,EACjB,aAAsB;IAEtB,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,KAAK;SACF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC;SACjE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAClC,CAAC;IACF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IAC/C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,QAAQ,CAAC,GAAG,CAAC,GAAG,SAAS,IAAI,OAAO,EAAE,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC;IAC7D,OAAO,GAAG,SAAS,IAAI,OAAO,EAAE,CAAC;AACnC,CAAC;AAED,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE;IACd,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,EAAC,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,EAAC,CAAC;IAClD,IAAI,EAAE,eAAe;IACrB,IAAI,EAAE,cAAc;IACpB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;IACjB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;CACnB,CAAC,CAAC;AAGH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE;IACd,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;IAClB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE;CACnB,CAAC,CAAC;AASH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC;KAC/B,MAAM,CAAC;IACN,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC;QACf,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC;YACjB,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE;YACb,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE;YACb,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE;SACjB,CAAC;QACF,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5C,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;KAC7C,CAAC;CACH,CAAC;KACD,KAAK,CAAC,aAAa,CAAC,CAAC;AAgCxB,MAAM,UAAU,yBAAyB,CACvC,QAA8C,EAAE;IAEhD,OAAO;QACL,MAAM,EAAE;YACN,QAAQ,EAAE,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAC;YAC/B,KAAK,EAAE,EAAE;YACT,KAAK,EAAE,EAAE;YACT,GAAG,KAAK;SACT;QACD,GAAG,qBAAqB,CAAC,EAAE,CAAC;KAC7B,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iBAAiB,CAE/B,KAA8C;IAC9C,OAAO,WAAW,CAAuB,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QAC7D,GAAG,aAAa,CAAC;YACf,GAAG,KAAK;YACR,WAAW,EAAE;gBACX,KAAK,EAAE,mBAAmB,EAAE;gBAC5B,GAAG,KAAK,CAAC,WAAW;aACrB;SACF,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC;QACnB,MAAM,EAAE;YACN,eAAe,EAAE,KAAK;YACtB,UAAU,EAAE,EAAE;YACd,gBAAgB,EAAE,CAAC,eAAe,EAAE,EAAE;gBACpC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,KAAK,CAAC,MAAM,CAAC,eAAe,GAAG,eAAe,CAAC;gBACjD,CAAC,CAAC,CACH,CAAC;YACJ,CAAC;YAED,KAAK,CAAC,UAAU;gBACd,wDAAwD;gBACxD,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;gBACxC,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;gBAExC,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAExC,0EAA0E;gBAC1E,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;oBAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBAC7D,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;wBAAE,SAAS;oBAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBACpC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;wBAAE,SAAS;oBAC9B,iEAAiE;oBACjE,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,MAAM,EAAE,EAAC,OAAO,EAAE,KAAK,EAAC,CAAC,CAAC;gBACnE,CAAC;gBAED,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,mBAAmB,EAAE,CAAC;YACvC,CAAC;YAED,OAAO,EAAE,CAAC,EACR,QAAQ,EACR,QAAQ,GAAG,KAAK,EAChB,eAAe,GAKhB,EAAE,EAAE;gBACH,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACzB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,MAAM,MAAM,GAAG,QAAQ;wBACrB,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC;wBACnD,CAAC,CAAC,SAAS,CAAC;oBACd,MAAM,QAAQ,GAAe,eAAe;wBAC1C,CAAC,CAAC,eAAe;wBACjB,CAAC,CAAC,MAAM;4BACN,CAAC,CAAC;gCACE,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,GAAG;gCACzC,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;6BACrB;4BACH,CAAC,CAAC;gCACE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,GAAG;gCACvC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,GAAG;6BACxC,CAAC;oBACR,MAAM,UAAU,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CACrC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,MAAM,CACjC,CAAC;oBAEF,MAAM,0BAA0B,GAAG,GAAG,EAAE;wBACtC,IAAI,MAAM,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;4BACrC,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;4BACzD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,OAAO,CAAC;4BACjD,MAAM,mBAAmB,GAAG,GAAG,kBAAkB,IAAI,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;4BAC7E,MAAM,eAAe,GACnB,aAAa,IAAI,aAAa,CAAC,MAAM,KAAK,SAAS;gCACjD,CAAC,CAAC,aAAa,CAAC,SAAS;gCACzB,CAAC,CAAC,mBAAmB,CAAC;4BAC1B,OAAO,iBAAiB,eAAe,EAAE,CAAC;wBAC5C,CAAC;wBACD,OAAO,UAAU;4BACf,CAAC,CAAC,iBAAiB,UAAU,CAAC,KAAK,CAAC,KAAK,EAAE;4BAC3C,CAAC,CAAC,UAAU,CAAC;oBACjB,CAAC,CAAC;oBAEF,MAAM,WAAW,GAAG,iBAAiB,CACnC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EACzB,OAAO,CACR,CAAC;oBACF,MAAM,UAAU,GAAG,0BAA0B,EAAE,CAAC;oBAEhD,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;wBAC7B,EAAE,EAAE,KAAK;wBACT,QAAQ;wBACR,KAAK,EAAE,kBAAkB;wBACzB,MAAM,EAAE,mBAAmB;wBAC3B,IAAI,EAAE,QAAQ;wBACd,IAAI,EAAE,CAAC,QAAQ,KAAK,KAAK;4BACvB,CAAC,CAAC;gCACE,KAAK,EAAE,WAAW;gCAClB,IAAI,EAAE,KAAK;gCACX,GAAG,EAAE,UAAU;6BAChB;4BACH,CAAC,CAAC;gCACE,KAAK,EAAE,OAAO;gCACd,IAAI,EAAE,MAAM;6BACb,CAAmB;qBACzB,CAAC,CAAC;oBACH,IAAI,QAAQ,EAAE,CAAC;wBACb,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;4BAC7B,EAAE,EAAE,GAAG,QAAQ,IAAI,KAAK,EAAE;4BAC1B,MAAM,EAAE,QAAQ;4BAChB,MAAM,EAAE,KAAK;yBACd,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC,CAAC,CACH,CAAC;gBACF,OAAO,KAAK,CAAC;YACf,CAAC;YAED,qBAAqB,EAAE,KAAK,EAAE,MAAc,EAAE,EAAE;gBAC9C,MAAM,QAAQ,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;gBAC3C,MAAM,QAAQ,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;gBAC3C,MAAM,eAAe,GAAG,kBAAkB,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACvE,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;oBACtC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;oBAC9C,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC;wBAAE,SAAS;oBAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;oBAClC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;wBAAE,SAAS;oBAC3B,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,EAAC,OAAO,EAAE,KAAK,EAAC,CAAC,CAAC;gBACpE,CAAC;gBACD,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,mBAAmB,EAAE,CAAC;YACvC,CAAC;YAED,OAAO,EAAE,CAAC,UAAU,EAAE,EAAE;gBACtB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,OAAO,CACjC,UAAU,EACV,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAC1B,CAAC;gBACJ,CAAC,CAAC,CACH,CAAC;YACJ,CAAC;YAED,UAAU,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE;gBAC9B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBAC7D,IAAI,IAAI,EAAE,CAAC;wBACT,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAsB,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC,CAAC,CACH,CAAC;YACJ,CAAC;YAED,UAAU,EAAE,KAAK,EAAE,MAAc,EAAE,QAAgB,EAAE,EAAE;gBACrD,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7D,IAAI,CAAC,IAAI;oBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;gBAC7C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;wBACvB,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;wBAC9D,IAAI,KAAK;4BAAE,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;oBACzC,CAAC,CAAC,CACH,CAAC;oBACF,OAAO;gBACT,CAAC;gBAED,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC;gBAC9C,IAAI,SAAS,KAAK,QAAQ;oBAAE,OAAO;gBAEnC,2EAA2E;gBAC3E,MAAM,WAAW,GAAG,iBAAiB,CACnC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EACzB,QAAQ,EACR,MAAM,CACP,CAAC;gBAEF,MAAM,SAAS,GAAG,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,YAAY,EAAE,CAAC;gBAChD,MAAM,SAAS,CAAC,KAAK,CACnB,+BAA+B,kBAAkB,EAAE,CACpD,CAAC;gBAEF,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;gBAC/C,MAAM,YAAY,GAChB,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;oBACnC,CAAC,CAAC,MAAM,CAAC,SAAS;oBAClB,CAAC,CAAC,GAAG,kBAAkB,IAAI,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBAErD,MAAM,SAAS,CAAC,KAAK,CACnB,eAAe,YAAY,cAAc,QAAQ,CAAC,WAAW,CAAC,EAAE,CACjE,CAAC;gBAEF,MAAM,YAAY,GAAG,GAAG,kBAAkB,IAAI,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;gBACtE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;oBAC9D,IAAI,KAAK;wBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC;oBAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;oBAC1C,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS;wBAAE,CAAC,CAAC,SAAS,GAAG,YAAY,CAAC;gBAC9D,CAAC,CAAC,CACH,CAAC;gBAEF,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,mBAAmB,EAAE,CAAC;gBAErC,uDAAuD;gBACvD,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;YACnD,CAAC;YAED,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE;gBACrB,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC;gBACtB,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC/D,IAAI,WAA+B,CAAC;gBACpC,IAAI,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC;oBAC1C,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;oBAC9C,WAAW;wBACT,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;4BAC7B,CAAC,CAAC,GAAG,CAAC,SAAS;4BACf,CAAC,CAAC,GAAG,kBAAkB,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnD,CAAC;gBAED,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAC1D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CACvB,CAAC;oBACF,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAC1D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAClD,CAAC;oBACF,mCAAmC;oBACnC,OAAO,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;oBACvC,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAC3C,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;wBACnC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;oBACrC,CAAC;gBACH,CAAC,CAAC,CACH,CAAC;gBAEF,IAAI,WAAW,EAAE,CAAC;oBAChB,CAAC,KAAK,IAAI,EAAE;wBACV,IAAI,CAAC;4BACH,MAAM,SAAS,GAAG,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,YAAY,EAAE,CAAC;4BAChD,MAAM,SAAS,CAAC,KAAK,CAAC,wBAAwB,WAAW,EAAE,CAAC,CAAC;4BAC7D,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,mBAAmB,EAAE,CAAC;wBACvC,CAAC;wBAAC,OAAO,CAAC,EAAE,CAAC;4BACX,sCAAsC;4BACtC,OAAO,CAAC,IAAI,CACV,mDAAmD,EACnD,MAAM,EACN,CAAC,CACF,CAAC;wBACJ,CAAC;oBACH,CAAC,CAAC,EAAE,CAAC;gBACP,CAAC;YACH,CAAC;YAED,gBAAgB,EAAE,CAAC,OAAO,EAAE,EAAE;gBAC5B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,gBAAgB,CAC1C,OAAO,EACP,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAC1B,CAAC;gBACJ,CAAC,CAAC,CACH,CAAC;YACJ,CAAC;YAED,gBAAgB,EAAE,CAAC,OAAO,EAAE,EAAE;gBAC5B,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,GAAG,gBAAgB,CAC1C,OAAO,EACP,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAC1B,CAAC;gBACJ,CAAC,CAAC,CACH,CAAC;YACJ,CAAC;YAED,WAAW,EAAE,CAAC,QAAQ,EAAE,EAAE;gBACxB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBAC1C,CAAC,CAAC,CACH,CAAC;YACJ,CAAC;YAED,mBAAmB,EAAE,KAAK,EACxB,MAAc,EACd,IAA0B,EAC1B,EAAE;gBACF,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC7D,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,OAAO;gBAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC;gBAE1C,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;oBACvB,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,EAAC,MAAM,EAAE,SAAS,EAAC,CAAC;gBACxD,CAAC,CAAC,CACH,CAAC;gBAEF,IAAI,CAAC;oBACH,gCAAgC;oBAChC,MAAM,MAAM,GAAG,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;oBACnD,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;wBACjB,MAAM,IAAI,KAAK,CACb,MAAM,CAAC,aAAa,IAAI,8BAA8B,CACvD,CAAC;oBACJ,CAAC;oBAED,0BAA0B;oBAC1B,MAAM,SAAS,GAAG,MAAM,GAAG,EAAE,CAAC,EAAE,CAAC,YAAY,EAAE,CAAC;oBAChD,MAAM,SAAS,CAAC,KAAK,CACnB,+BAA+B,kBAAkB,EAAE,CACpD,CAAC;oBAEF,MAAM,SAAS,GAAG,GAAG,kBAAkB,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC7D,MAAM,SAAS,CAAC,KAAK,CACnB,2BAA2B,SAAS,OAAO,GAAG,EAAE,CACjD,CAAC;oBAEF,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;wBACvB,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG;4BAChC,MAAM,EAAE,SAAS;4BACjB,SAAS;4BACT,kBAAkB,EAAE,GAAG;yBACxB,CAAC;oBACJ,CAAC,CAAC,CACH,CAAC;oBAEF,4EAA4E;oBAC5E,IAAI,IAAI,EAAE,OAAO,KAAK,KAAK,EAAE,CAAC;wBAC5B,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;oBACnD,CAAC;gBACH,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,MAAM,OAAO,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC3D,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACZ,OAAO,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,EAAE;wBACvB,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG;4BAChC,MAAM,EAAE,OAAO;4BACf,KAAK,EAAE,OAAO;yBACf,CAAC;oBACJ,CAAC,CAAC,CACH,CAAC;gBACJ,CAAC;YACH,CAAC;SACF;KACF,CAAC,CAAC,CAAC;AACN,CAAC;AAOD,MAAM,UAAU,kBAAkB,CAChC,QAAqD;IAErD,OAAO,qBAAqB,CAI1B,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAiD,CAAC,CAAC,CAAC;AAC5E,CAAC","sourcesContent":["import {createId} from '@paralleldrive/cuid2';\nimport {\n AiSliceConfig,\n AiSliceState,\n createAiSlice,\n createDefaultAiConfig,\n} from '@sqlrooms/ai';\nimport {escapeId} from '@sqlrooms/duckdb';\nimport {\n BaseRoomConfig,\n createSlice,\n RoomShellSliceState,\n useBaseRoomShellStore,\n} from '@sqlrooms/room-shell';\nimport {createVegaChartTool} from '@sqlrooms/vega';\nimport type {Viewport, XYPosition} from '@xyflow/react';\nimport {\n addEdge,\n applyEdgeChanges,\n applyNodeChanges,\n Connection,\n type EdgeChange,\n type NodeChange,\n} from '@xyflow/react';\nimport {produce} from 'immer';\nimport {z} from 'zod';\nimport {findNodeById, topoSortAll, topoSortDownstream} from './dag';\n\nconst DEFAULT_NODE_WIDTH = 800;\nconst DEFAULT_NODE_HEIGHT = 600;\nconst CANVAS_SCHEMA_NAME = 'canvas';\n\nexport const CanvasNodeTypes = z.enum(['sql', 'vega']);\nexport type CanvasNodeTypes = z.infer<typeof CanvasNodeTypes>;\n\nexport const CanvasNodeData = z.discriminatedUnion('type', [\n z.object({\n title: z.string().default('Untitled'),\n type: z.literal('sql'),\n sql: z.string().optional(),\n }),\n z.object({\n title: z.string().default('Untitled'),\n type: z.literal('vega'),\n sql: z.string().optional(),\n vegaSpec: z.any().optional(),\n }),\n]);\nexport type CanvasNodeData = z.infer<typeof CanvasNodeData>;\n\ntype SqlData = Extract<CanvasNodeData, {type: 'sql'}>;\nfunction isSqlData(data: CanvasNodeData): data is SqlData {\n return data.type === 'sql';\n}\n\nfunction getUniqueSqlTitle(\n nodes: CanvasNodeSchema[],\n baseTitle: string,\n excludeNodeId?: string,\n): string {\n const existing = new Set(\n nodes\n .filter((n) => n.type === 'sql' && n.id !== (excludeNodeId || ''))\n .map((n) => n.data.title || ''),\n );\n if (!existing.has(baseTitle)) return baseTitle;\n let counter = 1;\n while (existing.has(`${baseTitle} ${counter}`)) counter += 1;\n return `${baseTitle} ${counter}`;\n}\n\nexport const CanvasNodeSchema = z.object({\n id: z.string(),\n position: z.object({x: z.number(), y: z.number()}),\n type: CanvasNodeTypes,\n data: CanvasNodeData,\n width: z.number(),\n height: z.number(),\n});\nexport type CanvasNodeSchema = z.infer<typeof CanvasNodeSchema>;\n\nexport const CanvasEdgeSchema = z.object({\n id: z.string(),\n source: z.string(),\n target: z.string(),\n});\nexport type CanvasEdgeSchema = z.infer<typeof CanvasEdgeSchema>;\n\nexport type SqlNodeQueryResult =\n | {status: 'idle'}\n | {status: 'loading'}\n | {status: 'error'; error: string}\n | {status: 'success'; tableName: string; lastQueryStatement: string};\n\nexport const CanvasSliceConfig = z\n .object({\n canvas: z.object({\n viewport: z.object({\n x: z.number(),\n y: z.number(),\n zoom: z.number(),\n }),\n nodes: z.array(CanvasNodeSchema).default([]),\n edges: z.array(CanvasEdgeSchema).default([]),\n }),\n })\n .merge(AiSliceConfig);\nexport type CanvasSliceConfig = z.infer<typeof CanvasSliceConfig>;\n\nexport type CanvasSliceState = AiSliceState & {\n canvas: {\n isAssistantOpen: boolean;\n sqlResults: Record<string, SqlNodeQueryResult>;\n initialize: () => Promise<void>;\n setViewport: (viewport: Viewport) => void;\n setAssistantOpen: (isAssistantOpen: boolean) => void;\n addNode: (params: {\n parentId?: string;\n nodeType?: CanvasNodeTypes;\n initialPosition?: XYPosition;\n }) => string;\n executeDownstreamFrom: (nodeId: string) => Promise<void>;\n renameNode: (nodeId: string, newTitle: string) => Promise<void>;\n updateNode: (\n nodeId: string,\n updater: (data: CanvasNodeData) => CanvasNodeData,\n ) => void;\n deleteNode: (nodeId: string) => void;\n applyNodeChanges: (changes: NodeChange<CanvasNodeSchema>[]) => void;\n applyEdgeChanges: (changes: EdgeChange<CanvasEdgeSchema>[]) => void;\n addEdge: (edge: Connection) => void;\n executeSqlNodeQuery: (\n nodeId: string,\n opts?: {cascade?: boolean},\n ) => Promise<void>;\n };\n};\n\nexport function createDefaultCanvasConfig(\n props: Partial<CanvasSliceConfig['canvas']> = {},\n): CanvasSliceConfig {\n return {\n canvas: {\n viewport: {x: 0, y: 0, zoom: 1},\n nodes: [],\n edges: [],\n ...props,\n },\n ...createDefaultAiConfig({}),\n };\n}\n\nexport function createCanvasSlice<\n PC extends BaseRoomConfig & CanvasSliceConfig,\n>(props: Parameters<typeof createAiSlice<PC>>[0]) {\n return createSlice<PC, CanvasSliceState>((set, get, store) => ({\n ...createAiSlice({\n ...props,\n customTools: {\n chart: createVegaChartTool(),\n ...props.customTools,\n },\n })(set, get, store),\n canvas: {\n isAssistantOpen: false,\n sqlResults: {},\n setAssistantOpen: (isAssistantOpen) => {\n set((state) =>\n produce(state, (draft) => {\n draft.canvas.isAssistantOpen = isAssistantOpen;\n }),\n );\n },\n\n async initialize() {\n // Execute SQL nodes in topological order based on edges\n const nodes = get().config.canvas.nodes;\n const edges = get().config.canvas.edges;\n\n const order = topoSortAll(nodes, edges);\n\n // Execute SQL nodes sequentially to ensure parents finish before children\n for (const nodeId of order) {\n const node = findNodeById(get().config.canvas.nodes, nodeId);\n if (!node || !isSqlData(node.data)) continue;\n const sqlText = node.data.sql || '';\n if (!sqlText.trim()) continue;\n // Await ensures table creation completes before children execute\n await get().canvas.executeSqlNodeQuery(nodeId, {cascade: false});\n }\n\n await get().db.refreshTableSchemas();\n },\n\n addNode: ({\n parentId,\n nodeType = 'sql',\n initialPosition,\n }: {\n parentId?: string;\n nodeType?: CanvasNodeTypes;\n initialPosition?: XYPosition;\n }) => {\n const newId = createId();\n set((state) =>\n produce(state, (draft) => {\n const parent = parentId\n ? findNodeById(draft.config.canvas.nodes, parentId)\n : undefined;\n const position: XYPosition = initialPosition\n ? initialPosition\n : parent\n ? {\n x: parent.position.x + parent.width + 100,\n y: parent.position.y,\n }\n : {\n x: draft.config.canvas.viewport.x + 100,\n y: draft.config.canvas.viewport.y + 100,\n };\n const firstTable = draft.db.tables.find(\n (t) => t.table.schema === 'main',\n );\n\n const getInitialSqlForNewSqlNode = () => {\n if (parent && isSqlData(parent.data)) {\n const parentResults = draft.canvas.sqlResults[parent.id];\n const parentTitle = parent.data.title || 'Query';\n const fallbackParentTable = `${CANVAS_SCHEMA_NAME}.${escapeId(parentTitle)}`;\n const parentTableName =\n parentResults && parentResults.status === 'success'\n ? parentResults.tableName\n : fallbackParentTable;\n return `SELECT * FROM ${parentTableName}`;\n }\n return firstTable\n ? `SELECT * FROM ${firstTable.table.table}`\n : `SELECT 1`;\n };\n\n const newSqlTitle = getUniqueSqlTitle(\n draft.config.canvas.nodes,\n 'Query',\n );\n const initialSql = getInitialSqlForNewSqlNode();\n\n draft.config.canvas.nodes.push({\n id: newId,\n position,\n width: DEFAULT_NODE_WIDTH,\n height: DEFAULT_NODE_HEIGHT,\n type: nodeType,\n data: (nodeType === 'sql'\n ? {\n title: newSqlTitle,\n type: 'sql',\n sql: initialSql,\n }\n : {\n title: 'Chart',\n type: 'vega',\n }) as CanvasNodeData,\n });\n if (parentId) {\n draft.config.canvas.edges.push({\n id: `${parentId}-${newId}`,\n source: parentId,\n target: newId,\n });\n }\n }),\n );\n return newId;\n },\n\n executeDownstreamFrom: async (nodeId: string) => {\n const allNodes = get().config.canvas.nodes;\n const allEdges = get().config.canvas.edges;\n const downstreamOrder = topoSortDownstream(nodeId, allNodes, allEdges);\n for (const childId of downstreamOrder) {\n const child = findNodeById(allNodes, childId);\n if (!child || !isSqlData(child.data)) continue;\n const text = child.data.sql || '';\n if (!text.trim()) continue;\n await get().canvas.executeSqlNodeQuery(childId, {cascade: false});\n }\n await get().db.refreshTableSchemas();\n },\n\n addEdge: (connection) => {\n set((state) =>\n produce(state, (draft) => {\n draft.config.canvas.edges = addEdge(\n connection,\n draft.config.canvas.edges,\n );\n }),\n );\n },\n\n updateNode: (nodeId, updater) => {\n set((state) =>\n produce(state, (draft) => {\n const node = findNodeById(draft.config.canvas.nodes, nodeId);\n if (node) {\n node.data = updater(node.data as CanvasNodeData);\n }\n }),\n );\n },\n\n renameNode: async (nodeId: string, newTitle: string) => {\n const node = findNodeById(get().config.canvas.nodes, nodeId);\n if (!node) throw new Error('Node not found');\n if (!isSqlData(node.data)) {\n set((state) =>\n produce(state, (draft) => {\n const dnode = findNodeById(draft.config.canvas.nodes, nodeId);\n if (dnode) dnode.data.title = newTitle;\n }),\n );\n return;\n }\n\n const prevTitle = node.data.title || 'result';\n if (prevTitle === newTitle) return;\n\n // Ensure title uniqueness among SQL nodes by adjusting to a unique variant\n const uniqueTitle = getUniqueSqlTitle(\n get().config.canvas.nodes,\n newTitle,\n nodeId,\n );\n\n const connector = await get().db.getConnector();\n await connector.query(\n `CREATE SCHEMA IF NOT EXISTS ${CANVAS_SCHEMA_NAME}`,\n );\n\n const result = get().canvas.sqlResults[nodeId];\n const oldTableName =\n result && result.status === 'success'\n ? result.tableName\n : `${CANVAS_SCHEMA_NAME}.${escapeId(prevTitle)}`;\n\n await connector.query(\n `ALTER TABLE ${oldTableName} RENAME TO ${escapeId(uniqueTitle)}`,\n );\n\n const newQualified = `${CANVAS_SCHEMA_NAME}.${escapeId(uniqueTitle)}`;\n set((state) =>\n produce(state, (draft) => {\n const dnode = findNodeById(draft.config.canvas.nodes, nodeId);\n if (dnode) dnode.data.title = uniqueTitle;\n const r = draft.canvas.sqlResults[nodeId];\n if (r && r.status === 'success') r.tableName = newQualified;\n }),\n );\n\n await get().db.refreshTableSchemas();\n\n // Recompute children since upstream table name changed\n await get().canvas.executeDownstreamFrom(nodeId);\n },\n\n deleteNode: (nodeId) => {\n const current = get();\n const node = findNodeById(current.config.canvas.nodes, nodeId);\n let tableToDrop: string | undefined;\n if (node && isSqlData(node.data)) {\n const title = node.data.title || 'result';\n const res = current.canvas.sqlResults[nodeId];\n tableToDrop =\n res && res.status === 'success'\n ? res.tableName\n : `${CANVAS_SCHEMA_NAME}.${escapeId(title)}`;\n }\n\n set((state) =>\n produce(state, (draft) => {\n draft.config.canvas.nodes = draft.config.canvas.nodes.filter(\n (n) => n.id !== nodeId,\n );\n draft.config.canvas.edges = draft.config.canvas.edges.filter(\n (e) => e.source !== nodeId && e.target !== nodeId,\n );\n // Clear stored result for the node\n delete draft.canvas.sqlResults[nodeId];\n if (draft.config.canvas.nodes.length === 0) {\n draft.config.canvas.viewport.x = 0;\n draft.config.canvas.viewport.y = 0;\n }\n }),\n );\n\n if (tableToDrop) {\n (async () => {\n try {\n const connector = await get().db.getConnector();\n await connector.query(`DROP TABLE IF EXISTS ${tableToDrop}`);\n await get().db.refreshTableSchemas();\n } catch (e) {\n // eslint-disable-next-line no-console\n console.warn(\n '[canvas.deleteNode] Failed to drop table for node',\n nodeId,\n e,\n );\n }\n })();\n }\n },\n\n applyNodeChanges: (changes) => {\n set((state) =>\n produce(state, (draft) => {\n draft.config.canvas.nodes = applyNodeChanges(\n changes,\n draft.config.canvas.nodes,\n );\n }),\n );\n },\n\n applyEdgeChanges: (changes) => {\n set((state) =>\n produce(state, (draft) => {\n draft.config.canvas.edges = applyEdgeChanges(\n changes,\n draft.config.canvas.edges,\n );\n }),\n );\n },\n\n setViewport: (viewport) => {\n set((state) =>\n produce(state, (draft) => {\n draft.config.canvas.viewport = viewport;\n }),\n );\n },\n\n executeSqlNodeQuery: async (\n nodeId: string,\n opts?: {cascade?: boolean},\n ) => {\n const node = findNodeById(get().config.canvas.nodes, nodeId);\n if (!node || !isSqlData(node.data)) return;\n const sql = node.data.sql || '';\n const title = node.data.title || 'result';\n\n set((state) =>\n produce(state, (draft) => {\n draft.canvas.sqlResults[nodeId] = {status: 'loading'};\n }),\n );\n\n try {\n // Validate it's a single select\n const parsed = await get().db.sqlSelectToJson(sql);\n if (parsed.error) {\n throw new Error(\n parsed.error_message || 'Not a valid SELECT statement',\n );\n }\n\n // Create schema and table\n const connector = await get().db.getConnector();\n await connector.query(\n `CREATE SCHEMA IF NOT EXISTS ${CANVAS_SCHEMA_NAME}`,\n );\n\n const tableName = `${CANVAS_SCHEMA_NAME}.${escapeId(title)}`;\n await connector.query(\n `CREATE OR REPLACE TABLE ${tableName} AS ${sql}`,\n );\n\n set((state) =>\n produce(state, (draft) => {\n draft.canvas.sqlResults[nodeId] = {\n status: 'success',\n tableName,\n lastQueryStatement: sql,\n };\n }),\n );\n\n // Cascade execution to downstream SQL nodes (topologically) unless disabled\n if (opts?.cascade !== false) {\n await get().canvas.executeDownstreamFrom(nodeId);\n }\n } catch (e) {\n const message = e instanceof Error ? e.message : String(e);\n set((state) =>\n produce(state, (draft) => {\n draft.canvas.sqlResults[nodeId] = {\n status: 'error',\n error: message,\n };\n }),\n );\n }\n },\n },\n }));\n}\n\n// Types to integrate with room-shell selector\nexport type RoomConfigWithCanvas = BaseRoomConfig & CanvasSliceConfig;\nexport type RoomShellSliceStateWithCanvas =\n RoomShellSliceState<RoomConfigWithCanvas> & CanvasSliceState;\n\nexport function useStoreWithCanvas<T>(\n selector: (state: RoomShellSliceStateWithCanvas) => T,\n): T {\n return useBaseRoomShellStore<\n BaseRoomConfig & CanvasSliceConfig,\n RoomShellSliceState<RoomConfigWithCanvas>,\n T\n >((state) => selector(state as unknown as RoomShellSliceStateWithCanvas));\n}\n"]}
package/dist/dag.d.ts ADDED
@@ -0,0 +1,53 @@
1
+ /** A minimal graph node with an `id`. */
2
+ export type DagNode = {
3
+ id: string;
4
+ };
5
+ /** A directed edge from `source` to `target`. */
6
+ export type DagEdge = {
7
+ source: string;
8
+ target: string;
9
+ };
10
+ /** Forward adjacency list mapping node id to its child node ids. */
11
+ export type Adjacency = Record<string, string[]>;
12
+ /**
13
+ * Build a forward adjacency list for a directed graph.
14
+ * Ensures that every node id exists in the adjacency map, even if it has no outgoing edges.
15
+ *
16
+ * @param nodes - The set of nodes to include in the graph.
17
+ * @param edges - Directed edges where `source` points to `target`.
18
+ * @returns A mapping from node id to an array of child node ids.
19
+ */
20
+ export declare function buildAdjacency(nodes: DagNode[], edges: DagEdge[]): Adjacency;
21
+ /**
22
+ * Find a node by id in a list of nodes.
23
+ *
24
+ * @param nodes - Array of nodes with an `id` field.
25
+ * @param id - The node id to find.
26
+ * @returns The node if found, otherwise undefined.
27
+ */
28
+ export declare function findNodeById<T extends {
29
+ id: string;
30
+ }>(nodes: T[], id: string): T | undefined;
31
+ /**
32
+ * Topologically sort all nodes in the graph using Kahn's algorithm.
33
+ * If a cycle is detected, the remaining nodes are appended in arbitrary order,
34
+ * and a warning is logged.
35
+ *
36
+ * @param nodes - The set of nodes to sort.
37
+ * @param edges - Directed edges defining dependencies.
38
+ * @returns An array of node ids in dependency order (parents before children).
39
+ */
40
+ export declare function topoSortAll(nodes: DagNode[], edges: DagEdge[]): string[];
41
+ /**
42
+ * Get a topological order for the downstream subgraph reachable from `startId`.
43
+ * Only nodes reachable from the start are included (the starting node is excluded).
44
+ * If a cycle exists within the reachable subgraph, the remaining nodes are appended
45
+ * at the end in arbitrary order and a warning is logged.
46
+ *
47
+ * @param startId - The node id to start traversal from.
48
+ * @param nodes - The set of nodes in the full graph.
49
+ * @param edges - Directed edges defining the full graph dependencies.
50
+ * @returns Node ids reachable from `startId`, in dependency order.
51
+ */
52
+ export declare function topoSortDownstream(startId: string, nodes: DagNode[], edges: DagEdge[]): string[];
53
+ //# sourceMappingURL=dag.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../src/dag.ts"],"names":[],"mappings":"AAAA,yCAAyC;AACzC,MAAM,MAAM,OAAO,GAAG;IAAC,EAAE,EAAE,MAAM,CAAA;CAAC,CAAC;AACnC,iDAAiD;AACjD,MAAM,MAAM,OAAO,GAAG;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAC,CAAC;AACvD,oEAAoE;AACpE,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;AAEjD;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,SAAS,CAQ5E;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,CAAC,SAAS;IAAC,EAAE,EAAE,MAAM,CAAA;CAAC,EACjD,KAAK,EAAE,CAAC,EAAE,EACV,EAAE,EAAE,MAAM,GACT,CAAC,GAAG,SAAS,CAEf;AAED;;;;;;;;GAQG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,MAAM,EAAE,CAkCxE;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,OAAO,EAAE,EAChB,KAAK,EAAE,OAAO,EAAE,GACf,MAAM,EAAE,CA8CV"}
package/dist/dag.js ADDED
@@ -0,0 +1,126 @@
1
+ /**
2
+ * Build a forward adjacency list for a directed graph.
3
+ * Ensures that every node id exists in the adjacency map, even if it has no outgoing edges.
4
+ *
5
+ * @param nodes - The set of nodes to include in the graph.
6
+ * @param edges - Directed edges where `source` points to `target`.
7
+ * @returns A mapping from node id to an array of child node ids.
8
+ */
9
+ export function buildAdjacency(nodes, edges) {
10
+ const adjacency = {};
11
+ for (const n of nodes)
12
+ adjacency[n.id] = [];
13
+ for (const e of edges) {
14
+ const list = adjacency[e.source] || (adjacency[e.source] = []);
15
+ list.push(e.target);
16
+ }
17
+ return adjacency;
18
+ }
19
+ /**
20
+ * Find a node by id in a list of nodes.
21
+ *
22
+ * @param nodes - Array of nodes with an `id` field.
23
+ * @param id - The node id to find.
24
+ * @returns The node if found, otherwise undefined.
25
+ */
26
+ export function findNodeById(nodes, id) {
27
+ return nodes.find((n) => n.id === id);
28
+ }
29
+ /**
30
+ * Topologically sort all nodes in the graph using Kahn's algorithm.
31
+ * If a cycle is detected, the remaining nodes are appended in arbitrary order,
32
+ * and a warning is logged.
33
+ *
34
+ * @param nodes - The set of nodes to sort.
35
+ * @param edges - Directed edges defining dependencies.
36
+ * @returns An array of node ids in dependency order (parents before children).
37
+ */
38
+ export function topoSortAll(nodes, edges) {
39
+ const adjacency = buildAdjacency(nodes, edges);
40
+ const inDegree = {};
41
+ for (const n of nodes)
42
+ inDegree[n.id] = 0;
43
+ for (const e of edges) {
44
+ inDegree[e.target] = (inDegree[e.target] ?? 0) + 1;
45
+ }
46
+ const queue = Object.keys(inDegree).filter((id) => (inDegree[id] ?? 0) === 0);
47
+ const order = [];
48
+ while (queue.length) {
49
+ const cur = queue.shift();
50
+ order.push(cur);
51
+ const neighbors = adjacency[cur] || [];
52
+ for (const nb of neighbors) {
53
+ inDegree[nb] = (inDegree[nb] ?? 0) - 1;
54
+ if (inDegree[nb] === 0)
55
+ queue.push(nb);
56
+ }
57
+ }
58
+ if (order.length < nodes.length) {
59
+ const remaining = nodes
60
+ .map((n) => n.id)
61
+ .filter((id) => !order.includes(id));
62
+ // eslint-disable-next-line no-console
63
+ console.warn('[dag.topoSortAll] Cycle detected; appending remaining nodes arbitrarily:', remaining);
64
+ order.push(...remaining);
65
+ }
66
+ return order;
67
+ }
68
+ /**
69
+ * Get a topological order for the downstream subgraph reachable from `startId`.
70
+ * Only nodes reachable from the start are included (the starting node is excluded).
71
+ * If a cycle exists within the reachable subgraph, the remaining nodes are appended
72
+ * at the end in arbitrary order and a warning is logged.
73
+ *
74
+ * @param startId - The node id to start traversal from.
75
+ * @param nodes - The set of nodes in the full graph.
76
+ * @param edges - Directed edges defining the full graph dependencies.
77
+ * @returns Node ids reachable from `startId`, in dependency order.
78
+ */
79
+ export function topoSortDownstream(startId, nodes, edges) {
80
+ const adjacency = buildAdjacency(nodes, edges);
81
+ // Collect reachable nodes from startId (excluding start)
82
+ const reachable = new Set();
83
+ const queue = [...(adjacency[startId] || [])];
84
+ while (queue.length) {
85
+ const cur = queue.shift();
86
+ if (reachable.has(cur))
87
+ continue;
88
+ reachable.add(cur);
89
+ const neighbors = adjacency[cur] || [];
90
+ for (const nb of neighbors)
91
+ queue.push(nb);
92
+ }
93
+ if (reachable.size === 0)
94
+ return [];
95
+ // Kahn's algorithm for topological sort within subgraph
96
+ const inDegree = {};
97
+ for (const id of reachable)
98
+ inDegree[id] = 0;
99
+ for (const e of edges) {
100
+ if (reachable.has(e.source) && reachable.has(e.target)) {
101
+ inDegree[e.target] = (inDegree[e.target] ?? 0) + 1;
102
+ }
103
+ }
104
+ const queue2 = Array.from(reachable).filter((id) => (inDegree[id] ?? 0) === 0);
105
+ const order = [];
106
+ while (queue2.length) {
107
+ const cur = queue2.shift();
108
+ order.push(cur);
109
+ const neighbors = adjacency[cur] || [];
110
+ for (const nb of neighbors) {
111
+ if (!reachable.has(nb))
112
+ continue;
113
+ inDegree[nb] = (inDegree[nb] ?? 0) - 1;
114
+ if (inDegree[nb] === 0)
115
+ queue2.push(nb);
116
+ }
117
+ }
118
+ if (order.length < reachable.size) {
119
+ const remaining = Array.from(reachable).filter((id) => !order.includes(id));
120
+ // eslint-disable-next-line no-console
121
+ console.warn('[dag.topoSortDownstream] Cycle detected in downstream graph:', remaining);
122
+ order.push(...remaining);
123
+ }
124
+ return order;
125
+ }
126
+ //# sourceMappingURL=dag.js.map
@@ -0,0 +1 @@
1
+ {"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,sCAAsC;QACtC,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,sCAAsC;QACtC,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 // eslint-disable-next-line no-console\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 // eslint-disable-next-line no-console\n console.warn(\n '[dag.topoSortDownstream] Cycle detected in downstream graph:',\n remaining,\n );\n order.push(...remaining);\n }\n return order;\n}\n"]}
@@ -0,0 +1,9 @@
1
+ /**
2
+ * {@include ../README.md}
3
+ * @packageDocumentation
4
+ */
5
+ export { createCanvasSlice, createDefaultCanvasConfig } from './CanvasSlice';
6
+ export { CanvasSliceConfig } from './CanvasSlice';
7
+ export type { CanvasSliceState } from './CanvasSlice';
8
+ export { Canvas } from './Canvas';
9
+ //# sourceMappingURL=index.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAC,iBAAiB,EAAE,yBAAyB,EAAC,MAAM,eAAe,CAAC;AAC3E,OAAO,EAAC,iBAAiB,EAAC,MAAM,eAAe,CAAC;AAChD,YAAY,EAAC,gBAAgB,EAAC,MAAM,eAAe,CAAC;AACpD,OAAO,EAAC,MAAM,EAAC,MAAM,UAAU,CAAC"}
package/dist/index.js ADDED
@@ -0,0 +1,8 @@
1
+ /**
2
+ * {@include ../README.md}
3
+ * @packageDocumentation
4
+ */
5
+ export { createCanvasSlice, createDefaultCanvasConfig } from './CanvasSlice';
6
+ export { CanvasSliceConfig } from './CanvasSlice';
7
+ export { Canvas } from './Canvas';
8
+ //# sourceMappingURL=index.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAC,iBAAiB,EAAE,yBAAyB,EAAC,MAAM,eAAe,CAAC;AAC3E,OAAO,EAAC,iBAAiB,EAAC,MAAM,eAAe,CAAC;AAEhD,OAAO,EAAC,MAAM,EAAC,MAAM,UAAU,CAAC","sourcesContent":["/**\n * {@include ../README.md}\n * @packageDocumentation\n */\n\nexport {createCanvasSlice, createDefaultCanvasConfig} from './CanvasSlice';\nexport {CanvasSliceConfig} from './CanvasSlice';\nexport type {CanvasSliceState} from './CanvasSlice';\nexport {Canvas} from './Canvas';\n"]}