@pydantic/genai-prices 0.0.51 → 0.0.53

package/dist/cli.js

@@ -1,21 +1,21 @@
 #!/usr/bin/env node
-import he from "yargs";
-import { format as _e } from "util";
-import { resolve as ae, normalize as Qe } from "path";
-import { readFileSync as ke, writeFile as Ae, statSync as Pe } from "fs";
+import _e from "yargs";
+import { format as ke } from "util";
+import { resolve as ie, normalize as Qe } from "path";
+import { readFileSync as ge, writeFile as Pe, statSync as Te } from "fs";
 import "assert";
-import { fileURLToPath as Te } from "url";
-function Se() {
-  return Ge() ? 0 : 1;
-}
+import { fileURLToPath as Se } from "url";
 function Ge() {
-  return Ce() && !process.defaultApp;
+  return Ce() ? 0 : 1;
 }
 function Ce() {
+  return Re() && !process.defaultApp;
+}
+function Re() {
   return !!process.versions.electron;
 }
-function Re(i) {
-  return i.slice(Se() + 1);
+function ze(i) {
+  return i.slice(Ge() + 1);
 }
 /**
  * @license
@@ -29,19 +29,19 @@ function $(i) {
     let u = "", s = !1;
     const r = i.match(/^-+/);
     for (let _ = r ? r[0].length : 0; _ < i.length; _++) {
-      let k = i.charAt(_);
-      s && (s = !1, k = k.toUpperCase()), _ !== 0 && (k === "-" || k === "_") ? s = !0 : k !== "-" && k !== "_" && (u += k);
+      let h = i.charAt(_);
+      s && (s = !1, h = h.toUpperCase()), _ !== 0 && (h === "-" || h === "_") ? s = !0 : h !== "-" && h !== "_" && (u += h);
     }
     return u;
   }
 }
-function ze(i, o) {
+function Oe(i, o) {
   const u = i.toLowerCase();
   o = o || "-";
   let s = "";
   for (let r = 0; r < i.length; r++) {
-    const _ = u.charAt(r), k = i.charAt(r);
-    _ !== k && r > 0 ? s += `${o}${u.charAt(r)}` : s += k;
+    const _ = u.charAt(r), h = i.charAt(r);
+    _ !== h && r > 0 ? s += `${o}${u.charAt(r)}` : s += h;
   }
   return s;
 }
@@ -53,14 +53,14 @@ function Ne(i) {
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function Oe(i) {
+function Ee(i) {
   if (Array.isArray(i))
-    return i.map((k) => typeof k != "string" ? k + "" : k);
+    return i.map((h) => typeof h != "string" ? h + "" : h);
   i = i.trim();
   let o = 0, u = null, s = null, r = null;
   const _ = [];
-  for (let k = 0; k < i.length; k++) {
-    if (u = s, s = i.charAt(k), s === " " && !r) {
+  for (let h = 0; h < i.length; h++) {
+    if (u = s, s = i.charAt(h), s === " " && !r) {
       u !== " " && o++;
       continue;
     }
@@ -73,19 +73,19 @@ function Oe(i) {
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-var L;
+var Q;
 (function(i) {
   i.BOOLEAN = "boolean", i.STRING = "string", i.NUMBER = "number", i.ARRAY = "array";
-})(L || (L = {}));
+})(Q || (Q = {}));
 /**
  * @license
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-let T;
+let S;
 class De {
   constructor(o) {
-    T = o;
+    S = o;
   }
   parse(o, u) {
     const s = Object.assign({
@@ -105,7 +105,7 @@ class De {
       number: void 0,
       __: void 0,
       key: void 0
-    }, u), r = Oe(o), _ = typeof o == "string", k = Ee(Object.assign(/* @__PURE__ */ Object.create(null), s.alias)), h = Object.assign({
+    }, u), r = Ee(o), _ = typeof o == "string", h = je(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), M = s.configObjects || [], B = s.envPrefix, S = h["populate--"], A = S ? "--" : "_", G = /* @__PURE__ */ Object.create(null), oe = /* @__PURE__ */ Object.create(null), C = s.__ || T.format, m = {
+    }, s.configuration), q = Object.assign(/* @__PURE__ */ Object.create(null), s.default), I = s.configObjects || [], B = s.envPrefix, y = k["populate--"], L = y ? "--" : "_", G = /* @__PURE__ */ Object.create(null), ne = /* @__PURE__ */ Object.create(null), C = s.__ || S.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("^--" + h["negation-prefix"] + "(.+)");
+    }, P = /^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/, W = 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 {
@@ -164,94 +164,94 @@ class De {
       m.configs[e] = !0;
     }) : typeof s.config == "object" && Object.entries(s.config).forEach(([e, a]) => {
       (typeof a == "boolean" || typeof a == "function") && (m.configs[e] = a);
-    })), ve(s.key, k, s.default, m.arrays), Object.keys(q).forEach(function(e) {
+    })), xe(s.key, h, s.default, m.arrays), Object.keys(q).forEach(function(e) {
       (m.aliases[e] || []).forEach(function(a) {
         q[a] = q[e];
       });
     });
-    let y = null;
-    Me();
+    let M = null;
+    Ae();
     let j = [];
