agentic-qe 1.0.0

package/dist/utils/sublinear/testSelector.js

@@ -0,0 +1,303 @@
+"use strict";
+/**
+ * Test Selection with O(log n) complexity using Johnson-Lindenstrauss dimension reduction
+ * Implements the SPARC Phase 2 pseudocode for sublinear test selection
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SublinearTestSelector = void 0;
+exports.createTestSelector = createTestSelector;
+/**
+ * Johnson-Lindenstrauss dimension reduction for test selection matrix
+ */
+class JohnsonLindenstraussProjector {
+    constructor(originalDim, targetDim, distortionParam = 0.1) {
+        this.originalDimension = originalDim;
+        this.targetDimension = targetDim;
+        // Create random projection matrix with Gaussian entries
+        this.projectionMatrix = new Float64Array(targetDim * originalDim);
+        this.generateRandomProjection(distortionParam);
+    }
+    generateRandomProjection(epsilon) {
+        const scale = Math.sqrt(1.0 / this.targetDimension);
+        for (let i = 0; i < this.projectionMatrix.length; i++) {
+            // Box-Muller transform for Gaussian random numbers
+            const u1 = Math.random();
+            const u2 = Math.random();
+            const gaussian = Math.sqrt(-2 * Math.log(u1)) * Math.cos(2 * Math.PI * u2);
+            this.projectionMatrix[i] = gaussian * scale;
+        }
+    }
+    project(vector) {
+        const result = new Float64Array(this.targetDimension);
+        for (let i = 0; i < this.targetDimension; i++) {
+            let sum = 0;
+            for (let j = 0; j < this.originalDimension; j++) {
+                sum += this.projectionMatrix[i * this.originalDimension + j] * vector[j];
+            }
+            result[i] = sum;
+        }
+        return result;
+    }
+    projectMatrix(matrix, rows, cols) {
+        if (cols !== this.originalDimension) {
+            throw new Error('Matrix columns must match original dimension');
+        }
+        const projectedMatrix = new Float64Array(rows * this.targetDimension);
+        for (let row = 0; row < rows; row++) {
+            const originalRow = matrix.slice(row * cols, (row + 1) * cols);
+            const projectedRow = this.project(originalRow);
+            for (let col = 0; col < this.targetDimension; col++) {
+                projectedMatrix[row * this.targetDimension + col] = projectedRow[col];
+            }
+        }
+        return {
+            projectedMatrix,
+            projectedRows: rows
+        };
+    }
+}
+/**
+ * Sublinear Test Selector implementing O(log n) complexity
+ */
+class SublinearTestSelector {
+    constructor(config) {
+        this.config = config;
+    }
+    /**
+     * Select optimal tests using sublinear algorithms
+     * Time Complexity: O(log n) where n is number of tests
+     */
+    async selectOptimalTests(tests, codeElements) {
+        const startTime = Date.now();
+        // Phase 1: Build coverage matrix
+        const coverageMatrix = this.buildCoverageMatrix(tests, codeElements);
+        // Phase 2: Apply Johnson-Lindenstrauss dimension reduction
+        const reducedDimension = this.calculateOptimalDimension(tests.length, codeElements.length);
+        this.projector = new JohnsonLindenstraussProjector(codeElements.length, reducedDimension, this.config.distortionParameter);
+        const { projectedMatrix } = this.projector.projectMatrix(coverageMatrix, tests.length, codeElements.length);
+        // Phase 3: Solve using sublinear optimization
+        const selectedIndices = await this.solveTrueSublinear(projectedMatrix, tests.length, reducedDimension, tests);
+        // Phase 4: Map solution back and validate
+        const selectedTests = selectedIndices.map(i => tests[i]);
+        const actualCoverage = this.calculateActualCoverage(selectedTests, codeElements);
+        // Phase 5: Greedy augmentation if needed
+        const finalTests = await this.augmentCoverageIfNeeded(selectedTests, tests, codeElements, actualCoverage);
+        const estimatedTime = finalTests.reduce((sum, test) => sum + test.executionTime, 0);
+        const finalCoverage = this.calculateActualCoverage(finalTests, codeElements);
+        return {
+            selectedTests: finalTests,
+            coverageAchieved: finalCoverage,
+            estimatedTime,
+            optimizationRatio: finalTests.length / tests.length,
+            complexityMetrics: {
+                originalDimension: codeElements.length,
+                reducedDimension,
+                compressionRatio: reducedDimension / codeElements.length
+            }
+        };
+    }
+    /**
+     * Calculate optimal dimension using Johnson-Lindenstrauss lemma
+     * d = O(log n / ε²)
+     */
+    calculateOptimalDimension(rows, cols) {
+        const epsilon = this.config.distortionParameter;
+        const n = Math.max(rows, cols);
+        // Johnson-Lindenstrauss bound: d ≥ 4 * log(n) / ε²
+        let dimension = Math.ceil(4 * Math.log(n) / (epsilon * epsilon));
+        // Ensure practical bounds
+        dimension = Math.min(dimension, Math.floor(Math.min(rows, cols) / 2));
+        dimension = Math.max(dimension, 10);
+        return dimension;
+    }
+    /**
+     * Build binary coverage matrix: M[i][j] = 1 if test i covers element j
+     */
+    buildCoverageMatrix(tests, codeElements) {
+        const matrix = new Float64Array(tests.length * codeElements.length);
+        for (let i = 0; i < tests.length; i++) {
+            for (let j = 0; j < codeElements.length; j++) {
+                matrix[i * codeElements.length + j] = tests[i].coverage.has(codeElements[j]) ? 1.0 : 0.0;
+            }
+        }
+        return matrix;
+    }
+    /**
+     * Sublinear solver using iterative methods
+     */
+    async solveTrueSublinear(matrix, rows, cols, tests) {
+        // Create constraint vector (target coverage for each element)
+        const constraintVector = new Float64Array(cols).fill(this.config.targetCoverage);
+        // Initialize solution vector
+        const solution = new Float64Array(rows);
+        // Implement Fast Iterative Shrinkage-Thresholding Algorithm (FISTA)
+        const selectedIndices = [];
+        const maxIterations = Math.ceil(Math.log(rows));
+        for (let iter = 0; iter < maxIterations; iter++) {
+            // Calculate gradient and update
+            const gradient = this.calculateGradient(matrix, solution, constraintVector, rows, cols);
+            // Apply soft thresholding
+            for (let i = 0; i < rows; i++) {
+                const lambda = this.calculateThreshold(tests[i]);
+                solution[i] = this.softThreshold(solution[i] - 0.1 * gradient[i], lambda);
+            }
+        }
+        // Select tests with highest solution values
+        const sortedIndices = Array.from({ length: rows }, (_, i) => i)
+            .sort((a, b) => solution[b] - solution[a]);
+        // Greedy selection ensuring constraints
+        const selected = new Set();
+        const coveredElements = new Set();
+        for (const idx of sortedIndices) {
+            if (selected.size >= this.config.maxTests)
+                break;
+            const test = tests[idx];
+            const newCoverage = new Set([...coveredElements, ...test.coverage]);
+            if (newCoverage.size > coveredElements.size) {
+                selected.add(idx);
+                test.coverage.forEach(elem => coveredElements.add(elem));
+            }
+        }
+        return Array.from(selected);
+    }
+    calculateGradient(matrix, solution, target, rows, cols) {
+        const gradient = new Float64Array(rows);
+        // Calculate Ax - b
+        const residual = new Float64Array(cols);
+        for (let j = 0; j < cols; j++) {
+            let sum = 0;
+            for (let i = 0; i < rows; i++) {
+                sum += matrix[i * cols + j] * solution[i];
+            }
+            residual[j] = sum - target[j];
+        }
+        // Calculate A^T(Ax - b)
+        for (let i = 0; i < rows; i++) {
+            let sum = 0;
+            for (let j = 0; j < cols; j++) {
+                sum += matrix[i * cols + j] * residual[j];
+            }
+            gradient[i] = sum;
+        }
+        return gradient;
+    }
+    calculateThreshold(test) {
+        // Adaptive threshold based on test characteristics
+        const baseThreshold = 0.1;
+        const timeWeight = test.executionTime / 1000; // Normalize to seconds
+        const riskWeight = (1 - test.riskScore) * 0.5; // Higher risk = lower threshold
+        return baseThreshold + timeWeight * 0.01 + riskWeight * 0.05;
+    }
+    softThreshold(value, threshold) {
+        if (value > threshold)
+            return value - threshold;
+        if (value < -threshold)
+            return value + threshold;
+        return 0;
+    }
+    calculateActualCoverage(tests, codeElements) {
+        const coveredElements = new Set();
+        tests.forEach(test => {
+            test.coverage.forEach(elem => coveredElements.add(elem));
+        });
+        return coveredElements.size / codeElements.length;
+    }
+    async augmentCoverageIfNeeded(selectedTests, allTests, codeElements, currentCoverage) {
+        if (currentCoverage >= this.config.targetCoverage) {
+            return selectedTests;
+        }
+        const selectedIds = new Set(selectedTests.map(t => t.id));
+        const remainingTests = allTests.filter(t => !selectedIds.has(t.id));
+        const coveredElements = new Set();
+        selectedTests.forEach(test => {
+            test.coverage.forEach(elem => coveredElements.add(elem));
+        });
+        const uncoveredElements = codeElements.filter(elem => !coveredElements.has(elem));
+        const augmentedTests = [...selectedTests];
+        // Greedy selection for missing coverage
+        for (const element of uncoveredElements) {
+            const bestTest = remainingTests
+                .filter(test => test.coverage.has(element))
+                .sort((a, b) => (b.coverage.size / b.executionTime) - (a.coverage.size / a.executionTime))[0];
+            if (bestTest && !selectedIds.has(bestTest.id)) {
+                augmentedTests.push(bestTest);
+                selectedIds.add(bestTest.id);
+                bestTest.coverage.forEach(elem => coveredElements.add(elem));
+            }
+        }
+        return augmentedTests;
+    }
+    /**
+     * Benchmark the complexity of test selection
+     */
+    async benchmarkComplexity(testCounts) {
+        const results = [];
+        for (const count of testCounts) {
+            const tests = this.generateMockTests(count);
+            const codeElements = this.generateMockCodeElements(Math.floor(count * 0.7));
+            const startTime = Date.now();
+            await this.selectOptimalTests(tests, codeElements);
+            const endTime = Date.now();
+            results.push({
+                testCount: count,
+                timeMs: endTime - startTime,
+                logN: Math.log(count)
+            });
+        }
+        // Check if growth follows O(log n)
+        const isSublinear = this.verifySublinearGrowth(results);
+        return { results, isSublinear };
+    }
+    generateMockTests(count) {
+        const tests = [];
+        for (let i = 0; i < count; i++) {
+            const coverage = new Set();
+            const numCoverage = Math.floor(Math.random() * 20) + 1;
+            for (let j = 0; j < numCoverage; j++) {
+                coverage.add(`element_${Math.floor(Math.random() * 100)}`);
+            }
+            tests.push({
+                id: `test_${i}`,
+                name: `Test ${i}`,
+                executionTime: Math.random() * 1000 + 100,
+                coverage,
+                riskScore: Math.random(),
+                dependencies: [],
+                priority: ['low', 'medium', 'high', 'critical'][Math.floor(Math.random() * 4)]
+            });
+        }
+        return tests;
+    }
+    generateMockCodeElements(count) {
+        return Array.from({ length: count }, (_, i) => `element_${i}`);
+    }
+    verifySublinearGrowth(results) {
+        if (results.length < 3)
+            return false;
+        // Calculate correlation coefficient between time and log(n)
+        const n = results.length;
+        const sumLogN = results.reduce((sum, r) => sum + r.logN, 0);
+        const sumTime = results.reduce((sum, r) => sum + r.timeMs, 0);
+        const sumLogNTime = results.reduce((sum, r) => sum + r.logN * r.timeMs, 0);
+        const sumLogN2 = results.reduce((sum, r) => sum + r.logN * r.logN, 0);
+        const correlation = (n * sumLogNTime - sumLogN * sumTime) /
+            Math.sqrt((n * sumLogN2 - sumLogN * sumLogN) * (n * results.reduce((sum, r) => sum + r.timeMs * r.timeMs, 0) - sumTime * sumTime));
+        // Strong positive correlation (> 0.8) with log(n) indicates sublinear behavior
+        return correlation > 0.8;
+    }
+}
+exports.SublinearTestSelector = SublinearTestSelector;
+/**
+ * Factory function for creating test selector with default configuration
+ */
+function createTestSelector(options = {}) {
+    const defaultConfig = {
+        maxTests: 100,
+        targetCoverage: 0.85,
+        timeConstraint: 300000, // 5 minutes in ms
+        distortionParameter: 0.1,
+        sparsificationEps: 0.05
+    };
+    return new SublinearTestSelector({ ...defaultConfig, ...options });
+}
+//# sourceMappingURL=testSelector.js.map

