@pydantic/genai-prices 0.0.49 → 0.0.50

package/dist/index.d.cts

@@ -131,9 +131,13 @@ export declare interface Tier {
     start: number;
 }
 
-export declare interface TieredPrices {
+export declare class TieredPrices {
     base: number;
     tiers: Tier[];
+    constructor(data: {
+        base: number;
+        tiers: Tier[];
+    });
 }
 
 export declare interface TimeOfDateConstraint {

package/dist/index.d.ts

@@ -131,9 +131,13 @@ export declare interface Tier {
     start: number;
 }
 
-export declare interface TieredPrices {
+export declare class TieredPrices {
     base: number;
     tiers: Tier[];
+    constructor(data: {
+        base: number;
+        tiers: Tier[];
+    });
 }
 
 export declare interface TimeOfDateConstraint {

package/dist/index.js

@@ -1,4 +1,4 @@
-const x = [
+const B = [
   {
     id: "anthropic",
     name: "Anthropic",
@@ -3238,6 +3238,51 @@ Compared to other leading proprietary and open-weights models Command A delivers
           }
         }
       },
+      {
+        id: "gemini-3-flash-preview",
+        name: "Gemini 3 Flash Preview",
+        description: "Google's ultra-fast frontier model optimized for speed and efficiency. Delivers state-of-the-art performance while maintaining low latency and cost, with improved reasoning and coding capabilities.",
+        match: {
+          or: [
+            {
+              equals: "gemini-3-flash-preview"
+            },
+            {
+              starts_with: "gemini-3-flash-preview-"
+            }
+          ]
+        },
+        context_window: 1e6,
+        price_comments: "See https://ai.google.dev/gemini-api/docs/pricing. Standard pricing shown; Batch API offers 50% discount on input/output.",
+        prices: {
+          input_mtok: 0.5,
+          cache_read_mtok: 0.05,
+          output_mtok: 3,
+          input_audio_mtok: 1,
+          cache_audio_read_mtok: 0.1
+        }
+      },
+      {
+        id: "gemini-3-pro-image-preview",
+        name: "Gemini 3 Pro Image Preview",
+        description: "Google's image generation model optimized for high-quality image generation. Supports 1K/2K and 4K resolution outputs with flexible pricing based on image dimensions.",
+        match: {
+          or: [
+            {
+              starts_with: "gemini-3-pro-image-preview"
+            },
+            {
+              equals: "gemini-3-pro-image-preview"
+            }
+          ]
+        },
+        context_window: 1e6,
+        price_comments: "See https://ai.google.dev/gemini-api/docs/pricing#gemini-3-pro-image. Image output is priced at $120 per 1M tokens, with each 1K/2K image = 1120 tokens = $0.134/image and each 4K image = 2000 tokens = $0.24/image.",
+        prices: {
+          input_mtok: 2,
+          output_mtok: 120
+        }
+      },
       {
         id: "gemini-3-pro-preview",
         name: "Gemini 3 Pro Preview",
@@ -3248,7 +3293,7 @@ Compared to other leading proprietary and open-weights models Command A delivers
               starts_with: "gemini-3-pro-preview"
             },
             {
-              starts_with: "gemini-3-pro-image-preview"
+              equals: "gemini-3-pro-text-preview"
             }
           ]
         },
@@ -17537,49 +17582,114 @@ Compared to other leading proprietary and open-weights models Command A delivers
           cache_read_mtok: 0.75,
           output_mtok: 15
         }
+      },
+      {
+        id: "grok-4-1-fast-non-reasoning",
+        name: "Grok 4.1 Fast Non-Reasoning",
+        description: "A frontier multimodal model optimized specifically for high-performance agentic tool calling.",
+        match: {
+          or: [
+            {
+              equals: "grok-4-1-fast-non-reasoning"
+            },
+            {
+              equals: "grok-4-1-fast-non-reasoning-latest"
+            }
+          ]
+        },
+        context_window: 2e6,
+        prices: {
+          input_mtok: 0.2,
+          cache_read_mtok: 0.05,
+          output_mtok: 0.5
+        }
+      },
+      {
+        id: "grok-4-1-fast-reasoning",
+        name: "Grok 4.1 Fast Reasoning",
+        description: "A frontier multimodal model optimized specifically for high-performance agentic tool calling.",
+        match: {
+          or: [
+            {
+              equals: "grok-4-1-fast"
+            },
+            {
+              equals: "grok-4-1-fast-reasoning"
+            },
+            {
+              equals: "grok-4-1-fast-reasoning-latest"
+            }
+          ]
+        },
+        context_window: 2e6,
+        prices: {
+          input_mtok: 0.2,
+          cache_read_mtok: 0.05,
+          output_mtok: 0.5
+        }
+      },
+      {
+        id: "grok-code-fast-1",
+        name: "Grok Code Fast 1",
+        description: "A speedy and economical reasoning model that excels at agentic coding.",
+        match: {
+          or: [
+            {
+              equals: "grok-code-fast"
+            },
+            {
+              equals: "grok-code-fast-1"
+            },
+            {
+              equals: "grok-code-fast-1-0825"
+            }
+          ]
+        },
+        context_window: 256e3,
+        prices: {
+          input_mtok: 0.2,
+          cache_read_mtok: 0.02,
+          output_mtok: 1.5
+        }
       }
     ]
   }
 ];
