monomind 1.10.1 → 1.10.2

package/packages/@monomind/cli/bundled-graph/dist/src/cache.js

@@ -0,0 +1,43 @@
+import { createHash } from 'crypto';
+import { existsSync, readFileSync, writeFileSync, mkdirSync, renameSync } from 'fs';
+import { join } from 'path';
+export class FileCache {
+    cacheDir;
+    constructor(outputDir) {
+        this.cacheDir = join(outputDir, 'cache');
+        mkdirSync(this.cacheDir, { recursive: true });
+    }
+    /** Strip YAML frontmatter (--- blocks) before hashing so metadata-only changes don't bust the cache. */
+    stripFrontmatter(content) {
+        if (!content.startsWith('---'))
+            return content;
+        const end = content.indexOf('\n---', 3);
+        return end === -1 ? content : content.slice(end + 4);
+    }
+    key(filePath, content) {
+        return createHash('sha256')
+            .update(filePath + this.stripFrontmatter(content))
+            .digest('hex');
+    }
+    get(key) {
+        const p = join(this.cacheDir, `${key}.json`);
+        if (!existsSync(p))
+            return null;
+        try {
+            return JSON.parse(readFileSync(p, 'utf-8'));
+        }
+        catch {
+            return null;
+        }
+    }
+    set(key, result) {
+        const p = join(this.cacheDir, `${key}.json`);
+        const tmp = `${p}.tmp`;
+        writeFileSync(tmp, JSON.stringify(result), 'utf-8');
+        renameSync(tmp, p);
+    }
+    has(key) {
+        return existsSync(join(this.cacheDir, `${key}.json`));
+    }
+}
+//# sourceMappingURL=cache.js.map

package/packages/@monomind/cli/bundled-graph/dist/src/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../src/cache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpC,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC;AACpF,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAG5B,MAAM,OAAO,SAAS;IACZ,QAAQ,CAAS;IAEzB,YAAY,SAAiB;QAC3B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACzC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,wGAAwG;IAChG,gBAAgB,CAAC,OAAe;QACtC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAC/C,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACxC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,GAAG,CAAC,QAAgB,EAAE,OAAe;QACnC,OAAO,UAAU,CAAC,QAAQ,CAAC;aACxB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;aACjD,MAAM,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED,GAAG,CAAC,GAAW;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,CAAC;QAC7C,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAqB,CAAC;QAClE,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,MAAwB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;QACvB,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;QACpD,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC;IACxD,CAAC;CACF"}

package/packages/@monomind/cli/bundled-graph/dist/src/cluster.d.ts

@@ -0,0 +1,5 @@
+import type Graph from 'graphology';
+export declare function detectCommunities(graph: Graph): Promise<Record<number, string[]>>;
+export declare function cohesionScore(graph: Graph, communityNodes: string[]): number;
+export declare function splitOversizedCommunities(graph: Graph, communities: Record<number, string[]>, threshold?: number, louvainFn?: ((g: Graph) => Record<string, number>) | null): Record<number, string[]>;
+//# sourceMappingURL=cluster.d.ts.map

package/packages/@monomind/cli/bundled-graph/dist/src/cluster.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.d.ts","sourceRoot":"","sources":["../../src/cluster.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,YAAY,CAAC;AAEpC,wBAAsB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAkBvF;AAsBD,wBAAgB,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,MAAM,CAe5E;AAED,wBAAgB,yBAAyB,CACvC,KAAK,EAAE,KAAK,EACZ,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACrC,SAAS,SAAO,GACf,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CA6B1B"}

package/packages/@monomind/cli/bundled-graph/dist/src/cluster.js

