figma-preview-mcp 0.2.0

package/dist/ast-module-splitter.d.ts

@@ -0,0 +1,106 @@
+import type { EnrichedAST, EnrichedASTNode } from './ast-enricher.js';
+export interface ExportAsset {
+    nodeId: string;
+    name: string;
+    bounds: {
+        width: number;
+        height: number;
+    };
+    suggestedFormat: 'png' | 'svg' | 'jpg';
+}
+export interface ModuleEntry {
+    index: number;
+    name: string;
+    /** nodeId of the first child in this module group */
+    nodeId: string;
+    file: string;
+    nodeCount: number;
+    childNodeIds: string[];
+    bounds: {
+        y: number;
+        height: number;
+    };
+}
+export interface SkeletonChild {
+    nodeId: string;
+    name: string;
+    type: string;
+    bounds: {
+        x: number;
+        y: number;
+        width: number;
+        height: number;
+    };
+    moduleFile: string;
+}
+export interface ModuleMap {
+    fileKey: string;
+    rootNodeId: string;
+    totalNodes: number;
+    splitThreshold: number;
+    viewport: {
+        width: number;
+        height: number;
+    };
+    skeletonFile: string;
+    modules: ModuleEntry[];
+    exportAssets: ExportAsset[];
+}
+/**
+ * Convert a Figma node name to a kebab-case file-safe string.
+ * e.g. "Hero Section" → "hero-section", "FeatureCards_v2" → "featurecards-v2"
+ */
+export declare function toKebabCase(name: string): string;
+/**
+ * Recursively count all nodes in an EnrichedASTNode subtree.
+ * Graphic subtrees (flags.isGraphicSubtree) are counted as 1 since their
+ * children are already pruned by the enricher.
+ */
+export declare function countSubtreeNodes(node: EnrichedASTNode): number;
+/**
+ * Find the effective split point: if the root has a single child container
+ * whose subtree exceeds the threshold, "unwrap" one level and split its
+ * children instead.  Returns the node whose .children should be grouped.
+ */
+export declare function findSplitTarget(root: EnrichedASTNode, threshold: number): EnrichedASTNode;
+/**
+ * Split root.children into module groups using greedy sequential grouping.
+ *
+ * Algorithm:
+ * - If root has a single large child, "unwrap" to split at the next level
+ * - Iterate children in order
+ * - Accumulate into current group until adding next child would exceed threshold
+ * - A single child whose subtree count > threshold is recursively split into
+ *   sub-modules by diving into its children
+ * - Returns { splitTarget, modules } where splitTarget is the actual node being split
+ */
+export interface SplitResult {
+    splitTarget: EnrichedASTNode;
+    modules: EnrichedASTNode[][];
+}
+export declare function splitIntoModules(root: EnrichedASTNode, threshold: number): SplitResult;
+/**
+ * Build a skeleton AST: root node with full layout but children replaced
+ * by lightweight placeholders that reference their module file.
+ */
+export declare function generateSkeleton(root: EnrichedASTNode, moduleEntries: ModuleEntry[]): Record<string, unknown>;
+/**
+ * Traverse all nodes and collect graphic/image nodes for export.
+ */
+export declare function collectExportAssets(root: EnrichedASTNode): ExportAsset[];
+/**
+ * Build the module-map data structure.
+ */
+export declare function buildModuleMap(ast: EnrichedAST, moduleGroups: EnrichedASTNode[][], exportAssets: ExportAsset[], threshold: number): ModuleMap;
+/**
+ * Split an EnrichedAST into modules and write all files to outputDir.
+ *
+ * Files written:
+ *   - module-map.json
+ *   - skeleton.json
+ *   - module-{index}-{name}.ast.json  (one per module)
+ *
+ * Returns the ModuleMap for the caller to use as tool response.
+ */
+export declare function writeModuleFiles(ast: EnrichedAST, outputDir: string, threshold: number): Promise<ModuleMap>;
+//# sourceMappingURL=ast-module-splitter.d.ts.map

