cotx-engine 0.1.0

package/dist/compiler/delta-detector.js

@@ -0,0 +1,34 @@
+export function detectDelta(store, changedFiles) {
+    const changedSet = new Set(changedFiles);
+    const affectedModules = new Set();
+    const affectedContracts = new Set();
+    const affectedFlows = new Set();
+    // 1. Find affected modules: any module whose files[] overlaps with changedFiles
+    for (const id of store.listModules()) {
+        const mod = store.readModule(id);
+        if (mod.files.some(f => changedSet.has(f))) {
+            affectedModules.add(id);
+        }
+    }
+    // 2. Find affected contracts: provider or consumer is an affected module
+    for (const id of store.listContracts()) {
+        const contract = store.readContract(id);
+        if (affectedModules.has(contract.provider) || affectedModules.has(contract.consumer)) {
+            affectedContracts.add(id);
+        }
+    }
+    // 3. Find affected flows: any step's module is an affected module
+    for (const id of store.listFlows()) {
+        const flow = store.readFlow(id);
+        if (flow.steps?.some(s => affectedModules.has(s.module))) {
+            affectedFlows.add(id);
+        }
+    }
+    return {
+        changedFiles,
+        affectedModules: [...affectedModules].sort(),
+        affectedContracts: [...affectedContracts].sort(),
+        affectedFlows: [...affectedFlows].sort(),
+    };
+}
+//# sourceMappingURL=delta-detector.js.map

package/dist/compiler/delta-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delta-detector.js","sourceRoot":"","sources":["../../src/compiler/delta-detector.ts"],"names":[],"mappings":"AASA,MAAM,UAAU,WAAW,CAAC,KAAgB,EAAE,YAAsB;IAClE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IACzC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IAExC,gFAAgF;IAChF,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC3C,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,aAAa,EAAE,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrF,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YACzD,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,OAAO;QACL,YAAY;QACZ,eAAe,EAAE,CAAC,GAAG,eAAe,CAAC,CAAC,IAAI,EAAE;QAC5C,iBAAiB,EAAE,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,EAAE;QAChD,aAAa,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,IAAI,EAAE;KACzC,CAAC;AACJ,CAAC"}

package/dist/compiler/flow-compiler.d.ts

@@ -0,0 +1,18 @@
+import type { GraphNode, ProcessData } from '../core/export/json-exporter.js';
+import type { ModuleNode, FlowNode } from '../store/schema.js';
+/**
+ * Compile ProcessData[] (from BFS detection) into FlowNode[] records.
+ *
+ * Algorithm:
+ * 1. Build nodeId→moduleId map: for each ModuleNode, expand its files set;
+ *    for each GraphNode, find which module owns its filePath.
+ * 2. Build nodeId→name map from GraphNode properties.
+ * 3. Map each ProcessData → FlowNode:
+ *    - id: process ID as-is
+ *    - type: 'flow'
+ *    - trigger: entryPointId resolved to function name (or "unknown")
+ *    - steps: sorted by step number, each resolved to { module, function }
+ *    - struct_hash: over { id, trigger, steps: [{module, function}] }
+ * 4. Return FlowNode[] sorted alphabetically by id.
+ */
+export declare function compileFlows(processes: ProcessData[], nodes: GraphNode[], modules: ModuleNode[]): FlowNode[];

package/dist/compiler/flow-compiler.js