@@ -0,0 +1,120 @@
+import Graph from 'graphology';
+export async function detectCommunities(graph) {
+    let louvainFn = null;
+    try {
+        const mod = await import('graphology-communities-louvain');
+        louvainFn = mod.default;
+    }
+    catch { /* louvain not available */ }
+    if (louvainFn) {
+        try {
+            const assignment = louvainFn(graph);
+            for (const [nodeId, communityId] of Object.entries(assignment)) {
+                graph.setNodeAttribute(nodeId, 'community', communityId);
+            }
+            const communities = {};
+            for (const [nodeId, communityId] of Object.entries(assignment)) {
+                if (!communities[communityId])
+                    communities[communityId] = [];
+                communities[communityId].push(nodeId);
+            }
+            return splitOversizedCommunities(graph, communities, 0.25, louvainFn);
+        }
+        catch { /* fall through */ }
+    }
+    return splitOversizedCommunities(graph, fallbackCluster(graph), 0.25, louvainFn);
+}
+function fallbackCluster(graph) {
+    const dirMap = new Map();
+    let nextId = 0;
+    const communities = {};
+    graph.forEachNode((id, attrs) => {
+        const file = attrs.sourceFile || '';
+        const parts = file.split('/');
+        const dir = parts.length > 1 ? parts.slice(0, -1).join('/') : 'root';
+        if (!dirMap.has(dir))
+            dirMap.set(dir, nextId++);
+        const cid = dirMap.get(dir);
+        graph.setNodeAttribute(id, 'community', cid);
+        if (!communities[cid])
+            communities[cid] = [];
+        communities[cid].push(id);
+    });
+    return communities;
+}
+export function cohesionScore(graph, communityNodes) {
+    const memberSet = new Set(communityNodes);
+    let totalEdges = 0;
+    let internalEdges = 0;
+    graph.forEachEdge((_edge, _attrs, source, target) => {
+        const srcIn = memberSet.has(source);
+        const tgtIn = memberSet.has(target);
+        if (srcIn || tgtIn) {
+            totalEdges++;
+            if (srcIn && tgtIn)
+                internalEdges++;
+        }
+    });
+    return totalEdges === 0 ? 1.0 : internalEdges / totalEdges;
+}
+export function splitOversizedCommunities(graph, communities, threshold = 0.25, louvainFn = null) {
+    const maxSize = threshold * graph.order;
+    const allIds = Object.keys(communities).map(Number);
+    let nextId = allIds.length > 0 ? Math.max(...allIds) + 1 : 0;
+    for (const [cidStr, members] of Object.entries(communities)) {
+        if (members.length <= maxSize)
+            continue;
+        const cid = Number(cidStr);
+        // Attempt topology-based second pass via Louvain on the community subgraph
+        if (louvainFn && members.length >= 10) {
+            try {
+                const memberSet = new Set(members);
+                const subG = new Graph({ type: 'undirected', multi: false });
+                for (const nodeId of members)
+                    subG.addNode(nodeId);
+                graph.forEachEdge((_e, _a, source, target) => {
+                    if (memberSet.has(source) && memberSet.has(target) && source !== target && !subG.hasEdge(source, target))
+                        subG.addEdge(source, target);
+                });
+                const subAssignment = louvainFn(subG);
+                const subCommunityCount = new Set(Object.values(subAssignment)).size;
+                if (subCommunityCount > 1 && subCommunityCount <= Math.ceil(members.length / 2)) {
+                    const subIdMap = new Map();
+                    const newSubIds = {};
+                    for (const [nodeId, localId] of Object.entries(subAssignment)) {
+                        if (!subIdMap.has(localId))
+                            subIdMap.set(localId, nextId++);
+                        const globalId = subIdMap.get(localId);
+                        graph.setNodeAttribute(nodeId, 'community', globalId);
+                        if (!newSubIds[globalId])
+                            newSubIds[globalId] = [];
+                        newSubIds[globalId].push(nodeId);
+                    }
+                    delete communities[cid];
+                    Object.assign(communities, newSubIds);
+                    continue;
+                }
+            }
+            catch { /* fall through to directory heuristic */ }
+        }
+        // Directory heuristic fallback
+        const subMap = new Map();
+        const newSubIds = {};
+        for (const nodeId of members) {
+            const file = graph.getNodeAttribute(nodeId, 'sourceFile') || '';
+            const parts = file.split('/');
+            const parentDir = parts.length > 1 ? parts[parts.length - 2] : 'root';
+            if (!subMap.has(parentDir))
+                subMap.set(parentDir, nextId++);
+            const subId = subMap.get(parentDir);
+            graph.setNodeAttribute(nodeId, 'community', subId);
+            if (!newSubIds[subId])
+                newSubIds[subId] = [];
+            newSubIds[subId].push(nodeId);
+        }
+        delete communities[cid];
+        Object.assign(communities, newSubIds);
+    }
+    return communities;
+}
+//# sourceMappingURL=cluster.js.map

