@miller-tech/uap 1.0.0

package/dist/models/unified-router.d.ts

@@ -0,0 +1,152 @@
+/**
+ * Unified Routing Service
+ *
+ * Bridges the two independent routing systems:
+ * 1. Rule-based ModelRouter (src/models/router.ts) - uses task complexity/type keywords, routing rules, role assignments
+ * 2. Benchmark-data ModelRouter (src/memory/model-router.ts) - uses MODEL_FINGERPRINTS with per-category success rates, SQLite persistence
+ *
+ * Combines both signals to produce a single routing decision with higher accuracy
+ * than either system alone. The benchmark-data router is weighted higher when it
+ * has sufficient data points (>=5) for the relevant category.
+ */
+import { ModelRouter as RuleBasedRouter } from './router.js';
+import { type ModelId, type RoutingDecision, type RoutingConfig } from '../memory/model-router.js';
+import type { MultiModelConfig, TaskClassificationResult, TaskComplexity } from './types.js';
+/**
+ * Result from the unified routing system.
+ */
+export interface UnifiedRoutingResult {
+    /** The selected model ID (using rule-based router's naming convention) */
+    selectedModel: string;
+    /** Fallback model ID if the primary fails */
+    fallbackModel: string;
+    /** Which system's recommendation was used: 'rule-based', 'benchmark-data', or 'consensus' */
+    source: 'rule-based' | 'benchmark-data' | 'consensus';
+    /** Confidence score 0-1 reflecting how confident the unified system is */
+    confidence: number;
+    /** Human-readable reasoning explaining the decision */
+    reasoning: string;
+    /** The rule-based router's classification */
+    ruleBasedClassification: TaskClassificationResult;
+    /** The benchmark-data router's decision */
+    benchmarkDecision: RoutingDecision;
+    /** Whether the two systems agreed on the model */
+    systemsAgreed: boolean;
+    /** Number of benchmark data points for the relevant category */
+    benchmarkDataPoints: number;
+}
+/**
+ * Options for recording outcomes back to the benchmark-data router.
+ */
+export interface OutcomeRecord {
+    /** The model that was actually used (rule-based router naming) */
+    modelUsed: string;
+    /** Whether the task succeeded */
+    success: boolean;
+    /** Latency in milliseconds */
+    latencyMs: number;
+    /** Optional task category for category-specific tracking */
+    taskCategory?: string;
+}
+/**
+ * Side-by-side analysis of both routing systems.
+ */
+export interface RoutingAnalysis {
+    taskDescription: string;
+    ruleBasedResult: {
+        suggestedModel: string;
+        complexity: TaskComplexity;
+        taskType: string;
+        reasoning: string;
+    };
+    benchmarkResult: {
+        primaryModel: ModelId;
+        score: string;
+        estimatedSuccessRate: number;
+        estimatedLatencyMs: number;
+        estimatedCost: number;
+        reasoning: string;
+    };
+    unifiedResult: UnifiedRoutingResult;
+    modelComparison: Array<{
+        modelId: string;
+        benchmarkModelId: ModelId | null;
+        ruleBasedRole: string | null;
+        benchmarkSuccessRate: number | null;
+        benchmarkCategoryDataPoints: number | null;
+    }>;
+}
+/**
+ * Unified Routing Service that combines rule-based and benchmark-data routing.
+ */
+export declare class UnifiedRoutingService {
+    private ruleRouter;
+    private benchmarkConfig;
+    /**
+     * @param config - MultiModelConfig for the rule-based router
+     * @param benchmarkConfig - Optional overrides for the benchmark-data router's RoutingConfig
+     */
+    constructor(config: MultiModelConfig, benchmarkConfig?: Partial<RoutingConfig>);
+    /**
+     * Route a task using both systems and combine their signals.
+     *
+     * Decision logic:
+     * - If both systems agree on the model → use that model (source: 'consensus')
+     * - If they disagree and benchmark has >=5 data points for the category → use benchmark (source: 'benchmark-data')
+     * - If they disagree and benchmark has <5 data points → use rule-based (source: 'rule-based')
+     */
+    route(taskDescription: string): UnifiedRoutingResult;
+    /**
+     * Record a task outcome, feeding back to the benchmark-data router for learning.
+     */
+    recordOutcome(outcome: OutcomeRecord): void;
+    /**
+     * Show both systems' recommendations side by side for analysis/debugging.
+     */
+    analyzeRouting(taskDescription: string): RoutingAnalysis;
+    /**
+     * Get the underlying rule-based router for advanced usage.
+     */
+    getRuleRouter(): RuleBasedRouter;
+    /**
+     * Get the number of benchmark data points for the most relevant category
+     * for a given task description, using the benchmark model's fingerprint.
+     */
+    private getCategoryDataPoints;
+    /**
+     * Same as getCategoryDataPoints but takes a fingerprint directly (no model lookup).
+     */
+    private getCategoryDataPointsFromFingerprint;
+    /**
+     * Get the maximum number of attempts across all categories for a fingerprint.
+     * This represents the most-exercised category and serves as a proxy for
+     * how much data we have for this model.
+     */
+    private getMaxCategoryAttempts;
+    /**
+     * Compute confidence when both systems agree.
+     * Higher confidence because consensus is a strong signal.
+     */
+    private computeConsensusConfidence;
+    /**
+     * Compute confidence when using the benchmark-data router (disagreement case).
+     */
+    private computeBenchmarkConfidence;
+    /**
+     * Compute confidence when using the rule-based router (disagreement, low benchmark data).
+     */
+    private computeRuleBasedConfidence;
+    /**
+     * Select the best fallback model from the two systems' recommendations.
+     */
+    private selectFallback;
+    /**
+     * Get the role assigned to a model in the rule-based router.
+     */
+    private getRoleForModel;
+}
+/**
+ * Create a UnifiedRoutingService with the given configuration.
+ */
+export declare function createUnifiedRouter(config: MultiModelConfig, benchmarkConfig?: Partial<RoutingConfig>): UnifiedRoutingService;
+//# sourceMappingURL=unified-router.d.ts.map

