agentic-qe 3.6.19 → 3.7.0

package/v3/dist/domains/test-execution/services/mincut-test-optimizer.js

@@ -0,0 +1,358 @@
+/**
+ * MinCut-Based Test Suite Optimization
+ * Task 2.3: RVF Integration Plan
+ *
+ * Uses mincut analysis to identify the minimum set of tests that provide
+ * maximum coverage assurance. Models the test suite as a bipartite graph
+ * (tests and source files as vertices, coverage as edges) and computes
+ * the minimum cut to find the critical test boundary.
+ *
+ * Algorithm:
+ * 1. Build bipartite graph: test nodes <-> source file nodes
+ * 2. Edge capacity = 1 / (number of tests covering that file) — rarer coverage is more valuable
+ * 3. Compute mincut via MinCutCalculator (weighted-degree heuristic)
+ * 4. Tests on the source side of the cut are critical
+ * 5. Remaining tests are skippable (their coverage is redundant)
+ * 6. Execution order: critical tests first, sorted by coverage breadth
+ *
+ * @module domains/test-execution/services/mincut-test-optimizer
+ */
+import { MinCutCalculator } from '../../../coordination/mincut/mincut-calculator.js';
+import { SwarmGraph } from '../../../coordination/mincut/swarm-graph.js';
+// ============================================================================
+// Implementation
+// ============================================================================
+/**
+ * Default implementation of MinCutTestOptimizer.
+ *
+ * Builds a bipartite graph from test nodes and their covered source files,
+ * then uses mincut analysis to partition tests into critical vs skippable.
+ */
+export class MinCutTestOptimizerImpl {
+    calculator;
+    constructor(calculator) {
+        this.calculator = calculator ?? new MinCutCalculator();
+    }
+    /**
+     * Optimize a test suite using mincut analysis.
+     *
+     * @param tests - The test nodes to analyze
+     * @param coverageThreshold - Minimum fraction of files that must remain covered (0-1, default 1.0)
+     * @returns Optimization result with critical/skippable partitioning
+     */
+    optimize(tests, coverageThreshold = 1.0) {
+        // Edge case: empty test suite
+        if (tests.length === 0) {
+            return this.emptyResult();
+        }
+        // Edge case: single test is always critical
+        if (tests.length === 1) {
+            return this.singleTestResult(tests[0]);
+        }
+        // Build the bipartite coverage graph
+        const { graph, testIds, fileIds, edgeCount } = this.buildCoverageGraph(tests);
+        // Compute mincut
+        const mincutResult = this.calculator.approxMinCut(graph);
+        const stats = graph.getStats();
+        // Classify tests based on mincut partitioning
+        const sourceSideSet = new Set(mincutResult.sourceSide);
+        // Identify which tests are on the source side (critical boundary)
+        // and which are on the target side (potentially skippable)
+        const criticalFromCut = new Set();
+        const skippableFromCut = new Set();
+        for (const testId of testIds) {
+            if (sourceSideSet.has(testId)) {
+                criticalFromCut.add(testId);
+            }
+            else {
+                skippableFromCut.add(testId);
+            }
+        }
+        // Build file-to-tests coverage map for redundancy analysis
+        const fileCoverage = this.buildFileCoverageMap(tests);
+        const allCoveredFiles = new Set(fileCoverage.keys());
+        // Ensure tests with unique coverage are always critical
+        // A test is uniquely critical if it covers a file no other test covers
+        const uniquelyCritical = this.findUniquelyCriticalTests(tests, fileCoverage);
+        for (const testId of uniquelyCritical) {
+            criticalFromCut.add(testId);
+            skippableFromCut.delete(testId);
+        }
+        // Verify coverage threshold: ensure skipping tests doesn't drop coverage below threshold
+        const criticalTests = new Set(criticalFromCut);
+        const skippableTests = new Set(skippableFromCut);
+        if (coverageThreshold < 1.0) {
+            // Allow dropping some coverage
+            const requiredFileCount = Math.ceil(allCoveredFiles.size * coverageThreshold);
+            const criticalCoveredFiles = this.computeCoveredFiles(tests, criticalTests);
+            if (criticalCoveredFiles.size < requiredFileCount) {
+                // Promote skippable tests to critical until threshold is met
+                this.promoteToCritical(tests, criticalTests, skippableTests, requiredFileCount);
+            }
+        }
+        else {
+            // Full coverage required: promote any test whose removal would lose a file
+            this.ensureFullCoverage(tests, criticalTests, skippableTests, fileCoverage);
+        }
+        // Build execution order: critical first (sorted by coverage breadth desc), then skippable
+        const executionOrder = this.buildExecutionOrder(tests, criticalTests, skippableTests);
+        // Calculate time savings
+        const testMap = new Map(tests.map(t => [t.testId, t]));
+        const estimatedTimeSavingsMs = Array.from(skippableTests)
+            .reduce((sum, id) => sum + (testMap.get(id)?.estimatedDurationMs ?? 0), 0);
+        return {
+            criticalTests: Array.from(criticalTests),
+            skippableTests: Array.from(skippableTests),
+            executionOrder,
+            estimatedTimeSavingsMs,
+            graphStats: {
+                testCount: tests.length,
+                coverageEdges: edgeCount,
+                mincutValue: mincutResult.value,
+                connectedComponents: stats.componentCount,
+            },
+        };
+    }
+    // ==========================================================================
+    // Graph Construction
+    // ==========================================================================
+    /**
+     * Build a bipartite graph from test nodes and their covered files.
+     *
+     * Test nodes and file nodes are vertices. Edges connect tests to the
+     * files they cover, weighted inversely by the number of tests covering
+     * that file (rarer coverage = higher weight = more valuable).
+     */
+    buildCoverageGraph(tests) {
+        const graph = new SwarmGraph();
+        const testIds = [];
+        const fileIdSet = new Set();
+        // Count how many tests cover each file (for weight calculation)
+        const fileCoverCount = new Map();
+        for (const test of tests) {
+            for (const file of test.coveredFiles) {
+                fileCoverCount.set(file, (fileCoverCount.get(file) ?? 0) + 1);
+            }
+        }
+        // Add test vertices
+        for (const test of tests) {
+            const vertex = {
+                id: test.testId,
+                type: 'agent',
+                weight: test.coveredFiles.length,
+                createdAt: new Date(),
+                metadata: { nodeType: 'test', testFile: test.testFile },
+            };
+            graph.addVertex(vertex);
+            testIds.push(test.testId);
+        }
+        // Add file vertices
+        for (const [file] of fileCoverCount) {
+            const fileId = `file:${file}`;
+            const vertex = {
+                id: fileId,
+                type: 'domain',
+                weight: 1.0,
+                createdAt: new Date(),
+                metadata: { nodeType: 'file', filePath: file },
+            };
+            graph.addVertex(vertex);
+            fileIdSet.add(fileId);
+        }
+        // Add edges from tests to files
+        let edgeCount = 0;
+        for (const test of tests) {
+            for (const file of test.coveredFiles) {
+                const fileId = `file:${file}`;
+                const coverCount = fileCoverCount.get(file) ?? 1;
+                // Weight: rarer coverage is more valuable
+                const weight = 1.0 / coverCount;
+                const edge = {
+                    source: test.testId,
+                    target: fileId,
+                    weight,
+                    type: 'coordination',
+                    bidirectional: true,
+                };
+                graph.addEdge(edge);
+                edgeCount++;
+            }
+        }
+        return {
+            graph,
+            testIds,
+            fileIds: Array.from(fileIdSet),
+            edgeCount,
+        };
+    }
+    // ==========================================================================
+    // Coverage Analysis
+    // ==========================================================================
+    /**
+     * Build a map from source file -> set of test IDs that cover it.
+     */
+    buildFileCoverageMap(tests) {
+        const map = new Map();
+        for (const test of tests) {
+            for (const file of test.coveredFiles) {
+                let testSet = map.get(file);
+                if (!testSet) {
+                    testSet = new Set();
+                    map.set(file, testSet);
+                }
+                testSet.add(test.testId);
+            }
+        }
+        return map;
+    }
+    /**
+     * Find tests that are the sole provider of coverage for at least one file.
+     * These tests are always critical regardless of mincut partitioning.
+     */
+    findUniquelyCriticalTests(tests, fileCoverage) {
+        const uniquelyCritical = new Set();
+        for (const [, testSet] of fileCoverage) {
+            if (testSet.size === 1) {
+                // Only one test covers this file; it is uniquely critical
+                const [testId] = testSet;
+                uniquelyCritical.add(testId);
+            }
+        }
+        return uniquelyCritical;
+    }
+    /**
+     * Compute the set of files covered by a given set of test IDs.
+     */
+    computeCoveredFiles(tests, testIds) {
+        const covered = new Set();
+        for (const test of tests) {
+            if (testIds.has(test.testId)) {
+                for (const file of test.coveredFiles) {
+                    covered.add(file);
+                }
+            }
+        }
+        return covered;
+    }
+    /**
+     * Promote skippable tests to critical until the required file count is met.
+     * Greedy: pick the skippable test that adds the most new coverage each step.
+     */
+    promoteToCritical(tests, criticalTests, skippableTests, requiredFileCount) {
+        const covered = this.computeCoveredFiles(tests, criticalTests);
+        const testMap = new Map(tests.map(t => [t.testId, t]));
+        const remaining = Array.from(skippableTests);
+        while (covered.size < requiredFileCount && remaining.length > 0) {
+            // Find the skippable test that adds the most new files
+            let bestIdx = -1;
+            let bestNewCount = 0;
+            for (let i = 0; i < remaining.length; i++) {
+                const test = testMap.get(remaining[i]);
+                if (!test)
+                    continue;
+                const newCount = test.coveredFiles.filter(f => !covered.has(f)).length;
+                if (newCount > bestNewCount) {
+                    bestNewCount = newCount;
+                    bestIdx = i;
+                }
+            }
+            if (bestIdx === -1 || bestNewCount === 0)
+                break;
+            const promotedId = remaining[bestIdx];
+            remaining.splice(bestIdx, 1);
+            criticalTests.add(promotedId);
+            skippableTests.delete(promotedId);
+            const promotedTest = testMap.get(promotedId);
+            for (const file of promotedTest.coveredFiles) {
+                covered.add(file);
+            }
+        }
+    }
+    /**
+     * Ensure that skipping the skippable tests does not lose any file coverage.
+     * Promote tests from skippable to critical as needed.
+     */
+    ensureFullCoverage(tests, criticalTests, skippableTests, fileCoverage) {
+        // For each file, check that at least one critical test covers it
+        const criticalCovered = this.computeCoveredFiles(tests, criticalTests);
+        for (const [file, testSet] of fileCoverage) {
+            if (!criticalCovered.has(file)) {
+                // No critical test covers this file; promote one
+                for (const testId of testSet) {
+                    if (skippableTests.has(testId)) {
+                        criticalTests.add(testId);
+                        skippableTests.delete(testId);
+                        // Update covered files
+                        const test = tests.find(t => t.testId === testId);
+                        if (test) {
+                            for (const f of test.coveredFiles) {
+                                criticalCovered.add(f);
+                            }
+                        }
+                        break;
+                    }
+                }
+            }
+        }
+    }
+    // ==========================================================================
+    // Execution Order
+    // ==========================================================================
+    /**
+     * Build optimal execution order:
+     * 1. Critical tests first, sorted by coverage breadth (most files first)
+     * 2. Skippable tests after, sorted by coverage breadth
+     */
+    buildExecutionOrder(tests, criticalTests, skippableTests) {
+        const testMap = new Map(tests.map(t => [t.testId, t]));
+        const byCoverage = (a, b) => {
+            const aCount = testMap.get(a)?.coveredFiles.length ?? 0;
+            const bCount = testMap.get(b)?.coveredFiles.length ?? 0;
+            return bCount - aCount; // descending
+        };
+        const critical = Array.from(criticalTests).sort(byCoverage);
+        const skippable = Array.from(skippableTests).sort(byCoverage);
+        return [...critical, ...skippable];
+    }
+    // ==========================================================================
+    // Edge Case Results
+    // ==========================================================================
+    emptyResult() {
+        return {
+            criticalTests: [],
+            skippableTests: [],
+            executionOrder: [],
+            estimatedTimeSavingsMs: 0,
+            graphStats: {
+                testCount: 0,
+                coverageEdges: 0,
+                mincutValue: 0,
+                connectedComponents: 0,
+            },
+        };
+    }
+    singleTestResult(test) {
+        return {
+            criticalTests: [test.testId],
+            skippableTests: [],
+            executionOrder: [test.testId],
+            estimatedTimeSavingsMs: 0,
+            graphStats: {
+                testCount: 1,
+                coverageEdges: test.coveredFiles.length,
+                mincutValue: 0,
+                connectedComponents: test.coveredFiles.length > 0 ? 1 : 1,
+            },
+        };
+    }
+}
+// ============================================================================
+// Factory
+// ============================================================================
+/**
+ * Create a new MinCutTestOptimizer instance.
+ */
+export function createMinCutTestOptimizer(calculator) {
+    return new MinCutTestOptimizerImpl(calculator);
+}
+//# sourceMappingURL=mincut-test-optimizer.js.map

