agentic-qe 1.0.0 → 1.0.2

package/dist/core/quality-gate.js

@@ -1,254 +0,0 @@
-"use strict";
-/**
- * Quality Gate - Enforces quality standards and gates
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.QualityGate = void 0;
-class QualityGate {
-    constructor(rules = [], strictMode = false) {
-        this.rules = rules.length > 0 ? rules : this.getDefaultRules();
-        this.strictMode = strictMode;
-    }
-    /**
-     * Get default quality rules
-     */
-    getDefaultRules() {
-        return [
-            {
-                name: 'Minimum Test Coverage',
-                metric: 'testCoverage',
-                threshold: 80,
-                operator: 'gte',
-                weight: 0.3,
-                required: true
-            },
-            {
-                name: 'Test Pass Rate',
-                metric: 'testPassRate',
-                threshold: 95,
-                operator: 'gte',
-                weight: 0.25,
-                required: true
-            },
-            {
-                name: 'Code Quality',
-                metric: 'codeQuality',
-                threshold: 7.0,
-                operator: 'gte',
-                weight: 0.2,
-                required: false
-            },
-            {
-                name: 'Security Score',
-                metric: 'securityScore',
-                threshold: 8.0,
-                operator: 'gte',
-                weight: 0.15,
-                required: true
-            },
-            {
-                name: 'Performance Score',
-                metric: 'performanceScore',
-                threshold: 7.5,
-                operator: 'gte',
-                weight: 0.1,
-                required: false
-            }
-        ];
-    }
-    /**
-     * Evaluate quality metrics against gate rules
-     */
-    async evaluate(metrics) {
-        const violations = [];
-        let totalScore = 0;
-        let totalWeight = 0;
-        for (const rule of this.rules) {
-            const actual = metrics[rule.metric];
-            const violation = this.checkRule(rule, actual);
-            if (violation) {
-                violations.push(violation);
-            }
-            // Calculate weighted score
-            const ruleScore = this.calculateRuleScore(rule, actual);
-            totalScore += ruleScore * rule.weight;
-            totalWeight += rule.weight;
-        }
-        const overallScore = totalWeight > 0 ? totalScore / totalWeight : 0;
-        const passed = this.determineGateStatus(violations, overallScore);
-        return {
-            passed,
-            score: overallScore,
-            violations,
-            metrics,
-            timestamp: new Date()
-        };
-    }
-    /**
-     * Check a single rule against a metric value
-     */
-    checkRule(rule, actual) {
-        const { name, threshold, operator, required } = rule;
-        let violated = false;
-        switch (operator) {
-            case 'gte':
-                violated = actual < threshold;
-                break;
-            case 'lte':
-                violated = actual > threshold;
-                break;
-            case 'eq':
-                violated = actual !== threshold;
-                break;
-        }
-        if (!violated) {
-            return null;
-        }
-        const severity = required ? 'error' : 'warning';
-        const operatorText = {
-            'gte': 'at least',
-            'lte': 'at most',
-            'eq': 'exactly'
-        }[operator];
-        return {
-            rule: name,
-            metric: rule.metric,
-            actual,
-            expected: threshold,
-            severity,
-            message: `${name}: Expected ${operatorText} ${threshold}, got ${actual}`
-        };
-    }
-    /**
-     * Calculate score for a single rule (0-10)
-     */
-    calculateRuleScore(rule, actual) {
-        const { threshold, operator } = rule;
-        switch (operator) {
-            case 'gte':
-                if (actual >= threshold)
-                    return 10;
-                return Math.max(0, (actual / threshold) * 10);
-            case 'lte':
-                if (actual <= threshold)
-                    return 10;
-                return Math.max(0, 10 - ((actual - threshold) / threshold) * 10);
-            case 'eq':
-                return actual === threshold ? 10 : 0;
-            default:
-                return 0;
-        }
-    }
-    /**
-     * Determine if the quality gate passes
-     */
-    determineGateStatus(violations, score) {
-        // In strict mode, any error violation fails the gate
-        if (this.strictMode) {
-            return !violations.some(v => v.severity === 'error');
-        }
-        // Otherwise, use a combination of violations and score
-        const errorViolations = violations.filter(v => v.severity === 'error').length;
-        const warningViolations = violations.filter(v => v.severity === 'warning').length;
-        // Fail if too many errors or score is too low
-        if (errorViolations > 0)
-            return false;
-        if (score < 6.0)
-            return false;
-        if (warningViolations > 3)
-            return false;
-        return true;
-    }
-    /**
-     * Add or update a quality rule
-     */
-    addRule(rule) {
-        const existingIndex = this.rules.findIndex(r => r.name === rule.name);
-        if (existingIndex >= 0) {
-            this.rules[existingIndex] = rule;
-        }
-        else {
-            this.rules.push(rule);
-        }
-    }
-    /**
-     * Remove a quality rule
-     */
-    removeRule(ruleName) {
-        const index = this.rules.findIndex(r => r.name === ruleName);
-        if (index >= 0) {
-            this.rules.splice(index, 1);
-            return true;
-        }
-        return false;
-    }
-    /**
-     * Get current rules
-     */
-    getRules() {
-        return [...this.rules];
-    }
-    /**
-     * Generate a detailed report
-     */
-    generateReport(result) {
-        const { passed, score, violations, metrics } = result;
-        const status = passed ? '✅ PASSED' : '❌ FAILED';
-        let report = `
-Quality Gate Report ${status}
-=============================
-Overall Score: ${score.toFixed(2)}/10
-Status: ${passed ? 'PASSED' : 'FAILED'}
-
-Metrics:
---------
-Test Coverage: ${metrics.testCoverage.toFixed(1)}%
-Test Pass Rate: ${metrics.testPassRate.toFixed(1)}%
-Code Quality: ${metrics.codeQuality.toFixed(1)}/10
-Security Score: ${metrics.securityScore.toFixed(1)}/10
-Performance Score: ${metrics.performanceScore.toFixed(1)}/10
-Maintainability: ${metrics.maintainabilityIndex.toFixed(1)}/10
-`;
-        if (violations.length > 0) {
-            report += `\nViolations:\n-----------\n`;
-            violations.forEach(violation => {
-                const icon = violation.severity === 'error' ? '❌' : '⚠️';
-                report += `${icon} ${violation.message}\n`;
-            });
-        }
-        report += `\nGenerated: ${result.timestamp.toISOString()}`;
-        return report;
-    }
-    /**
-     * Get recommendations based on violations
-     */
-    getRecommendations(result) {
-        const recommendations = [];
-        result.violations.forEach(violation => {
-            switch (violation.metric) {
-                case 'testCoverage':
-                    recommendations.push('Increase test coverage by adding unit tests for uncovered code paths');
-                    break;
-                case 'testPassRate':
-                    recommendations.push('Fix failing tests and improve test reliability');
-                    break;
-                case 'codeQuality':
-                    recommendations.push('Refactor code to reduce complexity and improve readability');
-                    break;
-                case 'securityScore':
-                    recommendations.push('Address security vulnerabilities and improve secure coding practices');
-                    break;
-                case 'performanceScore':
-                    recommendations.push('Optimize performance bottlenecks and improve response times');
-                    break;
-                case 'maintainabilityIndex':
-                    recommendations.push('Improve code maintainability through better structure and documentation');
-                    break;
-            }
-        });
-        return [...new Set(recommendations)];
-    }
-}
-exports.QualityGate = QualityGate;
-exports.default = QualityGate;
-//# sourceMappingURL=quality-gate.js.map