package/dist/ast-module-splitter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-module-splitter.d.ts","sourceRoot":"","sources":["../src/ast-module-splitter.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,eAAe,EAAoB,MAAM,mBAAmB,CAAC;AAIxF,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC1C,eAAe,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC;CACxC;AAED,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,qDAAqD;IACrD,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,MAAM,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;CACvC;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE;QAAE,CAAC,EAAE,MAAM,CAAC;QAAC,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAChE,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,QAAQ,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAC5C,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,WAAW,EAAE,CAAC;IACvB,YAAY,EAAE,WAAW,EAAE,CAAC;CAC7B;AAID;;;GAGG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAQhD;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,eAAe,GAAG,MAAM,CAQ/D;AAID;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,GAAG,eAAe,CAYzF;AAED;;;;;;;;;;GAUG;AACH,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,eAAe,CAAC;IAC7B,OAAO,EAAE,eAAe,EAAE,EAAE,CAAC;CAC9B;AA0DD,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,eAAe,EACrB,SAAS,EAAE,MAAM,GAChB,WAAW,CA0Cb;AAID;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,eAAe,EACrB,aAAa,EAAE,WAAW,EAAE,GAC3B,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CA0BzB;AAID;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,eAAe,GAAG,WAAW,EAAE,CAuBxE;AAcD;;GAEG;AACH,wBAAgB,cAAc,CAC5B,GAAG,EAAE,WAAW,EAChB,YAAY,EAAE,eAAe,EAAE,EAAE,EACjC,YAAY,EAAE,WAAW,EAAE,EAC3B,SAAS,EAAE,MAAM,GAChB,SAAS,CAgCX;AA8BD;;;;;;;;;GASG;AACH,wBAAsB,gBAAgB,CACpC,GAAG,EAAE,WAAW,EAChB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC,SAAS,CAAC,CAwEpB"}

package/dist/ast-module-splitter.js

