@pydantic/genai-prices 0.0.38 → 0.0.40

package/dist/cli.js

@@ -1,8 +1,8 @@
 #!/usr/bin/env node
 import de from "yargs";
 import { format as he } from "util";
-import { resolve as ie, normalize as Ie } from "path";
-import { readFileSync as ke, writeFile as Le, statSync as Pe } from "fs";
+import { resolve as ae, normalize as Ie } from "path";
+import { readFileSync as _e, writeFile as Le, statSync as Pe } from "fs";
 import "assert";
 import { fileURLToPath as Te } from "url";
 function Ae() {
@@ -14,59 +14,59 @@ function Se() {
 function Ge() {
   return !!process.versions.electron;
 }
-function Ce(a) {
-  return a.slice(Ae() + 1);
+function Ce(i) {
+  return i.slice(Ae() + 1);
 }
 /**
  * @license
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function W(a) {
-  if (a !== a.toLowerCase() && a !== a.toUpperCase() || (a = a.toLowerCase()), a.indexOf("-") === -1 && a.indexOf("_") === -1)
-    return a;
+function W(i) {
+  if (i !== i.toLowerCase() && i !== i.toUpperCase() || (i = i.toLowerCase()), i.indexOf("-") === -1 && i.indexOf("_") === -1)
+    return i;
   {
     let m = "", s = !1;
-    const u = a.match(/^-+/);
-    for (let _ = u ? u[0].length : 0; _ < a.length; _++) {
-      let k = a.charAt(_);
-      s && (s = !1, k = k.toUpperCase()), _ !== 0 && (k === "-" || k === "_") ? s = !0 : k !== "-" && k !== "_" && (m += k);
+    const u = i.match(/^-+/);
+    for (let k = u ? u[0].length : 0; k < i.length; k++) {
+      let _ = i.charAt(k);
+      s && (s = !1, _ = _.toUpperCase()), k !== 0 && (_ === "-" || _ === "_") ? s = !0 : _ !== "-" && _ !== "_" && (m += _);
     }
     return m;
   }
 }
-function Oe(a, n) {
-  const m = a.toLowerCase();
+function Oe(i, n) {
+  const m = i.toLowerCase();
   n = n || "-";
   let s = "";
-  for (let u = 0; u < a.length; u++) {
-    const _ = m.charAt(u), k = a.charAt(u);
-    _ !== k && u > 0 ? s += `${n}${m.charAt(u)}` : s += k;
+  for (let u = 0; u < i.length; u++) {
+    const k = m.charAt(u), _ = i.charAt(u);
+    k !== _ && u > 0 ? s += `${n}${m.charAt(u)}` : s += _;
   }
   return s;
 }
-function Re(a) {
-  return a == null ? !1 : typeof a == "number" || /^0x[0-9a-f]+$/i.test(a) ? !0 : /^0[^.]/.test(a) ? !1 : /^[-]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(a);
+function Re(i) {
+  return i == null ? !1 : typeof i == "number" || /^0x[0-9a-f]+$/i.test(i) ? !0 : /^0[^.]/.test(i) ? !1 : /^[-]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(i);
 }
 /**
  * @license
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function Ee(a) {
-  if (Array.isArray(a))
-    return a.map((k) => typeof k != "string" ? k + "" : k);
-  a = a.trim();
+function Ee(i) {
+  if (Array.isArray(i))
+    return i.map((_) => typeof _ != "string" ? _ + "" : _);
+  i = i.trim();
   let n = 0, m = null, s = null, u = null;
-  const _ = [];
-  for (let k = 0; k < a.length; k++) {
-    if (m = s, s = a.charAt(k), s === " " && !u) {
+  const k = [];
+  for (let _ = 0; _ < i.length; _++) {
+    if (m = s, s = i.charAt(_), s === " " && !u) {
       m !== " " && n++;
       continue;
     }
-    s === u ? u = null : (s === "'" || s === '"') && !u && (u = s), _[n] || (_[n] = ""), _[n] += s;
+    s === u ? u = null : (s === "'" || s === '"') && !u && (u = s), k[n] || (k[n] = ""), k[n] += s;
   }
-  return _;
+  return k;
 }
 /**
  * @license
@@ -74,8 +74,8 @@ function Ee(a) {
  * SPDX-License-Identifier: ISC
  */
 var I;
-(function(a) {
-  a.BOOLEAN = "boolean", a.STRING = "string", a.NUMBER = "number", a.ARRAY = "array";
+(function(i) {
+  i.BOOLEAN = "boolean", i.STRING = "string", i.NUMBER = "number", i.ARRAY = "array";
 })(I || (I = {}));
 /**
  * @license
@@ -105,7 +105,7 @@ class Ne {
       number: void 0,
       __: void 0,
       key: void 0
-    }, m), u = Ee(n), _ = typeof n == "string", k = ze(Object.assign(/* @__PURE__ */ Object.create(null), s.alias)), h = Object.assign({
+    }, m), u = Ee(n), k = typeof n == "string", _ = ze(Object.assign(/* @__PURE__ */ Object.create(null), s.alias)), h = Object.assign({
       "boolean-negation": !0,
       "camel-case-expansion": !0,
       "combine-arrays": !1,
@@ -138,14 +138,14 @@ class Ne {
       keys: []
     }, L = /^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/, U = new RegExp("^--" + h["negation-prefix"] + "(.+)");
     [].concat(s.array || []).filter(Boolean).forEach(function(e) {
-      const i = typeof e == "object" ? e.key : e, l = Object.keys(e).map(function(o) {
+      const a = typeof e == "object" ? e.key : e, l = Object.keys(e).map(function(o) {
         return {
           boolean: "bools",
           string: "strings",
           number: "numbers"
         }[o];
       }).filter(Boolean).pop();
-      l && (r[l][i] = !0), r.arrays[i] = !0, r.keys.push(i);
+      l && (r[l][a] = !0), r.arrays[a] = !0, r.keys.push(a);
     }), [].concat(s.boolean || []).filter(Boolean).forEach(function(e) {
       r.bools[e] = !0, r.keys.push(e);
     }), [].concat(s.string || []).filter(Boolean).forEach(function(e) {
@@ -156,17 +156,17 @@ class Ne {
       r.counts[e] = !0, r.keys.push(e);
     }), [].concat(s.normalize || []).filter(Boolean).forEach(function(e) {
       r.normalize[e] = !0, r.keys.push(e);
-    }), typeof s.narg == "object" && Object.entries(s.narg).forEach(([e, i]) => {
-      typeof i == "number" && (r.nargs[e] = i, r.keys.push(e));
-    }), typeof s.coerce == "object" && Object.entries(s.coerce).forEach(([e, i]) => {
-      typeof i == "function" && (r.coercions[e] = i, r.keys.push(e));
+    }), typeof s.narg == "object" && Object.entries(s.narg).forEach(([e, a]) => {
+      typeof a == "number" && (r.nargs[e] = a, r.keys.push(e));
+    }), typeof s.coerce == "object" && Object.entries(s.coerce).forEach(([e, a]) => {
+      typeof a == "function" && (r.coercions[e] = a, r.keys.push(e));
     }), typeof s.config < "u" && (Array.isArray(s.config) || typeof s.config == "string" ? [].concat(s.config).filter(Boolean).forEach(function(e) {
       r.configs[e] = !0;
-    }) : typeof s.config == "object" && Object.entries(s.config).forEach(([e, i]) => {
-      (typeof i == "boolean" || typeof i == "function") && (r.configs[e] = i);
-    })), qe(s.key, k, s.default, r.arrays), Object.keys(f).forEach(function(e) {
-      (r.aliases[e] || []).forEach(function(i) {
-        f[i] = f[e];
+    }) : typeof s.config == "object" && Object.entries(s.config).forEach(([e, a]) => {
+      (typeof a == "boolean" || typeof a == "function") && (r.configs[e] = a);
+    })), qe(s.key, _, s.default, r.arrays), Object.keys(f).forEach(function(e) {
+      (r.aliases[e] || []).forEach(function(a) {
+        f[a] = f[e];
       });
     });
     let B = null;
@@ -174,28 +174,28 @@ class Ne {
     let F = [];
     const w = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), ne = {};
     for (let e = 0; e < u.length; e++) {
-      const i = u[e], l = i.replace(/^-{3,}/, "---");
+      const a = u[e], l = a.replace(/^-{3,}/, "---");
       let o, t, p, c, d, v;
-      if (i !== "--" && /^-/.test(i) && H(i))
-        K(i);
+      if (a !== "--" && /^-/.test(a) && H(a))
+        K(a);
       else if (l.match(/^---+(=|$)/)) {
-        K(i);
+        K(a);
         continue;
-      } else if (i.match(/^--.+=/) || !h["short-option-groups"] && i.match(/^-.+=/))
-        c = i.match(/^--?([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && (g(c[1], r.arrays) ? e = V(e, c[1], u, c[2]) : g(c[1], r.nargs) !== !1 ? e = D(e, c[1], u, c[2]) : q(c[1], c[2], !0));
-      else if (i.match(U) && h["boolean-negation"])
-        c = i.match(U), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], q(t, g(t, r.arrays) ? [!1] : !1));
-      else if (i.match(/^--.+/) || !h["short-option-groups"] && i.match(/^-[^-]+/))
-        c = i.match(/^--?(.+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
-      else if (i.match(/^-.\..+=/))
-        c = i.match(/^-([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && q(c[1], c[2]);
-      else if (i.match(/^-.\..+/) && !i.match(L))
-        d = u[e + 1], c = i.match(/^-(.\..+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], d !== void 0 && !d.match(/^-/) && !g(t, r.bools) && !g(t, r.counts) ? (q(t, d), e++) : q(t, R(t)));
-      else if (i.match(/^-[^-]+/) && !i.match(L)) {
-        p = i.slice(1, -1).split(""), o = !1;
+      } else if (a.match(/^--.+=/) || !h["short-option-groups"] && a.match(/^-.+=/))
+        c = a.match(/^--?([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && (g(c[1], r.arrays) ? e = V(e, c[1], u, c[2]) : g(c[1], r.nargs) !== !1 ? e = D(e, c[1], u, c[2]) : q(c[1], c[2], !0));
+      else if (a.match(U) && h["boolean-negation"])
+        c = a.match(U), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], q(t, g(t, r.arrays) ? [!1] : !1));
+      else if (a.match(/^--.+/) || !h["short-option-groups"] && a.match(/^-[^-]+/))
+        c = a.match(/^--?(.+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
+      else if (a.match(/^-.\..+=/))
+        c = a.match(/^-([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && q(c[1], c[2]);
+      else if (a.match(/^-.\..+/) && !a.match(L))
+        d = u[e + 1], c = a.match(/^-(.\..+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], d !== void 0 && !d.match(/^-/) && !g(t, r.bools) && !g(t, r.counts) ? (q(t, d), e++) : q(t, R(t)));
+      else if (a.match(/^-[^-]+/) && !a.match(L)) {
+        p = a.slice(1, -1).split(""), o = !1;
         for (let x = 0; x < p.length; x++) {
-          if (d = i.slice(x + 2), p[x + 1] && p[x + 1] === "=") {
-            v = i.slice(x + 3), t = p[x], g(t, r.arrays) ? e = V(e, t, u, v) : g(t, r.nargs) !== !1 ? e = D(e, t, u, v) : q(t, v), o = !0;
+          if (d = a.slice(x + 2), p[x + 1] && p[x + 1] === "=") {
+            v = a.slice(x + 3), t = p[x], g(t, r.arrays) ? e = V(e, t, u, v) : g(t, r.nargs) !== !1 ? e = D(e, t, u, v) : q(t, v), o = !0;
             break;
           }
           if (d === "-") {
@@ -212,73 +212,73 @@ class Ne {
           } else
             q(p[x], R(p[x]));
         }
-        t = i.slice(-1)[0], !o && t !== "-" && (g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
-      } else if (i.match(/^-[0-9]$/) && i.match(L) && g(i.slice(1), r.bools))
-        t = i.slice(1), q(t, R(t));
-      else if (i === "--") {
+        t = a.slice(-1)[0], !o && t !== "-" && (g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
+      } else if (a.match(/^-[0-9]$/) && a.match(L) && g(a.slice(1), r.bools))
+        t = a.slice(1), q(t, R(t));
+      else if (a === "--") {
         F = u.slice(e + 1);
         break;
       } else if (h["halt-at-non-option"]) {
         F = u.slice(e);
         break;
       } else
-        K(i);
+        K(a);
     }
-    re(w, !0), re(w, !1), _e(w), ge(), me(w, r.aliases, f, !0), fe(w), h["set-placeholder-key"] && be(w), Object.keys(r.counts).forEach(function(e) {
+    re(w, !0), re(w, !1), ke(w), ge(), me(w, r.aliases, f, !0), fe(w), h["set-placeholder-key"] && be(w), Object.keys(r.counts).forEach(function(e) {
       E(w, e.split(".")) || q(e, 0);
     }), S && F.length && (w[G] = []), F.forEach(function(e) {
       w[G].push(e);
     }), h["camel-case-expansion"] && h["strip-dashed"] && Object.keys(w).filter((e) => e !== "--" && e.includes("-")).forEach((e) => {
       delete w[e];
-    }), h["strip-aliased"] && [].concat(...Object.keys(k).map((e) => k[e])).forEach((e) => {
-      h["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((i) => W(i)).join(".")], delete w[e];
+    }), h["strip-aliased"] && [].concat(...Object.keys(_).map((e) => _[e])).forEach((e) => {
+      h["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((a) => W(a)).join(".")], delete w[e];
     });
     function K(e) {
-      const i = $("_", e);
-      (typeof i == "string" || typeof i == "number") && w._.push(i);
+      const a = $("_", e);
+      (typeof a == "string" || typeof a == "number") && w._.push(a);
     }
-    function D(e, i, l, o) {
-      let t, p = g(i, r.nargs);
+    function D(e, a, l, o) {
+      let t, p = g(a, r.nargs);
       if (p = typeof p != "number" || isNaN(p) ? 1 : p, p === 0)
-        return T(o) || (B = Error(C("Argument unexpected for: %s", i))), q(i, R(i)), e;
+        return T(o) || (B = Error(C("Argument unexpected for: %s", a))), q(a, R(a)), e;
       let c = T(o) ? 0 : 1;
       if (h["nargs-eats-options"])
-        l.length - (e + 1) + c < p && (B = Error(C("Not enough arguments following: %s", i))), c = p;
+        l.length - (e + 1) + c < p && (B = Error(C("Not enough arguments following: %s", a))), c = p;
       else {
         for (t = e + 1; t < l.length && (!l[t].match(/^-[^0-9]/) || l[t].match(L) || H(l[t])); t++)
           c++;
-        c < p && (B = Error(C("Not enough arguments following: %s", i)));
+        c < p && (B = Error(C("Not enough arguments following: %s", a)));
       }
       let d = Math.min(c, p);
-      for (!T(o) && d > 0 && (q(i, o), d--), t = e + 1; t < d + e + 1; t++)
-        q(i, l[t]);
+      for (!T(o) && d > 0 && (q(a, o), d--), t = e + 1; t < d + e + 1; t++)
+        q(a, l[t]);
       return e + d;
     }
-    function V(e, i, l, o) {
+    function V(e, a, l, o) {
       let t = [], p = o || l[e + 1];
-      const c = g(i, r.nargs);
-      if (g(i, r.bools) && !/^(true|false)$/.test(p))
+      const c = g(a, r.nargs);
+      if (g(a, r.bools) && !/^(true|false)$/.test(p))
         t.push(!0);
       else if (T(p) || T(o) && /^-/.test(p) && !L.test(p) && !H(p)) {
-        if (f[i] !== void 0) {
-          const d = f[i];
+        if (f[a] !== void 0) {
+          const d = f[a];
           t = Array.isArray(d) ? d : [d];
         }
       } else {
-        T(o) || t.push(Y(i, o, !0));
+        T(o) || t.push(Y(a, o, !0));
         for (let d = e + 1; d < l.length && !(!h["greedy-arrays"] && t.length > 0 || c && typeof c == "number" && t.length >= c || (p = l[d], /^-/.test(p) && !L.test(p) && !H(p))); d++)
-          e = d, t.push(Y(i, p, _));
+          e = d, t.push(Y(a, p, k));
       }
-      return typeof c == "number" && (c && t.length < c || isNaN(c) && t.length === 0) && (B = Error(C("Not enough arguments following: %s", i))), q(i, t), e;
+      return typeof c == "number" && (c && t.length < c || isNaN(c) && t.length === 0) && (B = Error(C("Not enough arguments following: %s", a))), q(a, t), e;
     }
-    function q(e, i, l = _) {
+    function q(e, a, l = k) {
       if (/-/.test(e) && h["camel-case-expansion"]) {
         const p = e.split(".").map(function(c) {
           return W(c);
         }).join(".");
         se(e, p);
       }
-      const o = Y(e, i, l), t = e.split(".");
+      const o = Y(e, a, l), t = e.split(".");
       N(w, t, o), r.aliases[e] && r.aliases[e].forEach(function(p) {
         const c = p.split(".");
         N(w, c, o);
@@ -290,31 +290,31 @@ class Ne {
         Object.defineProperty(ne, c, {
           enumerable: !0,
           get() {
-            return i;
+            return a;
           },
           set(d) {
-            i = typeof d == "string" ? A.normalize(d) : d;
+            a = typeof d == "string" ? A.normalize(d) : d;
           }
         });
       });
     }
-    function se(e, i) {
-      r.aliases[e] && r.aliases[e].length || (r.aliases[e] = [i], Q[i] = !0), r.aliases[i] && r.aliases[i].length || se(i, e);
+    function se(e, a) {
+      r.aliases[e] && r.aliases[e].length || (r.aliases[e] = [a], Q[a] = !0), r.aliases[a] && r.aliases[a].length || se(a, e);
     }
-    function Y(e, i, l) {
-      l && (i = je(i)), (g(e, r.bools) || g(e, r.counts)) && typeof i == "string" && (i = i === "true");
-      let o = Array.isArray(i) ? i.map(function(t) {
+    function Y(e, a, l) {
+      l && (a = je(a)), (g(e, r.bools) || g(e, r.counts)) && typeof a == "string" && (a = a === "true");
+      let o = Array.isArray(a) ? a.map(function(t) {
         return $(e, t);
-      }) : $(e, i);
-      return g(e, r.counts) && (T(o) || typeof o == "boolean") && (o = Z()), g(e, r.normalize) && g(e, r.arrays) && (Array.isArray(i) ? o = i.map((t) => A.normalize(t)) : o = A.normalize(i)), o;
+      }) : $(e, a);
+      return g(e, r.counts) && (T(o) || typeof o == "boolean") && (o = Z()), g(e, r.normalize) && g(e, r.arrays) && (Array.isArray(a) ? o = a.map((t) => A.normalize(t)) : o = A.normalize(a)), o;
     }
-    function $(e, i) {
-      return !h["parse-positional-numbers"] && e === "_" || !g(e, r.strings) && !g(e, r.bools) && !Array.isArray(i) && (Re(i) && h["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${i}`))) || !T(i) && g(e, r.numbers)) && (i = Number(i)), i;
+    function $(e, a) {
+      return !h["parse-positional-numbers"] && e === "_" || !g(e, r.strings) && !g(e, r.bools) && !Array.isArray(a) && (Re(a) && h["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${a}`))) || !T(a) && g(e, r.numbers)) && (a = Number(a)), a;
     }
-    function _e(e) {
-      const i = /* @__PURE__ */ Object.create(null);
-      me(i, r.aliases, f), Object.keys(r.configs).forEach(function(l) {
-        const o = e[l] || i[l];
+    function ke(e) {
+      const a = /* @__PURE__ */ Object.create(null);
+      me(a, r.aliases, f), Object.keys(r.configs).forEach(function(l) {
+        const o = e[l] || a[l];
         if (o)
           try {
             let t = null;
@@ -337,9 +337,9 @@ class Ne {
           }
       });
     }
-    function J(e, i) {
+    function J(e, a) {
       Object.keys(e).forEach(function(l) {
-        const o = e[l], t = i ? i + "." + l : l;
+        const o = e[l], t = a ? a + "." + l : l;
         typeof o == "object" && o !== null && !Array.isArray(o) && h["dot-notation"] ? J(o, t) : (!E(w, t.split(".")) || g(t, r.arrays) && h["combine-arrays"]) && q(t, o);
       });
     }
@@ -348,7 +348,7 @@ class Ne {
         J(e);
       });
     }
-    function re(e, i) {
+    function re(e, a) {
       if (typeof P > "u")
         return;
       const l = typeof P == "string" ? P : "", o = A.env();
@@ -357,17 +357,17 @@ class Ne {
           const p = t.split("__").map(function(c, d) {
             return d === 0 && (c = c.substring(l.length)), W(c);
           });
-          (i && r.configs[p.join(".")] || !i) && !E(e, p) && q(p.join("."), o[t]);
+          (a && r.configs[p.join(".")] || !a) && !E(e, p) && q(p.join("."), o[t]);
         }
       });
     }
     function fe(e) {
-      let i;
+      let a;
       const l = /* @__PURE__ */ new Set();
       Object.keys(e).forEach(function(o) {
-        if (!l.has(o) && (i = g(o, r.coercions), typeof i == "function"))
+        if (!l.has(o) && (a = g(o, r.coercions), typeof a == "function"))
           try {
-            const t = $(o, i(e[o]));
+            const t = $(o, a(e[o]));
             [].concat(r.aliases[o] || [], o).forEach((p) => {
               l.add(p), e[p] = t;
             });
@@ -377,38 +377,38 @@ class Ne {
       });
     }
     function be(e) {
-      return r.keys.forEach((i) => {
-        ~i.indexOf(".") || typeof e[i] > "u" && (e[i] = void 0);
+      return r.keys.forEach((a) => {
+        ~a.indexOf(".") || typeof e[a] > "u" && (e[a] = void 0);
       }), e;
     }
-    function me(e, i, l, o = !1) {
+    function me(e, a, l, o = !1) {
       Object.keys(l).forEach(function(t) {
-        E(e, t.split(".")) || (N(e, t.split("."), l[t]), o && (oe[t] = !0), (i[t] || []).forEach(function(p) {
+        E(e, t.split(".")) || (N(e, t.split("."), l[t]), o && (oe[t] = !0), (a[t] || []).forEach(function(p) {
           E(e, p.split(".")) || N(e, p.split("."), l[t]);
         }));
       });
     }
-    function E(e, i) {
+    function E(e, a) {
       let l = e;
-      h["dot-notation"] || (i = [i.join(".")]), i.slice(0, -1).forEach(function(t) {
+      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(t) {
         l = l[t] || {};
       });
-      const o = i[i.length - 1];
+      const o = a[a.length - 1];
       return typeof l != "object" ? !1 : o in l;
     }
-    function N(e, i, l) {
+    function N(e, a, l) {
       let o = e;
-      h["dot-notation"] || (i = [i.join(".")]), i.slice(0, -1).forEach(function(v) {
+      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(v) {
         v = le(v), typeof o == "object" && o[v] === void 0 && (o[v] = {}), typeof o[v] != "object" || Array.isArray(o[v]) ? (Array.isArray(o[v]) ? o[v].push({}) : o[v] = [o[v], {}], o = o[v][o[v].length - 1]) : o = o[v];
       });
-      const t = le(i[i.length - 1]), p = g(i.join("."), r.arrays), c = Array.isArray(l);
+      const t = le(a[a.length - 1]), p = g(a.join("."), r.arrays), c = Array.isArray(l);
       let d = h["duplicate-arguments-array"];
       !d && g(t, r.nargs) && (d = !0, (!T(o[t]) && r.nargs[t] === 1 || Array.isArray(o[t]) && o[t].length === r.nargs[t]) && (o[t] = void 0)), l === Z() ? o[t] = Z(o[t]) : Array.isArray(o[t]) ? d && p && c ? o[t] = h["flatten-duplicate-arrays"] ? o[t].concat(l) : (Array.isArray(o[t][0]) ? o[t] : [o[t]]).concat([l]) : !d && !!p == !!c ? o[t] = l : o[t] = o[t].concat([l]) : o[t] === void 0 && p ? o[t] = c ? l : [l] : d && !(o[t] === void 0 || g(t, r.counts) || g(t, r.bools)) ? o[t] = [o[t], l] : o[t] = l;
     }
     function qe(...e) {
-      e.forEach(function(i) {
-        Object.keys(i || {}).forEach(function(l) {
-          r.aliases[l] || (r.aliases[l] = [].concat(k[l] || []), r.aliases[l].concat(l).forEach(function(o) {
+      e.forEach(function(a) {
+        Object.keys(a || {}).forEach(function(l) {
+          r.aliases[l] || (r.aliases[l] = [].concat(_[l] || []), r.aliases[l].concat(l).forEach(function(o) {
             if (/-/.test(o) && h["camel-case-expansion"]) {
               const t = W(o);
               t !== l && r.aliases[l].indexOf(t) === -1 && (r.aliases[l].push(t), Q[t] = !0);
@@ -426,18 +426,18 @@ class Ne {
         });
       });
     }
-    function g(e, i) {
-      const l = [].concat(r.aliases[e] || [], e), o = Object.keys(i), t = l.find((p) => o.includes(p));
-      return t ? i[t] : !1;
+    function g(e, a) {
+      const l = [].concat(r.aliases[e] || [], e), o = Object.keys(a), t = l.find((p) => o.includes(p));
+      return t ? a[t] : !1;
     }
     function ue(e) {
-      const i = Object.keys(r);
-      return [].concat(i.map((o) => r[o])).some(function(o) {
+      const a = Object.keys(r);
+      return [].concat(a.map((o) => r[o])).some(function(o) {
         return Array.isArray(o) ? o.includes(e) : o[e];
       });
     }
-    function we(e, ...i) {
-      return [].concat(...i).some(function(o) {
+    function we(e, ...a) {
+      return [].concat(...a).some(function(o) {
         const t = e.match(o);
         return t && ue(t[1]);
       });
@@ -445,17 +445,17 @@ class Ne {
     function ve(e) {
       if (e.match(L) || !e.match(/^-[^-]+/))
         return !1;
-      let i = !0, l;
+      let a = !0, l;
       const o = e.slice(1).split("");
       for (let t = 0; t < o.length; t++) {
         if (l = e.slice(t + 2), !ue(o[t])) {
-          i = !1;
+          a = !1;
           break;
         }
         if (o[t + 1] && o[t + 1] === "=" || l === "-" || /[A-Za-z]/.test(o[t]) && /^-?\d+(\.\d*)?(e-?\d+)?$/.test(l) || o[t + 1] && o[t + 1].match(/\W/))
           break;
       }
-      return i;
+      return a;
     }
     function H(e) {
       return h["unknown-options-as-args"] && xe(e);
@@ -475,8 +475,8 @@ class Ne {
       }[e];
     }
     function Be(e) {
-      let i = I.BOOLEAN;
-      return g(e, r.strings) ? i = I.STRING : g(e, r.numbers) ? i = I.NUMBER : g(e, r.bools) ? i = I.BOOLEAN : g(e, r.arrays) && (i = I.ARRAY), i;
+      let a = I.BOOLEAN;
+      return g(e, r.strings) ? a = I.STRING : g(e, r.numbers) ? a = I.NUMBER : g(e, r.bools) ? a = I.BOOLEAN : g(e, r.arrays) && (a = I.ARRAY), a;
     }
     function T(e) {
       return e === void 0;
@@ -494,38 +494,38 @@ class Ne {
     };
   }
 }
-function ze(a) {
+function ze(i) {
   const n = [], m = /* @__PURE__ */ Object.create(null);
   let s = !0;
-  for (Object.keys(a).forEach(function(u) {
-    n.push([].concat(a[u], u));
+  for (Object.keys(i).forEach(function(u) {
+    n.push([].concat(i[u], u));
   }); s; ) {
     s = !1;
     for (let u = 0; u < n.length; u++)
-      for (let _ = u + 1; _ < n.length; _++)
+      for (let k = u + 1; k < n.length; k++)
         if (n[u].filter(function(h) {
-          return n[_].indexOf(h) !== -1;
+          return n[k].indexOf(h) !== -1;
         }).length) {
-          n[u] = n[u].concat(n[_]), n.splice(_, 1), s = !0;
+          n[u] = n[u].concat(n[k]), n.splice(k, 1), s = !0;
           break;
         }
   }
   return n.forEach(function(u) {
-    u = u.filter(function(k, h, f) {
-      return f.indexOf(k) === h;
+    u = u.filter(function(_, h, f) {
+      return f.indexOf(_) === h;
     });
-    const _ = u.pop();
-    _ !== void 0 && typeof _ == "string" && (m[_] = u);
+    const k = u.pop();
+    k !== void 0 && typeof k == "string" && (m[k] = u);
   }), m;
 }
-function Z(a) {
-  return a !== void 0 ? a + 1 : 1;
+function Z(i) {
+  return i !== void 0 ? i + 1 : 1;
 }
-function le(a) {
-  return a === "__proto__" ? "___proto___" : a;
+function le(i) {
+  return i === "__proto__" ? "___proto___" : i;
 }
-function je(a) {
-  return typeof a == "string" && (a[0] === "'" || a[0] === '"') && a[a.length - 1] === a[0] ? a.substring(1, a.length - 1) : a;
+function je(i) {
+  return typeof i == "string" && (i[0] === "'" || i[0] === '"') && i[i.length - 1] === i[0] ? i.substring(1, i.length - 1) : i;
 }
 /**
  * @fileoverview Main entrypoint for libraries using yargs-parser in Node.js
@@ -545,27 +545,27 @@ new Ne({
   env: () => Qe,
   format: he,
   normalize: Ie,
-  resolve: ie,
+  resolve: ae,
   // TODO: figure  out a  way to combine ESM and CJS coverage, such  that
   // we can exercise all the lines below:
-  require: (a) => {
+  require: (i) => {
     if (typeof require < "u")
-      return require(a);
-    if (a.match(/\.json$/))
-      return JSON.parse(ke(a, "utf8"));
+      return require(i);
+    if (i.match(/\.json$/))
+      return JSON.parse(_e(i, "utf8"));
     throw Error("only .json config files are supported in ESM");
   }
 });
 const Fe = {
   fs: {
-    readFileSync: ke,
+    readFileSync: _e,
     writeFile: Le
   },
   format: he,
-  resolve: ie,
-  exists: (a) => {
+  resolve: ae,
+  exists: (i) => {
     try {
-      return Pe(a).isFile();
+      return Pe(i).isFile();
     } catch {
       return !1;
     }
@@ -591,20 +591,20 @@ class De {
   }
   __n() {
     const n = Array.prototype.slice.call(arguments), m = n.shift(), s = n.shift(), u = n.shift();
-    let _ = function() {
+    let k = function() {
     };
-    typeof n[n.length - 1] == "function" && (_ = n.pop()), this.cache[this.locale] || this._readLocaleFile();
-    let k = u === 1 ? m : s;
-    this.cache[this.locale][m] && (k = this.cache[this.locale][m][u === 1 ? "one" : "other"]), !this.cache[this.locale][m] && this.updateFiles ? (this.cache[this.locale][m] = {
+    typeof n[n.length - 1] == "function" && (k = n.pop()), this.cache[this.locale] || this._readLocaleFile();
+    let _ = u === 1 ? m : s;
+    this.cache[this.locale][m] && (_ = this.cache[this.locale][m][u === 1 ? "one" : "other"]), !this.cache[this.locale][m] && this.updateFiles ? (this.cache[this.locale][m] = {
       one: m,
       other: s
     }, this._enqueueWrite({
       directory: this.directory,
       locale: this.locale,
-      cb: _
-    })) : _();
-    const h = [k];
-    return ~k.indexOf("%d") && h.push(u), M.format.apply(M.format, h.concat(n));
+      cb: k
+    })) : k();
+    const h = [_];
+    return ~_.indexOf("%d") && h.push(u), M.format.apply(M.format, h.concat(n));
   }
   setLocale(n) {
     this.locale = n;
@@ -619,18 +619,18 @@ class De {
   }
   _taggedLiteral(n, ...m) {
     let s = "";
-    return n.forEach(function(u, _) {
-      const k = m[_ + 1];
-      s += u, typeof k < "u" && (s += "%s");
+    return n.forEach(function(u, k) {
+      const _ = m[k + 1];
+      s += u, typeof _ < "u" && (s += "%s");
     }), this.__.apply(this, [s].concat([].slice.call(m, 1)));
   }
   _enqueueWrite(n) {
     this.writeQueue.push(n), this.writeQueue.length === 1 && this._processWriteQueue();
   }
   _processWriteQueue() {
-    const n = this, m = this.writeQueue[0], s = m.directory, u = m.locale, _ = m.cb, k = this._resolveLocaleFile(s, u), h = JSON.stringify(this.cache[u], null, 2);
-    M.fs.writeFile(k, h, "utf-8", function(f) {
-      n.writeQueue.shift(), n.writeQueue.length > 0 && n._processWriteQueue(), _(f);
+    const n = this, m = this.writeQueue[0], s = m.directory, u = m.locale, k = m.cb, _ = this._resolveLocaleFile(s, u), h = JSON.stringify(this.cache[u], null, 2);
+    M.fs.writeFile(_, h, "utf-8", function(f) {
+      n.writeQueue.shift(), n.writeQueue.length > 0 && n._processWriteQueue(), k(f);
     });
   }
   _readLocaleFile() {
@@ -658,9 +658,9 @@ class De {
     return M.exists(n);
   }
 }
-function Ve(a, n) {
+function Ve(i, n) {
   M = n;
-  const m = new De(a);
+  const m = new De(i);
   return {
     __: m.__.bind(m),
     __n: m.__n.bind(m),
@@ -670,7 +670,7 @@ function Ve(a, n) {
     locale: m.locale
   };
 }
-const $e = (a) => Ve(a, Fe);
+const $e = (i) => Ve(i, Fe);
 let z;
 try {
   z = Te(import.meta.url);
@@ -679,10 +679,10 @@ try {
 }
 const He = z.substring(0, z.lastIndexOf("node_modules"));
 He || process.cwd(), process.cwd, process.exit, process.nextTick, typeof process.stdout.columns < "u" && process.stdout.columns, $e({
-  directory: ie(z, "../../../locales"),
+  directory: ae(z, "../../../locales"),
   updateFiles: !1
 });
-const ae = [
+const ie = [
   {
     id: "anthropic",
     name: "Anthropic",
@@ -1147,13 +1147,13 @@ const ae = [
     ],
     models: [
       {
-        id: "meta.llama3-8b-instruct-v1%3A0",
+        id: "meta.llama3-8b-instruct-v1:0",
         match: {
-          equals: "meta.llama3-8b-instruct-v1%3A0"
+          contains: "llama3-8b-instruct-v1"
         },
         prices: {
-          input_mtok: 220,
-          output_mtok: 720
+          input_mtok: 0.3,
+          output_mtok: 0.6
         }
       },
       {
@@ -1163,15 +1163,13 @@ const ae = [
         match: {
           or: [
             {
-              equals: "nova-lite-v1"
-            },
-            {
-              equals: "amazon.nova-lite-v1:0"
+              contains: "nova-lite-v1"
             }
           ]
         },
         prices: {
           input_mtok: 0.06,
+          cache_read_mtok: 0.015,
           output_mtok: 0.24
         }
       },
@@ -1182,15 +1180,13 @@ const ae = [
         match: {
           or: [
             {
-              equals: "nova-micro-v1"
-            },
-            {
-              equals: "amazon.nova-micro-v1:0"
+              contains: "nova-micro-v1"
             }
           ]
         },
         prices: {
           input_mtok: 0.035,
+          cache_read_mtok: 875e-5,
           output_mtok: 0.14
         }
       },
@@ -1201,15 +1197,13 @@ const ae = [
         match: {
           or: [
             {
-              equals: "nova-pro-v1"
-            },
-            {
-              equals: "amazon.nova-pro-v1:0"
+              contains: "nova-pro-v1"
             }
           ]
         },
         prices: {
           input_mtok: 0.8,
+          cache_read_mtok: 0.2,
           output_mtok: 3.2
         }
       }
@@ -1986,6 +1980,135 @@ const ae = [
       }
     ]
   },
+  {
+    id: "cerebras",
+    name: "Cerebras",
+    pricing_urls: ["https://www.cerebras.ai/pricing#pricing", "https://inference-docs.cerebras.ai/models/openai-oss"],
+    api_pattern: "https://api\\.cerebras\\.ai",
+    model_match: {
+      contains: "cerebras"
+    },
+    provider_match: {
+      contains: "cerebras"
+    },
+    extractors: [
+      {
+        api_flavor: "chat",
+        root: "usage",
+        model_path: "model",
+        mappings: [
+          {
+            path: "prompt_tokens",
+            dest: "input_tokens",
+            required: !0
+          },
+          {
+            path: "completion_tokens",
+            dest: "output_tokens",
+            required: !0
+          }
+        ]
+      }
+    ],
+    models: [
+      {
+        id: "gpt-oss-120b",
+        name: "GPT-OSS 120B",
+        description: "OpenAI's flagship open source model, built on a Mixture-of-Experts (MoE) architecture with 120 billion parameters and 128 experts. Delivers frontier reasoning capabilities with record-breaking inference speeds on Cerebras hardware (~3,000 tokens/second).",
+        match: {
+          or: [
+            {
+              equals: "gpt-oss-120b"
+            },
+            {
+              starts_with: "cerebras/gpt-oss-120b"
+            },
+            {
+              starts_with: "cerebras:gpt-oss-120b"
+            }
+          ]
+        },
+        context_window: 131072,
+        price_comments: "Developer tier pricing. Free tier: 65k context, Paid tier: 131k context.",
+        prices: {
+          input_mtok: 0.35,
+          output_mtok: 0.75
+        }
+      },
+      {
+        id: "llama-3.3-70b",
+        name: "Llama 3.3 70B",
+        description: "Meta's enhanced 70B model delivering 405B-level accuracy. Optimized for chat, coding, instruction following, mathematics, and reasoning with high-speed inference on Cerebras hardware (~2,100 tokens/second).",
+        match: {
+          or: [
+            {
+              equals: "llama-3.3-70b"
+            },
+            {
+              starts_with: "cerebras/llama-3.3-70b"
+            },
+            {
+              starts_with: "cerebras:llama-3.3-70b"
+            }
+          ]
+        },
+        context_window: 128e3,
+        price_comments: "Developer tier pricing. Free tier: 65k context, Paid tier: 128k context.",
+        prices: {
+          input_mtok: 0.85,
+          output_mtok: 1.2
+        }
+      },
+      {
+        id: "llama3.1-8b",
+        name: "Llama 3.1 8B",
+        description: "Meta's Llama 3.1 8B model for general-purpose tasks including chat, coding, and instruction following. Optimized for fast inference on Cerebras hardware (~2,200 tokens/second).",
+        match: {
+          or: [
+            {
+              equals: "llama3.1-8b"
+            },
+            {
+              starts_with: "cerebras/llama3.1-8b"
+            },
+            {
+              starts_with: "cerebras:llama3.1-8b"
+            }
+          ]
+        },
+        context_window: 32768,
+        price_comments: "Developer tier pricing. Free tier: 8k context, Paid tier: 32k context.",
+        prices: {
+          input_mtok: 0.1,
+          output_mtok: 0.1
+        }
+      },
+      {
+        id: "qwen-3-32b",
+        name: "Qwen 3 32B",
+        description: "Qwen's 32B parameter model with enhanced reasoning and coding capabilities. Supports both standard and reasoning modes for complex tasks, with fast inference speeds on Cerebras hardware (~2,600 tokens/second).",
+        match: {
+          or: [
+            {
+              equals: "qwen-3-32b"
+            },
+            {
+              starts_with: "cerebras/qwen-3-32b"
+            },
+            {
+              starts_with: "cerebras:qwen-3-32b"
+            }
+          ]
+        },
+        context_window: 131072,
+        price_comments: "Developer tier pricing. Free tier: 65k context, Paid tier: 131k context.",
+        prices: {
+          input_mtok: 0.4,
+          output_mtok: 0.8
+        }
+      }
+    ]
+  },
   {
     id: "cohere",
     name: "Cohere",
@@ -2383,7 +2506,12 @@ Compared to other leading proprietary and open-weights models Command A delivers
           {
             path: "promptTokenCount",
             dest: "input_tokens",
-            required: !0
+            required: !1
+          },
+          {
+            path: "cachedContentTokenCount",
+            dest: "cache_read_tokens",
+            required: !1
           },
           {
             path: [
@@ -2392,17 +2520,17 @@ Compared to other leading proprietary and open-weights models Command A delivers
                 type: "array-match",
                 field: "modality",
                 match: {
-                  equals: "TEXT"
+                  equals: "AUDIO"
                 }
               },
               "tokenCount"
             ],
-            dest: "cache_read_tokens",
+            dest: "cache_audio_read_tokens",
             required: !1
           },
           {
             path: [
-              "cacheTokensDetails",
+              "promptTokensDetails",
               {
                 type: "array-match",
                 field: "modality",
@@ -2412,12 +2540,12 @@ Compared to other leading proprietary and open-weights models Command A delivers
               },
               "tokenCount"
             ],
-            dest: "cache_audio_read_tokens",
+            dest: "input_audio_tokens",
             required: !1
           },
           {
             path: [
-              "promptTokensDetails",
+              "candidatesTokensDetails",
               {
                 type: "array-match",
                 field: "modality",
@@ -2427,18 +2555,23 @@ Compared to other leading proprietary and open-weights models Command A delivers
               },
               "tokenCount"
             ],
-            dest: "input_audio_tokens",
+            dest: "output_audio_tokens",
             required: !1
           },
           {
             path: "candidatesTokenCount",
             dest: "output_tokens",
-            required: !0
+            required: !1
           },
           {
             path: "thoughtsTokenCount",
             dest: "output_tokens",
             required: !1
+          },
+          {
+            path: "toolUsePromptTokenCount",
+            dest: "output_tokens",
+            required: !1
           }
         ]
       },
@@ -3084,6 +3217,16 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.99
         }
       },
+      {
+        id: "gemma-7b-it",
+        match: {
+          equals: "gemma-7b-it"
+        },
+        prices: {
+          input_mtok: 0.07,
+          output_mtok: 0.07
+        }
+      },
       {
         id: "gemma2-9b-it",
         name: "Gemma 2 9B 8k",
@@ -3102,6 +3245,26 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.2
         }
       },
+      {
+        id: "llama-3.1-405b-reasoning",
+        match: {
+          equals: "llama-3.1-405b-reasoning"
+        },
+        prices: {
+          input_mtok: 0.59,
+          output_mtok: 0.79
+        }
+      },
+      {
+        id: "llama-3.1-70b-versatile",
+        match: {
+          equals: "llama-3.1-70b-versatile"
+        },
+        prices: {
+          input_mtok: 0.59,
+          output_mtok: 0.79
+        }
+      },
       {
         id: "llama-3.1-8b-instant",
         name: "Llama 3.1 8B Instant 128k",
@@ -3113,6 +3276,76 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.08
         }
       },
+      {
+        id: "llama-3.2-11b-text-preview",
+        match: {
+          equals: "llama-3.2-11b-text-preview"
+        },
+        prices: {
+          input_mtok: 0.18,
+          output_mtok: 0.18
+        }
+      },
+      {
+        id: "llama-3.2-11b-vision-preview",
+        match: {
+          equals: "llama-3.2-11b-vision-preview"
+        },
+        prices: {
+          input_mtok: 0.18,
+          output_mtok: 0.18
+        }
+      },
+      {
+        id: "llama-3.2-1b-preview",
+        match: {
+          equals: "llama-3.2-1b-preview"
+        },
+        prices: {
+          input_mtok: 0.04,
+          output_mtok: 0.04
+        }
+      },
+      {
+        id: "llama-3.2-3b-preview",
+        match: {
+          equals: "llama-3.2-3b-preview"
+        },
+        prices: {
+          input_mtok: 0.06,
+          output_mtok: 0.06
+        }
+      },
+      {
+        id: "llama-3.2-90b-text-preview",
+        match: {
+          equals: "llama-3.2-90b-text-preview"
+        },
+        prices: {
+          input_mtok: 0.9,
+          output_mtok: 0.9
+        }
+      },
+      {
+        id: "llama-3.2-90b-vision-preview",
+        match: {
+          equals: "llama-3.2-90b-vision-preview"
+        },
+        prices: {
+          input_mtok: 0.9,
+          output_mtok: 0.9
+        }
+      },
+      {
+        id: "llama-3.3-70b-specdec",
+        match: {
+          equals: "llama-3.3-70b-specdec"
+        },
+        prices: {
+          input_mtok: 0.59,
+          output_mtok: 0.99
+        }
+      },
       {
         id: "llama-3.3-70b-versatile",
         name: "Llama 3.3 70B Versatile 128k",
@@ -3124,6 +3357,16 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.79
         }
       },
+      {
+        id: "llama-guard-3-8b",
+        match: {
+          equals: "llama-guard-3-8b"
+        },
+        prices: {
+          input_mtok: 0.2,
+          output_mtok: 0.2
+        }
+      },
       {
         id: "llama2-70b-4096",
         match: {
@@ -3209,15 +3452,43 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.2
         }
       },
+      {
+        id: "mistral-saba-24b",
+        match: {
+          equals: "mistral-saba-24b"
+        },
+        prices: {
+          input_mtok: 0.79,
+          output_mtok: 0.79
+        }
+      },
+      {
+        id: "mixtral-8x7b-32768",
+        match: {
+          equals: "mixtral-8x7b-32768"
+        },
+        prices: {
+          input_mtok: 0.24,
+          output_mtok: 0.24
+        }
+      },
       {
         id: "moonshotai/kimi-k2-instruct",
         name: "Kimi K2 1T 128k",
         match: {
-          equals: "moonshotai/kimi-k2-instruct"
+          or: [
+            {
+              equals: "moonshotai/kimi-k2-instruct"
+            },
+            {
+              equals: "moonshotai/kimi-k2-instruct-0905"
+            }
+          ]
         },
         context_window: 131072,
         prices: {
           input_mtok: 1,
+          cache_read_mtok: 0.5,
           output_mtok: 3
         }
       },
@@ -3227,12 +3498,20 @@ Compared to other leading proprietary and open-weights models Command A delivers
 120 billion parameters and 128 experts.
 `,
         match: {
-          equals: "openai/gpt-oss-120b"
+          or: [
+            {
+              equals: "openai/gpt-oss-120b"
+            },
+            {
+              equals: "openai/gpt-oss-safeguard-20b"
+            }
+          ]
         },
         context_window: 131072,
         prices: {
           input_mtok: 0.15,
-          output_mtok: 0.75
+          cache_read_mtok: 0.075,
+          output_mtok: 0.6
         }
       },
       {
@@ -3245,8 +3524,9 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         context_window: 131072,
         prices: {
-          input_mtok: 0.1,
-          output_mtok: 0.5
+          input_mtok: 0.075,
+          cache_read_mtok: 0.0375,
+          output_mtok: 0.3
         }
       },
       {
@@ -4060,6 +4340,18 @@ Compared to other leading proprietary and open-weights models Command A delivers
             required: !0
           }
         ]
+      },
+      {
+        api_flavor: "embeddings",
+        root: "usage",
+        model_path: "model",
+        mappings: [
+          {
+            path: "prompt_tokens",
+            dest: "input_tokens",
+            required: !0
+          }
+        ]
       }
     ],
     models: [
@@ -4122,6 +4414,17 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 6
         }
       },
+      {
+        id: "computer-use",
+        name: "Computer use",
+        match: {
+          starts_with: "computer-use"
+        },
+        prices: {
+          input_mtok: 3,
+          output_mtok: 12
+        }
+      },
       {
         id: "curie",
         match: {
@@ -4771,11 +5074,59 @@ Compared to other leading proprietary and open-weights models Command A delivers
             }
           ]
         },
+        context_window: 4e5,
         prices: {
           input_mtok: 15,
           output_mtok: 120
         }
       },
+      {
+        id: "gpt-5.1",
+        name: "GPT-5.1",
+        description: "The best model for coding and agentic tasks across industries",
+        match: {
+          or: [
+            {
+              equals: "gpt-5.1"
+            },
+            {
+              equals: "gpt-5.1-2025-11-13"
+            },
+            {
+              equals: "gpt-5.1-codex"
+            },
+            {
+              equals: "gpt-5.1-chat-latest"
+            }
+          ]
+        },
+        context_window: 4e5,
+        prices: {
+          input_mtok: 1.25,
+          cache_read_mtok: 0.125,
+          output_mtok: 10
+        }
+      },
+      {
+        id: "gpt-5.1-codex-mini",
+        name: "GPT-5.1 Codex Mini",
+        match: {
+          or: [
+            {
+              equals: "gpt-5.1-codex-mini"
+            },
+            {
+              equals: "gpt-5.1-mini"
+            }
+          ]
+        },
+        context_window: 4e5,
+        prices: {
+          input_mtok: 0.25,
+          cache_read_mtok: 0.025,
+          output_mtok: 2
+        }
+      },
       {
         id: "gpt-realtime",
         match: {
@@ -12218,37 +12569,37 @@ Compared to other leading proprietary and open-weights models Command A delivers
     ]
   }
 ];
-function We(a, n) {
+function We(i, n) {
   if (n <= 0) return 0;
   let m = 0;
-  const s = [...a.tiers].sort((k, h) => k.start - h.start), u = s[0]?.start ?? n, _ = Math.min(n, u);
-  m += _ * a.base / 1e6;
-  for (let k = 0; k < s.length; k++) {
-    const h = s[k], f = s[k + 1]?.start ?? 1 / 0, y = Math.max(0, Math.min(n, f) - h.start);
+  const s = [...i.tiers].sort((_, h) => _.start - h.start), u = s[0]?.start ?? n, k = Math.min(n, u);
+  m += k * i.base / 1e6;
+  for (let _ = 0; _ < s.length; _++) {
+    const h = s[_], f = s[_ + 1]?.start ?? 1 / 0, y = Math.max(0, Math.min(n, f) - h.start);
     y > 0 && (m += y * h.price / 1e6);
   }
   return m;
 }
-function O(a, n, m) {
-  return a === void 0 || n === void 0 ? 0 : typeof a == "number" ? a * n / 1e6 : We(a, n);
+function O(i, n, m) {
+  return i === void 0 || n === void 0 ? 0 : typeof i == "number" ? i * n / 1e6 : We(i, n);
 }
-function Ue(a, n) {
+function Ue(i, n) {
   let m = 0, s = 0;
-  const u = a.cache_read_tokens ?? 0, _ = a.cache_write_tokens ?? 0, k = a.cache_audio_read_tokens ?? 0, h = a.output_audio_tokens ?? 0;
-  let f = a.input_audio_tokens ?? 0;
-  if (f -= k, f < 0)
+  const u = i.cache_read_tokens ?? 0, k = i.cache_write_tokens ?? 0, _ = i.cache_audio_read_tokens ?? 0, h = i.output_audio_tokens ?? 0;
+  let f = i.input_audio_tokens ?? 0;
+  if (f -= _, f < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than input_audio_tokens");
-  let y = a.input_tokens ?? 0;
-  if (y -= u, y -= _, y -= f, y < 0)
+  let y = i.input_tokens ?? 0;
+  if (y -= u, y -= k, y -= f, y < 0)
     throw new Error("Uncached text input tokens cannot be negative");
   let P = u;
-  if (P -= k, P < 0)
+  if (P -= _, P < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than cache_read_tokens");
-  m += O(n.input_mtok, y), m += O(n.cache_read_mtok, P), m += O(n.cache_write_mtok, _), m += O(n.input_audio_mtok, f), m += O(n.cache_audio_read_mtok, k);
-  let S = a.output_tokens ?? 0;
+  m += O(n.input_mtok, y), m += O(n.cache_read_mtok, P), m += O(n.cache_write_mtok, k), m += O(n.input_audio_mtok, f), m += O(n.cache_audio_read_mtok, _);
+  let S = i.output_tokens ?? 0;
   if (S -= h, S < 0)
     throw new Error("output_audio_tokens cannot be greater than output_tokens");
-  s += O(n.output_mtok, S), s += O(n.output_audio_mtok, a.output_audio_tokens);
+  s += O(n.output_mtok, S), s += O(n.output_audio_mtok, i.output_audio_tokens);
   let G = m + s;
   return n.requests_kcount !== void 0 && (G += n.requests_kcount / 1e3), {
     input_price: m,
@@ -12256,56 +12607,56 @@ function Ue(a, n) {
     total_price: G
   };
 }
-function Ke(a, n) {
-  if (!Array.isArray(a.prices))
-    return a.prices;
-  for (let m = a.prices.length - 1; m >= 0; m--) {
-    const s = a.prices[m], u = s.constraint;
+function Ke(i, n) {
+  if (!Array.isArray(i.prices))
+    return i.prices;
+  for (let m = i.prices.length - 1; m >= 0; m--) {
+    const s = i.prices[m], u = s.constraint;
     if (u === void 0)
       return s.prices;
     if (u.type === "start_date") {
       if (n >= new Date(u.start_date))
         return s.prices;
     } else {
-      const _ = n.toISOString().slice(11, 19), k = u.start_time, h = u.end_time;
-      if (h < k) {
-        if (_ >= k || _ < h)
+      const k = n.toISOString().slice(11, 19), _ = u.start_time, h = u.end_time;
+      if (h < _) {
+        if (k >= _ || k < h)
           return s.prices;
-      } else if (_ >= k && _ < h)
+      } else if (k >= _ && k < h)
         return s.prices;
     }
   }
-  return a.prices[0].prices;
+  return i.prices[0].prices;
 }
-function j(a, n) {
-  return "or" in a ? a.or.some((m) => j(m, n)) : "and" in a ? a.and.every((m) => j(m, n)) : "equals" in a ? n === a.equals : "starts_with" in a ? n.startsWith(a.starts_with) : "ends_with" in a ? n.endsWith(a.ends_with) : "contains" in a ? n.includes(a.contains) : "regex" in a ? new RegExp(a.regex).test(n) : !1;
+function j(i, n) {
+  return "or" in i ? i.or.some((m) => j(m, n)) : "and" in i ? i.and.every((m) => j(m, n)) : "equals" in i ? n === i.equals : "starts_with" in i ? n.startsWith(i.starts_with) : "ends_with" in i ? n.endsWith(i.ends_with) : "contains" in i ? n.includes(i.contains) : "regex" in i ? new RegExp(i.regex).test(n) : !1;
 }
-function Ye(a, n) {
-  const m = n.toLowerCase().trim(), s = a.find((u) => u.id === m);
-  return s || a.find((u) => u.provider_match && j(u.provider_match, m));
+function Ye(i, n) {
+  const m = n.toLowerCase().trim(), s = i.find((u) => u.id === m);
+  return s || i.find((u) => u.provider_match && j(u.provider_match, m));
 }
-function Je(a, { modelId: n, providerApiUrl: m, providerId: s }) {
+function Je(i, { modelId: n, providerApiUrl: m, providerId: s }) {
   if (s)
-    return Ye(a, s);
+    return Ye(i, s);
   if (m)
-    return a.find((u) => new RegExp(u.api_pattern).test(m));
+    return i.find((u) => new RegExp(u.api_pattern).test(m));
   if (n)
-    return a.find((u) => u.model_match && j(u.model_match, n));
+    return i.find((u) => u.model_match && j(u.model_match, n));
 }
-function Ze(a, n) {
-  return a.find((m) => j(m.match, n));
+function Ze(i, n) {
+  return i.find((m) => j(m.match, n));
 }
-let Xe = ae;
-Promise.resolve(ae);
-function et(a, n, m) {
+let Xe = ie;
+Promise.resolve(ie);
+function et(i, n, m) {
   const s = n.toLowerCase().trim(), u = m?.provider ?? Je(Xe, { modelId: s, providerApiUrl: m?.providerApiUrl, providerId: m?.providerId });
   if (!u) return null;
-  const _ = Ze(u.models, s);
-  if (!_) return null;
-  const k = m?.timestamp ?? /* @__PURE__ */ new Date(), h = Ke(_, k), f = Ue(a, h);
+  const k = Ze(u.models, s);
+  if (!k) return null;
+  const _ = m?.timestamp ?? /* @__PURE__ */ new Date(), h = Ke(k, _), f = Ue(i, h);
   return {
     auto_update_timestamp: void 0,
-    model: _,
+    model: k,
     model_price: h,
     provider: u,
     ...f
@@ -12314,15 +12665,15 @@ function et(a, n, m) {
 const b = de(Ce(process.argv)).scriptName("genai-prices").command(
   "list [provider]",
   "List providers and models",
-  (a) => a.positional("provider", { describe: "Provider ID to filter", type: "string" })
+  (i) => i.positional("provider", { describe: "Provider ID to filter", type: "string" })
 ).command(
   "calc <model...>",
   "Calculate price",
-  (a) => a.positional("model", { array: !0, describe: "Model(s) (optionally provider:model)", type: "string" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("auto-update", { default: !1, type: "boolean" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" })
+  (i) => i.positional("model", { array: !0, describe: "Model(s) (optionally provider:model)", type: "string" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("auto-update", { default: !1, type: "boolean" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" })
 ).option("auto-update", { describe: "Enable auto-update from GitHub", type: "boolean" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" }).version("0.1.0").help().parseSync();
 function tt() {
   if (b._[0] === "list") {
-    const m = ae;
+    const m = ie;
     if (b.provider) {
       const s = m.find((u) => u.id === b.provider);
       s || (console.error(`Provider ${b.provider} not found.`), process.exit(1)), console.log(`${s.name}: (${s.models.length} models)`);
@@ -12349,13 +12700,13 @@ function tt() {
       requests: b.requests !== void 0 ? Number(b.requests) : void 0
     }, s = b.timestamp ? new Date(String(b.timestamp)) : void 0;
     let u = !1;
-    for (const _ of n) {
-      let k, h = _;
-      h.includes(":") && ([k, h] = h.split(":", 2));
+    for (const k of n) {
+      let _, h = k;
+      h.includes(":") && ([_, h] = h.split(":", 2));
       try {
-        const f = et(m, h, { providerId: k, timestamp: s });
+        const f = et(m, h, { providerId: _, timestamp: s });
         if (!f) {
-          u = !0, console.error(`No price found for model ${_}`);
+          u = !0, console.error(`No price found for model ${k}`);
           continue;
         }
         const y = f.model.context_window, P = [
@@ -12371,7 +12722,7 @@ function tt() {
           G !== void 0 && console.log(`${S.padStart(14)}: ${G}`);
         console.log("");
       } catch (f) {
-        u = !0, f instanceof Error && console.error(`Error for model ${_}:`, f.message);
+        u = !0, f instanceof Error && console.error(`Error for model ${k}:`, f.message);
       }
     }
     process.exit(u ? 1 : 0);