tryaii-dre 0.2.0

package/dist/scoring/engine.js

@@ -0,0 +1,267 @@
+/**
+ * Dynamic model scoring engine.
+ *
+ * Combines benchmark performance, cost, and speed into a single score
+ * weighted by user priorities. This is the heart of the routing logic.
+ */
+import { BenchmarkNormalizer } from './benchmarks.js';
+import { DEFAULT_PRIORITIES } from './priorities.js';
+/** Speed tier -> numeric score. */
+export const SPEED_SCORES = {
+    'very fast': 1.0,
+    'fast': 0.8,
+    'medium': 0.6,
+    'slow': 0.3,
+    'very slow': 0.1,
+};
+/**
+ * How many of the prompt's most-relevant benchmarks contribute to model scoring.
+ *
+ * History: was 3. Bumped to 5 alongside the median-imputation change so a
+ * single very-similar benchmark can't dominate the decision -- giving the
+ * scorer a wider, more stable view of what the prompt looks like.
+ */
+const TOP_BENCHMARKS_FOR_SCORING = 5;
+/**
+ * Neutral quality used only as a last-resort fallback when a prompt matches no
+ * benchmark at all (every similarity clamps to 0), so it stays routable on
+ * cost/speed instead of being dropped. See scoreModels' neutralFallback retry.
+ */
+const NEUTRAL_QUALITY_SCORE = 0.5;
+/**
+ * Compute the median raw benchmark score across the registry, per benchmark.
+ *
+ * Used to impute missing data: if a model has no score on a benchmark that
+ * the prompt cares about, we fill in the registry-wide median rather than
+ * silently dropping the benchmark. Dropping was the source of a real routing
+ * bug (sparse-data models inflated their own averages by erasing weak
+ * benchmarks instead of being penalised by them); imputing keeps things
+ * neutral instead of harsh.
+ *
+ * Benchmarks no model in the registry has are *omitted* from the result --
+ * the caller treats that as "truly unknown, skip" (preserves the long-standing
+ * behaviour of dropping models that don't intersect any of the prompt's top
+ * benchmarks).
+ */
+function computeBenchmarkMedians(models, benchmarkNames) {
+    const medians = {};
+    for (const name of benchmarkNames) {
+        const values = [];
+        for (const m of models) {
+            const v = m.benchmarkScores[name];
+            // Number.isFinite skips NaN/Infinity as well as undefined -- a NaN
+            // benchmark value must not poison the registry-wide median.
+            if (Number.isFinite(v))
+                values.push(v);
+        }
+        if (values.length === 0)
+            continue; // omit -> caller skips this benchmark for this model
+        values.sort((a, b) => a - b);
+        const mid = Math.floor(values.length / 2);
+        medians[name] = values.length % 2 === 1
+            ? values[mid]
+            : (values[mid - 1] + values[mid]) / 2;
+    }
+    return medians;
+}
+/**
+ * Scores models against a classified prompt.
+ *
+ * Takes benchmark similarity scores (from the classifier) and user priorities,
+ * then ranks all available models using a three-factor weighted algorithm:
+ *
+ *     final = (quality * qW + cost * cW + speed * sW) / (qW + cW + sW)
+ *
+ * Where weights are derived from user priorities (1-5 scale).
+ */
+export class ScoringEngine {
+    constructor(normalizer) {
+        this._normalizer = normalizer ?? new BenchmarkNormalizer();
+    }
+    /**
+     * Score and rank models based on benchmark similarities and priorities.
+     */
+    scoreModels(models, benchmarkSimilarities, priorities = DEFAULT_PRIORITIES, topK = 5) {
+        // Pick the prompt's most-relevant benchmarks. See TOP_BENCHMARKS_FOR_SCORING
+        // for why this is 5 -- short version: a wider view stops one near-perfect
+        // similarity from dominating the decision.
+        const sortedBenchmarks = Object.entries(benchmarkSimilarities)
+            .sort((a, b) => b[1] - a[1])
+            .slice(0, TOP_BENCHMARKS_FOR_SCORING);
+        const topBenchmarkDict = {};
+        for (const [name, score] of sortedBenchmarks) {
+            topBenchmarkDict[name] = score;
+        }
+        // Per-benchmark medians for the benchmarks we actually care about. Built
+        // once per call from the same `models` argument we're about to score
+        // against -- so adding/removing/filtering models flows through correctly
+        // without needing a separate "rebuild medians" step.
+        const benchmarkMedians = computeBenchmarkMedians(models, sortedBenchmarks.map(([name]) => name));
+        const scores = [];
+        for (const model of models) {
+            const score = this._scoreSingleModel(model, topBenchmarkDict, benchmarkMedians, priorities);
+            if (score !== null) {
+                scores.push(score);
+            }
+        }
+        // Fallback: if NO model scored, the prompt matched no benchmark at all (its
+        // embedding is orthogonal/negative to every centroid, so all similarities
+        // clamped to 0). Rather than return nothing -- which makes a single route()
+        // throw and a budget run report the whole dataset infeasible -- re-score
+        // every model on a neutral quality baseline so the prompt stays routable on
+        // cost/speed. The per-model skip above still applies when only *some* models
+        // lack signal.
+        if (scores.length === 0) {
+            for (const model of models) {
+                const score = this._scoreSingleModel(model, topBenchmarkDict, benchmarkMedians, priorities, true);
+                if (score !== null) {
+                    scores.push(score);
+                }
+            }
+        }
+        // Sort by final score descending, with a deterministic secondary key so
+        // median-imputation ties favour real data and are reproducible:
+        //   1. higher finalScore
+        //   2. more real (non-imputed) benchmark coverage -- topBenchmarks only
+        //      holds the model's own non-imputed benchmarks
+        //   3. ascending modelId by Unicode code point (NOT locale-aware)
+        scores.sort((a, b) => {
+            if (b.finalScore !== a.finalScore)
+                return b.finalScore - a.finalScore;
+            if (b.topBenchmarks.length !== a.topBenchmarks.length) {
+                return b.topBenchmarks.length - a.topBenchmarks.length;
+            }
+            return a.modelId < b.modelId ? -1 : a.modelId > b.modelId ? 1 : 0;
+        });
+        if (scores.length > 1) {
+            // Normalize to 0.1-0.95 range (best model ~ 0.95)
+            const maxRaw = scores[0].finalScore;
+            const minRaw = scores[scores.length - 1].finalScore;
+            for (const s of scores) {
+                if (maxRaw === minRaw) {
+                    s.finalScore = 0.5;
+                }
+                else {
+                    const normalized = (s.finalScore - minRaw) / (maxRaw - minRaw);
+                    s.finalScore = Math.round((0.1 + 0.85 * normalized) * 10000) / 10000;
+                }
+            }
+        }
+        else if (scores.length === 1) {
+            // Single surviving model: don't rescale against a hardcoded 0 floor
+            // (that forced ~0.95 regardless of how good the model actually is).
+            // Surface its own unnormalized weighted score, clamped to [0,1].
+            const only = scores[0];
+            only.finalScore = Math.round(Math.max(0, Math.min(1, only.finalScore)) * 10000) / 10000;
+        }
+        return scores.slice(0, topK);
+    }
+    _scoreSingleModel(model, topBenchmarks, benchmarkMedians, priorities, 
+    // When true, a model with no usable similarity signal is scored on a neutral
+    // quality baseline instead of being dropped -- used only for the
+    // all-models-signal-less case (see scoreModels).
+    neutralFallback = false) {
+        // --- Quality score ---
+        let weightedQualitySum = 0;
+        let totalSimilarityWeight = 0;
+        let imputedCount = 0;
+        // Only the model's *own* benchmark data goes in this list -- it powers
+        // the human-readable reasoning string, which should reflect real strengths,
+        // not registry-median guesses.
+        const modelTopBenchmarks = [];
+        for (const [benchmarkName, userSimilarity] of Object.entries(topBenchmarks)) {
+            let rawScore = model.benchmarkScores[benchmarkName];
+            let imputed = false;
+            // !Number.isFinite treats NaN/Infinity like a missing score so a junk
+            // value is imputed from the median rather than poisoning the result.
+            if (!Number.isFinite(rawScore)) {
+                const median = benchmarkMedians[benchmarkName];
+                // No model in the registry has data on this benchmark -> nothing to
+                // impute from. Falling through to `continue` here preserves the old
+                // "skip the model entirely if it intersects nothing" semantic, which
+                // is exactly what the test at line ~140 of engine.test.ts pins.
+                if (median == null)
+                    continue;
+                rawScore = median;
+                imputed = true;
+                imputedCount += 1;
+            }
+            const normalized = this._normalizer.normalize(benchmarkName, rawScore);
+            weightedQualitySum += userSimilarity * normalized;
+            totalSimilarityWeight += userSimilarity;
+            if (!imputed)
+                modelTopBenchmarks.push([benchmarkName, normalized]);
+        }
+        // No usable similarity signal: normally drop the model so models with real
+        // signal win. But when EVERY model is signal-less, scoreModels retries with
+        // neutralFallback=true so the prompt stays routable on cost/speed -- flagged
+        // in the reasoning below so the "no signal" case is observable, not mistaken
+        // for a real quality judgement.
+        const noSignal = totalSimilarityWeight === 0;
+        if (noSignal && !neutralFallback)
+            return null;
+        const qualityScore = noSignal ? NEUTRAL_QUALITY_SCORE : weightedQualitySum / totalSimilarityWeight;
+        // --- Cost score ---
+        // Always compute when pricing data exists: gating on priority dropped the
+        // numerator while keeping the weight in totalWeight (denominator), which is
+        // mathematically inconsistent. The priority weight already scales the term.
+        let costScore = 0;
+        if (model.pricing) {
+            const avgCost = (model.pricing.inputPer1k + model.pricing.outputPer1k) / 2;
+            // Normalize against $0.10/1k tokens baseline
+            costScore = Math.max(0.0, 1.0 - avgCost / 0.1);
+        }
+        // --- Speed score ---
+        let speedScore = 0;
+        if (model.latency) {
+            speedScore = SPEED_SCORES[model.latency] ?? 0.3;
+        }
+        // --- Combine with priority weights ---
+        const qWeight = priorities.qualityWeight;
+        const cWeight = priorities.costWeight;
+        const sWeight = priorities.speedWeight;
+        const qContrib = qualityScore * qWeight;
+        const cContrib = costScore * cWeight;
+        const sContrib = speedScore * sWeight;
+        const totalWeight = qWeight + cWeight + sWeight;
+        let final = (qContrib + cContrib + sContrib) / totalWeight;
+        final = Math.max(0.0, Math.min(1.0, final));
+        // Generate reasoning
+        const topBenchStr = modelTopBenchmarks
+            .slice(0, 2)
+            .map(([b, s]) => `${b} (${Math.round(s * 100)}%)`)
+            .join(', ');
+        let reasoning;
+        if (noSignal) {
+            reasoning = 'No benchmark signal -- routed on cost/speed';
+        }
+        else {
+            reasoning = `Quality: ${qualityScore.toFixed(2)} on [${topBenchStr}]`;
+            if (imputedCount > 0) {
+                // Tell the reader the score is partly an estimate. Useful when reading
+                // eval output and wondering why a model with thin coverage ranked here.
+                const total = Object.keys(topBenchmarks).length;
+                reasoning += ` | imputed: ${imputedCount}/${total}`;
+            }
+        }
+        if (costScore > 0) {
+            reasoning += ` | Cost efficiency: ${costScore.toFixed(2)}`;
+        }
+        if (speedScore > 0) {
+            reasoning += ` | Speed: ${speedScore.toFixed(2)} (${model.latency})`;
+        }
+        return {
+            modelId: model.modelId,
+            finalScore: final,
+            qualityScore: Math.round(qualityScore * 10000) / 10000,
+            costScore: Math.round(costScore * 10000) / 10000,
+            speedScore: Math.round(speedScore * 10000) / 10000,
+            qualityContribution: Math.round(qContrib * 10000) / 10000,
+            costContribution: Math.round(cContrib * 10000) / 10000,
+            speedContribution: Math.round(sContrib * 10000) / 10000,
+            topBenchmarks: modelTopBenchmarks,
+            reasoning,
+        };
+    }
+}
+//# sourceMappingURL=engine.js.map

