@monoes/monograph 1.1.0 → 1.2.1

package/dist/src/graph/stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stats.js","sourceRoot":"","sources":["../../../src/graph/stats.ts"],"names":[],"mappings":"AAEA,4EAA4E;AAC5E,MAAM,SAAS,GAAG,IAAI,OAAO,EAAsD,CAAC;AAEpF,SAAS,IAAI,CAAC,EAAqB,EAAE,GAAW;IAC9C,IAAI,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChC,IAAI,CAAC,OAAO,EAAE,CAAC;QAAC,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAAC,CAAC;IAClE,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,CAAC,CAAC,EAAE,CAAC;QAAC,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAAC,CAAC;IACrD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,yFAAyF;AACzF,SAAS,UAAU,CAAC,MAAgB,EAAE,KAAa;IACjD,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;IAC/B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YAClC,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAkCD,SAAS,UAAU,CAAC,MAAgB,EAAE,CAAS;IAC7C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAgB;IACxC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IAC5B,IAAI,GAAG,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC;YAAE,GAAG,EAAE,CAAC;aACZ,IAAI,CAAC,IAAI,EAAE;YAAE,MAAM,EAAE,CAAC;aACtB,IAAI,CAAC,IAAI,EAAE;YAAE,IAAI,EAAE,CAAC;;YACpB,QAAQ,EAAE,CAAC;IAClB,CAAC;IACD,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,OAAO;QACL,GAAG;QACH,MAAM;QACN,IAAI;QACJ,QAAQ;QACR,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;QAChB,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC;QACtB,OAAO,EAAE,GAAG,CAAC,IAAI,CAAC;QAClB,WAAW,EAAE,GAAG,CAAC,QAAQ,CAAC;KAC3B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB;IAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,EAAE,+DAA+D,CAAC;SACxF,GAAG,EAAwC,CAAC;IAE/C,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,EAAE,+DAA+D,CAAC;SACzF,GAAG,EAAwC,CAAC;IAE/C,MAAM,UAAU,GAAI,IAAI,CAAC,EAAE,EAAE,sDAAsD,CAAC;SACjF,GAAG,EAAoB,CAAC,CAAC,CAAC;IAE7B,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClE,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEpE,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IAC7C,iFAAiF;IACjF,MAAM,iBAAiB,GAAG,WAAW,CAAC,MAAM,GAAG,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACjF,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC;QAC5C,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,iBAAiB,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;QAC5D,CAAC,CAAC,CAAC,CAAC;IAEN,OAAO;QACL,QAAQ,EAAE,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC;QACrC,QAAQ,EAAE,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC;QACrC,QAAQ,EAAE,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC;QACrC,QAAQ;QACR,eAAe;QACf,YAAY,EAAE,gBAAgB,CAAC,WAAW,CAAC;QAC3C,aAAa,EAAE,gBAAgB,CAAC,YAAY,CAAC;QAC7C,UAAU;KACX,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAqB;IACrD,MAAM,SAAS,GAAI,IAAI,CAAC,EAAE,EAAE,iCAAiC,CAAC,CAAC,GAAG,EAAoB,CAAC,CAAC,CAAC;IACzF,MAAM,SAAS,GAAI,IAAI,CAAC,EAAE,EAAE,iCAAiC,CAAC,CAAC,GAAG,EAAoB,CAAC,CAAC,CAAC;IACzF,MAAM,cAAc,GAAI,IAAI,CAAC,EAAE,EAC7B,oFAAoF,CACrF,CAAC,GAAG,EAAoB,CAAC,CAAC,CAAC;IAC5B,MAAM,SAAS,GAAI,IAAI,CAAC,EAAE,EAAE,sDAAsD,CAAC;SAChF,GAAG,EAAoB,CAAC,CAAC,CAAC;IAE7B,MAAM,eAAe,GAAG,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAEnD,OAAO;QACL,SAAS;QACT,SAAS;QACT,cAAc;QACd,SAAS;QACT,eAAe;KAChB,CAAC;AACJ,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,gBAAgB,CAAC,CAAoB;IACnD,MAAM,EAAE,GAAG,CAAC,CAAC,eAAe,CAAC;IAC7B,MAAM,KAAK,GAAa;QACtB,aAAa;QACb,YAAY,CAAC,CAAC,SAAS,YAAY,CAAC,CAAC,SAAS,kBAAkB,CAAC,CAAC,cAAc,YAAY,CAAC,CAAC,SAAS,EAAE;QACzG,qBAAqB,EAAE,CAAC,UAAU,SAAS;QAC3C,6BAA6B,EAAE,CAAC,QAAQ,IAAI,EAAE,CAAC,QAAQ,IAAI,EAAE,CAAC,QAAQ,IAAI,EAAE,CAAC,QAAQ,EAAE;QACvF,2BAA2B,EAAE,CAAC,eAAe,GAAG;QAChD,oBAAoB,EAAE,CAAC,YAAY,CAAC,GAAG,IAAI,EAAE,CAAC,YAAY,CAAC,MAAM,UAAU,EAAE,CAAC,YAAY,CAAC,MAAM,IAAI,EAAE,CAAC,YAAY,CAAC,SAAS,WAAW,EAAE,CAAC,YAAY,CAAC,IAAI,IAAI,EAAE,CAAC,YAAY,CAAC,OAAO,WAAW,EAAE,CAAC,YAAY,CAAC,QAAQ,IAAI,EAAE,CAAC,YAAY,CAAC,WAAW,IAAI;QAC9P,qBAAqB,EAAE,CAAC,aAAa,CAAC,GAAG,IAAI,EAAE,CAAC,aAAa,CAAC,MAAM,UAAU,EAAE,CAAC,aAAa,CAAC,MAAM,IAAI,EAAE,CAAC,aAAa,CAAC,SAAS,WAAW,EAAE,CAAC,aAAa,CAAC,IAAI,IAAI,EAAE,CAAC,aAAa,CAAC,OAAO,WAAW,EAAE,CAAC,aAAa,CAAC,QAAQ,IAAI,EAAE,CAAC,aAAa,CAAC,WAAW,IAAI;KACxQ,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/src/graph/subgraph.d.ts

