@pydantic/genai-prices 0.0.56 → 0.0.61

package/dist/cli.js

@@ -1,7 +1,7 @@
 #!/usr/bin/env node
 import he from "yargs";
 import { format as ke } from "util";
-import { resolve as ie, normalize as Pe } from "path";
+import { resolve as oe, normalize as Pe } from "path";
 import { readFileSync as ge, writeFile as Qe, statSync as Te } from "fs";
 import "assert";
 import { fileURLToPath as Se } from "url";
@@ -22,7 +22,7 @@ function Re(i) {
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function $(i) {
+function W(i) {
   if (i !== i.toLowerCase() && i !== i.toUpperCase() || (i = i.toLowerCase()), i.indexOf("-") === -1 && i.indexOf("_") === -1)
     return i;
   {
@@ -35,7 +35,7 @@ function $(i) {
     return u;
   }
 }
-function Ee(i, o) {
+function Oe(i, o) {
   const u = i.toLowerCase();
   o = o || "-";
   let s = "";
@@ -45,7 +45,7 @@ function Ee(i, o) {
   }
   return s;
 }
-function Oe(i) {
+function Ne(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);
 }
 /**
@@ -53,7 +53,7 @@ function Oe(i) {
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function Ne(i) {
+function Ee(i) {
   if (Array.isArray(i))
     return i.map((_) => typeof _ != "string" ? _ + "" : _);
   i = i.trim();
@@ -82,10 +82,10 @@ var P;
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-let S;
+let C;
 class De {
   constructor(o) {
-    S = o;
+    C = o;
   }
   parse(o, u) {
     const s = Object.assign({
@@ -105,7 +105,7 @@ class De {
       number: void 0,
       __: void 0,
       key: void 0
-    }, u), r = Ne(o), h = typeof o == "string", _ = Fe(Object.assign(/* @__PURE__ */ Object.create(null), s.alias)), k = Object.assign({
+    }, u), r = Ee(o), h = typeof o == "string", _ = Fe(Object.assign(/* @__PURE__ */ Object.create(null), s.alias)), k = Object.assign({
       "boolean-negation": !0,
       "camel-case-expansion": !0,
       "combine-arrays": !1,
@@ -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), y = s.configObjects || [], B = s.envPrefix, I = k["populate--"], L = I ? "--" : "_", G = /* @__PURE__ */ Object.create(null), ne = /* @__PURE__ */ Object.create(null), C = s.__ || S.format, m = {
+    }, s.configuration), q = Object.assign(/* @__PURE__ */ Object.create(null), s.default), T = s.configObjects || [], B = s.envPrefix, Q = k["populate--"], y = Q ? "--" : "_", S = /* @__PURE__ */ Object.create(null), O = /* @__PURE__ */ Object.create(null), M = 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: []
-    }, Q = /^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/, W = new RegExp("^--" + k["negation-prefix"] + "(.+)");
+    }, I = /^-([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,33 +169,33 @@ class De {
         q[a] = q[e];
       });
     });
-    let M = null;
+    let L = null;
     Ae();
-    let F = [];
+    let V = [];
     const w = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), se = {};
     for (let e = 0; e < r.length; e++) {
       const a = r[e], c = a.replace(/^-{3,}/, "---");
       let n, t, l, p, d, v;
-      if (a !== "--" && /^-/.test(a) && H(a))
-        U(a);
+      if (a !== "--" && /^-/.test(a) && $(a))
+        Y(a);
       else if (c.match(/^---+(=|$)/)) {
-        U(a);
+        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 = V(e, p[1], r, p[2]) : g(p[1], m.nargs) !== !1 ? e = j(e, p[1], r, p[2]) : b(p[1], p[2], !0));
-      else if (a.match(W) && k["boolean-negation"])
-        p = a.match(W), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], b(t, g(t, m.arrays) ? [!1] : !1));
+        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]) : b(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], b(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 = V(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(Q)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (b(t, d), e++) : b(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(I)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (b(t, d), e++) : b(t, R(t))));
       else if (a.match(/^-.\..+=/))
         p = a.match(/^-([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && b(p[1], p[2]);
-      else if (a.match(/^-.\..+/) && !a.match(Q))
+      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) ? (b(t, d), e++) : b(t, R(t)));
-      else if (a.match(/^-[^-]+/) && !a.match(Q)) {
+      else if (a.match(/^-[^-]+/) && !a.match(I)) {
         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 = V(e, t, r, v) : g(t, m.nargs) !== !1 ? e = j(e, t, r, v) : b(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) : b(t, v), n = !0;
             break;
           }
           if (d === "-") {
@@ -212,80 +212,80 @@ class De {
           } else
             b(l[x], R(l[x]));
         }
-        t = a.slice(-1)[0], !n && t !== "-" && (g(t, m.arrays) ? e = V(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(Q)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (b(t, d), e++) : b(t, R(t))));
-      } else if (a.match(/^-[0-9]$/) && a.match(Q) && g(a.slice(1), m.bools))
+        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) ? (b(t, d), e++) : b(t, R(t))));
+      } else if (a.match(/^-[0-9]$/) && a.match(I) && g(a.slice(1), m.bools))
         t = a.slice(1), b(t, R(t));
       else if (a === "--") {
-        F = r.slice(e + 1);
+        V = r.slice(e + 1);
         break;
       } else if (k["halt-at-non-option"]) {
-        F = r.slice(e);
+        V = r.slice(e);
         break;
       } else