package/dist/scoring/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../src/scoring/engine.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AACtD,OAAO,EAAE,kBAAkB,EAAc,MAAM,iBAAiB,CAAC;AAejE,mCAAmC;AACnC,MAAM,CAAC,MAAM,YAAY,GAA2B;IAClD,WAAW,EAAE,GAAG;IAChB,MAAM,EAAE,GAAG;IACX,QAAQ,EAAE,GAAG;IACb,MAAM,EAAE,GAAG;IACX,WAAW,EAAE,GAAG;CACjB,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,0BAA0B,GAAG,CAAC,CAAC;AAErC;;;;GAIG;AACH,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAElC;;;;;;;;;;;;;;GAcG;AACH,SAAS,uBAAuB,CAC9B,MAAmB,EACnB,cAAwB;IAExB,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YAClC,mEAAmE;YACnE,4DAA4D;YAC5D,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS,CAAC,qDAAqD;QACxF,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1C,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;YACrC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;YACb,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,OAAO,aAAa;IAGxB,YAAY,UAAgC;QAC1C,IAAI,CAAC,WAAW,GAAG,UAAU,IAAI,IAAI,mBAAmB,EAAE,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,WAAW,CACT,MAAmB,EACnB,qBAA6C,EAC7C,aAAyB,kBAAkB,EAC3C,IAAI,GAAG,CAAC;QAER,6EAA6E;QAC7E,0EAA0E;QAC1E,2CAA2C;QAC3C,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC;aAC3D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,0BAA0B,CAAC,CAAC;QAExC,MAAM,gBAAgB,GAA2B,EAAE,CAAC;QACpD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,gBAAgB,EAAE,CAAC;YAC7C,gBAAgB,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QACjC,CAAC;QAED,yEAAyE;QACzE,qEAAqE;QACrE,yEAAyE;QACzE,qDAAqD;QACrD,MAAM,gBAAgB,GAAG,uBAAuB,CAC9C,MAAM,EACN,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CACvC,CAAC;QAEF,MAAM,MAAM,GAAiB,EAAE,CAAC;QAEhC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;YAC5F,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,0EAA0E;QAC1E,4EAA4E;QAC5E,yEAAyE;QACzE,4EAA4E;QAC5E,6EAA6E;QAC7E,eAAe;QACf,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAClC,KAAK,EACL,gBAAgB,EAChB,gBAAgB,EAChB,UAAU,EACV,IAAI,CACL,CAAC;gBACF,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,wEAAwE;QACxE,gEAAgE;QAChE,yBAAyB;QACzB,wEAAwE;QACxE,oDAAoD;QACpD,kEAAkE;QAClE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACnB,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;YACtE,IAAI,CAAC,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;gBACtD,OAAO,CAAC,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC;YACzD,CAAC;YACD,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEH,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,kDAAkD;YAClD,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YACpC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;YAEpD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;gBACvB,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;oBACtB,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;gBACrB,CAAC;qBAAM,CAAC;oBACN,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;oBAC/D,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,UAAU,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;gBACvE,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,oEAAoE;YACpE,oEAAoE;YACpE,iEAAiE;YACjE,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC;QAC1F,CAAC;QAED,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;IAEO,iBAAiB,CACvB,KAAgB,EAChB,aAAqC,EACrC,gBAAwC,EACxC,UAAsB;IACtB,6EAA6E;IAC7E,iEAAiE;IACjE,iDAAiD;IACjD,eAAe,GAAG,KAAK;QAEvB,wBAAwB;QACxB,IAAI,kBAAkB,GAAG,CAAC,CAAC;QAC3B,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,uEAAuE;QACvE,4EAA4E;QAC5E,+BAA+B;QAC/B,MAAM,kBAAkB,GAA4B,EAAE,CAAC;QAEvD,KAAK,MAAM,CAAC,aAAa,EAAE,cAAc,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;YAC5E,IAAI,QAAQ,GAAG,KAAK,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;YACpD,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,sEAAsE;YACtE,qEAAqE;YACrE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,CAAC,CAAC;gBAC/C,oEAAoE;gBACpE,oEAAoE;gBACpE,qEAAqE;gBACrE,gEAAgE;gBAChE,IAAI,MAAM,IAAI,IAAI;oBAAE,SAAS;gBAC7B,QAAQ,GAAG,MAAM,CAAC;gBAClB,OAAO,GAAG,IAAI,CAAC;gBACf,YAAY,IAAI,CAAC,CAAC;YACpB,CAAC;YAED,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;YACvE,kBAAkB,IAAI,cAAc,GAAG,UAAU,CAAC;YAClD,qBAAqB,IAAI,cAAc,CAAC;YACxC,IAAI,CAAC,OAAO;gBAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,2EAA2E;QAC3E,4EAA4E;QAC5E,6EAA6E;QAC7E,6EAA6E;QAC7E,gCAAgC;QAChC,MAAM,QAAQ,GAAG,qBAAqB,KAAK,CAAC,CAAC;QAC7C,IAAI,QAAQ,IAAI,CAAC,eAAe;YAAE,OAAO,IAAI,CAAC;QAE9C,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,kBAAkB,GAAG,qBAAqB,CAAC;QAEnG,qBAAqB;QACrB,0EAA0E;QAC1E,4EAA4E;QAC5E,4EAA4E;QAC5E,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,OAAO,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAC3E,6CAA6C;YAC7C,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO,GAAG,GAAG,CAAC,CAAC;QACjD,CAAC;QAED,sBAAsB;QACtB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAClB,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC;QAClD,CAAC;QAED,wCAAwC;QACxC,MAAM,OAAO,GAAG,UAAU,CAAC,aAAa,CAAC;QACzC,MAAM,OAAO,GAAG,UAAU,CAAC,UAAU,CAAC;QACtC,MAAM,OAAO,GAAG,UAAU,CAAC,WAAW,CAAC;QAEvC,MAAM,QAAQ,GAAG,YAAY,GAAG,OAAO,CAAC;QACxC,MAAM,QAAQ,GAAG,SAAS,GAAG,OAAO,CAAC;QACrC,MAAM,QAAQ,GAAG,UAAU,GAAG,OAAO,CAAC;QAEtC,MAAM,WAAW,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC,GAAG,WAAW,CAAC;QAC3D,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAE5C,qBAAqB;QACrB,MAAM,WAAW,GAAG,kBAAkB;aACnC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC;aACjD,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,IAAI,SAAiB,CAAC;QACtB,IAAI,QAAQ,EAAE,CAAC;YACb,SAAS,GAAG,6CAA6C,CAAC;QAC5D,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,YAAY,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,WAAW,GAAG,CAAC;YACtE,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;gBACrB,uEAAuE;gBACvE,wEAAwE;gBACxE,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC;gBAChD,SAAS,IAAI,eAAe,YAAY,IAAI,KAAK,EAAE,CAAC;YACtD,CAAC;QACH,CAAC;QACD,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;YAClB,SAAS,IAAI,uBAAuB,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,CAAC;QACD,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;YACnB,SAAS,IAAI,aAAa,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,OAAO,GAAG,CAAC;QACvE,CAAC;QAED,OAAO;YACL,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,KAAK;YACjB,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,KAAK;YACtD,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,KAAK;YAChD,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,GAAG,KAAK;YAClD,mBAAmB,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,KAAK;YACzD,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,KAAK;YACtD,iBAAiB,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,KAAK;YACvD,aAAa,EAAE,kBAAkB;YACjC,SAAS;SACV,CAAC;IACJ,CAAC;CACF"}