package/dist/core/quality-gate.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"quality-gate.js","sourceRoot":"","sources":["../../src/core/quality-gate.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AAqCH,MAAa,WAAW;IAItB,YAAY,QAAuB,EAAE,EAAE,aAAsB,KAAK;QAChE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;QAC/D,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,eAAe;QACrB,OAAO;YACL;gBACE,IAAI,EAAE,uBAAuB;gBAC7B,MAAM,EAAE,cAAc;gBACtB,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,GAAG;gBACX,QAAQ,EAAE,IAAI;aACf;YACD;gBACE,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,cAAc;gBACtB,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,IAAI;gBACZ,QAAQ,EAAE,IAAI;aACf;YACD;gBACE,IAAI,EAAE,cAAc;gBACpB,MAAM,EAAE,aAAa;gBACrB,SAAS,EAAE,GAAG;gBACd,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,GAAG;gBACX,QAAQ,EAAE,KAAK;aAChB;YACD;gBACE,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,eAAe;gBACvB,SAAS,EAAE,GAAG;gBACd,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,IAAI;gBACZ,QAAQ,EAAE,IAAI;aACf;YACD;gBACE,IAAI,EAAE,mBAAmB;gBACzB,MAAM,EAAE,kBAAkB;gBAC1B,SAAS,EAAE,GAAG;gBACd,QAAQ,EAAE,KAAK;gBACf,MAAM,EAAE,GAAG;gBACX,QAAQ,EAAE,KAAK;aAChB;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,OAAuB;QACpC,MAAM,UAAU,GAAuB,EAAE,CAAC;QAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAE/C,IAAI,SAAS,EAAE,CAAC;gBACd,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,CAAC;YAED,2BAA2B;YAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACxD,UAAU,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;YACtC,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC;QAC7B,CAAC;QAED,MAAM,YAAY,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAElE,OAAO;YACL,MAAM;YACN,KAAK,EAAE,YAAY;YACnB,UAAU;YACV,OAAO;YACP,SAAS,EAAE,IAAI,IAAI,EAAE;SACtB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,IAAiB,EAAE,MAAc;QACjD,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QACrD,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,KAAK;gBACR,QAAQ,GAAG,MAAM,GAAG,SAAS,CAAC;gBAC9B,MAAM;YACR,KAAK,KAAK;gBACR,QAAQ,GAAG,MAAM,GAAG,SAAS,CAAC;gBAC9B,MAAM;YACR,KAAK,IAAI;gBACP,QAAQ,GAAG,MAAM,KAAK,SAAS,CAAC;gBAChC,MAAM;QACV,CAAC;QAED,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;QAChD,MAAM,YAAY,GAAG;YACnB,KAAK,EAAE,UAAU;YACjB,KAAK,EAAE,SAAS;YAChB,IAAI,EAAE,SAAS;SAChB,CAAC,QAAQ,CAAC,CAAC;QAEZ,OAAO;YACL,IAAI,EAAE,IAAI;YACV,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM;YACN,QAAQ,EAAE,SAAS;YACnB,QAAQ;YACR,OAAO,EAAE,GAAG,IAAI,cAAc,YAAY,IAAI,SAAS,SAAS,MAAM,EAAE;SACzE,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,IAAiB,EAAE,MAAc;QAC1D,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;QAErC,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,KAAK;gBACR,IAAI,MAAM,IAAI,SAAS;oBAAE,OAAO,EAAE,CAAC;gBACnC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC;YAEhD,KAAK,KAAK;gBACR,IAAI,MAAM,IAAI,SAAS;oBAAE,OAAO,EAAE,CAAC;gBACnC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC;YAEnE,KAAK,IAAI;gBACP,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAEvC;gBACE,OAAO,CAAC,CAAC;QACb,CAAC;IACH,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,UAA8B,EAAE,KAAa;QACvE,qDAAqD;QACrD,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;QACvD,CAAC;QAED,uDAAuD;QACvD,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;QAC9E,MAAM,iBAAiB,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QAElF,8CAA8C;QAC9C,IAAI,eAAe,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACtC,IAAI,KAAK,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;QAC9B,IAAI,iBAAiB,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAExC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAiB;QACvB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;QACtE,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,QAAgB;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;QAC7D,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAyB;QACtC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,MAAM,CAAC;QACtD,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;QAEhD,IAAI,MAAM,GAAG;sBACK,MAAM;;iBAEX,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;UACvB,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;;;;iBAIrB,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;kBAC9B,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;gBACjC,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC;kBAC5B,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;qBAC7B,OAAO,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC;mBACrC,OAAO,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC;CACzD,CAAC;QAEE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,8BAA8B,CAAC;YACzC,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;gBAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBACzD,MAAM,IAAI,GAAG,IAAI,IAAI,SAAS,CAAC,OAAO,IAAI,CAAC;YAC7C,CAAC,CAAC,CAAC;QACL,CAAC;QAED,MAAM,IAAI,gBAAgB,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,EAAE,CAAC;QAC3D,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,MAAyB;QAC1C,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;YACpC,QAAQ,SAAS,CAAC,MAAM,EAAE,CAAC;gBACzB,KAAK,cAAc;oBACjB,eAAe,CAAC,IAAI,CAAC,sEAAsE,CAAC,CAAC;oBAC7F,MAAM;gBACR,KAAK,cAAc;oBACjB,eAAe,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;oBACvE,MAAM;gBACR,KAAK,aAAa;oBAChB,eAAe,CAAC,IAAI,CAAC,4DAA4D,CAAC,CAAC;oBACnF,MAAM;gBACR,KAAK,eAAe;oBAClB,eAAe,CAAC,IAAI,CAAC,sEAAsE,CAAC,CAAC;oBAC7F,MAAM;gBACR,KAAK,kBAAkB;oBACrB,eAAe,CAAC,IAAI,CAAC,6DAA6D,CAAC,CAAC;oBACpF,MAAM;gBACR,KAAK,sBAAsB;oBACzB,eAAe,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;oBAChG,MAAM;YACV,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;IACvC,CAAC;CACF;AAhRD,kCAgRC;AAED,kBAAe,WAAW,CAAC"}