package/packages/@monomind/cli/bundled-graph/dist/src/cluster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.js","sourceRoot":"","sources":["../../src/cluster.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,KAAY;IAClD,IAAI,CAAC;QACH,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,MAAM,MAAM,CAAC,gCAAgC,CAAC,CAAC;QAC5E,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAA2B,CAAC;QAE5D,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/D,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,WAAW,GAA6B,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/D,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;gBAAE,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;YAC7D,WAAW,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,yBAAyB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACvD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,yBAAyB,CAAC,KAAK,EAAE,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;IAClE,CAAC;AACH,CAAC;AAED,SAAS,eAAe,CAAC,KAAY;IACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,WAAW,GAA6B,EAAE,CAAC;IAEjD,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE;QAC9B,MAAM,IAAI,GAAI,KAAK,CAAC,UAAqB,IAAI,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAErE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC7B,KAAK,CAAC,gBAAgB,CAAC,EAAE,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QAC7C,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,KAAY,EAAE,cAAwB;IAClE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;IAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAClD,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACnB,UAAU,EAAE,CAAC;YACb,IAAI,KAAK,IAAI,KAAK;gBAAE,aAAa,EAAE,CAAC;QACtC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,GAAG,UAAU,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,yBAAyB,CACvC,KAAY,EACZ,WAAqC,EACrC,SAAS,GAAG,IAAI;IAEhB,MAAM,OAAO,GAAG,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC;IACxC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACpD,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7D,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC5D,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO;YAAE,SAAS;QAExC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,SAAS,GAA6B,EAAE,CAAC;QAE/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAI,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,YAAY,CAAY,IAAI,EAAE,CAAC;YAC5E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC9B,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAEtE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;YAC5D,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC;YACrC,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;gBAAE,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAC7C,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;QACxB,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC"}

package/packages/@monomind/cli/bundled-graph/dist/src/detect.d.ts

@@ -0,0 +1,21 @@
+import type { BuildOptions, ClassifiedFile } from './types.js';
+/**
+ * Walks up the directory tree from rootPath to the filesystem root,
+ * collecting patterns from any `.graphifyignore` files found along the way.
+ * Lines beginning with `#` are comments; blank lines are skipped.
+ * Returns the combined list of pattern strings (closest dir first).
+ */
+export declare function loadIgnorePatterns(rootPath: string): string[];
+/**
+ * Recursively collects and classifies all files under rootPath, applying
+ * exclusion rules for directories, file size limits, security-sensitive filenames,
+ * .graphifyignore patterns, and optional language filtering from BuildOptions.
+ */
+export declare function collectFiles(rootPath: string, options?: BuildOptions): ClassifiedFile[];
+/**
+ * Analyses a collected file corpus and returns a list of human-readable warning
+ * strings describing potential issues. Returns an empty array when the corpus
+ * looks healthy.
+ */
+export declare function corpusHealth(files: ClassifiedFile[]): string[];
+//# sourceMappingURL=detect.d.ts.map

package/packages/@monomind/cli/bundled-graph/dist/src/detect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect.d.ts","sourceRoot":"","sources":["../../src/detect.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,cAAc,EAAY,MAAM,YAAY,CAAC;AA6EzE;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,CAuB7D;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC1B,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,YAAiB,GACzB,cAAc,EAAE,CAuDlB;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,MAAM,EAAE,CAsC9D"}

package/packages/@monomind/cli/bundled-graph/dist/src/detect.js

