@genai-fi/nanogpt 0.5.1 → 0.5.2

package/dist/{ops-ObfXLHYQ.js → ops-DzQTmLIl.js}

@@ -1,16 +1,16 @@
-import { o as h, i as l, E as f, aA as hn, k as p, aB as fn, N as w, aC as dn, aD as bn, aE as gn, T as $n, ah as xn, q as j, aF as kn, aG as yn, aH as In, aI as _n, aJ as En, aK as Nn, aL as Mn, y as D, aM as An, aN as Tn, aO as Sn, aP as wn, H as zn, I as Bn, J as qn, aQ as Gn, t as Kn, aR as J, aS as Rn, aT as Dn, aU as Pn, aV as Vn, aW as vn, aX as jn, f as Fn, aY as Wn, aZ as On, b as k, a9 as Z, ai as K, g as Yn, s as S, a_ as Cn, x as L, a as Jn } from "./index-iNhkcAEQ.js";
-import { r as _ } from "./reshape-DxTPgnwL.js";
-import { s as un } from "./split-BCbrzthj.js";
-import { s as q } from "./sum-B_92TaHD.js";
-import { b as X } from "./broadcast_to-CMlkG8NS.js";
-import { r as O } from "./range-BsFU-SNG.js";
-import { t as Ln } from "./tensor-CfiPXsW4.js";
-import { s as Y } from "./stack--cqr9Dgc.js";
-import { c as Xn, z as Hn } from "./zeros-NMYTayy7.js";
-import { n as ln } from "./norm-D3676xIo.js";
-import { c as H } from "./concat-Cxbo2sOz.js";
-import { m as T } from "./mat_mul-D0SifYfJ.js";
-import { t as Q } from "./tensor2d-tSxWdFMH.js";
+import { o as h, j as l, E as f, aA as hn, l as p, aB as fn, Q as w, aC as dn, aD as bn, aE as gn, L as $n, al as xn, u as j, aF as kn, aG as yn, aH as In, aI as _n, aJ as En, aK as Mn, aL as Nn, D, aM as An, aN as Tn, aO as Sn, aP as wn, I as zn, J as Bn, K as qn, aQ as Kn, t as Gn, aR as J, aS as Rn, aT as Dn, aU as Pn, aV as Vn, aW as vn, aX as jn, f as Fn, aY as Wn, aZ as On, b as k, a9 as Z, am as G, g as Yn, s as S, a_ as Cn, y as L, a as Jn } from "./index-CnHyhpKc.js";
+import { r as _ } from "./reshape-CTIbqjwm.js";
+import { s as un } from "./split-CVwhL8Oe.js";
+import { s as q } from "./sum-UdfvaNhB.js";
+import { b as X } from "./broadcast_to-BBoMQXbL.js";
+import { r as O } from "./range-CkOJ7090.js";
+import { t as Ln } from "./tensor-IZex6Bwp.js";
+import { s as Y } from "./stack-S2-D2JAQ.js";
+import { c as Xn, z as Qn } from "./zeros-CYMicyqz.js";
+import { n as ln } from "./norm-BpWsOapl.js";
+import { c as Q } from "./concat-BRRtq4S2.js";
+import { m as T } from "./mat_mul-DeGU1U_C.js";
+import { t as H } from "./tensor2d-CqtBzOKq.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -27,14 +27,14 @@ import { t as Q } from "./tensor2d-tSxWdFMH.js";
  * limitations under the License.
  * =============================================================================
  */