-    const w = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), ne = {};
+    const b = 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) && K(a))
+      if (a !== "--" && /^-/.test(a) && H(a))
         U(a);
       else if (c.match(/^---+(=|$)/)) {
         U(a);
         continue;
-      } else if (a.match(/^--.+=/) || !h["short-option-groups"] && a.match(/^-.+=/))
-        p = a.match(/^--?([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && (g(p[1], m.arrays) ? e = F(e, p[1], r, p[2]) : g(p[1], m.nargs) !== !1 ? e = V(e, p[1], r, p[2]) : b(p[1], p[2], !0));
-      else if (a.match(W) && h["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));
-      else if (a.match(/^--.+/) || !h["short-option-groups"] && a.match(/^-[^-]+/))
-        p = a.match(/^--?(.+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], g(t, m.arrays) ? e = F(e, t, r) : g(t, m.nargs) !== !1 ? e = V(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, z(t))));
+      } 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 = F(e, p[1], r, p[2]) : g(p[1], m.nargs) !== !1 ? e = V(e, p[1], r, p[2]) : w(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], w(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 = F(e, t, r) : g(t, m.nargs) !== !1 ? e = V(e, t, r) : (d = r[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(P)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (w(t, d), e++) : w(t, z(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))
-        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, z(t)));
-      else if (a.match(/^-[^-]+/) && !a.match(Q)) {
+        p = a.match(/^-([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && w(p[1], p[2]);
+      else if (a.match(/^-.\..+/) && !a.match(P))
+        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, z(t)));
+      else if (a.match(/^-[^-]+/) && !a.match(P)) {
         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 = F(e, t, r, v) : g(t, m.nargs) !== !1 ? e = V(e, t, r, v) : b(t, v), n = !0;
+            v = a.slice(x + 3), t = l[x], g(t, m.arrays) ? e = F(e, t, r, v) : g(t, m.nargs) !== !1 ? e = V(e, t, r, v) : w(t, v), n = !0;
             break;
           }
           if (d === "-") {
-            b(l[x], d);
+            w(l[x], d);
             continue;
           }
           if (/[A-Za-z]/.test(l[x]) && /^-?\d+(\.\d*)?(e-?\d+)?$/.test(d) && g(d, m.bools) === !1) {
-            b(l[x], d), n = !0;
+            w(l[x], d), n = !0;
             break;
           }
           if (l[x + 1] && l[x + 1].match(/\W/)) {
-            b(l[x], d), n = !0;
+            w(l[x], d), n = !0;
             break;
           } else
-            b(l[x], z(l[x]));
+            w(l[x], z(l[x]));
         }
-        t = a.slice(-1)[0], !n && t !== "-" && (g(t, m.arrays) ? e = F(e, t, r) : g(t, m.nargs) !== !1 ? e = V(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, z(t))));
-      } else if (a.match(/^-[0-9]$/) && a.match(Q) && g(a.slice(1), m.bools))
-        t = a.slice(1), b(t, z(t));
+        t = a.slice(-1)[0], !n && t !== "-" && (g(t, m.arrays) ? e = F(e, t, r) : g(t, m.nargs) !== !1 ? e = V(e, t, r) : (d = r[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(P)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (w(t, d), e++) : w(t, z(t))));
+      } else if (a.match(/^-[0-9]$/) && a.match(P) && g(a.slice(1), m.bools))
+        t = a.slice(1), w(t, z(t));
       else if (a === "--") {
         j = r.slice(e + 1);
         break;
-      } else if (h["halt-at-non-option"]) {
+      } else if (k["halt-at-non-option"]) {
         j = r.slice(e);
         break;
       } else
         U(a);
     }
-    re(w, !0), re(w, !1), qe(w), fe(), me(w, m.aliases, q, !0), be(w), h["set-placeholder-key"] && we(w), Object.keys(m.counts).forEach(function(e) {
-      N(w, e.split(".")) || b(e, 0);
-    }), S && j.length && (w[A] = []), j.forEach(function(e) {
-      w[A].push(e);
-    }), h["camel-case-expansion"] && h["strip-dashed"] && Object.keys(w).filter((e) => e !== "--" && e.includes("-")).forEach((e) => {
-      delete w[e];
-    }), h["strip-aliased"] && [].concat(...Object.keys(k).map((e) => k[e])).forEach((e) => {
-      h["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((a) => $(a)).join(".")], delete w[e];
+    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);
+    }), y && j.length && (b[L] = []), j.forEach(function(e) {
+      b[L].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(h).map((e) => h[e])).forEach((e) => {
+      k["camel-case-expansion"] && e.includes("-") && delete b[e.split(".").map((a) => $(a)).join(".")], delete b[e];
     });
     function U(e) {
-      const a = H("_", e);
-      (typeof a == "string" || typeof a == "number") && w._.push(a);
+      const a = K("_", e);
+      (typeof a == "string" || typeof a == "number") && b._.push(a);
     }
     function V(e, a, c, n) {
       let t, l = g(a, m.nargs);
       if (l = typeof l != "number" || isNaN(l) ? 1 : l, l === 0)
-        return P(n) || (y = Error(C("Argument unexpected for: %s", a))), b(a, z(a)), e;
-      let p = P(n) ? 0 : 1;
-      if (h["nargs-eats-options"])
-        c.length - (e + 1) + p < l && (y = Error(C("Not enough arguments following: %s", a))), p = l;
+        return T(n) || (M = Error(C("Argument unexpected for: %s", a))), w(a, z(a)), e;
+      let p = T(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;
       else {
-        for (t = e + 1; t < c.length && (!c[t].match(/^-[^0-9]/) || c[t].match(Q) || K(c[t])); t++)
+        for (t = e + 1; t < c.length && (!c[t].match(/^-[^0-9]/) || c[t].match(P) || H(c[t])); t++)
           p++;
-        p < l && (y = Error(C("Not enough arguments following: %s", a)));
+        p < l && (M = Error(C("Not enough arguments following: %s", a)));
       }
       let d = Math.min(p, l);
-      for (!P(n) && d > 0 && (b(a, n), d--), t = e + 1; t < d + e + 1; t++)
-        b(a, c[t]);
+      for (!T(n) && d > 0 && (w(a, n), d--), t = e + 1; t < d + e + 1; t++)
+        w(a, c[t]);
       return e + d;
     }
     function F(e, a, c, n) {
@@ -259,66 +259,66 @@ class De {
       const p = g(a, m.nargs);
       if (g(a, m.bools) && !/^(true|false)$/.test(l))
         t.push(!0);
-      else if (P(l) || P(n) && /^-/.test(l) && !Q.test(l) && !K(l)) {
+      else if (T(l) || T(n) && /^-/.test(l) && !P.test(l) && !H(l)) {
         if (q[a] !== void 0) {
           const d = q[a];
           t = Array.isArray(d) ? d : [d];
         }
       } else {
-        P(n) || t.push(Y(a, n, !0));
-        for (let d = e + 1; d < c.length && !(!h["greedy-arrays"] && t.length > 0 || p && typeof p == "number" && t.length >= p || (l = c[d], /^-/.test(l) && !Q.test(l) && !K(l))); d++)
+        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) && !P.test(l) && !H(l))); d++)
           e = d, t.push(Y(a, l, _));
       }
-      return typeof p == "number" && (p && t.length < p || isNaN(p) && t.length === 0) && (y = 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) && (M = Error(C("Not enough arguments following: %s", a))), w(a, t), e;
     }
-    function b(e, a, c = _) {
-      if (/-/.test(e) && h["camel-case-expansion"]) {
+    function w(e, a, c = _) {
+      if (/-/.test(e) && k["camel-case-expansion"]) {
         const l = e.split(".").map(function(p) {
           return $(p);
         }).join(".");
-        se(e, l);
+        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) {
+      N(b, t, n), m.aliases[e] && m.aliases[e].forEach(function(l) {
         const p = l.split(".");
-        O(w, p, n);
-      }), t.length > 1 && h["dot-notation"] && (m.aliases[t[0]] || []).forEach(function(l) {
+        N(b, 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(".")) || N(b, p, n);
       }), g(e, m.normalize) && !g(e, m.arrays) && [e].concat(m.aliases[e] || []).forEach(function(p) {
-        Object.defineProperty(ne, p, {
+        Object.defineProperty(se, p, {
           enumerable: !0,
           get() {
             return a;
           },
           set(d) {
-            a = typeof d == "string" ? T.normalize(d) : d;
+            a = typeof d == "string" ? S.normalize(d) : d;
           }
         });
       });
     }
-    function se(e, a) {
-      m.aliases[e] && m.aliases[e].length || (m.aliases[e] = [a], G[a] = !0), m.aliases[a] && m.aliases[a].length || se(a, e);
+    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);
     }
     function Y(e, a, c) {
-      c && (a = je(a)), (g(e, m.bools) || g(e, m.counts)) && typeof a == "string" && (a = a === "true");
+      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) && (P(n) || typeof n == "boolean") && (n = Z()), g(e, m.normalize) && g(e, m.arrays) && (Array.isArray(a) ? n = a.map((t) => T.normalize(t)) : n = T.normalize(a)), n;
+        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;
     }
-    function H(e, a) {
-      return !h["parse-positional-numbers"] && e === "_" || !g(e, m.strings) && !g(e, m.bools) && !Array.isArray(a) && (Ne(a) && h["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${a}`))) || !P(a) && g(e, m.numbers)) && (a = Number(a)), a;
+    function K(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}`))) || !T(a) && g(e, m.numbers)) && (a = Number(a)), a;
     }
-    function qe(e) {
+    function fe(e) {
       const a = /* @__PURE__ */ Object.create(null);
-      me(a, m.aliases, q), Object.keys(m.configs).forEach(function(c) {
+      ue(a, m.aliases, q), Object.keys(m.configs).forEach(function(c) {
         const n = e[c] || a[c];
         if (n)
           try {
             let t = null;
-            const l = T.resolve(T.cwd(), n), p = m.configs[c];
+            const l = S.resolve(S.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) {
-                y = t;
+                M = t;
                 return;
               }
             } else
-              t = T.require(l);
+              t = S.require(l);
             J(t);
           } catch (t) {
-            t.name === "PermissionDenied" ? y = t : e[c] && (y = Error(C("Invalid JSON config file: %s", n)));
+            t.name === "PermissionDenied" ? M = t : e[c] && (M = Error(C("Invalid JSON config file: %s", n)));
           }
       });
     }
     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) && h["dot-notation"] ? J(n, t) : (!N(w, t.split(".")) || g(t, m.arrays) && h["combine-arrays"]) && b(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"]) && w(t, n);
       });
     }
-    function fe() {
-      typeof M < "u" && M.forEach(function(e) {
+    function we() {
+      typeof I < "u" && I.forEach(function(e) {
         J(e);
       });
     }
-    function re(e, a) {
+    function me(e, a) {
       if (typeof B > "u")
         return;
-      const c = typeof B == "string" ? B : "", n = T.env();
+      const c = typeof B == "string" ? B : "", n = S.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);
           });
-          (a && m.configs[l.join(".")] || !a) && !N(e, l) && b(l.join("."), n[t]);
+          (a && m.configs[l.join(".")] || !a) && !O(e, l) && w(l.join("."), n[t]);
         }
       });
     }
@@ -367,55 +367,55 @@ class De {
       Object.keys(e).forEach(function(n) {
         if (!c.has(n) && (a = g(n, m.coercions), typeof a == "function"))
           try {
-            const t = H(n, a(e[n]));
+            const t = K(n, a(e[n]));
             [].concat(m.aliases[n] || [], n).forEach((l) => {
               c.add(l), e[l] = t;
             });
           } catch (t) {
-            y = t;
+            M = t;
           }
       });
     }
-    function we(e) {
+    function ve(e) {
       return m.keys.forEach((a) => {
         ~a.indexOf(".") || typeof e[a] > "u" && (e[a] = void 0);
       }), e;
     }
-    function me(e, a, c, n = !1) {
+    function ue(e, a, c, n = !1) {
       Object.keys(c).forEach(function(t) {
-        N(e, t.split(".")) || (O(e, t.split("."), c[t]), n && (oe[t] = !0), (a[t] || []).forEach(function(l) {
-          N(e, l.split(".")) || O(e, l.split("."), c[t]);
+        O(e, t.split(".")) || (N(e, t.split("."), c[t]), n && (ne[t] = !0), (a[t] || []).forEach(function(l) {
+          O(e, l.split(".")) || N(e, l.split("."), c[t]);
         }));
       });
     }
-    function N(e, a) {
+    function O(e, a) {
       let c = e;
-      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(t) {
+      k["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(t) {
         c = c[t] || {};
       });
       const n = a[a.length - 1];
       return typeof c != "object" ? !1 : n in c;
     }
-    function O(e, a, c) {
+    function N(e, a, c) {
       let n = e;
-      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(v) {
-        v = ce(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];
+      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 = ce(a[a.length - 1]), l = g(a.join("."), m.arrays), p = Array.isArray(c);
-      let d = h["duplicate-arguments-array"];
-      !d && g(t, m.nargs) && (d = !0, (!P(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] = h["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;
+      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;
     }
-    function ve(...e) {
+    function xe(...e) {
       e.forEach(function(a) {
         Object.keys(a || {}).forEach(function(c) {
-          m.aliases[c] || (m.aliases[c] = [].concat(k[c] || []), m.aliases[c].concat(c).forEach(function(n) {
-            if (/-/.test(n) && h["camel-case-expansion"]) {
+          m.aliases[c] || (m.aliases[c] = [].concat(h[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);
             }
           }), m.aliases[c].concat(c).forEach(function(n) {
-            if (n.length > 1 && /[A-Z]/.test(n) && h["camel-case-expansion"]) {
-              const t = ze(n, "-");
+            if (n.length > 1 && /[A-Z]/.test(n) && k["camel-case-expansion"]) {
+              const t = Oe(n, "-");
               t !== c && m.aliases[c].indexOf(t) === -1 && (m.aliases[c].push(t), G[t] = !0);
             }
           }), m.aliases[c].forEach(function(n) {
@@ -430,25 +430,25 @@ class De {
       const c = [].concat(m.aliases[e] || [], e), n = Object.keys(a), t = c.find((l) => n.includes(l));
       return t ? a[t] : !1;
     }
-    function ue(e) {
+    function ce(e) {
       const a = Object.keys(m);
       return [].concat(a.map((n) => m[n])).some(function(n) {
         return Array.isArray(n) ? n.includes(e) : n[e];
       });
     }
-    function xe(e, ...a) {
+    function Be(e, ...a) {
       return [].concat(...a).some(function(n) {
         const t = e.match(n);
-        return t && ue(t[1]);
+        return t && ce(t[1]);
       });
     }
-    function Be(e) {
-      if (e.match(Q) || !e.match(/^-[^-]+/))
+    function Ie(e) {
+      if (e.match(P) || !e.match(/^-[^-]+/))
         return !1;
       let a = !0, c;
       const n = e.slice(1).split("");
       for (let t = 0; t < n.length; t++) {
-        if (c = e.slice(t + 2), !ue(n[t])) {
+        if (c = e.slice(t + 2), !ce(n[t])) {
           a = !1;
           break;
         }
@@ -457,44 +457,44 @@ class De {
       }
       return a;
     }
-    function K(e) {
-      return h["unknown-options-as-args"] && ye(e);
+    function H(e) {
+      return k["unknown-options-as-args"] && ye(e);
     }
     function ye(e) {
-      return e = e.replace(/^-{3,}/, "--"), e.match(Q) || Be(e) ? !1 : !xe(e, /^-+([^=]+?)=[\s\S]*$/, W, /^-+([^=]+?)$/, /^-+([^=]+?)-$/, /^-+([^=]+?\d+)$/, /^-+([^=]+?)\W+.*$/);
+      return e = e.replace(/^-{3,}/, "--"), e.match(P) || Ie(e) ? !1 : !Be(e, /^-+([^=]+?)=[\s\S]*$/, W, /^-+([^=]+?)$/, /^-+([^=]+?)-$/, /^-+([^=]+?\d+)$/, /^-+([^=]+?)\W+.*$/);
     }
     function z(e) {
-      return !g(e, m.bools) && !g(e, m.counts) && `${e}` in q ? q[e] : Ie(Le(e));
+      return !g(e, m.bools) && !g(e, m.counts) && `${e}` in q ? q[e] : Le(Me(e));
     }
-    function Ie(e) {
+    function Le(e) {
       return {
-        [L.BOOLEAN]: !0,
-        [L.STRING]: "",
-        [L.NUMBER]: void 0,
-        [L.ARRAY]: []
+        [Q.BOOLEAN]: !0,
+        [Q.STRING]: "",
+        [Q.NUMBER]: void 0,
+        [Q.ARRAY]: []
       }[e];
     }
-    function Le(e) {
-      let a = L.BOOLEAN;
-      return g(e, m.strings) ? a = L.STRING : g(e, m.numbers) ? a = L.NUMBER : g(e, m.bools) ? a = L.BOOLEAN : g(e, m.arrays) && (a = L.ARRAY), a;
+    function Me(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 P(e) {
+    function T(e) {
       return e === void 0;
     }
-    function Me() {
-      Object.keys(m.counts).find((e) => g(e, m.arrays) ? (y = Error(C("Invalid configuration: %s, opts.count excludes opts.array.", e)), !0) : g(e, m.nargs) ? (y = Error(C("Invalid configuration: %s, opts.count excludes opts.narg.", e)), !0) : !1);
+    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);
     }
     return {
       aliases: Object.assign({}, m.aliases),
-      argv: Object.assign(ne, w),
-      configuration: h,
-      defaulted: Object.assign({}, oe),
-      error: y,
+      argv: Object.assign(se, b),
+      configuration: k,
+      defaulted: Object.assign({}, ne),
+      error: M,
       newAliases: Object.assign({}, G)
     };
   }
 }
-function Ee(i) {
+function je(i) {
   const o = [], u = /* @__PURE__ */ Object.create(null);
   let s = !0;
   for (Object.keys(i).forEach(function(r) {
@@ -503,16 +503,16 @@ function Ee(i) {
     s = !1;
     for (let r = 0; r < o.length; r++)
       for (let _ = r + 1; _ < o.length; _++)
-        if (o[r].filter(function(h) {
-          return o[_].indexOf(h) !== -1;
+        if (o[r].filter(function(k) {
+          return o[_].indexOf(k) !== -1;
         }).length) {
           o[r] = o[r].concat(o[_]), o.splice(_, 1), s = !0;
           break;
         }
   }
   return o.forEach(function(r) {
-    r = r.filter(function(k, h, q) {
-      return q.indexOf(k) === h;
+    r = r.filter(function(h, k, q) {
+      return q.indexOf(h) === k;
     });
     const _ = r.pop();
     _ !== void 0 && typeof _ == "string" && (u[_] = r);
@@ -521,10 +521,10 @@ function Ee(i) {
 function Z(i) {
   return i !== void 0 ? i + 1 : 1;
 }
-function ce(i) {
+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;
 }
 /**
@@ -536,42 +536,42 @@ function je(i) {
  * SPDX-License-Identifier: ISC
  */
 var X, ee, te;
-const pe = process && process.env && process.env.YARGS_MIN_NODE_VERSION ? Number(process.env.YARGS_MIN_NODE_VERSION) : 12, le = (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);
-if (le && Number(le.match(/^([^.]+)/)[1]) < pe)
-  throw Error(`yargs parser supports a minimum Node.js version of ${pe}. Read our version support policy: https://github.com/yargs/yargs-parser#supported-nodejs-versions`);
-const Ve = process ? process.env : {};
+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);
+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 Fe = process ? process.env : {};
 new De({
   cwd: process.cwd,
-  env: () => Ve,
-  format: _e,
+  env: () => Fe,
+  format: ke,
   normalize: Qe,
-  resolve: ae,
+  resolve: ie,
   // TODO: figure  out a  way to combine ESM and CJS coverage, such  that
   // we can exercise all the lines below:
   require: (i) => {
     if (typeof require < "u")
       return require(i);
     if (i.match(/\.json$/))
-      return JSON.parse(ke(i, "utf8"));
+      return JSON.parse(ge(i, "utf8"));
     throw Error("only .json config files are supported in ESM");
   }
 });
-const Fe = {
+const Ke = {
   fs: {
-    readFileSync: ke,
-    writeFile: Ae
+    readFileSync: ge,
+    writeFile: Pe
   },
-  format: _e,
-  resolve: ae,
+  format: ke,
+  resolve: ie,
   exists: (i) => {
     try {
-      return Pe(i).isFile();
+      return Te(i).isFile();
     } catch {
       return !1;
     }
   }
 };
-let I;
+let A;
 class He {
   constructor(o) {
     o = o || {}, this.directory = o.directory || "./locales", this.updateFiles = typeof o.updateFiles == "boolean" ? o.updateFiles : !0, this.locale = o.locale || "en", this.fallbackToLanguage = typeof o.fallbackToLanguage == "boolean" ? o.fallbackToLanguage : !0, this.cache = /* @__PURE__ */ Object.create(null), this.writeQueue = [];
@@ -587,15 +587,15 @@ class He {
       directory: this.directory,
       locale: this.locale,
       cb: s
-    })) : s(), I.format.apply(I.format, [this.cache[this.locale][u] || u].concat(o));
+    })) : s(), A.format.apply(A.format, [this.cache[this.locale][u] || u].concat(o));
   }
   __n() {
     const o = Array.prototype.slice.call(arguments), u = o.shift(), s = o.shift(), r = o.shift();
     let _ = function() {
     };
     typeof o[o.length - 1] == "function" && (_ = o.pop()), this.cache[this.locale] || this._readLocaleFile();
-    let k = r === 1 ? u : s;
-    this.cache[this.locale][u] && (k = this.cache[this.locale][u][r === 1 ? "one" : "other"]), !this.cache[this.locale][u] && this.updateFiles ? (this.cache[this.locale][u] = {
+    let h = r === 1 ? u : s;
+    this.cache[this.locale][u] && (h = this.cache[this.locale][u][r === 1 ? "one" : "other"]), !this.cache[this.locale][u] && this.updateFiles ? (this.cache[this.locale][u] = {
       one: u,
       other: s
     }, this._enqueueWrite({
@@ -603,8 +603,8 @@ class He {
       locale: this.locale,
       cb: _
     })) : _();
-    const h = [k];
-    return ~k.indexOf("%d") && h.push(r), I.format.apply(I.format, h.concat(o));
+    const k = [h];
+    return ~h.indexOf("%d") && k.push(r), A.format.apply(A.format, k.concat(o));
   }
   setLocale(o) {
     this.locale = o;
@@ -620,16 +620,16 @@ class He {
   _taggedLiteral(o, ...u) {
     let s = "";
     return o.forEach(function(r, _) {
-      const k = u[_ + 1];
-      s += r, typeof k < "u" && (s += "%s");
+      const h = u[_ + 1];
+      s += r, typeof h < "u" && (s += "%s");
     }), this.__.apply(this, [s].concat([].slice.call(u, 1)));
   }
   _enqueueWrite(o) {
     this.writeQueue.push(o), this.writeQueue.length === 1 && this._processWriteQueue();
   }
   _processWriteQueue() {
-    const o = this, u = this.writeQueue[0], s = u.directory, r = u.locale, _ = u.cb, k = this._resolveLocaleFile(s, r), h = JSON.stringify(this.cache[r], null, 2);
-    I.fs.writeFile(k, h, "utf-8", function(q) {
+    const o = this, u = this.writeQueue[0], s = u.directory, r = u.locale, _ = u.cb, h = this._resolveLocaleFile(s, r), k = JSON.stringify(this.cache[r], null, 2);
+    A.fs.writeFile(h, k, "utf-8", function(q) {
       o.writeQueue.shift(), o.writeQueue.length > 0 && o._processWriteQueue(), _(q);
     });
   }
@@ -637,7 +637,7 @@ class He {
     let o = {};
     const u = this._resolveLocaleFile(this.directory, this.locale);
     try {
-      I.fs.readFileSync && (o = JSON.parse(I.fs.readFileSync(u, "utf-8")));
+      A.fs.readFileSync && (o = JSON.parse(A.fs.readFileSync(u, "utf-8")));
     } catch (s) {
       if (s instanceof SyntaxError && (s.message = "syntax error in " + u), s.code === "ENOENT")
         o = {};
@@ -647,19 +647,19 @@ class He {
     this.cache[this.locale] = o;
   }
   _resolveLocaleFile(o, u) {
-    let s = I.resolve(o, "./", u + ".json");
+    let s = A.resolve(o, "./", u + ".json");
     if (this.fallbackToLanguage && !this._fileExistsSync(s) && ~u.lastIndexOf("_")) {
-      const r = I.resolve(o, "./", u.split("_")[0] + ".json");
+      const r = A.resolve(o, "./", u.split("_")[0] + ".json");
       this._fileExistsSync(r) && (s = r);
     }
     return s;
   }
   _fileExistsSync(o) {
-    return I.exists(o);
+    return A.exists(o);
   }
 }
-function Ke(i, o) {
-  I = o;
+function $e(i, o) {
+  A = o;
   const u = new He(i);
   return {
     __: u.__.bind(u),
@@ -670,19 +670,19 @@ function Ke(i, o) {
     locale: u.locale
   };
 }
-const $e = (i) => Ke(i, Fe);
-let D;
+const We = (i) => $e(i, Ke);
+let E;
 try {
-  D = Te(import.meta.url);
+  E = Se(import.meta.url);
 } catch {
-  D = process.cwd();
+  E = process.cwd();
 }
-const We = D.substring(0, D.lastIndexOf("node_modules"));
-We || process.cwd(), process.cwd, process.exit, process.nextTick, typeof process.stdout.columns < "u" && process.stdout.columns, $e({
-  directory: ae(D, "../../../locales"),
+const Ue = E.substring(0, E.lastIndexOf("node_modules"));
+Ue || process.cwd(), process.cwd, process.exit, process.nextTick, typeof process.stdout.columns < "u" && process.stdout.columns, We({
+  directory: ie(E, "../../../locales"),
   updateFiles: !1
 });
-const ie = [
+const oe = [
   {
     id: "anthropic",
     name: "Anthropic",
@@ -1022,6 +1022,66 @@ const ie = [
           output_mtok: 25
         }
       },
+      {
+        id: "claude-opus-4-6",
+        name: "Claude Opus 4.6",
+        description: "Most intelligent model with adaptive thinking and 1M context beta",
+        match: {
+          or: [
+            {
+              starts_with: "claude-opus-4-6"
+            },
+            {
+              starts_with: "claude-opus-4.6"
+            },
+            {
+              starts_with: "claude-4-6-opus"
+            },
+            {
+              starts_with: "claude-4.6-opus"
+            }
+          ]
+        },
+        context_window: 2e5,
+        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
+              }
+            ]
+          }
+        }
+      },
       {
         id: "claude-sonnet-4-0",
         name: "Claude Sonnet 4",
@@ -2856,6 +2916,20 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.9
         }
       },
+      {
+        id: "deepseek-v3p2",
+        name: "Deepseek V3.2",
+        description: "Model from Deepseek that harmonizes high computational efficiency with superior reasoning and agent performance. 675B parameter MoE model.",
+        match: {
+          equals: "accounts/fireworks/models/deepseek-v3p2"
+        },
+        context_window: 163840,
+        prices: {
+          input_mtok: 0.56,
+          cache_read_mtok: 0.28,
+          output_mtok: 1.68
+        }
+      },
       {
         id: "gemma-3-27b-it",
         name: "Gemma 3 27B Instruct",
@@ -2869,6 +2943,61 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.1
         }
       },
+      {
+        id: "glm-4p7",
+        name: "GLM-4.7",
+        description: "Next-generation general-purpose model from Z.ai optimized for coding, reasoning, and agentic workflows. 352B parameter MoE model with advanced thinking controls.",
+        match: {
+          equals: "accounts/fireworks/models/glm-4p7"
+        },
+        context_window: 202752,
+        prices: {
+          input_mtok: 0.6,
+          output_mtok: 2.2
+        }
+      },
+      {
+        id: "gpt-oss-120b",
+        name: "OpenAI gpt-oss-120b",
+        description: "OpenAI's open-weight 117B parameter MoE model designed for production, general purpose, high reasoning use-cases. Features powerful reasoning, agentic tasks, and versatile developer use cases.",
+        match: {
+          equals: "accounts/fireworks/models/gpt-oss-120b"
+        },
+        context_window: 131072,
+        prices: {
+          input_mtok: 0.15,
+          cache_read_mtok: 0.07,
+          output_mtok: 0.6
+        }
+      },
+      {
+        id: "gpt-oss-20b",
+        name: "OpenAI gpt-oss-20b",
+        description: "OpenAI's open-weight 21.5B parameter model designed for powerful reasoning, agentic tasks, and versatile developer use cases. Optimized for lower latency and local or specialized tasks.",
+        match: {
+          equals: "accounts/fireworks/models/gpt-oss-20b"
+        },
+        context_window: 131072,
+        prices: {
+          input_mtok: 0.07,
+          cache_read_mtok: 0.04,
+          output_mtok: 0.3
+        }
+      },
+      {
+        id: "kimi-k2p5",
+        name: "Kimi K2.5",
+        description: "Moonshot AI's flagship agentic model. Unifies vision and text, thinking and non-thinking modes, and single-agent and multi-agent execution into one model. 1T parameter MoE model.",
+        match: {
+          equals: "accounts/fireworks/models/kimi-k2p5"
+        },
+        context_window: 262144,
+        prices: {
+          input_mtok: 0.6,
+          cache_read_mtok: 0.1,
+          output_mtok: 3
+        }
+      },
       {
         id: "llama-v3p1-8b-instruct",
         name: "Llama 3.1 8B Instruct",
@@ -2896,6 +3025,19 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.88
         }
       },
+      {
+        id: "minimax-m2p1",
+        name: "MiniMax-M2.1",
+        description: "Built for strong real-world performance across complex, multi-language, and agent-driven workflows. 228B parameter model with robust support for systems, backend, web, mobile, and office-style tasks.",
+        match: {
+          equals: "accounts/fireworks/models/minimax-m2p1"
+        },
+        context_window: 204800,
+        prices: {
+          input_mtok: 0.3,
+          output_mtok: 1.2
+        }
+      },
       {
         id: "qwen2p5-vl-72b-instruct",
         name: "Qwen2.5-VL 72B Instruct",
@@ -3168,7 +3310,16 @@ Compared to other leading proprietary and open-weights models Command A delivers
               contains: "claude-4-opus"
             },
             {
-              contains: "claude-opus-4"
+              contains: "claude-opus-4@"
+            },
+            {
+              contains: "claude-opus-4-0"
+            },
+            {
+              contains: "claude-opus-4-1"
+            },
+            {
+              equals: "claude-opus-4"
             }
           ]
         },
@@ -3200,6 +3351,64 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 15
         }
       },
+      {
+        id: "claude-opus-4-6",
+        match: {
+          or: [
+            {
+              contains: "claude-4-6-opus"
+            },
+            {
+              contains: "claude-opus-4-6"
+            },
+            {
+              contains: "claude-4.6-opus"
+            },
+            {
+              contains: "claude-opus-4.6"
+            }
+          ]
+        },
+        context_window: 2e5,
+        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
+              }
+            ]
+          }
+        }
+      },
       {
         id: "gemini-1.0-pro-vision-001",
         name: "gemini 1.0 pro vision",
@@ -9673,6 +9882,12 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "gpt-5.1-codex"
             },
+            {
+              equals: "gpt-5.1-codex-max"
+            },
+            {
+              equals: "gpt-5.1-chat"
+            },
             {
               equals: "gpt-5.1-chat-latest"
             },
@@ -9685,6 +9900,12 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "gpt-5-1-codex"
             },
+            {
+              equals: "gpt-5-1-codex-max"
+            },
+            {
+              equals: "gpt-5-1-chat"
+            },
             {
               equals: "gpt-5-1-chat-latest"
             }
@@ -9741,8 +9962,23 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "gpt-5-2-2025-12-11"
             },
+            {
+              equals: "gpt-5.2-chat"
+            },
+            {
+              equals: "gpt-5.2-chat-latest"
+            },
+            {
+              equals: "gpt-5-2-chat"
+            },
             {
               equals: "gpt-5-2-chat-latest"
+            },
+            {
+              equals: "gpt-5.2-codex"
+            },
+            {
+              equals: "gpt-5-2-codex"
             }
           ]
         },
