@genai-fi/nanogpt 0.5.6 → 0.6.1

package/dist/{ops-CJNniCAV.js → ops-DqtYemmV.js}

@@ -1,16 +1,16 @@
-import { o as h, j as l, E as f, az as hn, l as p, aA as fn, Q as w, aB as dn, aC as bn, aD as gn, L as $n, ak as xn, u as j, aE as kn, aF as yn, aG as In, aH as _n, aI as En, aJ as Mn, aK as Nn, D, aL as An, aM as Tn, aN as Sn, aO as wn, I as zn, J as Bn, K as qn, aP as Kn, t as Gn, aQ as J, aR as Rn, aS as Dn, aT as Pn, aU as Vn, aV as vn, aW as jn, f as Fn, aX as Wn, aY as On, b as k, a8 as Z, al as G, g as Yn, s as S, aZ as Cn, y as L, a as Jn } from "./index-Du-bmOP8.js";
-import { r as _ } from "./reshape-BH7eBpwq.js";
-import { s as un } from "./split-BCUhuU7B.js";
-import { s as q } from "./sum-Cvq06317.js";
-import { b as X } from "./broadcast_to-B7NGsBSh.js";
-import { r as O } from "./range-Bvs1hidm.js";
-import { t as Ln } from "./tensor-DgTOPY6h.js";
-import { s as Y } from "./stack-BV1v7l3S.js";
-import { c as Xn, z as Qn } from "./zeros-BaHhQTWf.js";
-import { n as ln } from "./norm-01kY9I2B.js";
-import { c as Q } from "./concat-DdKPyAtw.js";
-import { m as T } from "./mat_mul-CbiqIe2d.js";
-import { t as H } from "./tensor2d-CRWjDyUe.js";
+import { q as h, w as l, E as f, aO as hn, k as p, aP as fn, j as w, aQ as bn, aR as dn, aS as gn, J as $n, ah as xn, C as j, aT as kn, aU as yn, aV as In, aW as _n, aX as En, aY as Nn, aZ as Mn, N as V, a_ as An, a$ as Tn, b0 as Sn, aK as wn, V as zn, Q as qn, U as Bn, b1 as Kn, t as Rn, b2 as J, b3 as Gn, b4 as Vn, b5 as Dn, b6 as Pn, b7 as vn, b8 as jn, f as Fn, b9 as Wn, ba as On, b as k, a7 as Z, aj as R, g as Yn, s as S, bb as Cn, I as L, a as Jn } from "./index-CamYe_M8.js";
+import { r as _ } from "./reshape-C45vIIRU.js";
+import { s as un } from "./split-DxrHrPFK.js";
+import { s as B } from "./sum-BpcpxNEh.js";
+import { b as X } from "./broadcast_to-CddAF879.js";
+import { r as O } from "./range-DqYjKnuG.js";
+import { t as Ln } from "./tensor-CDz5x1mP.js";
+import { s as Y } from "./stack-DgaoDmnF.js";
+import { c as Xn, z as Qn } from "./zeros-DUkkVccu.js";
+import { n as ln } from "./norm-B9dQTFYn.js";
+import { c as Q } from "./concat-XOK9ANZu.js";
+import { m as T } from "./mat_mul-CAbRFWUj.js";
+import { t as U } from "./tensor2d-jO8JY5Jd.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -27,14 +27,14 @@ import { t as H } from "./tensor2d-CRWjDyUe.js";
  * limitations under the License.
  * =============================================================================
  */