package/dist/optimization/sublinear-solver.d.ts

@@ -1,72 +0,0 @@
-/**
- * Sublinear Solver - O(log n) algorithms for test optimization
- */
-export interface Matrix {
-    rows: number;
-    cols: number;
-    data: number[][];
-}
-export interface SparseMatrix {
-    rows: number;
-    cols: number;
-    values: number[];
-    rowIndices: number[];
-    colIndices: number[];
-}
-export interface SolverResult {
-    solution: number[];
-    iterations: number;
-    convergence: boolean;
-    error: number;
-    executionTime: number;
-}
-export interface OptimizationProblem {
-    objective: (x: number[]) => number;
-    constraints: Array<(x: number[]) => boolean>;
-    bounds: Array<[number, number]>;
-    initialGuess?: number[];
-}
-export declare class SublinearSolver {
-    private tolerance;
-    private maxIterations;
-    constructor(tolerance?: number, maxIterations?: number);
-    /**
-     * Solve linear system Ax = b using sublinear methods
-     */
-    solveLinearSystem(A: Matrix | SparseMatrix, b: number[]): Promise<SolverResult>;
-    /**
-     * Solve sparse linear system using iterative methods
-     */
-    private solveSparse;
-    /**
-     * Solve dense linear system using Gaussian elimination with pivoting
-     */
-    private solveDense;
-    /**
-     * Optimize using sublinear algorithms
-     */
-    optimize(problem: OptimizationProblem): Promise<SolverResult>;
-    /**
-     * Binary search for sorted arrays - O(log n)
-     */
-    binarySearch(arr: number[], target: number): number;
-    /**
-     * Find k-th smallest element - O(n) average, O(log n) space
-     */
-    quickSelect(arr: number[], k: number): number;
-    private quickSelectHelper;
-    private partition;
-    private isSparse;
-    private multiplyMatrixVector;
-    private dotProduct;
-    private add;
-    private subtract;
-    private scale;
-    private createAugmentedMatrix;
-    private calculateResidual;
-    private numericalGradient;
-    private generateInitialGuess;
-    private projectToFeasibleRegion;
-}
-export default SublinearSolver;
-//# sourceMappingURL=sublinear-solver.d.ts.map