@@ -10518,6 +10754,57 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 25
         }
       },
+      {
+        id: "anthropic/claude-opus-4.6",
+        match: {
+          or: [
+            {
+              equals: "anthropic/claude-opus-4.6"
+            },
+            {
+              equals: "anthropic/claude-opus-4.6:beta"
+            }
+          ]
+        },
+        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
+              }
+            ]
+          }
+        }
+      },
       {
         id: "anthropic/claude-sonnet-4.5",
         match: {
@@ -14221,6 +14508,17 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 1.2
         }
       },
+      {
+        id: "moonshotai/kimi-k2.5",
+        name: "Kimi K2.5",
+        match: {
+          equals: "moonshotai/kimi-k2.5"
+        },
+        prices: {
+          input_mtok: 0.6,
+          output_mtok: 3
+        }
+      },
       {
         id: "moonshotai/kimi-vl-a3b-thinking:free",
         match: {
@@ -15647,6 +15945,17 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         prices: {}
       },
+      {
+        id: "qwen/qwen3-max",
+        name: "Qwen 3 Max",
+        match: {
+          equals: "qwen/qwen3-max"
+        },
+        prices: {
+          input_mtok: 1.2,
+          output_mtok: 6
+        }
+      },
       {
         id: "qwen/qwq-32b",
         match: {
@@ -17934,6 +18243,51 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.5
         }
       },
+      {
+        id: "grok-4-fast-non-reasoning",
+        name: "Grok 4 Fast Non-Reasoning",
+        description: "A frontier multimodal model optimized specifically for high-performance agentic tool calling.",
+        match: {
+          or: [
+            {
+              equals: "grok-4-fast-non-reasoning"
+            },
+            {
+              equals: "grok-4-fast-non-reasoning-latest"
+            }
+          ]
+        },
+        context_window: 2e6,
+        prices: {
+          input_mtok: 0.2,
+          cache_read_mtok: 0.05,
+          output_mtok: 0.5
+        }
+      },
+      {
+        id: "grok-4-fast-reasoning",
+        name: "Grok 4 Fast Reasoning",
+        description: "A frontier multimodal model optimized specifically for high-performance agentic tool calling.",
+        match: {
+          or: [
+            {
+              equals: "grok-4-fast"
+            },
+            {
+              equals: "grok-4-fast-reasoning"
+            },
+            {
+              equals: "grok-4-fast-reasoning-latest"
+            }
+          ]
+        },
+        context_window: 2e6,
+        prices: {
+          input_mtok: 0.2,
+          cache_read_mtok: 0.05,
+          output_mtok: 0.5
+        }
+      },
       {
         id: "grok-code-fast-1",
         name: "Grok Code Fast 1",
@@ -17961,7 +18315,7 @@ Compared to other leading proprietary and open-weights models Command A delivers
     ]
   }
 ];