@@ -0,0 +1,325 @@
+import fs from 'fs';
+import path from 'path';
+// ─── Helpers ────────────────────────────────────────────────────────────────
+/**
+ * Convert a Figma node name to a kebab-case file-safe string.
+ * e.g. "Hero Section" → "hero-section", "FeatureCards_v2" → "featurecards-v2"
+ */
+export function toKebabCase(name) {
+    return name
+        .replace(/([a-z])([A-Z])/g, '$1-$2') // camelCase → camel-Case
+        .replace(/[\s_/\\]+/g, '-') // whitespace/underscores/slashes → dash
+        .replace(/[^a-zA-Z0-9-]/g, '') // strip non-alphanumeric
+        .replace(/-+/g, '-') // collapse multiple dashes
+        .replace(/^-|-$/g, '') // trim leading/trailing dashes
+        .toLowerCase();
+}
+/**
+ * Recursively count all nodes in an EnrichedASTNode subtree.
+ * Graphic subtrees (flags.isGraphicSubtree) are counted as 1 since their
+ * children are already pruned by the enricher.
+ */
+export function countSubtreeNodes(node) {
+    let count = 1;
+    if (node.children) {
+        for (const child of node.children) {
+            count += countSubtreeNodes(child);
+        }
+    }
+    return count;
+}
+// ─── Core Splitting Algorithm ───────────────────────────────────────────────
+/**
+ * Find the effective split point: if the root has a single child container
+ * whose subtree exceeds the threshold, "unwrap" one level and split its
+ * children instead.  Returns the node whose .children should be grouped.
+ */
+export function findSplitTarget(root, threshold) {
+    let target = root;
+    while (target.children &&
+        target.children.length === 1 &&
+        countSubtreeNodes(target.children[0]) > threshold &&
+        target.children[0].children &&
+        target.children[0].children.length > 1) {
+        target = target.children[0];
+    }
+    return target;
+}
+/**
+ * Recursively split a single oversized node into smaller groups.
+ * Dives into its children until groups fit within the threshold.
+ */
+function splitOversizedNode(node, threshold) {
+    // Try to unwrap to find a level with multiple children
+    const target = findSplitTarget(node, threshold);
+    const children = target.children ?? [];
+    // If no children or only one child that can't be further split, return as-is
+    if (children.length <= 1) {
+        return [[node]];
+    }
+    const subModules = [];
+    let currentGroup = [];
+    let currentCount = 0;
+    for (const child of children) {
+        const childCount = countSubtreeNodes(child);
+        if (childCount > threshold) {
+            // Flush current group first
+            if (currentGroup.length > 0) {
+                subModules.push(currentGroup);
+                currentGroup = [];
+                currentCount = 0;
+            }
+            // Recursively split this oversized child
+            const deeperModules = splitOversizedNode(child, threshold);
+            subModules.push(...deeperModules);
+        }
+        else if (currentCount + childCount > threshold) {
+            // Adding this child would exceed threshold: flush and start new group
+            if (currentGroup.length > 0) {
+                subModules.push(currentGroup);
+            }
+            currentGroup = [child];
+            currentCount = childCount;
+        }
+        else {
+            // Fits in current group
+            currentGroup.push(child);
+            currentCount += childCount;
+        }
+    }
+    // Flush remaining
+    if (currentGroup.length > 0) {
+        subModules.push(currentGroup);
+    }
+    return subModules;
+}
+export function splitIntoModules(root, threshold) {
+    const splitTarget = findSplitTarget(root, threshold);
+    const children = splitTarget.children ?? [];
+    if (children.length === 0)
+        return { splitTarget, modules: [[]] };
+    const modules = [];
+    let currentGroup = [];
+    let currentCount = 0;
+    for (const child of children) {
+        const childCount = countSubtreeNodes(child);
+        if (childCount > threshold) {
+            // Flush current group first
+            if (currentGroup.length > 0) {
+                modules.push(currentGroup);
+                currentGroup = [];
+                currentCount = 0;
+            }
+            // Recursively split this oversized child into sub-modules
+            const subModules = splitOversizedNode(child, threshold);
+            modules.push(...subModules);
+        }
+        else if (currentCount + childCount > threshold) {
+            // Adding this child would exceed threshold: flush and start new group
+            if (currentGroup.length > 0) {
+                modules.push(currentGroup);
+            }
+            currentGroup = [child];
+            currentCount = childCount;
+        }
+        else {
+            // Fits in current group
+            currentGroup.push(child);
+            currentCount += childCount;
+        }
+    }
+    // Flush remaining
+    if (currentGroup.length > 0) {
+        modules.push(currentGroup);
+    }
+    return { splitTarget, modules };
+}
+// ─── Skeleton Generation ────────────────────────────────────────────────────
+/**
+ * Build a skeleton AST: root node with full layout but children replaced
+ * by lightweight placeholders that reference their module file.
+ */
+export function generateSkeleton(root, moduleEntries) {
+    // Build a map from childNodeId → moduleFile for quick lookup
+    const childToModuleFile = new Map();
+    for (const mod of moduleEntries) {
+        for (const childId of mod.childNodeIds) {
+            childToModuleFile.set(childId, mod.file);
+        }
+    }
+    const placeholderChildren = (root.children ?? []).map(child => ({
+        nodeId: child.nodeId,
+        name: child.name,
+        type: child.type,
+        bounds: { ...child.bounds },
+        moduleFile: childToModuleFile.get(child.nodeId) ?? 'unknown',
+    }));
+    return {
+        nodeId: root.nodeId,
+        name: root.name,
+        type: root.type,
+        bounds: { ...root.bounds },
+        layout: { ...root.layout },
+        ...(root.style ? { style: { ...root.style } } : {}),
+        children: placeholderChildren,
+    };
+}
+// ─── Export Asset Collection ────────────────────────────────────────────────
+/**
+ * Traverse all nodes and collect graphic/image nodes for export.
+ */
+export function collectExportAssets(root) {
+    const assets = [];
+    const seenIds = new Set();
+    function walk(node) {
+        if ((node.flags?.isGraphicSubtree || node.image) && !seenIds.has(node.nodeId)) {
+            seenIds.add(node.nodeId);
+            assets.push({
+                nodeId: node.nodeId,
+                name: node.name,
+                bounds: { width: node.bounds.width, height: node.bounds.height },
+                suggestedFormat: node.image?.suggestedFormat ?? 'svg',
+            });
+        }
+        if (node.children) {
+            for (const child of node.children) {
+                walk(child);
+            }
+        }
+    }
+    walk(root);
+    return assets;
+}
+// ─── Module Map Builder ─────────────────────────────────────────────────────
+/**
+ * Compute the combined bounds (y, height) of a group of children.
+ */
+function computeGroupBounds(children) {
+    if (children.length === 0)
+        return { y: 0, height: 0 };
+    const minY = Math.min(...children.map(c => c.bounds.y));
+    const maxBottom = Math.max(...children.map(c => c.bounds.y + c.bounds.height));
+    return { y: minY, height: maxBottom - minY };
+}
+/**
+ * Build the module-map data structure.
+ */
+export function buildModuleMap(ast, moduleGroups, exportAssets, threshold) {
+    const moduleEntries = moduleGroups.map((group, index) => {
+        const firstName = group[0]?.name ?? `module-${index}`;
+        const kebabName = toKebabCase(firstName);
+        const fileName = `module-${index}-${kebabName}.ast.json`;
+        let nodeCount = 0;
+        for (const child of group) {
+            nodeCount += countSubtreeNodes(child);
+        }
+        return {
+            index,
+            name: firstName,
+            nodeId: group[0]?.nodeId ?? '',
+            file: fileName,
+            nodeCount,
+            childNodeIds: group.map(c => c.nodeId),
+            bounds: computeGroupBounds(group),
+        };
+    });
+    return {
+        fileKey: ast.fileKey,
+        rootNodeId: ast.rootNodeId,
+        totalNodes: ast.stats.totalNodes,
+        splitThreshold: threshold,
+        viewport: { ...ast.viewport },
+        skeletonFile: 'skeleton.json',
+        modules: moduleEntries,
+        exportAssets,
+    };
+}
+// ─── Build stats for a sub-AST ──────────────────────────────────────────────
+function buildSubStats(nodes) {
+    const stats = {
+        totalNodes: 0,
+        figmaLayoutNodes: 0,
+        inferredLayoutNodes: 0,
+        absoluteNodes: 0,
+        needsDetailFetch: 0,
+    };
+    function walk(node) {
+        stats.totalNodes++;
+        if (node.layout.source === 'figma')
+            stats.figmaLayoutNodes++;
+        else if (node.layout.source === 'inferred')
+            stats.inferredLayoutNodes++;
+        else if (node.layout.source === 'absolute')
+            stats.absoluteNodes++;
+        if (node.flags?.needsDetailFetch)
+            stats.needsDetailFetch++;
+        if (node.children)
+            node.children.forEach(walk);
+    }
+    for (const node of nodes) {
+        walk(node);
+    }
+    return stats;
+}
+// ─── File Writing (Main Entry Point) ────────────────────────────────────────
+/**
+ * Split an EnrichedAST into modules and write all files to outputDir.
+ *
+ * Files written:
+ *   - module-map.json
+ *   - skeleton.json
+ *   - module-{index}-{name}.ast.json  (one per module)
+ *
+ * Returns the ModuleMap for the caller to use as tool response.
+ */
+export async function writeModuleFiles(ast, outputDir, threshold) {
+    // 1. Split into module groups (may unwrap single-child containers)
+    const { splitTarget, modules: moduleGroups } = splitIntoModules(ast.root, threshold);
+    // 2. Collect export assets (from full tree)
+    const exportAssets = collectExportAssets(ast.root);
+    // 3. Build module map (using splitTarget as the effective root)
+    const moduleMap = buildModuleMap(ast, moduleGroups, exportAssets, threshold);
+    // 4. Generate skeleton from splitTarget (the node whose children are split)
+    const skeleton = generateSkeleton(splitTarget, moduleMap.modules);
+    // 5. Create output directory
+    await fs.promises.mkdir(outputDir, { recursive: true });
+    // 6. Write module-map.json
+    await fs.promises.writeFile(path.join(outputDir, 'module-map.json'), JSON.stringify(moduleMap, null, 2), 'utf-8');
+    // 7. Write skeleton.json
+    await fs.promises.writeFile(path.join(outputDir, 'skeleton.json'), JSON.stringify(skeleton, null, 2), 'utf-8');
+    // 8. Write each module AST file
+    for (let i = 0; i < moduleGroups.length; i++) {
+        const group = moduleGroups[i];
+        const entry = moduleMap.modules[i];
+        const stats = buildSubStats(group);
+        // Build a synthetic root node that wraps this module's children
+        // Use the splitTarget's layout for the synthetic wrapper
+        const syntheticRoot = {
+            nodeId: splitTarget.nodeId,
+            name: `${splitTarget.name} [module-${i}]`,
+            type: splitTarget.type,
+            bounds: {
+                x: splitTarget.bounds.x,
+                y: entry.bounds.y,
+                width: splitTarget.bounds.width,
+                height: entry.bounds.height,
+            },
+            layout: { ...splitTarget.layout },
+            children: group,
+        };
+        const moduleAst = {
+            version: '1.0',
+            fileKey: ast.fileKey,
+            rootNodeId: ast.rootNodeId,
+            viewport: {
+                width: ast.viewport.width,
+                height: entry.bounds.height,
+            },
+            stats,
+            root: syntheticRoot,
+        };
+        await fs.promises.writeFile(path.join(outputDir, entry.file), JSON.stringify(moduleAst, null, 2), 'utf-8');
+    }
+    return moduleMap;
+}
+//# sourceMappingURL=ast-module-splitter.js.map