-function M(t, e) {
+function y(t, e, a) {
   if (e <= 0) return 0;
-  let a = 0;
-  const i = [...t.tiers].sort((m, n) => m.start - n.start), o = i[0]?.start ?? e, r = Math.min(e, o);
-  a += r * t.base / 1e6;
-  for (let m = 0; m < i.length; m++) {
-    const n = i[m], s = i[m + 1]?.start ?? 1 / 0, u = Math.max(0, Math.min(e, s) - n.start);
-    u > 0 && (a += u * n.price / 1e6);
-  }
-  return a;
+  let i = t.base;
+  for (const o of t.tiers)
+    a > o.start && (i = o.price);
+  return i * e / 1e6;
 }
-function c(t, e, a) {
-  return t === void 0 || e === void 0 ? 0 : typeof t == "number" ? t * e / 1e6 : M(t, e);
+function c(t, e, a, i) {
+  return t === void 0 || e === void 0 ? 0 : typeof t == "number" ? t * e / 1e6 : y(t, e, i);
 }
 function L(t, e) {
   let a = 0, i = 0;
-  const o = t.cache_read_tokens ?? 0, r = t.cache_write_tokens ?? 0, m = t.cache_audio_read_tokens ?? 0, n = t.output_audio_tokens ?? 0;
-  let s = t.input_audio_tokens ?? 0;
-  if (s -= m, s < 0)
+  const o = t.input_tokens ?? 0, r = t.cache_read_tokens ?? 0, u = t.cache_write_tokens ?? 0, n = t.cache_audio_read_tokens ?? 0, s = t.output_audio_tokens ?? 0;
+  let m = t.input_audio_tokens ?? 0;
+  if (m -= n, m < 0)
     throw new Error("cache_audio_read_tokens cannot be greater than input_audio_tokens");
-  let u = t.input_tokens ?? 0;
-  if (u -= o, u -= r, u -= s, u < 0)
+  let p = t.input_tokens ?? 0;
+  if (p -= r, p -= u, p -= m, p < 0)
     throw new Error("Uncached text input tokens cannot be negative");
-  let p = o;
-  if (p -= m, p < 0)
-    throw new Error("cache_audio_read_tokens cannot be greater than cache_read_tokens");
-  a += c(e.input_mtok, u), a += c(e.cache_read_mtok, p), a += c(e.cache_write_mtok, r), a += c(e.input_audio_mtok, s), a += c(e.cache_audio_read_mtok, m);
-  let k = t.output_tokens ?? 0;
+  let k = r;
   if (k -= n, k < 0)
+    throw new Error("cache_audio_read_tokens cannot be greater than cache_read_tokens");
+  a += c(e.input_mtok, p, "input_mtok", o), a += c(e.cache_read_mtok, k, "cache_read_mtok", o), a += c(e.cache_write_mtok, u, "cache_write_mtok", o), a += c(e.input_audio_mtok, m, "input_audio_mtok", o), a += c(e.cache_audio_read_mtok, n, "cache_audio_read_mtok", o);
+  let q = t.output_tokens ?? 0;
+  if (q -= s, q < 0)
     throw new Error("output_audio_tokens cannot be greater than output_tokens");
-  i += c(e.output_mtok, k), i += c(e.output_audio_mtok, t.output_audio_tokens);
-  let f = a + i;
-  return e.requests_kcount !== void 0 && (f += e.requests_kcount / 1e3), {
+  i += c(e.output_mtok, q, "output_mtok", o), i += c(e.output_audio_mtok, t.output_audio_tokens, "output_audio_mtok", o);
+  let v = a + i;
+  return e.requests_kcount !== void 0 && (v += e.requests_kcount / 1e3), {
     input_price: a,
     output_price: i,
-    total_price: f
+    total_price: v
   };
 }
-function y(t, e) {
+function Q(t, e) {
   if (!Array.isArray(t.prices))
     return t.prices;
   for (let a = t.prices.length - 1; a >= 0; a--) {
@@ -17590,11 +17700,11 @@ function y(t, e) {
       if (e >= new Date(o.start_date))
         return i.prices;
     } else {
-      const r = e.toISOString().slice(11, 19), m = o.start_time, n = o.end_time;
-      if (n < m) {
-        if (r >= m || r < n)
+      const r = e.toISOString().slice(11, 19), u = o.start_time, n = o.end_time;
+      if (n < u) {
+        if (r >= u || r < n)
           return i.prices;
-      } else if (r >= m && r < n)
+      } else if (r >= u && r < n)
         return i.prices;
     }
   }
@@ -17603,48 +17713,48 @@ function y(t, e) {
 function _(t, e) {
   return "or" in t ? t.or.some((a) => _(a, e)) : "and" in t ? t.and.every((a) => _(a, e)) : "equals" in t ? e === t.equals : "starts_with" in t ? e.startsWith(t.starts_with) : "ends_with" in t ? e.endsWith(t.ends_with) : "contains" in t ? e.includes(t.contains) : "regex" in t ? new RegExp(t.regex).test(e) : !1;
 }
-function Q(t, e) {
+function T(t, e) {
   const a = e.toLowerCase().trim(), i = t.find((o) => o.id === a);
   return i || t.find((o) => o.provider_match && _(o.provider_match, a));
 }
-function B(t, { modelId: e, providerApiUrl: a, providerId: i }) {
+function I(t, { modelId: e, providerApiUrl: a, providerId: i }) {
   if (i)
-    return Q(t, i);
+    return T(t, i);
   if (a)
     return t.find((o) => new RegExp(o.api_pattern).test(a));
   if (e)
     return t.find((o) => o.model_match && _(o.model_match, e));
 }
-function T(t, e) {
+function P(t, e) {
   return t.find((a) => _(a.match, e));
 }
-const P = "https://raw.githubusercontent.com/pydantic/genai-prices/main/prices/data.json";
-let g = x, w = Promise.resolve(x), b = null;
-function S(t) {
-  t !== null && ("then" in t ? (w = t, t.then((e) => {
+const S = "https://raw.githubusercontent.com/pydantic/genai-prices/main/prices/data.json";
+let g = B, b = Promise.resolve(B), f = null;
+function A(t) {
+  t !== null && ("then" in t ? (b = t, t.then((e) => {
     e !== null && (g = e);
-  })) : (w = Promise.resolve(t), g = t));
+  })) : (b = Promise.resolve(t), g = t));
 }
-function A(t) {
-  b = t;
+function G(t) {
+  f = t;
 }
 function C(t) {
   t({
-    onCalc: A,
-    remoteDataUrl: P,
-    setProviderData: S
+    onCalc: G,
+    remoteDataUrl: S,
+    setProviderData: A
   });
 }
-function z() {
-  return w;
+function N() {
+  return b;
 }
-function N(t, e, a) {
-  b?.();
-  const i = e.toLowerCase().trim(), o = a?.provider ?? B(g, { modelId: i, providerApiUrl: a?.providerApiUrl, providerId: a?.providerId });
+function V(t, e, a) {
+  f?.();
+  const i = e.toLowerCase().trim(), o = a?.provider ?? I(g, { modelId: i, providerApiUrl: a?.providerApiUrl, providerId: a?.providerId });
   if (!o) return null;
-  const r = T(o.models, i);
+  const r = P(o.models, i);
   if (!r) return null;
-  const m = a?.timestamp ?? /* @__PURE__ */ new Date(), n = y(r, m), s = L(t, n);
+  const u = a?.timestamp ?? /* @__PURE__ */ new Date(), n = Q(r, u), s = L(t, n);
   return {
     auto_update_timestamp: void 0,
     model: r,
@@ -17653,42 +17763,42 @@ function N(t, e, a) {
     ...s
   };
 }
-function V(t) {
-  return b?.(), B(g, t);
+function E(t) {
+  return f?.(), I(g, t);
 }
-function E(t, e, a) {
+function O(t, e, a) {
   if (a = a ?? "default", !t.extractors)
     throw new Error("No extraction logic defined for this provider");
   const i = t.extractors.find((s) => s.api_flavor === a);
   if (!i) {
-    const s = t.extractors.map((u) => u.api_flavor).join(", ");
+    const s = t.extractors.map((m) => m.api_flavor).join(", ");
     throw new Error(`Unknown apiFlavor '${a}', allowed values: ${s}`);
   }
   if (!h.guard(e))
     throw new Error(`Expected response data to be a mapping object, got ${l(e)}`);
-  const o = q(i.model_path, e, R, !1, []), r = I(i.root), m = q(r, e, h, !0, []), n = {};
+  const o = w(i.model_path, e, D, !1, []), r = M(i.root), u = w(r, e, h, !0, []), n = {};
   for (const s of i.mappings) {
-    const u = q(s.path, m, D, s.required, r);
-    if (u !== null) {
+    const m = w(s.path, u, z, s.required, r);
+    if (m !== null) {
       const p = n[s.dest] ?? 0;
-      n[s.dest] = p + u;
+      n[s.dest] = p + m;
     }
   }
   if (!Object.keys(n).length)
     throw new Error(`No usage information found at ${JSON.stringify(i.root)}`);
   return { model: o, usage: n };
 }
-function q(t, e, a, i, o) {
-  const [r, ...m] = I(t).reverse();
+function w(t, e, a, i, o) {
+  const [r, ...u] = M(t).reverse();
   if (typeof r != "string")
     throw new Error(`Expected last step of path to be a string, got ${l(r)}`);
-  m.reverse();
+  u.reverse();
   let n = e;
   const s = [];
-  for (const p of m) {
+  for (const p of u) {
     if (s.push(p), typeof p == "object")
       if (Array.isArray(n))
-        n = G(p, n);
+        n = R(p, n);
       else {
         if (i)
           throw new Error(`Expected \`${d(o, s)}\` value to be a mapping, got ${l(n)}`);
@@ -17713,19 +17823,19 @@ function q(t, e, a, i, o) {
       throw new Error(`Expected \`${d(o, s)}\` value to be a mapping, got ${l(n)}`);
     return null;
   }
-  const u = n[r];
-  if (typeof u > "u") {
+  const m = n[r];
+  if (typeof m > "u") {
     if (i)
       throw s.push(r), new Error(`Missing value at \`${d(o, s)}\``);
     return null;
   }
-  if (a.guard(u))
-    return u;
+  if (a.guard(m))
+    return m;
   if (i)
-    throw s.push(r), new Error(`Expected \`${d(o, s)}\` value to be a ${a.name}, got ${l(u)}`);
+    throw s.push(r), new Error(`Expected \`${d(o, s)}\` value to be a ${a.name}, got ${l(m)}`);
   return null;
 }
-function G(t, e) {
+function R(t, e) {
   for (const a of e)
     if (h.guard(a)) {
       const i = a[t.field];
@@ -17733,7 +17843,7 @@ function G(t, e) {
         return a;
     }
 }
-function I(t) {
+function M(t) {
   return Array.isArray(t) ? [...t] : [t];
 }
 function l(t) {
@@ -17742,18 +17852,26 @@ function l(t) {
 const h = {
   guard: (t) => l(t) === "mapping",
   name: "mapping"
-}, R = {
+}, D = {
   guard: (t) => typeof t == "string",
   name: "string"
-}, D = {
+}, z = {
   guard: (t) => typeof t == "number",
   name: "number"
-}, d = (t, e) => [...t.map(v), ...e.map(v)].join("."), v = (t) => typeof t == "string" ? t : JSON.stringify(t);
+}, d = (t, e) => [...t.map(x), ...e.map(x)].join("."), x = (t) => typeof t == "string" ? t : JSON.stringify(t);
+class F {
+  base;
+  tiers;
+  constructor(e) {
+    this.base = e.base, this.tiers = [...e.tiers].sort((a, i) => a.start - i.start);
+  }
+}
 export {
-  P as REMOTE_DATA_JSON_URL,
-  N as calcPrice,
-  E as extractUsage,
-  V as findProvider,
+  S as REMOTE_DATA_JSON_URL,
+  F as TieredPrices,
+  V as calcPrice,
+  O as extractUsage,
+  E as findProvider,
   C as updatePrices,
-  z as waitForUpdate
+  N as waitForUpdate
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@pydantic/genai-prices",
-  "version": "0.0.49",
+  "version": "0.0.50",
   "description": "Calculate prices for calling LLM inference APIs",
   "author": "Pydantic Team",
   "type": "module",