package/dist/scoring/index.d.ts

@@ -0,0 +1,6 @@
+export { ScoringEngine, SPEED_SCORES } from './engine.js';
+export type { ModelScore } from './engine.js';
+export { Priorities, DEFAULT_PRIORITIES } from './priorities.js';
+export type { PrioritiesData } from './priorities.js';
+export { BenchmarkNormalizer, NormalizationRange, NORMALIZATION_RANGES } from './benchmarks.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/scoring/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/scoring/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC1D,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AACjE,YAAY,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACtD,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/scoring/index.js

@@ -0,0 +1,4 @@
+export { ScoringEngine, SPEED_SCORES } from './engine.js';
+export { Priorities, DEFAULT_PRIORITIES } from './priorities.js';
+export { BenchmarkNormalizer, NormalizationRange, NORMALIZATION_RANGES } from './benchmarks.js';
+//# sourceMappingURL=index.js.map

package/dist/scoring/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/scoring/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE1D,OAAO,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,iBAAiB,CAAC;AAEjE,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC"}

package/dist/scoring/priorities.d.ts

@@ -0,0 +1,41 @@
+/**
+ * User priority system for model selection.
+ *
+ * Priorities let users express what matters to them (quality, cost, speed)
+ * on a 1-5 scale. These get transformed into weights that influence scoring.
+ */
+export interface PrioritiesData {
+    quality: number;
+    cost: number;
+    speed: number;
+}
+export declare class Priorities {
+    /**
+     * Each value is on a 1-5 scale:
+     *   1 = don't care about this dimension
+     *   3 = balanced (default)
+     *   5 = this is critical
+     */
+    readonly quality: number;
+    readonly cost: number;
+    readonly speed: number;
+    constructor(quality?: number, cost?: number, speed?: number);
+    /** Quality weight: 0.3 to 1.2 (always has baseline influence). */
+    get qualityWeight(): number;
+    /** Cost weight: 0.1 to 1.0 (can be fully suppressed). */
+    get costWeight(): number;
+    /** Speed weight: 0.1 to 1.0 (can be fully suppressed). */
+    get speedWeight(): number;
+    toDict(): PrioritiesData;
+    static fromDict(d: Partial<PrioritiesData>): Priorities;
+    /** Preset: maximize quality, ignore cost and speed. */
+    static performance(): Priorities;
+    /** Preset: minimize cost, moderate quality. */
+    static budget(): Priorities;
+    /** Preset: fastest response, moderate quality. */
+    static fast(): Priorities;
+    /** Preset: balanced across all dimensions. */
+    static balanced(): Priorities;
+}
+export declare const DEFAULT_PRIORITIES: Priorities;
+//# sourceMappingURL=priorities.d.ts.map