@@ -0,0 +1,195 @@
+import { readdirSync, readFileSync, statSync } from 'fs';
+import { join, extname, relative, dirname } from 'path';
+const DEFAULT_MAX_FILE_SIZE = 500 * 1024; // 500KB
+const EXCLUDED_DIRS = new Set([
+    'node_modules', '.git', 'dist', 'build', '.monomind',
+    '__pycache__', '.pytest_cache', 'target', '.cache',
+]);
+// Maps file extension to [fileType, language]
+const EXTENSION_MAP = {
+    '.ts': ['code', 'typescript'], '.tsx': ['code', 'typescript'],
+    '.mts': ['code', 'typescript'], '.cts': ['code', 'typescript'],
+    '.js': ['code', 'javascript'], '.jsx': ['code', 'javascript'],
+    '.mjs': ['code', 'javascript'], '.cjs': ['code', 'javascript'],
+    '.py': ['code', 'python'], '.go': ['code', 'go'],
+    '.rs': ['code', 'rust'], '.java': ['code', 'java'],
+    '.c': ['code', 'c'], '.cpp': ['code', 'cpp'],
+    '.h': ['code', 'c'], '.cs': ['code', 'csharp'],
+    '.rb': ['code', 'ruby'], '.php': ['code', 'php'],
+    '.swift': ['code', 'swift'], '.kt': ['code', 'kotlin'],
+    '.scala': ['code', 'scala'], '.md': ['document', 'markdown'],
+    '.txt': ['document', 'text'], '.rst': ['document', 'rst'],
+};
+// Patterns matching filenames/paths that may contain credentials or secrets.
+// Matched against both the basename and the relative path.
+const SECURITY_SENSITIVE_PATTERNS = [
+    // .env files
+    /^\.env(\.|$)/i,
+    /[/\\]\.env(\.|$)/i,
+    // PEM / key files
+    /\.(pem|key|p12|pfx)$/i,
+    // SSH private keys
+    /\b(id_rsa|id_dsa|id_ecdsa|id_ed25519)(\.[^/\\]*)?$/i,
+    // Credential / secret JSON / YAML
+    /\bcredentials\.json$/i,
+    /\bsecrets?\.(json|ya?ml)$/i,
+    // AWS
+    /\baws-credentials$/i,
+    /[/\\]\.aws[/\\]credentials$/i,
+    // GCP / Firebase
+    /\bservice-?account\.json$/i,
+    /\bclient_secret\.json$/i,
+    /\bgoogle-credentials\.json$/i,
+    /\bfirebase[^/\\]*\.json$/i,
+    // Auth-related
+    /\bprivate\.key$/i,
+    /\bprivate_key\.json$/i,
+    /\.htpasswd$/i,
+    /\bshadow$/i,
+    /\bvault-token$/i,
+    /\.token$/i,
+    /\bauth\.json$/i,
+    // Package auth files
+    /\.npmrc$/i,
+    /\.pypirc$/i,
+    /\bnetrc$/i,
+    /\.pgpass$/i,
+];
+/** Returns true if the given basename or relative path matches any security-sensitive pattern. */
+function isSecuritySensitive(basename, relPath) {
+    return SECURITY_SENSITIVE_PATTERNS.some((re) => re.test(basename) || re.test(relPath));
+}
+/**
+ * Converts a .graphifyignore pattern line into a RegExp.
+ * Escapes regex special chars then converts `*` to `.*`.
+ */
+function patternToRegex(pattern) {
+    const escaped = pattern.replace(/[.+^${}()|[\]\\]/g, '\\$&').replace(/\*/g, '.*');
+    return new RegExp(escaped);
+}
+/**
+ * Walks up the directory tree from rootPath to the filesystem root,
+ * collecting patterns from any `.graphifyignore` files found along the way.
+ * Lines beginning with `#` are comments; blank lines are skipped.
+ * Returns the combined list of pattern strings (closest dir first).
+ */
+export function loadIgnorePatterns(rootPath) {
+    const patterns = [];
+    let current = rootPath;
+    while (true) {
+        const candidate = join(current, '.graphifyignore');
+        try {
+            const contents = readFileSync(candidate, 'utf8');
+            for (const line of contents.split(/\r?\n/)) {
+                const trimmed = line.trim();
+                if (trimmed && !trimmed.startsWith('#')) {
+                    patterns.push(trimmed);
+                }
+            }
+        }
+        catch {
+            // File does not exist or is unreadable at this level — continue walking up
+        }
+        const parent = dirname(current);
+        if (parent === current)
+            break; // reached filesystem root
+        current = parent;
+    }
+    return patterns;
+}
+/**
+ * Recursively collects and classifies all files under rootPath, applying
+ * exclusion rules for directories, file size limits, security-sensitive filenames,
+ * .graphifyignore patterns, and optional language filtering from BuildOptions.
+ */
+export function collectFiles(rootPath, options = {}) {
+    const maxFileSizeBytes = options.maxFileSizeBytes ?? DEFAULT_MAX_FILE_SIZE;
+    const codeOnly = options.codeOnly ?? false;
+    const languageFilter = options.languages ? new Set(options.languages) : null;
+    const excludePatterns = options.excludePatterns ?? [];
+    // Load .graphifyignore patterns and compile to regexes
+    const ignorePatternStrings = loadIgnorePatterns(rootPath);
+    const ignoreRegexes = ignorePatternStrings.map(patternToRegex);
+    const results = [];
+    function walkDir(dirPath) {
+        let entries;
+        try {
+            entries = readdirSync(dirPath);
+        }
+        catch {
+            return;
+        }
+        for (const entry of entries) {
+            const fullPath = join(dirPath, entry);
+            const relPath = relative(rootPath, fullPath);
+            // Check against caller-supplied exclude patterns
+            if (excludePatterns.some((pat) => relPath.includes(pat)))
+                continue;
+            // Check against .graphifyignore patterns
+            if (ignoreRegexes.some((re) => re.test(relPath)))
+                continue;
+            let stat;
+            try {
+                stat = statSync(fullPath);
+            }
+            catch {
+                continue;
+            }
+            if (stat.isDirectory()) {
+                if (EXCLUDED_DIRS.has(entry))
+                    continue;
+                walkDir(fullPath);
+                continue;
+            }
+            if (!stat.isFile())
+                continue;
+            if (stat.size > maxFileSizeBytes)
+                continue;
+            // Skip security-sensitive files
+            if (isSecuritySensitive(entry, relPath))
+                continue;
+            const ext = extname(entry).toLowerCase();
+            const mapping = EXTENSION_MAP[ext];
+            if (!mapping)
+                continue;
+            const [fileType, language] = mapping;
+            if (codeOnly && fileType !== 'code')
+                continue;
+            if (languageFilter && !languageFilter.has(language))
+                continue;
+            results.push({ path: fullPath, fileType, language, sizeBytes: stat.size });
+        }
+    }
+    walkDir(rootPath);
+    return results;
+}
+/**
+ * Analyses a collected file corpus and returns a list of human-readable warning
+ * strings describing potential issues. Returns an empty array when the corpus
+ * looks healthy.
+ */
+export function corpusHealth(files) {
+    const warnings = [];
+    const codeFiles = files.filter((f) => f.fileType === 'code');
+    const docFiles = files.filter((f) => f.fileType === 'document');
+    const totalSize = files.reduce((sum, f) => sum + f.sizeBytes, 0);
+    if (codeFiles.length < 5) {
+        warnings.push(`Corpus is very small (${codeFiles.length} code files). Graph may be sparse.`);
+    }
+    if (totalSize < 50_000) {
+        const kb = Math.round(totalSize / 1024);
+        warnings.push(`Corpus total size is very small (~${kb}KB). Consider including more source files.`);
+    }
+    if (totalSize > 50_000_000) {
+        const mb = Math.round(totalSize / (1024 * 1024));
+        warnings.push(`Corpus is very large (~${mb}MB). Build may be slow. Consider using codeOnly or excludePatterns.`);
+    }
+    if (docFiles.length === 0) {
+        warnings.push('No documentation files found. Graph will have no document nodes.');
+    }
+    if (files.length > 0 && docFiles.length / files.length > 0.8) {
+        warnings.push('Corpus is mostly documentation. Consider codeOnly: true for a code-focused graph.');
+    }
+    return warnings;
+}
+//# sourceMappingURL=detect.js.map

