@pydantic/genai-prices 0.0.65 → 0.0.66

package/dist/cli.js

@@ -2,10 +2,10 @@
 import he from "yargs";
 import { format as ke } from "util";
 import { resolve as oe, normalize as Qe } from "path";
-import { readFileSync as ge, writeFile as Pe, statSync as Se } from "fs";
+import { readFileSync as ge, writeFile as Pe, statSync as Ge } from "fs";
 import "assert";
 import { fileURLToPath as Te } from "url";
-function Ge() {
+function Se() {
   return Ce() ? 0 : 1;
 }
 function Ce() {
@@ -15,7 +15,7 @@ function ze() {
   return !!process.versions.electron;
 }
 function Re(i) {
-  return i.slice(Ge() + 1);
+  return i.slice(Se() + 1);
 }
 /**
  * @license
@@ -124,7 +124,7 @@ class De {
       "strip-aliased": !1,
       "strip-dashed": !1,
       "unknown-options-as-args": !1
-    }, s.configuration), q = Object.assign(/* @__PURE__ */ Object.create(null), s.default), S = s.configObjects || [], B = s.envPrefix, P = k["populate--"], y = P ? "--" : "_", T = /* @__PURE__ */ Object.create(null), N = /* @__PURE__ */ Object.create(null), L = s.__ || C.format, m = {
+    }, s.configuration), q = Object.assign(/* @__PURE__ */ Object.create(null), s.default), G = s.configObjects || [], B = s.envPrefix, P = k["populate--"], M = P ? "--" : "_", T = /* @__PURE__ */ Object.create(null), N = /* @__PURE__ */ Object.create(null), I = s.__ || C.format, m = {
       aliases: /* @__PURE__ */ Object.create(null),
       arrays: /* @__PURE__ */ Object.create(null),
       bools: /* @__PURE__ */ Object.create(null),
@@ -136,7 +136,7 @@ class De {
       nargs: /* @__PURE__ */ Object.create(null),
       coercions: /* @__PURE__ */ Object.create(null),
       keys: []
-    }, I = /^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/, U = new RegExp("^--" + k["negation-prefix"] + "(.+)");
+    }, y = /^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/, U = new RegExp("^--" + k["negation-prefix"] + "(.+)");
     [].concat(s.array || []).filter(Boolean).forEach(function(e) {
       const a = typeof e == "object" ? e.key : e, c = Object.keys(e).map(function(n) {
         return {
@@ -169,7 +169,7 @@ class De {
         q[a] = q[e];
       });
     });
-    let M = null;
+    let L = null;
     Ae();
     let V = [];
     const b = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), se = {};
@@ -182,39 +182,39 @@ class De {
         Y(a);
         continue;
       } else if (a.match(/^--.+=/) || !k["short-option-groups"] && a.match(/^-.+=/))
-        p = a.match(/^--?([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && (g(p[1], m.arrays) ? e = K(e, p[1], r, p[2]) : g(p[1], m.nargs) !== !1 ? e = j(e, p[1], r, p[2]) : w(p[1], p[2], !0));
+        p = a.match(/^--?([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && (g(p[1], m.arrays) ? e = K(e, p[1], r, p[2]) : g(p[1], m.nargs) !== !1 ? e = j(e, p[1], r, p[2]) : f(p[1], p[2], !0));
       else if (a.match(U) && k["boolean-negation"])
-        p = a.match(U), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], w(t, g(t, m.arrays) ? [!1] : !1));
+        p = a.match(U), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], f(t, g(t, m.arrays) ? [!1] : !1));
       else if (a.match(/^--.+/) || !k["short-option-groups"] && a.match(/^-[^-]+/))
-        p = a.match(/^--?(.+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(I)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (w(t, d), e++) : w(t, R(t))));
+        p = a.match(/^--?(.+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(y)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (f(t, d), e++) : f(t, R(t))));
       else if (a.match(/^-.\..+=/))
-        p = a.match(/^-([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && w(p[1], p[2]);
-      else if (a.match(/^-.\..+/) && !a.match(I))
-        d = r[e + 1], p = a.match(/^-(.\..+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], d !== void 0 && !d.match(/^-/) && !g(t, m.bools) && !g(t, m.counts) ? (w(t, d), e++) : w(t, R(t)));
-      else if (a.match(/^-[^-]+/) && !a.match(I)) {
+        p = a.match(/^-([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && f(p[1], p[2]);
+      else if (a.match(/^-.\..+/) && !a.match(y))
+        d = r[e + 1], p = a.match(/^-(.\..+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], d !== void 0 && !d.match(/^-/) && !g(t, m.bools) && !g(t, m.counts) ? (f(t, d), e++) : f(t, R(t)));
+      else if (a.match(/^-[^-]+/) && !a.match(y)) {
         l = a.slice(1, -1).split(""), n = !1;
         for (let x = 0; x < l.length; x++) {
           if (d = a.slice(x + 2), l[x + 1] && l[x + 1] === "=") {
-            v = a.slice(x + 3), t = l[x], g(t, m.arrays) ? e = K(e, t, r, v) : g(t, m.nargs) !== !1 ? e = j(e, t, r, v) : w(t, v), n = !0;
+            v = a.slice(x + 3), t = l[x], g(t, m.arrays) ? e = K(e, t, r, v) : g(t, m.nargs) !== !1 ? e = j(e, t, r, v) : f(t, v), n = !0;
             break;
           }
           if (d === "-") {
-            w(l[x], d);
+            f(l[x], d);
             continue;
           }
           if (/[A-Za-z]/.test(l[x]) && /^-?\d+(\.\d*)?(e-?\d+)?$/.test(d) && g(d, m.bools) === !1) {
-            w(l[x], d), n = !0;
+            f(l[x], d), n = !0;
             break;
           }
           if (l[x + 1] && l[x + 1].match(/\W/)) {
-            w(l[x], d), n = !0;
+            f(l[x], d), n = !0;
             break;
           } else
-            w(l[x], R(l[x]));
+            f(l[x], R(l[x]));
         }
-        t = a.slice(-1)[0], !n && t !== "-" && (g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(I)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (w(t, d), e++) : w(t, R(t))));
-      } else if (a.match(/^-[0-9]$/) && a.match(I) && g(a.slice(1), m.bools))
-        t = a.slice(1), w(t, R(t));
+        t = a.slice(-1)[0], !n && t !== "-" && (g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(y)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (f(t, d), e++) : f(t, R(t))));
+      } else if (a.match(/^-[0-9]$/) && a.match(y) && g(a.slice(1), m.bools))
+        t = a.slice(1), f(t, R(t));
       else if (a === "--") {
         V = r.slice(e + 1);
         break;
@@ -224,10 +224,10 @@ class De {
       } else
         Y(a);
     }
-    me(b, !0), me(b, !1), fe(b), we(), ue(b, m.aliases, q, !0), be(b), k["set-placeholder-key"] && ve(b), Object.keys(m.counts).forEach(function(e) {
-      O(b, e.split(".")) || w(e, 0);
-    }), P && V.length && (b[y] = []), V.forEach(function(e) {
-      b[y].push(e);
+    me(b, !0), me(b, !1), we(b), fe(), ue(b, m.aliases, q, !0), be(b), k["set-placeholder-key"] && ve(b), Object.keys(m.counts).forEach(function(e) {
+      O(b, e.split(".")) || f(e, 0);
+    }), P && V.length && (b[M] = []), V.forEach(function(e) {
+      b[M].push(e);
     }), k["camel-case-expansion"] && k["strip-dashed"] && Object.keys(b).filter((e) => e !== "--" && e.includes("-")).forEach((e) => {
       delete b[e];
     }), k["strip-aliased"] && [].concat(...Object.keys(_).map((e) => _[e])).forEach((e) => {
@@ -240,18 +240,18 @@ class De {
     function j(e, a, c, n) {
       let t, l = g(a, m.nargs);
       if (l = typeof l != "number" || isNaN(l) ? 1 : l, l === 0)
-        return G(n) || (M = Error(L("Argument unexpected for: %s", a))), w(a, R(a)), e;
-      let p = G(n) ? 0 : 1;
+        return S(n) || (L = Error(I("Argument unexpected for: %s", a))), f(a, R(a)), e;
+      let p = S(n) ? 0 : 1;
       if (k["nargs-eats-options"])
-        c.length - (e + 1) + p < l && (M = Error(L("Not enough arguments following: %s", a))), p = l;
+        c.length - (e + 1) + p < l && (L = Error(I("Not enough arguments following: %s", a))), p = l;
       else {
-        for (t = e + 1; t < c.length && (!c[t].match(/^-[^0-9]/) || c[t].match(I) || $(c[t])); t++)
+        for (t = e + 1; t < c.length && (!c[t].match(/^-[^0-9]/) || c[t].match(y) || $(c[t])); t++)
           p++;
-        p < l && (M = Error(L("Not enough arguments following: %s", a)));
+        p < l && (L = Error(I("Not enough arguments following: %s", a)));
       }
       let d = Math.min(p, l);
-      for (!G(n) && d > 0 && (w(a, n), d--), t = e + 1; t < d + e + 1; t++)
-        w(a, c[t]);
+      for (!S(n) && d > 0 && (f(a, n), d--), t = e + 1; t < d + e + 1; t++)
+        f(a, c[t]);
       return e + d;
     }
     function K(e, a, c, n) {
@@ -259,26 +259,26 @@ class De {
       const p = g(a, m.nargs);
       if (g(a, m.bools) && !/^(true|false)$/.test(l))
         t.push(!0);
-      else if (G(l) || G(n) && /^-/.test(l) && !I.test(l) && !$(l)) {
+      else if (S(l) || S(n) && /^-/.test(l) && !y.test(l) && !$(l)) {
         if (q[a] !== void 0) {
           const d = q[a];
           t = Array.isArray(d) ? d : [d];
         }
       } else {
-        G(n) || t.push(J(a, n, !0));
-        for (let d = e + 1; d < c.length && !(!k["greedy-arrays"] && t.length > 0 || p && typeof p == "number" && t.length >= p || (l = c[d], /^-/.test(l) && !I.test(l) && !$(l))); d++)
-          e = d, t.push(J(a, l, h));
+        S(n) || t.push(Z(a, n, !0));
+        for (let d = e + 1; d < c.length && !(!k["greedy-arrays"] && t.length > 0 || p && typeof p == "number" && t.length >= p || (l = c[d], /^-/.test(l) && !y.test(l) && !$(l))); d++)
+          e = d, t.push(Z(a, l, h));
       }
-      return typeof p == "number" && (p && t.length < p || isNaN(p) && t.length === 0) && (M = Error(L("Not enough arguments following: %s", a))), w(a, t), e;
+      return typeof p == "number" && (p && t.length < p || isNaN(p) && t.length === 0) && (L = Error(I("Not enough arguments following: %s", a))), f(a, t), e;
     }
-    function w(e, a, c = h) {
+    function f(e, a, c = h) {
       if (/-/.test(e) && k["camel-case-expansion"]) {
         const l = e.split(".").map(function(p) {
           return W(p);
         }).join(".");
         re(e, l);
       }
-      const n = J(e, a, c), t = e.split(".");
+      const n = Z(e, a, c), t = e.split(".");
       E(b, t, n), m.aliases[e] && m.aliases[e].forEach(function(l) {
         const p = l.split(".");
         E(b, p, n);
@@ -301,17 +301,17 @@ class De {
     function re(e, a) {
       m.aliases[e] && m.aliases[e].length || (m.aliases[e] = [a], T[a] = !0), m.aliases[a] && m.aliases[a].length || re(a, e);
     }
-    function J(e, a, c) {
+    function Z(e, a, c) {
       c && (a = Ve(a)), (g(e, m.bools) || g(e, m.counts)) && typeof a == "string" && (a = a === "true");
       let n = Array.isArray(a) ? a.map(function(t) {
         return H(e, t);
       }) : H(e, a);
-      return g(e, m.counts) && (G(n) || typeof n == "boolean") && (n = X()), g(e, m.normalize) && g(e, m.arrays) && (Array.isArray(a) ? n = a.map((t) => C.normalize(t)) : n = C.normalize(a)), n;
+      return g(e, m.counts) && (S(n) || typeof n == "boolean") && (n = X()), g(e, m.normalize) && g(e, m.arrays) && (Array.isArray(a) ? n = a.map((t) => C.normalize(t)) : n = C.normalize(a)), n;
     }
     function H(e, a) {
-      return !k["parse-positional-numbers"] && e === "_" || !g(e, m.strings) && !g(e, m.bools) && !Array.isArray(a) && (Oe(a) && k["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${a}`))) || !G(a) && g(e, m.numbers)) && (a = Number(a)), a;
+      return !k["parse-positional-numbers"] && e === "_" || !g(e, m.strings) && !g(e, m.bools) && !Array.isArray(a) && (Oe(a) && k["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${a}`))) || !S(a) && g(e, m.numbers)) && (a = Number(a)), a;
     }
-    function fe(e) {
+    function we(e) {
       const a = /* @__PURE__ */ Object.create(null);
       ue(a, m.aliases, q), Object.keys(m.configs).forEach(function(c) {
         const n = e[c] || a[c];
@@ -326,26 +326,26 @@ class De {
                 t = d;
               }
               if (t instanceof Error) {
-                M = t;
+                L = t;
                 return;
               }
             } else
               t = C.require(l);
-            Z(t);
+            J(t);
           } catch (t) {
-            t.name === "PermissionDenied" ? M = t : e[c] && (M = Error(L("Invalid JSON config file: %s", n)));
+            t.name === "PermissionDenied" ? L = t : e[c] && (L = Error(I("Invalid JSON config file: %s", n)));
           }
       });
     }
-    function Z(e, a) {
+    function J(e, a) {
       Object.keys(e).forEach(function(c) {
         const n = e[c], t = a ? a + "." + c : c;
-        typeof n == "object" && n !== null && !Array.isArray(n) && k["dot-notation"] ? Z(n, t) : (!O(b, t.split(".")) || g(t, m.arrays) && k["combine-arrays"]) && w(t, n);
+        typeof n == "object" && n !== null && !Array.isArray(n) && k["dot-notation"] ? J(n, t) : (!O(b, t.split(".")) || g(t, m.arrays) && k["combine-arrays"]) && f(t, n);
       });
     }
-    function we() {
-      typeof S < "u" && S.forEach(function(e) {
-        Z(e);
+    function fe() {
+      typeof G < "u" && G.forEach(function(e) {
+        J(e);
       });
     }
     function me(e, a) {
@@ -357,7 +357,7 @@ class De {
           const l = t.split("__").map(function(p, d) {
             return d === 0 && (p = p.substring(c.length)), W(p);
           });
-          (a && m.configs[l.join(".")] || !a) && !O(e, l) && w(l.join("."), n[t]);
+          (a && m.configs[l.join(".")] || !a) && !O(e, l) && f(l.join("."), n[t]);
         }
       });
     }
@@ -372,7 +372,7 @@ class De {
               c.add(l), e[l] = t;
             });
           } catch (t) {
-            M = t;
+            L = t;
           }
       });
     }
@@ -403,7 +403,7 @@ class De {
       });
       const t = pe(a[a.length - 1]), l = g(a.join("."), m.arrays), p = Array.isArray(c);
       let d = k["duplicate-arguments-array"];
-      !d && g(t, m.nargs) && (d = !0, (!G(n[t]) && m.nargs[t] === 1 || Array.isArray(n[t]) && n[t].length === m.nargs[t]) && (n[t] = void 0)), c === X() ? n[t] = X(n[t]) : Array.isArray(n[t]) ? d && l && p ? n[t] = k["flatten-duplicate-arrays"] ? n[t].concat(c) : (Array.isArray(n[t][0]) ? n[t] : [n[t]]).concat([c]) : !d && !!l == !!p ? n[t] = c : n[t] = n[t].concat([c]) : n[t] === void 0 && l ? n[t] = p ? c : [c] : d && !(n[t] === void 0 || g(t, m.counts) || g(t, m.bools)) ? n[t] = [n[t], c] : n[t] = c;
+      !d && g(t, m.nargs) && (d = !0, (!S(n[t]) && m.nargs[t] === 1 || Array.isArray(n[t]) && n[t].length === m.nargs[t]) && (n[t] = void 0)), c === X() ? n[t] = X(n[t]) : Array.isArray(n[t]) ? d && l && p ? n[t] = k["flatten-duplicate-arrays"] ? n[t].concat(c) : (Array.isArray(n[t][0]) ? n[t] : [n[t]]).concat([c]) : !d && !!l == !!p ? n[t] = c : n[t] = n[t].concat([c]) : n[t] === void 0 && l ? n[t] = p ? c : [c] : d && !(n[t] === void 0 || g(t, m.counts) || g(t, m.bools)) ? n[t] = [n[t], c] : n[t] = c;
     }
     function xe(...e) {
       e.forEach(function(a) {
@@ -442,8 +442,8 @@ class De {
         return t && ce(t[1]);
       });
     }
-    function ye(e) {
-      if (e.match(I) || !e.match(/^-[^-]+/))
+    function Me(e) {
+      if (e.match(y) || !e.match(/^-[^-]+/))
         return !1;
       let a = !0, c;
       const n = e.slice(1).split("");
@@ -458,15 +458,15 @@ class De {
       return a;
     }
     function $(e) {
-      return k["unknown-options-as-args"] && Ie(e);
+      return k["unknown-options-as-args"] && ye(e);
     }
-    function Ie(e) {
-      return e = e.replace(/^-{3,}/, "--"), e.match(I) || ye(e) ? !1 : !Be(e, /^-+([^=]+?)=[\s\S]*$/, U, /^-+([^=]+?)$/, /^-+([^=]+?)-$/, /^-+([^=]+?\d+)$/, /^-+([^=]+?)\W+.*$/);
+    function ye(e) {
+      return e = e.replace(/^-{3,}/, "--"), e.match(y) || Me(e) ? !1 : !Be(e, /^-+([^=]+?)=[\s\S]*$/, U, /^-+([^=]+?)$/, /^-+([^=]+?)-$/, /^-+([^=]+?\d+)$/, /^-+([^=]+?)\W+.*$/);
     }
     function R(e) {
-      return !g(e, m.bools) && !g(e, m.counts) && `${e}` in q ? q[e] : Le(Me(e));
+      return !g(e, m.bools) && !g(e, m.counts) && `${e}` in q ? q[e] : Ie(Le(e));
     }
-    function Le(e) {
+    function Ie(e) {
       return {
         [Q.BOOLEAN]: !0,
         [Q.STRING]: "",
@@ -474,22 +474,22 @@ class De {
         [Q.ARRAY]: []
       }[e];
     }
-    function Me(e) {
+    function Le(e) {
       let a = Q.BOOLEAN;
       return g(e, m.strings) ? a = Q.STRING : g(e, m.numbers) ? a = Q.NUMBER : g(e, m.bools) ? a = Q.BOOLEAN : g(e, m.arrays) && (a = Q.ARRAY), a;
     }
-    function G(e) {
+    function S(e) {
       return e === void 0;
     }
     function Ae() {
-      Object.keys(m.counts).find((e) => g(e, m.arrays) ? (M = Error(L("Invalid configuration: %s, opts.count excludes opts.array.", e)), !0) : g(e, m.nargs) ? (M = Error(L("Invalid configuration: %s, opts.count excludes opts.narg.", e)), !0) : !1);
+      Object.keys(m.counts).find((e) => g(e, m.arrays) ? (L = Error(I("Invalid configuration: %s, opts.count excludes opts.array.", e)), !0) : g(e, m.nargs) ? (L = Error(I("Invalid configuration: %s, opts.count excludes opts.narg.", e)), !0) : !1);
     }
     return {
       aliases: Object.assign({}, m.aliases),
       argv: Object.assign(se, b),
       configuration: k,
       defaulted: Object.assign({}, N),
-      error: M,
+      error: L,
       newAliases: Object.assign({}, T)
     };
   }
@@ -565,7 +565,7 @@ const Ke = {
   resolve: oe,
   exists: (i) => {
     try {
-      return Se(i).isFile();
+      return Ge(i).isFile();
     } catch {
       return !1;
     }
@@ -894,6 +894,22 @@ const ne = [
           output_mtok: 15
         }
       },
+      {
+        id: "claude-fable-5",
+        name: "Claude Fable 5",
+        description: "Anthropic's most capable widely released model for demanding reasoning and long-horizon agentic work",
+        match: {
+          starts_with: "claude-fable-5"
+        },
+        context_window: 1e6,
+        price_comments: "Flat pricing across full 1M context window (no tiered pricing). Ref: https://platform.claude.com/docs/en/about-claude/pricing#long-context-pricing",
+        prices: {
+          input_mtok: 10,
+          cache_write_mtok: 12.5,
+          cache_read_mtok: 1,
+          output_mtok: 50
+        }
+      },
       {
         id: "claude-haiku-4-5",
         name: "Claude Haiku 4.5",
@@ -1529,6 +1545,18 @@ const ne = [
           output_mtok: 5.4
         }
       },
+      {
+        id: "global.anthropic.claude-fable-5-v1:0",
+        match: {
+          contains: "global.anthropic.claude-fable-5"
+        },
+        prices: {
+          input_mtok: 10,
+          cache_write_mtok: 12.5,
+          cache_read_mtok: 1,
+          output_mtok: 50
+        }
+      },
       {
         id: "global.anthropic.claude-haiku-4-5-20251001-v1:0",
         match: {
@@ -2165,6 +2193,37 @@ const ne = [
           output_mtok: 15
         }
       },
+      {
+        id: "regional.anthropic.claude-fable-5-v1:0",
+        match: {
+          or: [
+            {
+              starts_with: "anthropic.claude-fable-5"
+            },
+            {
+              starts_with: "claude-fable-5"
+            },
+            {
+              contains: "us.anthropic.claude-fable-5"
+            },
+            {
+              contains: "au.anthropic.claude-fable-5"
+            },
+            {
+              contains: "eu.anthropic.claude-fable-5"
+            },
+            {
+              contains: "jp.anthropic.claude-fable-5"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 11,
+          cache_write_mtok: 13.75,
+          cache_read_mtok: 1.1,
+          output_mtok: 55
+        }
+      },
       {
         id: "regional.anthropic.claude-haiku-4-5-20251001-v1:0",
         match: {
@@ -4192,6 +4251,20 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 15
         }
       },
+      {
+        id: "claude-fable-5",
+        match: {
+          contains: "claude-fable-5"
+        },
+        context_window: 1e6,
+        price_comments: "Flat pricing across full 1M context window. Ref: https://cloud.google.com/vertex-ai/generative-ai/pricing#claude-models",
+        prices: {
+          input_mtok: 10,
+          cache_write_mtok: 12.5,
+          cache_read_mtok: 1,
+          output_mtok: 50
+        }
+      },
       {
         id: "claude-opus-4-6",
         match: {
@@ -9236,6 +9309,197 @@ Compared to other leading proprietary and open-weights models Command A delivers
       }
     ]
   },
+  {
+    id: "minimax",
+    name: "MiniMax",
+    pricing_urls: ["https://platform.minimax.io/docs/guides/pricing-paygo"],
+    api_pattern: "https://api\\.minimax(i)?\\.(?:com|io)",
+    price_comments: "Prices sourced from MiniMax international platform USD pricing (platform.minimax.io, May 2026). M2.1, M2.1-highspeed, and M2 are legacy models; prices inferred from CNY pricing at the equivalent 7.00 CNY/USD rate used by the international platform for current models.",
+    model_match: {
+      or: [
+        {
+          starts_with: "MiniMax-M"
+        },
+        {
+          starts_with: "minimax-m"
+        },
+        {
+          equals: "M2-her"
+        },
+        {
+          equals: "m2-her"
+        }
+      ]
+    },
+    extractors: [
+      {
+        api_flavor: "chat",
+        root: "usage",
+        model_path: "model",
+        mappings: [
+          {
+            path: "prompt_tokens",
+            dest: "input_tokens",
+            required: !0
+          },
+          {
+            path: ["prompt_tokens_details", "cached_tokens"],
+            dest: "cache_read_tokens",
+            required: !1
+          },
+          {
+            path: "completion_tokens",
+            dest: "output_tokens",
+            required: !0
+          }
+        ]
+      }
+    ],
+    models: [
+      {
+        id: "M2-her",
+        name: "MiniMax M2-her",
+        description: "MiniMax M2-her, a text dialogue model optimized for role-playing and multi-turn conversations. 64,000 token context window. No cache support.",
+        match: {
+          or: [
+            {
+              equals: "M2-her"
+            },
+            {
+              equals: "m2-her"
+            }
+          ]
+        },
+        context_window: 64e3,
+        prices: {
+          input_mtok: 0.3,
+          output_mtok: 1.2
+        }
+      },
+      {
+        id: "MiniMax-M2",
+        name: "MiniMax M2",
+        description: "MiniMax M2 (legacy), a multimodal language model with 204,800 token context window. Supports agentic capabilities and advanced reasoning.",
+        match: {
+          or: [
+            {
+              equals: "MiniMax-M2"
+            },
+            {
+              equals: "minimax-m2"
+            },
+            {
+              equals: "MiniMax-M2.1"
+            },
+            {
+              equals: "minimax-m2.1"
+            },
+            {
+              equals: "MiniMax-M2.5"
+            },
+            {
+              equals: "minimax-m2.5"
+            }
+          ]
+        },
+        context_window: 204800,
+        prices: {
+          input_mtok: 0.3,
+          cache_write_mtok: 0.375,
+          cache_read_mtok: 0.03,
+          output_mtok: 1.2
+        }
+      },
+      {
+        id: "MiniMax-M2.1-highspeed",
+        name: "MiniMax M2.1 Highspeed",
+        description: "MiniMax M2.1 highspeed variant (legacy) with higher throughput.",
+        match: {
+          or: [
+            {
+              contains: "M2.1-highspeed"
+            },
+            {
+              contains: "m2.1-highspeed"
+            }
+          ]
+        },
+        context_window: 204800,
+        prices: {
+          input_mtok: 0.6,
+          cache_write_mtok: 0.375,
+          cache_read_mtok: 0.03,
+          output_mtok: 2.4
+        }
+      },
+      {
+        id: "MiniMax-M2.5-highspeed",
+        name: "MiniMax M2.5 Highspeed",
+        description: "MiniMax M2.5 highspeed variant with higher throughput.",
+        match: {
+          or: [
+            {
+              contains: "M2.5-highspeed"
+            },
+            {
+              contains: "m2.5-highspeed"
+            }
+          ]
+        },
+        context_window: 204800,
+        prices: {
+          input_mtok: 0.6,
+          cache_write_mtok: 0.375,
+          cache_read_mtok: 0.03,
+          output_mtok: 2.4
+        }
+      },
+      {
+        id: "MiniMax-M2.7",
+        name: "MiniMax M2.7",
+        description: "MiniMax M2.7, a multimodal language model with 204,800 token context window. Achieves top performance in real-world engineering, office productivity, and character-rich interaction.",
+        match: {
+          or: [
+            {
+              equals: "MiniMax-M2.7"
+            },
+            {
+              equals: "minimax-m2.7"
+            }
+          ]
+        },
+        context_window: 204800,
+        prices: {
+          input_mtok: 0.3,
+          cache_write_mtok: 0.375,
+          cache_read_mtok: 0.06,
+          output_mtok: 1.2
+        }
+      },
+      {
+        id: "MiniMax-M2.7-highspeed",
+        name: "MiniMax M2.7 Highspeed",
+        description: "MiniMax M2.7 highspeed variant with higher throughput.",
+        match: {
+          or: [
+            {
+              contains: "M2.7-highspeed"
+            },
+            {
+              contains: "m2.7-highspeed"
+            }
+          ]
+        },
+        context_window: 204800,
+        prices: {
+          input_mtok: 0.6,
+          cache_write_mtok: 0.375,
+          cache_read_mtok: 0.06,
+          output_mtok: 2.4
+        }
+      }
+    ]
+  },
   {
     id: "mistral",
     name: "Mistral",
@@ -9718,6 +9982,20 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 3
         }
       },
+      {
+        id: "kimi-k2.6",
+        name: "Kimi K2.6",
+        description: "Kimi's most capable model with enhanced long-context coding stability, improved instruction compliance and self-correction capabilities. Native multimodal architecture supporting text, image, and video input, thinking and non-thinking modes, and agent tasks. Supports automatic context caching, ToolCalls, JSON Mode, Partial Mode, and internet search.",
+        match: {
+          starts_with: "kimi-k2.6"
+        },
+        context_window: 262144,
+        prices: {
+          input_mtok: 0.95,
+          cache_read_mtok: 0.16,
+          output_mtok: 4
+        }
+      },
       {
         id: "moonshot-v1-128k",
         name: "Moonshot V1 128K",
@@ -12118,6 +12396,27 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 15
         }
       },
+      {
+        id: "anthropic/claude-fable-5",
+        match: {
+          or: [
+            {
+              equals: "anthropic/claude-fable-5"
+            },
+            {
+              equals: "anthropic/claude-fable-5:beta"
+            }
+          ]
+        },
+        context_window: 1e6,
+        price_comments: "Flat pricing across full 1M context window (no tiered pricing). Ref: https://platform.claude.com/docs/en/about-claude/pricing#long-context-pricing",
+        prices: {
+          input_mtok: 10,
+          cache_write_mtok: 12.5,
+          cache_read_mtok: 1,
+          output_mtok: 50
+        }
+      },
       {
         id: "anthropic/claude-haiku-4.5",
         match: {
@@ -19830,6 +20129,299 @@ Compared to other leading proprietary and open-weights models Command A delivers
         }
       }
     ]
+  },
+  {
+    id: "zhipuai",
+    name: "Zhipu AI",
+    pricing_urls: ["https://open.bigmodel.cn/pricing", "https://docs.bigmodel.cn/cn/guide/start/model-overview"],
+    api_pattern: "https://open\\.bigmodel\\.cn",
+    price_comments: "Prices sourced from Zhipu AI open platform pricing (CNY, open.bigmodel.cn/pricing), converted to USD at 1 USD = 7.25 CNY (May 2026). Zhipu AI does not publish USD prices; CNY is the only billing currency. Flagship models (GLM-4.5-Air, GLM-4.7, GLM-5 series) have tiered pricing by input/output length; prices shown are for the cheapest tier ([0, 32k) input / [0, 0.2k) output where applicable). GLM-4 standard inference models (GLM-4-Air, GLM-4-Plus, etc.) bill input and output tokens at the same per-token rate per their pricing page. Cache write is temporarily free for flagship models (limited-time promotion, not included).",
+    model_match: {
+      or: [
+        {
+          starts_with: "GLM-"
+        },
+        {
+          starts_with: "glm-"
+        }
+      ]
+    },
+    extractors: [
+      {
+        api_flavor: "chat",
+        root: "usage",
+        model_path: "model",
+        mappings: [
+          {
+            path: "prompt_tokens",
+            dest: "input_tokens",
+            required: !0
+          },
+          {
+            path: ["prompt_tokens_details", "cached_tokens"],
+            dest: "cache_read_tokens",
+            required: !1
+          },
+          {
+            path: "completion_tokens",
+            dest: "output_tokens",
+            required: !0
+          }
+        ]
+      }
+    ],
+    models: [
+      {
+        id: "GLM-4-Air",
+        name: "GLM-4-Air",
+        description: "High-performance GLM-4 model with context caching. 128,000 token context window. Input and output billed at the same per-token rate.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4-Air"
+            },
+            {
+              equals: "glm-4-air"
+            }
+          ]
+        },
+        context_window: 128e3,
+        prices: {
+          input_mtok: 0.069,
+          cache_read_mtok: 0.034,
+          output_mtok: 0.069
+        }
+      },
+      {
+        id: "GLM-4-AirX",
+        name: "GLM-4-AirX",
+        description: "Fastest GLM-4 model. 8,000 token context window. Does not support context caching. Input and output billed at the same per-token rate.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4-AirX"
+            },
+            {
+              equals: "glm-4-airx"
+            }
+          ]
+        },
+        context_window: 8e3,
+        prices: {
+          input_mtok: 1.379,
+          output_mtok: 1.379
+        }
+      },
+      {
+        id: "GLM-4-Assistant",
+        name: "GLM-4-Assistant",
+        description: "GLM-4 agent/assistant model. 128,000 token context window. Does not support context caching. Input and output billed at the same per-token rate.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4-Assistant"
+            },
+            {
+              equals: "glm-4-assistant"
+            }
+          ]
+        },
+        context_window: 128e3,
+        prices: {
+          input_mtok: 0.69,
+          output_mtok: 0.69
+        }
+      },
+      {
+        id: "GLM-4-FlashX-250414",
+        name: "GLM-4-FlashX-250414",
+        description: "Fast and cheap GLM-4 model with context caching. 128,000 token context window. Input and output billed at the same per-token rate.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4-FlashX-250414"
+            },
+            {
+              equals: "glm-4-flashx-250414"
+            }
+          ]
+        },
+        context_window: 128e3,
+        prices: {
+          input_mtok: 0.014,
+          cache_read_mtok: 7e-3,
+          output_mtok: 0.014
+        }
+      },
+      {
+        id: "GLM-4-Long",
+        name: "GLM-4-Long",
+        description: "GLM-4 model optimized for long inputs with context caching. 1,000,000 token context window. Input and output billed at the same per-token rate.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4-Long"
+            },
+            {
+              equals: "glm-4-long"
+            }
+          ]
+        },
+        context_window: 1e6,
+        prices: {
+          input_mtok: 0.138,
+          cache_read_mtok: 0.069,
+          output_mtok: 0.138
+        }
+      },
+      {
+        id: "GLM-4-Plus",
+        name: "GLM-4-Plus",
+        description: "Flagship GLM-4 model with context caching. 128,000 token context window. Input and output billed at the same per-token rate.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4-Plus"
+            },
+            {
+              equals: "glm-4-plus"
+            }
+          ]
+        },
+        context_window: 128e3,
+        prices: {
+          input_mtok: 0.69,
+          cache_read_mtok: 0.345,
+          output_mtok: 0.69
+        }
+      },
+      {
+        id: "GLM-4.5-Air",
+        name: "GLM-4.5-Air",
+        description: "Zhipu AI's GLM-4.5-Air flagship model with context caching. 128,000 token context window. Tiered pricing; prices shown for [0, 32k) input / [0, 0.2k) output tier.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4.5-Air"
+            },
+            {
+              equals: "glm-4.5-air"
+            }
+          ]
+        },
+        context_window: 128e3,
+        prices: {
+          input_mtok: 0.11,
+          cache_read_mtok: 0.022,
+          output_mtok: 0.276
+        }
+      },
+      {
+        id: "GLM-4.7",
+        name: "GLM-4.7",
+        description: "Zhipu AI's GLM-4.7 flagship model with context caching. 200,000 token context window. Tiered pricing; prices shown for [0, 32k) input / [0, 0.2k) output tier.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4.7"
+            },
+            {
+              equals: "glm-4.7"
+            }
+          ]
+        },
+        context_window: 2e5,
+        prices: {
+          input_mtok: 0.276,
+          cache_read_mtok: 0.055,
+          output_mtok: 1.103
+        }
+      },
+      {
+        id: "GLM-4.7-FlashX",
+        name: "GLM-4.7-FlashX",
+        description: "Fast and affordable GLM-4.7 model with context caching. 200,000 token context window.",
+        match: {
+          or: [
+            {
+              equals: "GLM-4.7-FlashX"
+            },
+            {
+              equals: "glm-4.7-flashx"
+            }
+          ]
+        },
+        context_window: 2e5,
+        prices: {
+          input_mtok: 0.069,
+          cache_read_mtok: 0.014,
+          output_mtok: 0.414
+        }
+      },
+      {
+        id: "GLM-5",
+        name: "GLM-5",
+        description: "Zhipu AI GLM-5 model with context caching. 200,000 token context window. Tiered pricing; prices shown for [0, 32k) input tier.",
+        match: {
+          or: [
+            {
+              equals: "GLM-5"
+            },
+            {
+              equals: "glm-5"
+            }
+          ]
+        },
+        context_window: 2e5,
+        prices: {
+          input_mtok: 0.552,
+          cache_read_mtok: 0.138,
+          output_mtok: 2.483
+        }
+      },
+      {
+        id: "GLM-5-Turbo",
+        name: "GLM-5-Turbo",
+        description: "Zhipu AI GLM-5 Turbo model with context caching. 200,000 token context window. Tiered pricing; prices shown for [0, 32k) input tier.",
+        match: {
+          or: [
+            {
+              equals: "GLM-5-Turbo"
+            },
+            {
+              equals: "glm-5-turbo"
+            }
+          ]
+        },
+        context_window: 2e5,
+        prices: {
+          input_mtok: 0.69,
+          cache_read_mtok: 0.166,
+          output_mtok: 3.034
+        }
+      },
+      {
+        id: "GLM-5.1",
+        name: "GLM-5.1",
+        description: "Zhipu AI's latest flagship model supporting long-horizon tasks, structured output, function calling, and context caching. 200,000 token context window. Tiered pricing; prices shown for [0, 32k) input tier.",
+        match: {
+          or: [
+            {
+              equals: "GLM-5.1"
+            },
+            {
+              equals: "glm-5.1"
+            }
+          ]
+        },
+        context_window: 2e5,
+        prices: {
+          input_mtok: 0.828,
+          cache_read_mtok: 0.179,
+          output_mtok: 3.31
+        }
+      }
+    ]
   }
 ];
 function Ye(i, o, u) {
@@ -19842,32 +20434,32 @@ function Ye(i, o, u) {
 function z(i, o, u, s) {
   return i === void 0 || o === void 0 ? 0 : typeof i == "number" ? i * o / 1e6 : Ye(i, o, s);
 }
-function Je(i, o) {
+function Ze(i, o) {
   let u = 0, s = 0;
-  const r = i.input_tokens ?? 0, h = i.cache_read_tokens ?? 0, _ = i.cache_write_tokens ?? 0, k = i.cache_audio_read_tokens ?? 0, q = i.input_audio_tokens ?? 0, S = i.output_audio_tokens ?? 0, B = o.cache_audio_read_mtok === void 0 ? 0 : k, P = o.cache_audio_read_mtok === void 0 && o.cache_read_mtok !== void 0 ? k : 0;
-  let y = 0;
-  if (o.input_audio_mtok !== void 0 && (y = q - B - P), y < 0)
+  const r = i.input_tokens ?? 0, h = i.cache_read_tokens ?? 0, _ = i.cache_write_tokens ?? 0, k = i.cache_audio_read_tokens ?? 0, q = i.input_audio_tokens ?? 0, G = i.output_audio_tokens ?? 0, B = o.cache_audio_read_mtok === void 0 ? 0 : k, P = o.cache_audio_read_mtok === void 0 && o.cache_read_mtok !== void 0 ? k : 0;
+  let M = 0;
+  if (o.input_audio_mtok !== void 0 && (M = q - B - P), M < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than input_audio_tokens");
   let T = 0;
   if (o.cache_read_mtok !== void 0 && (T = h - B), T < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than cache_read_tokens");
   const N = o.cache_write_mtok === void 0 ? 0 : _;
-  let L = 0;
-  if (o.input_mtok !== void 0 && (L = r - T - N - y - B), L < 0)
+  let I = 0;
+  if (o.input_mtok !== void 0 && (I = r - T - N - M - B), I < 0)
     throw new Error("Uncached text input tokens cannot be negative");
-  u += z(o.input_mtok, L, "input_mtok", r), u += z(o.cache_read_mtok, T, "cache_read_mtok", r), u += z(o.cache_write_mtok, N, "cache_write_mtok", r), u += z(o.input_audio_mtok, y, "input_audio_mtok", r), u += z(o.cache_audio_read_mtok, B, "cache_audio_read_mtok", r);
+  u += z(o.input_mtok, I, "input_mtok", r), u += z(o.cache_read_mtok, T, "cache_read_mtok", r), u += z(o.cache_write_mtok, N, "cache_write_mtok", r), u += z(o.input_audio_mtok, M, "input_audio_mtok", r), u += z(o.cache_audio_read_mtok, B, "cache_audio_read_mtok", r);
   let m = 0;
-  if (o.output_mtok !== void 0 && (m = (i.output_tokens ?? 0) - (o.output_audio_mtok === void 0 ? 0 : S)), m < 0)
+  if (o.output_mtok !== void 0 && (m = (i.output_tokens ?? 0) - (o.output_audio_mtok === void 0 ? 0 : G)), m < 0)
     throw new Error("output_audio_tokens cannot be greater than output_tokens");
   s += z(o.output_mtok, m, "output_mtok", r), s += z(o.output_audio_mtok, i.output_audio_tokens, "output_audio_mtok", r);
-  let I = u + s;
-  return o.requests_kcount !== void 0 && (I += o.requests_kcount / 1e3), {
+  let y = u + s;
+  return o.requests_kcount !== void 0 && (y += o.requests_kcount / 1e3), {
     input_price: u,
     output_price: s,
-    total_price: I
+    total_price: y
   };
 }
-function Ze(i, o) {
+function Je(i, o) {
   if (!Array.isArray(i.prices))
     return i.prices;
   for (let u = i.prices.length - 1; u >= 0; u--) {
@@ -19926,23 +20518,23 @@ Promise.resolve(ne);
 function tt(i, o, u) {
   let s = o.toLowerCase().trim(), r = u?.providerId;
   if (r && r.toLowerCase() === "litellm" && s.includes("/")) {
-    const B = s.indexOf("/"), P = s.slice(0, B), y = s.slice(B + 1);
-    P && y && _e(ie, { providerId: P }) && (r = P, s = y);
+    const B = s.indexOf("/"), P = s.slice(0, B), M = s.slice(B + 1);
+    P && M && _e(ie, { providerId: P }) && (r = P, s = M);
   }
   const h = u?.provider ?? _e(ie, { modelId: s, providerApiUrl: u?.providerApiUrl, providerId: r });
   if (!h) return null;
   const _ = qe(h, s, ie);
   if (!_) return null;
-  const k = u?.timestamp ?? /* @__PURE__ */ new Date(), q = Ze(_, k), S = Je(i, q);
+  const k = u?.timestamp ?? /* @__PURE__ */ new Date(), q = Je(_, k), G = Ze(i, q);
   return {
     auto_update_timestamp: void 0,
     model: _,
     model_price: q,
     provider: h,
-    ...S
+    ...G
   };
 }
-const f = he(Re(process.argv)).scriptName("genai-prices").command(
+const w = he(Re(process.argv)).scriptName("genai-prices").command(
   "list [provider]",
   "List providers and models",
   (i) => i.positional("provider", { describe: "Provider ID to filter", type: "string" })
@@ -19952,11 +20544,11 @@ const f = he(Re(process.argv)).scriptName("genai-prices").command(
   (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 at() {
-  if (f._[0] === "list") {
+  if (w._[0] === "list") {
     const u = ne;
-    if (f.provider) {
-      const s = u.find((r) => r.id === f.provider);
-      s || (console.error(`Provider ${f.provider} not found.`), process.exit(1)), console.log(`${s.name}: (${s.models.length} models)`);
+    if (w.provider) {
+      const s = u.find((r) => r.id === w.provider);
+      s || (console.error(`Provider ${w.provider} not found.`), process.exit(1)), console.log(`${s.name}: (${s.models.length} models)`);
       for (const r of s.models)
         console.log(`  ${s.id}:${r.id}${r.name ? ": " + r.name : ""}`);
     } else
@@ -19967,18 +20559,18 @@ function at() {
       }
     process.exit(0);
   }
-  const o = f._[0] === "calc" ? Array.isArray(f.model) ? f.model : [f.model] : f._.filter((u) => typeof u == "string");
+  const o = w._[0] === "calc" ? Array.isArray(w.model) ? w.model : [w.model] : w._.filter((u) => typeof u == "string");
   if (o.length > 0) {
     const u = {
-      cache_audio_read_tokens: f["cache-audio-read-tokens"] !== void 0 ? Number(f["cache-audio-read-tokens"]) : void 0,
-      cache_read_tokens: f["cache-read-tokens"] !== void 0 ? Number(f["cache-read-tokens"]) : void 0,
-      cache_write_tokens: f["cache-write-tokens"] !== void 0 ? Number(f["cache-write-tokens"]) : void 0,
-      input_audio_tokens: f["input-audio-tokens"] !== void 0 ? Number(f["input-audio-tokens"]) : void 0,
-      input_tokens: f["input-tokens"] !== void 0 ? Number(f["input-tokens"]) : void 0,
-      output_audio_tokens: f["output-audio-tokens"] !== void 0 ? Number(f["output-audio-tokens"]) : void 0,
-      output_tokens: f["output-tokens"] !== void 0 ? Number(f["output-tokens"]) : void 0,
-      requests: f.requests !== void 0 ? Number(f.requests) : void 0
-    }, s = f.timestamp ? new Date(String(f.timestamp)) : void 0;
+      cache_audio_read_tokens: w["cache-audio-read-tokens"] !== void 0 ? Number(w["cache-audio-read-tokens"]) : void 0,
+      cache_read_tokens: w["cache-read-tokens"] !== void 0 ? Number(w["cache-read-tokens"]) : void 0,
+      cache_write_tokens: w["cache-write-tokens"] !== void 0 ? Number(w["cache-write-tokens"]) : void 0,
+      input_audio_tokens: w["input-audio-tokens"] !== void 0 ? Number(w["input-audio-tokens"]) : void 0,
+      input_tokens: w["input-tokens"] !== void 0 ? Number(w["input-tokens"]) : void 0,
+      output_audio_tokens: w["output-audio-tokens"] !== void 0 ? Number(w["output-audio-tokens"]) : void 0,
+      output_tokens: w["output-tokens"] !== void 0 ? Number(w["output-tokens"]) : void 0,
+      requests: w.requests !== void 0 ? Number(w.requests) : void 0
+    }, s = w.timestamp ? new Date(String(w.timestamp)) : void 0;
     let r = !1;
     for (const h of o) {
       let _, k = h;
@@ -19989,17 +20581,17 @@ function at() {
           r = !0, console.error(`No price found for model ${h}`);
           continue;
         }
-        const S = q.model.context_window, B = [
+        const G = q.model.context_window, B = [
           ["Provider", q.provider.name],
           ["Model", q.model.name ?? q.model.id],
           ["Model Prices", JSON.stringify(q.model_price)],
-          ["Context Window", S !== void 0 ? S.toLocaleString() : void 0],
+          ["Context Window", G !== void 0 ? G.toLocaleString() : void 0],
           ["Total Price", `$${q.total_price}`],
           ["Input Price", `$${q.input_price}`],
           ["Output Price", `$${q.output_price}`]
         ];
-        for (const [P, y] of B)
-          y !== void 0 && console.log(`${P.padStart(14)}: ${y}`);
+        for (const [P, M] of B)
+          M !== void 0 && console.log(`${P.padStart(14)}: ${M}`);
         console.log("");
       } catch (q) {
         r = !0, q instanceof Error && console.error(`Error for model ${h}:`, q.message);