package/dist/ast-module-splitter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-module-splitter.js","sourceRoot":"","sources":["../src/ast-module-splitter.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,IAAI,MAAM,MAAM,CAAC;AA0CxB,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY;IACtC,OAAO,IAAI;SACR,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAG,yBAAyB;SAC/D,OAAO,CAAC,YAAY,EAAE,GAAG,CAAC,CAAc,wCAAwC;SAChF,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAW,yBAAyB;SACjE,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAqB,2BAA2B;SACnE,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAmB,+BAA+B;SACvE,WAAW,EAAE,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAqB;IACrD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,KAAK,IAAI,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAqB,EAAE,SAAiB;IACtE,IAAI,MAAM,GAAG,IAAI,CAAC;IAClB,OACE,MAAM,CAAC,QAAQ;QACf,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;QAC5B,iBAAiB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS;QACjD,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ;QAC3B,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EACtC,CAAC;QACD,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAkBD;;;GAGG;AACH,SAAS,kBAAkB,CACzB,IAAqB,EACrB,SAAiB;IAEjB,uDAAuD;IACvD,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAChD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;IAEvC,6EAA6E;IAC7E,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,UAAU,GAAwB,EAAE,CAAC;IAC3C,IAAI,YAAY,GAAsB,EAAE,CAAC;IACzC,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC3B,4BAA4B;YAC5B,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC9B,YAAY,GAAG,EAAE,CAAC;gBAClB,YAAY,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,yCAAyC;YACzC,MAAM,aAAa,GAAG,kBAAkB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YAC3D,UAAU,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QACpC,CAAC;aAAM,IAAI,YAAY,GAAG,UAAU,GAAG,SAAS,EAAE,CAAC;YACjD,sEAAsE;YACtE,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAChC,CAAC;YACD,YAAY,GAAG,CAAC,KAAK,CAAC,CAAC;YACvB,YAAY,GAAG,UAAU,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,YAAY,IAAI,UAAU,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC9B,IAAqB,EACrB,SAAiB;IAEjB,MAAM,WAAW,GAAG,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACrD,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,IAAI,EAAE,CAAC;IAC5C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;IAEjE,MAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,IAAI,YAAY,GAAsB,EAAE,CAAC;IACzC,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE5C,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC3B,4BAA4B;YAC5B,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC3B,YAAY,GAAG,EAAE,CAAC;gBAClB,YAAY,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,0DAA0D;YAC1D,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACxD,OAAO,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;QAC9B,CAAC;aAAM,IAAI,YAAY,GAAG,UAAU,GAAG,SAAS,EAAE,CAAC;YACjD,sEAAsE;YACtE,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7B,CAAC;YACD,YAAY,GAAG,CAAC,KAAK,CAAC,CAAC;YACvB,YAAY,GAAG,UAAU,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,wBAAwB;YACxB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,YAAY,IAAI,UAAU,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AAClC,CAAC;AAED,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAqB,EACrB,aAA4B;IAE5B,6DAA6D;IAC7D,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpD,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,KAAK,MAAM,OAAO,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC;YACvC,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,MAAM,mBAAmB,GAAoB,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,MAAM,EAAE,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE;QAC3B,UAAU,EAAE,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,SAAS;KAC7D,CAAC,CAAC,CAAC;IAEJ,OAAO;QACL,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE;QAC1B,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE;QAC1B,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnD,QAAQ,EAAE,mBAAmB;KAC9B,CAAC;AACJ,CAAC;AAED,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAqB;IACvD,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,SAAS,IAAI,CAAC,IAAqB;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9E,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC;gBACV,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;gBAChE,eAAe,EAAE,IAAI,CAAC,KAAK,EAAE,eAAe,IAAI,KAAK;aACtD,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,CAAC,KAAK,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAE/E;;GAEG;AACH,SAAS,kBAAkB,CAAC,QAA2B;IACrD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACtD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/E,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,EAAE,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,GAAgB,EAChB,YAAiC,EACjC,YAA2B,EAC3B,SAAiB;IAEjB,MAAM,aAAa,GAAkB,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;QACrE,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,UAAU,KAAK,EAAE,CAAC;QACtD,MAAM,SAAS,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC;QACzC,MAAM,QAAQ,GAAG,UAAU,KAAK,IAAI,SAAS,WAAW,CAAC;QAEzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,SAAS,IAAI,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;QAED,OAAO;YACL,KAAK;YACL,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE;YAC9B,IAAI,EAAE,QAAQ;YACd,SAAS;YACT,YAAY,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;YACtC,MAAM,EAAE,kBAAkB,CAAC,KAAK,CAAC;SAClC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,UAAU,EAAE,GAAG,CAAC,KAAK,CAAC,UAAU;QAChC,cAAc,EAAE,SAAS;QACzB,QAAQ,EAAE,EAAE,GAAG,GAAG,CAAC,QAAQ,EAAE;QAC7B,YAAY,EAAE,eAAe;QAC7B,OAAO,EAAE,aAAa;QACtB,YAAY;KACb,CAAC;AACJ,CAAC;AAED,+EAA+E;AAE/E,SAAS,aAAa,CAAC,KAAwB;IAC7C,MAAM,KAAK,GAAqB;QAC9B,UAAU,EAAE,CAAC;QACb,gBAAgB,EAAE,CAAC;QACnB,mBAAmB,EAAE,CAAC;QACtB,aAAa,EAAE,CAAC;QAChB,gBAAgB,EAAE,CAAC;KACpB,CAAC;IAEF,SAAS,IAAI,CAAC,IAAqB;QACjC,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,OAAO;YAAE,KAAK,CAAC,gBAAgB,EAAE,CAAC;aACxD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU;YAAE,KAAK,CAAC,mBAAmB,EAAE,CAAC;aACnE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU;YAAE,KAAK,CAAC,aAAa,EAAE,CAAC;QAClE,IAAI,IAAI,CAAC,KAAK,EAAE,gBAAgB;YAAE,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+EAA+E;AAE/E;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,GAAgB,EAChB,SAAiB,EACjB,SAAiB;IAEjB,mEAAmE;IACnE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAErF,4CAA4C;IAC5C,MAAM,YAAY,GAAG,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAEnD,gEAAgE;IAChE,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IAE7E,4EAA4E;IAC5E,MAAM,QAAQ,GAAG,gBAAgB,CAAC,WAAW,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;IAElE,6BAA6B;IAC7B,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAExD,2BAA2B;IAC3B,MAAM,EAAE,CAAC,QAAQ,CAAC,SAAS,CACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,iBAAiB,CAAC,EACvC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,EAClC,OAAO,CACR,CAAC;IAEF,yBAAyB;IACzB,MAAM,EAAE,CAAC,QAAQ,CAAC,SAAS,CACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,eAAe,CAAC,EACrC,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,EACjC,OAAO,CACR,CAAC;IAEF,gCAAgC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;QAEnC,gEAAgE;QAChE,yDAAyD;QACzD,MAAM,aAAa,GAAoB;YACrC,MAAM,EAAE,WAAW,CAAC,MAAM;YAC1B,IAAI,EAAE,GAAG,WAAW,CAAC,IAAI,YAAY,CAAC,GAAG;YACzC,IAAI,EAAE,WAAW,CAAC,IAAI;YACtB,MAAM,EAAE;gBACN,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;gBACvB,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBACjB,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK;gBAC/B,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM;aAC5B;YACD,MAAM,EAAE,EAAE,GAAG,WAAW,CAAC,MAAM,EAAE;YACjC,QAAQ,EAAE,KAAK;SAChB,CAAC;QAEF,MAAM,SAAS,GAAgB;YAC7B,OAAO,EAAE,KAAK;YACd,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,QAAQ,EAAE;gBACR,KAAK,EAAE,GAAG,CAAC,QAAQ,CAAC,KAAK;gBACzB,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM;aAC5B;YACD,KAAK;YACL,IAAI,EAAE,aAAa;SACpB,CAAC;QAEF,MAAM,EAAE,CAAC,QAAQ,CAAC,SAAS,CACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,EAChC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,EAClC,OAAO,CACR,CAAC;IACJ,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/bounds-cache.d.ts