package/packages/@monomind/cli/bundled-graph/dist/src/detect.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect.js","sourceRoot":"","sources":["../../src/detect.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,IAAI,CAAC;AACzD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAGxD,MAAM,qBAAqB,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,QAAQ;AAElD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;IAC5B,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY;IACrD,aAAa,EAAE,eAAe,EAAE,QAAQ,EAAE,QAAQ;CACnD,CAAC,CAAC;AAEH,8CAA8C;AAC9C,MAAM,aAAa,GAAuC;IACxD,KAAK,EAAK,CAAC,MAAM,EAAE,YAAY,CAAC,EAAG,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC;IACnE,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC,EAAG,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC;IACnE,KAAK,EAAK,CAAC,MAAM,EAAE,YAAY,CAAC,EAAG,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC;IACnE,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC,EAAG,MAAM,EAAI,CAAC,MAAM,EAAE,YAAY,CAAC;IACnE,KAAK,EAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAO,KAAK,EAAK,CAAC,MAAM,EAAE,IAAI,CAAC;IAC3D,KAAK,EAAK,CAAC,MAAM,EAAE,MAAM,CAAC,EAAS,OAAO,EAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAC7D,IAAI,EAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAY,MAAM,EAAI,CAAC,MAAM,EAAE,KAAK,CAAC;IAC5D,IAAI,EAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAAY,KAAK,EAAK,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC/D,KAAK,EAAK,CAAC,MAAM,EAAE,MAAM,CAAC,EAAS,MAAM,EAAI,CAAC,MAAM,EAAE,KAAK,CAAC;IAC5D,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAQ,KAAK,EAAK,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC/D,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAQ,KAAK,EAAK,CAAC,UAAU,EAAE,UAAU,CAAC;IACrE,MAAM,EAAI,CAAC,UAAU,EAAE,MAAM,CAAC,EAAK,MAAM,EAAI,CAAC,UAAU,EAAE,KAAK,CAAC;CACjE,CAAC;AAEF,6EAA6E;AAC7E,2DAA2D;AAC3D,MAAM,2BAA2B,GAAa;IAC5C,aAAa;IACb,eAAe;IACf,mBAAmB;IACnB,kBAAkB;IAClB,uBAAuB;IACvB,mBAAmB;IACnB,qDAAqD;IACrD,kCAAkC;IAClC,uBAAuB;IACvB,4BAA4B;IAC5B,MAAM;IACN,qBAAqB;IACrB,8BAA8B;IAC9B,iBAAiB;IACjB,4BAA4B;IAC5B,yBAAyB;IACzB,8BAA8B;IAC9B,2BAA2B;IAC3B,eAAe;IACf,kBAAkB;IAClB,uBAAuB;IACvB,cAAc;IACd,YAAY;IACZ,iBAAiB;IACjB,WAAW;IACX,gBAAgB;IAChB,qBAAqB;IACrB,WAAW;IACX,YAAY;IACZ,WAAW;IACX,YAAY;CACb,CAAC;AAEF,kGAAkG;AAClG,SAAS,mBAAmB,CAAC,QAAgB,EAAE,OAAe;IAC5D,OAAO,2BAA2B,CAAC,IAAI,CACrC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAC9C,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,OAAe;IACrC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,mBAAmB,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClF,OAAO,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAgB;IACjD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,OAAO,GAAG,QAAQ,CAAC;IAEvB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,EAAE,iBAAiB,CAAC,CAAC;QACnD,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC5B,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,2EAA2E;QAC7E,CAAC;QACD,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,MAAM,KAAK,OAAO;YAAE,MAAM,CAAC,0BAA0B;QACzD,OAAO,GAAG,MAAM,CAAC;IACnB,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,QAAgB,EAChB,UAAwB,EAAE;IAE1B,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,qBAAqB,CAAC;IAC3E,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,KAAK,CAAC;IAC3C,MAAM,cAAc,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7E,MAAM,eAAe,GAAG,OAAO,CAAC,eAAe,IAAI,EAAE,CAAC;IAEtD,uDAAuD;IACvD,MAAM,oBAAoB,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC1D,MAAM,aAAa,GAAG,oBAAoB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAE/D,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,SAAS,OAAO,CAAC,OAAe;QAC9B,IAAI,OAAiB,CAAC;QACtB,IAAI,CAAC;YAAC,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO;QAAC,CAAC;QAEzD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACtC,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAE7C,iDAAiD;YACjD,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAAE,SAAS;YAEnE,yCAAyC;YACzC,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAAE,SAAS;YAE3D,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBAAC,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC;gBAAC,SAAS;YAAC,CAAC;YAEtD,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACvC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;gBAAE,SAAS;YAC7B,IAAI,IAAI,CAAC,IAAI,GAAG,gBAAgB;gBAAE,SAAS;YAE3C,gCAAgC;YAChC,IAAI,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC;gBAAE,SAAS;YAElD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,CAAC,OAAO;gBAAE,SAAS;YAEvB,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,OAAO,CAAC;YACrC,IAAI,QAAQ,IAAI,QAAQ,KAAK,MAAM;gBAAE,SAAS;YAC9C,IAAI,cAAc,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAE9D,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED,OAAO,CAAC,QAAQ,CAAC,CAAC;IAClB,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,KAAuB;IAClD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC;IACjE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAEjE,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,QAAQ,CAAC,IAAI,CACX,yBAAyB,SAAS,CAAC,MAAM,oCAAoC,CAC9E,CAAC;IACJ,CAAC;IAED,IAAI,SAAS,GAAG,MAAM,EAAE,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC;QACxC,QAAQ,CAAC,IAAI,CACX,qCAAqC,EAAE,4CAA4C,CACpF,CAAC;IACJ,CAAC;IAED,IAAI,SAAS,GAAG,UAAU,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QACjD,QAAQ,CAAC,IAAI,CACX,0BAA0B,EAAE,qEAAqE,CAClG,CAAC;IACJ,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,QAAQ,CAAC,IAAI,CAAC,kEAAkE,CAAC,CAAC;IACpF,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QAC7D,QAAQ,CAAC,IAAI,CACX,mFAAmF,CACpF,CAAC;IACJ,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/packages/@monomind/cli/bundled-graph/dist/src/export.d.ts