-        U(a);
+        Y(a);
     }
     me(w, !0), me(w, !1), fe(w), be(), ue(w, m.aliases, q, !0), we(w), k["set-placeholder-key"] && ve(w), Object.keys(m.counts).forEach(function(e) {
-      E(w, e.split(".")) || b(e, 0);
-    }), I && F.length && (w[L] = []), F.forEach(function(e) {
-      w[L].push(e);
+      N(w, e.split(".")) || b(e, 0);
+    }), Q && V.length && (w[y] = []), V.forEach(function(e) {
+      w[y].push(e);
     }), k["camel-case-expansion"] && k["strip-dashed"] && Object.keys(w).filter((e) => e !== "--" && e.includes("-")).forEach((e) => {
       delete w[e];
     }), k["strip-aliased"] && [].concat(...Object.keys(_).map((e) => _[e])).forEach((e) => {
-      k["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((a) => $(a)).join(".")], delete w[e];
+      k["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((a) => W(a)).join(".")], delete w[e];
     });
-    function U(e) {
-      const a = K("_", e);
+    function Y(e) {
+      const a = H("_", e);
       (typeof a == "string" || typeof a == "number") && w._.push(a);
     }
     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 T(n) || (M = Error(C("Argument unexpected for: %s", a))), b(a, R(a)), e;
-      let p = T(n) ? 0 : 1;
+        return G(n) || (L = Error(M("Argument unexpected for: %s", a))), b(a, R(a)), e;
+      let p = G(n) ? 0 : 1;
       if (k["nargs-eats-options"])
-        c.length - (e + 1) + p < l && (M = Error(C("Not enough arguments following: %s", a))), p = l;
+        c.length - (e + 1) + p < l && (L = Error(M("Not enough arguments following: %s", a))), p = l;
       else {
-        for (t = e + 1; t < c.length && (!c[t].match(/^-[^0-9]/) || c[t].match(Q) || H(c[t])); t++)
+        for (t = e + 1; t < c.length && (!c[t].match(/^-[^0-9]/) || c[t].match(I) || $(c[t])); t++)
           p++;
-        p < l && (M = Error(C("Not enough arguments following: %s", a)));
+        p < l && (L = Error(M("Not enough arguments following: %s", a)));
       }
       let d = Math.min(p, l);
-      for (!T(n) && d > 0 && (b(a, n), d--), t = e + 1; t < d + e + 1; t++)
+      for (!G(n) && d > 0 && (b(a, n), d--), t = e + 1; t < d + e + 1; t++)
         b(a, c[t]);
       return e + d;
     }
-    function V(e, a, c, n) {
+    function K(e, a, c, n) {
       let t = [], l = n || c[e + 1];
       const p = g(a, m.nargs);
       if (g(a, m.bools) && !/^(true|false)$/.test(l))
         t.push(!0);
-      else if (T(l) || T(n) && /^-/.test(l) && !Q.test(l) && !H(l)) {
+      else if (G(l) || G(n) && /^-/.test(l) && !I.test(l) && !$(l)) {
         if (q[a] !== void 0) {
           const d = q[a];
           t = Array.isArray(d) ? d : [d];
         }
       } else {
-        T(n) || t.push(Y(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) && !Q.test(l) && !H(l))); d++)
-          e = d, t.push(Y(a, l, h));
+        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));
       }
-      return typeof p == "number" && (p && t.length < p || isNaN(p) && t.length === 0) && (M = Error(C("Not enough arguments following: %s", a))), b(a, t), e;
+      return typeof p == "number" && (p && t.length < p || isNaN(p) && t.length === 0) && (L = Error(M("Not enough arguments following: %s", a))), b(a, t), e;
     }
     function b(e, a, c = h) {
       if (/-/.test(e) && k["camel-case-expansion"]) {
         const l = e.split(".").map(function(p) {
-          return $(p);
+          return W(p);
         }).join(".");
         re(e, l);
       }
-      const n = Y(e, a, c), t = e.split(".");
-      O(w, t, n), m.aliases[e] && m.aliases[e].forEach(function(l) {
+      const n = J(e, a, c), t = e.split(".");
+      E(w, t, n), m.aliases[e] && m.aliases[e].forEach(function(l) {
         const p = l.split(".");
-        O(w, p, n);
+        E(w, p, n);
       }), t.length > 1 && k["dot-notation"] && (m.aliases[t[0]] || []).forEach(function(l) {
         let p = l.split(".");
         const d = [].concat(t);
-        d.shift(), p = p.concat(d), (m.aliases[e] || []).includes(p.join(".")) || O(w, p, n);
+        d.shift(), p = p.concat(d), (m.aliases[e] || []).includes(p.join(".")) || E(w, p, n);
       }), g(e, m.normalize) && !g(e, m.arrays) && [e].concat(m.aliases[e] || []).forEach(function(p) {
         Object.defineProperty(se, p, {
           enumerable: !0,
@@ -293,23 +293,23 @@ class De {
             return a;
           },
           set(d) {
-            a = typeof d == "string" ? S.normalize(d) : d;
+            a = typeof d == "string" ? C.normalize(d) : d;
           }
         });
       });
     }
     function re(e, a) {
-      m.aliases[e] && m.aliases[e].length || (m.aliases[e] = [a], G[a] = !0), m.aliases[a] && m.aliases[a].length || re(a, e);
+      m.aliases[e] && m.aliases[e].length || (m.aliases[e] = [a], S[a] = !0), m.aliases[a] && m.aliases[a].length || re(a, e);
     }
-    function Y(e, a, c) {
-      c && (a = je(a)), (g(e, m.bools) || g(e, m.counts)) && typeof a == "string" && (a = a === "true");
+    function J(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 K(e, t);
-      }) : K(e, a);
-      return g(e, m.counts) && (T(n) || typeof n == "boolean") && (n = Z()), g(e, m.normalize) && g(e, m.arrays) && (Array.isArray(a) ? n = a.map((t) => S.normalize(t)) : n = S.normalize(a)), n;
+        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;
     }
-    function K(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}`))) || !T(a) && g(e, m.numbers)) && (a = Number(a)), a;
+    function H(e, a) {
+      return !k["parse-positional-numbers"] && e === "_" || !g(e, m.strings) && !g(e, m.bools) && !Array.isArray(a) && (Ne(a) && k["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${a}`))) || !G(a) && g(e, m.numbers)) && (a = Number(a)), a;
     }
     function fe(e) {
       const a = /* @__PURE__ */ Object.create(null);
@@ -318,7 +318,7 @@ class De {
         if (n)
           try {
             let t = null;
-            const l = S.resolve(S.cwd(), n), p = m.configs[c];
+            const l = C.resolve(C.cwd(), n), p = m.configs[c];
             if (typeof p == "function") {
               try {
                 t = p(l);
@@ -326,38 +326,38 @@ class De {
                 t = d;
               }
               if (t instanceof Error) {
-                M = t;
+                L = t;
                 return;
               }
             } else
-              t = S.require(l);
-            J(t);
+              t = C.require(l);
+            Z(t);
           } catch (t) {
-            t.name === "PermissionDenied" ? M = t : e[c] && (M = Error(C("Invalid JSON config file: %s", n)));
+            t.name === "PermissionDenied" ? L = t : e[c] && (L = Error(M("Invalid JSON config file: %s", n)));
           }
       });
     }