@@ -0,0 +1,48 @@
+import type { ParsedFigmaData } from './parser.js';
+/**
+ * Bounds data for a single node, relative to the root node origin.
+ */
+export interface NodeBounds {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+}
+/**
+ * Metadata for a single node used in diagnostic context.
+ */
+export interface NodeMeta {
+    name: string;
+    type: string;
+    parentId: string | null;
+}
+/**
+ * Cached layout bounds data produced by render_preview,
+ * consumed by generate_layout_ast and verify_layout_bounds.
+ */
+export interface LayoutBoundsCache {
+    fileKey: string;
+    rootNodeId: string;
+    rootWidth: number;
+    rootHeight: number;
+    /** nodeId → absolute bounds relative to root node */
+    bounds: Map<string, NodeBounds>;
+    /** nodeId → node metadata (name, type, parentId) */
+    nodeInfo: Map<string, NodeMeta>;
+    /** The full parsed node tree (for AST enrichment) */
+    nodeTree: ParsedFigmaData;
+}
+/**
+ * Build and store a LayoutBoundsCache from a fully processed nodeTree
+ * (after injectBounds has been called).
+ */
+export declare function buildBoundsCache(nodeTree: ParsedFigmaData, fileKey: string, rootNodeId: string): LayoutBoundsCache;
+/**
+ * Retrieve a cached LayoutBoundsCache, or null if not found.
+ */
+export declare function getBoundsCache(fileKey: string, rootNodeId: string): LayoutBoundsCache | null;
+/**
+ * Manually set a LayoutBoundsCache entry (e.g. for testing).
+ */
+export declare function setBoundsCache(entry: LayoutBoundsCache): void;
+//# sourceMappingURL=bounds-cache.d.ts.map

