@routerlab/core 0.0.1

package/dist/router.js

@@ -0,0 +1,201 @@
+// router.ts — the routing engine. Given a task and a quality bar, pick the
+// cheapest model that meets the bar and the caller's budget/latency caps.
+//
+// Differentiation from prior art:
+//
+//   1. Cost is grounded in *empirical* token economics, not offline
+//      tokenizer proxies. The atlas dataset (project 1 of this milestone)
+//      provides per-(provider, model, format) calibration between offline
+//      counters and empirical counts. RouterArena, RouteLLM, and other
+//      prior routers either use proxy "cost thresholds" in [0,1]
+//      (RouteLLM) or `offline_tokenizer_estimate * published_price`
+//      (RouterArena). Our cost line is `atlas_calibrated_token_count *
+//      published_price` — strictly more accurate.
+//
+//      The atlas-grounded math lives in `cost.ts` (`estimateCost()`),
+//      imported below. `cost.ts` wraps tokenometer's empirical counters
+//      and atlas's per-(provider, model) calibration table; this router
+//      uses it for both the context-window check (`inputTokens`) and the
+//      budget check (`totalUsd`) so the two filters cannot drift.
+//
+//   2. Every decision returns a full triple — `chosen`, `fallbacks`, and
+//      `skipped` (with reasons). This makes the engine debuggable and
+//      reproducible: a downstream consumer can replay a decision and see
+//      exactly which constraints filtered each candidate. RouteLLM
+//      returns only a routing logit; LiteLLM's complexity router returns
+//      only a chosen model. Routerlab returns the full decision trace.
+//
+//   3. The default candidate pool is shipped *with* the package and is
+//      versioned alongside the engine in `candidates.json`. Callers can
+//      override it, but the default is reproducible and citable.
+//
+// No external network calls and no LLM invocations happen here. The
+// engine produces decisions; the per-provider runners under `eval/runners`
+// turn decisions into completions.
+import candidatesData from "./candidates.json" with { type: "json" };
+import { estimateCost } from "./cost.js";
+// Phase 3: predictor reads from eval/results/quality_table.json when present
+// and falls back to the seeded prior in quality_prior.ts otherwise. The
+// `predictQuality` signature is intentionally unchanged so the router
+// engine didn't need to be rewritten.
+import { predictQuality } from "./quality_predictor.js";
+const DEFAULT_CANDIDATES = Object.freeze(candidatesData.candidates.map((c) => Object.freeze({ ...c })));
+/**
+ * Return the default candidate pool. Useful for callers that want to
+ * inspect the pool, filter it, or extend it before routing.
+ */
+export function getDefaultCandidates() {
+    return DEFAULT_CANDIDATES;
+}
+/**
+ * Resolve which candidate pool to use for this request. Defaults to the
+ * shipped pool; callers can override with `request.candidates`.
+ */
+function resolveCandidates(request) {
+    if (request.candidates !== undefined) {
+        return request.candidates;
+    }
+    return DEFAULT_CANDIDATES;
+}
+/**
+ * Validate a request and throw a descriptive error if it's malformed. We
+ * fail loud here so misconfigured callers see the bug immediately rather
+ * than getting a silently-bad routing decision.
+ */
+function validateRequest(request) {
+    if (!Number.isFinite(request.qualityBar)) {
+        throw new Error("route(): qualityBar must be a finite number");
+    }
+    if (request.qualityBar < 0 || request.qualityBar > 1) {
+        throw new Error("route(): qualityBar must be in [0, 1]");
+    }
+    if (typeof request.prompt !== "string") {
+        throw new Error("route(): prompt must be a string");
+    }
+    if (request.maxCostUsd !== undefined &&
+        (!Number.isFinite(request.maxCostUsd) || request.maxCostUsd < 0)) {
+        throw new Error("route(): maxCostUsd must be a non-negative finite number");
+    }
+    if (request.maxLatencyMs !== undefined &&
+        (!Number.isFinite(request.maxLatencyMs) || request.maxLatencyMs < 0)) {
+        throw new Error("route(): maxLatencyMs must be a non-negative finite number");
+    }
+}
+/**
+ * Filter the candidate pool by quality bar, budget, and context window.
+ * Skipped candidates are returned alongside survivors with a recorded
+ * reason — this is what makes routing decisions auditable.
+ */
+function filterCandidates(request, pool) {
+    const kept = [];
+    const skipped = [];
+    for (const model of pool) {
+        const estimate = estimateCost({
+            prompt: request.prompt,
+            model: model.model,
+            provider: model.provider,
+            pricing: model.pricing,
+            taskClass: request.task,
+        });
+        if (estimate.inputTokens > model.contextWindow) {
+            skipped.push({
+                model,
+                reason: `prompt requires ~${estimate.inputTokens} input tokens, exceeds context window of ${model.contextWindow}`,
+            });
+            continue;
+        }
+        const expectedQuality = predictQuality(request.task, model.model);
+        if (expectedQuality < request.qualityBar) {
+            skipped.push({
+                model,
+                reason: `expected quality ${expectedQuality.toFixed(3)} for task "${request.task}" is below quality bar ${request.qualityBar.toFixed(3)}`,
+            });
+            continue;
+        }
+        if (request.maxCostUsd !== undefined && estimate.totalUsd > request.maxCostUsd) {
+            skipped.push({
+                model,
+                reason: `expected cost $${estimate.totalUsd.toFixed(6)} exceeds budget $${request.maxCostUsd.toFixed(6)}`,
+            });
+            continue;
+        }
+        kept.push({ model, expectedCost: estimate.totalUsd, expectedQuality });
+    }
+    return { kept, skipped };
+}
+const MAX_FALLBACKS = 3;
+/**
+ * Compose the winning pick + fallback list from a sorted-by-cost array.
+ *
+ * Sort tie-breaker: when expected costs are equal, prefer the higher
+ * expected quality. This makes routing deterministic and biases toward
+ * better-quality picks at no extra cost — defensible default for a
+ * cost-first router.
+ */
+function selectPickAndFallbacks(scored, request) {
+    const sorted = [...scored].sort((a, b) => {
+        if (a.expectedCost !== b.expectedCost) {
+            return a.expectedCost - b.expectedCost;
+        }
+        return b.expectedQuality - a.expectedQuality;
+    });
+    const winner = sorted[0];
+    if (winner === undefined) {
+        throw new Error("internal: selectPickAndFallbacks called with empty array");
+    }
+    const chosen = {
+        model: winner.model,
+        expectedCost: winner.expectedCost,
+        expectedQuality: winner.expectedQuality,
+        reasoning: buildReasoning(winner, sorted.length, request),
+    };
+    const fallbacks = sorted
+        .slice(1, 1 + MAX_FALLBACKS)
+        .map((c, idx) => ({
+        model: c.model,
+        reason: `cost-rank ${idx + 2} of ${sorted.length} qualifying candidates: expected cost $${c.expectedCost.toFixed(6)}, expected quality ${c.expectedQuality.toFixed(3)}`,
+    }));
+    return { chosen, fallbacks };
+}
+function buildReasoning(winner, poolSize, request) {
+    return [
+        `cheapest model meeting quality bar ${request.qualityBar.toFixed(3)} for task "${request.task}"`,
+        `of ${poolSize} qualifying candidates`,
+        `expected cost $${winner.expectedCost.toFixed(6)} (atlas-grounded estimator)`,
+        `expected quality ${winner.expectedQuality.toFixed(3)} (Phase 3 predictor; measured cells when available, seeded prior otherwise)`,
+    ].join("; ");
+}
+/**
+ * The public routing entrypoint.
+ *
+ * Pipeline:
+ *   1. Validate the request.
+ *   2. Resolve the candidate pool (caller override > shipped default).
+ *   3. Filter out candidates that fail the quality bar, the cost budget,
+ *      or the model's context window. Record reasons.
+ *   4. Sort survivors by expected cost ascending (quality breaks ties).
+ *   5. Pick the cheapest survivor as `chosen`; the next three as
+ *      `fallbacks`. Anything below that is in `skipped` only if it failed
+ *      a constraint — extra cheap-survivors past the fallback list are
+ *      simply not returned.
+ *   6. If no candidate survives, throw with the full skipped list so the
+ *      caller can see exactly what went wrong.
+ *
+ * Sync return: this function does no I/O. Returning a promise would be
+ * misleading.
+ */
+export function route(request) {
+    validateRequest(request);
+    const pool = resolveCandidates(request);
+    if (pool.length === 0) {
+        throw new Error("route(): candidate pool is empty; pass `candidates` in the request or use the default pool");
+    }
+    const { kept, skipped } = filterCandidates(request, pool);
+    if (kept.length === 0) {
+        const reasons = skipped.map((s) => `  - ${s.model.model}: ${s.reason}`).join("\n");
+        throw new Error(`route(): no candidates passed filtering for task "${request.task}" at quality bar ${request.qualityBar}.\nSkipped:\n${reasons}`);
+    }
+    const { chosen, fallbacks } = selectPickAndFallbacks(kept, request);
+    return { chosen, fallbacks, skipped };
+}
+//# sourceMappingURL=router.js.map