@@ -0,0 +1,69 @@
+import { structHash } from '../lib/hash.js';
+/**
+ * Compile ProcessData[] (from BFS detection) into FlowNode[] records.
+ *
+ * Algorithm:
+ * 1. Build nodeId→moduleId map: for each ModuleNode, expand its files set;
+ *    for each GraphNode, find which module owns its filePath.
+ * 2. Build nodeId→name map from GraphNode properties.
+ * 3. Map each ProcessData → FlowNode:
+ *    - id: process ID as-is
+ *    - type: 'flow'
+ *    - trigger: entryPointId resolved to function name (or "unknown")
+ *    - steps: sorted by step number, each resolved to { module, function }
+ *    - struct_hash: over { id, trigger, steps: [{module, function}] }
+ * 4. Return FlowNode[] sorted alphabetically by id.
+ */
+export function compileFlows(processes, nodes, modules) {
+    // Step 1: build nodeId → moduleId map via ModuleNode file sets
+    const fileToModule = new Map();
+    for (const mod of modules) {
+        for (const file of mod.files) {
+            fileToModule.set(file, mod.id);
+        }
+    }
+    const nodeToModule = new Map();
+    for (const node of nodes) {
+        const filePath = node.properties.filePath;
+        if (filePath) {
+            const modId = fileToModule.get(filePath);
+            if (modId !== undefined) {
+                nodeToModule.set(node.id, modId);
+            }
+        }
+    }
+    // Step 2: build nodeId → function name map
+    const nodeToName = new Map();
+    for (const node of nodes) {
+        const name = node.properties.name;
+        if (name !== undefined) {
+            nodeToName.set(node.id, name);
+        }
+    }
+    // Step 3: map each ProcessData → FlowNode
+    const flows = processes.map((proc) => {
+        const trigger = nodeToName.get(proc.entryPointId) ?? 'unknown';
+        const steps = [...proc.steps]
+            .sort((a, b) => a.step - b.step)
+            .map((s) => ({
+            module: nodeToModule.get(s.nodeId) ?? 'unknown',
+            function: nodeToName.get(s.nodeId) ?? 'unknown',
+        }));
+        const hash = structHash({
+            id: proc.id,
+            trigger,
+            steps: steps.map((s) => ({ module: s.module, function: s.function })),
+        });
+        return {
+            id: proc.id,
+            type: 'flow',
+            trigger,
+            steps,
+            struct_hash: hash,
+        };
+    });
+    // Step 4: sort alphabetically by id
+    flows.sort((a, b) => a.id.localeCompare(b.id));
+    return flows;
+}
+//# sourceMappingURL=flow-compiler.js.map

package/dist/compiler/flow-compiler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow-compiler.js","sourceRoot":"","sources":["../../src/compiler/flow-compiler.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAE5C;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,YAAY,CAC1B,SAAwB,EACxB,KAAkB,EAClB,OAAqB;IAErB,+DAA+D;IAC/D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,QAA8B,CAAC;QAChE,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACzC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAA0B,CAAC;QACxD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,MAAM,KAAK,GAAe,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QAC/C,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,SAAS,CAAC;QAE/D,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;aAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;aAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,MAAM,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,SAAS;YAC/C,QAAQ,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,SAAS;SAChD,CAAC,CAAC,CAAC;QAEN,MAAM,IAAI,GAAG,UAAU,CAAC;YACtB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,OAAO;YACP,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;SACtE,CAAC,CAAC;QAEH,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,MAAe;YACrB,OAAO;YACP,KAAK;YACL,WAAW,EAAE,IAAI;SACC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,oCAAoC;IACpC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE/C,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/compiler/module-compiler.d.ts

@@ -0,0 +1,18 @@
+import type { ModuleNode } from '../store/schema.js';
+import type { GraphNode, GraphEdge, CommunityData } from '../core/export/json-exporter.js';
+/**
+ * Compile GraphNode + GraphEdge data into ModuleNode records.
+ *
+ * Algorithm:
+ * 1. Group nodes by top-level directory of their filePath.
+ * 2. For large modules (> COMMUNITY_SPLIT_THRESHOLD files), use community
+ *    data to split into sub-modules with labels derived from member names.
+ * 3. Build deduplicated file sets per module.
+ * 4. Map each node ID → module ID.
+ * 5. Count external in-calls per node (caller module ≠ callee module).
+ * 6. Canonical entry = most externally called exported function in module.
+ * 7. Build depends_on / depended_by from cross-module CALLS edges.
+ * 8. Compute struct_hash from { id, canonical_entry, files }.
+ * 9. Sort modules alphabetically.
+ */
+export declare function compileModules(nodes: GraphNode[], edges: GraphEdge[], communities: CommunityData[]): ModuleNode[];

package/dist/compiler/module-compiler.js