package/dist/bounds-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounds-cache.d.ts","sourceRoot":"","sources":["../src/bounds-cache.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAa,eAAe,EAAE,MAAM,aAAa,CAAC;AAE9D;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,qDAAqD;IACrD,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAChC,oDAAoD;IACpD,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAChC,qDAAqD;IACrD,QAAQ,EAAE,eAAe,CAAC;CAC3B;AAWD;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,eAAe,EACzB,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,MAAM,GACjB,iBAAiB,CAqDnB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI,CAG5F;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,iBAAiB,GAAG,IAAI,CAG7D"}

package/dist/bounds-cache.js

@@ -0,0 +1,71 @@
+// Process-level singleton cache: cacheKey → LayoutBoundsCache
+const cache = new Map();
+function cacheKey(fileKey, rootNodeId) {
+    // Normalize ID format (colons)
+    const normalizedId = rootNodeId.replace(/-/g, ':');
+    return `${fileKey}:${normalizedId}`;
+}
+/**
+ * Build and store a LayoutBoundsCache from a fully processed nodeTree
+ * (after injectBounds has been called).
+ */
+export function buildBoundsCache(nodeTree, fileKey, rootNodeId) {
+    const bounds = new Map();
+    const nodeInfo = new Map();
+    const rootNode = nodeTree.nodes[0];
+    const rootWidth = rootNode?.layout?.width ?? 0;
+    const rootHeight = rootNode?.layout?.height ?? 0;
+    function walk(node, parentId) {
+        const id = node.id;
+        // Store bounds (use _absX/_absY if available, fall back to layout x/y)
+        bounds.set(id, {
+            x: node._absX ?? node.layout?.x ?? 0,
+            y: node._absY ?? node.layout?.y ?? 0,
+            width: node.layout?.width ?? 0,
+            height: node.layout?.height ?? 0,
+        });
+        // Store metadata
+        nodeInfo.set(id, {
+            name: node.name,
+            type: node.type,
+            parentId,
+        });
+        // Recurse children
+        if (node.children) {
+            for (const child of node.children) {
+                walk(child, id);
+            }
+        }
+    }
+    for (const rootN of nodeTree.nodes) {
+        walk(rootN, null);
+    }
+    const entry = {
+        fileKey,
+        rootNodeId: rootNodeId.replace(/-/g, ':'),
+        rootWidth,
+        rootHeight,
+        bounds,
+        nodeInfo,
+        nodeTree,
+    };
+    // Store in singleton cache (overwrites existing entry for same key)
+    const key = cacheKey(fileKey, rootNodeId);
+    cache.set(key, entry);
+    return entry;
+}
+/**
+ * Retrieve a cached LayoutBoundsCache, or null if not found.
+ */
+export function getBoundsCache(fileKey, rootNodeId) {
+    const key = cacheKey(fileKey, rootNodeId);
+    return cache.get(key) ?? null;
+}
+/**
+ * Manually set a LayoutBoundsCache entry (e.g. for testing).
+ */
+export function setBoundsCache(entry) {
+    const key = cacheKey(entry.fileKey, entry.rootNodeId);
+    cache.set(key, entry);
+}
+//# sourceMappingURL=bounds-cache.js.map