package/dist/router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.js","sourceRoot":"","sources":["../src/router.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,0EAA0E;AAC1E,EAAE;AACF,kCAAkC;AAClC,EAAE;AACF,oEAAoE;AACpE,0EAA0E;AAC1E,0EAA0E;AAC1E,uEAAuE;AACvE,iEAAiE;AACjE,oEAAoE;AACpE,uEAAuE;AACvE,kDAAkD;AAClD,EAAE;AACF,sEAAsE;AACtE,wEAAwE;AACxE,wEAAwE;AACxE,yEAAyE;AACzE,kEAAkE;AAClE,EAAE;AACF,yEAAyE;AACzE,sEAAsE;AACtE,yEAAyE;AACzE,mEAAmE;AACnE,yEAAyE;AACzE,uEAAuE;AACvE,EAAE;AACF,uEAAuE;AACvE,wEAAwE;AACxE,iEAAiE;AACjE,EAAE;AACF,oEAAoE;AACpE,2EAA2E;AAC3E,mCAAmC;AAEnC,OAAO,cAAc,MAAM,mBAAmB,CAAC,OAAO,IAAI,EAAE,MAAM,EAAE,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACzC,6EAA6E;AAC7E,wEAAwE;AACxE,sEAAsE;AACtE,sCAAsC;AACtC,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAkBxD,MAAM,kBAAkB,GAA8B,MAAM,CAAC,MAAM,CAChE,cAAgC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CACjF,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,oBAAoB;IAClC,OAAO,kBAAkB,CAAC;AAC5B,CAAC;AAQD;;;GAGG;AACH,SAAS,iBAAiB,CAAC,OAAqB;IAC9C,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;QACrC,OAAO,OAAO,CAAC,UAAU,CAAC;IAC5B,CAAC;IACD,OAAO,kBAAkB,CAAC;AAC5B,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,OAAqB;IAC5C,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QACrD,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,OAAO,OAAO,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QACvC,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACtD,CAAC;IACD,IACE,OAAO,CAAC,UAAU,KAAK,SAAS;QAChC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC,EAChE,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;IAC9E,CAAC;IACD,IACE,OAAO,CAAC,YAAY,KAAK,SAAS;QAClC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC,EACpE,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAChF,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CACvB,OAAqB,EACrB,IAA+B;IAE/B,MAAM,IAAI,GAAsB,EAAE,CAAC;IACnC,MAAM,OAAO,GAAmB,EAAE,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,YAAY,CAAC;YAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,SAAS,EAAE,OAAO,CAAC,IAAI;SACxB,CAAC,CAAC;QAEH,IAAI,QAAQ,CAAC,WAAW,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC;YAC/C,OAAO,CAAC,IAAI,CAAC;gBACX,KAAK;gBACL,MAAM,EAAE,oBAAoB,QAAQ,CAAC,WAAW,4CAA4C,KAAK,CAAC,aAAa,EAAE;aAClH,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,MAAM,eAAe,GAAG,cAAc,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClE,IAAI,eAAe,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC;gBACX,KAAK;gBACL,MAAM,EAAE,oBAAoB,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,OAAO,CAAC,IAAI,0BAA0B,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;aAC1I,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YAC/E,OAAO,CAAC,IAAI,CAAC;gBACX,KAAK;gBACL,MAAM,EAAE,kBAAkB,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;aAC1G,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,QAAQ,CAAC,QAAQ,EAAE,eAAe,EAAE,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB;;;;;;;GAOG;AACH,SAAS,sBAAsB,CAC7B,MAAyB,EACzB,OAAqB;IAErB,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,YAAY,EAAE,CAAC;YACtC,OAAO,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;QACzC,CAAC;QACD,OAAO,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACzB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,MAAM,GAAc;QACxB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,YAAY,EAAE,MAAM,CAAC,YAAY;QACjC,eAAe,EAAE,MAAM,CAAC,eAAe;QACvC,SAAS,EAAE,cAAc,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;KAC1D,CAAC;IAEF,MAAM,SAAS,GAAoB,MAAM;SACtC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QAChB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,MAAM,EAAE,aAAa,GAAG,GAAG,CAAC,OAAO,MAAM,CAAC,MAAM,0CAA0C,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;KACxK,CAAC,CAAC,CAAC;IAEN,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AAC/B,CAAC;AAED,SAAS,cAAc,CACrB,MAAuB,EACvB,QAAgB,EAChB,OAAqB;IAErB,OAAO;QACL,sCAAsC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,OAAO,CAAC,IAAI,GAAG;QAChG,MAAM,QAAQ,wBAAwB;QACtC,kBAAkB,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,6BAA6B;QAC7E,oBAAoB,MAAM,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,6EAA6E;KACnI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,KAAK,CAAC,OAAqB;IACzC,eAAe,CAAC,OAAO,CAAC,CAAC;IAEzB,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IACxC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CACb,4FAA4F,CAC7F,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAE1D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnF,MAAM,IAAI,KAAK,CACb,qDAAqD,OAAO,CAAC,IAAI,oBAAoB,OAAO,CAAC,UAAU,gBAAgB,OAAO,EAAE,CACjI,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,sBAAsB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAEpE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AACxC,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,95 @@
+/**
+ * The set of task classes routerlab routes for. Each class has its own
+ * quality prior table (see `quality_prior.ts`) and, downstream, its own
+ * Pareto frontier in `eval/results/frontier.json`.
+ *
+ * Keep this list small and stable — frontier reproducibility hinges on
+ * task-class identity surviving across runs.
+ */
+export type TaskClass = "qa" | "codegen" | "summarization" | "classification" | "reasoning";
+/**
+ * The providers we can route across. Mirrors the candidate pool documented
+ * in the routerlab README and the per-provider runners under `eval/runners/`.
+ */
+export type Provider = "anthropic" | "openai" | "google" | "groq" | "together" | "hf" | "openrouter";
+/**
+ * Per-million-token pricing for a model. Routerlab is cost-first, so this
+ * is the load-bearing field: every routing decision sorts on a cost
+ * computed from these numbers × atlas-grounded token estimates.
+ */
+export interface ModelPricing {
+    inputUsdPerMtok: number;
+    outputUsdPerMtok: number;
+}
+/**
+ * A single routable model. The pool of these is what `route()` searches
+ * over. Callers can override the default pool via `RouteRequest.candidates`.
+ */
+export interface ModelCandidate {
+    provider: Provider;
+    /** Model identifier, e.g. "claude-haiku-4-5", "llama-3.3-70b". */
+    model: string;
+    pricing: ModelPricing;
+    /** Maximum context window in tokens. */
+    contextWindow: number;
+}
+/**
+ * A routing request. `task` and `qualityBar` are required; everything else
+ * is optional and fills in sensible defaults.
+ *
+ * `qualityBar` is a value in [0,1] interpreted as "minimum acceptable
+ * expected quality on this task class." Candidates below the bar are
+ * filtered out before cost-sorting.
+ */
+export interface RouteRequest {
+    task: TaskClass;
+    prompt: string;
+    /** 0..1 — minimum acceptable expected quality. */
+    qualityBar: number;
+    /** Hard budget cap per request, in USD. */
+    maxCostUsd?: number;
+    /** Hard latency cap per request, in milliseconds. */
+    maxLatencyMs?: number;
+    /** Override the default candidate pool. */
+    candidates?: ModelCandidate[];
+}
+/**
+ * A picked model with the engine's reasoning trace attached.
+ *
+ * `expectedCost` is in USD; `expectedQuality` is in [0,1].
+ */
+export interface RoutePick {
+    model: ModelCandidate;
+    expectedCost: number;
+    expectedQuality: number;
+    /** Human-readable explanation of why this model won. */
+    reasoning: string;
+}
+/**
+ * A non-chosen candidate retained as a fallback (e.g. for retries on
+ * provider failure). Sorted by ascending expected cost.
+ */
+export interface RouteFallback {
+    model: ModelCandidate;
+    reason: string;
+}
+/**
+ * A candidate filtered out before cost-sorting, with the failing constraint
+ * recorded. This is what makes routerlab debuggable — every rejection has
+ * a documented cause.
+ */
+export interface RouteSkipped {
+    model: ModelCandidate;
+    reason: string;
+}
+/**
+ * The full return value of `route()`. The triple (chosen, fallbacks,
+ * skipped) is a complete decision record: callers can reproduce why a
+ * particular model was picked from this object alone.
+ */
+export interface RouteDecision {
+    chosen: RoutePick;
+    fallbacks: RouteFallback[];
+    skipped: RouteSkipped[];
+}
+//# 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":"AAOA;;;;;;;GAOG;AACH,MAAM,MAAM,SAAS,GACjB,IAAI,GACJ,SAAS,GACT,eAAe,GACf,gBAAgB,GAChB,WAAW,CAAC;AAEhB;;;GAGG;AACH,MAAM,MAAM,QAAQ,GAChB,WAAW,GACX,QAAQ,GACR,QAAQ,GACR,MAAM,GACN,UAAU,GACV,IAAI,GACJ,YAAY,CAAC;AAEjB;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,QAAQ,CAAC;IACnB,kEAAkE;IAClE,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,YAAY,CAAC;IACtB,wCAAwC;IACxC,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,kDAAkD;IAClD,UAAU,EAAE,MAAM,CAAC;IACnB,2CAA2C;IAC3C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,qDAAqD;IACrD,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,2CAA2C;IAC3C,UAAU,CAAC,EAAE,cAAc,EAAE,CAAC;CAC/B;AAED;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,cAAc,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,wDAAwD;IACxD,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,cAAc,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,cAAc,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,SAAS,CAAC;IAClB,SAAS,EAAE,aAAa,EAAE,CAAC;IAC3B,OAAO,EAAE,YAAY,EAAE,CAAC;CACzB"}

package/dist/types.js

@@ -0,0 +1,8 @@
+// @routerlab/core — public type surface for the routing engine.
+//
+// These types are intentionally narrow and dependency-free. They describe
+// what a caller passes in to `route()` and what comes back. Everything else
+// (cost computation, quality prediction, candidate pool composition) is an
+// internal implementation detail of the engine.
+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,gEAAgE;AAChE,EAAE;AACF,0EAA0E;AAC1E,4EAA4E;AAC5E,2EAA2E;AAC3E,gDAAgD"}

package/package.json

@@ -0,0 +1,27 @@
+{
+  "name": "@routerlab/core",
+  "version": "0.0.1",
+  "description": "Routing engine for cost-quality LLM model selection.",
+  "license": "Apache-2.0",
+  "author": "Faraazuddin Mohammed",
+  "type": "module",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/faraa2m/routerlab.git",
+    "directory": "packages/core"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "test": "bun test"
+  },
+  "dependencies": {
+    "@tokenometer/core": "1.0.1"
+  }
+}