@pydantic/genai-prices 0.0.60 → 0.0.62

package/dist/cli.js

@@ -172,7 +172,7 @@ class De {
     let L = null;
     Ae();
     let V = [];
-    const w = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), se = {};
+    const b = Object.assign(/* @__PURE__ */ Object.create(null), { _: [] }), se = {};
     for (let e = 0; e < r.length; e++) {
       const a = r[e], c = a.replace(/^-{3,}/, "---");
       let n, t, l, p, d, v;
@@ -182,39 +182,39 @@ class De {
         Y(a);
         continue;
       } else if (a.match(/^--.+=/) || !k["short-option-groups"] && a.match(/^-.+=/))
-        p = a.match(/^--?([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && (g(p[1], m.arrays) ? e = K(e, p[1], r, p[2]) : g(p[1], m.nargs) !== !1 ? e = j(e, p[1], r, p[2]) : b(p[1], p[2], !0));
+        p = a.match(/^--?([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && (g(p[1], m.arrays) ? e = K(e, p[1], r, p[2]) : g(p[1], m.nargs) !== !1 ? e = j(e, p[1], r, p[2]) : w(p[1], p[2], !0));
       else if (a.match(U) && k["boolean-negation"])
-        p = a.match(U), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], b(t, g(t, m.arrays) ? [!1] : !1));
+        p = a.match(U), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], w(t, g(t, m.arrays) ? [!1] : !1));
       else if (a.match(/^--.+/) || !k["short-option-groups"] && a.match(/^-[^-]+/))
-        p = a.match(/^--?(.+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(I)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (b(t, d), e++) : b(t, R(t))));
+        p = a.match(/^--?(.+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!d.match(/^-/) || d.match(I)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (w(t, d), e++) : w(t, R(t))));
       else if (a.match(/^-.\..+=/))
-        p = a.match(/^-([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && b(p[1], p[2]);
+        p = a.match(/^-([^=]+)=([\s\S]*)$/), p !== null && Array.isArray(p) && p.length >= 3 && w(p[1], p[2]);
       else if (a.match(/^-.\..+/) && !a.match(I))
-        d = r[e + 1], p = a.match(/^-(.\..+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], d !== void 0 && !d.match(/^-/) && !g(t, m.bools) && !g(t, m.counts) ? (b(t, d), e++) : b(t, R(t)));
+        d = r[e + 1], p = a.match(/^-(.\..+)/), p !== null && Array.isArray(p) && p.length >= 2 && (t = p[1], d !== void 0 && !d.match(/^-/) && !g(t, m.bools) && !g(t, m.counts) ? (w(t, d), e++) : w(t, R(t)));
       else if (a.match(/^-[^-]+/) && !a.match(I)) {
         l = a.slice(1, -1).split(""), n = !1;
         for (let x = 0; x < l.length; x++) {
           if (d = a.slice(x + 2), l[x + 1] && l[x + 1] === "=") {
-            v = a.slice(x + 3), t = l[x], g(t, m.arrays) ? e = K(e, t, r, v) : g(t, m.nargs) !== !1 ? e = j(e, t, r, v) : b(t, v), n = !0;
+            v = a.slice(x + 3), t = l[x], g(t, m.arrays) ? e = K(e, t, r, v) : g(t, m.nargs) !== !1 ? e = j(e, t, r, v) : w(t, v), n = !0;
             break;
           }
           if (d === "-") {
-            b(l[x], d);
+            w(l[x], d);
             continue;
           }
           if (/[A-Za-z]/.test(l[x]) && /^-?\d+(\.\d*)?(e-?\d+)?$/.test(d) && g(d, m.bools) === !1) {
-            b(l[x], d), n = !0;
+            w(l[x], d), n = !0;
             break;
           }
           if (l[x + 1] && l[x + 1].match(/\W/)) {
-            b(l[x], d), n = !0;
+            w(l[x], d), n = !0;
             break;
           } else
-            b(l[x], R(l[x]));
+            w(l[x], R(l[x]));
         }
-        t = a.slice(-1)[0], !n && t !== "-" && (g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(I)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (b(t, d), e++) : b(t, R(t))));
+        t = a.slice(-1)[0], !n && t !== "-" && (g(t, m.arrays) ? e = K(e, t, r) : g(t, m.nargs) !== !1 ? e = j(e, t, r) : (d = r[e + 1], d !== void 0 && (!/^(-|--)[^-]/.test(d) || d.match(I)) && !g(t, m.bools) && !g(t, m.counts) || /^(true|false)$/.test(d) ? (w(t, d), e++) : w(t, R(t))));
       } else if (a.match(/^-[0-9]$/) && a.match(I) && g(a.slice(1), m.bools))
-        t = a.slice(1), b(t, R(t));
+        t = a.slice(1), w(t, R(t));
       else if (a === "--") {
         V = r.slice(e + 1);
         break;
@@ -224,23 +224,23 @@ class De {
       } else
         Y(a);
     }
-    me(w, !0), me(w, !1), fe(w), be(), ue(w, m.aliases, q, !0), we(w), k["set-placeholder-key"] && ve(w), Object.keys(m.counts).forEach(function(e) {
-      N(w, e.split(".")) || b(e, 0);
-    }), Q && V.length && (w[y] = []), V.forEach(function(e) {
-      w[y].push(e);
-    }), k["camel-case-expansion"] && k["strip-dashed"] && Object.keys(w).filter((e) => e !== "--" && e.includes("-")).forEach((e) => {
-      delete w[e];
+    me(b, !0), me(b, !1), fe(b), we(), ue(b, m.aliases, q, !0), be(b), k["set-placeholder-key"] && ve(b), Object.keys(m.counts).forEach(function(e) {
+      N(b, e.split(".")) || w(e, 0);
+    }), Q && V.length && (b[y] = []), V.forEach(function(e) {
+      b[y].push(e);
+    }), k["camel-case-expansion"] && k["strip-dashed"] && Object.keys(b).filter((e) => e !== "--" && e.includes("-")).forEach((e) => {
+      delete b[e];
     }), k["strip-aliased"] && [].concat(...Object.keys(_).map((e) => _[e])).forEach((e) => {
-      k["camel-case-expansion"] && e.includes("-") && delete w[e.split(".").map((a) => W(a)).join(".")], delete w[e];
+      k["camel-case-expansion"] && e.includes("-") && delete b[e.split(".").map((a) => W(a)).join(".")], delete b[e];
     });
     function Y(e) {
       const a = H("_", e);
-      (typeof a == "string" || typeof a == "number") && w._.push(a);
+      (typeof a == "string" || typeof a == "number") && b._.push(a);
     }
     function j(e, a, c, n) {
       let t, l = g(a, m.nargs);
       if (l = typeof l != "number" || isNaN(l) ? 1 : l, l === 0)
-        return G(n) || (L = Error(M("Argument unexpected for: %s", a))), b(a, R(a)), e;
+        return G(n) || (L = Error(M("Argument unexpected for: %s", a))), w(a, R(a)), e;
       let p = G(n) ? 0 : 1;
       if (k["nargs-eats-options"])
         c.length - (e + 1) + p < l && (L = Error(M("Not enough arguments following: %s", a))), p = l;
@@ -250,8 +250,8 @@ class De {
         p < l && (L = Error(M("Not enough arguments following: %s", a)));
       }
       let d = Math.min(p, l);
-      for (!G(n) && d > 0 && (b(a, n), d--), t = e + 1; t < d + e + 1; t++)
-        b(a, c[t]);
+      for (!G(n) && d > 0 && (w(a, n), d--), t = e + 1; t < d + e + 1; t++)
+        w(a, c[t]);
       return e + d;
     }
     function K(e, a, c, n) {
@@ -269,9 +269,9 @@ class De {
         for (let d = e + 1; d < c.length && !(!k["greedy-arrays"] && t.length > 0 || p && typeof p == "number" && t.length >= p || (l = c[d], /^-/.test(l) && !I.test(l) && !$(l))); d++)
           e = d, t.push(J(a, l, h));
       }
-      return typeof p == "number" && (p && t.length < p || isNaN(p) && t.length === 0) && (L = Error(M("Not enough arguments following: %s", a))), b(a, t), e;
+      return typeof p == "number" && (p && t.length < p || isNaN(p) && t.length === 0) && (L = Error(M("Not enough arguments following: %s", a))), w(a, t), e;
     }
-    function b(e, a, c = h) {
+    function w(e, a, c = h) {
       if (/-/.test(e) && k["camel-case-expansion"]) {
         const l = e.split(".").map(function(p) {
           return W(p);
@@ -279,13 +279,13 @@ class De {
         re(e, l);
       }
       const n = J(e, a, c), t = e.split(".");
-      E(w, t, n), m.aliases[e] && m.aliases[e].forEach(function(l) {
+      E(b, t, n), m.aliases[e] && m.aliases[e].forEach(function(l) {
         const p = l.split(".");
-        E(w, p, n);
+        E(b, p, n);
       }), t.length > 1 && k["dot-notation"] && (m.aliases[t[0]] || []).forEach(function(l) {
         let p = l.split(".");
         const d = [].concat(t);
-        d.shift(), p = p.concat(d), (m.aliases[e] || []).includes(p.join(".")) || E(w, p, n);
+        d.shift(), p = p.concat(d), (m.aliases[e] || []).includes(p.join(".")) || E(b, p, n);
       }), g(e, m.normalize) && !g(e, m.arrays) && [e].concat(m.aliases[e] || []).forEach(function(p) {
         Object.defineProperty(se, p, {
           enumerable: !0,
@@ -340,10 +340,10 @@ class De {
     function Z(e, a) {
       Object.keys(e).forEach(function(c) {
         const n = e[c], t = a ? a + "." + c : c;
-        typeof n == "object" && n !== null && !Array.isArray(n) && k["dot-notation"] ? Z(n, t) : (!N(w, t.split(".")) || g(t, m.arrays) && k["combine-arrays"]) && b(t, n);
+        typeof n == "object" && n !== null && !Array.isArray(n) && k["dot-notation"] ? Z(n, t) : (!N(b, t.split(".")) || g(t, m.arrays) && k["combine-arrays"]) && w(t, n);
       });
     }
-    function be() {
+    function we() {
       typeof T < "u" && T.forEach(function(e) {
         Z(e);
       });
@@ -357,11 +357,11 @@ class De {
           const l = t.split("__").map(function(p, d) {
             return d === 0 && (p = p.substring(c.length)), W(p);
           });
-          (a && m.configs[l.join(".")] || !a) && !N(e, l) && b(l.join("."), n[t]);
+          (a && m.configs[l.join(".")] || !a) && !N(e, l) && w(l.join("."), n[t]);
         }
       });
     }
-    function we(e) {
+    function be(e) {
       let a;
       const c = /* @__PURE__ */ new Set();
       Object.keys(e).forEach(function(n) {
@@ -486,7 +486,7 @@ class De {
     }
     return {
       aliases: Object.assign({}, m.aliases),
-      argv: Object.assign(se, w),
+      argv: Object.assign(se, b),
       configuration: k,
       defaulted: Object.assign({}, O),
       error: L,
@@ -1327,7 +1327,14 @@ const ne = [
     pricing_urls: ["https://aws.amazon.com/bedrock/pricing/"],
     api_pattern: "https://bedrock-runtime\\.[a-z0-9-]+\\.amazonaws\\.com/",
     provider_match: {
-      contains: "bedrock"
+      or: [
+        {
+          contains: "bedrock"
+        },
+        {
+          contains: "amazon"
+        }
+      ]
     },
     extractors: [
       {
@@ -4251,6 +4258,21 @@ Compared to other leading proprietary and open-weights models Command A delivers
           }
         }
       },
+      {
+        id: "gemini-3.5-flash",
+        name: "Gemini 3.5 Flash",
+        description: "Google's most intelligent model built for speed, combining frontier intelligence with improved reasoning, coding, and multimodal understanding.",
+        match: {
+          starts_with: "gemini-3.5-flash"
+        },
+        context_window: 1e6,
+        price_comments: "See https://ai.google.dev/gemini-api/docs/pricing. Standard tier pricing shown; Batch and Flex tiers offer 50% discount on input/output.",
+        prices: {
+          input_mtok: 1.5,
+          cache_read_mtok: 0.15,
+          output_mtok: 9
+        }
+      },
       {
         id: "gemini-embedding-001",
         match: {
@@ -10821,12 +10843,18 @@ Compared to other leading proprietary and open-weights models Command A delivers
             {
               equals: "gpt-5.5-2026-04-23"
             },
+            {
+              equals: "gpt-5.5-2026-04-24"
+            },
             {
               equals: "gpt-5-5"
             },
             {
               equals: "gpt-5-5-2026-04-23"
             },
+            {
+              equals: "gpt-5-5-2026-04-24"
+            },
             {
               equals: "gpt-5.5-chat"
             },