package/dist/scoring/priorities.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"priorities.d.ts","sourceRoot":"","sources":["../../src/scoring/priorities.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,UAAU;IACrB;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAEX,OAAO,SAAI,EAAE,IAAI,SAAI,EAAE,KAAK,SAAI;IAM5C,kEAAkE;IAClE,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED,yDAAyD;IACzD,IAAI,UAAU,IAAI,MAAM,CAEvB;IAED,0DAA0D;IAC1D,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,MAAM,IAAI,cAAc;IAIxB,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAAG,UAAU;IAIvD,uDAAuD;IACvD,MAAM,CAAC,WAAW,IAAI,UAAU;IAIhC,+CAA+C;IAC/C,MAAM,CAAC,MAAM,IAAI,UAAU;IAI3B,kDAAkD;IAClD,MAAM,CAAC,IAAI,IAAI,UAAU;IAIzB,8CAA8C;IAC9C,MAAM,CAAC,QAAQ,IAAI,UAAU;CAG9B;AAED,eAAO,MAAM,kBAAkB,YAA0B,CAAC"}

package/dist/scoring/priorities.js

@@ -0,0 +1,49 @@
+/**
+ * User priority system for model selection.
+ *
+ * Priorities let users express what matters to them (quality, cost, speed)
+ * on a 1-5 scale. These get transformed into weights that influence scoring.
+ */
+export class Priorities {
+    constructor(quality = 3, cost = 3, speed = 3) {
+        this.quality = Math.max(1, Math.min(5, Math.round(quality)));
+        this.cost = Math.max(1, Math.min(5, Math.round(cost)));
+        this.speed = Math.max(1, Math.min(5, Math.round(speed)));
+    }
+    /** Quality weight: 0.3 to 1.2 (always has baseline influence). */
+    get qualityWeight() {
+        return 0.3 + (this.quality / 5) * 0.9;
+    }
+    /** Cost weight: 0.1 to 1.0 (can be fully suppressed). */
+    get costWeight() {
+        return 0.1 + (this.cost / 5) * 0.9;
+    }
+    /** Speed weight: 0.1 to 1.0 (can be fully suppressed). */
+    get speedWeight() {
+        return 0.1 + (this.speed / 5) * 0.9;
+    }
+    toDict() {
+        return { quality: this.quality, cost: this.cost, speed: this.speed };
+    }
+    static fromDict(d) {
+        return new Priorities(d.quality ?? 3, d.cost ?? 3, d.speed ?? 3);
+    }
+    /** Preset: maximize quality, ignore cost and speed. */
+    static performance() {
+        return new Priorities(5, 1, 1);
+    }
+    /** Preset: minimize cost, moderate quality. */
+    static budget() {
+        return new Priorities(2, 5, 3);
+    }
+    /** Preset: fastest response, moderate quality. */
+    static fast() {
+        return new Priorities(2, 3, 5);
+    }
+    /** Preset: balanced across all dimensions. */
+    static balanced() {
+        return new Priorities(3, 3, 3);
+    }
+}
+export const DEFAULT_PRIORITIES = new Priorities(3, 3, 3);
+//# sourceMappingURL=priorities.js.map