@@ -0,0 +1,21 @@
+import Graph from 'graphology';
+/**
+ * Serialize a graphology graph to disk as a JSON file.
+ * Creates the output directory if it does not exist.
+ * Returns the absolute path to the written file.
+ */
+export declare function saveGraph(graph: Graph, outputDir: string, projectPath: string): string;
+/**
+ * Deserialize a graph from a previously saved JSON file.
+ * Silently skips edges whose endpoints are missing from the node list.
+ */
+export declare function loadGraph(graphPath: string): Graph;
+/**
+ * Return true when a graph.json already exists in the given output directory.
+ */
+export declare function graphExists(outputDir: string): boolean;
+/**
+ * Return the canonical path to graph.json inside an output directory.
+ */
+export declare function getGraphPath(outputDir: string): string;
+//# sourceMappingURL=export.d.ts.map

package/packages/@monomind/cli/bundled-graph/dist/src/export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.d.ts","sourceRoot":"","sources":["../../src/export.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,MAAM,YAAY,CAAC;AAG/B;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAsBtF;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,KAAK,CAyBlD;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAEtD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEtD"}

package/packages/@monomind/cli/bundled-graph/dist/src/export.js

@@ -0,0 +1,68 @@
+import { existsSync, readFileSync, writeFileSync, mkdirSync } from 'fs';
+import { join } from 'path';
+import Graph from 'graphology';
+/**
+ * Serialize a graphology graph to disk as a JSON file.
+ * Creates the output directory if it does not exist.
+ * Returns the absolute path to the written file.
+ */
+export function saveGraph(graph, outputDir, projectPath) {
+    mkdirSync(outputDir, { recursive: true });
+    const graphPath = join(outputDir, 'graph.json');
+    const nodes = [];
+    graph.forEachNode((id, attrs) => nodes.push({ id, ...attrs }));
+    const links = [];
+    graph.forEachEdge((_, attrs, source, target) => links.push({ source, target, ...attrs }));
+    const serialized = {
+        version: '1.0.0',
+        builtAt: new Date().toISOString(),
+        projectPath,
+        nodes,
+        links,
+        directed: graph.type === 'directed',
+        multigraph: graph.multi,
+    };
+    writeFileSync(graphPath, JSON.stringify(serialized, null, 2), 'utf-8');
+    return graphPath;
+}
+/**
+ * Deserialize a graph from a previously saved JSON file.
+ * Silently skips edges whose endpoints are missing from the node list.
+ */
+export function loadGraph(graphPath) {
+    const raw = readFileSync(graphPath, 'utf-8');
+    const data = JSON.parse(raw);
+    const graph = new Graph({
+        type: data.directed ? 'directed' : 'undirected',
+        multi: false,
+    });
+    for (const node of data.nodes) {
+        const { id, ...attrs } = node;
+        graph.addNode(id, attrs);
+    }
+    for (const link of data.links) {
+        const { source, target, ...attrs } = link;
+        if (!graph.hasNode(source) || !graph.hasNode(target))
+            continue;
+        try {
+            graph.addEdge(source, target, attrs);
+        }
+        catch {
+            // Duplicate edge — ignore
+        }
+    }
+    return graph;
+}
+/**
+ * Return true when a graph.json already exists in the given output directory.
+ */
+export function graphExists(outputDir) {
+    return existsSync(join(outputDir, 'graph.json'));
+}
+/**
+ * Return the canonical path to graph.json inside an output directory.
+ */
+export function getGraphPath(outputDir) {
+    return join(outputDir, 'graph.json');
+}
+//# sourceMappingURL=export.js.map