package/dist/models/unified-router.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unified-router.d.ts","sourceRoot":"","sources":["../../src/models/unified-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,WAAW,IAAI,eAAe,EAAE,MAAM,aAAa,CAAC;AAC7D,OAAO,EAKL,KAAK,OAAO,EACZ,KAAK,eAAe,EACpB,KAAK,aAAa,EAEnB,MAAM,2BAA2B,CAAC;AACnC,OAAO,KAAK,EACV,gBAAgB,EAChB,wBAAwB,EACxB,cAAc,EAEf,MAAM,YAAY,CAAC;AAqCpB;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,0EAA0E;IAC1E,aAAa,EAAE,MAAM,CAAC;IACtB,6CAA6C;IAC7C,aAAa,EAAE,MAAM,CAAC;IACtB,6FAA6F;IAC7F,MAAM,EAAE,YAAY,GAAG,gBAAgB,GAAG,WAAW,CAAC;IACtD,0EAA0E;IAC1E,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,SAAS,EAAE,MAAM,CAAC;IAClB,6CAA6C;IAC7C,uBAAuB,EAAE,wBAAwB,CAAC;IAClD,2CAA2C;IAC3C,iBAAiB,EAAE,eAAe,CAAC;IACnC,kDAAkD;IAClD,aAAa,EAAE,OAAO,CAAC;IACvB,gEAAgE;IAChE,mBAAmB,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,kEAAkE;IAClE,SAAS,EAAE,MAAM,CAAC;IAClB,iCAAiC;IACjC,OAAO,EAAE,OAAO,CAAC;IACjB,8BAA8B;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,4DAA4D;IAC5D,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE;QACf,cAAc,EAAE,MAAM,CAAC;QACvB,UAAU,EAAE,cAAc,CAAC;QAC3B,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;IACF,eAAe,EAAE;QACf,YAAY,EAAE,OAAO,CAAC;QACtB,KAAK,EAAE,MAAM,CAAC;QACd,oBAAoB,EAAE,MAAM,CAAC;QAC7B,kBAAkB,EAAE,MAAM,CAAC;QAC3B,aAAa,EAAE,MAAM,CAAC;QACtB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;IACF,aAAa,EAAE,oBAAoB,CAAC;IACpC,eAAe,EAAE,KAAK,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;QAChB,gBAAgB,EAAE,OAAO,GAAG,IAAI,CAAC;QACjC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;QAC7B,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;QACpC,2BAA2B,EAAE,MAAM,GAAG,IAAI,CAAC;KAC5C,CAAC,CAAC;CACJ;AAED;;GAEG;AACH,qBAAa,qBAAqB;IAChC,OAAO,CAAC,UAAU,CAAkB;IACpC,OAAO,CAAC,eAAe,CAAyB;IAEhD;;;OAGG;gBACS,MAAM,EAAE,gBAAgB,EAAE,eAAe,GAAE,OAAO,CAAC,aAAa,CAAM;IAKlF;;;;;;;OAOG;IACH,KAAK,CAAC,eAAe,EAAE,MAAM,GAAG,oBAAoB;IA4EpD;;OAEG;IACH,aAAa,CAAC,OAAO,EAAE,aAAa,GAAG,IAAI;IAe3C;;OAEG;IACH,cAAc,CAAC,eAAe,EAAE,MAAM,GAAG,eAAe;IAiDxD;;OAEG;IACH,aAAa,IAAI,eAAe;IAMhC;;;OAGG;IACH,OAAO,CAAC,qBAAqB;IAQ7B;;OAEG;IACH,OAAO,CAAC,oCAAoC;IAQ5C;;;;OAIG;IACH,OAAO,CAAC,sBAAsB;IAW9B;;;OAGG;IACH,OAAO,CAAC,0BAA0B;IAsBlC;;OAEG;IACH,OAAO,CAAC,0BAA0B;IAgBlC;;OAEG;IACH,OAAO,CAAC,0BAA0B;IAuBlC;;OAEG;IACH,OAAO,CAAC,cAAc;IAsBtB;;OAEG;IACH,OAAO,CAAC,eAAe;CASxB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,gBAAgB,EACxB,eAAe,CAAC,EAAE,OAAO,CAAC,aAAa,CAAC,GACvC,qBAAqB,CAEvB"}

package/dist/models/unified-router.js