package/dist/scoring/priorities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priorities.js","sourceRoot":"","sources":["../../src/scoring/priorities.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAQH,MAAM,OAAO,UAAU;IAWrB,YAAY,OAAO,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC;QAC1C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,kEAAkE;IAClE,IAAI,aAAa;QACf,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IACxC,CAAC;IAED,yDAAyD;IACzD,IAAI,UAAU;QACZ,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IACrC,CAAC;IAED,0DAA0D;IAC1D,IAAI,WAAW;QACb,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IACtC,CAAC;IAED,MAAM;QACJ,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IACvE,CAAC;IAED,MAAM,CAAC,QAAQ,CAAC,CAA0B;QACxC,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,uDAAuD;IACvD,MAAM,CAAC,WAAW;QAChB,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,+CAA+C;IAC/C,MAAM,CAAC,MAAM;QACX,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,kDAAkD;IAClD,MAAM,CAAC,IAAI;QACT,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,8CAA8C;IAC9C,MAAM,CAAC,QAAQ;QACb,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;CACF;AAED,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,47 @@
+/**
+ * Shared type definitions for TryAii-DRE.
+ */
+/** Latency tier for a model. */
+export type LatencyTier = 'very fast' | 'fast' | 'medium' | 'slow' | 'very slow';
+/** Scoring strategy preset name. */
+export type ScoringStrategy = 'balanced' | 'performance' | 'cost' | 'speed';
+/** Pricing per 1k tokens in USD. */
+export interface ModelPricingData {
+    input_per_1k: number;
+    output_per_1k: number;
+}
+/** Raw model data as stored in JSON. */
+export interface ModelData {
+    model_id: string;
+    provider: string;
+    benchmark_scores?: Record<string, number | null>;
+    capabilities?: string[];
+    pricing?: ModelPricingData | null;
+    latency?: LatencyTier | null;
+    description?: string;
+}
+/** Models JSON file structure. */
+export interface ModelsJson {
+    version?: string;
+    updated?: string;
+    models: ModelData[];
+}
+/** Training queries JSON file structure. */
+export interface TrainingQueriesJson {
+    version?: string;
+    description?: string;
+    benchmarks: Record<string, {
+        description: string;
+        queries: string[];
+    }>;
+}
+/** Centroids JSON file structure. */
+export interface CentroidsJson {
+    metadata: {
+        model: string;
+        dimension: number;
+        benchmark_count: number;
+    };
+    centroids: Record<string, number[]>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,gCAAgC;AAChC,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,WAAW,CAAC;AAEjF,oCAAoC;AACpC,MAAM,MAAM,eAAe,GAAG,UAAU,GAAG,aAAa,GAAG,MAAM,GAAG,OAAO,CAAC;AAE5E,oCAAoC;AACpC,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,wCAAwC;AACxC,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,gBAAgB,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IACjD,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,OAAO,CAAC,EAAE,gBAAgB,GAAG,IAAI,CAAC;IAClC,OAAO,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;IAC7B,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,kCAAkC;AAClC,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,SAAS,EAAE,CAAC;CACrB;AAED,4CAA4C;AAC5C,MAAM,WAAW,mBAAmB;IAClC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE;QACzB,WAAW,EAAE,MAAM,CAAC;QACpB,OAAO,EAAE,MAAM,EAAE,CAAC;KACnB,CAAC,CAAC;CACJ;AAED,qCAAqC;AACrC,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE;QACR,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;IACF,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CACrC"}

package/dist/types.js

@@ -0,0 +1,5 @@
+/**
+ * Shared type definitions for TryAii-DRE.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;GAEG"}

package/dist/utils/cosine.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Cosine similarity between two vectors.
+ */
+/**
+ * Compute cosine similarity between two vectors.
+ *
+ * @returns A value between -1 and 1 (1 = identical direction, 0 = orthogonal).
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+//# sourceMappingURL=cosine.d.ts.map

package/dist/utils/cosine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cosine.d.ts","sourceRoot":"","sources":["../../src/utils/cosine.ts"],"names":[],"mappings":"AAAA;;GAEG;AAIH;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAMjE"}

package/dist/utils/cosine.js

@@ -0,0 +1,18 @@
+/**
+ * Cosine similarity between two vectors.
+ */
+import { dotProduct, vectorNorm } from './math.js';
+/**
+ * Compute cosine similarity between two vectors.
+ *
+ * @returns A value between -1 and 1 (1 = identical direction, 0 = orthogonal).
+ */
+export function cosineSimilarity(a, b) {
+    const dot = dotProduct(a, b);
+    const normA = vectorNorm(a);
+    const normB = vectorNorm(b);
+    if (normA === 0 || normB === 0)
+        return 0.0;
+    return dot / (normA * normB);
+}
+//# sourceMappingURL=cosine.js.map

package/dist/utils/cosine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cosine.js","sourceRoot":"","sources":["../../src/utils/cosine.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAEnD;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC3C,OAAO,GAAG,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;AAC/B,CAAC"}

package/dist/utils/math.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Basic vector math utilities.
+ *
+ * Replaces numpy operations with plain TypeScript array math.
+ */
+/** Compute the dot product of two vectors. */
+export declare function dotProduct(a: number[], b: number[]): number;
+/** Compute the L2 (Euclidean) norm of a vector. */
+export declare function vectorNorm(v: number[]): number;
+/** Compute the element-wise mean of a list of vectors. */
+export declare function vectorMean(vectors: number[][]): number[];
+/** Scale a vector by a scalar. */
+export declare function vectorScale(v: number[], scalar: number): number[];
+/** Add two vectors element-wise. */
+export declare function vectorAdd(a: number[], b: number[]): number[];
+/** Normalize a vector to unit length. Returns zero vector if norm is 0. */
+export declare function vectorNormalize(v: number[]): number[];
+//# sourceMappingURL=math.d.ts.map

package/dist/utils/math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../src/utils/math.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,8CAA8C;AAC9C,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAM3D;AAED,mDAAmD;AACnD,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAM9C;AAED,0DAA0D;AAC1D,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE,CAcxD;AAED,kCAAkC;AAClC,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAEjE;AAED,oCAAoC;AACpC,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAE5D;AAED,2EAA2E;AAC3E,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAIrD"}

package/dist/utils/math.js

@@ -0,0 +1,54 @@
+/**
+ * Basic vector math utilities.
+ *
+ * Replaces numpy operations with plain TypeScript array math.
+ */
+/** Compute the dot product of two vectors. */
+export function dotProduct(a, b) {
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        sum += a[i] * b[i];
+    }
+    return sum;
+}
+/** Compute the L2 (Euclidean) norm of a vector. */
+export function vectorNorm(v) {
+    let sum = 0;
+    for (let i = 0; i < v.length; i++) {
+        sum += v[i] * v[i];
+    }
+    return Math.sqrt(sum);
+}
+/** Compute the element-wise mean of a list of vectors. */
+export function vectorMean(vectors) {
+    if (vectors.length === 0)
+        return [];
+    const dim = vectors[0].length;
+    const result = new Array(dim).fill(0);
+    for (const v of vectors) {
+        for (let i = 0; i < dim; i++) {
+            result[i] += v[i];
+        }
+    }
+    const n = vectors.length;
+    for (let i = 0; i < dim; i++) {
+        result[i] /= n;
+    }
+    return result;
+}
+/** Scale a vector by a scalar. */
+export function vectorScale(v, scalar) {
+    return v.map((x) => x * scalar);
+}
+/** Add two vectors element-wise. */
+export function vectorAdd(a, b) {
+    return a.map((x, i) => x + b[i]);
+}
+/** Normalize a vector to unit length. Returns zero vector if norm is 0. */
+export function vectorNormalize(v) {
+    const norm = vectorNorm(v);
+    if (norm === 0)
+        return v.slice();
+    return v.map((x) => x / norm);
+}
+//# sourceMappingURL=math.js.map

package/dist/utils/math.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.js","sourceRoot":"","sources":["../../src/utils/math.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,8CAA8C;AAC9C,MAAM,UAAU,UAAU,CAAC,CAAW,EAAE,CAAW;IACjD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,UAAU,CAAC,CAAW;IACpC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,UAAU,CAAC,OAAmB;IAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACpC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC9B,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,kCAAkC;AAClC,MAAM,UAAU,WAAW,CAAC,CAAW,EAAE,MAAc;IACrD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AAClC,CAAC;AAED,oCAAoC;AACpC,MAAM,UAAU,SAAS,CAAC,CAAW,EAAE,CAAW;IAChD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,eAAe,CAAC,CAAW;IACzC,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;IACjC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAChC,CAAC"}