package/dist/bounds-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounds-cache.js","sourceRoot":"","sources":["../src/bounds-cache.ts"],"names":[],"mappings":"AAsCA,8DAA8D;AAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,EAA6B,CAAC;AAEnD,SAAS,QAAQ,CAAC,OAAe,EAAE,UAAkB;IACnD,+BAA+B;IAC/B,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IACnD,OAAO,GAAG,OAAO,IAAI,YAAY,EAAE,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,QAAyB,EACzB,OAAe,EACf,UAAkB;IAElB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE7C,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnC,MAAM,SAAS,GAAG,QAAQ,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC;IAC/C,MAAM,UAAU,GAAG,QAAQ,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;IAEjD,SAAS,IAAI,CAAC,IAAe,EAAE,QAAuB;QACpD,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QAEnB,uEAAuE;QACvE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;YACb,CAAC,EAAE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;YACpC,CAAC,EAAE,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;YACpC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC;YAC9B,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;SACjC,CAAC,CAAC;QAEH,iBAAiB;QACjB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ;SACT,CAAC,CAAC;QAEH,mBAAmB;QACnB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QACnC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,MAAM,KAAK,GAAsB;QAC/B,OAAO;QACP,UAAU,EAAE,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC;QACzC,SAAS;QACT,UAAU;QACV,MAAM;QACN,QAAQ;QACR,QAAQ;KACT,CAAC;IAEF,oEAAoE;IACpE,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC1C,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAEtB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,OAAe,EAAE,UAAkB;IAChE,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAC1C,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,KAAwB;IACrD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACtD,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACxB,CAAC"}