package/packages/@monomind/cli/bundled-graph/dist/src/export.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"export.js","sourceRoot":"","sources":["../../src/export.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AACxE,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,KAAK,MAAM,YAAY,CAAC;AAG/B;;;;GAIG;AACH,MAAM,UAAU,SAAS,CAAC,KAAY,EAAE,SAAiB,EAAE,WAAmB;IAC5E,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAEhD,MAAM,KAAK,GAAoD,EAAE,CAAC;IAClE,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;IAE/D,MAAM,KAAK,GAAwE,EAAE,CAAC;IACtF,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC;IAE1F,MAAM,UAAU,GAAoB;QAClC,OAAO,EAAE,OAAO;QAChB,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACjC,WAAW;QACX,KAAK;QACL,KAAK;QACL,QAAQ,EAAE,KAAK,CAAC,IAAI,KAAK,UAAU;QACnC,UAAU,EAAE,KAAK,CAAC,KAAK;KACxB,CAAC;IAEF,aAAa,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACvE,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,MAAM,GAAG,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAoB,CAAC;IAEhD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;QACtB,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY;QAC/C,KAAK,EAAE,KAAK;KACb,CAAC,CAAC;IAEH,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,CAAC;QAC9B,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,GAAG,IAAI,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,SAAS;QAC/D,IAAI,CAAC;YACH,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB;IAC3C,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,SAAiB;IAC5C,OAAO,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;AACvC,CAAC"}