package/dist/optimization/sublinear-solver.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sublinear-solver.d.ts","sourceRoot":"","sources":["../../src/optimization/sublinear-solver.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,OAAO,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,mBAAmB;IAClC,SAAS,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,MAAM,CAAC;IACnC,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,OAAO,CAAC,CAAC;IAC7C,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAChC,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,qBAAa,eAAe;IAC1B,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,aAAa,CAAS;gBAElB,SAAS,GAAE,MAAa,EAAE,aAAa,GAAE,MAAa;IAKlE;;OAEG;IACG,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,CAAC;IAUrF;;OAEG;YACW,WAAW;IAuCzB;;OAEG;YACW,UAAU;IAgDxB;;OAEG;IACG,QAAQ,CAAC,OAAO,EAAE,mBAAmB,GAAG,OAAO,CAAC,YAAY,CAAC;IAiDnE;;OAEG;IACH,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAmBnD;;OAEG;IACH,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAQ7C,OAAO,CAAC,iBAAiB;IAgBzB,OAAO,CAAC,SAAS;IAgBjB,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,oBAAoB;IAY5B,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,GAAG;IAIX,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,KAAK;IAIb,OAAO,CAAC,qBAAqB;IAI7B,OAAO,CAAC,iBAAiB;IAQzB,OAAO,CAAC,iBAAiB;IAgBzB,OAAO,CAAC,oBAAoB;IAI5B,OAAO,CAAC,uBAAuB;CAYhC;AAED,eAAe,eAAe,CAAC"}