package/dist/utils/sublinear/testSelector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"testSelector.js","sourceRoot":"","sources":["../../../src/utils/sublinear/testSelector.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AA8aH,gDAUC;AAxZD;;GAEG;AACH,MAAM,6BAA6B;IAKjC,YAAY,WAAmB,EAAE,SAAiB,EAAE,kBAA0B,GAAG;QAC/E,IAAI,CAAC,iBAAiB,GAAG,WAAW,CAAC;QACrC,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;QAEjC,wDAAwD;QACxD,IAAI,CAAC,gBAAgB,GAAG,IAAI,YAAY,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC;QAClE,IAAI,CAAC,wBAAwB,CAAC,eAAe,CAAC,CAAC;IACjD,CAAC;IAEO,wBAAwB,CAAC,OAAe;QAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC;QAEpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,mDAAmD;YACnD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC3E,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,KAAK,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAoB;QAC1B,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAEtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChD,GAAG,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3E,CAAC;YACD,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAClB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,aAAa,CAAC,MAAoB,EAAE,IAAY,EAAE,IAAY;QAI5D,IAAI,IAAI,KAAK,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;QAClE,CAAC;QAED,MAAM,eAAe,GAAG,IAAI,YAAY,CAAC,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC;QAEtE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACpC,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAC/D,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAE/C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE,EAAE,CAAC;gBACpD,eAAe,CAAC,GAAG,GAAG,IAAI,CAAC,eAAe,GAAG,GAAG,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YACxE,CAAC;QACH,CAAC;QAED,OAAO;YACL,eAAe;YACf,aAAa,EAAE,IAAI;SACpB,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAa,qBAAqB;IAIhC,YAAY,MAA2B;QACrC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,kBAAkB,CAAC,KAAiB,EAAE,YAAsB;QAChE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,iCAAiC;QACjC,MAAM,cAAc,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QAErE,2DAA2D;QAC3D,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;QAC3F,IAAI,CAAC,SAAS,GAAG,IAAI,6BAA6B,CAChD,YAAY,CAAC,MAAM,EACnB,gBAAgB,EAChB,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAChC,CAAC;QAEF,MAAM,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,CACtD,cAAc,EACd,KAAK,CAAC,MAAM,EACZ,YAAY,CAAC,MAAM,CACpB,CAAC;QAEF,8CAA8C;QAC9C,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,kBAAkB,CACnD,eAAe,EACf,KAAK,CAAC,MAAM,EACZ,gBAAgB,EAChB,KAAK,CACN,CAAC;QAEF,0CAA0C;QAC1C,MAAM,aAAa,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;QAEjF,yCAAyC;QACzC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,uBAAuB,CACnD,aAAa,EACb,KAAK,EACL,YAAY,EACZ,cAAc,CACf,CAAC;QAEF,MAAM,aAAa,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;QACpF,MAAM,aAAa,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAE7E,OAAO;YACL,aAAa,EAAE,UAAU;YACzB,gBAAgB,EAAE,aAAa;YAC/B,aAAa;YACb,iBAAiB,EAAE,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;YACnD,iBAAiB,EAAE;gBACjB,iBAAiB,EAAE,YAAY,CAAC,MAAM;gBACtC,gBAAgB;gBAChB,gBAAgB,EAAE,gBAAgB,GAAG,YAAY,CAAC,MAAM;aACzD;SACF,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,yBAAyB,CAAC,IAAY,EAAE,IAAY;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC;QAChD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAE/B,mDAAmD;QACnD,IAAI,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC;QAEjE,0BAA0B;QAC1B,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtE,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAEpC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,KAAiB,EAAE,YAAsB;QACnE,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;QAEpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAC3F,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAC9B,MAAoB,EACpB,IAAY,EACZ,IAAY,EACZ,KAAiB;QAEjB,8DAA8D;QAC9D,MAAM,gBAAgB,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;QAEjF,6BAA6B;QAC7B,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QAExC,oEAAoE;QACpE,MAAM,eAAe,GAAa,EAAE,CAAC;QACrC,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAEhD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YAChD,gCAAgC;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,QAAQ,EAAE,gBAAgB,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;YAExF,0BAA0B;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjD,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;QAED,4CAA4C;QAC5C,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aAC5D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7C,wCAAwC;QACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAE1C,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,IAAI,QAAQ,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ;gBAAE,MAAM;YAEjD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACxB,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,eAAe,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAEpE,IAAI,WAAW,CAAC,IAAI,GAAG,eAAe,CAAC,IAAI,EAAE,CAAC;gBAC5C,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAClB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,CAAC;IAEO,iBAAiB,CACvB,MAAoB,EACpB,QAAsB,EACtB,MAAoB,EACpB,IAAY,EACZ,IAAY;QAEZ,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QAExC,mBAAmB;QACnB,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,wBAAwB;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,GAAG,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,CAAC;YACD,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACpB,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,kBAAkB,CAAC,IAAc;QACvC,mDAAmD;QACnD,MAAM,aAAa,GAAG,GAAG,CAAC;QAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,CAAC,uBAAuB;QACrE,MAAM,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,gCAAgC;QAE/E,OAAO,aAAa,GAAG,UAAU,GAAG,IAAI,GAAG,UAAU,GAAG,IAAI,CAAC;IAC/D,CAAC;IAEO,aAAa,CAAC,KAAa,EAAE,SAAiB;QACpD,IAAI,KAAK,GAAG,SAAS;YAAE,OAAO,KAAK,GAAG,SAAS,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,SAAS;YAAE,OAAO,KAAK,GAAG,SAAS,CAAC;QACjD,OAAO,CAAC,CAAC;IACX,CAAC;IAEO,uBAAuB,CAAC,KAAiB,EAAE,YAAsB;QACvE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,OAAO,eAAe,CAAC,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC;IACpD,CAAC;IAEO,KAAK,CAAC,uBAAuB,CACnC,aAAyB,EACzB,QAAoB,EACpB,YAAsB,EACtB,eAAuB;QAEvB,IAAI,eAAe,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YAClD,OAAO,aAAa,CAAC;QACvB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC3B,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,MAAM,iBAAiB,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAClF,MAAM,cAAc,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC;QAE1C,wCAAwC;QACxC,KAAK,MAAM,OAAO,IAAI,iBAAiB,EAAE,CAAC;YACxC,MAAM,QAAQ,GAAG,cAAc;iBAC5B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;iBAC1C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhG,IAAI,QAAQ,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC9C,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC9B,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAC7B,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,mBAAmB,CAAC,UAAoB;QAI5C,MAAM,OAAO,GAAG,EAAE,CAAC;QAEnB,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC;YAE5E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC7B,MAAM,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAE3B,OAAO,CAAC,IAAI,CAAC;gBACX,SAAS,EAAE,KAAK;gBAChB,MAAM,EAAE,OAAO,GAAG,SAAS;gBAC3B,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;aACtB,CAAC,CAAC;QACL,CAAC;QAED,mCAAmC;QACnC,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAExD,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IAClC,CAAC;IAEO,iBAAiB,CAAC,KAAa;QACrC,MAAM,KAAK,GAAe,EAAE,CAAC;QAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;YACnC,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAEvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,QAAQ,CAAC,GAAG,CAAC,WAAW,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7D,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,QAAQ,CAAC,EAAE;gBACf,IAAI,EAAE,QAAQ,CAAC,EAAE;gBACjB,aAAa,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,GAAG,GAAG;gBACzC,QAAQ;gBACR,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE;gBACxB,YAAY,EAAE,EAAE;gBAChB,QAAQ,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAQ;aACtF,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,wBAAwB,CAAC,KAAa;QAC5C,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IACjE,CAAC;IAEO,qBAAqB,CAAC,OAAmE;QAC/F,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAErC,4DAA4D;QAC5D,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9D,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC3E,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAEtE,MAAM,WAAW,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,OAAO,GAAG,OAAO,CAAC;YACvD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC;QAErI,+EAA+E;QAC/E,OAAO,WAAW,GAAG,GAAG,CAAC;IAC3B,CAAC;CACF;AAjUD,sDAiUC;AAED;;GAEG;AACH,SAAgB,kBAAkB,CAAC,UAAwC,EAAE;IAC3E,MAAM,aAAa,GAAwB;QACzC,QAAQ,EAAE,GAAG;QACb,cAAc,EAAE,IAAI;QACpB,cAAc,EAAE,MAAM,EAAE,kBAAkB;QAC1C,mBAAmB,EAAE,GAAG;QACxB,iBAAiB,EAAE,IAAI;KACxB,CAAC;IAEF,OAAO,IAAI,qBAAqB,CAAC,EAAE,GAAG,aAAa,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC;AACrE,CAAC"}