package/v3/dist/domains/test-execution/services/mincut-test-optimizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mincut-test-optimizer.js","sourceRoot":"","sources":["../../../../src/domains/test-execution/services/mincut-test-optimizer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,mDAAmD,CAAC;AACrF,OAAO,EAAE,UAAU,EAAE,MAAM,6CAA6C,CAAC;AA8CzE,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,OAAO,uBAAuB;IACjB,UAAU,CAAmB;IAE9C,YAAY,UAA6B;QACvC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,IAAI,gBAAgB,EAAE,CAAC;IACzD,CAAC;IAED;;;;;;OAMG;IACH,QAAQ,CAAC,KAA0B,EAAE,oBAA4B,GAAG;QAClE,8BAA8B;QAC9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5B,CAAC;QAED,4CAA4C;QAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,qCAAqC;QACrC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAE9E,iBAAiB;QACjB,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QAE/B,8CAA8C;QAC9C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QAEvD,kEAAkE;QAClE,2DAA2D;QAC3D,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;QAE3C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACN,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACtD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;QAErD,wDAAwD;QACxD,uEAAuE;QACvE,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QAC7E,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;YACtC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC5B,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;QAED,yFAAyF;QACzF,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC;QAC/C,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,gBAAgB,CAAC,CAAC;QAEjD,IAAI,iBAAiB,GAAG,GAAG,EAAE,CAAC;YAC5B,+BAA+B;YAC/B,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,iBAAiB,CAAC,CAAC;YAC9E,MAAM,oBAAoB,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;YAE5E,IAAI,oBAAoB,CAAC,IAAI,GAAG,iBAAiB,EAAE,CAAC;gBAClD,6DAA6D;gBAC7D,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAC;YAClF,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2EAA2E;YAC3E,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;QAC9E,CAAC;QAED,0FAA0F;QAC1F,MAAM,cAAc,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QAEtF,yBAAyB;QACzB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,sBAAsB,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC;aACtD,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,mBAAmB,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE7E,OAAO;YACL,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;YACxC,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC;YAC1C,cAAc;YACd,sBAAsB;YACtB,UAAU,EAAE;gBACV,SAAS,EAAE,KAAK,CAAC,MAAM;gBACvB,aAAa,EAAE,SAAS;gBACxB,WAAW,EAAE,YAAY,CAAC,KAAK;gBAC/B,mBAAmB,EAAE,KAAK,CAAC,cAAc;aAC1C;SACF,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,qBAAqB;IACrB,6EAA6E;IAE7E;;;;;;OAMG;IACK,kBAAkB,CAAC,KAA0B;QAMnD,MAAM,KAAK,GAAG,IAAI,UAAU,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,gEAAgE;QAChE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACrC,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAgB;gBAC1B,EAAE,EAAE,IAAI,CAAC,MAAM;gBACf,IAAI,EAAE,OAAO;gBACb,MAAM,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM;gBAChC,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,QAAQ,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE;aACxD,CAAC;YACF,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;QAED,oBAAoB;QACpB,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,cAAc,EAAE,CAAC;YACpC,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAgB;gBAC1B,EAAE,EAAE,MAAM;gBACV,IAAI,EAAE,QAAQ;gBACd,MAAM,EAAE,GAAG;gBACX,SAAS,EAAE,IAAI,IAAI,EAAE;gBACrB,QAAQ,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE;aAC/C,CAAC;YACF,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACxB,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;QAED,gCAAgC;QAChC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,QAAQ,IAAI,EAAE,CAAC;gBAC9B,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjD,0CAA0C;gBAC1C,MAAM,MAAM,GAAG,GAAG,GAAG,UAAU,CAAC;gBAEhC,MAAM,IAAI,GAAc;oBACtB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,MAAM,EAAE,MAAM;oBACd,MAAM;oBACN,IAAI,EAAE,cAAc;oBACpB,aAAa,EAAE,IAAI;iBACpB,CAAC;gBACF,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACpB,SAAS,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK;YACL,OAAO;YACP,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;YAC9B,SAAS;SACV,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,oBAAoB;IACpB,6EAA6E;IAE7E;;OAEG;IACK,oBAAoB,CAAC,KAA0B;QACrD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACrC,IAAI,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;oBACpB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACzB,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACK,yBAAyB,CAC/B,KAA0B,EAC1B,YAAsC;QAEtC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAC;QAE3C,KAAK,MAAM,CAAC,EAAE,OAAO,CAAC,IAAI,YAAY,EAAE,CAAC;YACvC,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACvB,0DAA0D;gBAC1D,MAAM,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;gBACzB,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,KAA0B,EAC1B,OAAoB;QAEpB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;oBACrC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CACvB,KAA0B,EAC1B,aAA0B,EAC1B,cAA2B,EAC3B,iBAAyB;QAEzB,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAE/D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAE7C,OAAO,OAAO,CAAC,IAAI,GAAG,iBAAiB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChE,uDAAuD;YACvD,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;YACjB,IAAI,YAAY,GAAG,CAAC,CAAC;YAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBACvC,IAAI,CAAC,IAAI;oBAAE,SAAS;gBACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACvE,IAAI,QAAQ,GAAG,YAAY,EAAE,CAAC;oBAC5B,YAAY,GAAG,QAAQ,CAAC;oBACxB,OAAO,GAAG,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;YAED,IAAI,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,KAAK,CAAC;gBAAE,MAAM;YAEhD,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;YACtC,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAC7B,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC9B,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAElC,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;YAC9C,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,YAAY,EAAE,CAAC;gBAC7C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,kBAAkB,CACxB,KAA0B,EAC1B,aAA0B,EAC1B,cAA2B,EAC3B,YAAsC;QAEtC,iEAAiE;QACjE,MAAM,eAAe,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAEvE,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,YAAY,EAAE,CAAC;YAC3C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,iDAAiD;gBACjD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC/B,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;wBAC1B,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;wBAC9B,uBAAuB;wBACvB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;wBAClD,IAAI,IAAI,EAAE,CAAC;4BACT,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gCAClC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;4BACzB,CAAC;wBACH,CAAC;wBACD,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;;;OAIG;IACK,mBAAmB,CACzB,KAA0B,EAC1B,aAA0B,EAC1B,cAA2B;QAE3B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvD,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;YAClD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,IAAI,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,IAAI,CAAC,CAAC;YACxD,OAAO,MAAM,GAAG,MAAM,CAAC,CAAC,aAAa;QACvC,CAAC,CAAC;QAEF,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5D,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE9D,OAAO,CAAC,GAAG,QAAQ,EAAE,GAAG,SAAS,CAAC,CAAC;IACrC,CAAC;IAED,6EAA6E;IAC7E,oBAAoB;IACpB,6EAA6E;IAErE,WAAW;QACjB,OAAO;YACL,aAAa,EAAE,EAAE;YACjB,cAAc,EAAE,EAAE;YAClB,cAAc,EAAE,EAAE;YAClB,sBAAsB,EAAE,CAAC;YACzB,UAAU,EAAE;gBACV,SAAS,EAAE,CAAC;gBACZ,aAAa,EAAE,CAAC;gBAChB,WAAW,EAAE,CAAC;gBACd,mBAAmB,EAAE,CAAC;aACvB;SACF,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,IAAc;QACrC,OAAO;YACL,aAAa,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC;YAC5B,cAAc,EAAE,EAAE;YAClB,cAAc,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC;YAC7B,sBAAsB,EAAE,CAAC;YACzB,UAAU,EAAE;gBACV,SAAS,EAAE,CAAC;gBACZ,aAAa,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM;gBACvC,WAAW,EAAE,CAAC;gBACd,mBAAmB,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC1D;SACF,CAAC;IACJ,CAAC;CACF;AAED,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,UAA6B;IACrE,OAAO,IAAI,uBAAuB,CAAC,UAAU,CAAC,CAAC;AACjD,CAAC"}