@@ -0,0 +1,420 @@
+import { structHash } from '../lib/hash.js';
+import { splitCompoundName, moduleIdForFile } from '../lib/naming.js';
+/** Minimum files in a directory module before community splitting kicks in. */
+const COMMUNITY_SPLIT_THRESHOLD = 50;
+/** Sub-modules below this file count get merged into their closest neighbor. */
+const MIN_SUBMODULE_FILES = 5;
+/** Sub-modules above this count get directory-aware refinement. */
+const DIRECTORY_REFINE_THRESHOLD = 100;
+/**
+ * Generate a sub-module label from member function/symbol names.
+ * Finds the most common non-noise word root across member names.
+ */
+function generateSubModuleLabel(memberNodeIds, nodeById) {
+    const NOISE = new Set([
+        'get', 'set', 'new', 'create', 'handle', 'error', 'config', 'init',
+        'type', 'data', 'info', 'item', 'list', 'map', 'test', 'mock', 'base',
+        'default', 'internal', 'util', 'helper', 'manager', 'service', 'handler',
+        'processor', 'builder', 'factory', 'impl', 'abstract', 'interface',
+        'command', 'func', 'run', 'load', 'write', 'read', 'parse', 'string',
+        'options', 'args', 'result', 'value', 'node', 'file', 'path', 'name',
+    ]);
+    const wordCounts = new Map();
+    for (const nodeId of memberNodeIds) {
+        const node = nodeById.get(nodeId);
+        if (!node)
+            continue;
+        const name = node.properties.name;
+        if (!name)
+            continue;
+        const words = splitCompoundName(name);
+        // Count each word once per symbol (not per occurrence)
+        const seen = new Set();
+        for (const w of words) {
+            if (NOISE.has(w) || seen.has(w))
+                continue;
+            seen.add(w);
+            wordCounts.set(w, (wordCounts.get(w) ?? 0) + 1);
+        }
+    }
+    // Pick word with highest count; tie-break by length desc (longer = more meaningful)
+    let best = '';
+    let bestCount = 0;
+    for (const [word, count] of wordCounts) {
+        if (count > bestCount ||
+            (count === bestCount && word.length > best.length) ||
+            (count === bestCount && word.length === best.length && word < best)) {
+            bestCount = count;
+            best = word;
+        }
+    }
+    return best || 'misc';
+}
+/**
+ * Compile GraphNode + GraphEdge data into ModuleNode records.
+ *
+ * Algorithm:
+ * 1. Group nodes by top-level directory of their filePath.
+ * 2. For large modules (> COMMUNITY_SPLIT_THRESHOLD files), use community
+ *    data to split into sub-modules with labels derived from member names.
+ * 3. Build deduplicated file sets per module.
+ * 4. Map each node ID → module ID.
+ * 5. Count external in-calls per node (caller module ≠ callee module).
+ * 6. Canonical entry = most externally called exported function in module.
+ * 7. Build depends_on / depended_by from cross-module CALLS edges.
+ * 8. Compute struct_hash from { id, canonical_entry, files }.
+ * 9. Sort modules alphabetically.
+ */
+export function compileModules(nodes, edges, communities) {
+    // Build a lookup of node properties for quick access
+    const nodeById = new Map();
+    for (const node of nodes) {
+        nodeById.set(node.id, node);
+    }
+    // Step 1: group nodes by top-level directory
+    const dirFiles = new Map();
+    const dirNodeIds = new Map();
+    for (const node of nodes) {
+        const filePath = node.properties.filePath;
+        if (!filePath)
+            continue;
+        const dirId = moduleIdForFile(filePath);
+        if (!dirFiles.has(dirId)) {
+            dirFiles.set(dirId, new Set());
+            dirNodeIds.set(dirId, new Set());
+        }
+        dirFiles.get(dirId).add(filePath);
+        dirNodeIds.get(dirId).add(node.id);
+    }
+    // Step 2: community-based splitting for large modules
+    // Build community membership lookup: nodeId → communityId
+    const nodeToCommunity = new Map();
+    for (const comm of communities) {
+        for (const memberId of comm.members) {
+            nodeToCommunity.set(memberId, comm.id);
+        }
+    }
+    // Final module maps (after potential splitting)
+    const moduleFiles = new Map();
+    const moduleNodeIds = new Map();
+    for (const [dirId, fileSet] of dirFiles) {
+        const nodeIds = dirNodeIds.get(dirId);
+        if (fileSet.size > COMMUNITY_SPLIT_THRESHOLD && communities.length > 0) {
+            // Phase A: label each community, then MERGE same-label communities
+            const communityGroups = new Map(); // commId → nodeIds
+            for (const nodeId of nodeIds) {
+                const commId = nodeToCommunity.get(nodeId);
+                if (commId) {
+                    if (!communityGroups.has(commId))
+                        communityGroups.set(commId, new Set());
+                    communityGroups.get(commId).add(nodeId);
+                }
+            }
+            // Compute label for each community, then merge by label
+            const labelToNodes = new Map();
+            for (const [, members] of communityGroups) {
+                if (members.size === 0)
+                    continue;
+                const label = generateSubModuleLabel([...members], nodeById);
+                if (!labelToNodes.has(label))
+                    labelToNodes.set(label, new Set());
+                const merged = labelToNodes.get(label);
+                for (const n of members)
+                    merged.add(n);
+            }
+            // Phase B: FILE-LEVEL assignment — assign each file to the label
+            // that has the most community-member nodes in that file
+            const fileToNodeIds = new Map();
+            for (const nodeId of nodeIds) {
+                const fp = nodeById.get(nodeId)?.properties.filePath;
+                if (!fp)
+                    continue;
+                if (!fileToNodeIds.has(fp))
+                    fileToNodeIds.set(fp, []);
+                fileToNodeIds.get(fp).push(nodeId);
+            }
+            // Build node→label lookup for community-assigned nodes
+            const nodeToLabel = new Map();
+            for (const [label, nodes2] of labelToNodes) {
+                for (const nid of nodes2)
+                    nodeToLabel.set(nid, label);
+            }
+            // For each file, count which label has the most members in it
+            const fileToLabel = new Map();
+            for (const [fp, fNodes] of fileToNodeIds) {
+                const labelCounts = new Map();
+                for (const nid of fNodes) {
+                    const label = nodeToLabel.get(nid);
+                    if (label)
+                        labelCounts.set(label, (labelCounts.get(label) ?? 0) + 1);
+                }
+                if (labelCounts.size > 0) {
+                    let best = '';
+                    let bestCount = 0;
+                    for (const [label, count] of labelCounts) {
+                        if (count > bestCount || (count === bestCount && label < best)) {
+                            bestCount = count;
+                            best = label;
+                        }
+                    }
+                    fileToLabel.set(fp, best);
+                }
+                // else: file has no community members, will be assigned in Phase C
+            }
+            // Phase C: assign remaining files by co-location — if a file has the
+            // same basename prefix (e.g. control_state.go ↔ control_ops.go) as
+            // assigned files, group them together. Otherwise use edge proximity.
+            const unassignedFiles = [...fileToNodeIds.keys()].filter((fp) => !fileToLabel.has(fp));
+            // Build file basename → label mapping from assigned files
+            const prefixToLabel = new Map();
+            for (const [fp, label] of fileToLabel) {
+                const base = fp.split('/').pop().replace(/\.[^.]+$/, '');
+                const prefix = base.replace(/_test$/, '').split('_')[0];
+                if (!prefixToLabel.has(prefix))
+                    prefixToLabel.set(prefix, new Map());
+                const counts = prefixToLabel.get(prefix);
+                counts.set(label, (counts.get(label) ?? 0) + 1);
+            }
+            for (const fp of unassignedFiles) {
+                const base = fp.split('/').pop().replace(/\.[^.]+$/, '');
+                const prefix = base.replace(/_test$/, '').split('_')[0];
+                // Try prefix match
+                const counts = prefixToLabel.get(prefix);
+                if (counts && counts.size > 0) {
+                    let best = '';
+                    let bestCount = 0;
+                    for (const [label, count] of counts) {
+                        if (count > bestCount) {
+                            bestCount = count;
+                            best = label;
+                        }
+                    }
+                    fileToLabel.set(fp, best);
+                    continue;
+                }
+                // Last resort: use the file's own nodes' word roots as a label
+                const fNodes = fileToNodeIds.get(fp) ?? [];
+                const selfLabel = generateSubModuleLabel(fNodes, nodeById);
+                fileToLabel.set(fp, selfLabel);
+            }
+            // Phase D: assemble sub-modules from file assignments
+            const labelModFiles = new Map();
+            const labelModNodes = new Map();
+            for (const [fp, label] of fileToLabel) {
+                if (!labelModFiles.has(label)) {
+                    labelModFiles.set(label, new Set());
+                    labelModNodes.set(label, new Set());
+                }
+                labelModFiles.get(label).add(fp);
+                for (const nid of (fileToNodeIds.get(fp) ?? [])) {
+                    labelModNodes.get(label).add(nid);
+                }
+            }
+            // Phase E: merge small sub-modules into their closest large neighbor
+            // Find which labels are "small" (below threshold)
+            const smallLabels = new Set();
+            const largeLabels = new Set();
+            for (const [label, files] of labelModFiles) {
+                if (files.size < MIN_SUBMODULE_FILES)
+                    smallLabels.add(label);
+                else
+                    largeLabels.add(label);
+            }
+            if (smallLabels.size > 0 && largeLabels.size > 0) {
+                // Single-pass edge bucketing: build nodeId → label map, then one
+                // pass over edges to accumulate mergeScores[smallLabel][largeLabel].
+                const allNodeToLabel = new Map();
+                for (const [label, nids] of labelModNodes) {
+                    for (const nid of nids)
+                        allNodeToLabel.set(nid, label);
+                }
+                const mergeScores = new Map();
+                for (const sl of smallLabels)
+                    mergeScores.set(sl, new Map());
+                for (const edge of edges) {
+                    if (edge.type !== 'CALLS')
+                        continue;
+                    const srcLabel = allNodeToLabel.get(edge.sourceId);
+                    const tgtLabel = allNodeToLabel.get(edge.targetId);
+                    if (!srcLabel || !tgtLabel || srcLabel === tgtLabel)
+                        continue;
+                    // One must be small, the other large
+                    if (smallLabels.has(srcLabel) && largeLabels.has(tgtLabel)) {
+                        const counts = mergeScores.get(srcLabel);
+                        counts.set(tgtLabel, (counts.get(tgtLabel) ?? 0) + 1);
+                    }
+                    else if (smallLabels.has(tgtLabel) && largeLabels.has(srcLabel)) {
+                        const counts = mergeScores.get(tgtLabel);
+                        counts.set(srcLabel, (counts.get(srcLabel) ?? 0) + 1);
+                    }
+                }
+                for (const smallLabel of smallLabels) {
+                    const edgeCounts = mergeScores.get(smallLabel);
+                    // Pick the most connected large label, or the largest by file count
+                    let bestTarget = '';
+                    let bestScore = 0;
+                    for (const [label, count] of edgeCounts) {
+                        if (count > bestScore) {
+                            bestScore = count;
+                            bestTarget = label;
+                        }
+                    }
+                    if (!bestTarget) {
+                        // Fallback: merge into the largest sub-module
+                        let maxFiles = 0;
+                        for (const ll of largeLabels) {
+                            const size = labelModFiles.get(ll).size;
+                            if (size > maxFiles) {
+                                maxFiles = size;
+                                bestTarget = ll;
+                            }
+                        }
+                    }
+                    if (bestTarget) {
+                        // Merge small into large
+                        const smallNodes = labelModNodes.get(smallLabel);
+                        const targetFiles = labelModFiles.get(bestTarget);
+                        const targetNodes = labelModNodes.get(bestTarget);
+                        for (const f of labelModFiles.get(smallLabel))
+                            targetFiles.add(f);
+                        for (const n of smallNodes)
+                            targetNodes.add(n);
+                        labelModFiles.delete(smallLabel);
+                        labelModNodes.delete(smallLabel);
+                    }
+                }
+            }
+            // Phase F: directory-aware refinement for still-large sub-modules
+            for (const [label, files] of [...labelModFiles.entries()]) {
+                if (files.size <= DIRECTORY_REFINE_THRESHOLD)
+                    continue;
+                // Check if files span multiple subdirectories
+                const subdirCounts = new Map();
+                for (const fp of files) {
+                    const parts = fp.split('/');
+                    const subdir = parts.length >= 3 ? parts[1] : '_flat';
+                    if (!subdirCounts.has(subdir))
+                        subdirCounts.set(subdir, new Set());
+                    subdirCounts.get(subdir).add(fp);
+                }
+                // Only refine if there are multiple meaningful subdirs
+                if (subdirCounts.size < 2)
+                    continue;
+                // Split: each subdir becomes its own sub-module
+                const nodes2 = labelModNodes.get(label);
+                labelModFiles.delete(label);
+                labelModNodes.delete(label);
+                for (const [subdir, subdirFiles] of subdirCounts) {
+                    const refinedLabel = subdir === '_flat' ? label : subdir;
+                    const refinedNodes = new Set();
+                    for (const nid of nodes2) {
+                        const fp = nodeById.get(nid)?.properties.filePath;
+                        if (fp && subdirFiles.has(fp))
+                            refinedNodes.add(nid);
+                    }
+                    if (!labelModFiles.has(refinedLabel)) {
+                        labelModFiles.set(refinedLabel, new Set());
+                        labelModNodes.set(refinedLabel, new Set());
+                    }
+                    const existing = labelModFiles.get(refinedLabel);
+                    const existingNodes = labelModNodes.get(refinedLabel);
+                    for (const f of subdirFiles)
+                        existing.add(f);
+                    for (const n of refinedNodes)
+                        existingNodes.add(n);
+                }
+            }
+            for (const [label, files] of labelModFiles) {
+                if (files.size === 0)
+                    continue;
+                const subModId = `${dirId}/${label}`;
+                moduleFiles.set(subModId, files);
+                moduleNodeIds.set(subModId, labelModNodes.get(label));
+            }
+        }
+        else {
+            // Small module — keep as-is
+            moduleFiles.set(dirId, fileSet);
+            moduleNodeIds.set(dirId, nodeIds);
+        }
+    }
+    // Step 3: map node ID → module ID for fast lookup
+    const nodeToModule = new Map();
+    for (const [modId, nodeIds] of moduleNodeIds) {
+        for (const nodeId of nodeIds) {
+            nodeToModule.set(nodeId, modId);
+        }
+    }
+    // Step 4: count external in-calls per node (CALLS edges only)
+    const externalInCallCount = new Map();
+    const dependsOnSet = new Map();
+    const dependedBySet = new Map();
+    for (const modId of moduleFiles.keys()) {
+        dependsOnSet.set(modId, new Set());
+        dependedBySet.set(modId, new Set());
+    }
+    for (const edge of edges) {
+        if (edge.type !== 'CALLS')
+            continue;
+        const srcMod = nodeToModule.get(edge.sourceId);
+        const tgtMod = nodeToModule.get(edge.targetId);
+        if (!srcMod || !tgtMod)
+            continue;
+        if (srcMod !== tgtMod) {
+            externalInCallCount.set(edge.targetId, (externalInCallCount.get(edge.targetId) ?? 0) + 1);
+            dependsOnSet.get(srcMod).add(tgtMod);
+            dependedBySet.get(tgtMod).add(srcMod);
+        }
+    }
+    // Step 5: find canonical_entry per module
+    const moduleCanonicalEntry = new Map();
+    for (const [modId, nodeIds] of moduleNodeIds) {
+        let bestNodeId;
+        let bestCount = -1;
+        for (const nodeId of nodeIds) {
+            const node = nodeById.get(nodeId);
+            const isExported = node.properties.isExported;
+            if (!isExported)
+                continue;
+            const count = externalInCallCount.get(nodeId) ?? 0;
+            if (count > bestCount) {
+                bestCount = count;
+                bestNodeId = nodeId;
+            }
+        }
+        if (bestNodeId) {
+            const node = nodeById.get(bestNodeId);
+            moduleCanonicalEntry.set(modId, node.properties.name);
+        }
+        else {
+            const exportedNodes = [...nodeIds]
+                .map((id) => nodeById.get(id))
+                .filter((n) => n.properties.isExported)
+                .sort((a, b) => String(a.properties.name).localeCompare(String(b.properties.name)));
+            if (exportedNodes.length > 0) {
+                moduleCanonicalEntry.set(modId, exportedNodes[0].properties.name);
+            }
+            else {
+                moduleCanonicalEntry.set(modId, '');
+            }
+        }
+    }
+    // Step 6: assemble ModuleNode records and sort alphabetically
+    const moduleIds = [...moduleFiles.keys()].sort();
+    return moduleIds.map((modId) => {
+        const files = [...moduleFiles.get(modId)].sort();
+        const canonical_entry = moduleCanonicalEntry.get(modId) ?? '';
+        const depends_on = [...(dependsOnSet.get(modId) ?? [])].sort();
+        const depended_by = [...(dependedBySet.get(modId) ?? [])].sort();
+        const hash = structHash({ id: modId, canonical_entry, files });
+        return {
+            id: modId,
+            canonical_entry,
+            files,
+            depends_on,
+            depended_by,
+            struct_hash: hash,
+        };
+    });
+}
+//# sourceMappingURL=module-compiler.js.map