package/packages/@monomind/cli/bundled-graph/dist/src/extract/index.d.ts

@@ -0,0 +1,20 @@
+import type { ClassifiedFile, ExtractionResult, BuildOptions } from '../types.js';
+/**
+ * Extract graph nodes and edges from all classified files.
+ *
+ * Reads each file, checks the on-disk cache keyed by SHA-256 content hash,
+ * dispatches to the appropriate language extractor, and merges all results
+ * into a single ExtractionResult (nodes deduplicated by id, edges by source+target+relation).
+ *
+ * @param files      - Classified files to process (from the classify layer)
+ * @param outputDir  - Directory used for cache storage (.monomind/graph by default)
+ * @param options    - Build options (languages filter, maxFileSizeBytes, etc.)
+ */
+export declare function extractAll(files: ClassifiedFile[], outputDir: string, options?: BuildOptions): Promise<ExtractionResult>;
+export type { LanguageExtractor } from './types.js';
+export { typescriptExtractor } from './languages/typescript.js';
+export { pythonExtractor } from './languages/python.js';
+export { goExtractor } from './languages/go.js';
+export { rustExtractor } from './languages/rust.js';
+export { isTreeSitterAvailable, tryLoadParser, walk, parseFile, parseFileFromDisk } from './tree-sitter-runner.js';
+//# sourceMappingURL=index.d.ts.map

package/packages/@monomind/cli/bundled-graph/dist/src/extract/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/extract/index.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,cAAc,EAAE,gBAAgB,EAAE,YAAY,EAAwB,MAAM,aAAa,CAAC;AA+ExG;;;;;;;;;;GAUG;AACH,wBAAsB,UAAU,CAC9B,KAAK,EAAE,cAAc,EAAE,EACvB,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE,YAAY,GACrB,OAAO,CAAC,gBAAgB,CAAC,CAqF3B;AAGD,YAAY,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,IAAI,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC"}