Function processNode

src/nodes/code/utils.ts:19–69

(state: GraphState, cache: CodeCache)

 * Uses post-order traversal (children first, then parent)
 */
export async function processNode(state: GraphState, cache: CodeCache): Promise<number> {
    // Read asset files list once for the entire generation run
    const assetFilesList = getAssetFilesList(state);

    // Flatten tree using post-order traversal (children first, then parent)
    const flatNodes = flattenPostOrder(state.protocol!);
    const total = flatNodes.length;

    if (total === 0) {
        logger.printWarnLog('No components found in structure to generate.');
        return 0;
    }

    logger.printInfoLog(`Processing ${total} nodes...`);

    let processedCount = 0;
    let skippedCount = 0;

    const processSingleNode = async (currentNode: Protocol) => {
        const componentName = currentNode.data.name || currentNode.data.componentName || 'UnknownComponent';
        const nodeId = currentNode.id;

        // Check if component is already generated
        if (isComponentGenerated(cache, nodeId)) {
            skippedCount++;
            logger.printInfoLog(`[${processedCount + skippedCount}/${total}] ⏭️  Skipping (cached): ${componentName}`);
            return;
        }

        const progressInfo = `[${++processedCount + skippedCount}/${total}]`;

        const isLeaf = !currentNode.children?.length;
        if (isLeaf) {
            await generateComponent(currentNode, state, assetFilesList, progressInfo);
        } else {
            await generateFrame(currentNode, state, assetFilesList, progressInfo);
        }

        // Mark component as generated and save immediately to prevent cache loss on interruption
        saveComponentGenerated(cache, nodeId, state.workspace);
    };

    // Process nodes with concurrency control
    await promisePool(flatNodes, processSingleNode);

    if (skippedCount > 0) {
        logger.printInfoLog(`⏭️  Skipped ${skippedCount} cached components`);
    }
    logger.printSuccessLog(`Generated ${processedCount} components`);
    return processedCount;
}

/**
 * Flatten tree into array using post-order traversal