@oeronteros-1/opencode-orchestra 1.0.22 → 1.0.24

package/dist/orchestration/ownership.js

@@ -0,0 +1,45 @@
+export function normalizeOwnedPath(path) {
+    const normalized = path.replace(/\\/g, "/").replace(/^\.\//, "").replace(/\/$/, "");
+    if (!normalized || normalized.includes("\0") || normalized.startsWith("/") || /^[A-Za-z]:\//.test(normalized) || normalized.split("/").includes(".."))
+        throw new Error("ownership path must be repository-relative: " + path);
+    return normalized;
+}
+function overlaps(a, b) { return a === b || a.startsWith(b + "/") || b.startsWith(a + "/"); }
+export function validateOwnership(partitions) {
+    const errors = [];
+    const normalized = partitions.map((p) => ({ id: p.id, paths: p.paths.map((path) => { try {
+            return normalizeOwnedPath(path);
+        }
+        catch (e) {
+            errors.push(e.message);
+            return "";
+        } }).filter(Boolean) }));
+    for (let i = 0; i < normalized.length; i++)
+        for (let j = i + 1; j < normalized.length; j++)
+            for (const a of normalized[i].paths)
+                for (const b of normalized[j].paths)
+                    if (overlaps(a, b))
+                        errors.push("ownership overlap: " + normalized[i].id + ":" + a + " and " + normalized[j].id + ":" + b);
+    return [...new Set(errors)].sort();
+}
+export function validateChangedFiles(partitions, changed) {
+    const errors = validateOwnership(partitions);
+    const byId = new Map(partitions.map((p) => [p.id, p.paths.map(normalizeOwnedPath)]));
+    for (const [id, files] of Object.entries(changed))
+        for (const raw of files) {
+            let file;
+            try {
+                file = normalizeOwnedPath(raw);
+            }
+            catch (e) {
+                errors.push(e.message);
+                continue;
+            }
+            ;
+            const owners = [...byId].filter(([, paths]) => paths.some((p) => file === p || file.startsWith(p + "/"))).map(([owner]) => owner);
+            if (owners.length !== 1 || owners[0] !== id)
+                errors.push("changed file " + file + " is not exclusively owned by " + id);
+        }
+    return [...new Set(errors)].sort();
+}
+//# sourceMappingURL=ownership.js.map

package/dist/orchestration/ownership.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ownership.js","sourceRoot":"","sources":["../../src/orchestration/ownership.ts"],"names":[],"mappings":"AAEA,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;IACnF,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,8CAA8C,GAAG,IAAI,CAAC,CAAA;IAC7N,OAAO,UAAU,CAAA;AACnB,CAAC;AACD,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS,IAAa,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA,CAAC,CAAC;AACrH,MAAM,UAAU,iBAAiB,CAAC,UAAgC;IAChE,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC;YAAC,OAAO,kBAAkB,CAAC,IAAI,CAAC,CAAA;QAAC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YAAC,MAAM,CAAC,IAAI,CAAE,CAAW,CAAC,OAAO,CAAC,CAAC;YAAC,OAAO,EAAE,CAAA;QAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;IAC9M,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAE,CAAC,KAAK;gBAAE,KAAK,MAAM,CAAC,IAAI,UAAU,CAAC,CAAC,CAAE,CAAC,KAAK;oBAAE,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;wBAAE,MAAM,CAAC,IAAI,CAAC,qBAAqB,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,OAAO,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC,CAAA;IACpS,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;AACpC,CAAC;AACD,MAAM,UAAU,oBAAoB,CAAC,UAAgC,EAAE,OAAiC;IACtG,MAAM,MAAM,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAA;IAC5C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAA;IACpF,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC;QAAE,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YAAC,IAAI,IAAY,CAAC;YAAC,IAAI,CAAC;gBAAC,IAAI,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAA;YAAC,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBAAC,MAAM,CAAC,IAAI,CAAE,CAAW,CAAC,OAAO,CAAC,CAAC;gBAAC,SAAQ;YAAC,CAAC;YAAA,CAAC;YAAC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;YAAC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE;gBAAE,MAAM,CAAC,IAAI,CAAC,eAAe,GAAG,IAAI,GAAG,+BAA+B,GAAG,EAAE,CAAC,CAAA;QAAC,CAAC;IAC9b,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;AACpC,CAAC"}

package/dist/orchestration/worktree-adapter.d.ts

@@ -0,0 +1,3 @@
+import type { WorkspaceAdapter } from "@opencode-ai/plugin";
+/** OpenCode experimental workspace adapter backed by isolated local git worktrees. */
+export declare function createGitWorktreeAdapter(repository: string, root?: string): WorkspaceAdapter;

package/dist/orchestration/worktree-adapter.js

@@ -0,0 +1,45 @@
+import { mkdir, rm } from "node:fs/promises";
+import { dirname, join, resolve } from "node:path";
+import { spawn } from "node:child_process";
+function safeId(value) {
+    return value.replace(/[^a-zA-Z0-9._-]/g, "-").slice(0, 80);
+}
+function runGit(cwd, args) {
+    return new Promise((resolvePromise, reject) => {
+        const child = spawn("git", args, { cwd, stdio: "ignore", windowsHide: true });
+        child.once("error", reject);
+        child.once("exit", (code) => code === 0 ? resolvePromise() : reject(new Error("git " + args.join(" ") + " exited with " + code)));
+    });
+}
+/** OpenCode experimental workspace adapter backed by isolated local git worktrees. */
+export function createGitWorktreeAdapter(repository, root = ".orchestra/worktrees") {
+    const base = resolve(repository);
+    const worktreeRoot = resolve(base, root);
+    const directoryOf = (config) => join(worktreeRoot, safeId(config.id));
+    return {
+        name: "Orchestra Git Worktree",
+        description: "Creates one isolated git worktree per parallel Orchestra editor.",
+        configure(config) {
+            return { ...config, directory: directoryOf(config), branch: config.branch ?? "orchestra/" + safeId(config.id) };
+        },
+        async create(config, _env, from) {
+            const directory = directoryOf(config);
+            const branch = config.branch ?? "orchestra/" + safeId(config.id);
+            await mkdir(dirname(directory), { recursive: true });
+            await runGit(base, ["worktree", "add", "-b", branch, directory, from?.branch ?? "HEAD"]);
+        },
+        async remove(config) {
+            const directory = directoryOf(config);
+            const branch = config.branch ?? "orchestra/" + safeId(config.id);
+            try {
+                await runGit(base, ["worktree", "remove", "--force", directory]);
+            }
+            finally {
+                await rm(directory, { recursive: true, force: true });
+                await runGit(base, ["branch", "-D", branch]).catch(() => undefined);
+            }
+        },
+        target(config) { return { type: "local", directory: directoryOf(config) }; },
+    };
+}
+//# sourceMappingURL=worktree-adapter.js.map

package/dist/orchestration/worktree-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"worktree-adapter.js","sourceRoot":"","sources":["../../src/orchestration/worktree-adapter.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,kBAAkB,CAAA;AAC5C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAClD,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAA;AAE1C,SAAS,MAAM,CAAC,KAAa;IAC3B,OAAO,KAAK,CAAC,OAAO,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;AAC5D,CAAC;AAED,SAAS,MAAM,CAAC,GAAW,EAAE,IAAc;IACzC,OAAO,IAAI,OAAO,CAAC,CAAC,cAAc,EAAE,MAAM,EAAE,EAAE;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAA;QAC7E,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;QAC3B,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,eAAe,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACnI,CAAC,CAAC,CAAA;AACJ,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,wBAAwB,CAAC,UAAkB,EAAE,IAAI,GAAG,sBAAsB;IACxF,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,CAAA;IAChC,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACxC,MAAM,WAAW,GAAG,CAAC,MAAqB,EAAE,EAAE,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;IACpF,OAAO;QACL,IAAI,EAAE,wBAAwB;QAC9B,WAAW,EAAE,kEAAkE;QAC/E,SAAS,CAAC,MAAM;YACd,OAAO,EAAE,GAAG,MAAM,EAAE,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAA;QACjH,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI;YAC7B,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAA;YACrC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAChE,MAAM,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;YACpD,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,IAAI,MAAM,CAAC,CAAC,CAAA;QAC1F,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,MAAM;YACjB,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAA;YACrC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YAChE,IAAI,CAAC;gBAAC,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAA;YAAC,CAAC;oBAChE,CAAC;gBACP,MAAM,EAAE,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;gBACrD,MAAM,MAAM,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAA;YACrE,CAAC;QACH,CAAC;QACD,MAAM,CAAC,MAAM,IAAI,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,CAAA,CAAC,CAAC;KAC5E,CAAA;AACH,CAAC"}

package/dist/orchestration/worktrees.d.ts

@@ -0,0 +1,22 @@
+export interface GitResult {
+    stdout: string;
+    stderr: string;
+    exitCode: number;
+}
+export interface GitRunner {
+    run(args: string[], cwd: string): Promise<GitResult>;
+}
+export declare const systemGit: GitRunner;
+export interface ChangedPath {
+    status: string;
+    path: string;
+    oldPath?: string;
+}
+export declare function parseNameStatusZ(output: string): ChangedPath[];
+export declare function createEditorWorktree(git: GitRunner, repo: string, taskId: string, nodeId: string, baseSha: string, root: string): Promise<{
+    path: string;
+    branch: string;
+}>;
+export declare function assertCommitDescendsFromBase(git: GitRunner, repo: string, baseSha: string, commitSha: string): Promise<void>;
+export declare function integrateValidatedCommits(git: GitRunner, repo: string, commits: string[]): Promise<void>;
+export declare function collectCommitChanges(git: GitRunner, repo: string, baseSha: string, commitSha: string): Promise<ChangedPath[]>;

package/dist/orchestration/worktrees.js

@@ -0,0 +1,27 @@
+import { spawn } from "node:child_process";
+export const systemGit = { run(args, cwd) { return new Promise((resolve, reject) => { const child = spawn("git", args, { cwd, stdio: ["ignore", "pipe", "pipe"], windowsHide: true }); let stdout = "", stderr = ""; child.stdout.on("data", (chunk) => stdout += chunk); child.stderr.on("data", (chunk) => stderr += chunk); child.once("error", reject); child.once("exit", (exitCode) => resolve({ stdout, stderr, exitCode: exitCode ?? 1 })); }); } };
+export function parseNameStatusZ(output) { const tokens = output.split("\0"); const result = []; for (let i = 0; i < tokens.length - 1;) {
+    const status = tokens[i++];
+    if (!status)
+        continue;
+    const code = status[0];
+    const first = tokens[i++];
+    if ((code === "R" || code === "C") && i < tokens.length)
+        result.push({ status, oldPath: first, path: tokens[i++] });
+    else
+        result.push({ status, path: first });
+} return result; }
+export async function createEditorWorktree(git, repo, taskId, nodeId, baseSha, root) { const safe = (value) => value.replace(/[^a-zA-Z0-9._-]/g, "-"); const branch = "orch/" + safe(taskId) + "/" + safe(nodeId); const path = root + "/" + safe(taskId) + "-" + safe(nodeId); const result = await git.run(["worktree", "add", "-b", branch, path, baseSha], repo); if (result.exitCode !== 0)
+    throw new Error(result.stderr || "git worktree add failed"); return { path, branch }; }
+export async function assertCommitDescendsFromBase(git, repo, baseSha, commitSha) { const result = await git.run(["merge-base", "--is-ancestor", baseSha, commitSha], repo); if (result.exitCode !== 0)
+    throw new Error("commit is not descended from base: " + commitSha); }
+export async function integrateValidatedCommits(git, repo, commits) { for (const commit of commits) {
+    const result = await git.run(["cherry-pick", commit], repo);
+    if (result.exitCode !== 0) {
+        await git.run(["cherry-pick", "--abort"], repo);
+        throw new Error("cherry-pick conflict for " + commit + ": " + result.stderr);
+    }
+} }
+export async function collectCommitChanges(git, repo, baseSha, commitSha) { const result = await git.run(["diff", "--name-status", "-z", "--find-renames", baseSha + "..." + commitSha], repo); if (result.exitCode !== 0)
+    throw new Error(result.stderr || "git diff failed"); return parseNameStatusZ(result.stdout); }
+//# sourceMappingURL=worktrees.js.map

package/dist/orchestration/worktrees.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"worktrees.js","sourceRoot":"","sources":["../../src/orchestration/worktrees.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAA;AAK1C,MAAM,CAAC,MAAM,SAAS,GAAc,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA,CAAC,CAAC,CAAC,CAAA,CAAC,CAAC,EAAE,CAAA;AAGpc,MAAM,UAAU,gBAAgB,CAAC,MAAc,IAAmB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,MAAM,GAAkB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;IAAC,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,EAAE,CAAE,CAAC;IAAC,IAAI,CAAC,MAAM;QAAE,SAAS;IAAC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;IAAC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,EAAE,CAAE,CAAC;IAAC,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,CAAE,EAAE,CAAC,CAAC;;QAAM,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAA;AAAC,CAAC,CAAC,OAAO,MAAM,CAAA,CAAC,CAAC;AAE3c,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,GAAc,EAAE,IAAY,EAAE,MAAc,EAAE,MAAc,EAAE,OAAe,EAAE,IAAY,IAA+C,MAAM,IAAI,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,MAAM,GAAG,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC;IAAE,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,yBAAyB,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAA,CAAC,CAAC;AAE7jB,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAAC,GAAc,EAAE,IAAY,EAAE,OAAe,EAAE,SAAiB,IAAmB,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,eAAe,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC;IAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,GAAG,SAAS,CAAC,CAAA,CAAC,CAAC;AAE9T,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAAC,GAAc,EAAE,IAAY,EAAE,OAAiB,IAAmB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;IAAC,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IAAC,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;QAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,KAAK,CAAC,2BAA2B,GAAG,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAA;IAAC,CAAC;AAAC,CAAC,CAAC,CAAC;AAE/W,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,GAAc,EAAE,IAAY,EAAE,OAAe,EAAE,SAAiB,IAA4B,MAAM,MAAM,GAAG,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,eAAe,EAAE,IAAI,EAAE,gBAAgB,EAAE,OAAO,GAAG,KAAK,GAAG,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC;IAAE,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,iBAAiB,CAAC,CAAC,CAAC,OAAO,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA,CAAC,CAAC"}

package/dist/pricing/cost.d.ts

@@ -0,0 +1,29 @@
+export type PricingStatus = "paid" | "free" | "subscription" | "unknown";
+export interface PricingResolution {
+    status: PricingStatus;
+    /** USD per 1M input tokens (paid only). */
+    input?: number;
+    /** USD per 1M output tokens (paid only). */
+    output?: number;
+    /** USD per 1M reasoning tokens, when priced separately (paid only). */
+    reasoning?: number;
+    /** USD per 1M cached-input read tokens, when priced separately (paid only). */
+    cacheRead?: number;
+}
+export interface UsageTokens {
+    input: number;
+    output: number;
+    reasoning?: number;
+    cacheRead?: number;
+}
+export interface UsageCost {
+    inputTokens: number;
+    outputTokens: number;
+    reasoningTokens: number;
+    cacheReadTokens: number;
+    totalTokens: number;
+    /** USD; null exactly when pricing is unknown. Free/subscription cost 0. */
+    cost: number | null;
+    pricingStatus: PricingStatus;
+}
+export declare function calcCost(resolution: PricingResolution, usage: UsageTokens): UsageCost;

package/dist/pricing/cost.js

@@ -0,0 +1,47 @@
+// Pure cost calculation. Usage (tokens) and pricing (USD per 1M tokens) are
+// separate concerns: tokens are always counted, while cost may be 0 (free /
+// subscription) or null (unknown pricing). Unknown must never be silently
+// treated as free.
+export function calcCost(resolution, usage) {
+    const input = Math.max(0, usage.input ?? 0);
+    const output = Math.max(0, usage.output ?? 0);
+    const reasoning = Math.max(0, usage.reasoning ?? 0);
+    const cacheRead = Math.max(0, usage.cacheRead ?? 0);
+    const totalTokens = input + output + reasoning + cacheRead;
+    if (resolution.status === "paid") {
+        const cost = (input * (resolution.input ?? 0)
+            + output * (resolution.output ?? 0)
+            + reasoning * (resolution.reasoning ?? 0)
+            + cacheRead * (resolution.cacheRead ?? 0)) / 1_000_000;
+        return {
+            inputTokens: input,
+            outputTokens: output,
+            reasoningTokens: reasoning,
+            cacheReadTokens: cacheRead,
+            totalTokens,
+            cost,
+            pricingStatus: "paid",
+        };
+    }
+    if (resolution.status === "free" || resolution.status === "subscription") {
+        return {
+            inputTokens: input,
+            outputTokens: output,
+            reasoningTokens: reasoning,
+            cacheReadTokens: cacheRead,
+            totalTokens,
+            cost: 0,
+            pricingStatus: resolution.status,
+        };
+    }
+    return {
+        inputTokens: input,
+        outputTokens: output,
+        reasoningTokens: reasoning,
+        cacheReadTokens: cacheRead,
+        totalTokens,
+        cost: null,
+        pricingStatus: "unknown",
+    };
+}
+//# sourceMappingURL=cost.js.map

package/dist/pricing/cost.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost.js","sourceRoot":"","sources":["../../src/pricing/cost.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,4EAA4E;AAC5E,0EAA0E;AAC1E,mBAAmB;AAkCnB,MAAM,UAAU,QAAQ,CAAC,UAA6B,EAAE,KAAkB;IACxE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC,CAAA;IAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAA;IAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC,CAAA;IACnD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC,CAAA;IACnD,MAAM,WAAW,GAAG,KAAK,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS,CAAA;IAE1D,IAAI,UAAU,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC,CAAC;cACzC,MAAM,GAAG,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC;cACjC,SAAS,GAAG,CAAC,UAAU,CAAC,SAAS,IAAI,CAAC,CAAC;cACvC,SAAS,GAAG,CAAC,UAAU,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;QACxD,OAAO;YACL,WAAW,EAAE,KAAK;YAClB,YAAY,EAAE,MAAM;YACpB,eAAe,EAAE,SAAS;YAC1B,eAAe,EAAE,SAAS;YAC1B,WAAW;YACX,IAAI;YACJ,aAAa,EAAE,MAAM;SACtB,CAAA;IACH,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,KAAK,MAAM,IAAI,UAAU,CAAC,MAAM,KAAK,cAAc,EAAE,CAAC;QACzE,OAAO;YACL,WAAW,EAAE,KAAK;YAClB,YAAY,EAAE,MAAM;YACpB,eAAe,EAAE,SAAS;YAC1B,eAAe,EAAE,SAAS;YAC1B,WAAW;YACX,IAAI,EAAE,CAAC;YACP,aAAa,EAAE,UAAU,CAAC,MAAM;SACjC,CAAA;IACH,CAAC;IAED,OAAO;QACL,WAAW,EAAE,KAAK;QAClB,YAAY,EAAE,MAAM;QACpB,eAAe,EAAE,SAAS;QAC1B,eAAe,EAAE,SAAS;QAC1B,WAAW;QACX,IAAI,EAAE,IAAI;QACV,aAAa,EAAE,SAAS;KACzB,CAAA;AACH,CAAC"}

package/dist/pricing/model-match.d.ts

@@ -0,0 +1,59 @@
+export interface ModelEntry {
+    /** Canonical normalized model id, e.g. "gpt-5-6-sol" (no provider prefix). */
+    id: string;
+    /** Optional provider hint, normalized (e.g. "openai"). */
+    provider?: string;
+    /** Raw display names that map to this entry, e.g. "GPT-5.6 Sol". */
+    aliases?: string[];
+}
+export type MatchMethod = "exact" | "alias" | "keyword" | "fuzzy" | "none";
+export interface ModelMatch {
+    /** Canonical normalized model id (best effort when method is "none"). */
+    canonical: string;
+    /** How the match was established. */
+    method: MatchMethod;
+    /** Fuzzy tier only: score gap to the runner-up candidate. */
+    margin?: number;
+    /** True when several catalog entries could match and the raw id lacks a discriminator. */
+    familyAmbiguous?: boolean;
+}
+export interface ParsedModelId {
+    /** Normalized provider prefix ("cx"), empty when the raw id had no "/". */
+    provider: string;
+    /** Normalized base model name ("gpt-5-6-sol"). */
+    model: string;
+    /** Optional pricing variant suffix (":free", ":thinking", ...). */
+    variant?: string;
+    /** The raw id as passed in. */
+    raw: string;
+}
+/** Lowercase and fold all non-alphanumeric separators into "-". */
+export declare function normalizeModelName(name: string): string;
+/** Split a raw id at the FIRST slash only; later slashes belong to the model part. */
+export declare function splitProviderId(raw: string): {
+    provider: string;
+    rest: string;
+};
+/**
+ * Parse a raw model id into a normalized provider / model / variant triple.
+ * Variants are OpenRouter-style ":suffix" segments that change pricing
+ * ("x:free") and must not block matching the base model.
+ */
+export declare function parseModelId(raw: string): ParsedModelId;
+export interface MatchOptions {
+    /** Minimum bigram-Dice similarity for the fuzzy tier. */
+    fuzzyThreshold?: number;
+    /** Minimum score gap over the runner-up for the fuzzy tier. */
+    fuzzyMargin?: number;
+}
+/**
+ * Resolve a raw model id against a catalog of known models.
+ *
+ * Ladder: exact normalized id -> normalized alias -> keyword (all raw tokens
+ * present in exactly one entry) -> gated fuzzy similarity. The keyword tier
+ * short-circuits with `familyAmbiguous` when several entries could fit, so
+ * "gpt-5.6" never silently becomes "gpt-5.6-sol" when family members exist.
+ * A raw id with an extra wrapper namespace ("provider/custom-prefix/X") is
+ * retried with the final path segment as the base model.
+ */
+export declare function matchModel(rawId: string, entries: ModelEntry[], opts?: MatchOptions): ModelMatch;

package/dist/pricing/model-match.js

@@ -0,0 +1,134 @@
+// Pure model-identity normalization and matching. Zero I/O: these helpers turn
+// an arbitrary raw model id ("CX/GPT-5.6 Sol") into a canonical normalized
+// form ("gpt-5-6-sol") that pricing lookups key on, without collapsing
+// genuinely different models into one another.
+/** Lowercase and fold all non-alphanumeric separators into "-". */
+export function normalizeModelName(name) {
+    return name
+        .toLowerCase()
+        .replace(/[^a-z0-9]+/g, "-")
+        .replace(/^-+|-+$/g, "");
+}
+/** Split a raw id at the FIRST slash only; later slashes belong to the model part. */
+export function splitProviderId(raw) {
+    const idx = raw.indexOf("/");
+    if (idx === -1)
+        return { provider: "", rest: raw };
+    return { provider: raw.slice(0, idx).trim(), rest: raw.slice(idx + 1) };
+}
+/**
+ * Parse a raw model id into a normalized provider / model / variant triple.
+ * Variants are OpenRouter-style ":suffix" segments that change pricing
+ * ("x:free") and must not block matching the base model.
+ */
+export function parseModelId(raw) {
+    const { provider, rest } = splitProviderId(raw);
+    const variantIdx = rest.lastIndexOf(":");
+    const base = variantIdx === -1 ? rest : rest.slice(0, variantIdx);
+    const variant = variantIdx === -1 ? undefined : rest.slice(variantIdx + 1).trim();
+    return {
+        provider: provider.toLowerCase(),
+        model: normalizeModelName(base),
+        ...(variant ? { variant } : {}),
+        raw,
+    };
+}
+function tokensOf(normalized) {
+    return normalized.split("-").filter(Boolean);
+}
+function hasAllTokens(entryTokens, candidateTokens) {
+    return candidateTokens.every((token) => entryTokens.has(token));
+}
+function entryTokenSet(entry) {
+    const set = new Set(tokensOf(entry.id));
+    for (const alias of entry.aliases ?? []) {
+        for (const token of tokensOf(normalizeModelName(alias)))
+            set.add(token);
+    }
+    return set;
+}
+function bigrams(s) {
+    const out = new Set();
+    for (let i = 0; i < s.length - 1; i++)
+        out.add(s.slice(i, i + 2));
+    return out;
+}
+function bigramDice(a, b) {
+    if (a === b)
+        return 1;
+    const A = bigrams(a);
+    const B = bigrams(b);
+    if (A.size === 0 || B.size === 0)
+        return 0;
+    let shared = 0;
+    for (const gram of A)
+        if (B.has(gram))
+            shared += 1;
+    return (2 * shared) / (A.size + B.size);
+}
+const DEFAULT_FUZZY_THRESHOLD = 0.85;
+const DEFAULT_FUZZY_MARGIN = 0.1;
+/**
+ * Resolve a raw model id against a catalog of known models.
+ *
+ * Ladder: exact normalized id -> normalized alias -> keyword (all raw tokens
+ * present in exactly one entry) -> gated fuzzy similarity. The keyword tier
+ * short-circuits with `familyAmbiguous` when several entries could fit, so
+ * "gpt-5.6" never silently becomes "gpt-5.6-sol" when family members exist.
+ * A raw id with an extra wrapper namespace ("provider/custom-prefix/X") is
+ * retried with the final path segment as the base model.
+ */
+export function matchModel(rawId, entries, opts) {
+    const threshold = opts?.fuzzyThreshold ?? DEFAULT_FUZZY_THRESHOLD;
+    const margin = opts?.fuzzyMargin ?? DEFAULT_FUZZY_MARGIN;
+    const { provider, rest } = splitProviderId(rawId);
+    const variantIdx = rest.lastIndexOf(":");
+    const baseRest = variantIdx === -1 ? rest : rest.slice(0, variantIdx);
+    const tries = [baseRest];
+    if (baseRest.includes("/")) {
+        const last = baseRest.slice(baseRest.lastIndexOf("/") + 1);
+        if (last !== baseRest)
+            tries.push(last);
+    }
+    const seen = new Set();
+    for (const attempt of tries) {
+        const norm = normalizeModelName(attempt);
+        if (seen.has(norm))
+            continue;
+        seen.add(norm);
+        const exact = entries.find((entry) => entry.id === norm);
+        if (exact)
+            return { canonical: exact.id, method: "exact" };
+        const alias = entries.find((entry) => (entry.aliases ?? []).some((a) => normalizeModelName(a) === norm));
+        if (alias)
+            return { canonical: alias.id, method: "alias" };
+        const candidateTokens = tokensOf(norm);
+        const keywordHits = entries.filter((entry) => hasAllTokens(entryTokenSet(entry), candidateTokens));
+        if (keywordHits.length === 1) {
+            return { canonical: keywordHits[0].id, method: "keyword" };
+        }
+        if (keywordHits.length > 1) {
+            return { canonical: norm, method: "none", familyAmbiguous: true };
+        }
+        const scored = entries
+            .map((entry) => {
+            if (provider && entry.provider && entry.provider !== provider)
+                return undefined;
+            const score = Math.max(bigramDice(norm, entry.id), ...(entry.aliases ?? []).map((a) => bigramDice(norm, normalizeModelName(a))));
+            return { entry, score };
+        })
+            .filter((item) => item !== undefined && item.score >= threshold)
+            .sort((a, b) => b.score - a.score);
+        if (scored.length === 0)
+            continue;
+        const top = scored[0];
+        const runnerUp = scored[1]?.score ?? 0;
+        const gap = top.score - runnerUp;
+        if (gap >= margin) {
+            return { canonical: top.entry.id, method: "fuzzy", margin: gap };
+        }
+        return { canonical: norm, method: "none", familyAmbiguous: scored.length > 1 };
+    }
+    return { canonical: normalizeModelName(baseRest), method: "none" };
+}
+//# sourceMappingURL=model-match.js.map

package/dist/pricing/model-match.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model-match.js","sourceRoot":"","sources":["../../src/pricing/model-match.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAC/E,2EAA2E;AAC3E,uEAAuE;AACvE,+CAA+C;AAmC/C,mEAAmE;AACnE,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;SAC3B,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAA;AAC5B,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,MAAM,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IAC5B,IAAI,GAAG,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAA;IAClD,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAA;AACzE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,GAAW;IACtC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,eAAe,CAAC,GAAG,CAAC,CAAA;IAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,IAAI,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAA;IACjE,MAAM,OAAO,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAA;IACjF,OAAO;QACL,QAAQ,EAAE,QAAQ,CAAC,WAAW,EAAE;QAChC,KAAK,EAAE,kBAAkB,CAAC,IAAI,CAAC;QAC/B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/B,GAAG;KACJ,CAAA;AACH,CAAC;AAED,SAAS,QAAQ,CAAC,UAAkB;IAClC,OAAO,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;AAC9C,CAAC;AAED,SAAS,YAAY,CAAC,WAAwB,EAAE,eAAyB;IACvE,OAAO,eAAe,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;AACjE,CAAC;AAED,SAAS,aAAa,CAAC,KAAiB;IACtC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;IACvC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACzE,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACjE,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,UAAU,CAAC,CAAS,EAAE,CAAS;IACtC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IACpB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IACpB,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAC1C,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,KAAK,MAAM,IAAI,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,CAAC,CAAA;IAClD,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAA;AACzC,CAAC;AASD,MAAM,uBAAuB,GAAG,IAAI,CAAA;AACpC,MAAM,oBAAoB,GAAG,GAAG,CAAA;AAEhC;;;;;;;;;GASG;AACH,MAAM,UAAU,UAAU,CAAC,KAAa,EAAE,OAAqB,EAAE,IAAmB;IAClF,MAAM,SAAS,GAAG,IAAI,EAAE,cAAc,IAAI,uBAAuB,CAAA;IACjE,MAAM,MAAM,GAAG,IAAI,EAAE,WAAW,IAAI,oBAAoB,CAAA;IACxD,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IACjD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,QAAQ,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAA;IAErE,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAA;IACxB,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1D,IAAI,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACzC,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAC9B,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAA;QACxC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAQ;QAC5B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAEd,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;QACxD,IAAI,KAAK;YAAE,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,CAAA;QAE1D,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAA;QACxG,IAAI,KAAK;YAAE,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,CAAA;QAE1D,MAAM,eAAe,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAA;QACtC,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,eAAe,CAAC,CAAC,CAAA;QAClG,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC,CAAE,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,CAAA;QAC7D,CAAC;QACD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,EAAE,CAAA;QACnE,CAAC;QAED,MAAM,MAAM,GAAG,OAAO;aACnB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACb,IAAI,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAA;YAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAChI,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;QACzB,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,IAAI,EAAgD,EAAE,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,IAAI,SAAS,CAAC;aAC7G,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;QAEpC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QACjC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAE,CAAA;QACtB,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;QACtC,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,QAAQ,CAAA;QAChC,IAAI,GAAG,IAAI,MAAM,EAAE,CAAC;YAClB,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,CAAA;QAClE,CAAC;QACD,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAA;IAChF,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAA;AACpE,CAAC"}

package/dist/pricing/openrouter.d.ts

@@ -0,0 +1,60 @@
+import { type ModelEntry } from "./model-match.js";
+export interface OpenRouterPricing {
+    /** USD per 1M input tokens. */
+    input?: number;
+    /** USD per 1M output tokens. */
+    output?: number;
+    /** USD per 1M cached-input read tokens. */
+    cacheRead?: number;
+    /** USD per 1M internal reasoning tokens. */
+    reasoning?: number;
+    /** USD per request (per-request billing, not token billing). */
+    request?: number;
+    /** USD per image (per-unit billing, not token billing). */
+    image?: number;
+    /** USD per audio unit (per-unit billing, not token billing). */
+    audio?: number;
+}
+export interface OpenRouterModel {
+    /** Lowercase raw model id without the variant suffix, e.g. "openai/gpt-4o-mini". */
+    id: string;
+    /** OpenRouter variant suffix ("free", "thinking", "nitro", ...), when present. */
+    variant?: string;
+    /** Display name as reported by OpenRouter. */
+    name?: string;
+    /** Provider-stripped canonical slug (a dated alias of the same model). */
+    canonicalSlug?: string;
+    contextLength?: number | null;
+    /** True when the id carried a ":free" suffix. */
+    isFreeVariant: boolean;
+    pricing: OpenRouterPricing;
+}
+/**
+ * Parse an OpenRouter `/api/v1/models` response into normalized models.
+ * Missing or invalid price fields become undefined (never 0, never throws).
+ */
+export declare function parseOpenRouterModels(text: string): OpenRouterModel[];
+/** Build matchModel catalog entries from a parsed OpenRouter list. */
+export declare function toModelEntries(models: OpenRouterModel[]): ModelEntry[];
+export interface OpenRouterCacheOptions {
+    /** Cache lifetime in milliseconds. */
+    ttlMs: number;
+    /** Endpoint override (tests / self-hosted mirrors). */
+    endpoint?: string;
+    fetchImpl?: typeof fetch;
+    now?: () => number;
+}
+export interface OpenRouterCache {
+    /** Models from cache, refetching lazily when cold/stale or when forced. */
+    getModels(force?: boolean): Promise<OpenRouterModel[]>;
+    /** Epoch ms of the last successful fetch. */
+    readonly fetchedAt: number | undefined;
+    /** Last fetch error message, when any. */
+    readonly lastError: string | undefined;
+}
+export declare const DEFAULT_OPENROUTER_ENDPOINT = "https://openrouter.ai/api/v1/models";
+/**
+ * TTL-on-data cache over the OpenRouter models list. Concurrent callers
+ * share one in-flight fetch; a failed refresh keeps the previous snapshot.
+ */
+export declare function createOpenRouterCache(options: OpenRouterCacheOptions): OpenRouterCache;