package/package.json

@@ -0,0 +1,131 @@
+{
+  "name": "agentic-qe",
+  "version": "1.0.0",
+  "description": "Agentic Quality Engineering Fleet System - AI-driven quality management platform",
+  "main": "dist/cli/index.js",
+  "types": "dist/cli/index.d.ts",
+  "bin": {
+    "agentic-qe": "./bin/agentic-qe",
+    "aqe": "./bin/aqe"
+  },
+  "scripts": {
+    "build": "tsc",
+    "dev": "ts-node src/cli/index.ts",
+    "start": "node dist/cli/index.js",
+    "pretest": "node scripts/check-memory-before-test.js",
+    "test": "node --expose-gc --max-old-space-size=1024 --no-compilation-cache node_modules/.bin/jest --maxWorkers=1",
+    "pretest:safe": "node scripts/check-memory-before-test.js",
+    "test:safe": "node --expose-gc --max-old-space-size=768 --no-compilation-cache node_modules/.bin/jest --maxWorkers=1 --runInBand --bail --detectLeaks --forceExit --logHeapUsage",
+    "pretest:unit-only": "node scripts/check-memory-before-test.js",
+    "test:unit-only": "node --expose-gc --max-old-space-size=512 --no-compilation-cache node_modules/.bin/jest tests/unit --maxWorkers=1 --bail --forceExit",
+    "pretest:unit": "node scripts/check-memory-before-test.js",
+    "test:unit": "node --expose-gc --max-old-space-size=512 --no-compilation-cache node_modules/.bin/jest tests/unit --runInBand",
+    "pretest:integration-serial": "node scripts/check-memory-before-test.js",
+    "test:integration-serial": "node --expose-gc --max-old-space-size=768 --no-compilation-cache node_modules/.bin/jest tests/integration --runInBand --detectLeaks --forceExit",
+    "pretest:integration": "node scripts/check-memory-before-test.js",
+    "test:integration": "node --expose-gc --max-old-space-size=768 --no-compilation-cache node_modules/.bin/jest tests/integration --runInBand --forceExit",
+    "pretest:performance-isolated": "node scripts/check-memory-before-test.js",
+    "test:performance-isolated": "node --expose-gc --max-old-space-size=1536 --no-compilation-cache node_modules/.bin/jest tests/performance --runInBand --maxWorkers=1 --detectLeaks --forceExit --logHeapUsage",
+    "pretest:performance": "node scripts/check-memory-before-test.js",
+    "test:performance": "node --expose-gc --max-old-space-size=1536 --no-compilation-cache node_modules/.bin/jest tests/performance --runInBand --forceExit",
+    "test:watch": "node --expose-gc --max-old-space-size=512 node_modules/.bin/jest --watch --maxWorkers=1",
+    "pretest:coverage": "node scripts/check-memory-before-test.js",
+    "test:coverage": "node --expose-gc --max-old-space-size=1536 --no-compilation-cache node_modules/.bin/jest --coverage --maxWorkers=1 --runInBand",
+    "pretest:coverage-safe": "node scripts/check-memory-before-test.js",
+    "test:coverage-safe": "node --expose-gc --max-old-space-size=1024 --no-compilation-cache node_modules/.bin/jest --coverage --maxWorkers=1 --runInBand --bail --forceExit",
+    "test:memory-track": "TRACK_MEMORY=true node --expose-gc --max-old-space-size=1024 --no-compilation-cache node_modules/.bin/jest --maxWorkers=1 --runInBand",
+    "test:debug": "node --expose-gc --inspect-brk --max-old-space-size=2048 node_modules/.bin/jest --runInBand --no-cache",
+    "pretest:ci": "node scripts/check-memory-before-test.js",
+    "test:ci": "node --expose-gc --max-old-space-size=1024 --no-compilation-cache node_modules/.bin/jest --ci --maxWorkers=1 --bail --forceExit --detectLeaks",
+    "test:e2e": "node --expose-gc --max-old-space-size=768 --no-compilation-cache node_modules/.bin/jest tests/e2e --runInBand --forceExit",
+    "test:agents": "node --expose-gc --max-old-space-size=512 --no-compilation-cache node_modules/.bin/jest tests/agents --runInBand",
+    "test:mcp": "node --expose-gc --max-old-space-size=512 --no-compilation-cache node_modules/.bin/jest tests/mcp --runInBand",
+    "test:cli": "node --expose-gc --max-old-space-size=512 --no-compilation-cache node_modules/.bin/jest tests/cli --runInBand",
+    "test:utils": "node --expose-gc --max-old-space-size=768 --no-compilation-cache node_modules/.bin/jest tests/utils --runInBand",
+    "test:sequential": "npm run test:unit && npm run test:agents && npm run test:mcp && npm run test:cli && npm run test:utils && npm run test:integration && npm run test:performance",
+    "lint": "eslint src/**/*.ts",
+    "lint:fix": "eslint src/**/*.ts --fix",
+    "typecheck": "tsc --noEmit",
+    "clean": "rimraf dist",
+    "prepare": "npm run build",
+    "prepublishOnly": "npm run typecheck && npm run build",
+    "mcp:start": "LOG_LEVEL=silent node dist/mcp/start.js",
+    "mcp:dev": "nodemon --watch src/mcp -e ts --exec ts-node src/mcp/start.ts",
+    "docs:api": "typedoc --out docs/api src --exclude '**/*.test.ts' --excludePrivate",
+    "docs:serve": "npx http-server docs/api -p 8080"
+  },
+  "keywords": [
+    "quality-engineering",
+    "testing",
+    "automation",
+    "ai-agents",
+    "distributed-systems",
+    "swarm-intelligence"
+  ],
+  "author": "AQE Development Team",
+  "license": "MIT",
+  "dependencies": {
+    "@anthropic-ai/sdk": "^0.64.0",
+    "@modelcontextprotocol/sdk": "^1.18.2",
+    "@types/sqlite3": "^3.1.11",
+    "axios": "^1.6.0",
+    "chalk": "^4.1.2",
+    "commander": "^11.1.0",
+    "dotenv": "^16.3.1",
+    "fs-extra": "^11.1.1",
+    "inquirer": "^8.2.6",
+    "ora": "^5.4.1",
+    "sqlite3": "^5.1.7",
+    "uuid": "^9.0.0",
+    "winston": "^3.10.0",
+    "ws": "^8.14.2",
+    "yaml": "^2.3.4"
+  },
+  "devDependencies": {
+    "@types/fs-extra": "^11.0.4",
+    "@types/graphql": "^14.2.3",
+    "@types/inquirer": "^8.2.10",
+    "@types/jest": "^29.5.8",
+    "@types/node": "^20.19.17",
+    "@types/uuid": "^9.0.2",
+    "@types/ws": "^8.5.10",
+    "@typescript-eslint/eslint-plugin": "^6.13.0",
+    "@typescript-eslint/parser": "^6.13.0",
+    "ajv": "^8.17.1",
+    "ajv-formats": "^3.0.1",
+    "eslint": "^8.55.0",
+    "graphql": "^16.11.0",
+    "jest": "^29.7.0",
+    "nodemon": "^3.0.2",
+    "rimraf": "^5.0.1",
+    "ts-jest": "^29.4.4",
+    "ts-node": "^10.9.1",
+    "typedoc": "^0.25.13",
+    "typescript": "^5.3.0"
+  },
+  "engines": {
+    "node": ">=18.0.0",
+    "npm": ">=8.0.0"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/proffesor-for-testing/agentic-qe.git"
+  },
+  "bugs": {
+    "url": "https://github.com/proffesor-for-testing/agentic-qe/issues"
+  },
+  "homepage": "https://github.com/proffesor-for-testing/agentic-qe#readme",
+  "files": [
+    "dist",
+    "bin",
+    ".claude",
+    "config",
+    "LICENSE",
+    "README.md",
+    "CONTRIBUTING.md"
+  ],
+  "publishConfig": {
+    "access": "public",
+    "registry": "https://registry.npmjs.org/"
+  }
+}