flowspec-mcp 2.1.1 → 4.0.0

package/README.md

@@ -2,6 +2,14 @@
 
 MCP (Model Context Protocol) server for [FlowSpec](https://flowspec.app) — exposes project specifications to Claude Code and other MCP-compatible AI tools.
 
+## v4.0.0 - What's New
+
+- **JSON Export** (NEW): `flowspec_get_json` tool for faster parsing (100x) and smaller files (40%)
+- **YAML Export** (Deprecated): `flowspec_get_yaml` still available for backwards compatibility
+- **Performance**: Aligned with FlowSpec v4 normalized schema (8000x faster updates)
+
+**Migration**: Replace `flowspec_get_yaml` with `flowspec_get_json` in your workflows.
+
 ## Quick Start
 
 Add to your `~/.claude.json`:
@@ -53,7 +61,8 @@ Local mode connects to the FlowSpec desktop server at `http://localhost:3456`.
 
 ### Read Tools
 - **`flowspec_list_projects`** — List all projects with names and dates
-- **`flowspec_get_yaml`** — Get full YAML spec for a project (optimised for Claude Code)
+- **`flowspec_get_json`** — Get full JSON spec for a project (v4.0.0+, recommended)
+- **`flowspec_get_yaml`** — Get full YAML spec for a project (deprecated, use get_json)
 - **`flowspec_get_project`** — Get raw canvas_state JSON
 - **`flowspec_search_nodes`** — Search nodes by label across all projects
 - **`flowspec_get_screen_context`** — Get screen/region/element structure

package/dist/analysis/analysisUtils.d.ts

@@ -0,0 +1,36 @@
+import type { CanvasNode, CanvasEdge } from '../types.js';
+export interface NamingViolation {
+    nodeId: string;
+    label: string;
+    issue: 'mixed-case' | 'special-chars' | 'inconsistent-prefix';
+    suggestion: string;
+}
+export interface FuzzyDuplicate {
+    primaryNodeId: string;
+    primaryLabel: string;
+    similarNodes: Array<{
+        nodeId: string;
+        label: string;
+        similarity: number;
+        method: 'levenshtein' | 'cosine';
+    }>;
+}
+export interface SubgraphCluster {
+    clusterIndex: number;
+    nodeIds: string[];
+    nodeLabels: string[];
+    isIsolated: boolean;
+}
+export interface ConsolidationSuggestion {
+    targetLabel: string;
+    nodeIds: string[];
+    reason: 'same-type-and-constraints' | 'duplicate-references';
+    confidence: 'high' | 'medium' | 'low';
+}
+export declare function detectNamingViolations(nodes: CanvasNode[]): NamingViolation[];
+export declare function findFuzzyDuplicates(nodes: CanvasNode[], thresholds?: {
+    levenshtein: number;
+    cosine: number;
+}): FuzzyDuplicate[];
+export declare function detectSubgraphs(nodes: CanvasNode[], edges: CanvasEdge[]): SubgraphCluster[];
+export declare function suggestConsolidations(nodes: CanvasNode[]): ConsolidationSuggestion[];

package/dist/analysis/analysisUtils.js

@@ -0,0 +1,284 @@
+import levenshtein from 'fast-levenshtein';
+import natural from 'natural';
+// ─── Naming Convention Detection ─────────────────────────────────
+const NAMING_RULES = {
+    // Prefer snake_case or kebab-case, flag mixed casing
+    mixedCase: /^[a-z]+([A-Z][a-z]+)+$/, // camelCase
+    specialChars: /[^a-zA-Z0-9_\-\s]/,
+    commonPrefixes: ['user', 'order', 'product', 'payment', 'auth', 'admin', 'cart', 'invoice']
+};
+export function detectNamingViolations(nodes) {
+    const violations = [];
+    const prefixGroups = new Map(); // prefix → [labels]
+    for (const node of nodes) {
+        const label = (node.data?.label ?? '').trim();
+        if (!label)
+            continue;
+        const nodeId = node.id;
+        // Check for mixed casing (camelCase)
+        if (NAMING_RULES.mixedCase.test(label)) {
+            const suggestion = label.replace(/([A-Z])/g, '_$1').toLowerCase();
+            violations.push({
+                nodeId,
+                label,
+                issue: 'mixed-case',
+                suggestion
+            });
+        }
+        // Check for special characters (excluding space, dash, underscore)
+        if (NAMING_RULES.specialChars.test(label)) {
+            const suggestion = label.replace(/[^a-zA-Z0-9_\-\s]/g, '');
+            violations.push({
+                nodeId,
+                label,
+                issue: 'special-chars',
+                suggestion
+            });
+        }
+        // Track prefix usage for consistency analysis
+        const lowerLabel = label.toLowerCase();
+        for (const prefix of NAMING_RULES.commonPrefixes) {
+            if (lowerLabel.startsWith(prefix)) {
+                const group = prefixGroups.get(prefix) ?? [];
+                group.push(label);
+                prefixGroups.set(prefix, group);
+            }
+        }
+    }
+    // Check for inconsistent prefix usage (e.g., user_id vs userId)
+    for (const [prefix, labels] of prefixGroups) {
+        if (labels.length < 2)
+            continue;
+        const hasCamelCase = labels.some((l) => /[A-Z]/.test(l));
+        const hasSnakeCase = labels.some((l) => l.includes('_'));
+        const hasKebabCase = labels.some((l) => l.includes('-'));
+        // If mixed styles exist for same prefix, flag inconsistency
+        const styles = [hasCamelCase, hasSnakeCase, hasKebabCase].filter(Boolean).length;
+        if (styles > 1) {
+            // Find the inconsistent nodes and suggest the most common style
+            const dominantStyle = hasSnakeCase ? 'snake_case' : hasCamelCase ? 'camelCase' : 'kebab-case';
+            for (const node of nodes) {
+                const label = (node.data?.label ?? '').trim();
+                if (!label.toLowerCase().startsWith(prefix))
+                    continue;
+                const isInconsistent = (dominantStyle === 'snake_case' && /[A-Z]/.test(label)) ||
+                    (dominantStyle === 'camelCase' && label.includes('_'));
+                if (isInconsistent) {
+                    const suggestion = dominantStyle === 'snake_case'
+                        ? label.replace(/([A-Z])/g, '_$1').toLowerCase()
+                        : label.replace(/_([a-z])/g, (_, c) => c.toUpperCase());
+                    violations.push({
+                        nodeId: node.id,
+                        label,
+                        issue: 'inconsistent-prefix',
+                        suggestion
+                    });
+                }
+            }
+        }
+    }
+    return violations;
+}
+// ─── Fuzzy Duplicate Detection ──────────────────────────────────
+export function findFuzzyDuplicates(nodes, thresholds = { levenshtein: 2, cosine: 0.85 }) {
+    const duplicates = [];
+    const processed = new Set();
+    // Group nodes by type first to reduce comparisons
+    const nodesByType = new Map();
+    for (const node of nodes) {
+        const nodeType = node.type ?? 'unknown';
+        const group = nodesByType.get(nodeType) ?? [];
+        group.push(node);
+        nodesByType.set(nodeType, group);
+    }
+    // TF-IDF vectorizer for cosine similarity
+    const TfIdf = natural.TfIdf;
+    const tfidf = new TfIdf();
+    // Within each type group, find fuzzy matches
+    for (const [, typeNodes] of nodesByType) {
+        if (typeNodes.length < 2)
+            continue;
+        // Build TF-IDF corpus
+        const labels = typeNodes.map((n) => (n.data?.label ?? '').trim().toLowerCase());
+        for (const label of labels) {
+            if (label)
+                tfidf.addDocument(label);
+        }
+        for (let i = 0; i < typeNodes.length; i++) {
+            const node = typeNodes[i];
+            const label = (node.data?.label ?? '').trim();
+            if (!label || processed.has(node.id))
+                continue;
+            const similarNodes = [];
+            for (let j = i + 1; j < typeNodes.length; j++) {
+                const compareNode = typeNodes[j];
+                const compareLabel = (compareNode.data?.label ?? '').trim();
+                if (!compareLabel || processed.has(compareNode.id))
+                    continue;
+                // Levenshtein distance (edit distance)
+                const distance = levenshtein.get(label.toLowerCase(), compareLabel.toLowerCase());
+                if (distance <= thresholds.levenshtein && distance > 0) {
+                    // Distance 0 = exact match (handled by existing duplicate detection)
+                    similarNodes.push({
+                        nodeId: compareNode.id,
+                        label: compareLabel,
+                        similarity: 1 - distance / Math.max(label.length, compareLabel.length),
+                        method: 'levenshtein'
+                    });
+                }
+                else {
+                    // Cosine similarity (semantic similarity)
+                    tfidf.tfidfs(label.toLowerCase(), (k, measure) => {
+                        if (k === j && measure >= thresholds.cosine) {
+                            similarNodes.push({
+                                nodeId: compareNode.id,
+                                label: compareLabel,
+                                similarity: measure,
+                                method: 'cosine'
+                            });
+                        }
+                    });
+                }
+            }
+            if (similarNodes.length > 0) {
+                duplicates.push({
+                    primaryNodeId: node.id,
+                    primaryLabel: label,
+                    similarNodes: similarNodes.sort((a, b) => b.similarity - a.similarity)
+                });
+                // Mark all as processed
+                processed.add(node.id);
+                for (const sim of similarNodes) {
+                    processed.add(sim.nodeId);
+                }
+            }
+        }
+    }
+    return duplicates;
+}
+// ─── Subgraph Detection (Connected Components) ───────────────────
+export function detectSubgraphs(nodes, edges) {
+    // Build adjacency list
+    const adjacency = new Map();
+    const nodeIds = new Set(nodes.map((n) => n.id));
+    for (const node of nodes) {
+        adjacency.set(node.id, new Set());
+    }
+    for (const edge of edges) {
+        if (nodeIds.has(edge.source) && nodeIds.has(edge.target)) {
+            adjacency.get(edge.source)?.add(edge.target);
+            adjacency.get(edge.target)?.add(edge.source); // Undirected graph
+        }
+    }
+    // BFS to find connected components
+    const visited = new Set();
+    const clusters = [];
+    let clusterIndex = 0;
+    for (const node of nodes) {
+        if (visited.has(node.id))
+            continue;
+        // Start BFS from unvisited node
+        const cluster = [];
+        const queue = [node.id];
+        visited.add(node.id);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            cluster.push(current);
+            const neighbors = adjacency.get(current) ?? new Set();
+            for (const neighbor of neighbors) {
+                if (!visited.has(neighbor)) {
+                    visited.add(neighbor);
+                    queue.push(neighbor);
+                }
+            }
+        }
+        const nodeLabels = cluster
+            .map((id) => {
+            const n = nodes.find((node) => node.id === id);
+            return n?.data?.label ?? 'Untitled';
+        });
+        clusters.push({
+            clusterIndex: clusterIndex++,
+            nodeIds: cluster,
+            nodeLabels,
+            isIsolated: cluster.length < nodes.length / 2 // Heuristic: small clusters are isolated
+        });
+    }
+    // Sort by size (largest first)
+    clusters.sort((a, b) => b.nodeIds.length - a.nodeIds.length);
+    // Mark small clusters as isolated (only if there's a dominant main cluster)
+    if (clusters.length > 1 && clusters[0].nodeIds.length > nodes.length * 0.5) {
+        for (let i = 1; i < clusters.length; i++) {
+            clusters[i].isIsolated = true;
+        }
+    }
+    return clusters;
+}
+// ─── Consolidation Suggestions ───────────────────────────────────
+export function suggestConsolidations(nodes) {
+    const suggestions = [];
+    // Group by node type
+    const nodesByType = new Map();
+    for (const node of nodes) {
+        const nodeType = node.type ?? 'unknown';
+        const group = nodesByType.get(nodeType) ?? [];
+        group.push(node);
+        nodesByType.set(nodeType, group);
+    }
+    // For each type group, find nodes with same constraints
+    for (const [nodeType, typeNodes] of nodesByType) {
+        if (nodeType === 'datapoint') {
+            // Group by data type + constraints
+            const constraintGroups = new Map();
+            for (const node of typeNodes) {
+                const data = node.data;
+                const dataType = data.type ?? 'unknown';
+                const constraints = (data.constraints ?? []).sort().join('|');
+                const key = `${dataType}::${constraints}`;
+                const group = constraintGroups.get(key) ?? [];
+                group.push(node);
+                constraintGroups.set(key, group);
+            }
+            // Suggest consolidation for groups with multiple nodes
+            for (const [key, group] of constraintGroups) {
+                if (group.length > 1) {
+                    const [dataType, constraintsStr] = key.split('::');
+                    const hasConstraints = constraintsStr.length > 0;
+                    suggestions.push({
+                        targetLabel: group.map((n) => n.data?.label ?? '').join(' / '),
+                        nodeIds: group.map((n) => n.id),
+                        reason: 'same-type-and-constraints',
+                        confidence: hasConstraints ? 'high' : 'medium'
+                    });
+                }
+            }
+        }
+        else if (nodeType === 'component') {
+            // Group by displays/captures references
+            const referenceGroups = new Map();
+            for (const node of typeNodes) {
+                const data = node.data;
+                const displays = (data.displays ?? []).sort().join('|');
+                const captures = (data.captures ?? []).sort().join('|');
+                const key = `${displays}::${captures}`;
+                const group = referenceGroups.get(key) ?? [];
+                group.push(node);
+                referenceGroups.set(key, group);
+            }
+            for (const [key, group] of referenceGroups) {
+                if (group.length > 1) {
+                    const [displaysStr, capturesStr] = key.split('::');
+                    const hasReferences = displaysStr.length > 0 || capturesStr.length > 0;
+                    suggestions.push({
+                        targetLabel: group.map((n) => n.data?.label ?? '').join(' / '),
+                        nodeIds: group.map((n) => n.id),
+                        reason: 'duplicate-references',
+                        confidence: hasReferences ? 'medium' : 'low'
+                    });
+                }
+            }
+        }
+    }
+    return suggestions;
+}
+//# sourceMappingURL=analysisUtils.js.map