package/v3/dist/integrations/ruvector/brain-exporter.d.ts

@@ -0,0 +1,66 @@
+/**
+ * QE Brain Export/Import System
+ *
+ * Exports learning state (patterns, Q-values, dream insights, witness chain)
+ * into a portable directory format that can be imported by another AQE instance.
+ *
+ * Export format (.aqe-brain directory):
+ *   manifest.json       — BrainExportManifest with checksum
+ *   patterns.jsonl      — One QE pattern per line
+ *   q-values.jsonl      — Q-learning state-action values
+ *   dream-insights.jsonl — Dream cycle discoveries
+ *   witness-chain.jsonl — Witness chain entries
+ *
+ * Safety: Export uses a READ-ONLY connection (WAL mode, no write lock).
+ * Import validates manifest checksum before merging.
+ */
+import Database from 'better-sqlite3';
+export interface BrainExportManifest {
+    readonly version: '1.0';
+    readonly exportedAt: string;
+    readonly sourceDb: string;
+    readonly stats: {
+        readonly patternCount: number;
+        readonly vectorCount: number;
+        readonly qValueCount: number;
+        readonly dreamInsightCount: number;
+        readonly witnessChainLength: number;
+    };
+    readonly domains: readonly string[];
+    readonly checksum: string;
+}
+export interface BrainExportOptions {
+    readonly domains?: readonly string[];
+    readonly includeVectors?: boolean;
+    readonly includeQValues?: boolean;
+    readonly includeDreamInsights?: boolean;
+    readonly includeWitnessChain?: boolean;
+    readonly outputPath: string;
+}
+export interface BrainImportOptions {
+    readonly mergeStrategy: 'latest-wins' | 'highest-confidence' | 'union' | 'skip-conflicts';
+    readonly dryRun?: boolean;
+}
+export interface BrainImportResult {
+    readonly imported: number;
+    readonly skipped: number;
+    readonly conflicts: number;
+}
+/**
+ * Export the QE brain state from a SQLite database into a portable directory.
+ *
+ * Uses a read-only connection to avoid acquiring write locks.
+ */
+export declare function exportBrain(db: Database.Database, options: BrainExportOptions, sourceDbLabel?: string): BrainExportManifest;
+/**
+ * Import a brain export directory into a target SQLite database.
+ *
+ * Validates the manifest checksum before proceeding. Applies the chosen
+ * merge strategy to resolve conflicts on existing IDs.
+ */
+export declare function importBrain(db: Database.Database, containerPath: string, options: BrainImportOptions): BrainImportResult;
+/**
+ * Read and return the manifest from a brain export directory.
+ */
+export declare function brainInfo(containerPath: string): BrainExportManifest;
+//# sourceMappingURL=brain-exporter.d.ts.map