package/dist/optimization/sublinear-solver.js

@@ -1,263 +0,0 @@
-"use strict";
-/**
- * Sublinear Solver - O(log n) algorithms for test optimization
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SublinearSolver = void 0;
-class SublinearSolver {
-    constructor(tolerance = 1e-6, maxIterations = 1000) {
-        this.tolerance = tolerance;
-        this.maxIterations = maxIterations;
-    }
-    /**
-     * Solve linear system Ax = b using sublinear methods
-     */
-    async solveLinearSystem(A, b) {
-        const startTime = performance.now();
-        if (this.isSparse(A)) {
-            return this.solveSparse(A, b, startTime);
-        }
-        else {
-            return this.solveDense(A, b, startTime);
-        }
-    }
-    /**
-     * Solve sparse linear system using iterative methods
-     */
-    async solveSparse(A, b, startTime) {
-        const n = A.rows;
-        let x = new Array(n).fill(0);
-        let iterations = 0;
-        let error = Infinity;
-        // Conjugate Gradient method for sparse matrices
-        let r = this.subtract(b, this.multiplyMatrixVector(A, x));
-        let p = [...r];
-        let rsold = this.dotProduct(r, r);
-        while (iterations < this.maxIterations && error > this.tolerance) {
-            const Ap = this.multiplyMatrixVector(A, p);
-            const alpha = rsold / this.dotProduct(p, Ap);
-            x = this.add(x, this.scale(p, alpha));
-            r = this.subtract(r, this.scale(Ap, alpha));
-            const rsnew = this.dotProduct(r, r);
-            error = Math.sqrt(rsnew);
-            if (error <= this.tolerance)
-                break;
-            const beta = rsnew / rsold;
-            p = this.add(r, this.scale(p, beta));
-            rsold = rsnew;
-            iterations++;
-        }
-        const executionTime = performance.now() - startTime;
-        return {
-            solution: x,
-            iterations,
-            convergence: error <= this.tolerance,
-            error,
-            executionTime
-        };
-    }
-    /**
-     * Solve dense linear system using Gaussian elimination with pivoting
-     */
-    async solveDense(A, b, startTime) {
-        const n = A.rows;
-        const augmented = this.createAugmentedMatrix(A, b);
-        // Forward elimination with partial pivoting
-        for (let i = 0; i < n; i++) {
-            // Find pivot
-            let maxRow = i;
-            for (let k = i + 1; k < n; k++) {
-                if (Math.abs(augmented[k][i]) > Math.abs(augmented[maxRow][i])) {
-                    maxRow = k;
-                }
-            }
-            // Swap rows
-            [augmented[i], augmented[maxRow]] = [augmented[maxRow], augmented[i]];
-            // Make all rows below this one 0 in current column
-            for (let k = i + 1; k < n; k++) {
-                const factor = augmented[k][i] / augmented[i][i];
-                for (let j = i; j <= n; j++) {
-                    augmented[k][j] -= factor * augmented[i][j];
-                }
-            }
-        }
-        // Back substitution
-        const x = new Array(n);
-        for (let i = n - 1; i >= 0; i--) {
-            x[i] = augmented[i][n];
-            for (let j = i + 1; j < n; j++) {
-                x[i] -= augmented[i][j] * x[j];
-            }
-            x[i] /= augmented[i][i];
-        }
-        const executionTime = performance.now() - startTime;
-        const error = this.calculateResidual(A, x, b);
-        return {
-            solution: x,
-            iterations: n, // Gaussian elimination iterations
-            convergence: error <= this.tolerance,
-            error,
-            executionTime
-        };
-    }
-    /**
-     * Optimize using sublinear algorithms
-     */
-    async optimize(problem) {
-        const startTime = performance.now();
-        const dimension = problem.bounds.length;
-        let x = problem.initialGuess || this.generateInitialGuess(problem.bounds);
-        let iterations = 0;
-        let error = Infinity;
-        let previousValue = problem.objective(x);
-        // Adaptive gradient descent with momentum
-        let momentum = new Array(dimension).fill(0);
-        const learningRate = 0.01;
-        const momentumCoeff = 0.9;
-        while (iterations < this.maxIterations && error > this.tolerance) {
-            const gradient = this.numericalGradient(problem.objective, x);
-            // Update momentum and position
-            for (let i = 0; i < dimension; i++) {
-                momentum[i] = momentumCoeff * momentum[i] - learningRate * gradient[i];
-                x[i] += momentum[i];
-                // Apply bounds
-                const [lower, upper] = problem.bounds[i];
-                x[i] = Math.max(lower, Math.min(upper, x[i]));
-            }
-            // Check constraints
-            const feasible = problem.constraints.every(constraint => constraint(x));
-            if (!feasible) {
-                x = this.projectToFeasibleRegion(x, problem.constraints, problem.bounds);
-            }
-            const currentValue = problem.objective(x);
-            error = Math.abs(currentValue - previousValue);
-            previousValue = currentValue;
-            iterations++;
-        }
-        const executionTime = performance.now() - startTime;
-        return {
-            solution: x,
-            iterations,
-            convergence: error <= this.tolerance,
-            error,
-            executionTime
-        };
-    }
-    /**
-     * Binary search for sorted arrays - O(log n)
-     */
-    binarySearch(arr, target) {
-        let left = 0;
-        let right = arr.length - 1;
-        while (left <= right) {
-            const mid = Math.floor((left + right) / 2);
-            if (arr[mid] === target) {
-                return mid;
-            }
-            else if (arr[mid] < target) {
-                left = mid + 1;
-            }
-            else {
-                right = mid - 1;
-            }
-        }
-        return -1; // Not found
-    }
-    /**
-     * Find k-th smallest element - O(n) average, O(log n) space
-     */
-    quickSelect(arr, k) {
-        if (k < 1 || k > arr.length) {
-            throw new Error('k is out of bounds');
-        }
-        return this.quickSelectHelper([...arr], 0, arr.length - 1, k - 1);
-    }
-    quickSelectHelper(arr, left, right, k) {
-        if (left === right) {
-            return arr[left];
-        }
-        const pivotIndex = this.partition(arr, left, right);
-        if (k === pivotIndex) {
-            return arr[k];
-        }
-        else if (k < pivotIndex) {
-            return this.quickSelectHelper(arr, left, pivotIndex - 1, k);
-        }
-        else {
-            return this.quickSelectHelper(arr, pivotIndex + 1, right, k);
-        }
-    }
-    partition(arr, left, right) {
-        const pivot = arr[right];
-        let i = left;
-        for (let j = left; j < right; j++) {
-            if (arr[j] <= pivot) {
-                [arr[i], arr[j]] = [arr[j], arr[i]];
-                i++;
-            }
-        }
-        [arr[i], arr[right]] = [arr[right], arr[i]];
-        return i;
-    }
-    // Helper methods
-    isSparse(matrix) {
-        return 'values' in matrix && 'rowIndices' in matrix && 'colIndices' in matrix;
-    }
-    multiplyMatrixVector(A, x) {
-        const result = new Array(A.rows).fill(0);
-        for (let i = 0; i < A.values.length; i++) {
-            const row = A.rowIndices[i];
-            const col = A.colIndices[i];
-            result[row] += A.values[i] * x[col];
-        }
-        return result;
-    }
-    dotProduct(a, b) {
-        return a.reduce((sum, val, i) => sum + val * b[i], 0);
-    }
-    add(a, b) {
-        return a.map((val, i) => val + b[i]);
-    }
-    subtract(a, b) {
-        return a.map((val, i) => val - b[i]);
-    }
-    scale(a, scalar) {
-        return a.map(val => val * scalar);
-    }
-    createAugmentedMatrix(A, b) {
-        return A.data.map((row, i) => [...row, b[i]]);
-    }
-    calculateResidual(A, x, b) {
-        const Ax = A.data.map(row => row.reduce((sum, val, j) => sum + val * x[j], 0));
-        const residual = Ax.map((val, i) => val - b[i]);
-        return Math.sqrt(this.dotProduct(residual, residual));
-    }
-    numericalGradient(f, x) {
-        const h = 1e-8;
-        const gradient = new Array(x.length);
-        for (let i = 0; i < x.length; i++) {
-            const xplus = [...x];
-            const xminus = [...x];
-            xplus[i] += h;
-            xminus[i] -= h;
-            gradient[i] = (f(xplus) - f(xminus)) / (2 * h);
-        }
-        return gradient;
-    }
-    generateInitialGuess(bounds) {
-        return bounds.map(([lower, upper]) => (lower + upper) / 2);
-    }
-    projectToFeasibleRegion(x, constraints, bounds) {
-        // Simple projection - in practice, this would be more sophisticated
-        const projected = [...x];
-        // Apply bounds
-        for (let i = 0; i < projected.length; i++) {
-            const [lower, upper] = bounds[i];
-            projected[i] = Math.max(lower, Math.min(upper, projected[i]));
-        }
-        return projected;
-    }
-}
-exports.SublinearSolver = SublinearSolver;
-exports.default = SublinearSolver;
-//# sourceMappingURL=sublinear-solver.js.map