-    function J(e, a) {
+    function Z(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"] ? J(n, t) : (!E(w, t.split(".")) || g(t, m.arrays) && k["combine-arrays"]) && b(t, n);
+        typeof n == "object" && n !== null && !Array.isArray(n) && k["dot-notation"] ? Z(n, t) : (!N(w, t.split(".")) || g(t, m.arrays) && k["combine-arrays"]) && b(t, n);
       });
     }
     function be() {
-      typeof y < "u" && y.forEach(function(e) {
-        J(e);
+      typeof T < "u" && T.forEach(function(e) {
+        Z(e);
       });
     }
     function me(e, a) {
       if (typeof B > "u")
         return;
-      const c = typeof B == "string" ? B : "", n = S.env();
+      const c = typeof B == "string" ? B : "", n = C.env();
       Object.keys(n).forEach(function(t) {
         if (c === "" || t.lastIndexOf(c, 0) === 0) {
           const l = t.split("__").map(function(p, d) {
-            return d === 0 && (p = p.substring(c.length)), $(p);
+            return d === 0 && (p = p.substring(c.length)), W(p);
           });
-          (a && m.configs[l.join(".")] || !a) && !E(e, l) && b(l.join("."), n[t]);
+          (a && m.configs[l.join(".")] || !a) && !N(e, l) && b(l.join("."), n[t]);
         }
       });
     }
@@ -367,12 +367,12 @@ class De {
       Object.keys(e).forEach(function(n) {
         if (!c.has(n) && (a = g(n, m.coercions), typeof a == "function"))
           try {
-            const t = K(n, a(e[n]));
+            const t = H(n, a(e[n]));
             [].concat(m.aliases[n] || [], n).forEach((l) => {
               c.add(l), e[l] = t;
             });
           } catch (t) {
-            M = t;
+            L = t;
           }
       });
     }
@@ -383,12 +383,12 @@ class De {
     }
     function ue(e, a, c, n = !1) {
       Object.keys(c).forEach(function(t) {
-        E(e, t.split(".")) || (O(e, t.split("."), c[t]), n && (ne[t] = !0), (a[t] || []).forEach(function(l) {
-          E(e, l.split(".")) || O(e, l.split("."), c[t]);
+        N(e, t.split(".")) || (E(e, t.split("."), c[t]), n && (O[t] = !0), (a[t] || []).forEach(function(l) {
+          N(e, l.split(".")) || E(e, l.split("."), c[t]);
         }));
       });
     }
-    function E(e, a) {
+    function N(e, a) {
       let c = e;
       k["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(t) {
         c = c[t] || {};
@@ -396,27 +396,27 @@ class De {
       const n = a[a.length - 1];
       return typeof c != "object" ? !1 : n in c;
     }
-    function O(e, a, c) {
+    function E(e, a, c) {
       let n = e;
       k["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(v) {
         v = pe(v), typeof n == "object" && n[v] === void 0 && (n[v] = {}), typeof n[v] != "object" || Array.isArray(n[v]) ? (Array.isArray(n[v]) ? n[v].push({}) : n[v] = [n[v], {}], n = n[v][n[v].length - 1]) : n = n[v];
       });
       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, (!T(n[t]) && m.nargs[t] === 1 || Array.isArray(n[t]) && n[t].length === m.nargs[t]) && (n[t] = void 0)), c === Z() ? n[t] = Z(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, (!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;
     }
     function xe(...e) {
       e.forEach(function(a) {
         Object.keys(a || {}).forEach(function(c) {
           m.aliases[c] || (m.aliases[c] = [].concat(_[c] || []), m.aliases[c].concat(c).forEach(function(n) {
             if (/-/.test(n) && k["camel-case-expansion"]) {
-              const t = $(n);
-              t !== c && m.aliases[c].indexOf(t) === -1 && (m.aliases[c].push(t), G[t] = !0);
+              const t = W(n);
+              t !== c && m.aliases[c].indexOf(t) === -1 && (m.aliases[c].push(t), S[t] = !0);
             }
           }), m.aliases[c].concat(c).forEach(function(n) {
             if (n.length > 1 && /[A-Z]/.test(n) && k["camel-case-expansion"]) {
-              const t = Ee(n, "-");
-              t !== c && m.aliases[c].indexOf(t) === -1 && (m.aliases[c].push(t), G[t] = !0);
+              const t = Oe(n, "-");
+              t !== c && m.aliases[c].indexOf(t) === -1 && (m.aliases[c].push(t), S[t] = !0);
             }
           }), m.aliases[c].forEach(function(n) {
             m.aliases[n] = [c].concat(m.aliases[c].filter(function(t) {
@@ -443,7 +443,7 @@ class De {
       });
     }
     function ye(e) {
-      if (e.match(Q) || !e.match(/^-[^-]+/))
+      if (e.match(I) || !e.match(/^-[^-]+/))
         return !1;
       let a = !0, c;
       const n = e.slice(1).split("");
@@ -457,16 +457,16 @@ class De {
       }
       return a;
     }
-    function H(e) {
+    function $(e) {
       return k["unknown-options-as-args"] && Ie(e);
     }
     function Ie(e) {
-      return e = e.replace(/^-{3,}/, "--"), e.match(Q) || ye(e) ? !1 : !Be(e, /^-+([^=]+?)=[\s\S]*$/, W, /^-+([^=]+?)$/, /^-+([^=]+?)-$/, /^-+([^=]+?\d+)$/, /^-+([^=]+?)\W+.*$/);
+      return e = e.replace(/^-{3,}/, "--"), e.match(I) || ye(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] : Me(Le(e));
     }
-    function Le(e) {
+    function Me(e) {
       return {
         [P.BOOLEAN]: !0,
         [P.STRING]: "",
@@ -474,23 +474,23 @@ class De {
         [P.ARRAY]: []
       }[e];
     }
-    function Me(e) {
+    function Le(e) {
       let a = P.BOOLEAN;
       return g(e, m.strings) ? a = P.STRING : g(e, m.numbers) ? a = P.NUMBER : g(e, m.bools) ? a = P.BOOLEAN : g(e, m.arrays) && (a = P.ARRAY), a;
     }
-    function T(e) {
+    function G(e) {
       return e === void 0;
     }
     function Ae() {
-      Object.keys(m.counts).find((e) => g(e, m.arrays) ? (M = Error(C("Invalid configuration: %s, opts.count excludes opts.array.", e)), !0) : g(e, m.nargs) ? (M = Error(C("Invalid configuration: %s, opts.count excludes opts.narg.", e)), !0) : !1);
+      Object.keys(m.counts).find((e) => g(e, m.arrays) ? (L = Error(M("Invalid configuration: %s, opts.count excludes opts.array.", e)), !0) : g(e, m.nargs) ? (L = Error(M("Invalid configuration: %s, opts.count excludes opts.narg.", e)), !0) : !1);
     }
     return {
       aliases: Object.assign({}, m.aliases),
       argv: Object.assign(se, w),
       configuration: k,
-      defaulted: Object.assign({}, ne),
-      error: M,
-      newAliases: Object.assign({}, G)
+      defaulted: Object.assign({}, O),
+      error: L,
+      newAliases: Object.assign({}, S)
     };
   }
 }
@@ -518,13 +518,13 @@ function Fe(i) {
     h !== void 0 && typeof h == "string" && (u[h] = r);
   }), u;
 }
-function Z(i) {
+function X(i) {
   return i !== void 0 ? i + 1 : 1;
 }
 function pe(i) {
   return i === "__proto__" ? "___proto___" : i;
 }
-function je(i) {
+function Ve(i) {
   return typeof i == "string" && (i[0] === "'" || i[0] === '"') && i[i.length - 1] === i[0] ? i.substring(1, i.length - 1) : i;
 }
 /**
@@ -535,17 +535,17 @@ function je(i) {
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-var X, ee, te;
-const le = process && process.env && process.env.YARGS_MIN_NODE_VERSION ? Number(process.env.YARGS_MIN_NODE_VERSION) : 12, de = (ee = (X = process == null ? void 0 : process.versions) === null || X === void 0 ? void 0 : X.node) !== null && ee !== void 0 ? ee : (te = process == null ? void 0 : process.version) === null || te === void 0 ? void 0 : te.slice(1);
+var ee, te, ae;
+const le = process && process.env && process.env.YARGS_MIN_NODE_VERSION ? Number(process.env.YARGS_MIN_NODE_VERSION) : 12, de = (te = (ee = process == null ? void 0 : process.versions) === null || ee === void 0 ? void 0 : ee.node) !== null && te !== void 0 ? te : (ae = process == null ? void 0 : process.version) === null || ae === void 0 ? void 0 : ae.slice(1);
 if (de && Number(de.match(/^([^.]+)/)[1]) < le)
   throw Error(`yargs parser supports a minimum Node.js version of ${le}. Read our version support policy: https://github.com/yargs/yargs-parser#supported-nodejs-versions`);
-const Ve = process ? process.env : {};
+const je = process ? process.env : {};
 new De({
   cwd: process.cwd,
-  env: () => Ve,
+  env: () => je,
   format: ke,
   normalize: Pe,
-  resolve: ie,
+  resolve: oe,
   // TODO: figure  out a  way to combine ESM and CJS coverage, such  that
   // we can exercise all the lines below:
   require: (i) => {
@@ -562,7 +562,7 @@ const Ke = {
     writeFile: Qe
   },
   format: ke,
-  resolve: ie,
+  resolve: oe,
   exists: (i) => {
     try {
       return Te(i).isFile();
@@ -671,18 +671,18 @@ function $e(i, o) {
   };
 }
 const We = (i) => $e(i, Ke);
-let N;
+let D;
 try {
-  N = Se(import.meta.url);
+  D = Se(import.meta.url);
 } catch {
-  N = process.cwd();
+  D = process.cwd();
 }
-const Ue = N.substring(0, N.lastIndexOf("node_modules"));
+const Ue = D.substring(0, D.lastIndexOf("node_modules"));
 Ue || process.cwd(), process.cwd, process.exit, process.nextTick, typeof process.stdout.columns < "u" && process.stdout.columns, We({
-  directory: ie(N, "../../../locales"),
+  directory: oe(D, "../../../locales"),
   updateFiles: !1
 });
-const oe = [
+const ne = [
   {
     id: "anthropic",
     name: "Anthropic",
@@ -1076,6 +1076,35 @@ const oe = [
           }
         ]
       },
+      {
+        id: "claude-opus-4-7",
+        name: "Claude Opus 4.7",
+        description: "Our most capable model for complex reasoning and agentic coding",
+        match: {
+          or: [
+            {
+              starts_with: "claude-opus-4-7"
+            },
+            {
+              starts_with: "claude-opus-4.7"
+            },
+            {
+              starts_with: "claude-4-7-opus"
+            },
+            {
+              starts_with: "claude-4.7-opus"
+            }
+          ]
+        },
+        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: 5,
+          cache_write_mtok: 6.25,
+          cache_read_mtok: 0.5,
+          output_mtok: 25
+        }
+      },
       {
         id: "claude-sonnet-4-0",
         name: "Claude Sonnet 4",
@@ -1532,6 +1561,18 @@ const oe = [
           }
         }
       },
+      {
+        id: "global.anthropic.claude-opus-4-7-v1:0",
+        match: {
+          contains: "global.anthropic.claude-opus-4-7"
+        },
+        prices: {
+          input_mtok: 5,
+          cache_write_mtok: 6.25,
+          cache_read_mtok: 0.5,
+          output_mtok: 25
+        }
+      },
       {
         id: "global.anthropic.claude-sonnet-4-20250514-v1:0",
         match: {
@@ -1776,6 +1817,39 @@ const oe = [
           output_mtok: 6
         }
       },
+      {
+        id: "nvidia.nemotron-nano-3-30b:0",
+        name: "Nemotron 3 Nano 30B",
+        match: {
+          contains: "nvidia.nemotron-nano-3-30b"
+        },
+        prices: {
+          input_mtok: 0.06,
+          output_mtok: 0.24
+        }
+      },
+      {
+        id: "nvidia.nemotron-nano-9b-v2:0",
+        name: "Nemotron 2 Nano 9B",
+        match: {
+          contains: "nvidia.nemotron-nano-9b-v2"
+        },
+        prices: {
+          input_mtok: 0.06,
+          output_mtok: 0.23
+        }
+      },
+      {
+        id: "nvidia.nemotron-super-3-120b:0",
+        name: "Nemotron 3 Super 120B",
+        match: {
+          contains: "nvidia.nemotron-super-3-120b"
+        },
+        prices: {
+          input_mtok: 0.15,
+          output_mtok: 0.65
+        }
+      },
       {
         id: "openai.gpt-oss-120b-1:0",
         name: "gpt-oss-120b",
@@ -2139,6 +2213,43 @@ const oe = [
           }
         }
       },
+      {
+        id: "regional.anthropic.claude-opus-4-7-v1:0",
+        match: {
+          or: [
+            {
+              starts_with: "anthropic.claude-opus-4-7"
+            },
+            {
+              starts_with: "claude-opus-4-7"
+            },
+            {
+              contains: "us.anthropic.claude-opus-4-7"
+            },
+            {
+              contains: "au.anthropic.claude-opus-4-7"
+            },
+            {
+              contains: "apac.anthropic.claude-opus-4-7"
+            },
+            {
+              contains: "eu.anthropic.claude-opus-4-7"
+            },
+            {
+              contains: "us-gov.anthropic.claude-opus-4-7"
+            },
+            {
+              contains: "jp.anthropic.claude-opus-4-7"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 5.5,
+          cache_write_mtok: 6.875,
+          cache_read_mtok: 0.55,
+          output_mtok: 27.5
+        }
+      },
       {
         id: "regional.anthropic.claude-sonnet-4-20250514-v1:0",
         match: {
@@ -3095,6 +3206,43 @@ Compared to other leading proprietary and open-weights models Command A delivers
             }
           }
         ]
+      },
+      {
+        id: "deepseek-v4-flash",
+        name: "DeepSeek V4 Flash",
+        description: "DeepSeek-V4-Flash. Supports both non-thinking and thinking (default) modes, JSON output, tool calls, chat prefix completion, and FIM completion (non-thinking only).",
+        match: {
+          or: [
+            {
+              starts_with: "deepseek-v4-flash"
+            }
+          ]
+        },
+        context_window: 1e6,
+        prices: {
+          input_mtok: 0.14,
+          cache_read_mtok: 28e-4,
+          output_mtok: 0.28
+        }
+      },
+      {
+        id: "deepseek-v4-pro",
+        name: "DeepSeek V4 Pro",
+        description: "DeepSeek-V4-Pro. Supports both non-thinking and thinking (default) modes, JSON output, tool calls, chat prefix completion, and FIM completion (non-thinking only).",
+        match: {
+          or: [
+            {
+              starts_with: "deepseek-v4-pro"
+            }
+          ]
+        },
+        context_window: 1e6,
+        price_comments: "Standard (non-promotional) pricing. DeepSeek is offering a temporary 75% promotional discount that is not reflected here.",
+        prices: {
+          input_mtok: 1.74,
+          cache_read_mtok: 0.0145,
+          output_mtok: 3.48
+        }
       }
     ]
   },
@@ -3408,7 +3556,7 @@ Compared to other leading proprietary and open-weights models Command A delivers
           },
           {
             path: "toolUsePromptTokenCount",
-            dest: "output_tokens",
+            dest: "input_tokens",
             required: !1
           }
         ]
@@ -3656,6 +3804,33 @@ Compared to other leading proprietary and open-weights models Command A delivers
           }
         }
       },
+      {
+        id: "claude-opus-4-7",
+        match: {
+          or: [
+            {
+              contains: "claude-4-7-opus"
+            },
+            {
+              contains: "claude-opus-4-7"
+            },
+            {
+              contains: "claude-4.7-opus"
+            },
+            {
+              contains: "claude-opus-4.7"
+            }
+          ]
+        },
+        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: 5,
+          cache_write_mtok: 6.25,
+          cache_read_mtok: 0.5,
+          output_mtok: 25
+        }
+      },
       {
         id: "gemini-1.0-pro-vision-001",
         name: "gemini 1.0 pro vision",
@@ -3763,17 +3938,10 @@ Compared to other leading proprietary and open-weights models Command A delivers
         context_window: 1e6,
         prices: {
           input_mtok: 0.1,
-          cache_read_mtok: {
-            base: 0.025,
-            tiers: [
-              {
-                start: 1e6,
-                price: 0.175
-              }
-            ]
-          },
+          cache_read_mtok: 0.025,
           output_mtok: 0.4,
-          input_audio_mtok: 0.7
+          input_audio_mtok: 0.7,
+          cache_audio_read_mtok: 0.175
         }
       },
       {
@@ -4030,14 +4198,14 @@ Compared to other leading proprietary and open-weights models Command A delivers
         }
       },
       {
-        id: "gemini-3.1-flash-lite-preview",
-        name: "Gemini 3.1 Flash Lite Preview",
+        id: "gemini-3.1-flash-lite",
+        name: "Gemini 3.1 Flash Lite",
         description: "Google's fastest and most cost-efficient Gemini 3 series model, built for intelligence at scale. Optimized for high-volume, low-latency applications while maintaining strong multimodal capabilities.",
         match: {
-          starts_with: "gemini-3.1-flash-lite-preview"
+          starts_with: "gemini-3.1-flash-lite"
         },
         context_window: 1e6,
-        price_comments: "See https://ai.google.dev/gemini-api/docs/pricing. Preview model - pricing may change before becoming stable.",
+        price_comments: "See https://ai.google.dev/gemini-api/docs/pricing.",
         prices: {
           input_mtok: 0.25,
           cache_read_mtok: 0.025,
@@ -10027,6 +10195,7 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         context_window: 128e3,
         prices: {
+          input_mtok: 2.5,
           output_mtok: 10,
           input_audio_mtok: 2.5
         }
@@ -10077,6 +10246,7 @@ Compared to other leading proprietary and open-weights models Command A delivers
           starts_with: "gpt-4o-mini-audio"
         },
         prices: {
+          input_mtok: 0.15,
           output_mtok: 0.6,
           input_audio_mtok: 0.15
         }
@@ -10113,6 +10283,7 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         prices: {
           input_mtok: 0.6,
+          output_mtok: 12,
           output_audio_mtok: 12
         }
       },
@@ -10437,6 +10608,39 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 168
         }
       },
+      {
+        id: "gpt-5.3",
+        name: "GPT-5.3 Chat",
+        description: "GPT-5.3 Instant model used in ChatGPT",
+        match: {
+          or: [
+            {
+              equals: "gpt-5.3"
+            },
+            {
+              equals: "gpt-5-3"
+            },
+            {
+              equals: "gpt-5.3-chat"
+            },
+            {
+              equals: "gpt-5.3-chat-latest"
+            },
+            {
+              equals: "gpt-5-3-chat"
+            },
+            {
+              equals: "gpt-5-3-chat-latest"
+            }
+          ]
+        },
+        context_window: 128e3,
+        prices: {
+          input_mtok: 1.75,
+          cache_read_mtok: 0.175,
+          output_mtok: 14
+        }
+      },
       {
         id: "gpt-5.3-codex",
         name: "GPT-5.3-Codex",
@@ -10605,6 +10809,83 @@ Compared to other leading proprietary and open-weights models Command A delivers
           }
         }
       },
+      {
+        id: "gpt-5.5",
+        name: "GPT-5.5",
+        description: "The best model for coding and agentic tasks across industries",
+        match: {
+          or: [
+            {
+              equals: "gpt-5.5"
+            },
+            {
+              equals: "gpt-5.5-2026-04-23"
+            },
+            {
+              equals: "gpt-5.5-2026-04-24"
+            },
+            {
+              equals: "gpt-5-5"
+            },
+            {
+              equals: "gpt-5-5-2026-04-23"
+            },
+            {
+              equals: "gpt-5-5-2026-04-24"
+            },
+            {
+              equals: "gpt-5.5-chat"
+            },
+            {
+              equals: "gpt-5.5-chat-latest"
+            },
+            {
+              equals: "gpt-5-5-chat"
+            },
+            {
+              equals: "gpt-5-5-chat-latest"
+            },
+            {
+              equals: "gpt-5.5-codex"
+            },
+            {
+              equals: "gpt-5-5-codex"
+            }
+          ]
+        },
+        context_window: 1e6,
+        prices: {
+          input_mtok: 5,
+          cache_read_mtok: 0.5,
+          output_mtok: 30
+        }
+      },
+      {
+        id: "gpt-5.5-pro",
+        name: "GPT-5.5 Pro",
+        description: "Version of GPT-5.5 that produces smarter and more precise responses.",
+        match: {
+          or: [
+            {
+              equals: "gpt-5.5-pro"
+            },
+            {
+              equals: "gpt-5.5-pro-2026-04-23"
+            },
+            {
+              equals: "gpt-5-5-pro"
+            },
+            {
+              equals: "gpt-5-5-pro-2026-04-23"
+            }
+          ]
+        },
+        context_window: 1e6,
+        prices: {
+          input_mtok: 30,
+          output_mtok: 180
+        }
+      },
       {
         id: "gpt-realtime",
         match: {
@@ -10926,6 +11207,45 @@ Compared to other leading proprietary and open-weights models Command A delivers
     name: "OpenRouter",
     pricing_urls: ["https://openrouter.ai/models"],
     api_pattern: "https://(api\\.)?openrouter\\.ai",
+    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: ["prompt_tokens_details", "cache_write_tokens"],
+            dest: "cache_write_tokens",
+            required: !1
+          },
+          {
+            path: ["prompt_tokens_details", "audio_tokens"],
+            dest: "input_audio_tokens",
+            required: !1
+          },
+          {
+            path: ["completion_tokens_details", "audio_tokens"],
+            dest: "output_audio_tokens",
+            required: !1
+          },
+          {
+            path: "completion_tokens",
+            dest: "output_tokens",
+            required: !0
+          }
+        ]
+      }
+    ],
     models: [
       {
         id: "01-ai/yi-large",
@@ -11317,6 +11637,18 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "anthropic/claude-haiku-4.5"
             },
+            {
+              equals: "anthropic/claude-4.5-haiku-20251001"
+            },
+            {
+              equals: "anthropic/claude-4.5-haiku-20251001:beta"
+            },
+            {
+              equals: "anthropic/claude-haiku-4.5-20251001"
+            },
+            {
+              equals: "anthropic/claude-haiku-4.5-20251001:beta"
+            },
             {
               equals: "anthropic/claude-haiku-4.5:beta"
             }
@@ -11336,6 +11668,18 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "anthropic/claude-opus-4.5"
             },
+            {
+              equals: "anthropic/claude-4.5-opus-20251124"
+            },
+            {
+              equals: "anthropic/claude-4.5-opus-20251124:beta"
+            },
+            {
+              equals: "anthropic/claude-opus-4.5-20251124"
+            },
+            {
+              equals: "anthropic/claude-opus-4.5-20251124:beta"
+            },
             {
               equals: "anthropic/claude-opus-4.5:beta"
             }
@@ -11355,48 +11699,51 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "anthropic/claude-opus-4.6"
             },
+            {
+              equals: "anthropic/claude-4.6-opus-20260205"
+            },
+            {
+              equals: "anthropic/claude-4.6-opus-20260205:beta"
+            },
+            {
+              equals: "anthropic/claude-opus-4.6-20260205"
+            },
+            {
+              equals: "anthropic/claude-opus-4.6-20260205:beta"
+            },
             {
               equals: "anthropic/claude-opus-4.6: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: {
-            base: 5,
-            tiers: [
-              {
-                start: 2e5,
-                price: 10
-              }
-            ]
-          },
-          cache_write_mtok: {
-            base: 6.25,
-            tiers: [
-              {
-                start: 2e5,
-                price: 12.5
-              }
-            ]
-          },
-          cache_read_mtok: {
-            base: 0.5,
-            tiers: [
-              {
-                start: 2e5,
-                price: 1
-              }
-            ]
-          },
-          output_mtok: {
-            base: 25,
-            tiers: [
-              {
-                start: 2e5,
-                price: 37.5
-              }
-            ]
-          }
+          input_mtok: 5,
+          cache_write_mtok: 6.25,
+          cache_read_mtok: 0.5,
+          output_mtok: 25
+        }
+      },
+      {
+        id: "anthropic/claude-opus-4.7",
+        match: {
+          or: [
+            {
+              equals: "anthropic/claude-opus-4.7"
+            },
+            {
+              equals: "anthropic/claude-opus-4.7: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: 5,
+          cache_write_mtok: 6.25,
+          cache_read_mtok: 0.5,
+          output_mtok: 25
         }
       },
       {
@@ -11406,12 +11753,25 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "anthropic/claude-sonnet-4.5"
             },
+            {
+              equals: "anthropic/claude-4.5-sonnet-20250929"
+            },
+            {
+              equals: "anthropic/claude-4.5-sonnet-20250929:beta"
+            },
+            {
+              equals: "anthropic/claude-sonnet-4.5-20250929"
+            },
+            {
+              equals: "anthropic/claude-sonnet-4.5-20250929:beta"
+            },
             {
               equals: "anthropic/claude-sonnet-4.5:beta"
             }
           ]
         },
         context_window: 1e6,
+        price_comments: "Tiered pricing: Unlike 4.6 models, Sonnet 4.5 has long-context surcharge. Ref: https://platform.claude.com/docs/en/about-claude/pricing#long-context-pricing",
         prices: {
           input_mtok: {
             base: 3,
@@ -11458,11 +11818,25 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "anthropic/claude-sonnet-4.6"
             },
+            {
+              equals: "anthropic/claude-4.6-sonnet-20260217"
+            },
+            {
+              equals: "anthropic/claude-4.6-sonnet-20260217:beta"
+            },
+            {
+              equals: "anthropic/claude-sonnet-4.6-20260217"
+            },
+            {
+              equals: "anthropic/claude-sonnet-4.6-20260217:beta"
+            },
             {
               equals: "anthropic/claude-sonnet-4.6: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: 3,
           cache_write_mtok: 3.75,
@@ -12361,6 +12735,19 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         prices: {}
       },
+      {
+        id: "deepseek/deepseek-v3.2",
+        name: "DeepSeek V3.2",
+        match: {
+          equals: "deepseek/deepseek-v3.2"
+        },
+        context_window: 131072,
+        prices: {
+          input_mtok: 0.252,
+          cache_read_mtok: 0.0252,
+          output_mtok: 0.378
+        }
+      },
       {
         id: "deepseek/deepseek-v3.2-exp",
         name: "DeepSeek V3.2 Experimental",
@@ -18885,6 +19272,30 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.5
         }
       },
+      {
+        id: "grok-4.3",
+        name: "Grok 4.3",
+        description: "Most advanced flagship model, leading the industry in non-hallucination rate, agentic tool calling, and instruction following capabilities. Supports text and image inputs with text outputs, function calling, structured outputs, and reasoning.",
+        match: {
+          or: [
+            {
+              equals: "grok-4.3"
+            },
+            {
+              equals: "grok-4.3-latest"
+            },
+            {
+              equals: "grok-latest"
+            }
+          ]
+        },
+        context_window: 1e6,
+        prices: {
+          input_mtok: 1.25,
+          cache_read_mtok: 0.2,
+          output_mtok: 2.5
+        }
+      },
       {
         id: "grok-code-fast-1",
         name: "Grok Code Fast 1",
@@ -18924,26 +19335,27 @@ function z(i, o, u, s) {
 }
 function Je(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.output_audio_tokens ?? 0;
-  let y = i.input_audio_tokens ?? 0;
-  if (y -= k, 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, T = i.output_audio_tokens ?? 0, B = o.cache_audio_read_mtok === void 0 ? 0 : k, Q = 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 - Q), y < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than input_audio_tokens");
-  let B = i.input_tokens ?? 0;
-  if (B -= h, B -= _, B -= y, B < 0)
-    throw new Error("Uncached text input tokens cannot be negative");
-  let I = h;
-  if (I -= k, I < 0)
+  let S = 0;
+  if (o.cache_read_mtok !== void 0 && (S = h - B), S < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than cache_read_tokens");
-  u += z(o.input_mtok, B, "input_mtok", r), u += z(o.cache_read_mtok, I, "cache_read_mtok", r), u += z(o.cache_write_mtok, _, "cache_write_mtok", r), u += z(o.input_audio_mtok, y, "input_audio_mtok", r), u += z(o.cache_audio_read_mtok, k, "cache_audio_read_mtok", r);
-  let L = i.output_tokens ?? 0;
-  if (L -= q, L < 0)
+  const O = o.cache_write_mtok === void 0 ? 0 : _;
+  let M = 0;
+  if (o.input_mtok !== void 0 && (M = r - S - O - y - B), M < 0)
+    throw new Error("Uncached text input tokens cannot be negative");
+  u += z(o.input_mtok, M, "input_mtok", r), u += z(o.cache_read_mtok, S, "cache_read_mtok", r), u += z(o.cache_write_mtok, O, "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);
+  let m = 0;
+  if (o.output_mtok !== void 0 && (m = (i.output_tokens ?? 0) - (o.output_audio_mtok === void 0 ? 0 : T)), m < 0)
     throw new Error("output_audio_tokens cannot be greater than output_tokens");
-  s += z(o.output_mtok, L, "output_mtok", r), s += z(o.output_audio_mtok, i.output_audio_tokens, "output_audio_mtok", r);
-  let G = u + s;
-  return o.requests_kcount !== void 0 && (G += o.requests_kcount / 1e3), {
+  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), {
     input_price: u,
     output_price: s,
-    total_price: G
+    total_price: I
   };
 }
 function Ze(i, o) {
@@ -18967,12 +19379,12 @@ function Ze(i, o) {
   }
   return i.prices[0].prices;
 }
-function D(i, o) {
-  return "or" in i ? i.or.some((u) => D(u, o)) : "and" in i ? i.and.every((u) => D(u, o)) : "equals" in i ? o === i.equals : "starts_with" in i ? o.startsWith(i.starts_with) : "ends_with" in i ? o.endsWith(i.ends_with) : "contains" in i ? o.includes(i.contains) : "regex" in i ? new RegExp(i.regex).test(o) : !1;
+function F(i, o) {
+  return "or" in i ? i.or.some((u) => F(u, o)) : "and" in i ? i.and.every((u) => F(u, o)) : "equals" in i ? o === i.equals : "starts_with" in i ? o.startsWith(i.starts_with) : "ends_with" in i ? o.endsWith(i.ends_with) : "contains" in i ? o.includes(i.contains) : "regex" in i ? new RegExp(i.regex).test(o) : !1;
 }
 function Xe(i, o) {
   const u = o.toLowerCase().trim(), s = i.find((r) => r.id === u);
-  return s || i.find((r) => r.provider_match && D(r.provider_match, u));
+  return s || i.find((r) => r.provider_match && F(r.provider_match, u));
 }
 function _e(i, { modelId: o, providerApiUrl: u, providerId: s }) {
   if (s) {
@@ -18983,10 +19395,10 @@ function _e(i, { modelId: o, providerApiUrl: u, providerId: s }) {
   if (u)
     return i.find((r) => new RegExp(r.api_pattern).test(u));
   if (o)
-    return i.find((r) => r.model_match && D(r.model_match, o));
+    return i.find((r) => r.model_match && F(r.model_match, o));
 }
 function et(i, o) {
-  return i.find((u) => D(u.match, o));
+  return i.find((u) => F(u.match, o));
 }
 function qe(i, o, u) {
   const s = et(i.models, o);
@@ -19000,25 +19412,25 @@ function qe(i, o, u) {
       }
     }
 }
-let ae = oe;
-Promise.resolve(oe);
+let ie = ne;
+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("/"), I = s.slice(0, B), L = s.slice(B + 1);
-    I && L && _e(ae, { providerId: I }) && (r = I, s = L);
+    const B = s.indexOf("/"), Q = s.slice(0, B), y = s.slice(B + 1);
+    Q && y && _e(ie, { providerId: Q }) && (r = Q, s = y);
   }
-  const h = u?.provider ?? _e(ae, { modelId: s, providerApiUrl: u?.providerApiUrl, providerId: r });
+  const h = u?.provider ?? _e(ie, { modelId: s, providerApiUrl: u?.providerApiUrl, providerId: r });
   if (!h) return null;
-  const _ = qe(h, s, ae);
+  const _ = qe(h, s, ie);
   if (!_) return null;
-  const k = u?.timestamp ?? /* @__PURE__ */ new Date(), q = Ze(_, k), y = Je(i, q);
+  const k = u?.timestamp ?? /* @__PURE__ */ new Date(), q = Ze(_, k), T = Je(i, q);
   return {
     auto_update_timestamp: void 0,
     model: _,
     model_price: q,
     provider: h,
-    ...y
+    ...T
   };
 }
 const f = he(Re(process.argv)).scriptName("genai-prices").command(
@@ -19032,7 +19444,7 @@ const f = he(Re(process.argv)).scriptName("genai-prices").command(
 ).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") {
-    const u = oe;
+    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)`);
@@ -19068,17 +19480,17 @@ function at() {
           r = !0, console.error(`No price found for model ${h}`);
           continue;
         }
-        const y = q.model.context_window, B = [
+        const T = 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", y !== void 0 ? y.toLocaleString() : void 0],
+          ["Context Window", T !== void 0 ? T.toLocaleString() : void 0],
           ["Total Price", `$${q.total_price}`],
           ["Input Price", `$${q.input_price}`],
           ["Output Price", `$${q.output_price}`]
         ];
-        for (const [I, L] of B)
-          L !== void 0 && console.log(`${I.padStart(14)}: ${L}`);
+        for (const [Q, y] of B)
+          y !== void 0 && console.log(`${Q.padStart(14)}: ${y}`);
         console.log("");
       } catch (q) {
         r = !0, q instanceof Error && console.error(`Error for model ${h}:`, q.message);