package/v3/dist/integrations/ruvector/brain-exporter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"brain-exporter.d.ts","sourceRoot":"","sources":["../../../src/integrations/ruvector/brain-exporter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAKH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AAMtC,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE;QACd,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;QAC9B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;QACnC,QAAQ,CAAC,kBAAkB,EAAE,MAAM,CAAC;KACrC,CAAC;IACF,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAClC,QAAQ,CAAC,cAAc,CAAC,EAAE,OAAO,CAAC;IAClC,QAAQ,CAAC,oBAAoB,CAAC,EAAE,OAAO,CAAC;IACxC,QAAQ,CAAC,mBAAmB,CAAC,EAAE,OAAO,CAAC;IACvC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,aAAa,EAAE,aAAa,GAAG,oBAAoB,GAAG,OAAO,GAAG,gBAAgB,CAAC;IAC1F,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AA8ED;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,OAAO,EAAE,kBAAkB,EAC3B,aAAa,SAAc,GAC1B,mBAAmB,CA8ErB;AAyED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,aAAa,EAAE,MAAM,EACrB,OAAO,EAAE,kBAAkB,GAC1B,iBAAiB,CA6EnB;AAmYD;;GAEG;AACH,wBAAgB,SAAS,CAAC,aAAa,EAAE,MAAM,GAAG,mBAAmB,CAOpE"}