package/dist/analysis/analysisUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysisUtils.js","sourceRoot":"","sources":["../../src/analysis/analysisUtils.ts"],"names":[],"mappings":"AAAA,OAAO,WAAW,MAAM,kBAAkB,CAAC;AAC3C,OAAO,OAAO,MAAM,SAAS,CAAC;AAqC9B,oEAAoE;AAEpE,MAAM,YAAY,GAAG;IACpB,qDAAqD;IACrD,SAAS,EAAE,wBAAwB,EAAE,YAAY;IACjD,YAAY,EAAE,mBAAmB;IACjC,cAAc,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC;CAC3F,CAAC;AAEF,MAAM,UAAU,sBAAsB,CAAC,KAAmB;IACzD,MAAM,UAAU,GAAsB,EAAE,CAAC;IACzC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,oBAAoB;IAEtE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAE,IAAI,CAAC,IAAI,EAAE,KAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1D,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC;QAEvB,qCAAqC;QACrC,IAAI,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACxC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YAClE,UAAU,CAAC,IAAI,CAAC;gBACf,MAAM;gBACN,KAAK;gBACL,KAAK,EAAE,YAAY;gBACnB,UAAU;aACV,CAAC,CAAC;QACJ,CAAC;QAED,mEAAmE;QACnE,IAAI,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;YAC3D,UAAU,CAAC,IAAI,CAAC;gBACf,MAAM;gBACN,KAAK;gBACL,KAAK,EAAE,eAAe;gBACtB,UAAU;aACV,CAAC,CAAC;QACJ,CAAC;QAED,8CAA8C;QAC9C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC;YAClD,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC7C,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAClB,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACjC,CAAC;QACF,CAAC;IACF,CAAC;IAED,gEAAgE;IAChE,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC7C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAEhC,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAEzD,4DAA4D;QAC5D,MAAM,MAAM,GAAG,CAAC,YAAY,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QACjF,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YAChB,gEAAgE;YAChE,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY,CAAC;YAE9F,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,CAAE,IAAI,CAAC,IAAI,EAAE,KAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC1D,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAEtD,MAAM,cAAc,GACnB,CAAC,aAAa,KAAK,YAAY,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACvD,CAAC,aAAa,KAAK,WAAW,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAExD,IAAI,cAAc,EAAE,CAAC;oBACpB,MAAM,UAAU,GACf,aAAa,KAAK,YAAY;wBAC7B,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE;wBAChD,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;oBAE1D,UAAU,CAAC,IAAI,CAAC;wBACf,MAAM,EAAE,IAAI,CAAC,EAAE;wBACf,KAAK;wBACL,KAAK,EAAE,qBAAqB;wBAC5B,UAAU;qBACV,CAAC,CAAC;gBACJ,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,mEAAmE;AAEnE,MAAM,UAAU,mBAAmB,CAClC,KAAmB,EACnB,UAAU,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE;IAE7C,MAAM,UAAU,GAAqB,EAAE,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,kDAAkD;IAClD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;QACxC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,0CAA0C;IAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;IAE1B,6CAA6C;IAC7C,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,WAAW,EAAE,CAAC;QACzC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAEnC,sBAAsB;QACtB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAE,CAAC,CAAC,IAAI,EAAE,KAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;QAC5F,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC5B,IAAI,KAAK;gBAAE,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,KAAK,GAAG,CAAE,IAAI,CAAC,IAAI,EAAE,KAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAC1D,IAAI,CAAC,KAAK,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAE/C,MAAM,YAAY,GAAmC,EAAE,CAAC;YAExD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,YAAY,GAAG,CAAE,WAAW,CAAC,IAAI,EAAE,KAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;gBACxE,IAAI,CAAC,YAAY,IAAI,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAE7D,uCAAuC;gBACvC,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,YAAY,CAAC,WAAW,EAAE,CAAC,CAAC;gBAClF,IAAI,QAAQ,IAAI,UAAU,CAAC,WAAW,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;oBACxD,qEAAqE;oBACrE,YAAY,CAAC,IAAI,CAAC;wBACjB,MAAM,EAAE,WAAW,CAAC,EAAE;wBACtB,KAAK,EAAE,YAAY;wBACnB,UAAU,EAAE,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC;wBACtE,MAAM,EAAE,aAAa;qBACrB,CAAC,CAAC;gBACJ,CAAC;qBAAM,CAAC;oBACP,0CAA0C;oBAC1C,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE;wBAChD,IAAI,CAAC,KAAK,CAAC,IAAI,OAAO,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;4BAC7C,YAAY,CAAC,IAAI,CAAC;gCACjB,MAAM,EAAE,WAAW,CAAC,EAAE;gCACtB,KAAK,EAAE,YAAY;gCACnB,UAAU,EAAE,OAAO;gCACnB,MAAM,EAAE,QAAQ;6BAChB,CAAC,CAAC;wBACJ,CAAC;oBACF,CAAC,CAAC,CAAC;gBACJ,CAAC;YACF,CAAC;YAED,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,UAAU,CAAC,IAAI,CAAC;oBACf,aAAa,EAAE,IAAI,CAAC,EAAE;oBACtB,YAAY,EAAE,KAAK;oBACnB,YAAY,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;iBACtE,CAAC,CAAC;gBAEH,wBAAwB;gBACxB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;oBAChC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC3B,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,oEAAoE;AAEpE,MAAM,UAAU,eAAe,CAAC,KAAmB,EAAE,KAAmB;IACvE,uBAAuB;IACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1D,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,mBAAmB;QAClE,CAAC;IACF,CAAC;IAED,mCAAmC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAsB,EAAE,CAAC;IACvC,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAEnC,gCAAgC;QAChC,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAErB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEtB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YACtD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC5B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtB,CAAC;YACF,CAAC;QACF,CAAC;QAED,MAAM,UAAU,GAAG,OAAO;aACxB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;YACX,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/C,OAAQ,CAAC,EAAE,IAAI,EAAE,KAAgB,IAAI,UAAU,CAAC;QACjD,CAAC,CAAC,CAAC;QAEJ,QAAQ,CAAC,IAAI,CAAC;YACb,YAAY,EAAE,YAAY,EAAE;YAC5B,OAAO,EAAE,OAAO;YAChB,UAAU;YACV,UAAU,EAAE,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,yCAAyC;SACvF,CAAC,CAAC;IACJ,CAAC;IAED,+BAA+B;IAC/B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAE7D,4EAA4E;IAC5E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC;QAC/B,CAAC;IACF,CAAC;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,oEAAoE;AAEpE,MAAM,UAAU,qBAAqB,CAAC,KAAmB;IACxD,MAAM,WAAW,GAA8B,EAAE,CAAC;IAElD,qBAAqB;IACrB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;QACxC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,wDAAwD;IACxD,KAAK,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,WAAW,EAAE,CAAC;QACjD,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;YAC9B,mCAAmC;YACnC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAwB,CAAC;YAEzD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAiD,CAAC;gBACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;gBACxC,MAAM,WAAW,GAAG,CAAC,IAAI,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC9D,MAAM,GAAG,GAAG,GAAG,QAAQ,KAAK,WAAW,EAAE,CAAC;gBAE1C,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC9C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAClC,CAAC;YAED,uDAAuD;YACvD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,gBAAgB,EAAE,CAAC;gBAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,QAAQ,EAAE,cAAc,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBACnD,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;oBAEjD,WAAW,CAAC,IAAI,CAAC;wBAChB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,IAAI,EAAE,KAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBAC1E,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/B,MAAM,EAAE,2BAA2B;wBACnC,UAAU,EAAE,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ;qBAC9C,CAAC,CAAC;gBACJ,CAAC;YACF,CAAC;QACF,CAAC;aAAM,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;YACrC,wCAAwC;YACxC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAwB,CAAC;YAExD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAoD,CAAC;gBACvE,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACxD,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACxD,MAAM,GAAG,GAAG,GAAG,QAAQ,KAAK,QAAQ,EAAE,CAAC;gBAEvC,MAAM,KAAK,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC7C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,CAAC;YAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,eAAe,EAAE,CAAC;gBAC5C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACtB,MAAM,CAAC,WAAW,EAAE,WAAW,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBACnD,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;oBAEvE,WAAW,CAAC,IAAI,CAAC;wBAChB,WAAW,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAC,CAAC,IAAI,EAAE,KAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;wBAC1E,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/B,MAAM,EAAE,sBAAsB;wBAC9B,UAAU,EAAE,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK;qBAC5C,CAAC,CAAC;gBACJ,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,OAAO,WAAW,CAAC;AACpB,CAAC"}