package/dist/image-downloader.d.ts

@@ -0,0 +1,20 @@
+import type { ParsedFigmaData } from './parser.js';
+export type ImageMap = Map<string, string>;
+/**
+ * Download a PNG screenshot of the given node (usually the root/preview node).
+ * Returns the local file path, or null on failure.
+ * Skips download if the file is already cached.
+ */
+export declare function downloadRootScreenshot(fileKey: string, nodeId: string, token: string): Promise<string | null>;
+/**
+ * Fetch absoluteBoundingBox for all given nodeIds from Figma REST API.
+ * Returns a map of nodeId -> { x, y, width, height } relative to the root node origin.
+ */
+export declare function fetchAbsoluteBounds(fileKey: string, nodeIds: string[], token: string): Promise<Map<string, {
+    x: number;
+    y: number;
+    width: number;
+    height: number;
+}>>;
+export declare function downloadImages(data: ParsedFigmaData, fileKey: string, token: string): Promise<ImageMap>;
+//# sourceMappingURL=image-downloader.d.ts.map

package/dist/image-downloader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"image-downloader.d.ts","sourceRoot":"","sources":["../src/image-downloader.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAa,eAAe,EAAE,MAAM,aAAa,CAAC;AAE9D,MAAM,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAI3C;;;;GAIG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,CA+CxB;AAED;;;GAGG;AACH,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE;IAAE,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC,CAqD/E;AA0FD,wBAAsB,cAAc,CAClC,IAAI,EAAE,eAAe,EACrB,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,QAAQ,CAAC,CAgDnB"}