@planu/cli 0.28.0 → 0.29.0

package/dist/engine/model-router/complexity-analyzer.js

@@ -0,0 +1,182 @@
+// engine/model-router/complexity-analyzer.ts — Extract and normalise complexity signals.
+// SPEC-076 AC-01
+// ---------------------------------------------------------------------------
+// Normalisation ceilings (signals are clamped to 0-1 using these maximums)
+// ---------------------------------------------------------------------------
+const MAX_CRITERIA = 40;
+const MAX_FILES = 30;
+const MAX_DEPTH = 6;
+const MAX_CROSS_LAYER = 5;
+const MAX_HOURS = 80;
+/** Clamp a value into [0, 1] by dividing by its ceiling. */
+function norm(value, ceiling) {
+    if (ceiling <= 0) {
+        return 0;
+    }
+    return Math.min(Math.max(value / ceiling, 0), 1);
+}
+// ---------------------------------------------------------------------------
+// Signal extraction from text
+// ---------------------------------------------------------------------------
+const TASK_KEYWORDS = {
+    search: ['search', 'find', 'explore', 'list', 'read', 'summarize', 'grep'],
+    generation: ['generate', 'create', 'implement', 'write', 'build', 'add', 'scaffold'],
+    architecture: ['architect', 'design', 'restructure', 'system', 'plan', 'rfc'],
+    debugging: ['debug', 'fix', 'investigate', 'trace', 'diagnose', 'bug', 'error'],
+    refactor: ['refactor', 'rename', 'extract', 'simplify', 'clean', 'reorganize', 'move'],
+};
+const SECURITY_KEYWORDS = [
+    'security',
+    'auth',
+    'permission',
+    'rbac',
+    'encryption',
+    'token',
+    'jwt',
+    'cors',
+    'csrf',
+    'xss',
+    'injection',
+    'sanitize',
+    'pii',
+    'gdpr',
+];
+const DB_KEYWORDS = [
+    'database',
+    'migration',
+    'schema',
+    'table',
+    'column',
+    'index',
+    'query',
+    'sql',
+    'postgres',
+    'mysql',
+    'mongo',
+    'redis',
+    'prisma',
+    'drizzle',
+];
+/** Infer a TaskType from a text description. */
+function inferTaskType(text) {
+    const lower = text.toLowerCase();
+    let bestType = 'generation';
+    let bestScore = 0;
+    for (const [type, keywords] of Object.entries(TASK_KEYWORDS)) {
+        const score = keywords.filter((kw) => lower.includes(kw)).length;
+        if (score > bestScore) {
+            bestScore = score;
+            bestType = type;
+        }
+    }
+    return bestType;
+}
+/** Count how many keywords from a list appear in a text. */
+function keywordHits(text, keywords) {
+    const lower = text.toLowerCase();
+    return keywords.filter((kw) => lower.includes(kw)).length;
+}
+/** Count acceptance criteria by looking for AC- or numbered list patterns. */
+function countCriteria(text) {
+    const acMatches = text.match(/\bAC-\d+/g);
+    if (acMatches) {
+        return acMatches.length;
+    }
+    // Fallback: count markdown list items that look like criteria
+    const listItems = text.match(/^[-*]\s+/gm);
+    return listItems ? Math.ceil(listItems.length / 2) : 0;
+}
+/** Estimate file count from technical sheet patterns. */
+function countFiles(text) {
+    const fileRefs = text.match(/`[^`]+\.(ts|js|json|md|tsx|jsx|py|go|rs)`/g);
+    return fileRefs ? fileRefs.length : 0;
+}
+/** Count distinct architectural layers referenced. */
+function countLayers(text) {
+    const layers = ['types/', 'engine/', 'tools/', 'storage/', 'config/', 'resources/'];
+    return layers.filter((l) => text.includes(l)).length;
+}
+// ---------------------------------------------------------------------------
+// Internal helpers to reduce extractSignals complexity
+// ---------------------------------------------------------------------------
+/** Extract boolean and categorical signals from text, applying overrides. */
+function extractQualitativeSignals(text, overrides) {
+    return {
+        hasNewTypes: overrides?.hasNewTypes ?? text.includes('types/'),
+        hasDBChanges: overrides?.hasDBChanges ?? keywordHits(text, DB_KEYWORDS) >= 2,
+        hasSecurityImplications: overrides?.hasSecurityImplications ?? keywordHits(text, SECURITY_KEYWORDS) >= 2,
+        isReadOnly: overrides?.isReadOnly ?? false,
+        taskType: overrides?.taskType ?? inferTaskType(text),
+    };
+}
+/** Extract raw signal values from text, applying overrides. */
+function extractRawSignals(text, overrides) {
+    const criteriaCount = overrides?.criteriaCount ?? countCriteria(text);
+    const fileCount = overrides?.fileCount ?? countFiles(text);
+    const crossLayerCount = overrides?.crossLayerCount ?? countLayers(text);
+    const dependencyDepth = overrides?.dependencyDepth ?? Math.min(crossLayerCount, MAX_DEPTH);
+    const estimatedHours = overrides?.estimatedHours ?? criteriaCount * 0.5;
+    const qualitative = extractQualitativeSignals(text, overrides);
+    return {
+        criteriaCount,
+        fileCount,
+        dependencyDepth,
+        crossLayerCount,
+        estimatedHours,
+        ...qualitative,
+    };
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Extract complexity signals from a text description (spec content or task description).
+ * Missing signals are filled with sensible defaults.
+ */
+export function extractSignals(text, overrides) {
+    const raw = extractRawSignals(text, overrides);
+    const normalised = normaliseSignals(raw);
+    const overallScore = computeOverallScore(normalised);
+    return { ...raw, overallScore };
+}
+/** Build signals entirely from an explicit partial object (no text analysis). */
+export function buildSignalsFromPartial(partial) {
+    return extractSignals('', partial);
+}
+/** Normalise raw numeric signals to the 0-1 range. */
+export function normaliseSignals(raw) {
+    return {
+        criteriaCount: norm(raw.criteriaCount, MAX_CRITERIA),
+        fileCount: norm(raw.fileCount, MAX_FILES),
+        dependencyDepth: norm(raw.dependencyDepth, MAX_DEPTH),
+        crossLayerCount: norm(raw.crossLayerCount, MAX_CROSS_LAYER),
+        estimatedHours: norm(raw.estimatedHours, MAX_HOURS),
+        hasNewTypes: raw.hasNewTypes ? 1 : 0,
+        hasDBChanges: raw.hasDBChanges ? 1 : 0,
+        hasSecurityImplications: raw.hasSecurityImplications ? 1 : 0,
+        isReadOnly: raw.isReadOnly ? 1 : 0,
+    };
+}
+/**
+ * Compute a weighted overall complexity score (0-1) from normalised signals.
+ * Higher = more complex.
+ */
+export function computeOverallScore(n) {
+    const weights = {
+        criteriaCount: 0.25,
+        fileCount: 0.15,
+        dependencyDepth: 0.1,
+        crossLayerCount: 0.15,
+        estimatedHours: 0.1,
+        hasNewTypes: 0.05,
+        hasDBChanges: 0.05,
+        hasSecurityImplications: 0.1,
+        isReadOnly: -0.05, // read-only reduces complexity
+    };
+    let score = 0;
+    for (const [key, weight] of Object.entries(weights)) {
+        score += n[key] * weight;
+    }
+    return Math.min(Math.max(score, 0), 1);
+}
+//# sourceMappingURL=complexity-analyzer.js.map

package/dist/engine/model-router/complexity-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity-analyzer.js","sourceRoot":"","sources":["../../../src/engine/model-router/complexity-analyzer.ts"],"names":[],"mappings":"AAAA,yFAAyF;AACzF,iBAAiB;AASjB,8EAA8E;AAC9E,2EAA2E;AAC3E,8EAA8E;AAE9E,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,SAAS,GAAG,EAAE,CAAC;AACrB,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,SAAS,GAAG,EAAE,CAAC;AAErB,4DAA4D;AAC5D,SAAS,IAAI,CAAC,KAAa,EAAE,OAAe;IAC1C,IAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,8EAA8E;AAC9E,8BAA8B;AAC9B,8EAA8E;AAE9E,MAAM,aAAa,GAA+B;IAChD,MAAM,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC;IAC1E,UAAU,EAAE,CAAC,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,CAAC;IACpF,YAAY,EAAE,CAAC,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,CAAC;IAC7E,SAAS,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC;IAC/E,QAAQ,EAAE,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,CAAC;CACvF,CAAC;AAEF,MAAM,iBAAiB,GAAG;IACxB,UAAU;IACV,MAAM;IACN,YAAY;IACZ,MAAM;IACN,YAAY;IACZ,OAAO;IACP,KAAK;IACL,MAAM;IACN,MAAM;IACN,KAAK;IACL,WAAW;IACX,UAAU;IACV,KAAK;IACL,MAAM;CACP,CAAC;AAEF,MAAM,WAAW,GAAG;IAClB,UAAU;IACV,WAAW;IACX,QAAQ;IACR,OAAO;IACP,QAAQ;IACR,OAAO;IACP,OAAO;IACP,KAAK;IACL,UAAU;IACV,OAAO;IACP,OAAO;IACP,OAAO;IACP,QAAQ;IACR,SAAS;CACV,CAAC;AAEF,gDAAgD;AAChD,SAAS,aAAa,CAAC,IAAY;IACjC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,IAAI,QAAQ,GAAa,YAAY,CAAC;IACtC,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAA2B,EAAE,CAAC;QACvF,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACjE,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;YAClB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,4DAA4D;AAC5D,SAAS,WAAW,CAAC,IAAY,EAAE,QAAkB;IACnD,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACjC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;AAC5D,CAAC;AAED,8EAA8E;AAC9E,SAAS,aAAa,CAAC,IAAY;IACjC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAC1C,IAAI,SAAS,EAAE,CAAC;QACd,OAAO,SAAS,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,8DAA8D;IAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAC3C,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,yDAAyD;AACzD,SAAS,UAAU,CAAC,IAAY;IAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAC1E,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,sDAAsD;AACtD,SAAS,WAAW,CAAC,IAAY;IAC/B,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;IACpF,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AACvD,CAAC;AAED,8EAA8E;AAC9E,uDAAuD;AACvD,8EAA8E;AAE9E,6EAA6E;AAC7E,SAAS,yBAAyB,CAChC,IAAY,EACZ,SAA0B;IAK1B,OAAO;QACL,WAAW,EAAE,SAAS,EAAE,WAAW,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;QAC9D,YAAY,EAAE,SAAS,EAAE,YAAY,IAAI,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC;QAC5E,uBAAuB,EACrB,SAAS,EAAE,uBAAuB,IAAI,WAAW,CAAC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC;QACjF,UAAU,EAAE,SAAS,EAAE,UAAU,IAAI,KAAK;QAC1C,QAAQ,EAAE,SAAS,EAAE,QAAQ,IAAI,aAAa,CAAC,IAAI,CAAC;KACrD,CAAC;AACJ,CAAC;AAED,+DAA+D;AAC/D,SAAS,iBAAiB,CACxB,IAAY,EACZ,SAA0B;IAE1B,MAAM,aAAa,GAAG,SAAS,EAAE,aAAa,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;IACtE,MAAM,SAAS,GAAG,SAAS,EAAE,SAAS,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;IAC3D,MAAM,eAAe,GAAG,SAAS,EAAE,eAAe,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;IACxE,MAAM,eAAe,GAAG,SAAS,EAAE,eAAe,IAAI,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,SAAS,CAAC,CAAC;IAC3F,MAAM,cAAc,GAAG,SAAS,EAAE,cAAc,IAAI,aAAa,GAAG,GAAG,CAAC;IACxE,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAE/D,OAAO;QACL,aAAa;QACb,SAAS;QACT,eAAe;QACf,eAAe;QACf,cAAc;QACd,GAAG,WAAW;KACf,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY,EAAE,SAA0B;IACrE,MAAM,GAAG,GAAG,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAE/C,MAAM,UAAU,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,YAAY,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAErD,OAAO,EAAE,GAAG,GAAG,EAAE,YAAY,EAAE,CAAC;AAClC,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,uBAAuB,CAAC,OAAuB;IAC7D,OAAO,cAAc,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AACrC,CAAC;AAED,sDAAsD;AACtD,MAAM,UAAU,gBAAgB,CAAC,GAUhC;IACC,OAAO;QACL,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,YAAY,CAAC;QACpD,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC;QACzC,eAAe,EAAE,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,SAAS,CAAC;QACrD,eAAe,EAAE,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,eAAe,CAAC;QAC3D,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,SAAS,CAAC;QACnD,WAAW,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,uBAAuB,EAAE,GAAG,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KACnC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAoB;IACtD,MAAM,OAAO,GAA4C;QACvD,aAAa,EAAE,IAAI;QACnB,SAAS,EAAE,IAAI;QACf,eAAe,EAAE,GAAG;QACpB,eAAe,EAAE,IAAI;QACrB,cAAc,EAAE,GAAG;QACnB,WAAW,EAAE,IAAI;QACjB,YAAY,EAAE,IAAI;QAClB,uBAAuB,EAAE,GAAG;QAC5B,UAAU,EAAE,CAAC,IAAI,EAAE,+BAA+B;KACnD,CAAC;IAEF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,KAAK,IAAI,CAAC,CAAC,GAA8B,CAAC,GAAG,MAAM,CAAC;IACtD,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACzC,CAAC"}

package/dist/engine/model-router/cost-estimator.d.ts

@@ -0,0 +1,6 @@
+import type { ComplexitySignals, CostEstimate, ModelTier } from '../../types/index.js';
+/** Calculate the cost estimate for a given model tier and complexity signals. */
+export declare function calculateCost(tier: ModelTier, signals: ComplexitySignals): CostEstimate;
+/** Calculate costs for all three tiers so the user can compare. */
+export declare function calculateAllTierCosts(signals: ComplexitySignals): Record<ModelTier, CostEstimate>;
+//# sourceMappingURL=cost-estimator.d.ts.map

package/dist/engine/model-router/cost-estimator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost-estimator.d.ts","sourceRoot":"","sources":["../../../src/engine/model-router/cost-estimator.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACV,iBAAiB,EACjB,YAAY,EACZ,SAAS,EAEV,MAAM,sBAAsB,CAAC;AAkD9B,iFAAiF;AACjF,wBAAgB,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,iBAAiB,GAAG,YAAY,CAYvF;AAED,mEAAmE;AACnE,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,iBAAiB,GAAG,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,CAMjG"}

package/dist/engine/model-router/cost-estimator.js

@@ -0,0 +1,60 @@
+// engine/model-router/cost-estimator.ts — Token and USD cost estimation per model tier.
+// SPEC-076 AC-04
+import pricingJson from '../../config/ai-model-pricing.json' with { type: 'json' };
+// ---------------------------------------------------------------------------
+// Pricing lookup
+// ---------------------------------------------------------------------------
+const MODEL_IDS = {
+    haiku: 'claude-haiku-3-5',
+    sonnet: 'claude-sonnet-4',
+    opus: 'claude-opus-4',
+};
+function getPricing(tier) {
+    const modelId = MODEL_IDS[tier];
+    const entry = pricingJson.models.find((m) => m.id === modelId);
+    /* c8 ignore next 3 */
+    if (!entry) {
+        return { id: modelId, inputPricePerMillion: 3, outputPricePerMillion: 15 };
+    }
+    return entry;
+}
+// ---------------------------------------------------------------------------
+// Token estimation heuristic
+// ---------------------------------------------------------------------------
+/** Base token estimates per complexity range (overall score brackets). */
+function estimateTokens(signals) {
+    const score = signals.overallScore;
+    // Read-only tasks consume less output
+    const outputMultiplier = signals.isReadOnly ? 0.3 : 1;
+    if (score < 0.3) {
+        return { input: 2_000, output: Math.round(1_000 * outputMultiplier) };
+    }
+    if (score < 0.6) {
+        return { input: 8_000, output: Math.round(5_000 * outputMultiplier) };
+    }
+    return { input: 20_000, output: Math.round(15_000 * outputMultiplier) };
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/** Calculate the cost estimate for a given model tier and complexity signals. */
+export function calculateCost(tier, signals) {
+    const pricing = getPricing(tier);
+    const tokens = estimateTokens(signals);
+    const inputCost = (tokens.input / 1_000_000) * pricing.inputPricePerMillion;
+    const outputCost = (tokens.output / 1_000_000) * pricing.outputPricePerMillion;
+    return {
+        estimatedTokens: tokens.input + tokens.output,
+        estimatedUSD: Math.round((inputCost + outputCost) * 10_000) / 10_000,
+        breakdown: { input: tokens.input, output: tokens.output },
+    };
+}
+/** Calculate costs for all three tiers so the user can compare. */
+export function calculateAllTierCosts(signals) {
+    return {
+        haiku: calculateCost('haiku', signals),
+        sonnet: calculateCost('sonnet', signals),
+        opus: calculateCost('opus', signals),
+    };
+}
+//# sourceMappingURL=cost-estimator.js.map

package/dist/engine/model-router/cost-estimator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost-estimator.js","sourceRoot":"","sources":["../../../src/engine/model-router/cost-estimator.ts"],"names":[],"mappings":"AAAA,wFAAwF;AACxF,iBAAiB;AASjB,OAAO,WAAW,MAAM,oCAAoC,CAAC,OAAO,IAAI,EAAE,MAAM,EAAE,CAAC;AAEnF,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E,MAAM,SAAS,GAA8B;IAC3C,KAAK,EAAE,kBAAkB;IACzB,MAAM,EAAE,iBAAiB;IACzB,IAAI,EAAE,eAAe;CACtB,CAAC;AAEF,SAAS,UAAU,CAAC,IAAe;IACjC,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,KAAK,GAAI,WAAW,CAAC,MAAyB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;IAEnF,sBAAsB;IACtB,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,oBAAoB,EAAE,CAAC,EAAE,qBAAqB,EAAE,EAAE,EAAE,CAAC;IAC7E,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E,0EAA0E;AAC1E,SAAS,cAAc,CAAC,OAA0B;IAChD,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC;IAEnC,sCAAsC;IACtC,MAAM,gBAAgB,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtD,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QAChB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC;IACxE,CAAC;IACD,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QAChB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,gBAAgB,CAAC,EAAE,CAAC;IACxE,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,gBAAgB,CAAC,EAAE,CAAC;AAC1E,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,iFAAiF;AACjF,MAAM,UAAU,aAAa,CAAC,IAAe,EAAE,OAA0B;IACvE,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IAEvC,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,oBAAoB,CAAC;IAC5E,MAAM,UAAU,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,GAAG,OAAO,CAAC,qBAAqB,CAAC;IAE/E,OAAO;QACL,eAAe,EAAE,MAAM,CAAC,KAAK,GAAG,MAAM,CAAC,MAAM;QAC7C,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM;QACpE,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE;KAC1D,CAAC;AACJ,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,qBAAqB,CAAC,OAA0B;IAC9D,OAAO;QACL,KAAK,EAAE,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;QACtC,MAAM,EAAE,aAAa,CAAC,QAAQ,EAAE,OAAO,CAAC;QACxC,IAAI,EAAE,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC;KACrC,CAAC;AACJ,CAAC"}

package/dist/engine/model-router/historical-learner.d.ts

@@ -0,0 +1,26 @@
+import type { HistoricalAdjustment, ModelOutcome, ModelTier } from '../../types/index.js';
+/** Record a model outcome for future learning. */
+export declare function recordOutcome(outcome: ModelOutcome): void;
+/** Get all recorded outcomes (for testing / export). */
+export declare function getOutcomes(): readonly ModelOutcome[];
+/** Clear all outcomes (for testing). */
+export declare function clearOutcomes(): void;
+/** Load outcomes from an external source (e.g. JSON file). */
+export declare function loadOutcomes(loaded: ModelOutcome[]): void;
+/**
+ * Find outcomes whose taskSignature matches the given signature.
+ * Uses exact match for now; vector similarity can be added later (SPEC-075).
+ */
+export declare function findSimilarOutcomes(taskSignature: string): ModelOutcome[];
+/**
+ * Compute a task signature from a description or spec ID.
+ * For now this is a simple normalisation; in the future it can use embeddings.
+ */
+export declare function computeTaskSignature(text: string): string;
+/**
+ * Given the rules engine recommendation and a task signature,
+ * adjust the tier based on historical outcomes.
+ * Maximum adjustment: plus or minus 1 tier.
+ */
+export declare function adjustFromHistory(recommendedModel: ModelTier, taskSignature: string): HistoricalAdjustment;
+//# sourceMappingURL=historical-learner.d.ts.map

package/dist/engine/model-router/historical-learner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"historical-learner.d.ts","sourceRoot":"","sources":["../../../src/engine/model-router/historical-learner.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,oBAAoB,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAuB1F,kDAAkD;AAClD,wBAAgB,aAAa,CAAC,OAAO,EAAE,YAAY,GAAG,IAAI,CAEzD;AAED,wDAAwD;AACxD,wBAAgB,WAAW,IAAI,SAAS,YAAY,EAAE,CAErD;AAED,wCAAwC;AACxC,wBAAgB,aAAa,IAAI,IAAI,CAEpC;AAED,8DAA8D;AAC9D,wBAAgB,YAAY,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,IAAI,CAEzD;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,aAAa,EAAE,MAAM,GAAG,YAAY,EAAE,CAEzE;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEzD;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAC/B,gBAAgB,EAAE,SAAS,EAC3B,aAAa,EAAE,MAAM,GACpB,oBAAoB,CA6CtB"}

package/dist/engine/model-router/historical-learner.js

@@ -0,0 +1,91 @@
+// engine/model-router/historical-learner.ts — Learn from past model outcomes.
+// SPEC-076 AC-03
+// ---------------------------------------------------------------------------
+// In-memory outcome store (JSON persistence is left to the storage layer)
+// ---------------------------------------------------------------------------
+let outcomes = [];
+const TIER_ORDER = ['haiku', 'sonnet', 'opus'];
+function tierIndex(tier) {
+    return TIER_ORDER.indexOf(tier);
+}
+function tierByIndex(index) {
+    const clamped = Math.max(0, Math.min(index, TIER_ORDER.length - 1));
+    return TIER_ORDER[clamped] ?? 'sonnet';
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/** Record a model outcome for future learning. */
+export function recordOutcome(outcome) {
+    outcomes.push(outcome);
+}
+/** Get all recorded outcomes (for testing / export). */
+export function getOutcomes() {
+    return outcomes;
+}
+/** Clear all outcomes (for testing). */
+export function clearOutcomes() {
+    outcomes = [];
+}
+/** Load outcomes from an external source (e.g. JSON file). */
+export function loadOutcomes(loaded) {
+    outcomes = [...loaded];
+}
+/**
+ * Find outcomes whose taskSignature matches the given signature.
+ * Uses exact match for now; vector similarity can be added later (SPEC-075).
+ */
+export function findSimilarOutcomes(taskSignature) {
+    return outcomes.filter((o) => o.taskSignature === taskSignature);
+}
+/**
+ * Compute a task signature from a description or spec ID.
+ * For now this is a simple normalisation; in the future it can use embeddings.
+ */
+export function computeTaskSignature(text) {
+    return text.trim().toLowerCase().replace(/\s+/g, '-').slice(0, 80);
+}
+/**
+ * Given the rules engine recommendation and a task signature,
+ * adjust the tier based on historical outcomes.
+ * Maximum adjustment: plus or minus 1 tier.
+ */
+export function adjustFromHistory(recommendedModel, taskSignature) {
+    const similar = findSimilarOutcomes(taskSignature);
+    if (similar.length === 0) {
+        return {
+            adjustedModel: recommendedModel,
+            reason: 'No historical data available.',
+            adjusted: false,
+        };
+    }
+    const successCount = similar.filter((o) => o.success).length;
+    const failCount = similar.length - successCount;
+    const successRate = successCount / similar.length;
+    // Check if a lighter model was consistently successful
+    const lighterSuccesses = similar.filter((o) => o.success && tierIndex(o.modelUsed) < tierIndex(recommendedModel));
+    if (lighterSuccesses.length >= 2 && successRate > 0.8) {
+        const lighterTier = tierByIndex(tierIndex(recommendedModel) - 1);
+        return {
+            adjustedModel: lighterTier,
+            reason: `Historical data shows a lighter model (${lighterTier}) succeeded ${String(lighterSuccesses.length)} times for similar tasks.`,
+            adjusted: true,
+        };
+    }
+    // Check if the recommended model or lighter models frequently failed
+    const recFailures = similar.filter((o) => !o.success && tierIndex(o.modelUsed) <= tierIndex(recommendedModel));
+    if (recFailures.length >= 2 && failCount > successCount) {
+        const heavierTier = tierByIndex(tierIndex(recommendedModel) + 1);
+        return {
+            adjustedModel: heavierTier,
+            reason: `Historical data shows ${String(recFailures.length)} failures at tier ${recommendedModel} or below — upgrading to ${heavierTier}.`,
+            adjusted: true,
+        };
+    }
+    return {
+        adjustedModel: recommendedModel,
+        reason: 'Historical data supports the current recommendation.',
+        adjusted: false,
+    };
+}
+//# sourceMappingURL=historical-learner.js.map

package/dist/engine/model-router/historical-learner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"historical-learner.js","sourceRoot":"","sources":["../../../src/engine/model-router/historical-learner.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAC9E,iBAAiB;AAIjB,8EAA8E;AAC9E,0EAA0E;AAC1E,8EAA8E;AAE9E,IAAI,QAAQ,GAAmB,EAAE,CAAC;AAElC,MAAM,UAAU,GAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;AAE5D,SAAS,SAAS,CAAC,IAAe;IAChC,OAAO,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,WAAW,CAAC,KAAa;IAChC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,OAAO,UAAU,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC;AACzC,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,kDAAkD;AAClD,MAAM,UAAU,aAAa,CAAC,OAAqB;IACjD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACzB,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,WAAW;IACzB,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,wCAAwC;AACxC,MAAM,UAAU,aAAa;IAC3B,QAAQ,GAAG,EAAE,CAAC;AAChB,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,YAAY,CAAC,MAAsB;IACjD,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,aAAqB;IACvD,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,KAAK,aAAa,CAAC,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY;IAC/C,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACrE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,gBAA2B,EAC3B,aAAqB;IAErB,MAAM,OAAO,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;IACnD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,aAAa,EAAE,gBAAgB;YAC/B,MAAM,EAAE,+BAA+B;YACvC,QAAQ,EAAE,KAAK;SAChB,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IAC7D,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC;IAChD,MAAM,WAAW,GAAG,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;IAElD,uDAAuD;IACvD,MAAM,gBAAgB,GAAG,OAAO,CAAC,MAAM,CACrC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,SAAS,CAAC,gBAAgB,CAAC,CACzE,CAAC;IACF,IAAI,gBAAgB,CAAC,MAAM,IAAI,CAAC,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;QACtD,MAAM,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC;QACjE,OAAO;YACL,aAAa,EAAE,WAAW;YAC1B,MAAM,EAAE,0CAA0C,WAAW,eAAe,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,2BAA2B;YACtI,QAAQ,EAAE,IAAI;SACf,CAAC;IACJ,CAAC;IAED,qEAAqE;IACrE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,gBAAgB,CAAC,CAC3E,CAAC;IACF,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,IAAI,SAAS,GAAG,YAAY,EAAE,CAAC;QACxD,MAAM,WAAW,GAAG,WAAW,CAAC,SAAS,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC;QACjE,OAAO;YACL,aAAa,EAAE,WAAW;YAC1B,MAAM,EAAE,yBAAyB,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,qBAAqB,gBAAgB,4BAA4B,WAAW,GAAG;YAC1I,QAAQ,EAAE,IAAI;SACf,CAAC;IACJ,CAAC;IAED,OAAO;QACL,aAAa,EAAE,gBAAgB;QAC/B,MAAM,EAAE,sDAAsD;QAC9D,QAAQ,EAAE,KAAK;KAChB,CAAC;AACJ,CAAC"}

package/dist/engine/model-router/rules-engine.d.ts

@@ -0,0 +1,13 @@
+import type { ComplexitySignals, RoutingRule, RuleCondition, RuleMatch, RulesEngineResult } from '../../types/index.js';
+/** Evaluate a single condition against a signal value. */
+export declare function evaluateCondition(signals: ComplexitySignals, condition: RuleCondition): boolean;
+/** Evaluate a single rule against the given signals. */
+export declare function evaluateRule(signals: ComplexitySignals, rule: RoutingRule): RuleMatch;
+/** Load rules from the built-in config. Custom rules support is left as a hook. */
+export declare function loadRules(customRules?: RoutingRule[]): RoutingRule[];
+/**
+ * Evaluate all rules against the given signals and return the best model
+ * recommendation with alternatives.
+ */
+export declare function evaluateRules(signals: ComplexitySignals, customRules?: RoutingRule[]): RulesEngineResult;
+//# sourceMappingURL=rules-engine.d.ts.map

package/dist/engine/model-router/rules-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rules-engine.d.ts","sourceRoot":"","sources":["../../../src/engine/model-router/rules-engine.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACV,iBAAiB,EAEjB,WAAW,EAEX,aAAa,EACb,SAAS,EACT,iBAAiB,EAClB,MAAM,sBAAsB,CAAC;AAyB9B,0DAA0D;AAC1D,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,iBAAiB,EAAE,SAAS,EAAE,aAAa,GAAG,OAAO,CA6B/F;AAMD,wDAAwD;AACxD,wBAAgB,YAAY,CAAC,OAAO,EAAE,iBAAiB,EAAE,IAAI,EAAE,WAAW,GAAG,SAAS,CAWrF;AAED,mFAAmF;AACnF,wBAAgB,SAAS,CAAC,WAAW,CAAC,EAAE,WAAW,EAAE,GAAG,WAAW,EAAE,CAQpE;AAMD;;;GAGG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,iBAAiB,EAC1B,WAAW,CAAC,EAAE,WAAW,EAAE,GAC1B,iBAAiB,CAmDnB"}

package/dist/engine/model-router/rules-engine.js

@@ -0,0 +1,142 @@
+// engine/model-router/rules-engine.ts — Deterministic rules evaluation for model routing.
+// SPEC-076 AC-02
+import defaultRulesJson from '../../config/model-routing-rules.json' with { type: 'json' };
+// ---------------------------------------------------------------------------
+// Model tier ordering (for tie-breaking: higher index = more capable)
+// ---------------------------------------------------------------------------
+const TIER_ORDER = ['haiku', 'sonnet', 'opus'];
+function tierIndex(tier) {
+    return TIER_ORDER.indexOf(tier);
+}
+// ---------------------------------------------------------------------------
+// Condition evaluation
+// ---------------------------------------------------------------------------
+function getSignalValue(signals, signal) {
+    return signals[signal];
+}
+/** Evaluate a single condition against a signal value. */
+export function evaluateCondition(signals, condition) {
+    const raw = getSignalValue(signals, condition.signal);
+    if (raw === undefined) {
+        return false;
+    }
+    const { operator, value } = condition;
+    switch (operator) {
+        case 'eq':
+            return raw === value;
+        case 'gt':
+            return typeof raw === 'number' && typeof value === 'number' && raw > value;
+        case 'gte':
+            return typeof raw === 'number' && typeof value === 'number' && raw >= value;
+        case 'lt':
+            return typeof raw === 'number' && typeof value === 'number' && raw < value;
+        case 'lte':
+            return typeof raw === 'number' && typeof value === 'number' && raw <= value;
+        case 'between': {
+            if (typeof raw !== 'number' || !Array.isArray(value)) {
+                return false;
+            }
+            const [lo, hi] = value;
+            return raw >= lo && raw <= hi;
+        }
+        default:
+            return false;
+    }
+}
+// ---------------------------------------------------------------------------
+// Rule evaluation
+// ---------------------------------------------------------------------------
+/** Evaluate a single rule against the given signals. */
+export function evaluateRule(signals, rule) {
+    // An empty conditions list means "always match" (catch-all)
+    if (rule.conditions.length === 0) {
+        return { rule, matchRatio: 1, confidence: rule.weight };
+    }
+    const matches = rule.conditions.filter((c) => evaluateCondition(signals, c));
+    const matchRatio = matches.length / rule.conditions.length;
+    const confidence = matchRatio * rule.weight;
+    return { rule, matchRatio, confidence };
+}
+/** Load rules from the built-in config. Custom rules support is left as a hook. */
+export function loadRules(customRules) {
+    const config = defaultRulesJson;
+    const base = config.rules;
+    if (!customRules || customRules.length === 0) {
+        return base;
+    }
+    // Custom rules have higher priority: prepend them
+    return [...customRules, ...base];
+}
+// ---------------------------------------------------------------------------
+// Main evaluation
+// ---------------------------------------------------------------------------
+/**
+ * Evaluate all rules against the given signals and return the best model
+ * recommendation with alternatives.
+ */
+export function evaluateRules(signals, customRules) {
+    const rules = loadRules(customRules);
+    const matches = rules.map((r) => evaluateRule(signals, r));
+    // Only keep matches where at least all conditions matched (matchRatio === 1)
+    // unless no rule fully matches, then relax to best partial match
+    let fullMatches = matches.filter((m) => m.matchRatio === 1 && m.confidence > 0);
+    if (fullMatches.length === 0) {
+        fullMatches = matches.filter((m) => m.confidence > 0);
+    }
+    // Sort by confidence desc, then by tier capability desc (tie-break: more capable wins)
+    fullMatches.sort((a, b) => {
+        const confDiff = b.confidence - a.confidence;
+        if (Math.abs(confDiff) > 0.001) {
+            return confDiff;
+        }
+        return tierIndex(b.rule.result) - tierIndex(a.rule.result);
+    });
+    const best = fullMatches[0];
+    /* c8 ignore next 5 */
+    if (!best) {
+        // Absolute fallback — should never happen because of the catch-all sonnet rule
+        return {
+            model: 'sonnet',
+            confidence: 0.5,
+            reasoning: ['Default: sonnet (no rule matched)'],
+            alternatives: [],
+        };
+    }
+    const reasoning = buildReasoning(best, signals);
+    // Collect alternatives (different model tiers from other matches)
+    const seen = new Set([best.rule.result]);
+    const alternatives = [];
+    for (const m of fullMatches) {
+        if (!seen.has(m.rule.result)) {
+            seen.add(m.rule.result);
+            alternatives.push({ model: m.rule.result, confidence: m.confidence });
+        }
+    }
+    return {
+        model: best.rule.result,
+        confidence: best.confidence,
+        reasoning,
+        alternatives,
+    };
+}
+// ---------------------------------------------------------------------------
+// Reasoning builder
+// ---------------------------------------------------------------------------
+function buildReasoning(match, signals) {
+    const reasons = [];
+    reasons.push(`Rule "${match.rule.name}" matched with confidence ${match.confidence.toFixed(2)}.`);
+    if (signals.criteriaCount > 15) {
+        reasons.push(`High criteria count (${String(signals.criteriaCount)}) suggests a complex task.`);
+    }
+    if (signals.crossLayerCount > 2) {
+        reasons.push(`Cross-layer changes (${String(signals.crossLayerCount)} layers) increase coordination complexity.`);
+    }
+    if (signals.isReadOnly) {
+        reasons.push('Read-only task — a lighter model can handle this efficiently.');
+    }
+    if (signals.hasSecurityImplications) {
+        reasons.push('Security implications detected — a more capable model is recommended.');
+    }
+    return reasons;
+}
+//# sourceMappingURL=rules-engine.js.map

package/dist/engine/model-router/rules-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rules-engine.js","sourceRoot":"","sources":["../../../src/engine/model-router/rules-engine.ts"],"names":[],"mappings":"AAAA,0FAA0F;AAC1F,iBAAiB;AAYjB,OAAO,gBAAgB,MAAM,uCAAuC,CAAC,OAAO,IAAI,EAAE,MAAM,EAAE,CAAC;AAE3F,8EAA8E;AAC9E,sEAAsE;AACtE,8EAA8E;AAE9E,MAAM,UAAU,GAAgB,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;AAE5D,SAAS,SAAS,CAAC,IAAe;IAChC,OAAO,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAClC,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E,SAAS,cAAc,CACrB,OAA0B,EAC1B,MAAc;IAEd,OAAQ,OAAgE,CAAC,MAAM,CAAC,CAAC;AACnF,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,iBAAiB,CAAC,OAA0B,EAAE,SAAwB;IACpF,MAAM,GAAG,GAAG,cAAc,CAAC,OAAO,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC;IAEtC,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,IAAI;YACP,OAAO,GAAG,KAAK,KAAK,CAAC;QACvB,KAAK,IAAI;YACP,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,GAAG,GAAG,KAAK,CAAC;QAC7E,KAAK,KAAK;YACR,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,GAAG,IAAI,KAAK,CAAC;QAC9E,KAAK,IAAI;YACP,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,GAAG,GAAG,KAAK,CAAC;QAC7E,KAAK,KAAK;YACR,OAAO,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,GAAG,IAAI,KAAK,CAAC;QAC9E,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC;YACvB,OAAO,GAAG,IAAI,EAAE,IAAI,GAAG,IAAI,EAAE,CAAC;QAChC,CAAC;QACD;YACE,OAAO,KAAK,CAAC;IACjB,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E,wDAAwD;AACxD,MAAM,UAAU,YAAY,CAAC,OAA0B,EAAE,IAAiB;IACxE,4DAA4D;IAC5D,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;IAC1D,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7E,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;IAC3D,MAAM,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;IAE5C,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;AAC1C,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,SAAS,CAAC,WAA2B;IACnD,MAAM,MAAM,GAAG,gBAAsC,CAAC;IACtD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC;IAC1B,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kDAAkD;IAClD,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,IAAI,CAAC,CAAC;AACnC,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,OAA0B,EAC1B,WAA2B;IAE3B,MAAM,KAAK,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAE3D,6EAA6E;IAC7E,iEAAiE;IACjE,IAAI,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAChF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,uFAAuF;IACvF,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxB,MAAM,QAAQ,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;QAC7C,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,EAAE,CAAC;YAC/B,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAE5B,sBAAsB;IACtB,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,+EAA+E;QAC/E,OAAO;YACL,KAAK,EAAE,QAAQ;YACf,UAAU,EAAE,GAAG;YACf,SAAS,EAAE,CAAC,mCAAmC,CAAC;YAChD,YAAY,EAAE,EAAE;SACjB,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAEhD,kEAAkE;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACpD,MAAM,YAAY,GAA+C,EAAE,CAAC;IACpE,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,YAAY,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;QACvB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,SAAS;QACT,YAAY;KACb,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,SAAS,cAAc,CAAC,KAAgB,EAAE,OAA0B;IAClE,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,OAAO,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,IAAI,CAAC,IAAI,6BAA6B,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAElG,IAAI,OAAO,CAAC,aAAa,GAAG,EAAE,EAAE,CAAC;QAC/B,OAAO,CAAC,IAAI,CAAC,wBAAwB,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,4BAA4B,CAAC,CAAC;IAClG,CAAC;IACD,IAAI,OAAO,CAAC,eAAe,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO,CAAC,IAAI,CACV,wBAAwB,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,4CAA4C,CACpG,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,OAAO,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;IAChF,CAAC;IACD,IAAI,OAAO,CAAC,uBAAuB,EAAE,CAAC;QACpC,OAAO,CAAC,IAAI,CAAC,uEAAuE,CAAC,CAAC;IACxF,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/engine/spec-coverage/criteria-mapper.d.ts

@@ -1,4 +1,5 @@
 import type { CriterionCoverage, CoverageTestFile, RawCriterion } from '../../types/index.js';
+export { extractKeywords } from './keyword-extractor.js';
 /**
  * Parses HU.md content and returns a list of acceptance criteria with their
  * identifiers and descriptions. Supports flexible AC formats:
@@ -13,6 +14,4 @@ export declare function extractCriteria(huContent: string): readonly RawCriterio
  * defined in SPEC-068. Returns the full CriterionCoverage for that criterion.
  */
 export declare function mapTestsToCriterion(criterion: RawCriterion, testFiles: readonly CoverageTestFile[], testContents: ReadonlyMap<string, string>, specId: string): CriterionCoverage;
-/** Extracts 3–5 meaningful keywords from an AC description text. */
-export declare function extractKeywords(text: string): readonly string[];
 //# sourceMappingURL=criteria-mapper.d.ts.map

package/dist/engine/spec-coverage/criteria-mapper.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"criteria-mapper.d.ts","sourceRoot":"","sources":["../../../src/engine/spec-coverage/criteria-mapper.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACV,iBAAiB,EAIjB,gBAAgB,EAChB,YAAY,EACb,MAAM,sBAAsB,CAAC;AAiF9B;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,YAAY,EAAE,CAmC1E;AAMD;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,YAAY,EACvB,SAAS,EAAE,SAAS,gBAAgB,EAAE,EACtC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EACzC,MAAM,EAAE,MAAM,GACb,iBAAiB,CAsCnB;AAsFD,oEAAoE;AACpE,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAkB/D"}
+{"version":3,"file":"criteria-mapper.d.ts","sourceRoot":"","sources":["../../../src/engine/spec-coverage/criteria-mapper.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACV,iBAAiB,EAIjB,gBAAgB,EAChB,YAAY,EACb,MAAM,sBAAsB,CAAC;AAK9B,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAMzD;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,YAAY,EAAE,CAmC1E;AAMD;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,YAAY,EACvB,SAAS,EAAE,SAAS,gBAAgB,EAAE,EACtC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EACzC,MAAM,EAAE,MAAM,GACb,iBAAiB,CAsCnB"}