package/dist/optimization/sublinear-solver.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sublinear-solver.js","sourceRoot":"","sources":["../../src/optimization/sublinear-solver.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AA+BH,MAAa,eAAe;IAI1B,YAAY,YAAoB,IAAI,EAAE,gBAAwB,IAAI;QAChE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,iBAAiB,CAAC,CAAwB,EAAE,CAAW;QAC3D,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAiB,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,UAAU,CAAC,CAAW,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW,CAAC,CAAe,EAAE,CAAW,EAAE,SAAiB;QACvE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QACjB,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,QAAQ,CAAC;QAErB,gDAAgD;QAChD,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACf,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAElC,OAAO,UAAU,GAAG,IAAI,CAAC,aAAa,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACjE,MAAM,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAE7C,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YACtC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;YAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEzB,IAAI,KAAK,IAAI,IAAI,CAAC,SAAS;gBAAE,MAAM;YAEnC,MAAM,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC;YAC3B,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YACrC,KAAK,GAAG,KAAK,CAAC;YACd,UAAU,EAAE,CAAC;QACf,CAAC;QAED,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACpD,OAAO;YACL,QAAQ,EAAE,CAAC;YACX,UAAU;YACV,WAAW,EAAE,KAAK,IAAI,IAAI,CAAC,SAAS;YACpC,KAAK;YACL,aAAa;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,CAAS,EAAE,CAAW,EAAE,SAAiB;QAChE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QACjB,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnD,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,aAAa;YACb,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/D,MAAM,GAAG,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;YAED,YAAY;YACZ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAEtE,mDAAmD;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5B,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;YACD,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE9C,OAAO;YACL,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,CAAC,EAAE,kCAAkC;YACjD,WAAW,EAAE,KAAK,IAAI,IAAI,CAAC,SAAS;YACpC,KAAK;YACL,aAAa;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,OAA4B;QACzC,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC;QAExC,IAAI,CAAC,GAAG,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC1E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,aAAa,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAEzC,0CAA0C;QAC1C,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,YAAY,GAAG,IAAI,CAAC;QAC1B,MAAM,aAAa,GAAG,GAAG,CAAC;QAE1B,OAAO,UAAU,GAAG,IAAI,CAAC,aAAa,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YAE9D,+BAA+B;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnC,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvE,CAAC,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAEpB,eAAe;gBACf,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,CAAC;YAED,oBAAoB;YACpB,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,EAAE,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;YAC3E,CAAC;YAED,MAAM,YAAY,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1C,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,aAAa,CAAC,CAAC;YAC/C,aAAa,GAAG,YAAY,CAAC;YAC7B,UAAU,EAAE,CAAC;QACf,CAAC;QAED,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACpD,OAAO;YACL,QAAQ,EAAE,CAAC;YACX,UAAU;YACV,WAAW,EAAE,KAAK,IAAI,IAAI,CAAC,SAAS;YACpC,KAAK;YACL,aAAa;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,GAAa,EAAE,MAAc;QACxC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QAE3B,OAAO,IAAI,IAAI,KAAK,EAAE,CAAC;YACrB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAE3C,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,MAAM,EAAE,CAAC;gBACxB,OAAO,GAAG,CAAC;YACb,CAAC;iBAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC;gBAC7B,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YACjB,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY;IACzB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,GAAa,EAAE,CAAS;QAClC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;QACxC,CAAC;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACpE,CAAC;IAEO,iBAAiB,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa,EAAE,CAAS;QAC7E,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACnB,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAEpD,IAAI,CAAC,KAAK,UAAU,EAAE,CAAC;YACrB,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;aAAM,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,GAAa,EAAE,IAAY,EAAE,KAAa;QAC1D,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,IAAI,CAAC;QAEb,KAAK,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;gBACpB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QAED,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,OAAO,CAAC,CAAC;IACX,CAAC;IAED,iBAAiB;IACT,QAAQ,CAAC,MAA6B;QAC5C,OAAO,QAAQ,IAAI,MAAM,IAAI,YAAY,IAAI,MAAM,IAAI,YAAY,IAAI,MAAM,CAAC;IAChF,CAAC;IAEO,oBAAoB,CAAC,CAAe,EAAE,CAAW;QACvD,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,GAAG,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,UAAU,CAAC,CAAW,EAAE,CAAW;QACzC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;IAEO,GAAG,CAAC,CAAW,EAAE,CAAW;QAClC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAEO,QAAQ,CAAC,CAAW,EAAE,CAAW;QACvC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAEO,KAAK,CAAC,CAAW,EAAE,MAAc;QACvC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;IACpC,CAAC;IAEO,qBAAqB,CAAC,CAAS,EAAE,CAAW;QAClD,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAEO,iBAAiB,CAAC,CAAS,EAAE,CAAW,EAAE,CAAW;QAC3D,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAC1B,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CACjD,CAAC;QACF,MAAM,QAAQ,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IACxD,CAAC;IAEO,iBAAiB,CAAC,CAA0B,EAAE,CAAW;QAC/D,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAErC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACrB,MAAM,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACd,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAEf,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,oBAAoB,CAAC,MAA+B;QAC1D,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEO,uBAAuB,CAAC,CAAW,EAAE,WAA4C,EAAE,MAA+B;QACxH,oEAAoE;QACpE,MAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAEzB,eAAe;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACjC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AApTD,0CAoTC;AAED,kBAAe,eAAe,CAAC"}

package/dist/scripts/verifyComplexity.d.ts

@@ -1,8 +0,0 @@
-#!/usr/bin/env ts-node
-/**
- * Complexity Verification Script
- * Verifies O(log n) complexity guarantees for all sublinear algorithms
- */
-declare function main(): Promise<void>;
-export { main as verifyComplexity };
-//# sourceMappingURL=verifyComplexity.d.ts.map

package/dist/scripts/verifyComplexity.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"verifyComplexity.d.ts","sourceRoot":"","sources":["../../src/scripts/verifyComplexity.ts"],"names":[],"mappings":";AAEA;;;GAGG;AAIH,iBAAe,IAAI,kBA+ClB;AAMD,OAAO,EAAE,IAAI,IAAI,gBAAgB,EAAE,CAAC"}