-function Qn(r, t, n) {
+function Hn(r, t, n) {
   const e = l(r, "x", "slice", "string_or_numeric");
   if (e.rank === 0)
     throw new Error("Slicing scalar is not possible");
   const s = { x: e }, a = { begin: t, size: n };
   return f.runKernel(hn, s, a);
 }
-const N = /* @__PURE__ */ h({ slice_: Qn });
+const M = /* @__PURE__ */ h({ slice_: Hn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -126,7 +126,7 @@ function se(r, t = 0) {
   const e = { input: n }, s = { dim: t };
   return f.runKernel(gn, e, s);
 }
-const G = /* @__PURE__ */ h({ expandDims_: se });
+const K = /* @__PURE__ */ h({ expandDims_: se });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -175,11 +175,11 @@ function re(r, t, n, e = "float32") {
   if (n == null)
     return o;
   if (n.length === 1)
-    return W(G(o, 0), [n[0], 1, 1]);
+    return W(K(o, 0), [n[0], 1, 1]);
   if (n.length === 2)
-    return W(G(G(o, 0), 0), [n[0], n[1], 1, 1]);
+    return W(K(K(o, 0), 0), [n[0], n[1], 1, 1]);
   if (n.length === 3)
-    return W(G(G(G(o, 0), 0), 0), [
+    return W(K(K(K(o, 0), 0), 0), [
       n[0],
       n[1],
       n[2],
@@ -320,7 +320,7 @@ const pn = /* @__PURE__ */ h({ lessEqual_: me });
  */
 function he(r) {
   const n = { x: l(r, "x", "neg") };
-  return f.runKernel(Nn, n);
+  return f.runKernel(Mn, n);
 }
 const nn = /* @__PURE__ */ h({ neg_: he });
 /**
@@ -343,7 +343,7 @@ function fe(r, t) {
   const n = l(r, "a", "logicalAnd", "bool"), e = l(t, "b", "logicalAnd", "bool");
   w(n.shape, e.shape);
   const s = { a: n, b: e };
-  return f.runKernel(Mn, s);
+  return f.runKernel(Nn, s);
 }
 const de = /* @__PURE__ */ h({ logicalAnd_: fe });
 /**
@@ -448,7 +448,7 @@ const Ie = /* @__PURE__ */ h({ squeeze_: ye });
  * limitations under the License.
  * =============================================================================
  */
-function M(r, t) {
+function N(r, t) {
   zn(r);
   const n = Bn(r, t);
   if (n.length !== 1)
@@ -475,7 +475,7 @@ function _e(r, t = 0) {
   const n = l(r, "x", "unstack", "string_or_numeric");
   p(t >= -n.shape.length && t < n.shape.length, () => `Axis = ${t} is not in [-${n.shape.length}, ${n.shape.length})`);
   const e = { value: n }, s = { axis: t };
-  return f.runKernel(Gn, e, s);
+  return f.runKernel(Kn, e, s);
 }
 const mn = /* @__PURE__ */ h({ unstack_: _e });
 /**
@@ -501,7 +501,7 @@ function Ee(r, t, n) {
   }), e.rank <= 1)
     return e.clone();
   const s = { x: e }, a = { perm: t };
-  return e.dtype === "complex64" ? Kn(() => {
+  return e.dtype === "complex64" ? Gn(() => {
     let o = $e(e), i = le(e);
     return o = f.runKernel(J, { x: o }, a), i = f.runKernel(J, { x: i }, a), n && (i = nn(i)), Xn(o, i);
   }) : f.runKernel(J, s, a);
@@ -523,13 +523,13 @@ const an = /* @__PURE__ */ h({ transpose_: Ee });
  * limitations under the License.
  * =============================================================================
  */
-function Ne(r, t, n, e, s = "bilinear", a = 0) {
+function Me(r, t, n, e, s = "bilinear", a = 0) {
   const o = l(r, "image", "cropAndResize"), i = l(t, "boxes", "cropAndResize", "float32"), u = l(n, "boxInd", "cropAndResize", "int32"), c = i.shape[0];
   p(o.rank === 4, () => `Error in cropAndResize: image must be rank 4,but got rank ${o.rank}.`), p(i.rank === 2 && i.shape[1] === 4, () => `Error in cropAndResize: boxes must be have size [${c},4] but had shape ${i.shape}.`), p(u.rank === 1 && u.shape[0] === c, () => `Error in cropAndResize: boxInd must be have size [${c}] but had shape ${i.shape}.`), p(e.length === 2, () => `Error in cropAndResize: cropSize must be of length 2, but got length ${e.length}.`), p(e[0] >= 1 && e[1] >= 1, () => `cropSize must be atleast [1,1], but was ${e}`), p(s === "bilinear" || s === "nearest", () => `method must be bilinear or nearest, but was ${s}`);
   const d = { image: o, boxes: i, boxInd: u }, m = { method: s, extrapolationValue: a, cropSize: e };
   return f.runKernel(Rn, d, m);
 }
-const Me = /* @__PURE__ */ h({ cropAndResize_: Ne });
+const Ne = /* @__PURE__ */ h({ cropAndResize_: Me });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -595,7 +595,7 @@ const we = /* @__PURE__ */ h({ grayscaleToRGB_: Se });
 function ze(r) {
   const t = l(r, "image", "RGBToGrayscale"), n = t.rank - 1, e = t.shape[n];
   p(t.rank >= 2, () => `Error in RGBToGrayscale: images must be at least rank 2, but got rank ${t.rank}.`), p(e === 3, () => `Error in RGBToGrayscale: last dimension of an RGB image should be size 3, but got size ${e}.`);
-  const s = t.dtype, a = D(t, "float32"), o = M([0.2989, 0.587, 0.114]);
+  const s = t.dtype, a = D(t, "float32"), o = N([0.2989, 0.587, 0.114]);
   let i;
   switch (t.rank) {
     case 2:
@@ -616,7 +616,7 @@ function ze(r) {
     default:
       throw new Error("Not a valid tensor rank.");
   }
-  return i = G(i, -1), D(i, s);
+  return i = K(i, -1), D(i, s);
 }
 const Be = /* @__PURE__ */ h({ rgbToGrayscale_: ze });
 /**
@@ -641,7 +641,7 @@ function qe(r, t, n = 0, e = 0.5) {
   const a = { image: s }, o = { radians: t, fillValue: n, center: e };
   return f.runKernel(Pn, a, o);
 }
-const Ge = /* @__PURE__ */ h({ rotateWithOffset_: qe });
+const Ke = /* @__PURE__ */ h({ rotateWithOffset_: qe });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -679,13 +679,13 @@ function P(r, t, n, e, s, a) {
  * limitations under the License.
  * =============================================================================
  */
-function Ke(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY) {
+function Ge(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY) {
   const a = l(r, "boxes", "nonMaxSuppression", "float32"), o = l(t, "scores", "nonMaxSuppression", "float32"), i = P(a, o, n, e, s);
   n = i.maxOutputSize, e = i.iouThreshold, s = i.scoreThreshold;
   const u = { maxOutputSize: n, iouThreshold: e, scoreThreshold: s };
   return f.runKernel(Vn, { boxes: a, scores: o }, u);
 }
-const Re = /* @__PURE__ */ h({ nonMaxSuppression_: Ke });
+const Re = /* @__PURE__ */ h({ nonMaxSuppression_: Ge });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -835,7 +835,7 @@ async function Ce(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY) {
   const a = l(r, "boxes", "nonMaxSuppressionAsync"), o = l(t, "scores", "nonMaxSuppressionAsync"), i = P(a, o, n, e, s);
   n = i.maxOutputSize, e = i.iouThreshold, s = i.scoreThreshold;
   const u = await Promise.all([a.data(), o.data()]), c = u[0], d = u[1], { selectedIndices: m } = je(c, d, n, e, s);
-  return a !== r && a.dispose(), o !== t && o.dispose(), M(m, "int32");
+  return a !== r && a.dispose(), o !== t && o.dispose(), N(m, "int32");
 }
 const Je = Ce;
 /**
@@ -877,16 +877,16 @@ const Xe = /* @__PURE__ */ h({ nonMaxSuppressionWithScore_: Le });
  * limitations under the License.
  * =============================================================================
  */
-async function He(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = 0) {
+async function Qe(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = 0) {
   const o = l(r, "boxes", "nonMaxSuppressionAsync"), i = l(t, "scores", "nonMaxSuppressionAsync"), u = P(o, i, n, e, s, a);
   n = u.maxOutputSize, e = u.iouThreshold, s = u.scoreThreshold, a = u.softNmsSigma;
   const c = await Promise.all([o.data(), i.data()]), d = c[0], m = c[1], { selectedIndices: $, selectedScores: g } = We(d, m, n, e, s, a);
   return o !== r && o.dispose(), i !== t && i.dispose(), {
-    selectedIndices: M($, "int32"),
-    selectedScores: M(g)
+    selectedIndices: N($, "int32"),
+    selectedScores: N(g)
   };
 }
-const Qe = He;
+const He = Qe;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -948,7 +948,7 @@ async function ns(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = !1) {
     /* softNmsSigma */
   ), c = u.maxOutputSize, d = u.iouThreshold, m = u.scoreThreshold, [$, g] = await Promise.all([o.data(), i.data()]), { selectedIndices: x, validOutputs: y } = Fe($, g, c, d, m, a);
   return o !== r && o.dispose(), i !== t && i.dispose(), {
-    selectedIndices: M(x, "int32"),
+    selectedIndices: N(x, "int32"),
     validOutputs: Fn(y, "int32")
   };
 }
@@ -1021,7 +1021,7 @@ const as = /* @__PURE__ */ h({ resizeNearestNeighbor_: rs });
  */
 function os(r, t = "binary", n = !1, e = 0.5) {
   const s = l(r, "image", "threshold"), a = 0.2989, o = 0.587, i = 0.114, u = s.shape[0] * s.shape[1];
-  let c = k(M([e]), 255), d, m, $, g;
+  let c = k(N([e]), 255), d, m, $, g;
   if (p(s.rank === 3, () => `Error in threshold: image must be rank 3,but got rank ${s.rank}.`), p(s.shape[2] === 3 || s.shape[2] === 1, () => `Error in threshold: image color channel must be equal to 3 or 1but got ${s.shape[2]}.`), p(s.dtype === "int32" || s.dtype === "float32", () => `Error in dtype: image dtype must be int32 or float32,but got dtype ${s.dtype}.`), p(t === "otsu" || t === "binary", () => `Method must be binary or otsu, but was ${t}`), s.shape[2] === 3) {
     [d, m, $] = un(s, [1, 1, 1], -1);
     const b = k(d, a), E = k(m, o), I = k($, i);
@@ -1036,17 +1036,17 @@ function os(r, t = "binary", n = !1, e = 0.5) {
   return D(k(x, 255), "int32");
 }
 function is(r, t) {
-  let n = M([-1]), e = M([0]), s = M([0]), a, o, i, u, c, d;
+  let n = N([-1]), e = N([0]), s = N([0]), a, o, i, u, c, d;
   for (let m = 0; m < r.size - 1; m++) {
-    a = N(r, 0, m + 1), o = N(r, m + 1), c = K(q(a), t), d = K(q(o), t);
+    a = M(r, 0, m + 1), o = M(r, m + 1), c = G(q(a), t), d = G(q(o), t);
     const $ = q(k(a, O(0, a.size)));
-    i = K($, q(a));
+    i = G($, q(a));
     const g = Yn(o.shape, a.size), x = Z(O(0, o.size), g), y = k(o, x);
-    u = K(q(y), q(o));
+    u = G(q(y), q(o));
     const b = S(i, u), E = S(i, u), I = k(c, d);
     s = k(k(I, b), E);
     const A = U(s, e);
-    e = R(A, s, e), n = R(A, M([m]), n);
+    e = R(A, s, e), n = R(A, N([m]), n);
   }
   return n;
 }
@@ -1096,7 +1096,7 @@ function ps(r, t, n) {
   const s = e.shape, [a, o] = e.shape.slice(-2);
   let i, u;
   typeof t == "number" ? (p(t % 1 === 0, () => `bandPart(): numLower must be an integer, got ${t}.`), p(t <= a, () => `bandPart(): numLower (${t}) must not be greater than the number of rows (${a}).`), i = l(t < 0 ? a : t, "numLower", "bandPart")) : (p(t.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), i = R(tn(t, 0), a, rn(t, a))), typeof n == "number" ? (p(n % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${n}.`), p(n <= o, () => `bandPart(): numUpper (${n}) must not be greater than the number of columns (${o}).`), u = l(n < 0 ? o : n, "numUpper", "bandPart")) : (p(n.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), u = R(tn(n, 0), o, rn(n, o)));
-  const c = _(O(0, a, 1, "int32"), [-1, 1]), d = O(0, o, 1, "int32"), m = S(c, d), $ = de(pn(m, i), ce(m, nn(u))), g = Hn([a, o], e.dtype);
+  const c = _(O(0, a, 1, "int32"), [-1, 1]), d = O(0, o, 1, "int32"), m = S(c, d), $ = de(pn(m, i), ce(m, nn(u))), g = Qn([a, o], e.dtype);
   return _(Y(mn(_(e, [-1, a, o])).map((x) => R($, x, g))), s);
 }
 const ms = /* @__PURE__ */ h({ bandPart_: ps });
@@ -1135,7 +1135,7 @@ function hs(r) {
           const i = k(q(k(n[o], a)), n[o]);
           a = S(a, i);
         }
-      return K(a, ln(a, "euclidean"));
+      return G(a, ln(a, "euclidean"));
     }));
   return t ? Y(n, 0) : n;
 }
@@ -1178,35 +1178,35 @@ function cn(r, t = !1) {
     p(r.shape.length === 2, () => `qr2d() requires a 2D Tensor, but got a ${r.shape.length}D Tensor.`);
     const n = r.shape[0], e = r.shape[1];
     let s = ae(n), a = L(r);
-    const o = Q([[1]], [1, 1]);
+    const o = H([[1]], [1, 1]);
     let i = L(o);
     const u = n >= e ? e : n;
     for (let c = 0; c < u; ++c) {
       const d = a, m = i, $ = s;
       [i, a, s] = f.tidy(() => {
-        const g = N(a, [c, c], [n - c, 1]), x = ln(g), y = N(a, [c, c], [1, 1]), b = R(U(y, 0), Q([[-1]]), Q([[1]])), E = S(y, k(b, x)), I = K(g, E);
-        I.shape[0] === 1 ? i = L(o) : i = H([
+        const g = M(a, [c, c], [n - c, 1]), x = ln(g), y = M(a, [c, c], [1, 1]), b = R(U(y, 0), H([[-1]]), H([[1]])), E = S(y, k(b, x)), I = G(g, E);
+        I.shape[0] === 1 ? i = L(o) : i = Q([
           o,
-          N(I, [1, 0], [I.shape[0] - 1, I.shape[1]])
+          M(I, [1, 0], [I.shape[0] - 1, I.shape[1]])
         ], 0);
-        const A = nn(K(T(b, E), x)), z = N(a, [c, 0], [n - c, e]), B = k(A, i), V = an(i);
+        const A = nn(G(T(b, E), x)), z = M(a, [c, 0], [n - c, e]), B = k(A, i), V = an(i);
         if (c === 0)
           a = S(z, T(B, T(V, z)));
         else {
           const C = S(z, T(B, T(V, z)));
-          a = H([N(a, [0, 0], [c, e]), C], 0);
+          a = Q([M(a, [0, 0], [c, e]), C], 0);
         }
-        const sn = an(B), F = N(s, [0, c], [n, s.shape[1] - c]);
+        const sn = an(B), F = M(s, [0, c], [n, s.shape[1] - c]);
         if (c === 0)
           s = S(F, T(T(F, i), sn));
         else {
           const C = S(F, T(T(F, i), sn));
-          s = H([N(s, [0, 0], [n, c]), C], 1);
+          s = Q([M(s, [0, 0], [n, c]), C], 1);
         }
         return [i, a, s];
       }), Jn([d, m, $]);
     }
-    return !t && n > e && (s = N(s, [0, 0], [n, e]), a = N(a, [0, 0], [e, e])), [s, a];
+    return !t && n > e && (s = M(s, [0, 0], [n, e]), a = M(a, [0, 0], [e, e])), [s, a];
   });
 }
 const bs = /* @__PURE__ */ h({ qr_: ds });
@@ -1232,12 +1232,12 @@ const ws = {
   resizeNearestNeighbor: as,
   resizeBilinear: ts,
   rgbToGrayscale: Be,
-  rotateWithOffset: Ge,
-  cropAndResize: Me,
+  rotateWithOffset: Ke,
+  cropAndResize: Ne,
   nonMaxSuppression: Re,
   nonMaxSuppressionAsync: Je,
   nonMaxSuppressionWithScore: Xe,
-  nonMaxSuppressionWithScoreAsync: Qe,
+  nonMaxSuppressionWithScoreAsync: He,
   nonMaxSuppressionPadded: Ue,
   nonMaxSuppressionPaddedAsync: es,
   threshold: cs,
@@ -1256,14 +1256,14 @@ export {
   U as f,
   ce as g,
   tn as h,
-  G as i,
+  K as i,
   Ie as j,
   ws as k,
   zs as l,
   rn as m,
   nn as n,
-  N as s,
-  M as t,
+  M as s,
+  N as t,
   mn as u,
   R as w
 };