@genai-fi/nanogpt 0.7.3 → 0.8.0

package/dist/ops/webgpu/rope.js

@@ -1,6 +1,6 @@
-import { g as c } from "../../webgpu_program-PFzf1hAQ.js";
-import { f as m, c as l } from "../../webgpu_util-D____QpY.js";
-import { f as x, a2 as f } from "../../index-BoWRt-10.js";
+import { g as c } from "../../webgpu_program-dFEVbDPL.js";
+import { f as m, c as l } from "../../webgpu_util-DLImlSc6.js";
+import { f as x, a3 as f } from "../../index-CUQrfsw_.js";
 class S {
   variableNames = ["x", "sin", "cos"];
   outputShape;

package/dist/ops/webgpu/scatterSub.js

@@ -1,6 +1,6 @@
-import { g as p } from "../../webgpu_program-PFzf1hAQ.js";
-import { f as u, c as d } from "../../webgpu_util-D____QpY.js";
-import { f as h, a2 as o } from "../../index-BoWRt-10.js";
+import { g as p } from "../../webgpu_program-dFEVbDPL.js";
+import { f as u, c as d } from "../../webgpu_util-DLImlSc6.js";
+import { f as h, a3 as o } from "../../index-CUQrfsw_.js";
 class b {
   variableNames = ["labels", "softmaxProbs", "dy"];
   outputShape;

package/dist/ops/webgpu/utils/reductions.js

@@ -1,7 +1,7 @@
-import { p as l, j as d } from "../../../index-BoWRt-10.js";
-import { g as p } from "../../../webgpu_program-PFzf1hAQ.js";
-import { r as f } from "../../../Reshape-DvudQDvJ.js";
-import { c as x } from "../../../axis_util-BzbKo31C.js";
+import { p as l, j as d } from "../../../index-CUQrfsw_.js";
+import { g as p } from "../../../webgpu_program-dFEVbDPL.js";
+import { r as f } from "../../../Reshape-B-lWQRnF.js";
+import { c as x } from "../../../axis_util-DubwyOhW.js";
 function I(e, r, t, s, u) {
   return `
            fn DIV_CEIL(a : u32, b : u32) -> u32 {

package/dist/{ops-BFGCx8Ri.js → ops-C_1K_-35.js}

@@ -1,19 +1,19 @@
-import { B as m, C as u, l, E as f, aP as gn, k as S, aQ as $n, aR as kn, aS as yn, p as En, aT as w, q as rn, x as _n, b as pn, aU as In, aV as Nn, N as An, al as Tn, I as v, aW as xn, aX as wn, aY as Sn, aZ as Mn, a_ as zn, a$ as qn, b0 as Bn, X as K, b1 as Gn, b2 as Kn, b3 as Rn, aG as Dn, $ as vn, Z as Vn, _ as Pn, b4 as jn, t as Fn, b5 as L, b6 as Wn, b7 as Yn, b8 as On, b9 as Cn, ba as Ln, bb as Xn, bc as Zn, bd as Jn, a as $, o as U, n as q, h as Qn, c as A, be as Hn, M as X, d as Un } from "./index-BoWRt-10.js";
+import { B as m, C as u, n as l, E as f, aR as gn, l as S, aS as $n, aT as kn, aU as yn, p as En, aV as w, w as rn, x as _n, b as pn, aW as In, aX as An, W as Nn, an as Tn, N as v, aY as xn, aZ as wn, a_ as Sn, a$ as Mn, b0 as zn, b1 as qn, b2 as Bn, $ as G, b3 as Kn, b4 as Gn, b5 as Rn, aI as Dn, y as vn, z as Vn, A as Pn, b6 as jn, t as Fn, b7 as L, b8 as Wn, b9 as Yn, ba as On, bb as Cn, bc as Ln, bd as Xn, be as Jn, bf as Zn, a as $, q as U, o as q, h as Hn, c as N, bg as Qn, F as X, d as Un } from "./index-CUQrfsw_.js";
 import { n as ne, a as ee, b as se } from "./non_max_suppression_impl-CsEgBuMA.js";
-import { r as k } from "./reshape-CdBq1WJ6.js";
-import { s as mn } from "./split-B-dikLRw.js";
-import { s as E } from "./sum-66ew2byf.js";
-import { b as Z } from "./broadcast_to-CdbwV-Dj.js";
-import { s as _ } from "./slice-BiOsknYS.js";
-import { r as W } from "./range-CRuAh-gd.js";
-import { t as te } from "./tensor-JwS7ZYY6.js";
-import { s as Y } from "./stack-B17UN2nn.js";
-import { c as re, z as ae } from "./zeros--BdLQ3oG.js";
-import { e as oe } from "./axis_util-BzbKo31C.js";
-import { m as J } from "./max-Ddnnb5xe.js";
-import { c as Q } from "./concat-CsxrgovM.js";
-import { m as N } from "./mat_mul-8m8pfdcx.js";
-import { t as H } from "./tensor2d-wxPAnDQy.js";
+import { r as k } from "./reshape-DEfQGSin.js";
+import { s as mn } from "./split-By_n4TKP.js";
+import { s as E } from "./sum-l_0SqM4h.js";
+import { b as J } from "./broadcast_to-BYfCp5iL.js";
+import { s as _ } from "./slice-BnyE-M_7.js";
+import { r as W } from "./range-LVHrSLdi.js";
+import { t as te } from "./tensor-BAQdLqoU.js";
+import { s as Y } from "./stack-DkdFLq37.js";
+import { c as re, z as ae } from "./zeros-VZ72lWXM.js";
+import { e as oe } from "./axis_util-DubwyOhW.js";
+import { m as Z } from "./max-B3JOcNGb.js";
+import { c as H } from "./concat-BmDqqFsa.js";
+import { m as A } from "./mat_mul-DMkduNJu.js";
+import { t as Q } from "./tensor2d-BHy261cI.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -54,14 +54,14 @@ const ce = /* @__PURE__ */ m({ bincount_: ie });
  * =============================================================================
  */
 function ue(s, e, n) {
-  const r = u(e, "a", "where"), t = u(n, "b", "where"), a = u(s, "condition", "where", "bool"), o = S(S(a.shape, r.shape), t.shape), i = Z(a, o), p = Z(r, o), c = Z(t, o), b = {
+  const r = u(e, "a", "where"), t = u(n, "b", "where"), a = u(s, "condition", "where", "bool"), o = S(S(a.shape, r.shape), t.shape), i = J(a, o), p = J(r, o), c = J(t, o), h = {
     condition: i,
     t: p,
     e: c
   };
-  return f.runKernel($n, b);
+  return f.runKernel($n, h);
 }
-const G = /* @__PURE__ */ m({ where_: ue });
+const K = /* @__PURE__ */ m({ where_: ue });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -139,7 +139,7 @@ function fn(s, e, n = null) {
     if (e === 1)
       return E(w(s), n);
     if (e === 1 / 0)
-      return J(w(s), n);
+      return Z(w(s), n);
     if (e === -1 / 0)
       return an(w(s), n);
     if (e === "euclidean" || e === 2)
@@ -148,9 +148,9 @@ function fn(s, e, n = null) {
   }
   if (Array.isArray(n) && n.length === 2) {
     if (e === 1)
-      return J(E(w(s), n[0]), n[1] - 1);
+      return Z(E(w(s), n[0]), n[1] - 1);
     if (e === 1 / 0)
-      return J(E(w(s), n[1]), n[0]);
+      return Z(E(w(s), n[1]), n[0]);
     if (e === -1 / 0)
       return an(E(w(s), n[1]), n[0]);
     if (e === "fro" || e === "euclidean")
@@ -159,7 +159,7 @@ function fn(s, e, n = null) {
   }
   throw new Error(`Error in norm: invalid axis: ${n}`);
 }
-const hn = /* @__PURE__ */ m({ norm_: me });
+const bn = /* @__PURE__ */ m({ norm_: me });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -180,7 +180,7 @@ function fe(s, e = 0) {
   const n = u(s, "x", "expandDims", "string_or_numeric");
   l(e <= n.rank, () => "Axis must be <= rank of the tensor");
   const r = { input: n }, t = { dim: e };
-  return f.runKernel(Nn, r, t);
+  return f.runKernel(An, r, t);
 }
 const z = /* @__PURE__ */ m({ expandDims_: fe });
 /**
@@ -199,13 +199,13 @@ const z = /* @__PURE__ */ m({ expandDims_: fe });
  * limitations under the License.
  * =============================================================================
  */
-function he(s, e) {
+function be(s, e) {
   const n = u(s, "x", "tile", "string_or_numeric");
   l(n.rank === e.length, () => `Error in transpose: rank of input ${n.rank} must match length of reps ${e}.`);
   const r = { x: n }, t = { reps: e };
-  return f.runKernel(An, r, t);
+  return f.runKernel(Nn, r, t);
 }
-const F = /* @__PURE__ */ m({ tile_: he });
+const F = /* @__PURE__ */ m({ tile_: be });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -222,7 +222,7 @@ const F = /* @__PURE__ */ m({ tile_: he });
  * limitations under the License.
  * =============================================================================
  */
-function be(s, e, n, r = "float32") {
+function he(s, e, n, r = "float32") {
   e == null && (e = s);
   const t = Tn([s, e], r), a = s <= e ? s : e;
   for (let i = 0; i < a; ++i)
@@ -244,7 +244,7 @@ function be(s, e, n, r = "float32") {
     ]);
   throw new Error(`eye() currently supports only 1D and 2D batchShapes, but received ${n.length}D.`);
 }
-const de = /* @__PURE__ */ m({ eye_: be });
+const de = /* @__PURE__ */ m({ eye_: he });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -357,7 +357,7 @@ function Ie(s, e) {
   const t = { a: n, b: r };
   return f.runKernel(zn, t);
 }
-const bn = /* @__PURE__ */ m({ lessEqual_: Ie });
+const hn = /* @__PURE__ */ m({ lessEqual_: Ie });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -374,11 +374,11 @@ const bn = /* @__PURE__ */ m({ lessEqual_: Ie });
  * limitations under the License.
  * =============================================================================
  */
-function Ne(s) {
+function Ae(s) {
   const n = { x: u(s, "x", "neg") };
   return f.runKernel(qn, n);
 }
-const en = /* @__PURE__ */ m({ neg_: Ne });
+const en = /* @__PURE__ */ m({ neg_: Ae });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -395,13 +395,13 @@ const en = /* @__PURE__ */ m({ neg_: Ne });
  * limitations under the License.
  * =============================================================================
  */
-function Ae(s, e) {
+function Ne(s, e) {
   const n = u(s, "a", "logicalAnd", "bool"), r = u(e, "b", "logicalAnd", "bool");
   S(n.shape, r.shape);
   const t = { a: n, b: r };
   return f.runKernel(Bn, t);
 }
-const Te = /* @__PURE__ */ m({ logicalAnd_: Ae });
+const Te = /* @__PURE__ */ m({ logicalAnd_: Ne });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -420,9 +420,9 @@ const Te = /* @__PURE__ */ m({ logicalAnd_: Ae });
  */
 function xe(s, e) {
   let n = u(s, "a", "minimum"), r = u(e, "b", "minimum");
-  [n, r] = v(n, r), n.dtype === "bool" && (n = K(n, "int32"), r = K(r, "int32")), S(n.shape, r.shape);
+  [n, r] = v(n, r), n.dtype === "bool" && (n = G(n, "int32"), r = G(r, "int32")), S(n.shape, r.shape);
   const t = { a: n, b: r };
-  return f.runKernel(Gn, t);
+  return f.runKernel(Kn, t);
 }
 const cn = /* @__PURE__ */ m({ minimum_: xe });
 /**
@@ -443,7 +443,7 @@ const cn = /* @__PURE__ */ m({ minimum_: xe });
  */
 function we(s) {
   const n = { input: u(s, "input", "real") };
-  return f.runKernel(Kn, n);
+  return f.runKernel(Gn, n);
 }
 const Se = /* @__PURE__ */ m({ real_: we });
 /**
@@ -527,13 +527,13 @@ function I(s, e) {
  * limitations under the License.
  * =============================================================================
  */
-function Ge(s, e = 0) {
+function Ke(s, e = 0) {
   const n = u(s, "x", "unstack", "string_or_numeric");
   l(e >= -n.shape.length && e < n.shape.length, () => `Axis = ${e} is not in [-${n.shape.length}, ${n.shape.length})`);
   const r = { value: n }, t = { axis: e };
   return f.runKernel(jn, r, t);
 }
-const dn = /* @__PURE__ */ m({ unstack_: Ge });
+const dn = /* @__PURE__ */ m({ unstack_: Ke });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -550,7 +550,7 @@ const dn = /* @__PURE__ */ m({ unstack_: Ge });
  * limitations under the License.
  * =============================================================================
  */
-function Ke(s, e, n) {
+function Ge(s, e, n) {
   const r = u(s, "x", "transpose");
   if (e == null && (e = r.shape.map((o, i) => i).reverse()), l(r.rank === e.length, () => `Error in transpose: rank of input ${r.rank} must match length of perm ${e}.`), e.forEach((o) => {
     l(o >= 0 && o < r.rank, () => `All entries in 'perm' must be between 0 and ${r.rank - 1} but got ${e}`);
@@ -562,7 +562,7 @@ function Ke(s, e, n) {
     return o = f.runKernel(L, { x: o }, a), i = f.runKernel(L, { x: i }, a), n && (i = en(i)), re(o, i);
   }) : f.runKernel(L, t, a);
 }
-const un = /* @__PURE__ */ m({ transpose_: Ke });
+const un = /* @__PURE__ */ m({ transpose_: Ge });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -582,8 +582,8 @@ const un = /* @__PURE__ */ m({ transpose_: Ke });
 function Re(s, e, n, r, t = "bilinear", a = 0) {
   const o = u(s, "image", "cropAndResize"), i = u(e, "boxes", "cropAndResize", "float32"), p = u(n, "boxInd", "cropAndResize", "int32"), c = i.shape[0];
   l(o.rank === 4, () => `Error in cropAndResize: image must be rank 4,but got rank ${o.rank}.`), l(i.rank === 2 && i.shape[1] === 4, () => `Error in cropAndResize: boxes must be have size [${c},4] but had shape ${i.shape}.`), l(p.rank === 1 && p.shape[0] === c, () => `Error in cropAndResize: boxInd must be have size [${c}] but had shape ${i.shape}.`), l(r.length === 2, () => `Error in cropAndResize: cropSize must be of length 2, but got length ${r.length}.`), l(r[0] >= 1 && r[1] >= 1, () => `cropSize must be atleast [1,1], but was ${r}`), l(t === "bilinear" || t === "nearest", () => `method must be bilinear or nearest, but was ${t}`);
-  const b = { image: o, boxes: i, boxInd: p }, h = { method: t, extrapolationValue: a, cropSize: r };
-  return f.runKernel(Wn, b, h);
+  const h = { image: o, boxes: i, boxInd: p }, b = { method: t, extrapolationValue: a, cropSize: r };
+  return f.runKernel(Wn, h, b);
 }
 const De = /* @__PURE__ */ m({ cropAndResize_: Re });
 /**
@@ -651,7 +651,7 @@ const je = /* @__PURE__ */ m({ grayscaleToRGB_: Pe });
 function Fe(s) {
   const e = u(s, "image", "RGBToGrayscale"), n = e.rank - 1, r = e.shape[n];
   l(e.rank >= 2, () => `Error in RGBToGrayscale: images must be at least rank 2, but got rank ${e.rank}.`), l(r === 3, () => `Error in RGBToGrayscale: last dimension of an RGB image should be size 3, but got size ${r}.`);
-  const t = e.dtype, a = K(e, "float32"), o = I([0.2989, 0.587, 0.114]);
+  const t = e.dtype, a = G(e, "float32"), o = I([0.2989, 0.587, 0.114]);
   let i;
   switch (e.rank) {
     case 2:
@@ -672,7 +672,7 @@ function Fe(s) {
     default:
       throw new Error("Not a valid tensor rank.");
   }
-  return i = z(i, -1), K(i, t);
+  return i = z(i, -1), G(i, t);
 }
 const We = /* @__PURE__ */ m({ rgbToGrayscale_: Fe });
 /**
@@ -761,10 +761,10 @@ const Le = /* @__PURE__ */ m({ nonMaxSuppression_: Ce });
 async function Xe(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY) {
   const a = u(s, "boxes", "nonMaxSuppressionAsync"), o = u(e, "scores", "nonMaxSuppressionAsync"), i = R(a, o, n, r, t);
   n = i.maxOutputSize, r = i.iouThreshold, t = i.scoreThreshold;
-  const p = await Promise.all([a.data(), o.data()]), c = p[0], b = p[1], { selectedIndices: h } = ne(c, b, n, r, t);
-  return a !== s && a.dispose(), o !== e && o.dispose(), I(h, "int32");
+  const p = await Promise.all([a.data(), o.data()]), c = p[0], h = p[1], { selectedIndices: b } = ne(c, h, n, r, t);
+  return a !== s && a.dispose(), o !== e && o.dispose(), I(b, "int32");
 }
-const Ze = Xe;
+const Je = Xe;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -781,13 +781,13 @@ const Ze = Xe;
  * limitations under the License.
  * =============================================================================
  */
-function Je(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = 0) {
+function Ze(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = 0) {
   const o = u(s, "boxes", "nonMaxSuppression"), i = u(e, "scores", "nonMaxSuppression"), p = R(o, i, n, r, t, a);
   n = p.maxOutputSize, r = p.iouThreshold, t = p.scoreThreshold, a = p.softNmsSigma;
-  const c = { boxes: o, scores: i }, b = { maxOutputSize: n, iouThreshold: r, scoreThreshold: t, softNmsSigma: a }, h = f.runKernel(Ln, c, b);
-  return { selectedIndices: h[0], selectedScores: h[1] };
+  const c = { boxes: o, scores: i }, h = { maxOutputSize: n, iouThreshold: r, scoreThreshold: t, softNmsSigma: a }, b = f.runKernel(Ln, c, h);
+  return { selectedIndices: b[0], selectedScores: b[1] };
 }
-const Qe = /* @__PURE__ */ m({ nonMaxSuppressionWithScore_: Je });
+const He = /* @__PURE__ */ m({ nonMaxSuppressionWithScore_: Ze });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -804,16 +804,16 @@ const Qe = /* @__PURE__ */ m({ nonMaxSuppressionWithScore_: Je });
  * limitations under the License.
  * =============================================================================
  */
-async function He(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = 0) {
+async function Qe(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = 0) {
   const o = u(s, "boxes", "nonMaxSuppressionAsync"), i = u(e, "scores", "nonMaxSuppressionAsync"), p = R(o, i, n, r, t, a);
   n = p.maxOutputSize, r = p.iouThreshold, t = p.scoreThreshold, a = p.softNmsSigma;
-  const c = await Promise.all([o.data(), i.data()]), b = c[0], h = c[1], { selectedIndices: g, selectedScores: d } = ee(b, h, n, r, t, a);
+  const c = await Promise.all([o.data(), i.data()]), h = c[0], b = c[1], { selectedIndices: g, selectedScores: d } = ee(h, b, n, r, t, a);
   return o !== s && o.dispose(), i !== e && i.dispose(), {
     selectedIndices: I(g, "int32"),
     selectedScores: I(d)
   };
 }
-const Ue = He;
+const Ue = Qe;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -839,10 +839,10 @@ function ns(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = !1) {
     t,
     null
     /* softNmsSigma */
-  ), c = p.maxOutputSize, b = p.iouThreshold, h = p.scoreThreshold, g = { boxes: o, scores: i }, d = {
+  ), c = p.maxOutputSize, h = p.iouThreshold, b = p.scoreThreshold, g = { boxes: o, scores: i }, d = {
     maxOutputSize: c,
-    iouThreshold: b,
-    scoreThreshold: h,
+    iouThreshold: h,
+    scoreThreshold: b,
     padToMaxOutputSize: a
   }, y = f.runKernel(Xn, g, d);
   return { selectedIndices: y[0], validOutputs: y[1] };
@@ -873,7 +873,7 @@ async function ss(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = !1) {
     t,
     null
     /* softNmsSigma */
-  ), c = p.maxOutputSize, b = p.iouThreshold, h = p.scoreThreshold, [g, d] = await Promise.all([o.data(), i.data()]), { selectedIndices: y, validOutputs: M } = se(g, d, c, b, h, a);
+  ), c = p.maxOutputSize, h = p.iouThreshold, b = p.scoreThreshold, [g, d] = await Promise.all([o.data(), i.data()]), { selectedIndices: y, validOutputs: M } = se(g, d, c, h, b, a);
   return o !== s && o.dispose(), i !== e && i.dispose(), {
     selectedIndices: I(y, "int32"),
     validOutputs: pn(M, "int32")
@@ -901,7 +901,7 @@ function rs(s, e, n = !1, r = !1) {
   l(t.rank === 3 || t.rank === 4, () => `Error in resizeBilinear: x must be rank 3 or 4, but got rank ${t.rank}.`), l(e.length === 2, () => `Error in resizeBilinear: new shape must 2D, but got shape ${e}.`), l(r === !1 || n === !1, () => "Error in resizeBilinear: If halfPixelCenters is true, alignCorners must be false.");
   let a = t, o = !1;
   t.rank === 3 && (o = !0, a = k(t, [1, t.shape[0], t.shape[1], t.shape[2]]));
-  const i = { images: a }, p = { alignCorners: n, halfPixelCenters: r, size: e }, c = f.runKernel(Zn, i, p);
+  const i = { images: a }, p = { alignCorners: n, halfPixelCenters: r, size: e }, c = f.runKernel(Jn, i, p);
   return o ? k(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
 }
 const as = /* @__PURE__ */ m({ resizeBilinear_: rs });
@@ -926,7 +926,7 @@ function os(s, e, n = !1, r = !1) {
   l(t.rank === 3 || t.rank === 4, () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got rank ${t.rank}.`), l(e.length === 2, () => `Error in resizeNearestNeighbor: new shape must 2D, but got shape ${e}.`), l(t.dtype === "float32" || t.dtype === "int32", () => "`images` must have `int32` or `float32` as dtype"), l(r === !1 || n === !1, () => "Error in resizeNearestNeighbor: If halfPixelCenters is true, alignCorners must be false.");
   let a = t, o = !1;
   t.rank === 3 && (o = !0, a = k(t, [1, t.shape[0], t.shape[1], t.shape[2]]));
-  const i = { images: a }, p = { alignCorners: n, halfPixelCenters: r, size: e }, c = f.runKernel(Jn, i, p);
+  const i = { images: a }, p = { alignCorners: n, halfPixelCenters: r, size: e }, c = f.runKernel(Zn, i, p);
   return o ? k(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
 }
 const is = /* @__PURE__ */ m({ resizeNearestNeighbor_: os });
@@ -948,32 +948,32 @@ const is = /* @__PURE__ */ m({ resizeNearestNeighbor_: os });
  */
 function cs(s, e = "binary", n = !1, r = 0.5) {
   const t = u(s, "image", "threshold"), a = 0.2989, o = 0.587, i = 0.114, p = t.shape[0] * t.shape[1];
-  let c = $(I([r]), 255), b, h, g, d;
+  let c = $(I([r]), 255), h, b, g, d;
   if (l(t.rank === 3, () => `Error in threshold: image must be rank 3,but got rank ${t.rank}.`), l(t.shape[2] === 3 || t.shape[2] === 1, () => `Error in threshold: image color channel must be equal to 3 or 1but got ${t.shape[2]}.`), l(t.dtype === "int32" || t.dtype === "float32", () => `Error in dtype: image dtype must be int32 or float32,but got dtype ${t.dtype}.`), l(e === "otsu" || e === "binary", () => `Method must be binary or otsu, but was ${e}`), t.shape[2] === 3) {
-    [b, h, g] = mn(t, [1, 1, 1], -1);
-    const T = $(b, a), B = $(h, o), x = $(g, i);
+    [h, b, g] = mn(t, [1, 1, 1], -1);
+    const T = $(h, a), B = $(b, o), x = $(g, i);
     d = U(U(T, B), x);
   } else
     d = s;
   if (e === "otsu") {
-    const T = ce(K(ze(d), "int32"), te([]), 256);
+    const T = ce(G(ze(d), "int32"), te([]), 256);
     c = us(T, p);
   }
-  const y = n ? bn(d, c) : nn(d, c);
-  return K($(y, 255), "int32");
+  const y = n ? hn(d, c) : nn(d, c);
+  return G($(y, 255), "int32");
 }
 function us(s, e) {
-  let n = I([-1]), r = I([0]), t = I([0]), a, o, i, p, c, b;
-  for (let h = 0; h < s.size - 1; h++) {
-    a = _(s, 0, h + 1), o = _(s, h + 1), c = q(E(a), e), b = q(E(o), e);
+  let n = I([-1]), r = I([0]), t = I([0]), a, o, i, p, c, h;
+  for (let b = 0; b < s.size - 1; b++) {
+    a = _(s, 0, b + 1), o = _(s, b + 1), c = q(E(a), e), h = q(E(o), e);
     const g = E($(a, W(0, a.size)));
     i = q(g, E(a));
-    const d = Qn(o.shape, a.size), y = U(W(0, o.size), d), M = $(o, y);
+    const d = Hn(o.shape, a.size), y = U(W(0, o.size), d), M = $(o, y);
     p = q(E(M), E(o));
-    const T = A(i, p), B = A(i, p), x = $(c, b);
+    const T = N(i, p), B = N(i, p), x = $(c, h);
     t = $($(x, T), B);
     const V = nn(t, r);
-    r = G(V, t, r), n = G(V, I([h]), n);
+    r = K(V, t, r), n = K(V, I([b]), n);
   }
   return n;
 }
@@ -998,7 +998,7 @@ function ps(s, e, n = "nearest", r = "constant", t = 0, a) {
   const o = u(s, "image", "transform", "float32"), i = u(e, "transforms", "transform", "float32");
   l(o.rank === 4, () => `Error in transform: image must be rank 4,but got rank ${o.rank}.`), l(i.rank === 2 && (i.shape[0] === o.shape[0] || i.shape[0] === 1) && i.shape[1] === 8, () => "Error in transform: Input transform should be batch x 8 or 1 x 8"), l(a == null || a.length === 2, () => `Error in transform: outputShape must be [height, width] or null, but got ${a}.`);
   const p = { image: o, transforms: i }, c = { interpolation: n, fillMode: r, fillValue: t, outputShape: a };
-  return f.runKernel(Hn, p, c);
+  return f.runKernel(Qn, p, c);
 }
 const ms = /* @__PURE__ */ m({ transform_: ps });
 /**
@@ -1022,11 +1022,11 @@ function fs(s, e, n) {
   l(r.rank >= 2, () => `bandPart(): Rank must be at least 2, got ${r.rank}.`);
   const t = r.shape, [a, o] = r.shape.slice(-2);
   let i, p;
-  typeof e == "number" ? (l(e % 1 === 0, () => `bandPart(): numLower must be an integer, got ${e}.`), l(e <= a, () => `bandPart(): numLower (${e}) must not be greater than the number of rows (${a}).`), i = u(e < 0 ? a : e, "numLower", "bandPart")) : (l(e.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), i = G(on(e, 0), a, cn(e, a))), typeof n == "number" ? (l(n % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${n}.`), l(n <= o, () => `bandPart(): numUpper (${n}) must not be greater than the number of columns (${o}).`), p = u(n < 0 ? o : n, "numUpper", "bandPart")) : (l(n.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), p = G(on(n, 0), o, cn(n, o)));
-  const c = k(W(0, a, 1, "int32"), [-1, 1]), b = W(0, o, 1, "int32"), h = A(c, b), g = Te(bn(h, i), ke(h, en(p))), d = ae([a, o], r.dtype);
-  return k(Y(dn(k(r, [-1, a, o])).map((y) => G(g, y, d))), t);
+  typeof e == "number" ? (l(e % 1 === 0, () => `bandPart(): numLower must be an integer, got ${e}.`), l(e <= a, () => `bandPart(): numLower (${e}) must not be greater than the number of rows (${a}).`), i = u(e < 0 ? a : e, "numLower", "bandPart")) : (l(e.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), i = K(on(e, 0), a, cn(e, a))), typeof n == "number" ? (l(n % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${n}.`), l(n <= o, () => `bandPart(): numUpper (${n}) must not be greater than the number of columns (${o}).`), p = u(n < 0 ? o : n, "numUpper", "bandPart")) : (l(n.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), p = K(on(n, 0), o, cn(n, o)));
+  const c = k(W(0, a, 1, "int32"), [-1, 1]), h = W(0, o, 1, "int32"), b = N(c, h), g = Te(hn(b, i), ke(b, en(p))), d = ae([a, o], r.dtype);
+  return k(Y(dn(k(r, [-1, a, o])).map((y) => K(g, y, d))), t);
 }
-const hs = /* @__PURE__ */ m({ bandPart_: fs });
+const bs = /* @__PURE__ */ m({ bandPart_: fs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1043,7 +1043,7 @@ const hs = /* @__PURE__ */ m({ bandPart_: fs });
  * limitations under the License.
  * =============================================================================
  */
-function bs(s) {
+function hs(s) {
   let e;
   if (Array.isArray(s)) {
     e = !1, l(s != null && s.length > 0, () => "Gram-Schmidt process: input must not be null, undefined, or empty");
@@ -1060,13 +1060,13 @@ function bs(s) {
       if (t > 0)
         for (let o = 0; o < t; ++o) {
           const i = $(E($(n[o], a)), n[o]);
-          a = A(a, i);
+          a = N(a, i);
         }
-      return q(a, hn(a, "euclidean"));
+      return q(a, bn(a, "euclidean"));
     }));
   return e ? Y(n, 0) : n;
 }
-const ds = /* @__PURE__ */ m({ gramSchmidt_: bs });
+const ds = /* @__PURE__ */ m({ gramSchmidt_: hs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1093,8 +1093,8 @@ function gs(s, e = !1) {
       s.shape[s.shape.length - 1]
     ]), 0), t = [], a = [];
     r.forEach((p) => {
-      const [c, b] = ln(p, e);
-      t.push(c), a.push(b);
+      const [c, h] = ln(p, e);
+      t.push(c), a.push(h);
     });
     const o = k(Y(t, 0), s.shape), i = k(Y(a, 0), s.shape);
     return [o, i];
@@ -1105,33 +1105,33 @@ function ln(s, e = !1) {
     l(s.shape.length === 2, () => `qr2d() requires a 2D Tensor, but got a ${s.shape.length}D Tensor.`);
     const n = s.shape[0], r = s.shape[1];
     let t = de(n), a = X(s);
-    const o = H([[1]], [1, 1]);
+    const o = Q([[1]], [1, 1]);
     let i = X(o);
     const p = n >= r ? r : n;
     for (let c = 0; c < p; ++c) {
-      const b = a, h = i, g = t;
+      const h = a, b = i, g = t;
       [i, a, t] = f.tidy(() => {
-        const d = _(a, [c, c], [n - c, 1]), y = hn(d), M = _(a, [c, c], [1, 1]), T = G(nn(M, 0), H([[-1]]), H([[1]])), B = A(M, $(T, y)), x = q(d, B);
-        x.shape[0] === 1 ? i = X(o) : i = Q([
+        const d = _(a, [c, c], [n - c, 1]), y = bn(d), M = _(a, [c, c], [1, 1]), T = K(nn(M, 0), Q([[-1]]), Q([[1]])), B = N(M, $(T, y)), x = q(d, B);
+        x.shape[0] === 1 ? i = X(o) : i = H([
           o,
           _(x, [1, 0], [x.shape[0] - 1, x.shape[1]])
         ], 0);
-        const V = en(q(N(T, B), y)), P = _(a, [c, 0], [n - c, r]), O = $(V, i), sn = un(i);
+        const V = en(q(A(T, B), y)), P = _(a, [c, 0], [n - c, r]), O = $(V, i), sn = un(i);
         if (c === 0)
-          a = A(P, N(O, N(sn, P)));
+          a = N(P, A(O, A(sn, P)));
         else {
-          const C = A(P, N(O, N(sn, P)));
-          a = Q([_(a, [0, 0], [c, r]), C], 0);
+          const C = N(P, A(O, A(sn, P)));
+          a = H([_(a, [0, 0], [c, r]), C], 0);
         }
         const tn = un(O), j = _(t, [0, c], [n, t.shape[1] - c]);
         if (c === 0)
-          t = A(j, N(N(j, i), tn));
+          t = N(j, A(A(j, i), tn));
         else {
-          const C = A(j, N(N(j, i), tn));
-          t = Q([_(t, [0, 0], [n, c]), C], 1);
+          const C = N(j, A(A(j, i), tn));
+          t = H([_(t, [0, 0], [n, c]), C], 1);
         }
         return [i, a, t];
-      }), Un([b, h, g]);
+      }), Un([h, b, g]);
     }
     return !e && n > r && (t = _(t, [0, 0], [n, r]), a = _(a, [0, 0], [r, r])), [t, a];
   });
@@ -1153,7 +1153,7 @@ const $s = /* @__PURE__ */ m({ qr_: gs });
  * limitations under the License.
  * =============================================================================
  */
-const Ks = {
+const Gs = {
   flipLeftRight: Ve,
   grayscaleToRGB: je,
   resizeNearestNeighbor: is,
@@ -1162,21 +1162,21 @@ const Ks = {
   rotateWithOffset: Oe,
   cropAndResize: De,
   nonMaxSuppression: Le,
-  nonMaxSuppressionAsync: Ze,
-  nonMaxSuppressionWithScore: Qe,
+  nonMaxSuppressionAsync: Je,
+  nonMaxSuppressionWithScore: He,
   nonMaxSuppressionWithScoreAsync: Ue,
   nonMaxSuppressionPadded: es,
   nonMaxSuppressionPaddedAsync: ts,
   threshold: ls,
   transform: ms
 }, Rs = {
-  bandPart: hs,
+  bandPart: bs,
   gramSchmidt: ds,
   qr: $s
 };
 export {
   Te as a,
-  bn as b,
+  hn as b,
   F as c,
   nn as d,
   on as e,
@@ -1184,12 +1184,12 @@ export {
   ke as g,
   I as h,
   de as i,
-  Ks as j,
+  Gs as j,
   an as k,
   Rs as l,
   cn as m,
   en as n,
-  hn as o,
+  bn as o,
   Ee as p,
   as as q,
   Se as r,
@@ -1197,6 +1197,6 @@ export {
   un as t,
   dn as u,
   is as v,
-  G as w,
+  K as w,
   ze as x
 };