@@ -0,0 +1,13 @@
+import type { MonographNode, MonographEdge } from '../types.js';
+import type { MonographDb } from '../storage/db.js';
+export interface InducedSubgraph {
+    nodes: MonographNode[];
+    edges: MonographEdge[];
+}
+export declare function extractInducedSubgraph(db: MonographDb, nodeIds: string[]): InducedSubgraph;
+/**
+ * Format an InducedSubgraph as structured text for LLM consumption.
+ * Groups nodes by file path and lists edges with relation + file:line hints.
+ */
+export declare function formatInducedSubgraph(sg: InducedSubgraph): string;
+//# sourceMappingURL=subgraph.d.ts.map

package/dist/src/graph/subgraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph.d.ts","sourceRoot":"","sources":["../../../src/graph/subgraph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAChE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,KAAK,EAAE,aAAa,EAAE,CAAC;CACxB;AAwDD,wBAAgB,sBAAsB,CAAC,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,eAAe,CA6D1F;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,EAAE,EAAE,eAAe,GAAG,MAAM,CA+BjE"}

package/dist/src/graph/subgraph.js

@@ -0,0 +1,123 @@
+/**
+ * Extract the induced subgraph for the given set of node ids.
+ *
+ * The induced subgraph contains:
+ * - Only the nodes whose ids are in `nodeIds` (and exist in the DB)
+ * - Only the edges where both source and target are in `nodeIds`
+ *
+ * @param db - The MonographDb instance
+ * @param nodeIds - The subset of node ids to include
+ * @returns An object with `nodes` and `edges` arrays
+ */
+// SQLite SQLITE_MAX_VARIABLE_NUMBER limit (32766). Edge query binds nodeIds once
+// (source_id IN chunk), then filters target in-memory — full limit available per chunk.
+const SQLITE_VAR_LIMIT = 32766;
+/** Cache of placeholder strings keyed by count: 1 → "?", 2 → "?,?", etc. */
+const placeholderCache = new Map();
+function placeholders(n) {
+    let ph = placeholderCache.get(n);
+    if (!ph) {
+        ph = Array(n).fill('?').join(',');
+        placeholderCache.set(n, ph);
+    }
+    return ph;
+}
+/**
+ * Prepared-statement caches per db instance — stored on the db object to avoid
+ * cross-db pollution while ensuring each unique chunk size is prepared at most once.
+ */
+function getStmtCaches(db) {
+    const key = '__subgraphStmtCache__';
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    const dbAny = db;
+    if (!dbAny[key]) {
+        dbAny[key] = { nodes: new Map(), edges: new Map() };
+    }
+    return dbAny[key];
+}
+export function extractInducedSubgraph(db, nodeIds) {
+    if (nodeIds.length === 0)
+        return { nodes: [], edges: [] };
+    const stmts = getStmtCaches(db);
+    // Chunk helper — caches prepared statements by chunk size to avoid re-prepare per call.
+    function queryChunked(ids, chunkSize, stmtCache, sql) {
+        const results = [];
+        for (let i = 0; i < ids.length; i += chunkSize) {
+            const chunk = ids.slice(i, i + chunkSize);
+            const ph = placeholders(chunk.length);
+            let stmt = stmtCache.get(chunk.length);
+            if (!stmt) {
+                stmt = db.prepare(sql(ph));
+                stmtCache.set(chunk.length, stmt);
+            }
+            results.push(...stmt.all(...chunk));
+        }
+        return results;
+    }
+    const rawNodes = queryChunked(nodeIds, SQLITE_VAR_LIMIT, stmts.nodes, ph => `SELECT id, label, name, file_path, start_line, end_line, community_id, is_exported, language, properties FROM nodes WHERE id IN (${ph})`);
+    // For edges: query by source_id chunks (1 bind per row), then filter target in-memory.
+    const nodeSet = new Set(nodeIds);
+    const allSourceEdges = queryChunked(nodeIds, SQLITE_VAR_LIMIT, stmts.edges, 
+    // Drop unused 'evidence' column to reduce row data transfer
+    ph => `SELECT id, source_id, target_id, relation, confidence, confidence_score, reason FROM edges WHERE source_id IN (${ph})`);
+    const rawEdges = allSourceEdges.filter(e => nodeSet.has(e.target_id));
+    const nodes = rawNodes.map(n => ({
+        id: n.id,
+        label: n.label,
+        name: n.name,
+        normLabel: (n.norm_label ?? n.name ?? '').toLowerCase(),
+        filePath: n.file_path ?? undefined,
+        startLine: n.start_line ?? undefined,
+        endLine: n.end_line ?? undefined,
+        communityId: n.community_id ?? undefined,
+        isExported: n.is_exported === 1,
+        language: n.language ?? undefined,
+        properties: n.properties ? JSON.parse(n.properties) : undefined,
+    }));
+    const edges = rawEdges.map(e => ({
+        id: e.id,
+        sourceId: e.source_id,
+        targetId: e.target_id,
+        relation: e.relation,
+        confidence: e.confidence,
+        confidenceScore: e.confidence_score,
+        reason: e.reason ?? undefined,
+    }));
+    return { nodes, edges };
+}
+/**
+ * Format an InducedSubgraph as structured text for LLM consumption.
+ * Groups nodes by file path and lists edges with relation + file:line hints.
+ */
+export function formatInducedSubgraph(sg) {
+    if (sg.nodes.length === 0)
+        return 'Subgraph is empty.';
+    const lines = [`Subgraph: ${sg.nodes.length} nodes, ${sg.edges.length} edges`];
+    // Group nodes by file
+    const byFile = new Map();
+    for (const n of sg.nodes) {
+        const file = n.filePath ?? '(unknown)';
+        let list = byFile.get(file);
+        if (!list) {
+            list = [];
+            byFile.set(file, list);
+        }
+        list.push(n);
+    }
+    lines.push('\nNodes:');
+    for (const [file, nodes] of byFile) {
+        lines.push(`  ${file}`);
+        for (const n of nodes) {
+            const loc = n.startLine ? `:${n.startLine}` : '';
+            lines.push(`    ${n.label} ${n.name}${loc}`);
+        }
+    }
+    if (sg.edges.length > 0) {
+        lines.push('\nEdges:');
+        for (const e of sg.edges) {
+            lines.push(`  ${e.sourceId} --[${e.relation}]--> ${e.targetId}`);
+        }
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=subgraph.js.map

package/dist/src/graph/subgraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph.js","sourceRoot":"","sources":["../../../src/graph/subgraph.ts"],"names":[],"mappings":"AAQA;;;;;;;;;;GAUG;AACH,iFAAiF;AACjF,wFAAwF;AACxF,MAAM,gBAAgB,GAAG,KAAK,CAAC;AAE/B,4EAA4E;AAC5E,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;AACnD,SAAS,YAAY,CAAC,CAAS;IAC7B,IAAI,EAAE,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjC,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClC,gBAAgB,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAaD;;;GAGG;AACH,SAAS,aAAa,CAAC,EAAe;IAIpC,MAAM,GAAG,GAAG,uBAAuB,CAAC;IACpC,8DAA8D;IAC9D,MAAM,KAAK,GAAG,EAAS,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;IACtD,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAuH,CAAC;AAC1I,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,EAAe,EAAE,OAAiB;IACvE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAE1D,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;IAEhC,wFAAwF;IACxF,SAAS,YAAY,CAAI,GAAa,EAAE,SAAiB,EAAE,SAA0D,EAAE,GAA2B;QAChJ,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;YAC1C,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACtC,IAAI,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACvC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAAC,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAAC,CAAC;YAC7E,OAAO,CAAC,IAAI,CAAC,GAAI,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAS,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,QAAQ,GAAG,YAAY,CAC3B,OAAO,EACP,gBAAgB,EAChB,KAAK,CAAC,KAAK,EACX,EAAE,CAAC,EAAE,CAAC,oIAAoI,EAAE,GAAG,CAChJ,CAAC;IAEF,uFAAuF;IACvF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IACjC,MAAM,cAAc,GAAG,YAAY,CACjC,OAAO,EACP,gBAAgB,EAChB,KAAK,CAAC,KAAK;IACX,4DAA4D;IAC5D,EAAE,CAAC,EAAE,CAAC,kHAAkH,EAAE,GAAG,CAC9H,CAAC;IACF,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAEtE,MAAM,KAAK,GAAoB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,KAAK,EAAE,CAAC,CAAC,KAA+B;QACxC,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE;QACvD,QAAQ,EAAE,CAAC,CAAC,SAAS,IAAI,SAAS;QAClC,SAAS,EAAE,CAAC,CAAC,UAAU,IAAI,SAAS;QACpC,OAAO,EAAE,CAAC,CAAC,QAAQ,IAAI,SAAS;QAChC,WAAW,EAAE,CAAC,CAAC,YAAY,IAAI,SAAS;QACxC,UAAU,EAAE,CAAC,CAAC,WAAW,KAAK,CAAC;QAC/B,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,SAAS;QACjC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAA6B,CAAC,CAAC,CAAC,SAAS;KAC7F,CAAC,CAAC,CAAC;IAEJ,MAAM,KAAK,GAAoB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAChD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,QAAQ,EAAE,CAAC,CAAC,SAAS;QACrB,QAAQ,EAAE,CAAC,CAAC,SAAS;QACrB,QAAQ,EAAE,CAAC,CAAC,QAAqC;QACjD,UAAU,EAAE,CAAC,CAAC,UAAyC;QACvD,eAAe,EAAE,CAAC,CAAC,gBAAgB;QACnC,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,SAAS;KAC9B,CAAC,CAAC,CAAC;IAEJ,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,EAAmB;IACvD,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,oBAAoB,CAAC;IAEvD,MAAM,KAAK,GAAa,CAAC,aAAa,EAAE,CAAC,KAAK,CAAC,MAAM,WAAW,EAAE,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;IAEzF,sBAAsB;IACtB,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,IAAI,WAAW,CAAC;QACvC,IAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;YAAC,IAAI,GAAG,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,OAAO,CAAC,CAAC,QAAQ,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;QACnE,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/src/graph/topo-sort.d.ts

@@ -0,0 +1,36 @@
+import type { MonographDb } from '../storage/db.js';
+export interface TopoSortResult {
+    /** Groups of nodes that can be processed independently at each level.
+     *  Level 0 = leaves (nodes with no outgoing IMPORTS edges on the reverse graph).
+     *  Higher levels depend on previous levels. Cycle nodes are appended last. */
+    levels: string[][];
+    /** Number of nodes that are part of a cycle and could not be sorted. */
+    cycleCount: number;
+}
+/**
+ * Topological level sort using Kahn's algorithm on the *reverse* import graph.
+ *
+ * In the reverse graph, an edge A→B in the original (A imports B) becomes B→A.
+ * Files with no incoming edges on the reverse graph (i.e., no one imports them)
+ * are leaves and appear in level 0.
+ *
+ * The in-degree computation is pushed into SQL (GROUP BY aggregation) to avoid
+ * materialising the full edge table into JavaScript memory.
+ *
+ * @param db - The MonographDb instance
+ * @returns Object with `levels` (array of independent groups, leaf-first) and `cycleCount`.
+ */
+export declare function topologicalLevelSort(db: MonographDb): TopoSortResult;
+/**
+ * Format topological sort levels as structured text.
+ *
+ * Resolves node IDs to names and file paths so LLMs can navigate directly
+ * to the source. Cycle nodes (if any) are clearly labelled.
+ *
+ * @param db - The MonographDb instance (for name resolution)
+ * @param result - Result from topologicalLevelSort()
+ * @param maxLevels - Max levels to include in output (default: all)
+ * @returns Structured text suitable for injection into LLM context
+ */
+export declare function formatTopoSort(db: MonographDb, result: TopoSortResult, maxLevels?: number): string;
+//# sourceMappingURL=topo-sort.d.ts.map

package/dist/src/graph/topo-sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topo-sort.d.ts","sourceRoot":"","sources":["../../../src/graph/topo-sort.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD,MAAM,WAAW,cAAc;IAC7B;;kFAE8E;IAC9E,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;IACnB,wEAAwE;IACxE,UAAU,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,WAAW,GAAG,cAAc,CAyEpE;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAC5B,EAAE,EAAE,WAAW,EACf,MAAM,EAAE,cAAc,EACtB,SAAS,CAAC,EAAE,MAAM,GACjB,MAAM,CAoDR"}

package/dist/src/graph/topo-sort.js

@@ -0,0 +1,140 @@
+/**
+ * Topological level sort using Kahn's algorithm on the *reverse* import graph.
+ *
+ * In the reverse graph, an edge A→B in the original (A imports B) becomes B→A.
+ * Files with no incoming edges on the reverse graph (i.e., no one imports them)
+ * are leaves and appear in level 0.
+ *
+ * The in-degree computation is pushed into SQL (GROUP BY aggregation) to avoid
+ * materialising the full edge table into JavaScript memory.
+ *
+ * @param db - The MonographDb instance
+ * @returns Object with `levels` (array of independent groups, leaf-first) and `cycleCount`.
+ */
+export function topologicalLevelSort(db) {
+    const nodeRows = db.prepare('SELECT id FROM nodes').all();
+    if (nodeRows.length === 0)
+        return { levels: [], cycleCount: 0 };
+    const nodes = nodeRows.map(r => r.id);
+    // Compute in-degree (on the reverse graph) via SQL aggregation.
+    // In the original graph each edge src→tgt means "src imports tgt".
+    // In the reverse graph the edge becomes tgt→src, so src gains in-degree +1.
+    // We aggregate target_id counts grouped by source_id to get reverse-in-degree per node.
+    const inDegreeRows = db
+        .prepare(`SELECT source_id AS node_id, COUNT(*) AS cnt
+       FROM edges
+       WHERE source_id != target_id
+       GROUP BY source_id`)
+        .all();
+    const inDegree = new Map();
+    for (const n of nodes)
+        inDegree.set(n, 0);
+    for (const { node_id, cnt } of inDegreeRows) {
+        if (inDegree.has(node_id))
+            inDegree.set(node_id, cnt);
+    }
+    // Build reverse adjacency list — still needed for Kahn's BFS relaxation step.
+    // Fetch only what Kahn needs: target_id → [source_id, ...] (reverse direction).
+    const reverseAdj = new Map();
+    for (const n of nodes)
+        reverseAdj.set(n, []);
+    const edgeRows = db
+        .prepare('SELECT source_id, target_id FROM edges WHERE source_id != target_id')
+        .all();
+    for (const { source_id: src, target_id: tgt } of edgeRows) {
+        if (!reverseAdj.has(tgt) || !reverseAdj.has(src))
+            continue;
+        reverseAdj.get(tgt).push(src);
+    }
+    // Kahn's BFS on the reverse graph
+    const queue = [];
+    for (const [node, deg] of inDegree) {
+        if (deg === 0)
+            queue.push(node);
+    }
+    const levels = [];
+    const visited = new Set();
+    while (queue.length > 0) {
+        const level = [...queue];
+        queue.length = 0;
+        levels.push(level);
+        for (const node of level) {
+            visited.add(node);
+            for (const neighbor of reverseAdj.get(node) ?? []) {
+                if (visited.has(neighbor))
+                    continue;
+                const newDeg = (inDegree.get(neighbor) ?? 0) - 1;
+                inDegree.set(neighbor, newDeg);
+                if (newDeg === 0)
+                    queue.push(neighbor);
+            }
+        }
+    }
+    // Remaining unvisited nodes are in cycles
+    const cycleNodes = nodes.filter(n => !visited.has(n));
+    let cycleCount = 0;
+    if (cycleNodes.length > 0) {
+        cycleCount = cycleNodes.length;
+        levels.push(cycleNodes);
+    }
+    return { levels, cycleCount };
+}
+// ---------------------------------------------------------------------------
+// Structured text formatter for LLM consumption
+// ---------------------------------------------------------------------------
+/**
+ * Format topological sort levels as structured text.
+ *
+ * Resolves node IDs to names and file paths so LLMs can navigate directly
+ * to the source. Cycle nodes (if any) are clearly labelled.
+ *
+ * @param db - The MonographDb instance (for name resolution)
+ * @param result - Result from topologicalLevelSort()
+ * @param maxLevels - Max levels to include in output (default: all)
+ * @returns Structured text suitable for injection into LLM context
+ */
+export function formatTopoSort(db, result, maxLevels) {
+    if (result.levels.length === 0) {
+        return 'Topological sort: no nodes found.';
+    }
+    // Batch-resolve all node IDs
+    const allIds = result.levels.flat();
+    const CHUNK = 200;
+    const nodeInfo = new Map();
+    for (let i = 0; i < allIds.length; i += CHUNK) {
+        const chunk = allIds.slice(i, i + CHUNK);
+        const ph = chunk.map(() => '?').join(',');
+        const rows = db
+            .prepare(`SELECT id, name, file_path FROM nodes WHERE id IN (${ph})`)
+            .all(...chunk);
+        for (const row of rows) {
+            nodeInfo.set(row.id, { name: row.name ?? row.id, filePath: row.file_path });
+        }
+    }
+    const isCycleLevelIdx = result.cycleCount > 0 && result.levels.length > 0
+        ? result.levels.length - 1
+        : -1;
+    const displayLevels = maxLevels !== undefined ? result.levels.slice(0, maxLevels) : result.levels;
+    const lines = [
+        `Topological sort: ${result.levels.length - (result.cycleCount > 0 ? 1 : 0)} level${result.levels.length === 1 ? '' : 's'}` +
+            (result.cycleCount > 0 ? `, ${result.cycleCount} node${result.cycleCount === 1 ? '' : 's'} in cycles` : ''),
+        '',
+    ];
+    for (let li = 0; li < displayLevels.length; li++) {
+        const level = displayLevels[li];
+        const label = li === isCycleLevelIdx ? 'Cycle nodes (unresolvable order)' : `Level ${li}`;
+        lines.push(`${label} (${level.length} node${level.length === 1 ? '' : 's'}):`);
+        for (const id of level) {
+            const info = nodeInfo.get(id);
+            const name = info?.name ?? id;
+            const fp = info?.filePath;
+            lines.push(`  ${name}${fp ? ` — ${fp}` : ''}`);
+        }
+        lines.push('');
+    }
+    if (maxLevels !== undefined && result.levels.length > maxLevels) {
+        lines.push(`... (${result.levels.length - maxLevels} more level${result.levels.length - maxLevels === 1 ? '' : 's'} omitted)`);
+    }
+    return lines.join('\n').trimEnd();
+}
+//# sourceMappingURL=topo-sort.js.map

package/dist/src/graph/topo-sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topo-sort.js","sourceRoot":"","sources":["../../../src/graph/topo-sort.ts"],"names":[],"mappings":"AAWA;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,oBAAoB,CAAC,EAAe;IAClD,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,GAAG,EAAsB,CAAC;IAC9E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IAEhE,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEtC,gEAAgE;IAChE,mEAAmE;IACnE,4EAA4E;IAC5E,wFAAwF;IACxF,MAAM,YAAY,GAAG,EAAE;SACpB,OAAO,CACN;;;0BAGoB,CACrB;SACA,GAAG,EAAwC,CAAC;IAE/C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,KAAK,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,YAAY,EAAE,CAAC;QAC5C,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACxD,CAAC;IAED,8EAA8E;IAC9E,gFAAgF;IAChF,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAE7C,MAAM,QAAQ,GAAG,EAAE;SAChB,OAAO,CAAC,qEAAqE,CAAC;SAC9E,GAAG,EAAgD,CAAC;IAEvD,KAAK,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1D,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC3D,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAED,kCAAkC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;QACnC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACzB,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACjB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEnB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBACpC,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC/B,IAAI,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;AAChC,CAAC;AAED,8EAA8E;AAC9E,gDAAgD;AAChD,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,cAAc,CAC5B,EAAe,EACf,MAAsB,EACtB,SAAkB;IAElB,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,mCAAmC,CAAC;IAC7C,CAAC;IAED,6BAA6B;IAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACpC,MAAM,KAAK,GAAG,GAAG,CAAC;IAClB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqD,CAAC;IAE9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,EAAE;aACZ,OAAO,CAAC,sDAAsD,EAAE,GAAG,CAAC;aACpE,GAAG,CAAC,GAAG,KAAK,CAA6D,CAAC;QAC7E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9E,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GACnB,MAAM,CAAC,UAAU,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QAC/C,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QAC1B,CAAC,CAAC,CAAC,CAAC,CAAC;IAET,MAAM,aAAa,GAAG,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;IAElG,MAAM,KAAK,GAAa;QACtB,qBAAqB,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE;YACzH,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,UAAU,QAAQ,MAAM,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7G,EAAE;KACH,CAAC;IAEF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,aAAa,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,EAAE,KAAK,eAAe,CAAC,CAAC,CAAC,kCAAkC,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC;QAC1F,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,KAAK,CAAC,MAAM,QAAQ,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAC/E,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,IAAI,EAAE,QAAQ,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,SAAS,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QAChE,KAAK,CAAC,IAAI,CAAC,QAAQ,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,cAAc,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;IACjI,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;AACpC,CAAC"}

package/dist/src/graph/wcc.d.ts

@@ -0,0 +1,42 @@
+import type { MonographDb } from '../storage/db.js';
+/**
+ * Find all weakly connected components (WCCs) of the graph.
+ *
+ * Treats the directed graph as undirected: an edge A→B connects A and B
+ * regardless of direction. Uses union-find (disjoint-set) for O(α·n) performance.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of components; each component is an array of node ids.
+ *          Sorted so the largest component comes first.
+ */
+export declare function weaklyConnectedComponents(db: MonographDb): string[][];
+export interface WccStats {
+    /** Total number of weakly connected components */
+    componentCount: number;
+    /** Size of the largest component */
+    largestSize: number;
+    /** Size of the smallest component */
+    smallestSize: number;
+    /** Mean component size */
+    meanSize: number;
+    /** Number of isolated nodes (component size = 1) */
+    isolatedNodeCount: number;
+}
+/**
+ * Lightweight summary statistics for all WCCs.
+ * Does not materialise component arrays — returns aggregate numbers only.
+ */
+export declare function wccStats(db: MonographDb): WccStats;
+/**
+ * Format WCC results as structured text for LLM consumption.
+ *
+ * Resolves node IDs to names and file paths for the top-N largest components.
+ * Small/isolated components are summarised in aggregate to avoid token waste.
+ *
+ * @param db - The MonographDb instance (for name resolution)
+ * @param components - Result of weaklyConnectedComponents()
+ * @param topN - Number of largest components to detail (default: 5)
+ * @returns Structured text string suitable for LLM context injection
+ */
+export declare function formatWcc(db: MonographDb, components: string[][], topN?: number): string;
+//# sourceMappingURL=wcc.d.ts.map

package/dist/src/graph/wcc.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"wcc.d.ts","sourceRoot":"","sources":["../../../src/graph/wcc.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpD;;;;;;;;;GASG;AACH,wBAAgB,yBAAyB,CAAC,EAAE,EAAE,WAAW,GAAG,MAAM,EAAE,EAAE,CAmBrE;AAMD,MAAM,WAAW,QAAQ;IACvB,kDAAkD;IAClD,cAAc,EAAE,MAAM,CAAC;IACvB,oCAAoC;IACpC,WAAW,EAAE,MAAM,CAAC;IACpB,qCAAqC;IACrC,YAAY,EAAE,MAAM,CAAC;IACrB,0BAA0B;IAC1B,QAAQ,EAAE,MAAM,CAAC;IACjB,oDAAoD;IACpD,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,EAAE,EAAE,WAAW,GAAG,QAAQ,CAelD;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,SAAI,GAAG,MAAM,CA+CnF"}

package/dist/src/graph/wcc.js

@@ -0,0 +1,156 @@
+/**
+ * Find all weakly connected components (WCCs) of the graph.
+ *
+ * Treats the directed graph as undirected: an edge A→B connects A and B
+ * regardless of direction. Uses union-find (disjoint-set) for O(α·n) performance.
+ *
+ * @param db - The MonographDb instance
+ * @returns Array of components; each component is an array of node ids.
+ *          Sorted so the largest component comes first.
+ */
+export function weaklyConnectedComponents(db) {
+    const nodeRows = db.prepare('SELECT id FROM nodes').all();
+    const edgeRows = db.prepare('SELECT source_id, target_id FROM edges').all();
+    if (nodeRows.length === 0)
+        return [];
+    const nodes = nodeRows.map(r => r.id);
+    const { parent, rank } = buildUnionFind(nodes);
+    for (const { source_id: src, target_id: tgt } of edgeRows) {
+        if (src === tgt)
+            continue;
+        if (!parent.has(src) || !parent.has(tgt))
+            continue;
+        ufUnion(parent, rank, src, tgt);
+    }
+    return groupByRoot(nodes, parent);
+}
+/**
+ * Lightweight summary statistics for all WCCs.
+ * Does not materialise component arrays — returns aggregate numbers only.
+ */
+export function wccStats(db) {
+    const components = weaklyConnectedComponents(db);
+    if (components.length === 0) {
+        return { componentCount: 0, largestSize: 0, smallestSize: 0, meanSize: 0, isolatedNodeCount: 0 };
+    }
+    const sizes = components.map(c => c.length);
+    const total = sizes.reduce((a, b) => a + b, 0);
+    return {
+        componentCount: sizes.length,
+        largestSize: sizes[0], // already sorted descending
+        smallestSize: sizes[sizes.length - 1],
+        meanSize: Math.round((total / sizes.length) * 100) / 100,
+        isolatedNodeCount: sizes.filter(s => s === 1).length,
+    };
+}
+// ---------------------------------------------------------------------------
+// Structured text formatter for LLM consumption
+// ---------------------------------------------------------------------------
+/**
+ * Format WCC results as structured text for LLM consumption.
+ *
+ * Resolves node IDs to names and file paths for the top-N largest components.
+ * Small/isolated components are summarised in aggregate to avoid token waste.
+ *
+ * @param db - The MonographDb instance (for name resolution)
+ * @param components - Result of weaklyConnectedComponents()
+ * @param topN - Number of largest components to detail (default: 5)
+ * @returns Structured text string suitable for LLM context injection
+ */
+export function formatWcc(db, components, topN = 5) {
+    if (components.length === 0) {
+        return 'Weakly connected components: no nodes found.';
+    }
+    const isolatedCount = components.filter(c => c.length === 1).length;
+    const nonTrivial = components.filter(c => c.length > 1);
+    const display = nonTrivial.slice(0, topN);
+    // Batch-resolve all node IDs in the displayed components
+    const allIds = display.flat();
+    const CHUNK = 200;
+    const nodeInfo = new Map();
+    for (let i = 0; i < allIds.length; i += CHUNK) {
+        const chunk = allIds.slice(i, i + CHUNK);
+        const ph = chunk.map(() => '?').join(',');
+        const rows = db
+            .prepare(`SELECT id, name, file_path FROM nodes WHERE id IN (${ph})`)
+            .all(...chunk);
+        for (const row of rows)
+            nodeInfo.set(row.id, { name: row.name ?? row.id, filePath: row.file_path });
+    }
+    const lines = [
+        `Weakly connected components: ${components.length} total` +
+            (isolatedCount > 0 ? ` (${isolatedCount} isolated node${isolatedCount === 1 ? '' : 's'})` : ''),
+        '',
+    ];
+    for (let ci = 0; ci < display.length; ci++) {
+        const comp = display[ci];
+        lines.push(`Component ${ci + 1} (${comp.length} nodes):`);
+        for (const id of comp) {
+            const info = nodeInfo.get(id);
+            const name = info?.name ?? id;
+            const fp = info?.filePath;
+            lines.push(`  ${name}${fp ? ` — ${fp}` : ''}`);
+        }
+        if (ci < display.length - 1)
+            lines.push('');
+    }
+    if (nonTrivial.length > topN) {
+        lines.push('');
+        lines.push(`... (${nonTrivial.length - topN} more non-trivial component${nonTrivial.length - topN === 1 ? '' : 's'} omitted)`);
+    }
+    return lines.join('\n');
+}
+// ---------------------------------------------------------------------------
+// Internal union-find helpers
+// ---------------------------------------------------------------------------
+function buildUnionFind(nodes) {
+    const parent = new Map();
+    const rank = new Map();
+    for (const n of nodes) {
+        parent.set(n, n);
+        rank.set(n, 0);
+    }
+    return { parent, rank };
+}
+function ufFind(parent, x) {
+    let root = x;
+    while (parent.get(root) !== root)
+        root = parent.get(root);
+    // Path compression
+    let cur = x;
+    while (cur !== root) {
+        const next = parent.get(cur);
+        parent.set(cur, root);
+        cur = next;
+    }
+    return root;
+}
+function ufUnion(parent, rank, a, b) {
+    const ra = ufFind(parent, a);
+    const rb = ufFind(parent, b);
+    if (ra === rb)
+        return;
+    const rankA = rank.get(ra) ?? 0;
+    const rankB = rank.get(rb) ?? 0;
+    if (rankA < rankB) {
+        parent.set(ra, rb);
+    }
+    else if (rankA > rankB) {
+        parent.set(rb, ra);
+    }
+    else {
+        parent.set(rb, ra);
+        rank.set(ra, rankA + 1);
+    }
+}
+function groupByRoot(nodes, parent) {
+    const components = new Map();
+    for (const n of nodes) {
+        const root = ufFind(parent, n);
+        if (!components.has(root))
+            components.set(root, []);
+        components.get(root).push(n);
+    }
+    return [...components.values()].sort((a, b) => b.length - a.length);
+}
+//# sourceMappingURL=wcc.js.map

package/dist/src/graph/wcc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wcc.js","sourceRoot":"","sources":["../../../src/graph/wcc.ts"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,MAAM,UAAU,yBAAyB,CAAC,EAAe;IACvD,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,GAAG,EAAsB,CAAC;IAC9E,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC,GAAG,EAGtE,CAAC;IAEJ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAErC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAE/C,KAAK,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC1D,IAAI,GAAG,KAAK,GAAG;YAAE,SAAS;QAC1B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACnD,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACpC,CAAC;AAmBD;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,EAAe;IACtC,MAAM,UAAU,GAAG,yBAAyB,CAAC,EAAE,CAAC,CAAC;IACjD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,iBAAiB,EAAE,CAAC,EAAE,CAAC;IACnG,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,OAAO;QACL,cAAc,EAAE,KAAK,CAAC,MAAM;QAC5B,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,4BAA4B;QACnD,YAAY,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACrC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG;QACxD,iBAAiB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM;KACrD,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,gDAAgD;AAChD,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,EAAe,EAAE,UAAsB,EAAE,IAAI,GAAG,CAAC;IACzE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,8CAA8C,CAAC;IACxD,CAAC;IAED,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;IACpE,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAE1C,yDAAyD;IACzD,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,GAAG,CAAC;IAClB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqD,CAAC;IAE9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,EAAE;aACZ,OAAO,CAAC,sDAAsD,EAAE,GAAG,CAAC;aACpE,GAAG,CAAC,GAAG,KAAK,CAA6D,CAAC;QAC7E,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;IACtG,CAAC;IAED,MAAM,KAAK,GAAa;QACtB,gCAAgC,UAAU,CAAC,MAAM,QAAQ;YACvD,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,aAAa,iBAAiB,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACjG,EAAE;KACH,CAAC;IAEF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,IAAI,CAAC,MAAM,UAAU,CAAC,CAAC;QAC1D,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,IAAI,EAAE,QAAQ,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,QAAQ,UAAU,CAAC,MAAM,GAAG,IAAI,8BAA8B,UAAU,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;IACjI,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,8EAA8E;AAC9E,8BAA8B;AAC9B,8EAA8E;AAE9E,SAAS,cAAc,CAAC,KAAe;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAC1B,CAAC;AAED,SAAS,MAAM,CAAC,MAA2B,EAAE,CAAS;IACpD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI;QAAE,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;IAC3D,mBAAmB;IACnB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACtB,GAAG,GAAG,IAAI,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,OAAO,CAAC,MAA2B,EAAE,IAAyB,EAAE,CAAS,EAAE,CAAS;IAC3F,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7B,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7B,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO;IACtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;QAClB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACrB,CAAC;SAAM,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACrB,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC1B,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,KAAe,EAAE,MAA2B;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACpD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACtE,CAAC"}

package/dist/src/groups/contract-bridge.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Contract Bridge Detection
+ *
+ * Finds shared type definitions (Interface, Type, Class) that appear across
+ * multiple repos in a group — these are potential contract bridges.
+ */
+import type { GroupConfig } from './group-config.js';
+export interface ContractBridge {
+    /** Shared type name */
+    name: string;
+    /** Repo names that define this type */
+    repos: string[];
+    /** Node labels (Interface, Type, Class, etc.) */
+    labels: string[];
+}
+/**
+ * Detect contract bridges: type names shared across >= 2 repos.
+ * Results sorted by number of repos descending.
+ *
+ * @param groupConfig - Parsed group configuration
+ * @returns List of ContractBridge entries
+ */
+export declare function detectContractBridges(groupConfig: GroupConfig): Promise<ContractBridge[]>;
+//# sourceMappingURL=contract-bridge.d.ts.map

package/dist/src/groups/contract-bridge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"contract-bridge.d.ts","sourceRoot":"","sources":["../../../src/groups/contract-bridge.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAErD,MAAM,WAAW,cAAc;IAC7B,uBAAuB;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,uCAAuC;IACvC,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,iDAAiD;IACjD,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAmCD;;;;;;GAMG;AACH,wBAAsB,qBAAqB,CACzC,WAAW,EAAE,WAAW,GACvB,OAAO,CAAC,cAAc,EAAE,CAAC,CAuC3B"}