npm - @pydantic/genai-prices - Versions diffs - 0.0.36 → 0.0.37 - Mend

@pydantic/genai-prices 0.0.36 → 0.0.37

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (4) hide show

package/dist/cli.js CHANGED Viewed

@@ -1,66 +1,66 @@
 #!/usr/bin/env node
 import de from "yargs";
 import { format as he } from "util";
-import { resolve as ae, normalize as Ie } from "path";
+import { resolve as ie, normalize as Ie } from "path";
 import { readFileSync as ke, writeFile as Le, statSync as Pe } from "fs";
 import "assert";
 import { fileURLToPath as Te } from "url";
 function Ae() {
-  return Ge() ? 0 : 1;
-}
-function Ge() {
-  return Se() && !process.defaultApp;
+  return Se() ? 0 : 1;
 }
 function Se() {
+  return Ge() && !process.defaultApp;
+}
+function Ge() {
   return !!process.versions.electron;
 }
-function Ce(i) {
-  return i.slice(Ae() + 1);
+function Ce(a) {
+  return a.slice(Ae() + 1);
 }
 /**
  * @license
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function W(i) {
-  if (i !== i.toLowerCase() && i !== i.toUpperCase() || (i = i.toLowerCase()), i.indexOf("-") === -1 && i.indexOf("_") === -1)
-    return i;
+function W(a) {
+  if (a !== a.toLowerCase() && a !== a.toUpperCase() || (a = a.toLowerCase()), a.indexOf("-") === -1 && a.indexOf("_") === -1)
+    return a;
   {
     let m = "", s = !1;
-    const u = i.match(/^-+/);
-    for (let _ = u ? u[0].length : 0; _ < i.length; _++) {
-      let k = i.charAt(_);
+    const u = a.match(/^-+/);
+    for (let _ = u ? u[0].length : 0; _ < a.length; _++) {
+      let k = a.charAt(_);
       s && (s = !1, k = k.toUpperCase()), _ !== 0 && (k === "-" || k === "_") ? s = !0 : k !== "-" && k !== "_" && (m += k);
     }
     return m;
   }
 }
-function Oe(i, n) {
-  const m = i.toLowerCase();
+function Oe(a, n) {
+  const m = a.toLowerCase();
   n = n || "-";
   let s = "";
-  for (let u = 0; u < i.length; u++) {
-    const _ = m.charAt(u), k = i.charAt(u);
+  for (let u = 0; u < a.length; u++) {
+    const _ = m.charAt(u), k = a.charAt(u);
     _ !== k && u > 0 ? s += `${n}${m.charAt(u)}` : s += k;
   }
   return s;
 }
-function Re(i) {
-  return i == null ? !1 : typeof i == "number" || /^0x[0-9a-f]+$/i.test(i) ? !0 : /^0[^.]/.test(i) ? !1 : /^[-]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(i);
+function Re(a) {
+  return a == null ? !1 : typeof a == "number" || /^0x[0-9a-f]+$/i.test(a) ? !0 : /^0[^.]/.test(a) ? !1 : /^[-]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(a);
 }
 /**
  * @license
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function Ne(i) {
-  if (Array.isArray(i))
-    return i.map((k) => typeof k != "string" ? k + "" : k);
-  i = i.trim();
+function Ee(a) {
+  if (Array.isArray(a))
+    return a.map((k) => typeof k != "string" ? k + "" : k);
+  a = a.trim();
   let n = 0, m = null, s = null, u = null;
   const _ = [];
-  for (let k = 0; k < i.length; k++) {
-    if (m = s, s = i.charAt(k), s === " " && !u) {
+  for (let k = 0; k < a.length; k++) {
+    if (m = s, s = a.charAt(k), s === " " && !u) {
       m !== " " && n++;
       continue;
     }
@@ -74,8 +74,8 @@ function Ne(i) {
  * SPDX-License-Identifier: ISC
  */
 var I;
-(function(i) {
-  i.BOOLEAN = "boolean", i.STRING = "string", i.NUMBER = "number", i.ARRAY = "array";
+(function(a) {
+  a.BOOLEAN = "boolean", a.STRING = "string", a.NUMBER = "number", a.ARRAY = "array";
 })(I || (I = {}));
 /**
  * @license
@@ -83,7 +83,7 @@ var I;
  * SPDX-License-Identifier: ISC
  */
 let A;
-class Ee {
+class Ne {
   constructor(n) {
     A = n;
   }
@@ -105,7 +105,7 @@ class Ee {
       number: void 0,
       __: void 0,
       key: void 0
-    }, m), u = Ne(n), _ = typeof n == "string", k = ze(Object.assign(/* @__PURE__ */ Object.create(null), s.alias)), h = Object.assign({
+    }, m), u = Ee(n), _ = typeof n == "string", k = ze(Object.assign(/* @__PURE__ */ Object.create(null), s.alias)), h = Object.assign({
       "boolean-negation": !0,
       "camel-case-expansion": !0,
       "combine-arrays": !1,
@@ -124,7 +124,7 @@ class Ee {
       "strip-aliased": !1,
       "strip-dashed": !1,
       "unknown-options-as-args": !1
-    }, s.configuration), f = Object.assign(/* @__PURE__ */ Object.create(null), s.default), y = s.configObjects || [], P = s.envPrefix, G = h["populate--"], S = G ? "--" : "_", Q = /* @__PURE__ */ Object.create(null), oe = /* @__PURE__ */ Object.create(null), C = s.__ || A.format, r = {
+    }, s.configuration), f = Object.assign(/* @__PURE__ */ Object.create(null), s.default), y = s.configObjects || [], P = s.envPrefix, S = h["populate--"], G = S ? "--" : "_", Q = /* @__PURE__ */ Object.create(null), oe = /* @__PURE__ */ Object.create(null), C = s.__ || A.format, r = {
       aliases: /* @__PURE__ */ Object.create(null),
       arrays: /* @__PURE__ */ Object.create(null),
       bools: /* @__PURE__ */ Object.create(null),
@@ -138,14 +138,14 @@ class Ee {
       keys: []
     }, L = /^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/, U = new RegExp("^--" + h["negation-prefix"] + "(.+)");
     [].concat(s.array || []).filter(Boolean).forEach(function(e) {
-      const a = typeof e == "object" ? e.key : e, l = Object.keys(e).map(function(o) {
+      const i = typeof e == "object" ? e.key : e, l = Object.keys(e).map(function(o) {
         return {
           boolean: "bools",
           string: "strings",
           number: "numbers"
         }[o];
       }).filter(Boolean).pop();
-      l && (r[l][a] = !0), r.arrays[a] = !0, r.keys.push(a);
+      l && (r[l][i] = !0), r.arrays[i] = !0, r.keys.push(i);
     }), [].concat(s.boolean || []).filter(Boolean).forEach(function(e) {
       r.bools[e] = !0, r.keys.push(e);
     }), [].concat(s.string || []).filter(Boolean).forEach(function(e) {
@@ -156,17 +156,17 @@ class Ee {
       r.counts[e] = !0, r.keys.push(e);
     }), [].concat(s.normalize || []).filter(Boolean).forEach(function(e) {
       r.normalize[e] = !0, r.keys.push(e);
-    }), typeof s.narg == "object" && Object.entries(s.narg).forEach(([e, a]) => {
-      typeof a == "number" && (r.nargs[e] = a, r.keys.push(e));
-    }), typeof s.coerce == "object" && Object.entries(s.coerce).forEach(([e, a]) => {
-      typeof a == "function" && (r.coercions[e] = a, r.keys.push(e));
+    }), typeof s.narg == "object" && Object.entries(s.narg).forEach(([e, i]) => {
+      typeof i == "number" && (r.nargs[e] = i, r.keys.push(e));
+    }), typeof s.coerce == "object" && Object.entries(s.coerce).forEach(([e, i]) => {
+      typeof i == "function" && (r.coercions[e] = i, r.keys.push(e));
     }), typeof s.config < "u" && (Array.isArray(s.config) || typeof s.config == "string" ? [].concat(s.config).filter(Boolean).forEach(function(e) {
       r.configs[e] = !0;
-    }) : typeof s.config == "object" && Object.entries(s.config).forEach(([e, a]) => {
-      (typeof a == "boolean" || typeof a == "function") && (r.configs[e] = a);
+    }) : typeof s.config == "object" && Object.entries(s.config).forEach(([e, i]) => {
+      (typeof i == "boolean" || typeof i == "function") && (r.configs[e] = i);
     })), qe(s.key, k, s.default, r.arrays), Object.keys(f).forEach(function(e) {
-      (r.aliases[e] || []).forEach(function(a) {
-        f[a] = f[e];
+      (r.aliases[e] || []).forEach(function(i) {
+        f[i] = f[e];
       });
     });
     let B = null;
@@ -174,28 +174,28 @@ class Ee {
     let F = [];
     const w = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), ne = {};
     for (let e = 0; e < u.length; e++) {
-      const a = u[e], l = a.replace(/^-{3,}/, "---");
+      const i = u[e], l = i.replace(/^-{3,}/, "---");
       let o, t, p, c, d, v;
-      if (a !== "--" && /^-/.test(a) && H(a))
-        K(a);
+      if (i !== "--" && /^-/.test(i) && H(i))
+        K(i);
       else if (l.match(/^---+(=|$)/)) {
-        K(a);
+        K(i);
         continue;
-      } else if (a.match(/^--.+=/) || !h["short-option-groups"] && a.match(/^-.+=/))
-        c = a.match(/^--?([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && (g(c[1], r.arrays) ? e = V(e, c[1], u, c[2]) : g(c[1], r.nargs) !== !1 ? e = D(e, c[1], u, c[2]) : q(c[1], c[2], !0));
-      else if (a.match(U) && h["boolean-negation"])
-        c = a.match(U), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], q(t, g(t, r.arrays) ? [!1] : !1));
-      else if (a.match(/^--.+/) || !h["short-option-groups"] && a.match(/^-[^-]+/))
-        c = a.match(/^--?(.+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
-      else if (a.match(/^-.\..+=/))
-        c = a.match(/^-([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && q(c[1], c[2]);
-      else if (a.match(/^-.\..+/) && !a.match(L))
-        d = u[e + 1], c = a.match(/^-(.\..+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], d !== void 0 && !d.match(/^-/) && !g(t, r.bools) && !g(t, r.counts) ? (q(t, d), e++) : q(t, R(t)));
-      else if (a.match(/^-[^-]+/) && !a.match(L)) {
-        p = a.slice(1, -1).split(""), o = !1;
+      } else if (i.match(/^--.+=/) || !h["short-option-groups"] && i.match(/^-.+=/))
+        c = i.match(/^--?([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && (g(c[1], r.arrays) ? e = V(e, c[1], u, c[2]) : g(c[1], r.nargs) !== !1 ? e = D(e, c[1], u, c[2]) : q(c[1], c[2], !0));
+      else if (i.match(U) && h["boolean-negation"])
+        c = i.match(U), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], q(t, g(t, r.arrays) ? [!1] : !1));
+      else if (i.match(/^--.+/) || !h["short-option-groups"] && i.match(/^-[^-]+/))
+        c = i.match(/^--?(.+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
+      else if (i.match(/^-.\..+=/))
+        c = i.match(/^-([^=]+)=([\s\S]*)$/), c !== null && Array.isArray(c) && c.length >= 3 && q(c[1], c[2]);
+      else if (i.match(/^-.\..+/) && !i.match(L))
+        d = u[e + 1], c = i.match(/^-(.\..+)/), c !== null && Array.isArray(c) && c.length >= 2 && (t = c[1], d !== void 0 && !d.match(/^-/) && !g(t, r.bools) && !g(t, r.counts) ? (q(t, d), e++) : q(t, R(t)));
+      else if (i.match(/^-[^-]+/) && !i.match(L)) {
+        p = i.slice(1, -1).split(""), o = !1;
         for (let x = 0; x < p.length; x++) {
-          if (d = a.slice(x + 2), p[x + 1] && p[x + 1] === "=") {
-            v = a.slice(x + 3), t = p[x], g(t, r.arrays) ? e = V(e, t, u, v) : g(t, r.nargs) !== !1 ? e = D(e, t, u, v) : q(t, v), o = !0;
+          if (d = i.slice(x + 2), p[x + 1] && p[x + 1] === "=") {
+            v = i.slice(x + 3), t = p[x], g(t, r.arrays) ? e = V(e, t, u, v) : g(t, r.nargs) !== !1 ? e = D(e, t, u, v) : q(t, v), o = !0;
             break;
           }
           if (d === "-") {
@@ -212,109 +212,109 @@ class Ee {
           } else
             q(p[x], R(p[x]));
         }
-        t = a.slice(-1)[0], !o && t !== "-" && (g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
-      } else if (a.match(/^-[0-9]$/) && a.match(L) && g(a.slice(1), r.bools))
-        t = a.slice(1), q(t, R(t));
-      else if (a === "--") {
+        t = i.slice(-1)[0], !o && t !== "-" && (g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
+      } else if (i.match(/^-[0-9]$/) && i.match(L) && g(i.slice(1), r.bools))
+        t = i.slice(1), q(t, R(t));
+      else if (i === "--") {
         F = u.slice(e + 1);
         break;
       } else if (h["halt-at-non-option"]) {
         F = u.slice(e);
         break;
       } else
-        K(a);
+        K(i);
     }
     re(w, !0), re(w, !1), _e(w), ge(), me(w, r.aliases, f, !0), fe(w), h["set-placeholder-key"] && be(w), Object.keys(r.counts).forEach(function(e) {
-      N(w, e.split(".")) || q(e, 0);
-    }), G && F.length && (w[S] = []), F.forEach(function(e) {
-      w[S].push(e);
+      E(w, e.split(".")) || q(e, 0);
+    }), S && F.length && (w[G] = []), F.forEach(function(e) {
+      w[G].push(e);
     }), h["camel-case-expansion"] && h["strip-dashed"] && Object.keys(w).filter((e) => e !== "--" && e.includes("-")).forEach((e) => {
       delete w[e];
     }), h["strip-aliased"] && [].concat(...Object.keys(k).map((e) => k[e])).forEach((e) => {
-      h["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((a) => W(a)).join(".")], delete w[e];
+      h["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((i) => W(i)).join(".")], delete w[e];
     });
     function K(e) {
-      const a = $("_", e);
-      (typeof a == "string" || typeof a == "number") && w._.push(a);
+      const i = $("_", e);
+      (typeof i == "string" || typeof i == "number") && w._.push(i);
     }
-    function D(e, a, l, o) {
-      let t, p = g(a, r.nargs);
+    function D(e, i, l, o) {
+      let t, p = g(i, r.nargs);
       if (p = typeof p != "number" || isNaN(p) ? 1 : p, p === 0)
-        return T(o) || (B = Error(C("Argument unexpected for: %s", a))), q(a, R(a)), e;
+        return T(o) || (B = Error(C("Argument unexpected for: %s", i))), q(i, R(i)), e;
       let c = T(o) ? 0 : 1;
       if (h["nargs-eats-options"])
-        l.length - (e + 1) + c < p && (B = Error(C("Not enough arguments following: %s", a))), c = p;
+        l.length - (e + 1) + c < p && (B = Error(C("Not enough arguments following: %s", i))), c = p;
       else {
         for (t = e + 1; t < l.length && (!l[t].match(/^-[^0-9]/) || l[t].match(L) || H(l[t])); t++)
           c++;
-        c < p && (B = Error(C("Not enough arguments following: %s", a)));
+        c < p && (B = Error(C("Not enough arguments following: %s", i)));
       }
       let d = Math.min(c, p);
-      for (!T(o) && d > 0 && (q(a, o), d--), t = e + 1; t < d + e + 1; t++)
-        q(a, l[t]);
+      for (!T(o) && d > 0 && (q(i, o), d--), t = e + 1; t < d + e + 1; t++)
+        q(i, l[t]);
       return e + d;
     }
-    function V(e, a, l, o) {
+    function V(e, i, l, o) {
       let t = [], p = o || l[e + 1];
-      const c = g(a, r.nargs);
-      if (g(a, r.bools) && !/^(true|false)$/.test(p))
+      const c = g(i, r.nargs);
+      if (g(i, r.bools) && !/^(true|false)$/.test(p))
         t.push(!0);
       else if (T(p) || T(o) && /^-/.test(p) && !L.test(p) && !H(p)) {
-        if (f[a] !== void 0) {
-          const d = f[a];
+        if (f[i] !== void 0) {
+          const d = f[i];
           t = Array.isArray(d) ? d : [d];
         }
       } else {
-        T(o) || t.push(Y(a, o, !0));
+        T(o) || t.push(Y(i, o, !0));
         for (let d = e + 1; d < l.length && !(!h["greedy-arrays"] && t.length > 0 || c && typeof c == "number" && t.length >= c || (p = l[d], /^-/.test(p) && !L.test(p) && !H(p))); d++)
-          e = d, t.push(Y(a, p, _));
+          e = d, t.push(Y(i, p, _));
       }
-      return typeof c == "number" && (c && t.length < c || isNaN(c) && t.length === 0) && (B = Error(C("Not enough arguments following: %s", a))), q(a, t), e;
+      return typeof c == "number" && (c && t.length < c || isNaN(c) && t.length === 0) && (B = Error(C("Not enough arguments following: %s", i))), q(i, t), e;
     }
-    function q(e, a, l = _) {
+    function q(e, i, l = _) {
       if (/-/.test(e) && h["camel-case-expansion"]) {
         const p = e.split(".").map(function(c) {
           return W(c);
         }).join(".");
         se(e, p);
       }
-      const o = Y(e, a, l), t = e.split(".");
-      E(w, t, o), r.aliases[e] && r.aliases[e].forEach(function(p) {
+      const o = Y(e, i, l), t = e.split(".");
+      N(w, t, o), r.aliases[e] && r.aliases[e].forEach(function(p) {
         const c = p.split(".");
-        E(w, c, o);
+        N(w, c, o);
       }), t.length > 1 && h["dot-notation"] && (r.aliases[t[0]] || []).forEach(function(p) {
         let c = p.split(".");
         const d = [].concat(t);
-        d.shift(), c = c.concat(d), (r.aliases[e] || []).includes(c.join(".")) || E(w, c, o);
+        d.shift(), c = c.concat(d), (r.aliases[e] || []).includes(c.join(".")) || N(w, c, o);
       }), g(e, r.normalize) && !g(e, r.arrays) && [e].concat(r.aliases[e] || []).forEach(function(c) {
         Object.defineProperty(ne, c, {
           enumerable: !0,
           get() {
-            return a;
+            return i;
           },
           set(d) {
-            a = typeof d == "string" ? A.normalize(d) : d;
+            i = typeof d == "string" ? A.normalize(d) : d;
           }
         });
       });
     }
-    function se(e, a) {
-      r.aliases[e] && r.aliases[e].length || (r.aliases[e] = [a], Q[a] = !0), r.aliases[a] && r.aliases[a].length || se(a, e);
+    function se(e, i) {
+      r.aliases[e] && r.aliases[e].length || (r.aliases[e] = [i], Q[i] = !0), r.aliases[i] && r.aliases[i].length || se(i, e);
     }
-    function Y(e, a, l) {
-      l && (a = je(a)), (g(e, r.bools) || g(e, r.counts)) && typeof a == "string" && (a = a === "true");
-      let o = Array.isArray(a) ? a.map(function(t) {
+    function Y(e, i, l) {
+      l && (i = je(i)), (g(e, r.bools) || g(e, r.counts)) && typeof i == "string" && (i = i === "true");
+      let o = Array.isArray(i) ? i.map(function(t) {
         return $(e, t);
-      }) : $(e, a);
-      return g(e, r.counts) && (T(o) || typeof o == "boolean") && (o = Z()), g(e, r.normalize) && g(e, r.arrays) && (Array.isArray(a) ? o = a.map((t) => A.normalize(t)) : o = A.normalize(a)), o;
+      }) : $(e, i);
+      return g(e, r.counts) && (T(o) || typeof o == "boolean") && (o = Z()), g(e, r.normalize) && g(e, r.arrays) && (Array.isArray(i) ? o = i.map((t) => A.normalize(t)) : o = A.normalize(i)), o;
     }
-    function $(e, a) {
-      return !h["parse-positional-numbers"] && e === "_" || !g(e, r.strings) && !g(e, r.bools) && !Array.isArray(a) && (Re(a) && h["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${a}`))) || !T(a) && g(e, r.numbers)) && (a = Number(a)), a;
+    function $(e, i) {
+      return !h["parse-positional-numbers"] && e === "_" || !g(e, r.strings) && !g(e, r.bools) && !Array.isArray(i) && (Re(i) && h["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${i}`))) || !T(i) && g(e, r.numbers)) && (i = Number(i)), i;
     }
     function _e(e) {
-      const a = /* @__PURE__ */ Object.create(null);
-      me(a, r.aliases, f), Object.keys(r.configs).forEach(function(l) {
-        const o = e[l] || a[l];
+      const i = /* @__PURE__ */ Object.create(null);
+      me(i, r.aliases, f), Object.keys(r.configs).forEach(function(l) {
+        const o = e[l] || i[l];
         if (o)
           try {
             let t = null;
@@ -337,10 +337,10 @@ class Ee {
           }
       });
     }
-    function J(e, a) {
+    function J(e, i) {
       Object.keys(e).forEach(function(l) {
-        const o = e[l], t = a ? a + "." + l : l;
-        typeof o == "object" && o !== null && !Array.isArray(o) && h["dot-notation"] ? J(o, t) : (!N(w, t.split(".")) || g(t, r.arrays) && h["combine-arrays"]) && q(t, o);
+        const o = e[l], t = i ? i + "." + l : l;
+        typeof o == "object" && o !== null && !Array.isArray(o) && h["dot-notation"] ? J(o, t) : (!E(w, t.split(".")) || g(t, r.arrays) && h["combine-arrays"]) && q(t, o);
       });
     }
     function ge() {
@@ -348,7 +348,7 @@ class Ee {
         J(e);
       });
     }
-    function re(e, a) {
+    function re(e, i) {
       if (typeof P > "u")
         return;
       const l = typeof P == "string" ? P : "", o = A.env();
@@ -357,17 +357,17 @@ class Ee {
           const p = t.split("__").map(function(c, d) {
             return d === 0 && (c = c.substring(l.length)), W(c);
           });
-          (a && r.configs[p.join(".")] || !a) && !N(e, p) && q(p.join("."), o[t]);
+          (i && r.configs[p.join(".")] || !i) && !E(e, p) && q(p.join("."), o[t]);
         }
       });
     }
     function fe(e) {
-      let a;
+      let i;
       const l = /* @__PURE__ */ new Set();
       Object.keys(e).forEach(function(o) {
-        if (!l.has(o) && (a = g(o, r.coercions), typeof a == "function"))
+        if (!l.has(o) && (i = g(o, r.coercions), typeof i == "function"))
           try {
-            const t = $(o, a(e[o]));
+            const t = $(o, i(e[o]));
             [].concat(r.aliases[o] || [], o).forEach((p) => {
               l.add(p), e[p] = t;
             });
@@ -377,37 +377,37 @@ class Ee {
       });
     }
     function be(e) {
-      return r.keys.forEach((a) => {
-        ~a.indexOf(".") || typeof e[a] > "u" && (e[a] = void 0);
+      return r.keys.forEach((i) => {
+        ~i.indexOf(".") || typeof e[i] > "u" && (e[i] = void 0);
       }), e;
     }
-    function me(e, a, l, o = !1) {
+    function me(e, i, l, o = !1) {
       Object.keys(l).forEach(function(t) {
-        N(e, t.split(".")) || (E(e, t.split("."), l[t]), o && (oe[t] = !0), (a[t] || []).forEach(function(p) {
-          N(e, p.split(".")) || E(e, p.split("."), l[t]);
+        E(e, t.split(".")) || (N(e, t.split("."), l[t]), o && (oe[t] = !0), (i[t] || []).forEach(function(p) {
+          E(e, p.split(".")) || N(e, p.split("."), l[t]);
         }));
       });
     }
-    function N(e, a) {
+    function E(e, i) {
       let l = e;
-      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(t) {
+      h["dot-notation"] || (i = [i.join(".")]), i.slice(0, -1).forEach(function(t) {
         l = l[t] || {};
       });
-      const o = a[a.length - 1];
+      const o = i[i.length - 1];
       return typeof l != "object" ? !1 : o in l;
     }
-    function E(e, a, l) {
+    function N(e, i, l) {
       let o = e;
-      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(v) {
+      h["dot-notation"] || (i = [i.join(".")]), i.slice(0, -1).forEach(function(v) {
         v = le(v), typeof o == "object" && o[v] === void 0 && (o[v] = {}), typeof o[v] != "object" || Array.isArray(o[v]) ? (Array.isArray(o[v]) ? o[v].push({}) : o[v] = [o[v], {}], o = o[v][o[v].length - 1]) : o = o[v];
       });
-      const t = le(a[a.length - 1]), p = g(a.join("."), r.arrays), c = Array.isArray(l);
+      const t = le(i[i.length - 1]), p = g(i.join("."), r.arrays), c = Array.isArray(l);
       let d = h["duplicate-arguments-array"];
       !d && g(t, r.nargs) && (d = !0, (!T(o[t]) && r.nargs[t] === 1 || Array.isArray(o[t]) && o[t].length === r.nargs[t]) && (o[t] = void 0)), l === Z() ? o[t] = Z(o[t]) : Array.isArray(o[t]) ? d && p && c ? o[t] = h["flatten-duplicate-arrays"] ? o[t].concat(l) : (Array.isArray(o[t][0]) ? o[t] : [o[t]]).concat([l]) : !d && !!p == !!c ? o[t] = l : o[t] = o[t].concat([l]) : o[t] === void 0 && p ? o[t] = c ? l : [l] : d && !(o[t] === void 0 || g(t, r.counts) || g(t, r.bools)) ? o[t] = [o[t], l] : o[t] = l;
     }
     function qe(...e) {
-      e.forEach(function(a) {
-        Object.keys(a || {}).forEach(function(l) {
+      e.forEach(function(i) {
+        Object.keys(i || {}).forEach(function(l) {
           r.aliases[l] || (r.aliases[l] = [].concat(k[l] || []), r.aliases[l].concat(l).forEach(function(o) {
             if (/-/.test(o) && h["camel-case-expansion"]) {
               const t = W(o);
@@ -426,18 +426,18 @@ class Ee {
         });
       });
     }
-    function g(e, a) {
-      const l = [].concat(r.aliases[e] || [], e), o = Object.keys(a), t = l.find((p) => o.includes(p));
-      return t ? a[t] : !1;
+    function g(e, i) {
+      const l = [].concat(r.aliases[e] || [], e), o = Object.keys(i), t = l.find((p) => o.includes(p));
+      return t ? i[t] : !1;
     }
     function ue(e) {
-      const a = Object.keys(r);
-      return [].concat(a.map((o) => r[o])).some(function(o) {
+      const i = Object.keys(r);
+      return [].concat(i.map((o) => r[o])).some(function(o) {
         return Array.isArray(o) ? o.includes(e) : o[e];
       });
     }
-    function we(e, ...a) {
-      return [].concat(...a).some(function(o) {
+    function we(e, ...i) {
+      return [].concat(...i).some(function(o) {
         const t = e.match(o);
         return t && ue(t[1]);
       });
@@ -445,17 +445,17 @@ class Ee {
     function ve(e) {
       if (e.match(L) || !e.match(/^-[^-]+/))
         return !1;
-      let a = !0, l;
+      let i = !0, l;
       const o = e.slice(1).split("");
       for (let t = 0; t < o.length; t++) {
         if (l = e.slice(t + 2), !ue(o[t])) {
-          a = !1;
+          i = !1;
           break;
         }
         if (o[t + 1] && o[t + 1] === "=" || l === "-" || /[A-Za-z]/.test(o[t]) && /^-?\d+(\.\d*)?(e-?\d+)?$/.test(l) || o[t + 1] && o[t + 1].match(/\W/))
           break;
       }
-      return a;
+      return i;
     }
     function H(e) {
       return h["unknown-options-as-args"] && xe(e);
@@ -475,8 +475,8 @@ class Ee {
       }[e];
     }
     function Be(e) {
-      let a = I.BOOLEAN;
-      return g(e, r.strings) ? a = I.STRING : g(e, r.numbers) ? a = I.NUMBER : g(e, r.bools) ? a = I.BOOLEAN : g(e, r.arrays) && (a = I.ARRAY), a;
+      let i = I.BOOLEAN;
+      return g(e, r.strings) ? i = I.STRING : g(e, r.numbers) ? i = I.NUMBER : g(e, r.bools) ? i = I.BOOLEAN : g(e, r.arrays) && (i = I.ARRAY), i;
     }
     function T(e) {
       return e === void 0;
@@ -494,11 +494,11 @@ class Ee {
     };
   }
 }
-function ze(i) {
+function ze(a) {
   const n = [], m = /* @__PURE__ */ Object.create(null);
   let s = !0;
-  for (Object.keys(i).forEach(function(u) {
-    n.push([].concat(i[u], u));
+  for (Object.keys(a).forEach(function(u) {
+    n.push([].concat(a[u], u));
   }); s; ) {
     s = !1;
     for (let u = 0; u < n.length; u++)
@@ -518,14 +518,14 @@ function ze(i) {
     _ !== void 0 && typeof _ == "string" && (m[_] = u);
   }), m;
 }
-function Z(i) {
-  return i !== void 0 ? i + 1 : 1;
+function Z(a) {
+  return a !== void 0 ? a + 1 : 1;
 }
-function le(i) {
-  return i === "__proto__" ? "___proto___" : i;
+function le(a) {
+  return a === "__proto__" ? "___proto___" : a;
 }
-function je(i) {
-  return typeof i == "string" && (i[0] === "'" || i[0] === '"') && i[i.length - 1] === i[0] ? i.substring(1, i.length - 1) : i;
+function je(a) {
+  return typeof a == "string" && (a[0] === "'" || a[0] === '"') && a[a.length - 1] === a[0] ? a.substring(1, a.length - 1) : a;
 }
 /**
  * @fileoverview Main entrypoint for libraries using yargs-parser in Node.js
@@ -540,19 +540,19 @@ const ce = process && process.env && process.env.YARGS_MIN_NODE_VERSION ? Number
 if (pe && Number(pe.match(/^([^.]+)/)[1]) < ce)
   throw Error(`yargs parser supports a minimum Node.js version of ${ce}. Read our version support policy: https://github.com/yargs/yargs-parser#supported-nodejs-versions`);
 const Qe = process ? process.env : {};
-new Ee({
+new Ne({
   cwd: process.cwd,
   env: () => Qe,
   format: he,
   normalize: Ie,
-  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) => {
+  require: (a) => {
     if (typeof require < "u")
-      return require(i);
-    if (i.match(/\.json$/))
-      return JSON.parse(ke(i, "utf8"));
+      return require(a);
+    if (a.match(/\.json$/))
+      return JSON.parse(ke(a, "utf8"));
     throw Error("only .json config files are supported in ESM");
   }
 });
@@ -562,10 +562,10 @@ const Fe = {
     writeFile: Le
   },
   format: he,
-  resolve: ae,
-  exists: (i) => {
+  resolve: ie,
+  exists: (a) => {
     try {
-      return Pe(i).isFile();
+      return Pe(a).isFile();
     } catch {
       return !1;
     }
@@ -658,9 +658,9 @@ class De {
     return M.exists(n);
   }
 }
-function Ve(i, n) {
+function Ve(a, n) {
   M = n;
-  const m = new De(i);
+  const m = new De(a);
   return {
     __: m.__.bind(m),
     __n: m.__n.bind(m),
@@ -670,7 +670,7 @@ function Ve(i, n) {
     locale: m.locale
   };
 }
-const $e = (i) => Ve(i, Fe);
+const $e = (a) => Ve(a, Fe);
 let z;
 try {
   z = Te(import.meta.url);
@@ -679,10 +679,10 @@ try {
 }
 const He = z.substring(0, z.lastIndexOf("node_modules"));
 He || process.cwd(), process.cwd, process.exit, process.nextTick, typeof process.stdout.columns < "u" && process.stdout.columns, $e({
-  directory: ae(z, "../../../locales"),
+  directory: ie(z, "../../../locales"),
   updateFiles: !1
 });
-const ie = [
+const ae = [
   {
     id: "anthropic",
     name: "Anthropic",
@@ -881,6 +881,12 @@ const ie = [
             {
               starts_with: "claude-haiku-4-5"
             },
+            {
+              starts_with: "claude-haiku-4.5"
+            },
+            {
+              starts_with: "claude-4-5-haiku"
+            },
             {
               starts_with: "claude-4.5-haiku"
             }
@@ -894,6 +900,28 @@ const ie = [
           output_mtok: 5
         }
       },
+      {
+        id: "claude-instant-1",
+        description: "Retired, here to match price sources",
+        match: {
+          equals: "claude-instant-1"
+        },
+        prices: {
+          input_mtok: 1.63,
+          output_mtok: 55.1
+        }
+      },
+      {
+        id: "claude-instant-1.2",
+        description: "Retired, here to match price sources",
+        match: {
+          equals: "claude-instant-1.2"
+        },
+        prices: {
+          input_mtok: 1.63,
+          output_mtok: 5.51
+        }
+      },
       {
         id: "claude-opus-4-0",
         name: "Claude Opus 4",
@@ -906,6 +934,9 @@ const ie = [
             {
               starts_with: "claude-4-opus"
             },
+            {
+              equals: "claude-opus-4"
+            },
             {
               equals: "claude-opus-4-20250514"
             }
@@ -924,7 +955,14 @@ const ie = [
         name: "Claude Opus 4.1",
         description: "Most intelligent model for complex tasks",
         match: {
-          starts_with: "claude-opus-4-1"
+          or: [
+            {
+              starts_with: "claude-opus-4-1"
+            },
+            {
+              starts_with: "claude-opus-4.1"
+            }
+          ]
         },
         context_window: 2e5,
         prices: {
@@ -970,7 +1008,14 @@ const ie = [
         name: "Claude Sonnet 4.5",
         description: "Most intelligent model for building agents and coding",
         match: {
-          starts_with: "claude-sonnet-4-5"
+          or: [
+            {
+              starts_with: "claude-sonnet-4-5"
+            },
+            {
+              starts_with: "claude-sonnet-4.5"
+            }
+          ]
         },
         context_window: 1e6,
         prices: {
@@ -1011,6 +1056,17 @@ const ie = [
             ]
           }
         }
+      },
+      {
+        id: "claude-v1",
+        description: "Retired, here to match price sources",
+        match: {
+          equals: "claude-v1"
+        },
+        prices: {
+          input_mtok: 8,
+          output_mtok: 24
+        }
       }
     ]
   },
@@ -2670,15 +2726,39 @@ Compared to other leading proprietary and open-weights models Command A delivers
             },
             {
               equals: "gemini-2.5-flash-latest"
+            },
+            {
+              equals: "gemini-2.5-flash-preview-09-2025"
             }
           ]
         },
         prices: {
           input_mtok: 0.3,
-          cache_read_mtok: 0.075,
+          cache_read_mtok: 0.03,
           output_mtok: 2.5,
           input_audio_mtok: 1,
-          cache_audio_read_mtok: 0.25
+          cache_audio_read_mtok: 0.1
+        }
+      },
+      {
+        id: "gemini-2.5-flash-image",
+        name: "Gemini 2.5 Flash Image",
+        description: "Google's specialized image generation model optimized for fast, high-quality image generation. Outputs images at 1024x1024 resolution, with each image consuming 1290 output tokens.",
+        match: {
+          or: [
+            {
+              equals: "gemini-2.5-flash-image"
+            },
+            {
+              equals: "gemini-2.5-flash-image-preview"
+            }
+          ]
+        },
+        context_window: 1e6,
+        price_comments: "See https://ai.google.dev/gemini-api/docs/pricing#gemini-2.5-flash-image. Image output is priced at $30 per 1M tokens, with each 1024x1024 image = 1290 tokens = $0.039/image. Cache pricing is not available for this model.",
+        prices: {
+          input_mtok: 0.3,
+          output_mtok: 30
         }
       },
       {
@@ -2698,10 +2778,10 @@ Compared to other leading proprietary and open-weights models Command A delivers
         context_window: 1e6,
         prices: {
           input_mtok: 0.1,
-          cache_read_mtok: 0.025,
+          cache_read_mtok: 0.01,
           output_mtok: 0.4,
-          input_audio_mtok: 0.5,
-          cache_audio_read_mtok: 0.125
+          input_audio_mtok: 0.3,
+          cache_audio_read_mtok: 0.03
         }
       },
       {
@@ -2711,10 +2791,10 @@ Compared to other leading proprietary and open-weights models Command A delivers
         match: {
           or: [
             {
-              contains: "gemini-2.5-flash-preview"
+              contains: "gemini-2.5-flash-preview-05-20"
             },
             {
-              equals: "gemini-2.5-flash-preview-05-20"
+              contains: "gemini-2.5-flash-preview-04-17"
             },
             {
               equals: "gemini-2.5-flash-preview-05-20:thinking"
@@ -2752,11 +2832,11 @@ Compared to other leading proprietary and open-weights models Command A delivers
             ]
           },
           cache_read_mtok: {
-            base: 0.31,
+            base: 0.125,
             tiers: [
               {
                 start: 2e5,
-                price: 0.625
+                price: 0.25
               }
             ]
           },
@@ -2771,6 +2851,15 @@ Compared to other leading proprietary and open-weights models Command A delivers
           }
         }
       },
+      {
+        id: "gemini-embedding-001",
+        match: {
+          equals: "gemini-embedding-001"
+        },
+        prices: {
+          input_mtok: 0.15
+        }
+      },
       {
         id: "gemini-flash-1.5",
         name: "Gemini 1.5 Flash",
@@ -2848,6 +2937,25 @@ Compared to other leading proprietary and open-weights models Command A delivers
           }
         }
       },
+      {
+        id: "gemini-live-2.5-flash-preview",
+        match: {
+          or: [
+            {
+              starts_with: "gemini-live-2.5-flash-preview"
+            },
+            {
+              starts_with: "gemini-2.5-flash-native-audio-preview"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 0.5,
+          output_mtok: 2,
+          input_audio_mtok: 3,
+          output_audio_mtok: 12
+        }
+      },
       {
         id: "gemini-pro",
         name: "gemini 1.0 pro",
@@ -3999,7 +4107,14 @@ Compared to other leading proprietary and open-weights models Command A delivers
         name: "Codex Mini",
         description: "codex-mini-latest is a fine-tuned version of o4-mini specifically for use in Codex CLI. For direct use in the API, we recommend starting with gpt-4.1.",
         match: {
-          equals: "codex-mini"
+          or: [
+            {
+              equals: "codex-mini"
+            },
+            {
+              equals: "codex-mini-latest"
+            }
+          ]
         },
         prices: {
           input_mtok: 1.5,
@@ -4045,7 +4160,7 @@ Compared to other leading proprietary and open-weights models Command A delivers
         id: "ft:gpt-3.5-turbo-",
         description: "GPT-3.5 Turbo fine tuned.",
         match: {
-          starts_with: "ft:gpt-3.5-turbo-"
+          starts_with: "ft:gpt-3.5-turbo"
         },
         prices: {
           input_mtok: 3,
@@ -4053,10 +4168,10 @@ Compared to other leading proprietary and open-weights models Command A delivers
         }
       },
       {
-        id: "ft:gpt-4o-2024-08-06:",
+        id: "ft:gpt-4o",
         description: "GPT-4o fine tuned.",
         match: {
-          starts_with: "ft:gpt-4o-2024-08-06:"
+          starts_with: "ft:gpt-4o-2024-"
         },
         prices: {
           input_mtok: 3.75,
@@ -4064,16 +4179,33 @@ Compared to other leading proprietary and open-weights models Command A delivers
         }
       },
       {
-        id: "ft:gpt-4o-mini-2024-07-18:",
+        id: "ft:gpt-4o-mini",
         description: "GPT-4o Mini fine tuned.",
         match: {
-          starts_with: "ft:gpt-4o-mini-2024-07-18:"
+          starts_with: "ft:gpt-4o-mini-2024-"
         },
         prices: {
           input_mtok: 0.3,
           output_mtok: 1.2
         }
       },
+      {
+        id: "gpt-3.5-0301",
+        match: {
+          or: [
+            {
+              equals: "gpt-3.5-turbo-0301"
+            },
+            {
+              equals: "gpt-3.5-0301"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 1.5,
+          output_mtok: 2
+        }
+      },
       {
         id: "gpt-3.5-turbo",
         name: "gpt 3.5 turbo",
@@ -4088,9 +4220,6 @@ Compared to other leading proprietary and open-weights models Command A delivers
             },
             {
               equals: "gpt-3.5-turbo-0125"
-            },
-            {
-              equals: "gpt-3.5-turbo-1106"
             }
           ]
         },
@@ -4100,6 +4229,28 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 1.5
         }
       },
+      {
+        id: "gpt-3.5-turbo-0613",
+        match: {
+          equals: "gpt-3.5-turbo-0613"
+        },
+        context_window: 16385,
+        prices: {
+          input_mtok: 1.5,
+          output_mtok: 2
+        }
+      },
+      {
+        id: "gpt-3.5-turbo-1106",
+        match: {
+          equals: "gpt-3.5-turbo-1106"
+        },
+        context_window: 16385,
+        prices: {
+          input_mtok: 1,
+          output_mtok: 2
+        }
+      },
       {
         id: "gpt-3.5-turbo-16k",
         name: "GPT-3.5 Turbo 16k",
@@ -4114,6 +4265,9 @@ Compared to other leading proprietary and open-weights models Command A delivers
             },
             {
               equals: "gpt-35-turbo-16k-0613"
+            },
+            {
+              equals: "gpt-35-turbo-16k"
             }
           ]
         },
@@ -4157,6 +4311,9 @@ Compared to other leading proprietary and open-weights models Command A delivers
             },
             {
               equals: "gpt-4-0613"
+            },
+            {
+              starts_with: "ft:gpt-4-0"
             }
           ]
         },
@@ -4372,6 +4529,9 @@ Compared to other leading proprietary and open-weights models Command A delivers
             },
             {
               equals: "gpt-4o-mini-search-preview"
+            },
+            {
+              equals: "gpt-4o-mini-search-preview-2025-03-11"
             }
           ]
         },
@@ -4413,7 +4573,31 @@ Compared to other leading proprietary and open-weights models Command A delivers
         prices: {
           input_mtok: 0.6,
           cache_read_mtok: 0.3,
-          output_mtok: 2.4
+          output_mtok: 2.4,
+          input_audio_mtok: 10,
+          cache_audio_read_mtok: 0.3,
+          output_audio_mtok: 20
+        }
+      },
+      {
+        id: "gpt-4o-mini-transcribe",
+        match: {
+          equals: "gpt-4o-mini-transcribe"
+        },
+        prices: {
+          input_mtok: 1.25,
+          output_mtok: 5,
+          input_audio_mtok: 3
+        }
+      },
+      {
+        id: "gpt-4o-mini-tts",
+        match: {
+          equals: "gpt-4o-mini-tts"
+        },
+        prices: {
+          input_mtok: 0.6,
+          output_audio_mtok: 12
         }
       },
       {
@@ -4435,13 +4619,38 @@ Compared to other leading proprietary and open-weights models Command A delivers
         name: "GPT-4o Search Preview",
         description: "GPT-4o Search Previewis a specialized model for web search in Chat Completions. It is trained to understand and execute web search queries.",
         match: {
-          equals: "gpt-4o-search-preview"
+          or: [
+            {
+              equals: "gpt-4o-search-preview"
+            },
+            {
+              equals: "gpt-4o-search-preview-2025-03-11"
+            }
+          ]
         },
         prices: {
           input_mtok: 2.5,
           output_mtok: 10
         }
       },
+      {
+        id: "gpt-4o-transcribe",
+        match: {
+          or: [
+            {
+              equals: "gpt-4o-transcribe"
+            },
+            {
+              equals: "gpt-4o-transcribe-diarize"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 2.5,
+          output_mtok: 10,
+          input_audio_mtok: 6
+        }
+      },
       {
         id: "gpt-4o:extended",
         name: "GPT-4o (extended)",
@@ -4471,6 +4680,9 @@ Compared to other leading proprietary and open-weights models Command A delivers
             },
             {
               equals: "gpt-5-chat-latest"
+            },
+            {
+              equals: "gpt-5-codex"
             }
           ]
         },
@@ -4481,6 +4693,30 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 10
         }
       },
+      {
+        id: "gpt-5-image",
+        match: {
+          equals: "gpt-5-image"
+        },
+        price_comments: "Seen on OpenRouter before OpenAI",
+        prices: {
+          input_mtok: 10,
+          cache_read_mtok: 1.25,
+          output_mtok: 10
+        }
+      },
+      {
+        id: "gpt-5-image-mini",
+        match: {
+          equals: "gpt-5-image-mini"
+        },
+        price_comments: "Seen on OpenRouter before OpenAI",
+        prices: {
+          input_mtok: 2.5,
+          cache_read_mtok: 0.25,
+          output_mtok: 2
+        }
+      },
       {
         id: "gpt-5-mini",
         name: "GPT-5 mini",
@@ -4523,6 +4759,68 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 0.4
         }
       },
+      {
+        id: "gpt-5-pro",
+        match: {
+          or: [
+            {
+              equals: "gpt-5-pro"
+            },
+            {
+              equals: "gpt-5-pro-2025-10-06"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 15,
+          output_mtok: 120
+        }
+      },
+      {
+        id: "gpt-realtime",
+        match: {
+          or: [
+            {
+              equals: "gpt-realtime"
+            },
+            {
+              equals: "gpt-realtime-2025-08-28"
+            }
+          ]
+        },
+        price_comments: "Missing image token prices which we don't support yet",
+        prices: {
+          input_mtok: 4,
+          cache_read_mtok: 0.4,
+          output_mtok: 16,
+          input_audio_mtok: 32,
+          cache_audio_read_mtok: 0.4,
+          output_audio_mtok: 64
+        }
+      },
+      {
+        id: "gpt-realtime-mini",
+        match: {
+          equals: "gpt-realtime-mini"
+        },
+        price_comments: "Missing image token prices which we don't support yet",
+        prices: {
+          input_mtok: 0.6,
+          cache_read_mtok: 0.06,
+          output_mtok: 2.4,
+          input_audio_mtok: 10,
+          cache_audio_read_mtok: 0.3,
+          output_audio_mtok: 20
+        }
+      },
+      {
+        id: "moderation",
+        description: "All OpenAI moderation models and endpoints are free of charge",
+        match: {
+          contains: "moderation"
+        },
+        prices: {}
+      },
       {
         id: "o1",
         name: "o1",
@@ -4576,7 +4874,14 @@ Compared to other leading proprietary and open-weights models Command A delivers
         name: "o1-pro",
         description: "The o1 series of models are trained with reinforcement learning to think before they answer and perform complex reasoning. The o1-pro model uses more compute to think harder and provide consistently better answers.",
         match: {
-          equals: "o1-pro"
+          or: [
+            {
+              equals: "o1-pro"
+            },
+            {
+              equals: "o1-pro-2025-03-19"
+            }
+          ]
         },
         prices: {
           input_mtok: 150,
@@ -4618,6 +4923,24 @@ Compared to other leading proprietary and open-weights models Command A delivers
           }
         ]
       },
+      {
+        id: "o3-deep-research",
+        match: {
+          or: [
+            {
+              equals: "o3-deep-research"
+            },
+            {
+              equals: "o3-deep-research-2025-06-26"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 10,
+          cache_read_mtok: 2.5,
+          output_mtok: 40
+        }
+      },
       {
         id: "o3-mini",
         name: "o3 Mini",
@@ -4646,7 +4969,14 @@ Compared to other leading proprietary and open-weights models Command A delivers
         name: "o3 Pro",
         description: "The o-series of models are trained with reinforcement learning to think before they answer and perform complex reasoning. The o3-pro model uses more compute to think harder and provide consistently better answers.",
         match: {
-          equals: "o3-pro"
+          or: [
+            {
+              equals: "o3-pro"
+            },
+            {
+              equals: "o3-pro-2025-06-10"
+            }
+          ]
         },
         prices: {
           input_mtok: 20,
@@ -4659,9 +4989,6 @@ Compared to other leading proprietary and open-weights models Command A delivers
         description: "OpenAI o4-mini-high is the same model as o4-mini with reasoning_effort set to high.",
         match: {
           or: [
-            {
-              starts_with: "o4-mini"
-            },
             {
               equals: "o4-mini-2025-04-16"
             },
@@ -4679,6 +5006,24 @@ Compared to other leading proprietary and open-weights models Command A delivers
           output_mtok: 4.4
         }
       },
+      {
+        id: "o4-mini-deep-research",
+        match: {
+          or: [
+            {
+              equals: "o4-mini-deep-research"
+            },
+            {
+              equals: "o4-mini-deep-research-2025-06-26"
+            }
+          ]
+        },
+        prices: {
+          input_mtok: 2,
+          cache_read_mtok: 0.5,
+          output_mtok: 8
+        }
+      },
       {
         id: "text-davinci-002",
         match: {
@@ -5867,6 +6212,18 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         prices: {}
       },
+      {
+        id: "deepseek-v3.1-terminus",
+        name: "DeepSeek V3.1 Terminus",
+        match: {
+          equals: "deepseek-v3.1-terminus"
+        },
+        context_window: 163840,
+        prices: {
+          input_mtok: 0.23,
+          output_mtok: 0.9
+        }
+      },
       {
         id: "deepseek/deepseek-chat",
         match: {
@@ -5894,6 +6251,18 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         prices: {}
       },
+      {
+        id: "deepseek/deepseek-chat-v3.1",
+        name: "DeepSeek Chat V3.1",
+        match: {
+          equals: "deepseek/deepseek-chat-v3.1"
+        },
+        context_window: 163840,
+        prices: {
+          input_mtok: 0.2,
+          output_mtok: 0.8
+        }
+      },
       {
         id: "deepseek/deepseek-chat:free",
         match: {
@@ -6003,6 +6372,17 @@ Compared to other leading proprietary and open-weights models Command A delivers
         },
         prices: {}
       },
+      {
+        id: "deepseek/deepseek-v3.2-exp",
+        name: "DeepSeek V3.2 Experimental",
+        match: {
+          equals: "deepseek/deepseek-v3.2-exp"
+        },
+        prices: {
+          input_mtok: 0.27,
+          output_mtok: 0.4
+        }
+      },
       {
         id: "devstral-small",
         name: "Devstral Small",
@@ -10697,6 +11077,28 @@ Compared to other leading proprietary and open-weights models Command A delivers
           input_mtok: 3,
           output_mtok: 3
         }
+      },
+      {
+        id: "z-ai/glm-4.5",
+        match: {
+          equals: "z-ai/glm-4.5"
+        },
+        context_window: 131072,
+        prices: {
+          input_mtok: 0.35,
+          output_mtok: 1.55
+        }
+      },
+      {
+        id: "z-ai/glm-4.6",
+        match: {
+          equals: "z-ai/glm-4.6"
+        },
+        context_window: 202752,
+        prices: {
+          input_mtok: 0.4,
+          output_mtok: 1.75
+        }
       }
     ]
   },
@@ -11816,49 +12218,49 @@ Compared to other leading proprietary and open-weights models Command A delivers
     ]
   }
 ];
-function We(i, n) {
+function We(a, n) {
   if (n <= 0) return 0;
   let m = 0;
-  const s = [...i.tiers].sort((k, h) => k.start - h.start), u = s[0]?.start ?? n, _ = Math.min(n, u);
-  m += _ * i.base / 1e6;
+  const s = [...a.tiers].sort((k, h) => k.start - h.start), u = s[0]?.start ?? n, _ = Math.min(n, u);
+  m += _ * a.base / 1e6;
   for (let k = 0; k < s.length; k++) {
     const h = s[k], f = s[k + 1]?.start ?? 1 / 0, y = Math.max(0, Math.min(n, f) - h.start);
     y > 0 && (m += y * h.price / 1e6);
   }
   return m;
 }
-function O(i, n, m) {
-  return i === void 0 || n === void 0 ? 0 : typeof i == "number" ? i * n / 1e6 : We(i, n);
+function O(a, n, m) {
+  return a === void 0 || n === void 0 ? 0 : typeof a == "number" ? a * n / 1e6 : We(a, n);
 }
-function Ue(i, n) {
+function Ue(a, n) {
   let m = 0, s = 0;
-  const u = i.cache_read_tokens ?? 0, _ = i.cache_write_tokens ?? 0, k = i.cache_audio_read_tokens ?? 0, h = i.output_audio_tokens ?? 0;
-  let f = i.input_audio_tokens ?? 0;
+  const u = a.cache_read_tokens ?? 0, _ = a.cache_write_tokens ?? 0, k = a.cache_audio_read_tokens ?? 0, h = a.output_audio_tokens ?? 0;
+  let f = a.input_audio_tokens ?? 0;
   if (f -= k, f < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than input_audio_tokens");
-  let y = i.input_tokens ?? 0;
+  let y = a.input_tokens ?? 0;
   if (y -= u, y -= _, y -= f, y < 0)
     throw new Error("Uncached text input tokens cannot be negative");
   let P = u;
   if (P -= k, P < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than cache_read_tokens");
   m += O(n.input_mtok, y), m += O(n.cache_read_mtok, P), m += O(n.cache_write_mtok, _), m += O(n.input_audio_mtok, f), m += O(n.cache_audio_read_mtok, k);
-  let G = i.output_tokens ?? 0;
-  if (G -= h, G < 0)
+  let S = a.output_tokens ?? 0;
+  if (S -= h, S < 0)
     throw new Error("output_audio_tokens cannot be greater than output_tokens");
-  s += O(n.output_mtok, G), s += O(n.output_audio_mtok, i.output_audio_tokens);
-  let S = m + s;
-  return n.requests_kcount !== void 0 && (S += n.requests_kcount / 1e3), {
+  s += O(n.output_mtok, S), s += O(n.output_audio_mtok, a.output_audio_tokens);
+  let G = m + s;
+  return n.requests_kcount !== void 0 && (G += n.requests_kcount / 1e3), {
     input_price: m,
     output_price: s,
-    total_price: S
+    total_price: G
   };
 }
-function Ke(i, n) {
-  if (!Array.isArray(i.prices))
-    return i.prices;
-  for (let m = i.prices.length - 1; m >= 0; m--) {
-    const s = i.prices[m], u = s.constraint;
+function Ke(a, n) {
+  if (!Array.isArray(a.prices))
+    return a.prices;
+  for (let m = a.prices.length - 1; m >= 0; m--) {
+    const s = a.prices[m], u = s.constraint;
     if (u === void 0)
       return s.prices;
     if (u.type === "start_date") {
@@ -11873,34 +12275,34 @@ function Ke(i, n) {
         return s.prices;
     }
   }
-  return i.prices[0].prices;
+  return a.prices[0].prices;
 }
-function j(i, n) {
-  return "or" in i ? i.or.some((m) => j(m, n)) : "and" in i ? i.and.every((m) => j(m, n)) : "equals" in i ? n === i.equals : "starts_with" in i ? n.startsWith(i.starts_with) : "ends_with" in i ? n.endsWith(i.ends_with) : "contains" in i ? n.includes(i.contains) : "regex" in i ? new RegExp(i.regex).test(n) : !1;
+function j(a, n) {
+  return "or" in a ? a.or.some((m) => j(m, n)) : "and" in a ? a.and.every((m) => j(m, n)) : "equals" in a ? n === a.equals : "starts_with" in a ? n.startsWith(a.starts_with) : "ends_with" in a ? n.endsWith(a.ends_with) : "contains" in a ? n.includes(a.contains) : "regex" in a ? new RegExp(a.regex).test(n) : !1;
 }
-function Ye(i, n) {
-  const m = n.toLowerCase().trim(), s = i.find((u) => u.id === m);
-  return s || i.find((u) => u.provider_match && j(u.provider_match, m));
+function Ye(a, n) {
+  const m = n.toLowerCase().trim(), s = a.find((u) => u.id === m);
+  return s || a.find((u) => u.provider_match && j(u.provider_match, m));
 }
-function Je(i, { modelId: n, providerApiUrl: m, providerId: s }) {
+function Je(a, { modelId: n, providerApiUrl: m, providerId: s }) {
   if (s)
-    return Ye(i, s);
+    return Ye(a, s);
   if (m)
-    return i.find((u) => new RegExp(u.api_pattern).test(m));
+    return a.find((u) => new RegExp(u.api_pattern).test(m));
   if (n)
-    return i.find((u) => u.model_match && j(u.model_match, n));
+    return a.find((u) => u.model_match && j(u.model_match, n));
 }
-function Ze(i, n) {
-  return i.find((m) => j(m.match, n));
+function Ze(a, n) {
+  return a.find((m) => j(m.match, n));
 }
-let Xe = ie;
-Promise.resolve(ie);
-function et(i, n, m) {
+let Xe = ae;
+Promise.resolve(ae);
+function et(a, n, m) {
   const s = n.toLowerCase().trim(), u = m?.provider ?? Je(Xe, { modelId: s, providerApiUrl: m?.providerApiUrl, providerId: m?.providerId });
   if (!u) return null;
   const _ = Ze(u.models, s);
   if (!_) return null;
-  const k = m?.timestamp ?? /* @__PURE__ */ new Date(), h = Ke(_, k), f = Ue(i, h);
+  const k = m?.timestamp ?? /* @__PURE__ */ new Date(), h = Ke(_, k), f = Ue(a, h);
   return {
     auto_update_timestamp: void 0,
     model: _,
@@ -11912,15 +12314,15 @@ function et(i, n, m) {
 const b = de(Ce(process.argv)).scriptName("genai-prices").command(
   "list [provider]",
   "List providers and models",
-  (i) => i.positional("provider", { describe: "Provider ID to filter", type: "string" })
+  (a) => a.positional("provider", { describe: "Provider ID to filter", type: "string" })
 ).command(
   "calc <model...>",
   "Calculate price",
-  (i) => i.positional("model", { array: !0, describe: "Model(s) (optionally provider:model)", type: "string" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("auto-update", { default: !1, type: "boolean" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" })
+  (a) => a.positional("model", { array: !0, describe: "Model(s) (optionally provider:model)", type: "string" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("auto-update", { default: !1, type: "boolean" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" })
 ).option("auto-update", { describe: "Enable auto-update from GitHub", type: "boolean" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" }).version("0.1.0").help().parseSync();
 function tt() {
   if (b._[0] === "list") {
-    const m = ie;
+    const m = ae;
     if (b.provider) {
       const s = m.find((u) => u.id === b.provider);
       s || (console.error(`Provider ${b.provider} not found.`), process.exit(1)), console.log(`${s.name}: (${s.models.length} models)`);
@@ -11965,8 +12367,8 @@ function tt() {
           ["Input Price", `$${f.input_price}`],
           ["Output Price", `$${f.output_price}`]
         ];
-        for (const [G, S] of P)
-          S !== void 0 && console.log(`${G.padStart(14)}: ${S}`);
+        for (const [S, G] of P)
+          G !== void 0 && console.log(`${S.padStart(14)}: ${G}`);
         console.log("");
       } catch (f) {
         u = !0, f instanceof Error && console.error(`Error for model ${_}:`, f.message);