@pydantic/genai-prices 0.0.41 → 0.0.42

package/dist/cli.js

@@ -1,7 +1,7 @@
 #!/usr/bin/env node
 import de from "yargs";
 import { format as he } from "util";
-import { resolve as ie, normalize as Ie } from "path";
+import { resolve as ae, normalize as Ie } from "path";
 import { readFileSync as _e, writeFile as Le, statSync as Pe } from "fs";
 import "assert";
 import { fileURLToPath as Te } from "url";
@@ -14,53 +14,53 @@ function Se() {
 function Ge() {
   return !!process.versions.electron;
 }
-function Ce(a) {
-  return a.slice(Ae() + 1);
+function Ce(i) {
+  return i.slice(Ae() + 1);
 }
 /**
  * @license
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function W(a) {
-  if (a !== a.toLowerCase() && a !== a.toUpperCase() || (a = a.toLowerCase()), a.indexOf("-") === -1 && a.indexOf("_") === -1)
-    return a;
+function W(i) {
+  if (i !== i.toLowerCase() && i !== i.toUpperCase() || (i = i.toLowerCase()), i.indexOf("-") === -1 && i.indexOf("_") === -1)
+    return i;
   {
     let m = "", s = !1;
-    const u = a.match(/^-+/);
-    for (let k = u ? u[0].length : 0; k < a.length; k++) {
-      let _ = a.charAt(k);
+    const u = i.match(/^-+/);
+    for (let k = u ? u[0].length : 0; k < i.length; k++) {
+      let _ = i.charAt(k);
       s && (s = !1, _ = _.toUpperCase()), k !== 0 && (_ === "-" || _ === "_") ? s = !0 : _ !== "-" && _ !== "_" && (m += _);
     }
     return m;
   }
 }
-function Oe(a, n) {
-  const m = a.toLowerCase();
+function Oe(i, n) {
+  const m = i.toLowerCase();
   n = n || "-";
   let s = "";
-  for (let u = 0; u < a.length; u++) {
-    const k = m.charAt(u), _ = a.charAt(u);
+  for (let u = 0; u < i.length; u++) {
+    const k = m.charAt(u), _ = i.charAt(u);
     k !== _ && u > 0 ? s += `${n}${m.charAt(u)}` : s += _;
   }
   return s;
 }
-function Re(a) {
-  return a == null ? !1 : typeof a == "number" || /^0x[0-9a-f]+$/i.test(a) ? !0 : /^0[^.]/.test(a) ? !1 : /^[-]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(a);
+function Re(i) {
+  return i == null ? !1 : typeof i == "number" || /^0x[0-9a-f]+$/i.test(i) ? !0 : /^0[^.]/.test(i) ? !1 : /^[-]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(i);
 }
 /**
  * @license
  * Copyright (c) 2016, Contributors
  * SPDX-License-Identifier: ISC
  */
-function Ee(a) {
-  if (Array.isArray(a))
-    return a.map((_) => typeof _ != "string" ? _ + "" : _);
-  a = a.trim();
+function Ee(i) {
+  if (Array.isArray(i))
+    return i.map((_) => typeof _ != "string" ? _ + "" : _);
+  i = i.trim();
   let n = 0, m = null, s = null, u = null;
   const k = [];
-  for (let _ = 0; _ < a.length; _++) {
-    if (m = s, s = a.charAt(_), s === " " && !u) {
+  for (let _ = 0; _ < i.length; _++) {
+    if (m = s, s = i.charAt(_), s === " " && !u) {
       m !== " " && n++;
       continue;
     }
@@ -74,8 +74,8 @@ function Ee(a) {
  * SPDX-License-Identifier: ISC
  */
 var I;
-(function(a) {
-  a.BOOLEAN = "boolean", a.STRING = "string", a.NUMBER = "number", a.ARRAY = "array";
+(function(i) {
+  i.BOOLEAN = "boolean", i.STRING = "string", i.NUMBER = "number", i.ARRAY = "array";
 })(I || (I = {}));
 /**
  * @license
@@ -138,14 +138,14 @@ class Ne {
       keys: []
     }, L = /^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/, U = new RegExp("^--" + h["negation-prefix"] + "(.+)");
     [].concat(s.array || []).filter(Boolean).forEach(function(e) {
-      const i = typeof e == "object" ? e.key : e, c = Object.keys(e).map(function(o) {
+      const a = typeof e == "object" ? e.key : e, c = Object.keys(e).map(function(o) {
         return {
           boolean: "bools",
           string: "strings",
           number: "numbers"
         }[o];
       }).filter(Boolean).pop();
-      c && (r[c][i] = !0), r.arrays[i] = !0, r.keys.push(i);
+      c && (r[c][a] = !0), r.arrays[a] = !0, r.keys.push(a);
     }), [].concat(s.boolean || []).filter(Boolean).forEach(function(e) {
       r.bools[e] = !0, r.keys.push(e);
     }), [].concat(s.string || []).filter(Boolean).forEach(function(e) {
@@ -156,17 +156,17 @@ class Ne {
       r.counts[e] = !0, r.keys.push(e);
     }), [].concat(s.normalize || []).filter(Boolean).forEach(function(e) {
       r.normalize[e] = !0, r.keys.push(e);
-    }), typeof s.narg == "object" && Object.entries(s.narg).forEach(([e, i]) => {
-      typeof i == "number" && (r.nargs[e] = i, r.keys.push(e));
-    }), typeof s.coerce == "object" && Object.entries(s.coerce).forEach(([e, i]) => {
-      typeof i == "function" && (r.coercions[e] = i, r.keys.push(e));
+    }), typeof s.narg == "object" && Object.entries(s.narg).forEach(([e, a]) => {
+      typeof a == "number" && (r.nargs[e] = a, r.keys.push(e));
+    }), typeof s.coerce == "object" && Object.entries(s.coerce).forEach(([e, a]) => {
+      typeof a == "function" && (r.coercions[e] = a, r.keys.push(e));
     }), typeof s.config < "u" && (Array.isArray(s.config) || typeof s.config == "string" ? [].concat(s.config).filter(Boolean).forEach(function(e) {
       r.configs[e] = !0;
-    }) : typeof s.config == "object" && Object.entries(s.config).forEach(([e, i]) => {
-      (typeof i == "boolean" || typeof i == "function") && (r.configs[e] = i);
+    }) : typeof s.config == "object" && Object.entries(s.config).forEach(([e, a]) => {
+      (typeof a == "boolean" || typeof a == "function") && (r.configs[e] = a);
     })), qe(s.key, _, s.default, r.arrays), Object.keys(f).forEach(function(e) {
-      (r.aliases[e] || []).forEach(function(i) {
-        f[i] = f[e];
+      (r.aliases[e] || []).forEach(function(a) {
+        f[a] = f[e];
       });
     });
     let B = null;
@@ -174,28 +174,28 @@ class Ne {
     let F = [];
     const w = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), ne = {};
     for (let e = 0; e < u.length; e++) {
-      const i = u[e], c = i.replace(/^-{3,}/, "---");
+      const a = u[e], c = a.replace(/^-{3,}/, "---");
       let o, t, p, l, d, v;
-      if (i !== "--" && /^-/.test(i) && H(i))
-        K(i);
+      if (a !== "--" && /^-/.test(a) && H(a))
+        K(a);
       else if (c.match(/^---+(=|$)/)) {
-        K(i);
+        K(a);
         continue;
-      } else if (i.match(/^--.+=/) || !h["short-option-groups"] && i.match(/^-.+=/))
-        l = i.match(/^--?([^=]+)=([\s\S]*)$/), l !== null && Array.isArray(l) && l.length >= 3 && (g(l[1], r.arrays) ? e = V(e, l[1], u, l[2]) : g(l[1], r.nargs) !== !1 ? e = D(e, l[1], u, l[2]) : q(l[1], l[2], !0));
-      else if (i.match(U) && h["boolean-negation"])
-        l = i.match(U), l !== null && Array.isArray(l) && l.length >= 2 && (t = l[1], q(t, g(t, r.arrays) ? [!1] : !1));
-      else if (i.match(/^--.+/) || !h["short-option-groups"] && i.match(/^-[^-]+/))
-        l = i.match(/^--?(.+)/), l !== null && Array.isArray(l) && l.length >= 2 && (t = l[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(/^-.\..+=/))
-        l = i.match(/^-([^=]+)=([\s\S]*)$/), l !== null && Array.isArray(l) && l.length >= 3 && q(l[1], l[2]);
-      else if (i.match(/^-.\..+/) && !i.match(L))
-        d = u[e + 1], l = i.match(/^-(.\..+)/), l !== null && Array.isArray(l) && l.length >= 2 && (t = l[1], d !== void 0 && !d.match(/^-/) && !g(t, r.bools) && !g(t, r.counts) ? (q(t, d), e++) : q(t, R(t)));
-      else if (i.match(/^-[^-]+/) && !i.match(L)) {
-        p = i.slice(1, -1).split(""), o = !1;
+      } else if (a.match(/^--.+=/) || !h["short-option-groups"] && a.match(/^-.+=/))
+        l = a.match(/^--?([^=]+)=([\s\S]*)$/), l !== null && Array.isArray(l) && l.length >= 3 && (g(l[1], r.arrays) ? e = V(e, l[1], u, l[2]) : g(l[1], r.nargs) !== !1 ? e = D(e, l[1], u, l[2]) : q(l[1], l[2], !0));
+      else if (a.match(U) && h["boolean-negation"])
+        l = a.match(U), l !== null && Array.isArray(l) && l.length >= 2 && (t = l[1], q(t, g(t, r.arrays) ? [!1] : !1));
+      else if (a.match(/^--.+/) || !h["short-option-groups"] && a.match(/^-[^-]+/))
+        l = a.match(/^--?(.+)/), l !== null && Array.isArray(l) && l.length >= 2 && (t = l[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(/^-.\..+=/))
+        l = a.match(/^-([^=]+)=([\s\S]*)$/), l !== null && Array.isArray(l) && l.length >= 3 && q(l[1], l[2]);
+      else if (a.match(/^-.\..+/) && !a.match(L))
+        d = u[e + 1], l = a.match(/^-(.\..+)/), l !== null && Array.isArray(l) && l.length >= 2 && (t = l[1], d !== void 0 && !d.match(/^-/) && !g(t, r.bools) && !g(t, r.counts) ? (q(t, d), e++) : q(t, R(t)));
+      else if (a.match(/^-[^-]+/) && !a.match(L)) {
+        p = a.slice(1, -1).split(""), o = !1;
         for (let x = 0; x < p.length; x++) {
-          if (d = i.slice(x + 2), p[x + 1] && p[x + 1] === "=") {
-            v = i.slice(x + 3), t = p[x], g(t, r.arrays) ? e = V(e, t, u, v) : g(t, r.nargs) !== !1 ? e = D(e, t, u, v) : q(t, v), o = !0;
+          if (d = a.slice(x + 2), p[x + 1] && p[x + 1] === "=") {
+            v = a.slice(x + 3), t = p[x], g(t, r.arrays) ? e = V(e, t, u, v) : g(t, r.nargs) !== !1 ? e = D(e, t, u, v) : q(t, v), o = !0;
             break;
           }
           if (d === "-") {
@@ -212,17 +212,17 @@ class Ne {
           } else
             q(p[x], R(p[x]));
         }
-        t = i.slice(-1)[0], !o && t !== "-" && (g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
-      } else if (i.match(/^-[0-9]$/) && i.match(L) && g(i.slice(1), r.bools))
-        t = i.slice(1), q(t, R(t));
-      else if (i === "--") {
+        t = a.slice(-1)[0], !o && t !== "-" && (g(t, r.arrays) ? e = V(e, t, u) : g(t, r.nargs) !== !1 ? e = D(e, t, u) : (d = u[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(L)) && !g(t, r.bools) && !g(t, r.counts) || /^(true|false)$/.test(d) ? (q(t, d), e++) : q(t, R(t))));
+      } else if (a.match(/^-[0-9]$/) && a.match(L) && g(a.slice(1), r.bools))
+        t = a.slice(1), q(t, R(t));
+      else if (a === "--") {
         F = u.slice(e + 1);
         break;
       } else if (h["halt-at-non-option"]) {
         F = u.slice(e);
         break;
       } else
-        K(i);
+        K(a);
     }
     re(w, !0), re(w, !1), ke(w), ge(), me(w, r.aliases, f, !0), fe(w), h["set-placeholder-key"] && be(w), Object.keys(r.counts).forEach(function(e) {
       E(w, e.split(".")) || q(e, 0);
@@ -231,54 +231,54 @@ class Ne {
     }), 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(_).map((e) => _[e])).forEach((e) => {
-      h["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((i) => W(i)).join(".")], delete w[e];
+      h["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((a) => W(a)).join(".")], delete w[e];
     });
     function K(e) {
-      const i = $("_", e);
-      (typeof i == "string" || typeof i == "number") && w._.push(i);
+      const a = $("_", e);
+      (typeof a == "string" || typeof a == "number") && w._.push(a);
     }
-    function D(e, i, c, o) {
-      let t, p = g(i, r.nargs);
+    function D(e, a, c, o) {
+      let t, p = g(a, r.nargs);
       if (p = typeof p != "number" || isNaN(p) ? 1 : p, p === 0)
-        return T(o) || (B = Error(C("Argument unexpected for: %s", i))), q(i, R(i)), e;
+        return T(o) || (B = Error(C("Argument unexpected for: %s", a))), q(a, R(a)), e;
       let l = T(o) ? 0 : 1;
       if (h["nargs-eats-options"])
-        c.length - (e + 1) + l < p && (B = Error(C("Not enough arguments following: %s", i))), l = p;
+        c.length - (e + 1) + l < p && (B = Error(C("Not enough arguments following: %s", a))), l = p;
       else {
         for (t = e + 1; t < c.length && (!c[t].match(/^-[^0-9]/) || c[t].match(L) || H(c[t])); t++)
           l++;
-        l < p && (B = Error(C("Not enough arguments following: %s", i)));
+        l < p && (B = Error(C("Not enough arguments following: %s", a)));
       }
       let d = Math.min(l, p);
-      for (!T(o) && d > 0 && (q(i, o), d--), t = e + 1; t < d + e + 1; t++)
-        q(i, c[t]);
+      for (!T(o) && d > 0 && (q(a, o), d--), t = e + 1; t < d + e + 1; t++)
+        q(a, c[t]);
       return e + d;
     }
-    function V(e, i, c, o) {
+    function V(e, a, c, o) {
       let t = [], p = o || c[e + 1];
-      const l = g(i, r.nargs);
-      if (g(i, r.bools) && !/^(true|false)$/.test(p))
+      const l = g(a, r.nargs);
+      if (g(a, r.bools) && !/^(true|false)$/.test(p))
         t.push(!0);
       else if (T(p) || T(o) && /^-/.test(p) && !L.test(p) && !H(p)) {
-        if (f[i] !== void 0) {
-          const d = f[i];
+        if (f[a] !== void 0) {
+          const d = f[a];
           t = Array.isArray(d) ? d : [d];
         }
       } else {
-        T(o) || t.push(Y(i, o, !0));
+        T(o) || t.push(Y(a, o, !0));
         for (let d = e + 1; d < c.length && !(!h["greedy-arrays"] && t.length > 0 || l && typeof l == "number" && t.length >= l || (p = c[d], /^-/.test(p) && !L.test(p) && !H(p))); d++)
-          e = d, t.push(Y(i, p, k));
+          e = d, t.push(Y(a, p, k));
       }
-      return typeof l == "number" && (l && t.length < l || isNaN(l) && t.length === 0) && (B = Error(C("Not enough arguments following: %s", i))), q(i, t), e;
+      return typeof l == "number" && (l && t.length < l || isNaN(l) && t.length === 0) && (B = Error(C("Not enough arguments following: %s", a))), q(a, t), e;
     }
-    function q(e, i, c = k) {
+    function q(e, a, c = k) {
       if (/-/.test(e) && h["camel-case-expansion"]) {
         const p = e.split(".").map(function(l) {
           return W(l);
         }).join(".");
         se(e, p);
       }
-      const o = Y(e, i, c), t = e.split(".");
+      const o = Y(e, a, c), t = e.split(".");
       N(w, t, o), r.aliases[e] && r.aliases[e].forEach(function(p) {
         const l = p.split(".");
         N(w, l, o);
@@ -290,31 +290,31 @@ class Ne {
         Object.defineProperty(ne, l, {
           enumerable: !0,
           get() {
-            return i;
+            return a;
           },
           set(d) {
-            i = typeof d == "string" ? A.normalize(d) : d;
+            a = typeof d == "string" ? A.normalize(d) : d;
           }
         });
       });
     }
-    function se(e, i) {
-      r.aliases[e] && r.aliases[e].length || (r.aliases[e] = [i], Q[i] = !0), r.aliases[i] && r.aliases[i].length || se(i, e);
+    function se(e, a) {
+      r.aliases[e] && r.aliases[e].length || (r.aliases[e] = [a], Q[a] = !0), r.aliases[a] && r.aliases[a].length || se(a, e);
     }
-    function Y(e, i, c) {
-      c && (i = je(i)), (g(e, r.bools) || g(e, r.counts)) && typeof i == "string" && (i = i === "true");
-      let o = Array.isArray(i) ? i.map(function(t) {
+    function Y(e, a, c) {
+      c && (a = je(a)), (g(e, r.bools) || g(e, r.counts)) && typeof a == "string" && (a = a === "true");
+      let o = Array.isArray(a) ? a.map(function(t) {
         return $(e, t);
-      }) : $(e, i);
-      return g(e, r.counts) && (T(o) || typeof o == "boolean") && (o = Z()), g(e, r.normalize) && g(e, r.arrays) && (Array.isArray(i) ? o = i.map((t) => A.normalize(t)) : o = A.normalize(i)), o;
+      }) : $(e, a);
+      return g(e, r.counts) && (T(o) || typeof o == "boolean") && (o = Z()), g(e, r.normalize) && g(e, r.arrays) && (Array.isArray(a) ? o = a.map((t) => A.normalize(t)) : o = A.normalize(a)), o;
     }
-    function $(e, i) {
-      return !h["parse-positional-numbers"] && e === "_" || !g(e, r.strings) && !g(e, r.bools) && !Array.isArray(i) && (Re(i) && h["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${i}`))) || !T(i) && g(e, r.numbers)) && (i = Number(i)), i;
+    function $(e, a) {
+      return !h["parse-positional-numbers"] && e === "_" || !g(e, r.strings) && !g(e, r.bools) && !Array.isArray(a) && (Re(a) && h["parse-numbers"] && Number.isSafeInteger(Math.floor(parseFloat(`${a}`))) || !T(a) && g(e, r.numbers)) && (a = Number(a)), a;
     }
     function ke(e) {
-      const i = /* @__PURE__ */ Object.create(null);
-      me(i, r.aliases, f), Object.keys(r.configs).forEach(function(c) {
-        const o = e[c] || i[c];
+      const a = /* @__PURE__ */ Object.create(null);
+      me(a, r.aliases, f), Object.keys(r.configs).forEach(function(c) {
+        const o = e[c] || a[c];
         if (o)
           try {
             let t = null;
@@ -337,9 +337,9 @@ class Ne {
           }
       });
     }
-    function J(e, i) {
+    function J(e, a) {
       Object.keys(e).forEach(function(c) {
-        const o = e[c], t = i ? i + "." + c : c;
+        const o = e[c], t = a ? a + "." + c : c;
         typeof o == "object" && o !== null && !Array.isArray(o) && h["dot-notation"] ? J(o, t) : (!E(w, t.split(".")) || g(t, r.arrays) && h["combine-arrays"]) && q(t, o);
       });
     }
@@ -348,7 +348,7 @@ class Ne {
         J(e);
       });
     }
-    function re(e, i) {
+    function re(e, a) {
       if (typeof P > "u")
         return;
       const c = typeof P == "string" ? P : "", o = A.env();
@@ -357,17 +357,17 @@ class Ne {
           const p = t.split("__").map(function(l, d) {
             return d === 0 && (l = l.substring(c.length)), W(l);
           });
-          (i && r.configs[p.join(".")] || !i) && !E(e, p) && q(p.join("."), o[t]);
+          (a && r.configs[p.join(".")] || !a) && !E(e, p) && q(p.join("."), o[t]);
         }
       });
     }
     function fe(e) {
-      let i;
+      let a;
       const c = /* @__PURE__ */ new Set();
       Object.keys(e).forEach(function(o) {
-        if (!c.has(o) && (i = g(o, r.coercions), typeof i == "function"))
+        if (!c.has(o) && (a = g(o, r.coercions), typeof a == "function"))
           try {
-            const t = $(o, i(e[o]));
+            const t = $(o, a(e[o]));
             [].concat(r.aliases[o] || [], o).forEach((p) => {
               c.add(p), e[p] = t;
             });
@@ -377,37 +377,37 @@ class Ne {
       });
     }
     function be(e) {
-      return r.keys.forEach((i) => {
-        ~i.indexOf(".") || typeof e[i] > "u" && (e[i] = void 0);
+      return r.keys.forEach((a) => {
+        ~a.indexOf(".") || typeof e[a] > "u" && (e[a] = void 0);
       }), e;
     }
-    function me(e, i, c, o = !1) {
+    function me(e, a, c, o = !1) {
       Object.keys(c).forEach(function(t) {
-        E(e, t.split(".")) || (N(e, t.split("."), c[t]), o && (oe[t] = !0), (i[t] || []).forEach(function(p) {
+        E(e, t.split(".")) || (N(e, t.split("."), c[t]), o && (oe[t] = !0), (a[t] || []).forEach(function(p) {
           E(e, p.split(".")) || N(e, p.split("."), c[t]);
         }));
       });
     }
-    function E(e, i) {
+    function E(e, a) {
       let c = e;
-      h["dot-notation"] || (i = [i.join(".")]), i.slice(0, -1).forEach(function(t) {
+      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(t) {
         c = c[t] || {};
       });
-      const o = i[i.length - 1];
+      const o = a[a.length - 1];
       return typeof c != "object" ? !1 : o in c;
     }
-    function N(e, i, c) {
+    function N(e, a, c) {
       let o = e;
-      h["dot-notation"] || (i = [i.join(".")]), i.slice(0, -1).forEach(function(v) {
+      h["dot-notation"] || (a = [a.join(".")]), a.slice(0, -1).forEach(function(v) {
         v = ce(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 = ce(i[i.length - 1]), p = g(i.join("."), r.arrays), l = Array.isArray(c);
+      const t = ce(a[a.length - 1]), p = g(a.join("."), r.arrays), l = Array.isArray(c);
       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)), c === Z() ? o[t] = Z(o[t]) : Array.isArray(o[t]) ? d && p && l ? o[t] = h["flatten-duplicate-arrays"] ? o[t].concat(c) : (Array.isArray(o[t][0]) ? o[t] : [o[t]]).concat([c]) : !d && !!p == !!l ? o[t] = c : o[t] = o[t].concat([c]) : o[t] === void 0 && p ? o[t] = l ? c : [c] : d && !(o[t] === void 0 || g(t, r.counts) || g(t, r.bools)) ? o[t] = [o[t], c] : o[t] = c;
     }
     function qe(...e) {
-      e.forEach(function(i) {
-        Object.keys(i || {}).forEach(function(c) {
+      e.forEach(function(a) {
+        Object.keys(a || {}).forEach(function(c) {
           r.aliases[c] || (r.aliases[c] = [].concat(_[c] || []), r.aliases[c].concat(c).forEach(function(o) {
             if (/-/.test(o) && h["camel-case-expansion"]) {
               const t = W(o);
@@ -426,18 +426,18 @@ class Ne {
         });
       });
     }
-    function g(e, i) {
-      const c = [].concat(r.aliases[e] || [], e), o = Object.keys(i), t = c.find((p) => o.includes(p));
-      return t ? i[t] : !1;
+    function g(e, a) {
+      const c = [].concat(r.aliases[e] || [], e), o = Object.keys(a), t = c.find((p) => o.includes(p));
+      return t ? a[t] : !1;
     }
     function ue(e) {
-      const i = Object.keys(r);
-      return [].concat(i.map((o) => r[o])).some(function(o) {
+      const a = Object.keys(r);
+      return [].concat(a.map((o) => r[o])).some(function(o) {
         return Array.isArray(o) ? o.includes(e) : o[e];
       });
     }
-    function we(e, ...i) {
-      return [].concat(...i).some(function(o) {
+    function we(e, ...a) {
+      return [].concat(...a).some(function(o) {
         const t = e.match(o);
         return t && ue(t[1]);
       });
@@ -445,17 +445,17 @@ class Ne {
     function ve(e) {
       if (e.match(L) || !e.match(/^-[^-]+/))
         return !1;
-      let i = !0, c;
+      let a = !0, c;
       const o = e.slice(1).split("");
       for (let t = 0; t < o.length; t++) {
         if (c = e.slice(t + 2), !ue(o[t])) {
-          i = !1;
+          a = !1;
           break;
         }
         if (o[t + 1] && o[t + 1] === "=" || c === "-" || /[A-Za-z]/.test(o[t]) && /^-?\d+(\.\d*)?(e-?\d+)?$/.test(c) || o[t + 1] && o[t + 1].match(/\W/))
           break;
       }
-      return i;
+      return a;
     }
     function H(e) {
       return h["unknown-options-as-args"] && xe(e);
@@ -475,8 +475,8 @@ class Ne {
       }[e];
     }
     function Be(e) {
-      let i = I.BOOLEAN;
-      return g(e, r.strings) ? i = I.STRING : g(e, r.numbers) ? i = I.NUMBER : g(e, r.bools) ? i = I.BOOLEAN : g(e, r.arrays) && (i = I.ARRAY), i;
+      let a = I.BOOLEAN;
+      return g(e, r.strings) ? a = I.STRING : g(e, r.numbers) ? a = I.NUMBER : g(e, r.bools) ? a = I.BOOLEAN : g(e, r.arrays) && (a = I.ARRAY), a;
     }
     function T(e) {
       return e === void 0;
@@ -494,11 +494,11 @@ class Ne {
     };
   }
 }
-function ze(a) {
+function ze(i) {
   const n = [], m = /* @__PURE__ */ Object.create(null);
   let s = !0;
-  for (Object.keys(a).forEach(function(u) {
-    n.push([].concat(a[u], u));
+  for (Object.keys(i).forEach(function(u) {
+    n.push([].concat(i[u], u));
   }); s; ) {
     s = !1;
     for (let u = 0; u < n.length; u++)
@@ -518,14 +518,14 @@ function ze(a) {
     k !== void 0 && typeof k == "string" && (m[k] = u);
   }), m;
 }
-function Z(a) {
-  return a !== void 0 ? a + 1 : 1;
+function Z(i) {
+  return i !== void 0 ? i + 1 : 1;
 }
-function ce(a) {
-  return a === "__proto__" ? "___proto___" : a;
+function ce(i) {
+  return i === "__proto__" ? "___proto___" : i;
 }
-function je(a) {
-  return typeof a == "string" && (a[0] === "'" || a[0] === '"') && a[a.length - 1] === a[0] ? a.substring(1, a.length - 1) : a;
+function je(i) {
+  return typeof i == "string" && (i[0] === "'" || i[0] === '"') && i[i.length - 1] === i[0] ? i.substring(1, i.length - 1) : i;
 }
 /**
  * @fileoverview Main entrypoint for libraries using yargs-parser in Node.js
@@ -545,14 +545,14 @@ new Ne({
   env: () => Qe,
   format: he,
   normalize: Ie,
-  resolve: ie,
+  resolve: ae,
   // TODO: figure  out a  way to combine ESM and CJS coverage, such  that
   // we can exercise all the lines below:
-  require: (a) => {
+  require: (i) => {
     if (typeof require < "u")
-      return require(a);
-    if (a.match(/\.json$/))
-      return JSON.parse(_e(a, "utf8"));
+      return require(i);
+    if (i.match(/\.json$/))
+      return JSON.parse(_e(i, "utf8"));
     throw Error("only .json config files are supported in ESM");
   }
 });
@@ -562,10 +562,10 @@ const Fe = {
     writeFile: Le
   },
   format: he,
-  resolve: ie,
-  exists: (a) => {
+  resolve: ae,
+  exists: (i) => {
     try {
-      return Pe(a).isFile();
+      return Pe(i).isFile();
     } catch {
       return !1;
     }
@@ -658,9 +658,9 @@ class De {
     return M.exists(n);
   }
 }
-function Ve(a, n) {
+function Ve(i, n) {
   M = n;
-  const m = new De(a);
+  const m = new De(i);
   return {
     __: m.__.bind(m),
     __n: m.__n.bind(m),
@@ -670,7 +670,7 @@ function Ve(a, n) {
     locale: m.locale
   };
 }
-const $e = (a) => Ve(a, Fe);
+const $e = (i) => Ve(i, Fe);
 let z;
 try {
   z = Te(import.meta.url);
@@ -679,10 +679,10 @@ try {
 }
 const He = z.substring(0, z.lastIndexOf("node_modules"));
 He || process.cwd(), process.cwd, process.exit, process.nextTick, typeof process.stdout.columns < "u" && process.stdout.columns, $e({
-  directory: ie(z, "../../../locales"),
+  directory: ae(z, "../../../locales"),
   updateFiles: !1
 });
-const ae = [
+const ie = [
   {
     id: "anthropic",
     name: "Anthropic",
@@ -1143,29 +1143,52 @@ const ae = [
             required: !0
           }
         ]
+      },
+      {
+        api_flavor: "anthropic",
+        root: "usage",
+        model_path: "model",
+        mappings: [
+          {
+            path: "input_tokens",
+            dest: "input_tokens",
+            required: !0
+          },
+          {
+            path: "cache_creation_input_tokens",
+            dest: "input_tokens",
+            required: !1
+          },
+          {
+            path: "cache_read_input_tokens",
+            dest: "input_tokens",
+            required: !1
+          },
+          {
+            path: "cache_creation_input_tokens",
+            dest: "cache_write_tokens",
+            required: !1
+          },
+          {
+            path: "cache_read_input_tokens",
+            dest: "cache_read_tokens",
+            required: !1
+          },
+          {
+            path: "output_tokens",
+            dest: "output_tokens",
+            required: !0
+          }
+        ]
       }
     ],
     models: [
       {
-        id: "meta.llama3-8b-instruct-v1:0",
-        match: {
-          contains: "llama3-8b-instruct-v1"
-        },
-        prices: {
-          input_mtok: 0.3,
-          output_mtok: 0.6
-        }
-      },
-      {
-        id: "nova-lite-v1",
-        name: "Nova Lite 1.0",
+        id: "amazon.nova-lite-v1:0",
+        name: "Nova Lite",
         description: "Amazon Nova Lite 1.0 is a very low-cost multimodal model from Amazon that focused on fast processing of image, video, and text inputs to generate text output. Amazon Nova Lite can handle real-time customer interactions, document analysis, and visual question-answering tasks with high accuracy.",
         match: {
-          or: [
-            {
-              contains: "nova-lite-v1"
-            }
-          ]
+          contains: "nova-lite"
         },
         prices: {
           input_mtok: 0.06,
@@ -1174,15 +1197,11 @@ const ae = [
         }
       },
       {
-        id: "nova-micro-v1",
-        name: "Nova Micro 1.0",
+        id: "amazon.nova-micro-v1:0",
+        name: "Nova Micro",
         description: "Amazon Nova Micro 1.0 is a text-only model that delivers the lowest latency responses in the Amazon Nova family of models at a very low cost. With a context length of 128K tokens and optimized for speed and cost, Amazon Nova Micro excels at tasks such as text summarization, translation, content classification, interactive chat, and brainstorming. It has  simple mathematical reasoning and coding abilities.",
         match: {
-          or: [
-            {
-              contains: "nova-micro-v1"
-            }
-          ]
+          contains: "nova-micro"
         },
         prices: {
           input_mtok: 0.035,
@@ -1191,21 +1210,315 @@ const ae = [
         }
       },
       {
-        id: "nova-pro-v1",
-        name: "Nova Pro 1.0",
+        id: "amazon.nova-premier-v1:0",
+        name: "Nova Premier",
+        match: {
+          contains: "nova-premier"
+        },
+        prices: {
+          input_mtok: 2.5,
+          cache_read_mtok: 0.625,
+          output_mtok: 12.5
+        }
+      },
+      {
+        id: "amazon.nova-pro-v1:0",
+        name: "Nova Pro",
         description: "Amazon Nova Pro 1.0 is a capable multimodal model from Amazon focused on providing a combination of accuracy, speed, and cost for a wide range of tasks. As of December 2024, it achieves state-of-the-art performance on key benchmarks including visual question answering (TextVQA) and video understanding (VATEX).",
         match: {
-          or: [
-            {
-              contains: "nova-pro-v1"
-            }
-          ]
+          contains: "nova-pro"
         },
         prices: {
           input_mtok: 0.8,
           cache_read_mtok: 0.2,
           output_mtok: 3.2
         }
+      },
+      {
+        id: "amazon.nova-sonic-v1:0",
+        name: "Nova Sonic",
+        match: {
+          contains: "nova-sonic"
+        },
+        prices: {
+          input_mtok: 0.06,
+          output_mtok: 0.24,
+          input_audio_mtok: 3.4,
+          output_audio_mtok: 13.6
+        }
+      },
+      {
+        id: "amazon.titan-embed-text-v1",
+        name: "Titan Embeddings G1 - Text",
+        match: {
+          contains: "titan-embed-text"
+        },
+        prices: {
+          input_mtok: 0.1
+        }
+      },
+      {
+        id: "amazon.titan-text-express-v1",
+        name: "Titan Text G1 - Express",
+        match: {
+          contains: "titan-text-express"
+        },
+        prices: {
+          input_mtok: 0.2,
+          output_mtok: 0.6
+        }
+      },
+      {
+        id: "amazon.titan-text-lite-v1",
+        name: "Titan Text G1 - Lite",
+        match: {
+          contains: "titan-text-lite"
+        },
+        prices: {
+          input_mtok: 0.15,
+          output_mtok: 0.2
+        }
+      },
+      {
+        id: "anthropic.claude-3-haiku-20240307-v1:0",
+        name: "Claude 3 Haiku",
+        match: {
+          contains: "claude-3-haiku-20240307"
+        },
+        prices: {
+          input_mtok: 0.25
+        }
+      },
+      {
+        id: "deepseek.r1-v1:0",
+        name: "DeepSeek-R1",
+        match: {
+          contains: "r1"
+        },
+        prices: {
+          input_mtok: 1.35,
+          output_mtok: 5.4
+        }
+      },
+      {
+        id: "meta.llama3-1-70b-instruct-v1:0",
+        name: "Llama 3.1 70B Instruct",
+        match: {
+          contains: "llama3-1-70b-instruct"
+        },
+        prices: {
+          input_mtok: 0.72,
+          output_mtok: 0.72
+        }
+      },
+      {
+        id: "meta.llama3-1-8b-instruct-v1:0",
+        name: "Llama 3.1 8B Instruct",
+        match: {
+          contains: "llama3-1-8b-instruct"
+        },
+        prices: {
+          input_mtok: 0.22,
+          output_mtok: 0.22
+        }
+      },
+      {
+        id: "meta.llama3-2-11b-instruct-v1:0",
+        name: "Llama 3.2 11B Instruct",
+        match: {
+          contains: "llama3-2-11b-instruct"
+        },
+        prices: {
+          input_mtok: 0.16,
+          output_mtok: 0.16
+        }
+      },
+      {
+        id: "meta.llama3-2-1b-instruct-v1:0",
+        name: "Llama 3.2 1B Instruct",
+        match: {
+          contains: "llama3-2-1b-instruct"
+        },
+        prices: {
+          input_mtok: 0.1,
+          output_mtok: 0.1
+        }
+      },
+      {
+        id: "meta.llama3-2-3b-instruct-v1:0",
+        name: "Llama 3.2 3B Instruct",
+        match: {
+          contains: "llama3-2-3b-instruct"
+        },
+        prices: {
+          input_mtok: 0.15,
+          output_mtok: 0.15
+        }
+      },
+      {
+        id: "meta.llama3-2-90b-instruct-v1:0",
+        name: "Llama 3.2 90B Instruct",
+        match: {
+          contains: "llama3-2-90b-instruct"
+        },
+        prices: {
+          input_mtok: 0.72,
+          output_mtok: 0.72
+        }
+      },
+      {
+        id: "meta.llama3-3-70b-instruct-v1:0",
+        name: "Llama 3.3 70B Instruct",
+        match: {
+          contains: "llama3-3-70b-instruct"
+        },
+        prices: {
+          input_mtok: 0.72,
+          output_mtok: 0.72
+        }
+      },
+      {
+        id: "meta.llama3-70b-instruct-v1:0",
+        name: "Llama 3 70B Instruct",
+        match: {
+          contains: "llama3-70b-instruct"
+        },
+        prices: {
+          input_mtok: 2.65,
+          output_mtok: 3.5
+        }
+      },
+      {
+        id: "meta.llama3-8b-instruct-v1:0",
+        name: "Llama 3 8B Instruct",
+        match: {
+          contains: "llama3-8b-instruct"
+        },
+        prices: {
+          input_mtok: 0.3,
+          output_mtok: 0.6
+        }
+      },
+      {
+        id: "meta.llama4-maverick-17b-instruct-v1:0",
+        name: "Llama 4 Maverick 17B Instruct",
+        match: {
+          contains: "llama4-maverick-17b-instruct"
+        },
+        prices: {
+          input_mtok: 0.24,
+          output_mtok: 0.97
+        }
+      },
+      {
+        id: "meta.llama4-scout-17b-instruct-v1:0",
+        name: "Llama 4 Scout 17B Instruct",
+        match: {
+          contains: "llama4-scout-17b-instruct"
+        },
+        prices: {
+          input_mtok: 0.17,
+          output_mtok: 0.66
+        }
+      },
+      {
+        id: "mistral.mistral-7b-instruct-v0:2",
+        name: "Mistral 7B Instruct",
+        match: {
+          contains: "mistral-7b-instruct"
+        },
+        prices: {
+          input_mtok: 0.15,
+          output_mtok: 0.2
+        }
+      },
+      {
+        id: "mistral.mistral-large-2402-v1:0",
+        name: "Mistral Large (24.02)",
+        match: {
+          contains: "mistral-large-2402"
+        },
+        prices: {
+          input_mtok: 4,
+          output_mtok: 12
+        }
+      },
+      {
+        id: "mistral.mistral-small-2402-v1:0",
+        name: "Mistral Small (24.02)",
+        match: {
+          contains: "mistral-small-2402"
+        },
+        prices: {
+          input_mtok: 1,
+          output_mtok: 3
+        }
+      },
+      {
+        id: "mistral.mixtral-8x7b-instruct-v0:1",
+        name: "Mixtral 8x7B Instruct",
+        match: {
+          contains: "mixtral-8x7b-instruct"
+        },
+        prices: {
+          input_mtok: 0.45,
+          output_mtok: 0.7
+        }
+      },
+      {
+        id: "mistral.pixtral-large-2502-v1:0",
+        name: "Pixtral Large (25.02)",
+        match: {
+          contains: "pixtral-large-2502"
+        },
+        prices: {
+          input_mtok: 2,
+          output_mtok: 6
+        }
+      },
+      {
+        id: "openai.gpt-oss-120b-1:0",
+        name: "gpt-oss-120b",
+        match: {
+          contains: "gpt-oss-120b"
+        },
+        prices: {
+          input_mtok: 0.15,
+          output_mtok: 0.6
+        }
+      },
+      {
+        id: "openai.gpt-oss-20b-1:0",
+        name: "gpt-oss-20b",
+        match: {
+          contains: "gpt-oss-20b"
+        },
+        prices: {
+          input_mtok: 0.07,
+          output_mtok: 0.3
+        }
+      },
+      {
+        id: "qwen.qwen3-32b-v1:0",
+        name: "Qwen3 32B (dense)",
+        match: {
+          contains: "qwen3-32b"
+        },
+        prices: {
+          input_mtok: 0.15,
+          output_mtok: 0.6
+        }
+      },
+      {
+        id: "qwen.qwen3-coder-30b-a3b-v1:0",
+        name: "Qwen3-Coder-30B-A3B-Instruct",
+        match: {
+          contains: "qwen3-coder-30b-a3b"
+        },
+        prices: {
+          input_mtok: 0.15,
+          output_mtok: 0.6
+        }
       }
     ]
   },
@@ -12606,37 +12919,37 @@ Compared to other leading proprietary and open-weights models Command A delivers
     ]
   }
 ];
-function We(a, n) {
+function We(i, n) {
   if (n <= 0) return 0;
   let m = 0;
-  const s = [...a.tiers].sort((_, h) => _.start - h.start), u = s[0]?.start ?? n, k = Math.min(n, u);
-  m += k * a.base / 1e6;
+  const s = [...i.tiers].sort((_, h) => _.start - h.start), u = s[0]?.start ?? n, k = Math.min(n, u);
+  m += k * i.base / 1e6;
   for (let _ = 0; _ < s.length; _++) {
     const h = s[_], f = s[_ + 1]?.start ?? 1 / 0, y = Math.max(0, Math.min(n, f) - h.start);
     y > 0 && (m += y * h.price / 1e6);
   }
   return m;
 }
-function O(a, n, m) {
-  return a === void 0 || n === void 0 ? 0 : typeof a == "number" ? a * n / 1e6 : We(a, n);
+function O(i, n, m) {
+  return i === void 0 || n === void 0 ? 0 : typeof i == "number" ? i * n / 1e6 : We(i, n);
 }
-function Ue(a, n) {
+function Ue(i, n) {
   let m = 0, s = 0;
-  const u = a.cache_read_tokens ?? 0, k = a.cache_write_tokens ?? 0, _ = a.cache_audio_read_tokens ?? 0, h = a.output_audio_tokens ?? 0;
-  let f = a.input_audio_tokens ?? 0;
+  const u = i.cache_read_tokens ?? 0, k = i.cache_write_tokens ?? 0, _ = i.cache_audio_read_tokens ?? 0, h = i.output_audio_tokens ?? 0;
+  let f = i.input_audio_tokens ?? 0;
   if (f -= _, f < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than input_audio_tokens");
-  let y = a.input_tokens ?? 0;
+  let y = i.input_tokens ?? 0;
   if (y -= u, y -= k, y -= f, y < 0)
     throw new Error("Uncached text input tokens cannot be negative");
   let P = u;
   if (P -= _, 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, k), m += O(n.input_audio_mtok, f), m += O(n.cache_audio_read_mtok, _);
-  let S = a.output_tokens ?? 0;
+  let S = i.output_tokens ?? 0;
   if (S -= h, S < 0)
     throw new Error("output_audio_tokens cannot be greater than output_tokens");
-  s += O(n.output_mtok, S), s += O(n.output_audio_mtok, a.output_audio_tokens);
+  s += O(n.output_mtok, S), s += O(n.output_audio_mtok, i.output_audio_tokens);
   let G = m + s;
   return n.requests_kcount !== void 0 && (G += n.requests_kcount / 1e3), {
     input_price: m,
@@ -12644,11 +12957,11 @@ function Ue(a, n) {
     total_price: G
   };
 }
-function Ke(a, n) {
-  if (!Array.isArray(a.prices))
-    return a.prices;
-  for (let m = a.prices.length - 1; m >= 0; m--) {
-    const s = a.prices[m], u = s.constraint;
+function Ke(i, n) {
+  if (!Array.isArray(i.prices))
+    return i.prices;
+  for (let m = i.prices.length - 1; m >= 0; m--) {
+    const s = i.prices[m], u = s.constraint;
     if (u === void 0)
       return s.prices;
     if (u.type === "start_date") {
@@ -12663,34 +12976,34 @@ function Ke(a, n) {
         return s.prices;
     }
   }
-  return a.prices[0].prices;
+  return i.prices[0].prices;
 }
-function j(a, n) {
-  return "or" in a ? a.or.some((m) => j(m, n)) : "and" in a ? a.and.every((m) => j(m, n)) : "equals" in a ? n === a.equals : "starts_with" in a ? n.startsWith(a.starts_with) : "ends_with" in a ? n.endsWith(a.ends_with) : "contains" in a ? n.includes(a.contains) : "regex" in a ? new RegExp(a.regex).test(n) : !1;
+function j(i, n) {
+  return "or" in i ? i.or.some((m) => j(m, n)) : "and" in i ? i.and.every((m) => j(m, n)) : "equals" in i ? n === i.equals : "starts_with" in i ? n.startsWith(i.starts_with) : "ends_with" in i ? n.endsWith(i.ends_with) : "contains" in i ? n.includes(i.contains) : "regex" in i ? new RegExp(i.regex).test(n) : !1;
 }
-function Ye(a, n) {
-  const m = n.toLowerCase().trim(), s = a.find((u) => u.id === m);
-  return s || a.find((u) => u.provider_match && j(u.provider_match, m));
+function Ye(i, n) {
+  const m = n.toLowerCase().trim(), s = i.find((u) => u.id === m);
+  return s || i.find((u) => u.provider_match && j(u.provider_match, m));
 }
-function Je(a, { modelId: n, providerApiUrl: m, providerId: s }) {
+function Je(i, { modelId: n, providerApiUrl: m, providerId: s }) {
   if (s)
-    return Ye(a, s);
+    return Ye(i, s);
   if (m)
-    return a.find((u) => new RegExp(u.api_pattern).test(m));
+    return i.find((u) => new RegExp(u.api_pattern).test(m));
   if (n)
-    return a.find((u) => u.model_match && j(u.model_match, n));
+    return i.find((u) => u.model_match && j(u.model_match, n));
 }
-function Ze(a, n) {
-  return a.find((m) => j(m.match, n));
+function Ze(i, n) {
+  return i.find((m) => j(m.match, n));
 }
-let Xe = ae;
-Promise.resolve(ae);
-function et(a, n, m) {
+let Xe = ie;
+Promise.resolve(ie);
+function et(i, n, m) {
   const s = n.toLowerCase().trim(), u = m?.provider ?? Je(Xe, { modelId: s, providerApiUrl: m?.providerApiUrl, providerId: m?.providerId });
   if (!u) return null;
   const k = Ze(u.models, s);
   if (!k) return null;
-  const _ = m?.timestamp ?? /* @__PURE__ */ new Date(), h = Ke(k, _), f = Ue(a, h);
+  const _ = m?.timestamp ?? /* @__PURE__ */ new Date(), h = Ke(k, _), f = Ue(i, h);
   return {
     auto_update_timestamp: void 0,
     model: k,
@@ -12702,15 +13015,15 @@ function et(a, n, m) {
 const b = de(Ce(process.argv)).scriptName("genai-prices").command(
   "list [provider]",
   "List providers and models",
-  (a) => a.positional("provider", { describe: "Provider ID to filter", type: "string" })
+  (i) => i.positional("provider", { describe: "Provider ID to filter", type: "string" })
 ).command(
   "calc <model...>",
   "Calculate price",
-  (a) => a.positional("model", { array: !0, describe: "Model(s) (optionally provider:model)", type: "string" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("auto-update", { default: !1, type: "boolean" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" })
+  (i) => i.positional("model", { array: !0, describe: "Model(s) (optionally provider:model)", type: "string" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("auto-update", { default: !1, type: "boolean" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" })
 ).option("auto-update", { describe: "Enable auto-update from GitHub", type: "boolean" }).option("input-tokens", { type: "number" }).option("cache-write-tokens", { type: "number" }).option("cache-read-tokens", { type: "number" }).option("output-tokens", { type: "number" }).option("input-audio-tokens", { type: "number" }).option("cache-audio-read-tokens", { type: "number" }).option("output-audio-tokens", { type: "number" }).option("requests", { type: "number" }).option("provider", { type: "string" }).option("timestamp", { describe: "RFC3339 timestamp", type: "string" }).version("0.1.0").help().parseSync();
 function tt() {
   if (b._[0] === "list") {
-    const m = ae;
+    const m = ie;
     if (b.provider) {
       const s = m.find((u) => u.id === b.provider);
       s || (console.error(`Provider ${b.provider} not found.`), process.exit(1)), console.log(`${s.name}: (${s.models.length} models)`);