@@ -0,0 +1,313 @@
+/**
+ * Unified Routing Service
+ *
+ * Bridges the two independent routing systems:
+ * 1. Rule-based ModelRouter (src/models/router.ts) - uses task complexity/type keywords, routing rules, role assignments
+ * 2. Benchmark-data ModelRouter (src/memory/model-router.ts) - uses MODEL_FINGERPRINTS with per-category success rates, SQLite persistence
+ *
+ * Combines both signals to produce a single routing decision with higher accuracy
+ * than either system alone. The benchmark-data router is weighted higher when it
+ * has sufficient data points (>=5) for the relevant category.
+ */
+import { ModelRouter as RuleBasedRouter } from './router.js';
+import { routeTask as benchmarkRouteTask, recordTaskOutcome, getModelFingerprint, getAllModelFingerprints, } from '../memory/model-router.js';
+/**
+ * Mapping from benchmark-data ModelId values to rule-based router model IDs.
+ * The benchmark router uses 'claude-opus-4.5' while the rule-based router uses 'opus-4.5'.
+ */
+const BENCHMARK_TO_RULE_MODEL_MAP = {
+    'claude-opus-4.5': 'opus-4.5',
+    'gpt-5.2': 'gpt-5.2',
+    'glm-4.7': 'glm-4.7',
+    'gpt-5.2-codex': 'gpt-5.2',
+};
+const RULE_TO_BENCHMARK_MODEL_MAP = {
+    'opus-4.5': 'claude-opus-4.5',
+    'gpt-5.2': 'gpt-5.2',
+    'glm-4.7': 'glm-4.7',
+    'deepseek-v3.2': 'gpt-5.2', // No benchmark equivalent; map to closest general-purpose model
+    'deepseek-v3.2-exp': 'gpt-5.2',
+    'qwen35-a3b': 'glm-4.7',
+};
+/**
+ * Map rule-based TaskComplexity to benchmark difficulty levels.
+ */
+function complexityToDifficulty(complexity) {
+    switch (complexity) {
+        case 'low':
+            return 'easy';
+        case 'medium':
+            return 'medium';
+        case 'high':
+        case 'critical':
+            return 'hard';
+    }
+}
+/**
+ * Unified Routing Service that combines rule-based and benchmark-data routing.
+ */
+export class UnifiedRoutingService {
+    ruleRouter;
+    benchmarkConfig;
+    /**
+     * @param config - MultiModelConfig for the rule-based router
+     * @param benchmarkConfig - Optional overrides for the benchmark-data router's RoutingConfig
+     */
+    constructor(config, benchmarkConfig = {}) {
+        this.ruleRouter = new RuleBasedRouter(config);
+        this.benchmarkConfig = benchmarkConfig;
+    }
+    /**
+     * Route a task using both systems and combine their signals.
+     *
+     * Decision logic:
+     * - If both systems agree on the model → use that model (source: 'consensus')
+     * - If they disagree and benchmark has >=5 data points for the category → use benchmark (source: 'benchmark-data')
+     * - If they disagree and benchmark has <5 data points → use rule-based (source: 'rule-based')
+     */
+    route(taskDescription) {
+        // Step A: Classify via rule-based router
+        const ruleClassification = this.ruleRouter.classifyTask(taskDescription);
+        // Step B: Get benchmark-data recommendation
+        const difficulty = complexityToDifficulty(ruleClassification.complexity);
+        const benchmarkDecision = benchmarkRouteTask(taskDescription, difficulty, this.benchmarkConfig);
+        // Normalize model IDs so we can compare
+        const ruleModelId = ruleClassification.suggestedModel;
+        const benchmarkModelId = benchmarkDecision.primary;
+        const benchmarkAsRuleId = BENCHMARK_TO_RULE_MODEL_MAP[benchmarkModelId] ?? benchmarkModelId;
+        // Check benchmark data points for the relevant category
+        const benchmarkFingerprint = getModelFingerprint(benchmarkModelId);
+        const benchmarkDataPoints = this.getCategoryDataPoints(benchmarkFingerprint, taskDescription);
+        // Determine if the two systems agree
+        const systemsAgreed = ruleModelId === benchmarkAsRuleId;
+        let selectedModel;
+        let source;
+        let confidence;
+        let reasoning;
+        if (systemsAgreed) {
+            // Consensus: both systems agree
+            selectedModel = ruleModelId;
+            source = 'consensus';
+            confidence = this.computeConsensusConfidence(ruleClassification, benchmarkDecision, benchmarkDataPoints);
+            reasoning =
+                `Both routing systems agree on ${selectedModel}. ` +
+                    `Rule-based: ${ruleClassification.reasoning}. ` +
+                    `Benchmark: ${benchmarkDecision.reason}.`;
+        }
+        else if (benchmarkDataPoints >= 5) {
+            // Benchmark has enough data — trust it
+            selectedModel = benchmarkAsRuleId;
+            source = 'benchmark-data';
+            confidence = this.computeBenchmarkConfidence(benchmarkDecision, benchmarkDataPoints);
+            reasoning =
+                `Systems disagree (rule-based: ${ruleModelId}, benchmark: ${benchmarkAsRuleId}). ` +
+                    `Benchmark router preferred with ${benchmarkDataPoints} data points for this category. ` +
+                    `Benchmark: ${benchmarkDecision.reason}. ` +
+                    `Rule-based: ${ruleClassification.reasoning}.`;
+        }
+        else {
+            // Not enough benchmark data — trust rule-based
+            selectedModel = ruleModelId;
+            source = 'rule-based';
+            confidence = this.computeRuleBasedConfidence(ruleClassification, benchmarkDataPoints);
+            reasoning =
+                `Systems disagree (rule-based: ${ruleModelId}, benchmark: ${benchmarkAsRuleId}). ` +
+                    `Rule-based router preferred — benchmark has only ${benchmarkDataPoints} data points (< 5 threshold). ` +
+                    `Rule-based: ${ruleClassification.reasoning}. ` +
+                    `Benchmark: ${benchmarkDecision.reason}.`;
+        }
+        // Determine fallback
+        const fallbackModel = this.selectFallback(selectedModel, ruleClassification, benchmarkDecision);
+        return {
+            selectedModel,
+            fallbackModel,
+            source,
+            confidence,
+            reasoning,
+            ruleBasedClassification: ruleClassification,
+            benchmarkDecision,
+            systemsAgreed,
+            benchmarkDataPoints,
+        };
+    }
+    /**
+     * Record a task outcome, feeding back to the benchmark-data router for learning.
+     */
+    recordOutcome(outcome) {
+        const benchmarkModelId = RULE_TO_BENCHMARK_MODEL_MAP[outcome.modelUsed] ?? outcome.modelUsed;
+        // Only record if it's a valid benchmark model ID
+        if (getModelFingerprint(benchmarkModelId)) {
+            recordTaskOutcome(benchmarkModelId, outcome.success, outcome.latencyMs, outcome.taskCategory);
+        }
+    }
+    /**
+     * Show both systems' recommendations side by side for analysis/debugging.
+     */
+    analyzeRouting(taskDescription) {
+        const ruleClassification = this.ruleRouter.classifyTask(taskDescription);
+        const difficulty = complexityToDifficulty(ruleClassification.complexity);
+        const benchmarkDecision = benchmarkRouteTask(taskDescription, difficulty, this.benchmarkConfig);
+        const unifiedResult = this.route(taskDescription);
+        // Build model comparison across all known models
+        const allRuleModels = this.ruleRouter.getAllModels();
+        const allBenchmarkFingerprints = getAllModelFingerprints();
+        const modelComparison = allRuleModels.map((model) => {
+            const benchmarkId = RULE_TO_BENCHMARK_MODEL_MAP[model.id] ?? null;
+            const fp = benchmarkId ? (allBenchmarkFingerprints[benchmarkId] ?? null) : null;
+            // Find the category data points from the benchmark fingerprint
+            const categoryDataPoints = fp
+                ? this.getCategoryDataPointsFromFingerprint(fp, taskDescription)
+                : null;
+            return {
+                modelId: model.id,
+                benchmarkModelId: benchmarkId,
+                ruleBasedRole: this.getRoleForModel(model.id),
+                benchmarkSuccessRate: fp ? fp.successRate : null,
+                benchmarkCategoryDataPoints: categoryDataPoints,
+            };
+        });
+        return {
+            taskDescription,
+            ruleBasedResult: {
+                suggestedModel: ruleClassification.suggestedModel,
+                complexity: ruleClassification.complexity,
+                taskType: ruleClassification.taskType,
+                reasoning: ruleClassification.reasoning,
+            },
+            benchmarkResult: {
+                primaryModel: benchmarkDecision.primary,
+                score: `${benchmarkDecision.estimatedSuccessRate * 100}%`,
+                estimatedSuccessRate: benchmarkDecision.estimatedSuccessRate,
+                estimatedLatencyMs: benchmarkDecision.estimatedLatencyMs,
+                estimatedCost: benchmarkDecision.estimatedCost,
+                reasoning: benchmarkDecision.reason,
+            },
+            unifiedResult,
+            modelComparison,
+        };
+    }
+    /**
+     * Get the underlying rule-based router for advanced usage.
+     */
+    getRuleRouter() {
+        return this.ruleRouter;
+    }
+    // --- Private helpers ---
+    /**
+     * Get the number of benchmark data points for the most relevant category
+     * for a given task description, using the benchmark model's fingerprint.
+     */
+    getCategoryDataPoints(fingerprint, _taskDescription) {
+        if (!fingerprint?.categoryStats)
+            return 0;
+        return this.getMaxCategoryAttempts(fingerprint);
+    }
+    /**
+     * Same as getCategoryDataPoints but takes a fingerprint directly (no model lookup).
+     */
+    getCategoryDataPointsFromFingerprint(fingerprint, _taskDescription) {
+        if (!fingerprint.categoryStats)
+            return 0;
+        return this.getMaxCategoryAttempts(fingerprint);
+    }
+    /**
+     * Get the maximum number of attempts across all categories for a fingerprint.
+     * This represents the most-exercised category and serves as a proxy for
+     * how much data we have for this model.
+     */
+    getMaxCategoryAttempts(fingerprint) {
+        if (!fingerprint.categoryStats)
+            return 0;
+        let max = 0;
+        for (const stats of Object.values(fingerprint.categoryStats)) {
+            if (stats.attempts > max) {
+                max = stats.attempts;
+            }
+        }
+        return max;
+    }
+    /**
+     * Compute confidence when both systems agree.
+     * Higher confidence because consensus is a strong signal.
+     */
+    computeConsensusConfidence(ruleClassification, benchmarkDecision, dataPoints) {
+        // Base: 0.7 for consensus agreement
+        let confidence = 0.7;
+        // Boost from benchmark success rate
+        confidence += benchmarkDecision.estimatedSuccessRate * 0.15;
+        // Boost from data richness (max +0.1 at 10+ data points)
+        confidence += Math.min(dataPoints / 10, 1) * 0.1;
+        // Small boost if rule-based had high keyword match count
+        if (ruleClassification.keywords.length >= 3) {
+            confidence += 0.05;
+        }
+        return Math.min(confidence, 1.0);
+    }
+    /**
+     * Compute confidence when using the benchmark-data router (disagreement case).
+     */
+    computeBenchmarkConfidence(benchmarkDecision, dataPoints) {
+        // Base: 0.5 (disagreement lowers base)
+        let confidence = 0.5;
+        // Strong boost from benchmark success rate
+        confidence += benchmarkDecision.estimatedSuccessRate * 0.2;
+        // Data richness boost (max +0.15 at 15+ data points)
+        confidence += Math.min(dataPoints / 15, 1) * 0.15;
+        return Math.min(confidence, 1.0);
+    }
+    /**
+     * Compute confidence when using the rule-based router (disagreement, low benchmark data).
+     */
+    computeRuleBasedConfidence(ruleClassification, dataPoints) {
+        // Base: 0.5 (disagreement lowers base)
+        let confidence = 0.5;
+        // Boost from rule keyword matches
+        confidence += Math.min(ruleClassification.keywords.length / 5, 1) * 0.15;
+        // Planning requirement is a strong signal for using higher-capability model
+        if (ruleClassification.requiresPlanning) {
+            confidence += 0.1;
+        }
+        // Slight penalty if benchmark had some data (even if below threshold)
+        if (dataPoints > 0) {
+            confidence -= 0.05;
+        }
+        return Math.min(Math.max(confidence, 0.1), 1.0);
+    }
+    /**
+     * Select the best fallback model from the two systems' recommendations.
+     */
+    selectFallback(selectedModel, ruleClassification, benchmarkDecision) {
+        // Try rule-based fallback first
+        if (ruleClassification.fallbackModel && ruleClassification.fallbackModel !== selectedModel) {
+            return ruleClassification.fallbackModel;
+        }
+        // Try benchmark fallbacks
+        for (const fallbackId of benchmarkDecision.fallback) {
+            const asRuleId = BENCHMARK_TO_RULE_MODEL_MAP[fallbackId] ?? fallbackId;
+            if (asRuleId !== selectedModel) {
+                return asRuleId;
+            }
+        }
+        // Last resort: return rule-based fallback even if same (caller can handle)
+        return ruleClassification.fallbackModel;
+    }
+    /**
+     * Get the role assigned to a model in the rule-based router.
+     */
+    getRoleForModel(modelId) {
+        for (const role of ['planner', 'executor', 'reviewer', 'fallback']) {
+            const model = this.ruleRouter.getModelForRole(role);
+            if (model && model.id === modelId) {
+                return role;
+            }
+        }
+        return null;
+    }
+}
+/**
+ * Create a UnifiedRoutingService with the given configuration.
+ */
+export function createUnifiedRouter(config, benchmarkConfig) {
+    return new UnifiedRoutingService(config, benchmarkConfig);
+}
+//# sourceMappingURL=unified-router.js.map