-function Ue(i, o, u) {
+function Ye(i, o, u) {
   if (o <= 0) return 0;
   let s = i.base;
   for (const r of i.tiers)
@@ -17969,25 +18323,25 @@ function Ue(i, o, u) {
   return s * o / 1e6;
 }
 function R(i, o, u, s) {
-  return i === void 0 || o === void 0 ? 0 : typeof i == "number" ? i * o / 1e6 : Ue(i, o, s);
+  return i === void 0 || o === void 0 ? 0 : typeof i == "number" ? i * o / 1e6 : Ye(i, o, s);
 }
-function Ye(i, o) {
+function Je(i, o) {
   let u = 0, s = 0;
-  const r = i.input_tokens ?? 0, _ = i.cache_read_tokens ?? 0, k = i.cache_write_tokens ?? 0, h = i.cache_audio_read_tokens ?? 0, q = i.output_audio_tokens ?? 0;
-  let M = i.input_audio_tokens ?? 0;
-  if (M -= h, M < 0)
+  const r = i.input_tokens ?? 0, _ = i.cache_read_tokens ?? 0, h = i.cache_write_tokens ?? 0, k = i.cache_audio_read_tokens ?? 0, q = i.output_audio_tokens ?? 0;
+  let I = i.input_audio_tokens ?? 0;
+  if (I -= k, I < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than input_audio_tokens");
   let B = i.input_tokens ?? 0;
-  if (B -= _, B -= k, B -= M, B < 0)
+  if (B -= _, B -= h, B -= I, B < 0)
     throw new Error("Uncached text input tokens cannot be negative");
-  let S = _;
-  if (S -= h, S < 0)
+  let y = _;
+  if (y -= k, y < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than cache_read_tokens");
-  u += R(o.input_mtok, B, "input_mtok", r), u += R(o.cache_read_mtok, S, "cache_read_mtok", r), u += R(o.cache_write_mtok, k, "cache_write_mtok", r), u += R(o.input_audio_mtok, M, "input_audio_mtok", r), u += R(o.cache_audio_read_mtok, h, "cache_audio_read_mtok", r);
-  let A = i.output_tokens ?? 0;
-  if (A -= q, A < 0)
+  u += R(o.input_mtok, B, "input_mtok", r), u += R(o.cache_read_mtok, y, "cache_read_mtok", r), u += R(o.cache_write_mtok, h, "cache_write_mtok", r), u += R(o.input_audio_mtok, I, "input_audio_mtok", r), u += R(o.cache_audio_read_mtok, k, "cache_audio_read_mtok", r);
+  let L = i.output_tokens ?? 0;
+  if (L -= q, L < 0)
     throw new Error("output_audio_tokens cannot be greater than output_tokens");
-  s += R(o.output_mtok, A, "output_mtok", r), s += R(o.output_audio_mtok, i.output_audio_tokens, "output_audio_mtok", r);
+  s += R(o.output_mtok, L, "output_mtok", r), s += R(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), {
     input_price: u,
@@ -17995,7 +18349,7 @@ function Ye(i, o) {
     total_price: G
   };
 }
-function Je(i, o) {
+function Ze(i, o) {
   if (!Array.isArray(i.prices))
     return i.prices;
   for (let u = i.prices.length - 1; u >= 0; u--) {
@@ -18006,63 +18360,71 @@ function Je(i, o) {
       if (o >= new Date(r.start_date))
         return s.prices;
     } else {
-      const _ = o.toISOString().slice(11, 19), k = r.start_time, h = r.end_time;
-      if (h < k) {
-        if (_ >= k || _ < h)
+      const _ = o.toISOString().slice(11, 19), h = r.start_time, k = r.end_time;
+      if (k < h) {
+        if (_ >= h || _ < k)
           return s.prices;
-      } else if (_ >= k && _ < h)
+      } else if (_ >= h && _ < k)
         return s.prices;
     }
   }
   return i.prices[0].prices;
 }
-function E(i, o) {
-  return "or" in i ? i.or.some((u) => E(u, o)) : "and" in i ? i.and.every((u) => E(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 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 Ze(i, o) {
+function Xe(i, o) {
   const u = o.toLowerCase().trim(), s = i.find((r) => r.id === u);
-  return s || i.find((r) => r.provider_match && E(r.provider_match, u));
+  return s || i.find((r) => r.provider_match && D(r.provider_match, u));
 }
-function Xe(i, { modelId: o, providerApiUrl: u, providerId: s }) {
-  if (s)
-    return Ze(i, s);
+function he(i, { modelId: o, providerApiUrl: u, providerId: s }) {
+  if (s) {
+    const r = Xe(i, s);
+    if (r || s.toLowerCase() !== "litellm")
+      return r;
+  }
   if (u)
     return i.find((r) => new RegExp(r.api_pattern).test(u));
   if (o)
-    return i.find((r) => r.model_match && E(r.model_match, o));
+    return i.find((r) => r.model_match && D(r.model_match, o));
 }
 function et(i, o) {
-  return i.find((u) => E(u.match, o));
+  return i.find((u) => D(u.match, o));
 }
-function ge(i, o, u) {
+function qe(i, o, u) {
   const s = et(i.models, o);
   if (s) return s;
   if (i.fallback_model_providers && u)
     for (const r of i.fallback_model_providers) {
-      const _ = u.find((k) => k.id === r);
+      const _ = u.find((h) => h.id === r);
       if (_) {
-        const k = ge(_, o);
-        if (k) return k;
+        const h = qe(_, o);
+        if (h) return h;
       }
     }
 }
-let de = ie;
-Promise.resolve(ie);
+let ae = oe;
+Promise.resolve(oe);
 function tt(i, o, u) {
-  const s = o.toLowerCase().trim(), r = u?.provider ?? Xe(de, { modelId: s, providerApiUrl: u?.providerApiUrl, providerId: u?.providerId });
-  if (!r) return null;
-  const _ = ge(r, s, de);
+  let s = o.toLowerCase().trim(), r = u?.providerId;
+  if (r && r.toLowerCase() === "litellm" && s.includes("/")) {
+    const B = s.indexOf("/"), y = s.slice(0, B), L = s.slice(B + 1);
+    y && L && he(ae, { providerId: y }) && (r = y, s = L);
+  }
+  const _ = u?.provider ?? he(ae, { modelId: s, providerApiUrl: u?.providerApiUrl, providerId: r });
   if (!_) return null;
-  const k = u?.timestamp ?? /* @__PURE__ */ new Date(), h = Je(_, k), q = Ye(i, h);
+  const h = qe(_, s, ae);
+  if (!h) return null;
+  const k = u?.timestamp ?? /* @__PURE__ */ new Date(), q = Ze(h, k), I = Je(i, q);
   return {
     auto_update_timestamp: void 0,
-    model: _,
-    model_price: h,
-    provider: r,
-    ...q
+    model: h,
+    model_price: q,
+    provider: _,
+    ...I
   };
 }
-const f = he(Re(process.argv)).scriptName("genai-prices").command(
+const f = _e(ze(process.argv)).scriptName("genai-prices").command(
   "list [provider]",
   "List providers and models",
   (i) => i.positional("provider", { describe: "Provider ID to filter", type: "string" })
@@ -18073,7 +18435,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 = ie;
+    const u = oe;
     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)`);
@@ -18101,25 +18463,25 @@ function at() {
     }, s = f.timestamp ? new Date(String(f.timestamp)) : void 0;
     let r = !1;
     for (const _ of o) {
-      let k, h = _;
-      h.includes(":") && ([k, h] = h.split(":", 2));
+      let h, k = _;
+      k.includes(":") && ([h, k] = k.split(":", 2));
       try {
-        const q = tt(u, h, { providerId: k, timestamp: s });
+        const q = tt(u, k, { providerId: h, timestamp: s });
         if (!q) {
           r = !0, console.error(`No price found for model ${_}`);
           continue;
         }
-        const M = q.model.context_window, B = [
+        const I = 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", M !== void 0 ? M.toLocaleString() : void 0],
+          ["Context Window", I !== void 0 ? I.toLocaleString() : void 0],
           ["Total Price", `$${q.total_price}`],
           ["Input Price", `$${q.input_price}`],
           ["Output Price", `$${q.output_price}`]
         ];
-        for (const [S, A] of B)
-          A !== void 0 && console.log(`${S.padStart(14)}: ${A}`);
+        for (const [y, L] of B)
+          L !== void 0 && console.log(`${y.padStart(14)}: ${L}`);
         console.log("");
       } catch (q) {
         r = !0, q instanceof Error && console.error(`Error for model ${_}:`, q.message);
@@ -18127,6 +18489,6 @@ function at() {
     }
     process.exit(r ? 1 : 0);
   }
-  he().showHelp(), process.exit(1);
+  _e().showHelp(), process.exit(1);
 }
 at();