package/dist/db.d.ts

@@ -45,3 +45,71 @@ export declare function createEdgeViaApi(projectId: string, edge: {
     data: Record<string, unknown>;
 } | null>;
 export declare function deleteEdgeViaApi(projectId: string, edgeId: string): Promise<boolean>;
+export declare function cloneProjectViaApi(projectId: string): Promise<string | null>;
+export declare function uploadImageViaApi(base64Data: string, filename: string, contentType: string): Promise<{
+    url: string;
+    width: number;
+    height: number;
+} | null>;
+export declare function createScreenViaApi(projectId: string, name: string, imageUrl?: string, imageWidth?: number, imageHeight?: number, imageFilename?: string): Promise<{
+    id: string;
+    name: string;
+} | null>;
+export declare function updateScreenViaApi(projectId: string, screenId: string, updates: Partial<{
+    name: string;
+    imageUrl: string;
+    imageWidth: number;
+    imageHeight: number;
+}>): Promise<{
+    id: string;
+    name: string;
+} | null>;
+export declare function deleteScreenViaApi(projectId: string, screenId: string): Promise<boolean>;
+export declare function addRegionViaApi(projectId: string, screenId: string, region: {
+    label?: string;
+    position: {
+        x: number;
+        y: number;
+    };
+    size: {
+        width: number;
+        height: number;
+    };
+    elementIds?: string[];
+    componentNodeId?: string;
+}): Promise<{
+    id: string;
+    label?: string;
+} | null>;
+export declare function updateRegionViaApi(projectId: string, screenId: string, regionId: string, updates: Partial<{
+    label: string;
+    position: {
+        x: number;
+        y: number;
+    };
+    size: {
+        width: number;
+        height: number;
+    };
+    elementIds: string[];
+}>): Promise<{
+    id: string;
+} | null>;
+export declare function removeRegionViaApi(projectId: string, screenId: string, regionId: string): Promise<boolean>;
+export declare function updateEdgeViaApi(projectId: string, edgeId: string, updates: Partial<{
+    type: string;
+    label: string;
+    sourceHandle: string | null;
+    targetHandle: string | null;
+}>): Promise<{
+    id: string;
+} | null>;
+export declare function bulkImportCanvasState(projectId: string, canvasState: {
+    nodes: any[];
+    edges: any[];
+    screens?: any[];
+}, merge: boolean): Promise<{
+    nodeCount: number;
+    edgeCount: number;
+    screenCount: number;
+}>;