package/dist/models/unified-router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unified-router.js","sourceRoot":"","sources":["../../src/models/unified-router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,WAAW,IAAI,eAAe,EAAE,MAAM,aAAa,CAAC;AAC7D,OAAO,EACL,SAAS,IAAI,kBAAkB,EAC/B,iBAAiB,EACjB,mBAAmB,EACnB,uBAAuB,GAKxB,MAAM,2BAA2B,CAAC;AAQnC;;;GAGG;AACH,MAAM,2BAA2B,GAA2B;IAC1D,iBAAiB,EAAE,UAAU;IAC7B,SAAS,EAAE,SAAS;IACpB,SAAS,EAAE,SAAS;IACpB,eAAe,EAAE,SAAS;CAC3B,CAAC;AAEF,MAAM,2BAA2B,GAA4B;IAC3D,UAAU,EAAE,iBAAiB;IAC7B,SAAS,EAAE,SAAS;IACpB,SAAS,EAAE,SAAS;IACpB,eAAe,EAAE,SAAS,EAAE,gEAAgE;IAC5F,mBAAmB,EAAE,SAAS;IAC9B,YAAY,EAAE,SAAS;CACxB,CAAC;AAEF;;GAEG;AACH,SAAS,sBAAsB,CAAC,UAA0B;IACxD,QAAQ,UAAU,EAAE,CAAC;QACnB,KAAK,KAAK;YACR,OAAO,MAAM,CAAC;QAChB,KAAK,QAAQ;YACX,OAAO,QAAQ,CAAC;QAClB,KAAK,MAAM,CAAC;QACZ,KAAK,UAAU;YACb,OAAO,MAAM,CAAC;IAClB,CAAC;AACH,CAAC;AAqED;;GAEG;AACH,MAAM,OAAO,qBAAqB;IACxB,UAAU,CAAkB;IAC5B,eAAe,CAAyB;IAEhD;;;OAGG;IACH,YAAY,MAAwB,EAAE,kBAA0C,EAAE;QAChF,IAAI,CAAC,UAAU,GAAG,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IACzC,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,eAAuB;QAC3B,yCAAyC;QACzC,MAAM,kBAAkB,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QAEzE,4CAA4C;QAC5C,MAAM,UAAU,GAAG,sBAAsB,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;QACzE,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,eAAe,EAAE,UAAU,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;QAEhG,wCAAwC;QACxC,MAAM,WAAW,GAAG,kBAAkB,CAAC,cAAc,CAAC;QACtD,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,OAAO,CAAC;QACnD,MAAM,iBAAiB,GAAG,2BAA2B,CAAC,gBAAgB,CAAC,IAAI,gBAAgB,CAAC;QAE5F,wDAAwD;QACxD,MAAM,oBAAoB,GAAG,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;QACnE,MAAM,mBAAmB,GAAG,IAAI,CAAC,qBAAqB,CAAC,oBAAoB,EAAE,eAAe,CAAC,CAAC;QAE9F,qCAAqC;QACrC,MAAM,aAAa,GAAG,WAAW,KAAK,iBAAiB,CAAC;QAExD,IAAI,aAAqB,CAAC;QAC1B,IAAI,MAAsC,CAAC;QAC3C,IAAI,UAAkB,CAAC;QACvB,IAAI,SAAiB,CAAC;QAEtB,IAAI,aAAa,EAAE,CAAC;YAClB,gCAAgC;YAChC,aAAa,GAAG,WAAW,CAAC;YAC5B,MAAM,GAAG,WAAW,CAAC;YACrB,UAAU,GAAG,IAAI,CAAC,0BAA0B,CAC1C,kBAAkB,EAClB,iBAAiB,EACjB,mBAAmB,CACpB,CAAC;YACF,SAAS;gBACP,iCAAiC,aAAa,IAAI;oBAClD,eAAe,kBAAkB,CAAC,SAAS,IAAI;oBAC/C,cAAc,iBAAiB,CAAC,MAAM,GAAG,CAAC;QAC9C,CAAC;aAAM,IAAI,mBAAmB,IAAI,CAAC,EAAE,CAAC;YACpC,uCAAuC;YACvC,aAAa,GAAG,iBAAiB,CAAC;YAClC,MAAM,GAAG,gBAAgB,CAAC;YAC1B,UAAU,GAAG,IAAI,CAAC,0BAA0B,CAAC,iBAAiB,EAAE,mBAAmB,CAAC,CAAC;YACrF,SAAS;gBACP,iCAAiC,WAAW,gBAAgB,iBAAiB,KAAK;oBAClF,mCAAmC,mBAAmB,kCAAkC;oBACxF,cAAc,iBAAiB,CAAC,MAAM,IAAI;oBAC1C,eAAe,kBAAkB,CAAC,SAAS,GAAG,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,+CAA+C;YAC/C,aAAa,GAAG,WAAW,CAAC;YAC5B,MAAM,GAAG,YAAY,CAAC;YACtB,UAAU,GAAG,IAAI,CAAC,0BAA0B,CAAC,kBAAkB,EAAE,mBAAmB,CAAC,CAAC;YACtF,SAAS;gBACP,iCAAiC,WAAW,gBAAgB,iBAAiB,KAAK;oBAClF,oDAAoD,mBAAmB,gCAAgC;oBACvG,eAAe,kBAAkB,CAAC,SAAS,IAAI;oBAC/C,cAAc,iBAAiB,CAAC,MAAM,GAAG,CAAC;QAC9C,CAAC;QAED,qBAAqB;QACrB,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,aAAa,EAAE,kBAAkB,EAAE,iBAAiB,CAAC,CAAC;QAEhG,OAAO;YACL,aAAa;YACb,aAAa;YACb,MAAM;YACN,UAAU;YACV,SAAS;YACT,uBAAuB,EAAE,kBAAkB;YAC3C,iBAAiB;YACjB,aAAa;YACb,mBAAmB;SACpB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,OAAsB;QAClC,MAAM,gBAAgB,GACpB,2BAA2B,CAAC,OAAO,CAAC,SAAS,CAAC,IAAK,OAAO,CAAC,SAAqB,CAAC;QAEnF,iDAAiD;QACjD,IAAI,mBAAmB,CAAC,gBAA2B,CAAC,EAAE,CAAC;YACrD,iBAAiB,CACf,gBAA2B,EAC3B,OAAO,CAAC,OAAO,EACf,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,YAAY,CACrB,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,eAAuB;QACpC,MAAM,kBAAkB,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QACzE,MAAM,UAAU,GAAG,sBAAsB,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;QACzE,MAAM,iBAAiB,GAAG,kBAAkB,CAAC,eAAe,EAAE,UAAU,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;QAChG,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAElD,iDAAiD;QACjD,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC;QACrD,MAAM,wBAAwB,GAAG,uBAAuB,EAAE,CAAC;QAE3D,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,KAAkB,EAAE,EAAE;YAC/D,MAAM,WAAW,GAAG,2BAA2B,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;YAClE,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,WAAsB,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAE3F,+DAA+D;YAC/D,MAAM,kBAAkB,GAAG,EAAE;gBAC3B,CAAC,CAAC,IAAI,CAAC,oCAAoC,CAAC,EAAE,EAAE,eAAe,CAAC;gBAChE,CAAC,CAAC,IAAI,CAAC;YAET,OAAO;gBACL,OAAO,EAAE,KAAK,CAAC,EAAE;gBACjB,gBAAgB,EAAE,WAA6B;gBAC/C,aAAa,EAAE,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC7C,oBAAoB,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI;gBAChD,2BAA2B,EAAE,kBAAkB;aAChD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,eAAe;YACf,eAAe,EAAE;gBACf,cAAc,EAAE,kBAAkB,CAAC,cAAc;gBACjD,UAAU,EAAE,kBAAkB,CAAC,UAAU;gBACzC,QAAQ,EAAE,kBAAkB,CAAC,QAAQ;gBACrC,SAAS,EAAE,kBAAkB,CAAC,SAAS;aACxC;YACD,eAAe,EAAE;gBACf,YAAY,EAAE,iBAAiB,CAAC,OAAO;gBACvC,KAAK,EAAE,GAAG,iBAAiB,CAAC,oBAAoB,GAAG,GAAG,GAAG;gBACzD,oBAAoB,EAAE,iBAAiB,CAAC,oBAAoB;gBAC5D,kBAAkB,EAAE,iBAAiB,CAAC,kBAAkB;gBACxD,aAAa,EAAE,iBAAiB,CAAC,aAAa;gBAC9C,SAAS,EAAE,iBAAiB,CAAC,MAAM;aACpC;YACD,aAAa;YACb,eAAe;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,0BAA0B;IAE1B;;;OAGG;IACK,qBAAqB,CAC3B,WAAoC,EACpC,gBAAwB;QAExB,IAAI,CAAC,WAAW,EAAE,aAAa;YAAE,OAAO,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,sBAAsB,CAAC,WAAW,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,oCAAoC,CAC1C,WAA6B,EAC7B,gBAAwB;QAExB,IAAI,CAAC,WAAW,CAAC,aAAa;YAAE,OAAO,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,sBAAsB,CAAC,WAAW,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACK,sBAAsB,CAAC,WAA6B;QAC1D,IAAI,CAAC,WAAW,CAAC,aAAa;YAAE,OAAO,CAAC,CAAC;QACzC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,aAAa,CAAC,EAAE,CAAC;YAC7D,IAAI,KAAK,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC;gBACzB,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACK,0BAA0B,CAChC,kBAA4C,EAC5C,iBAAkC,EAClC,UAAkB;QAElB,oCAAoC;QACpC,IAAI,UAAU,GAAG,GAAG,CAAC;QAErB,oCAAoC;QACpC,UAAU,IAAI,iBAAiB,CAAC,oBAAoB,GAAG,IAAI,CAAC;QAE5D,yDAAyD;QACzD,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;QAEjD,yDAAyD;QACzD,IAAI,kBAAkB,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC5C,UAAU,IAAI,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACK,0BAA0B,CAChC,iBAAkC,EAClC,UAAkB;QAElB,uCAAuC;QACvC,IAAI,UAAU,GAAG,GAAG,CAAC;QAErB,2CAA2C;QAC3C,UAAU,IAAI,iBAAiB,CAAC,oBAAoB,GAAG,GAAG,CAAC;QAE3D,qDAAqD;QACrD,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QAElD,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACK,0BAA0B,CAChC,kBAA4C,EAC5C,UAAkB;QAElB,uCAAuC;QACvC,IAAI,UAAU,GAAG,GAAG,CAAC;QAErB,kCAAkC;QAClC,UAAU,IAAI,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;QAEzE,4EAA4E;QAC5E,IAAI,kBAAkB,CAAC,gBAAgB,EAAE,CAAC;YACxC,UAAU,IAAI,GAAG,CAAC;QACpB,CAAC;QAED,sEAAsE;QACtE,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,UAAU,IAAI,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACK,cAAc,CACpB,aAAqB,EACrB,kBAA4C,EAC5C,iBAAkC;QAElC,gCAAgC;QAChC,IAAI,kBAAkB,CAAC,aAAa,IAAI,kBAAkB,CAAC,aAAa,KAAK,aAAa,EAAE,CAAC;YAC3F,OAAO,kBAAkB,CAAC,aAAa,CAAC;QAC1C,CAAC;QAED,0BAA0B;QAC1B,KAAK,MAAM,UAAU,IAAI,iBAAiB,CAAC,QAAQ,EAAE,CAAC;YACpD,MAAM,QAAQ,GAAG,2BAA2B,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC;YACvE,IAAI,QAAQ,KAAK,aAAa,EAAE,CAAC;gBAC/B,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QAED,2EAA2E;QAC3E,OAAO,kBAAkB,CAAC,aAAa,CAAC;IAC1C,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,OAAe;QACrC,KAAK,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,CAAU,EAAE,CAAC;YAC5E,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACpD,IAAI,KAAK,IAAI,KAAK,CAAC,EAAE,KAAK,OAAO,EAAE,CAAC;gBAClC,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAwB,EACxB,eAAwC;IAExC,OAAO,IAAI,qBAAqB,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;AAC5D,CAAC"}