-function Hn(r, t, n) {
+function Un(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 M = /* @__PURE__ */ h({ slice_: Hn });
+const N = /* @__PURE__ */ h({ slice_: Un });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -57,7 +57,7 @@ function Zn(r, t, n) {
   const a = { x: e, weights: s }, o = { size: n };
   return f.runKernel(fn, a, o);
 }
-const Un = /* @__PURE__ */ h({ bincount_: Zn });
+const Hn = /* @__PURE__ */ h({ bincount_: Zn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -75,14 +75,14 @@ const Un = /* @__PURE__ */ h({ bincount_: Zn });
  * =============================================================================
  */
 function ne(r, t, n) {
-  const e = l(t, "a", "where"), s = l(n, "b", "where"), a = l(r, "condition", "where", "bool"), o = w(w(a.shape, e.shape), s.shape), i = X(a, o), u = X(e, o), c = X(s, o), d = {
+  const e = l(t, "a", "where"), s = l(n, "b", "where"), a = l(r, "condition", "where", "bool"), o = w(w(a.shape, e.shape), s.shape), i = X(a, o), u = X(e, o), c = X(s, o), b = {
     condition: i,
     t: u,
     e: c
   };
-  return f.runKernel(dn, d);
+  return f.runKernel(bn, b);
 }
-const R = /* @__PURE__ */ h({ where_: ne });
+const G = /* @__PURE__ */ h({ where_: ne });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -101,7 +101,7 @@ const R = /* @__PURE__ */ h({ where_: ne });
  */
 function ee(r, ...t) {
   const n = t.map((s, a) => l(s, `tensors${a}`, "einsum")), e = { equation: r };
-  return f.runKernel(bn, n, e);
+  return f.runKernel(dn, n, e);
 }
 const v = /* @__PURE__ */ h({ einsum_: ee });
 /**
@@ -211,7 +211,7 @@ function oe(r, t) {
   const s = { a: n, b: e };
   return f.runKernel(kn, s);
 }
-const U = /* @__PURE__ */ h({ greater_: oe });
+const H = /* @__PURE__ */ h({ greater_: oe });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -320,7 +320,7 @@ const pn = /* @__PURE__ */ h({ lessEqual_: me });
  */
 function he(r) {
   const n = { x: l(r, "x", "neg") };
-  return f.runKernel(Mn, n);
+  return f.runKernel(Nn, n);
 }
 const nn = /* @__PURE__ */ h({ neg_: he });
 /**
@@ -343,9 +343,9 @@ 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(Nn, s);
+  return f.runKernel(Mn, s);
 }
-const de = /* @__PURE__ */ h({ logicalAnd_: fe });
+const be = /* @__PURE__ */ h({ logicalAnd_: fe });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -362,13 +362,13 @@ const de = /* @__PURE__ */ h({ logicalAnd_: fe });
  * limitations under the License.
  * =============================================================================
  */
-function be(r, t) {
+function de(r, t) {
   let n = l(r, "a", "minimum"), e = l(t, "b", "minimum");
-  [n, e] = j(n, e), n.dtype === "bool" && (n = D(n, "int32"), e = D(e, "int32")), w(n.shape, e.shape);
+  [n, e] = j(n, e), n.dtype === "bool" && (n = V(n, "int32"), e = V(e, "int32")), w(n.shape, e.shape);
   const s = { a: n, b: e };
   return f.runKernel(An, s);
 }
-const rn = /* @__PURE__ */ h({ minimum_: be });
+const rn = /* @__PURE__ */ h({ minimum_: de });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -448,12 +448,12 @@ const Ie = /* @__PURE__ */ h({ squeeze_: ye });
  * limitations under the License.
  * =============================================================================
  */
-function N(r, t) {
+function M(r, t) {
   zn(r);
-  const n = Bn(r, t);
+  const n = qn(r, t);
   if (n.length !== 1)
     throw new Error("tensor1d() requires values to be a flat/TypedArray");
-  return qn(r, null, n, t);
+  return Bn(r, null, n, t);
 }
 /**
  * @license
@@ -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" ? Gn(() => {
+  return e.dtype === "complex64" ? Rn(() => {
     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 Me(r, t, n, e, s = "bilinear", a = 0) {
+function Ne(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 b = { image: o, boxes: i, boxInd: u }, m = { method: s, extrapolationValue: a, cropSize: e };
+  return f.runKernel(Gn, b, m);
 }
-const Ne = /* @__PURE__ */ h({ cropAndResize_: Me });
+const Me = /* @__PURE__ */ h({ cropAndResize_: Ne });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -550,7 +550,7 @@ function Ae(r) {
   const t = l(r, "image", "flipLeftRight", "float32");
   p(t.rank === 4, () => `Error in flipLeftRight: image must be rank 4,but got rank ${t.rank}.`);
   const n = { image: t };
-  return f.runKernel(Dn, n, {});
+  return f.runKernel(Vn, n, {});
 }
 const Te = /* @__PURE__ */ h({ flipLeftRight_: Ae });
 /**
@@ -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 = N([0.2989, 0.587, 0.114]);
+  const s = t.dtype, a = V(t, "float32"), o = M([0.2989, 0.587, 0.114]);
   let i;
   switch (t.rank) {
     case 2:
@@ -616,9 +616,9 @@ function ze(r) {
     default:
       throw new Error("Not a valid tensor rank.");
   }
-  return i = K(i, -1), D(i, s);
+  return i = K(i, -1), V(i, s);
 }
-const Be = /* @__PURE__ */ h({ rgbToGrayscale_: ze });
+const qe = /* @__PURE__ */ h({ rgbToGrayscale_: ze });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -635,13 +635,13 @@ const Be = /* @__PURE__ */ h({ rgbToGrayscale_: ze });
  * limitations under the License.
  * =============================================================================
  */
-function qe(r, t, n = 0, e = 0.5) {
+function Be(r, t, n = 0, e = 0.5) {
   const s = l(r, "image", "rotateWithOffset", "float32");
   p(s.rank === 4, () => `Error in rotateWithOffset: image must be rank 4,but got rank ${s.rank}.`);
   const a = { image: s }, o = { radians: t, fillValue: n, center: e };
-  return f.runKernel(Pn, a, o);
+  return f.runKernel(Dn, a, o);
 }
-const Ke = /* @__PURE__ */ h({ rotateWithOffset_: qe });
+const Ke = /* @__PURE__ */ h({ rotateWithOffset_: Be });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -658,7 +658,7 @@ const Ke = /* @__PURE__ */ h({ rotateWithOffset_: qe });
  * limitations under the License.
  * =============================================================================
  */
-function P(r, t, n, e, s, a) {
+function D(r, t, n, e, s, a) {
   e == null && (e = 0.5), s == null && (s = Number.NEGATIVE_INFINITY), a == null && (a = 0);
   const o = r.shape[0];
   return n = Math.min(n, o), p(0 <= e && e <= 1, () => `iouThreshold must be in [0, 1], but was '${e}'`), p(r.rank === 2, () => `boxes must be a 2D tensor, but was of rank '${r.rank}'`), p(r.shape[1] === 4, () => `boxes must have 4 columns, but 2nd dimension was ${r.shape[1]}`), p(t.rank === 1, () => "scores must be a 1D tensor"), p(t.shape[0] === o, () => `scores has incompatible shape with boxes. Expected ${o}, but was ${t.shape[0]}`), p(0 <= a && a <= 1, () => `softNmsSigma must be in [0, 1], but was '${a}'`), { maxOutputSize: n, iouThreshold: e, scoreThreshold: s, softNmsSigma: a };
@@ -679,13 +679,13 @@ function P(r, t, n, e, s, a) {
  * limitations under the License.
  * =============================================================================
  */
-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);
+function Re(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY) {
+  const a = l(r, "boxes", "nonMaxSuppression", "float32"), o = l(t, "scores", "nonMaxSuppression", "float32"), i = D(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);
+  return f.runKernel(Pn, { boxes: a, scores: o }, u);
 }
-const Re = /* @__PURE__ */ h({ nonMaxSuppression_: Ge });
+const Ge = /* @__PURE__ */ h({ nonMaxSuppression_: Re });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -702,14 +702,14 @@ const Re = /* @__PURE__ */ h({ nonMaxSuppression_: Ge });
  * limitations under the License.
  * =============================================================================
  */
-function De(r, t, n) {
-  const e = Pe(r, t, n), s = e < 0 ? -(e + 1) : e;
+function Ve(r, t, n) {
+  const e = De(r, t, n), s = e < 0 ? -(e + 1) : e;
   r.splice(s, 0, t);
 }
-function Pe(r, t, n) {
-  return ve(r, t, n || Ve);
+function De(r, t, n) {
+  return ve(r, t, n || Pe);
 }
-function Ve(r, t) {
+function Pe(r, t) {
   return r > t ? 1 : r < t ? -1 : 0;
 }
 function ve(r, t, n) {
@@ -776,25 +776,25 @@ function We(r, t, n, e, s, a) {
 }
 function en(r, t, n, e, s, a, o = !1, i = !1, u = !1) {
   const c = [];
-  for (let b = 0; b < t.length; b++)
-    t[b] > s && c.push({ score: t[b], boxIndex: b, suppressBeginIndex: 0 });
+  for (let d = 0; d < t.length; d++)
+    t[d] > s && c.push({ score: t[d], boxIndex: d, suppressBeginIndex: 0 });
   c.sort(on);
-  const d = a > 0 ? -0.5 / a : 0, m = [], $ = [];
+  const b = a > 0 ? -0.5 / a : 0, m = [], $ = [];
   for (; m.length < n && c.length > 0; ) {
-    const b = c.pop(), { score: E, boxIndex: I, suppressBeginIndex: A } = b;
+    const d = c.pop(), { score: E, boxIndex: I, suppressBeginIndex: A } = d;
     if (E < s)
       break;
     let z = !1;
-    for (let B = m.length - 1; B >= A; --B) {
-      const V = Oe(r, I, m[B]);
-      if (V >= e) {
+    for (let q = m.length - 1; q >= A; --q) {
+      const P = Oe(r, I, m[q]);
+      if (P >= e) {
         z = !0;
         break;
       }
-      if (b.score = b.score * Ye(e, d, V), b.score <= s)
+      if (d.score = d.score * Ye(e, b, P), d.score <= s)
         break;
     }
-    b.suppressBeginIndex = m.length, z || (b.score === E ? (m.push(I), $.push(b.score)) : b.score > s && De(c, b, on));
+    d.suppressBeginIndex = m.length, z || (d.score === E ? (m.push(I), $.push(d.score)) : d.score > s && Ve(c, d, on));
   }
   const g = m.length, x = n - g;
   i && x > 0 && (m.push(...new Array(x).fill(0)), $.push(...new Array(x).fill(0)));
@@ -802,10 +802,10 @@ function en(r, t, n, e, s, a, o = !1, i = !1, u = !1) {
   return o && (y.selectedScores = $), u && (y.validOutputs = g), y;
 }
 function Oe(r, t, n) {
-  const e = r.subarray(t * 4, t * 4 + 4), s = r.subarray(n * 4, n * 4 + 4), a = Math.min(e[0], e[2]), o = Math.min(e[1], e[3]), i = Math.max(e[0], e[2]), u = Math.max(e[1], e[3]), c = Math.min(s[0], s[2]), d = Math.min(s[1], s[3]), m = Math.max(s[0], s[2]), $ = Math.max(s[1], s[3]), g = (i - a) * (u - o), x = (m - c) * ($ - d);
+  const e = r.subarray(t * 4, t * 4 + 4), s = r.subarray(n * 4, n * 4 + 4), a = Math.min(e[0], e[2]), o = Math.min(e[1], e[3]), i = Math.max(e[0], e[2]), u = Math.max(e[1], e[3]), c = Math.min(s[0], s[2]), b = Math.min(s[1], s[3]), m = Math.max(s[0], s[2]), $ = Math.max(s[1], s[3]), g = (i - a) * (u - o), x = (m - c) * ($ - b);
   if (g <= 0 || x <= 0)
     return 0;
-  const y = Math.max(a, c), b = Math.max(o, d), E = Math.min(i, m), I = Math.min(u, $), A = Math.max(E - y, 0) * Math.max(I - b, 0);
+  const y = Math.max(a, c), d = Math.max(o, b), E = Math.min(i, m), I = Math.min(u, $), A = Math.max(E - y, 0) * Math.max(I - d, 0);
   return A / (g + x - A);
 }
 function Ye(r, t, n) {
@@ -832,10 +832,10 @@ function on(r, t) {
  * =============================================================================
  */
 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);
+  const a = l(r, "boxes", "nonMaxSuppressionAsync"), o = l(t, "scores", "nonMaxSuppressionAsync"), i = D(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(), N(m, "int32");
+  const u = await Promise.all([a.data(), o.data()]), c = u[0], b = u[1], { selectedIndices: m } = je(c, b, n, e, s);
+  return a !== r && a.dispose(), o !== t && o.dispose(), M(m, "int32");
 }
 const Je = Ce;
 /**
@@ -855,9 +855,9 @@ const Je = Ce;
  * =============================================================================
  */
 function Le(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = 0) {
-  const o = l(r, "boxes", "nonMaxSuppression"), i = l(t, "scores", "nonMaxSuppression"), u = P(o, i, n, e, s, a);
+  const o = l(r, "boxes", "nonMaxSuppression"), i = l(t, "scores", "nonMaxSuppression"), u = D(o, i, n, e, s, a);
   n = u.maxOutputSize, e = u.iouThreshold, s = u.scoreThreshold, a = u.softNmsSigma;
-  const c = { boxes: o, scores: i }, d = { maxOutputSize: n, iouThreshold: e, scoreThreshold: s, softNmsSigma: a }, m = f.runKernel(vn, c, d);
+  const c = { boxes: o, scores: i }, b = { maxOutputSize: n, iouThreshold: e, scoreThreshold: s, softNmsSigma: a }, m = f.runKernel(vn, c, b);
   return { selectedIndices: m[0], selectedScores: m[1] };
 }
 const Xe = /* @__PURE__ */ h({ nonMaxSuppressionWithScore_: Le });
@@ -878,15 +878,15 @@ const Xe = /* @__PURE__ */ h({ nonMaxSuppressionWithScore_: Le });
  * =============================================================================
  */
 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);
+  const o = l(r, "boxes", "nonMaxSuppressionAsync"), i = l(t, "scores", "nonMaxSuppressionAsync"), u = D(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);
+  const c = await Promise.all([o.data(), i.data()]), b = c[0], m = c[1], { selectedIndices: $, selectedScores: g } = We(b, m, n, e, s, a);
   return o !== r && o.dispose(), i !== t && i.dispose(), {
-    selectedIndices: N($, "int32"),
-    selectedScores: N(g)
+    selectedIndices: M($, "int32"),
+    selectedScores: M(g)
   };
 }
-const He = Qe;
+const Ue = Qe;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -904,7 +904,7 @@ const He = Qe;
  * =============================================================================
  */
 function Ze(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = !1) {
-  const o = l(r, "boxes", "nonMaxSuppression"), i = l(t, "scores", "nonMaxSuppression"), u = P(
+  const o = l(r, "boxes", "nonMaxSuppression"), i = l(t, "scores", "nonMaxSuppression"), u = D(
     o,
     i,
     n,
@@ -912,15 +912,15 @@ function Ze(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = !1) {
     s,
     null
     /* softNmsSigma */
-  ), c = u.maxOutputSize, d = u.iouThreshold, m = u.scoreThreshold, $ = { boxes: o, scores: i }, g = {
+  ), c = u.maxOutputSize, b = u.iouThreshold, m = u.scoreThreshold, $ = { boxes: o, scores: i }, g = {
     maxOutputSize: c,
-    iouThreshold: d,
+    iouThreshold: b,
     scoreThreshold: m,
     padToMaxOutputSize: a
   }, x = f.runKernel(jn, $, g);
   return { selectedIndices: x[0], validOutputs: x[1] };
 }
-const Ue = /* @__PURE__ */ h({ nonMaxSuppressionPadded_: Ze });
+const He = /* @__PURE__ */ h({ nonMaxSuppressionPadded_: Ze });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -938,7 +938,7 @@ const Ue = /* @__PURE__ */ h({ nonMaxSuppressionPadded_: Ze });
  * =============================================================================
  */
 async function ns(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = !1) {
-  const o = l(r, "boxes", "nonMaxSuppressionAsync"), i = l(t, "scores", "nonMaxSuppressionAsync"), u = P(
+  const o = l(r, "boxes", "nonMaxSuppressionAsync"), i = l(t, "scores", "nonMaxSuppressionAsync"), u = D(
     o,
     i,
     n,
@@ -946,9 +946,9 @@ async function ns(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = !1) {
     s,
     null
     /* 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);
+  ), c = u.maxOutputSize, b = u.iouThreshold, m = u.scoreThreshold, [$, g] = await Promise.all([o.data(), i.data()]), { selectedIndices: x, validOutputs: y } = Fe($, g, c, b, m, a);
   return o !== r && o.dispose(), i !== t && i.dispose(), {
-    selectedIndices: N(x, "int32"),
+    selectedIndices: M(x, "int32"),
     validOutputs: Fn(y, "int32")
   };
 }
@@ -1021,32 +1021,32 @@ 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(N([e]), 255), d, m, $, g;
+  let c = k(M([e]), 255), b, 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);
-    g = Z(Z(b, E), I);
+    [b, m, $] = un(s, [1, 1, 1], -1);
+    const d = k(b, a), E = k(m, o), I = k($, i);
+    g = Z(Z(d, E), I);
   } else
     g = r;
   if (t === "otsu") {
-    const b = Un(D(ke(g), "int32"), Ln([]), 256);
-    c = is(b, u);
+    const d = Hn(V(ke(g), "int32"), Ln([]), 256);
+    c = is(d, u);
   }
-  const x = n ? pn(g, c) : U(g, c);
-  return D(k(x, 255), "int32");
+  const x = n ? pn(g, c) : H(g, c);
+  return V(k(x, 255), "int32");
 }
 function is(r, t) {
-  let n = N([-1]), e = N([0]), s = N([0]), a, o, i, u, c, d;
+  let n = M([-1]), e = M([0]), s = M([0]), a, o, i, u, c, b;
   for (let m = 0; m < r.size - 1; m++) {
-    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 = G($, q(a));
+    a = N(r, 0, m + 1), o = N(r, m + 1), c = R(B(a), t), b = R(B(o), t);
+    const $ = B(k(a, O(0, a.size)));
+    i = R($, B(a));
     const g = Yn(o.shape, a.size), x = Z(O(0, o.size), g), y = k(o, x);
-    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, N([m]), n);
+    u = R(B(y), B(o));
+    const d = S(i, u), E = S(i, u), I = k(c, b);
+    s = k(k(I, d), E);
+    const A = H(s, e);
+    e = G(A, s, e), n = G(A, M([m]), n);
   }
   return n;
 }
@@ -1095,9 +1095,9 @@ function ps(r, t, n) {
   p(e.rank >= 2, () => `bandPart(): Rank must be at least 2, got ${e.rank}.`);
   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 = Qn([a, o], e.dtype);
-  return _(Y(mn(_(e, [-1, a, o])).map((x) => R($, x, g))), s);
+  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 = G(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 = G(tn(n, 0), o, rn(n, o)));
+  const c = _(O(0, a, 1, "int32"), [-1, 1]), b = O(0, o, 1, "int32"), m = S(c, b), $ = be(pn(m, i), ce(m, nn(u))), g = Qn([a, o], e.dtype);
+  return _(Y(mn(_(e, [-1, a, o])).map((x) => G($, x, g))), s);
 }
 const ms = /* @__PURE__ */ h({ bandPart_: ps });
 /**
@@ -1132,10 +1132,10 @@ function hs(r) {
       let a = e[s];
       if (s > 0)
         for (let o = 0; o < s; ++o) {
-          const i = k(q(k(n[o], a)), n[o]);
+          const i = k(B(k(n[o], a)), n[o]);
           a = S(a, i);
         }
-      return G(a, ln(a, "euclidean"));
+      return R(a, ln(a, "euclidean"));
     }));
   return t ? Y(n, 0) : n;
 }
@@ -1156,7 +1156,7 @@ const fs = /* @__PURE__ */ h({ gramSchmidt_: hs });
  * limitations under the License.
  * =============================================================================
  */
-function ds(r, t = !1) {
+function bs(r, t = !1) {
   if (p(r.rank >= 2, () => `qr() requires input tensor to have a rank >= 2, but got rank ${r.rank}`), r.rank === 2)
     return cn(r, t);
   {
@@ -1166,8 +1166,8 @@ function ds(r, t = !1) {
       r.shape[r.shape.length - 1]
     ]), 0), s = [], a = [];
     e.forEach((u) => {
-      const [c, d] = cn(u, t);
-      s.push(c), a.push(d);
+      const [c, b] = cn(u, t);
+      s.push(c), a.push(b);
     });
     const o = _(Y(s, 0), r.shape), i = _(Y(a, 0), r.shape);
     return [o, i];
@@ -1178,38 +1178,38 @@ 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 = H([[1]], [1, 1]);
+    const o = U([[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;
+      const b = a, m = i, $ = s;
       [i, a, s] = f.tidy(() => {
-        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);
+        const g = N(a, [c, c], [n - c, 1]), x = ln(g), y = N(a, [c, c], [1, 1]), d = G(H(y, 0), U([[-1]]), U([[1]])), E = S(y, k(d, x)), I = R(g, E);
         I.shape[0] === 1 ? i = L(o) : i = Q([
           o,
-          M(I, [1, 0], [I.shape[0] - 1, I.shape[1]])
+          N(I, [1, 0], [I.shape[0] - 1, I.shape[1]])
         ], 0);
-        const A = nn(G(T(b, E), x)), z = M(a, [c, 0], [n - c, e]), B = k(A, i), V = an(i);
+        const A = nn(R(T(d, E), x)), z = N(a, [c, 0], [n - c, e]), q = k(A, i), P = an(i);
         if (c === 0)
-          a = S(z, T(B, T(V, z)));
+          a = S(z, T(q, T(P, z)));
         else {
-          const C = S(z, T(B, T(V, z)));
-          a = Q([M(a, [0, 0], [c, e]), C], 0);
+          const C = S(z, T(q, T(P, z)));
+          a = Q([N(a, [0, 0], [c, e]), C], 0);
         }
-        const sn = an(B), F = M(s, [0, c], [n, s.shape[1] - c]);
+        const sn = an(q), F = N(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 = Q([M(s, [0, 0], [n, c]), C], 1);
+          s = Q([N(s, [0, 0], [n, c]), C], 1);
         }
         return [i, a, s];
-      }), Jn([d, m, $]);
+      }), Jn([b, m, $]);
     }
-    return !t && n > e && (s = M(s, [0, 0], [n, e]), a = M(a, [0, 0], [e, e])), [s, a];
+    return !t && n > e && (s = N(s, [0, 0], [n, e]), a = N(a, [0, 0], [e, e])), [s, a];
   });
 }
-const bs = /* @__PURE__ */ h({ qr_: ds });
+const ds = /* @__PURE__ */ h({ qr_: bs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1231,39 +1231,47 @@ const ws = {
   grayscaleToRGB: we,
   resizeNearestNeighbor: as,
   resizeBilinear: ts,
-  rgbToGrayscale: Be,
+  rgbToGrayscale: qe,
   rotateWithOffset: Ke,
-  cropAndResize: Ne,
-  nonMaxSuppression: Re,
+  cropAndResize: Me,
+  nonMaxSuppression: Ge,
   nonMaxSuppressionAsync: Je,
   nonMaxSuppressionWithScore: Xe,
-  nonMaxSuppressionWithScoreAsync: He,
-  nonMaxSuppressionPadded: Ue,
+  nonMaxSuppressionWithScoreAsync: Ue,
+  nonMaxSuppressionPadded: He,
   nonMaxSuppressionPaddedAsync: es,
   threshold: cs,
   transform: ls
 }, zs = {
   bandPart: ms,
   gramSchmidt: fs,
-  qr: bs
+  qr: ds
 };
 export {
-  W as a,
-  an as b,
-  de as c,
-  pn as d,
-  ae as e,
-  U as f,
+  be as a,
+  pn as b,
+  an as c,
+  W as d,
+  H as e,
+  tn as f,
   ce as g,
-  tn as h,
-  K as i,
+  K as h,
+  ae as i,
   Ie as j,
   ws as k,
   zs as l,
   rn as m,
   nn as n,
-  M as s,
-  N as t,
+  le as o,
+  ts as p,
+  as as q,
+  $e as r,
+  N as s,
+  M as t,
   mn as u,
-  R as w
+  ke as v,
+  G as w,
+  je as x,
+  Fe as y,
+  We as z
 };