package/dist/compiler/module-compiler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"module-compiler.js","sourceRoot":"","sources":["../../src/compiler/module-compiler.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAEtE,+EAA+E;AAC/E,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAErC,gFAAgF;AAChF,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAE9B,mEAAmE;AACnE,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAEvC;;;GAGG;AACH,SAAS,sBAAsB,CAAC,aAAuB,EAAE,QAAgC;IACvF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC;QACpB,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM;QAClE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;QACrE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS;QACxE,WAAW,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW;QAClE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ;QACpE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;KACrE,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE7C,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAA0B,CAAC;QACxD,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACtC,uDAAuD;QACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1C,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,oFAAoF;IACpF,IAAI,IAAI,GAAG,EAAE,CAAC;IACd,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;QACvC,IACE,KAAK,GAAG,SAAS;YACjB,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAClD,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,GAAG,IAAI,CAAC,EACnE,CAAC;YACD,SAAS,GAAG,KAAK,CAAC;YAClB,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,OAAO,IAAI,IAAI,MAAM,CAAC;AACxB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAkB,EAClB,KAAkB,EAClB,WAA4B;IAE5B,qDAAqD;IACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAElD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,QAA8B,CAAC;QAChE,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,MAAM,KAAK,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;QAExC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC/B,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnC,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,sDAAsD;IACtD,0DAA0D;IAC1D,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACpC,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IACnD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IAErD,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;QAEvC,IAAI,OAAO,CAAC,IAAI,GAAG,yBAAyB,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvE,mEAAmE;YACnE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC,CAAC,mBAAmB;YAE3E,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC3C,IAAI,MAAM,EAAE,CAAC;oBACX,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC;wBAAE,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBACzE,eAAe,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YAED,wDAAwD;YACxD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;YACpD,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,eAAe,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC;oBAAE,SAAS;gBACjC,MAAM,KAAK,GAAG,sBAAsB,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;gBAC7D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACjE,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;gBACxC,KAAK,MAAM,CAAC,IAAI,OAAO;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;YAED,iEAAiE;YACjE,wDAAwD;YACxD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;YAClD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,EAAE,GAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,QAA+B,CAAC;gBAC7E,IAAI,CAAC,EAAE;oBAAE,SAAS;gBAClB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACtD,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtC,CAAC;YAED,uDAAuD;YACvD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC3C,KAAK,MAAM,GAAG,IAAI,MAAM;oBAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACxD,CAAC;YAED,8DAA8D;YAC9D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC9C,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;gBACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;gBAC9C,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;oBACzB,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnC,IAAI,KAAK;wBAAE,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACvE,CAAC;gBAED,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBACzB,IAAI,IAAI,GAAG,EAAE,CAAC;oBACd,IAAI,SAAS,GAAG,CAAC,CAAC;oBAClB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;wBACzC,IAAI,KAAK,GAAG,SAAS,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC;4BAC/D,SAAS,GAAG,KAAK,CAAC;4BAClB,IAAI,GAAG,KAAK,CAAC;wBACf,CAAC;oBACH,CAAC;oBACD,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;gBAC5B,CAAC;gBACD,mEAAmE;YACrE,CAAC;YAED,qEAAqE;YACrE,mEAAmE;YACnE,qEAAqE;YACrE,MAAM,eAAe,GAAG,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAEvF,0DAA0D;YAC1D,MAAM,aAAa,GAAG,IAAI,GAAG,EAA+B,CAAC;YAC7D,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;gBACtC,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;gBAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACrE,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;gBAC1C,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClD,CAAC;YAED,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;gBAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAExD,mBAAmB;gBACnB,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACzC,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBAC9B,IAAI,IAAI,GAAG,EAAE,CAAC;oBACd,IAAI,SAAS,GAAG,CAAC,CAAC;oBAClB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;wBACpC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;4BAAC,SAAS,GAAG,KAAK,CAAC;4BAAC,IAAI,GAAG,KAAK,CAAC;wBAAC,CAAC;oBAC7D,CAAC;oBACD,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;oBAC1B,SAAS;gBACX,CAAC;gBAED,+DAA+D;gBAC/D,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;gBAC3C,MAAM,SAAS,GAAG,sBAAsB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAC3D,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YACjC,CAAC;YAED,sDAAsD;YACtD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;YACrD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;YAErD,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;gBACtC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC9B,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBACpC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBACtC,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClC,KAAK,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;oBAChD,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;YAED,qEAAqE;YACrE,kDAAkD;YAClD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;YACtC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;YACtC,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,IAAI,GAAG,mBAAmB;oBAAE,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;;oBACxD,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC9B,CAAC;YAED,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACjD,iEAAiE;gBACjE,qEAAqE;gBACrE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;gBACjD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC;oBAC1C,KAAK,MAAM,GAAG,IAAI,IAAI;wBAAE,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBACzD,CAAC;gBAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAA+B,CAAC;gBAC3D,KAAK,MAAM,EAAE,IAAI,WAAW;oBAAE,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAE7D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;wBAAE,SAAS;oBACpC,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACnD,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACnD,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,QAAQ;wBAAE,SAAS;oBAE9D,qCAAqC;oBACrC,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3D,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;wBAC1C,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACxD,CAAC;yBAAM,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAClE,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;wBAC1C,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACxD,CAAC;gBACH,CAAC;gBAED,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;oBAEhD,oEAAoE;oBACpE,IAAI,UAAU,GAAG,EAAE,CAAC;oBACpB,IAAI,SAAS,GAAG,CAAC,CAAC;oBAClB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;wBACxC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;4BAAC,SAAS,GAAG,KAAK,CAAC;4BAAC,UAAU,GAAG,KAAK,CAAC;wBAAC,CAAC;oBACnE,CAAC;oBACD,IAAI,CAAC,UAAU,EAAE,CAAC;wBAChB,8CAA8C;wBAC9C,IAAI,QAAQ,GAAG,CAAC,CAAC;wBACjB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;4BAC7B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC;4BACzC,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;gCAAC,QAAQ,GAAG,IAAI,CAAC;gCAAC,UAAU,GAAG,EAAE,CAAC;4BAAC,CAAC;wBAC5D,CAAC;oBACH,CAAC;oBAED,IAAI,UAAU,EAAE,CAAC;wBACf,yBAAyB;wBACzB,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;wBAClD,MAAM,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;wBACnD,MAAM,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;wBACnD,KAAK,MAAM,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,UAAU,CAAE;4BAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBACnE,KAAK,MAAM,CAAC,IAAI,UAAU;4BAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBAC/C,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;wBACjC,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;oBACnC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,kEAAkE;YAClE,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;gBAC1D,IAAI,KAAK,CAAC,IAAI,IAAI,0BAA0B;oBAAE,SAAS;gBAEvD,8CAA8C;gBAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;gBACpD,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;oBACvB,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;oBACtD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC;wBAAE,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBACnE,YAAY,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpC,CAAC;gBAED,uDAAuD;gBACvD,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC;oBAAE,SAAS;gBAEpC,gDAAgD;gBAChD,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;gBACzC,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC5B,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAE5B,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,YAAY,EAAE,CAAC;oBACjD,MAAM,YAAY,GAAG,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;oBACzD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;oBACvC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;wBACzB,MAAM,EAAE,GAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,QAA+B,CAAC;wBAC1E,IAAI,EAAE,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;4BAAE,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACvD,CAAC;oBACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;wBACrC,aAAa,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;wBAC3C,aAAa,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBAC7C,CAAC;oBACD,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC;oBAClD,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC;oBACvD,KAAK,MAAM,CAAC,IAAI,WAAW;wBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7C,KAAK,MAAM,CAAC,IAAI,YAAY;wBAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;YAED,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,aAAa,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;oBAAE,SAAS;gBAC/B,MAAM,QAAQ,GAAG,GAAG,KAAK,IAAI,KAAK,EAAE,CAAC;gBACrC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;gBACjC,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,4BAA4B;YAC5B,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAChC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAC;IACpD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;IAErD,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC;QACvC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnC,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,SAAS;QAEpC,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAE/C,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;YAAE,SAAS;QAEjC,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1F,YAAY,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEvD,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE,CAAC;QAC7C,IAAI,UAA8B,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QAEnB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YACnC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,UAAiC,CAAC;YACrE,IAAI,CAAC,UAAU;gBAAE,SAAS;YAE1B,MAAM,KAAK,GAAG,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,SAAS,GAAG,KAAK,CAAC;gBAClB,UAAU,GAAG,MAAM,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YACvC,oBAAoB,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,IAAc,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC;iBAC/B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;iBAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC;iBACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEtF,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,oBAAoB,CAAC,GAAG,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAc,CAAC,CAAC;YAC9E,CAAC;iBAAM,CAAC;gBACN,oBAAoB,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,MAAM,SAAS,GAAG,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAEjD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7B,MAAM,KAAK,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAClD,MAAM,eAAe,GAAG,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAC9D,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAEjE,MAAM,IAAI,GAAG,UAAU,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC,CAAC;QAE/D,OAAO;YACL,EAAE,EAAE,KAAK;YACT,eAAe;YACf,KAAK;YACL,UAAU;YACV,WAAW;YACX,WAAW,EAAE,IAAI;SACG,CAAC;IACzB,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/compiler/stale-detector.d.ts

@@ -0,0 +1,22 @@
+import type { CotxStore } from '../store/store.js';
+export interface StaleResult {
+    staleEnrichments: Array<{
+        nodeId: string;
+        layer: string;
+        source_hash: string;
+        struct_hash: string;
+    }>;
+    staleAnnotations: Array<{
+        nodeId: string;
+        layer: string;
+        annotationIndex: number;
+        reason: string;
+    }>;
+    summary: {
+        totalStale: number;
+        enrichments: number;
+        annotations: number;
+    };
+}
+export declare function detectStale(store: CotxStore): StaleResult;
+export declare function markStaleAnnotations(store: CotxStore, changedNodeIds: Set<string>, reason: string): number;