package/dist/policies/convert-policy-to-claude.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env tsx
+export declare function convertPolicyToClaude(rawMarkdown: string): string;
+//# sourceMappingURL=convert-policy-to-claude.d.ts.map

package/dist/policies/convert-policy-to-claude.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"convert-policy-to-claude.d.ts","sourceRoot":"","sources":["../../src/policies/convert-policy-to-claude.ts"],"names":[],"mappings":";AAIA,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CA+EjE"}

package/dist/policies/convert-policy-to-claude.js

@@ -0,0 +1,87 @@
+#!/usr/bin/env tsx
+import { readFileSync, writeFileSync } from 'node:fs';
+import { join } from 'node:path';
+export function convertPolicyToClaude(rawMarkdown) {
+    const nameMatch = rawMarkdown.match(/^#\s+(.+)/m);
+    const name = nameMatch ? nameMatch[1].trim() : 'Untitled Policy';
+    const descMatch = rawMarkdown.match(/^#\s*.*\n\n(.*?)(?=\n-{3,}|##|$)/s);
+    const description = descMatch ? descMatch[1].trim() : '';
+    const rulesSection = rawMarkdown.match(/## Rules\n\n([\s\S]*?)(?=\n┌|## Enforcement|$)/);
+    const rules = [];
+    if (rulesSection) {
+        const ruleLines = rulesSection[1].split('\n');
+        let currentRule = null;
+        for (const line of ruleLines) {
+            const ruleMatch = line.match(/^(\d+)\.\s+\*\*(.+?)\*\*/);
+            if (ruleMatch) {
+                if (currentRule)
+                    rules.push(currentRule);
+                currentRule = { title: ruleMatch[2], details: [] };
+                continue;
+            }
+            if (line.trim().startsWith('- ')) {
+                currentRule?.details.push(line.trim().substring(2));
+            }
+            else if (line.trim() && !line.startsWith('#')) {
+                currentRule?.details.push(line.trim());
+            }
+        }
+        if (currentRule)
+            rules.push(currentRule);
+    }
+    const tableMatch = rawMarkdown.match(/\| Rule[^|]+\| Prevents \|[\s\S]*?\n└────────.*\n/);
+    const preventionTable = [];
+    if (tableMatch) {
+        const rows = tableMatch[0].split('\n').filter((_, i) => i > 1 && !_.includes('---'));
+        for (const row of rows) {
+            const cells = row
+                .split('|')
+                .map((c) => c.trim())
+                .filter(Boolean);
+            if (cells.length >= 2) {
+                preventionTable.push({ rule: cells[0], prevents: cells[1] });
+            }
+        }
+    }
+    const levelMatch = rawMarkdown.match(/## Enforcement Level\s*\n\[(.+?)\]/);
+    const level = (levelMatch?.[1]?.toUpperCase() || 'RECOMMENDED');
+    const emoji = level === 'REQUIRED' ? '🚨' : level === 'RECOMMENDED' ? '⚠️' : 'ℹ️';
+    return `─────────────────────────────────────────────────────────────────────────────────────────────────
+${emoji} ${level} POLICY
+# ${name}
+
+${description}
+
+─────────────────────────────────────────────────────────────────────────────────────────────────
+
+## Rules
+
+${rules
+        .map((rule, i) => `### ${i + 1}. ${rule.title}
+
+${rule.details.join('\n')}
+`)
+        .join('')}
+
+## Prevention Matrix
+
+| Rule | Prevents |
+|------|----------|
+${preventionTable.map((t) => `| ${t.rule} | ${t.prevents} |`).join('\n')}
+
+─────────────────────────────────────────────────────────────────────────────────────────────────
+`;
+}
+if (import.meta.url === `file://${process.argv[1]}`) {
+    const inputFile = process.argv[2];
+    const outputFile = process.argv[3] || 'converted-policy.md';
+    if (!inputFile) {
+        console.error('Usage: tsx convert-policy-to-claude.ts <input.md> [output.md]');
+        process.exit(1);
+    }
+    const rawPolicy = readFileSync(inputFile, 'utf-8');
+    const converted = convertPolicyToClaude(rawPolicy);
+    writeFileSync(outputFile, converted);
+    console.log(`✅ Converted ${join(process.cwd(), inputFile)} → ${outputFile}`);
+}
+//# sourceMappingURL=convert-policy-to-claude.js.map

package/dist/policies/convert-policy-to-claude.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"convert-policy-to-claude.js","sourceRoot":"","sources":["../../src/policies/convert-policy-to-claude.ts"],"names":[],"mappings":";AACA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,MAAM,UAAU,qBAAqB,CAAC,WAAmB;IACvD,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC;IAEjE,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACzE,MAAM,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEzD,MAAM,YAAY,GAAG,WAAW,CAAC,KAAK,CAAC,gDAAgD,CAAC,CAAC;IACzF,MAAM,KAAK,GAAgD,EAAE,CAAC;IAE9D,IAAI,YAAY,EAAE,CAAC;QACjB,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,WAAW,GAAgD,IAAI,CAAC;QAEpE,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;YACzD,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,WAAW;oBAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACzC,WAAW,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;gBACnD,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjC,WAAW,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;iBAAM,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChD,WAAW,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,IAAI,WAAW;YAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,mDAAmD,CAAC,CAAC;IAC1F,MAAM,eAAe,GAA8C,EAAE,CAAC;IAEtE,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QACrF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,GAAG;iBACd,KAAK,CAAC,GAAG,CAAC;iBACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;iBACpB,MAAM,CAAC,OAAO,CAAC,CAAC;YACnB,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACtB,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,oCAAoC,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,aAAa,CAAQ,CAAC;IAEvE,MAAM,KAAK,GAAG,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAElF,OAAO;EACP,KAAK,IAAI,KAAK;IACZ,IAAI;;EAEN,WAAW;;;;;;EAMX,KAAK;SACJ,GAAG,CACF,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK;;EAE1C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;CACxB,CACE;SACA,IAAI,CAAC,EAAE,CAAC;;;;;;EAMT,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;;;CAGvE,CAAC;AACF,CAAC;AAED,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,UAAU,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IACpD,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,qBAAqB,CAAC;IAE5D,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,+DAA+D,CAAC,CAAC;QAC/E,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,SAAS,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACnD,MAAM,SAAS,GAAG,qBAAqB,CAAC,SAAS,CAAC,CAAC;IACnD,aAAa,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACrC,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,MAAM,UAAU,EAAE,CAAC,CAAC;AAC/E,CAAC"}

package/dist/policies/database-manager.d.ts

@@ -0,0 +1,27 @@
+export declare class DatabaseManager {
+    private db;
+    constructor(dbPath?: string);
+    private initialize;
+    private serialize;
+    private deserializeRow;
+    upsertPolicy(data: Record<string, unknown>): void;
+    findPolicies(where: Record<string, unknown>): Record<string, unknown>[];
+    findOnePolicy(where: Record<string, unknown>): Record<string, unknown> | null;
+    updatePolicy(where: Record<string, unknown>, updates: Record<string, unknown>): void;
+    getAllActivePolicies(): Record<string, unknown>[];
+    upsertExecutableTool(data: Record<string, unknown>): void;
+    findExecutableTools(policyId: string): Record<string, unknown>[];
+    findExecutableTool(policyId: string, toolName: string): Record<string, unknown> | null;
+    logExecution(data: {
+        policyId: string;
+        toolName: string;
+        operation: string;
+        args: Record<string, unknown>;
+        result: unknown;
+        allowed: boolean;
+        reason: string;
+    }): void;
+    getExecutionLog(policyId?: string, limit?: number): Record<string, unknown>[];
+    close(): void;
+}
+//# sourceMappingURL=database-manager.d.ts.map

package/dist/policies/database-manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"database-manager.d.ts","sourceRoot":"","sources":["../../src/policies/database-manager.ts"],"names":[],"mappings":"AAIA,qBAAa,eAAe;IAC1B,OAAO,CAAC,EAAE,CAAgC;gBAE9B,MAAM,CAAC,EAAE,MAAM;IAW3B,OAAO,CAAC,UAAU;IAoDlB,OAAO,CAAC,SAAS;IAOjB,OAAO,CAAC,cAAc;IAmCtB,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAYjD,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;IASvE,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAK7E,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAsBpF,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;IASjD,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAOzD,mBAAmB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;IAMhE,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAStF,YAAY,CAAC,IAAI,EAAE;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;QACjB,SAAS,EAAE,MAAM,CAAC;QAClB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC9B,MAAM,EAAE,OAAO,CAAC;QAChB,OAAO,EAAE,OAAO,CAAC;QACjB,MAAM,EAAE,MAAM,CAAC;KAChB,GAAG,IAAI;IAgBR,eAAe,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE;IAajF,KAAK,IAAI,IAAI;CAGd"}