@genai-fi/nanogpt 0.7.0 → 0.7.1

package/dist/{ops-CIQLNshk.js → ops-aRTXR2Sr.js}

@@ -1,42 +1,19 @@
-import { x as m, y as u, E as f, aN as gn, l, aO as $n, k as S, aP as kn, aQ as yn, aR as En, p as _n, aS as w, aT as rn, n as In, b as pn, aU as Nn, aV as An, L as Tn, ai as xn, F as v, aW as wn, aX as Sn, aY as Mn, aZ as zn, a_ as qn, a$ as Kn, b0 as Bn, Q as G, b1 as Gn, b2 as Rn, b3 as Dn, aE as vn, X as Vn, V as Pn, W as jn, b4 as Fn, t as Wn, b5 as C, b6 as On, b7 as Yn, b8 as Ln, b9 as Cn, ba as Xn, bb as Qn, bc as Jn, bd as Zn, a as $, a6 as U, aj as q, h as Hn, c as A, be as Un, K as X, d as ne } from "./index-C0dhsYom.js";
-import { n as ee, a as se, b as te } from "./non_max_suppression_impl-CsEgBuMA.js";
-import { r as k } from "./reshape-BMUzc1UY.js";
-import { s as mn } from "./split-CHzJjxDv.js";
-import { s as E } from "./sum-B8wEpKsg.js";
-import { b as Q } from "./broadcast_to-C4v-j9yA.js";
-import { r as W } from "./range-CYzpQY53.js";
-import { t as re } from "./tensor-RvZVNmg0.js";
-import { s as O } from "./stack-Dpgg_1W1.js";
-import { c as ae, z as oe } from "./zeros-DCPCdFGq.js";
-import { e as ie } from "./axis_util-DaAl5MER.js";
-import { m as J } from "./max-BQc2Aj-I.js";
-import { c as Z } from "./concat-CsHeR4zV.js";
-import { m as N } from "./mat_mul-1nwdPkQ_.js";
-import { t as H } from "./tensor2d-B_kyod7_.js";
-/**
- * @license
- * Copyright 2018 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function ce(s, e, n) {
-  const r = u(s, "x", "slice", "string_or_numeric");
-  if (r.rank === 0)
-    throw new Error("Slicing scalar is not possible");
-  const t = { x: r }, a = { begin: e, size: n };
-  return f.runKernel(gn, t, a);
-}
-const _ = /* @__PURE__ */ m({ slice_: ce });
+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-UdZhlibC.js";
+import { n as ne, a as ee, b as se } from "./non_max_suppression_impl-CsEgBuMA.js";
+import { r as k } from "./reshape-BR0eoLYN.js";
+import { s as mn } from "./split-CRU0PjVV.js";
+import { s as E } from "./sum-NLYbiDag.js";
+import { b as Z } from "./broadcast_to-Ba9h_8DO.js";
+import { s as _ } from "./slice-BHbDHObE.js";
+import { r as W } from "./range-D9CZhVlR.js";
+import { t as te } from "./tensor-Do9PKbIE.js";
+import { s as Y } from "./stack-ikk2Y8_P.js";
+import { c as re, z as ae } from "./zeros-DnPT2nD4.js";
+import { e as oe } from "./axis_util-5DTW2tFV.js";
+import { m as J } from "./max-ByjEGoFx.js";
+import { c as Q } from "./concat-CbXTetof.js";
+import { m as N } from "./mat_mul-dwmZz69e.js";
+import { t as H } from "./tensor2d-CWHxHpLh.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -53,13 +30,13 @@ const _ = /* @__PURE__ */ m({ slice_: ce });
  * limitations under the License.
  * =============================================================================
  */
-function ue(s, e, n) {
+function ie(s, e, n) {
   const r = u(s, "x", "bincount"), t = u(e, "weights", "bincount");
   l(r.dtype === "int32", () => `Error in bincount: input dtype must be int32, but got ${r.dtype}`), l(n >= 0, () => `size must be non-negative, but got ${n}.`), l(t.size === r.size || t.size === 0, () => `Error in bincount: weights must have the same size as input or0-length, but got input shape: ${r.shape}, weights shape: ${t.shape}.`);
   const a = { x: r, weights: t }, o = { size: n };
-  return f.runKernel($n, a, o);
+  return f.runKernel(gn, a, o);
 }
-const le = /* @__PURE__ */ m({ bincount_: ue });
+const ce = /* @__PURE__ */ m({ bincount_: ie });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -76,15 +53,15 @@ const le = /* @__PURE__ */ m({ bincount_: ue });
  * limitations under the License.
  * =============================================================================
  */
-function pe(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 = Q(a, o), p = Q(r, o), c = Q(t, o), b = {
+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 = {
     condition: i,
     t: p,
     e: c
   };
-  return f.runKernel(kn, b);
+  return f.runKernel($n, b);
 }
-const B = /* @__PURE__ */ m({ where_: pe });
+const G = /* @__PURE__ */ m({ where_: ue });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -101,11 +78,11 @@ const B = /* @__PURE__ */ m({ where_: pe });
  * limitations under the License.
  * =============================================================================
  */
-function me(s, ...e) {
+function le(s, ...e) {
   const n = e.map((t, a) => u(t, `tensors${a}`, "einsum")), r = { equation: s };
-  return f.runKernel(yn, n, r);
+  return f.runKernel(kn, n, r);
 }
-const D = /* @__PURE__ */ m({ einsum_: me });
+const D = /* @__PURE__ */ m({ einsum_: le });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -122,11 +99,11 @@ const D = /* @__PURE__ */ m({ einsum_: me });
  * limitations under the License.
  * =============================================================================
  */
-function fe(s, e = null, n = !1) {
+function pe(s, e = null, n = !1) {
   const t = { x: u(s, "x", "min") }, a = { axis: e, keepDims: n };
-  return f.runKernel(En, t, a);
+  return f.runKernel(yn, t, a);
 }
-const an = /* @__PURE__ */ m({ min_: fe });
+const an = /* @__PURE__ */ m({ min_: pe });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -143,13 +120,13 @@ const an = /* @__PURE__ */ m({ min_: fe });
  * limitations under the License.
  * =============================================================================
  */
-function he(s, e = "euclidean", n = null, r = !1) {
+function me(s, e = "euclidean", n = null, r = !1) {
   s = u(s, "x", "norm");
   const t = fn(s, e, n);
   let a = t.shape;
   if (r) {
-    const o = _n(n, s.shape);
-    a = ie(t.shape, o);
+    const o = En(n, s.shape);
+    a = oe(t.shape, o);
   }
   return k(t, a);
 }
@@ -166,7 +143,7 @@ function fn(s, e, n = null) {
     if (e === -1 / 0)
       return an(w(s), n);
     if (e === "euclidean" || e === 2)
-      return rn(E(In(w(s), pn(2, "int32")), n));
+      return rn(E(_n(w(s), pn(2, "int32")), n));
     throw new Error(`Error in norm: invalid ord value: ${e}`);
   }
   if (Array.isArray(n) && n.length === 2) {
@@ -177,12 +154,12 @@ function fn(s, e, n = null) {
     if (e === -1 / 0)
       return an(E(w(s), n[1]), n[0]);
     if (e === "fro" || e === "euclidean")
-      return rn(E(Nn(s), n));
+      return rn(E(In(s), n));
     throw new Error(`Error in norm: invalid ord value: ${e}`);
   }
   throw new Error(`Error in norm: invalid axis: ${n}`);
 }
-const hn = /* @__PURE__ */ m({ norm_: he });
+const hn = /* @__PURE__ */ m({ norm_: me });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -199,13 +176,13 @@ const hn = /* @__PURE__ */ m({ norm_: he });
  * limitations under the License.
  * =============================================================================
  */
-function be(s, e = 0) {
+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(An, r, t);
+  return f.runKernel(Nn, r, t);
 }
-const z = /* @__PURE__ */ m({ expandDims_: be });
+const z = /* @__PURE__ */ m({ expandDims_: fe });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -222,13 +199,13 @@ const z = /* @__PURE__ */ m({ expandDims_: be });
  * limitations under the License.
  * =============================================================================
  */
-function de(s, e) {
+function he(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(Tn, r, t);
+  return f.runKernel(An, r, t);
 }
-const F = /* @__PURE__ */ m({ tile_: de });
+const F = /* @__PURE__ */ m({ tile_: he });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -245,9 +222,9 @@ const F = /* @__PURE__ */ m({ tile_: de });
  * limitations under the License.
  * =============================================================================
  */
-function ge(s, e, n, r = "float32") {
+function be(s, e, n, r = "float32") {
   e == null && (e = s);
-  const t = xn([s, e], r), a = s <= e ? s : e;
+  const t = Tn([s, e], r), a = s <= e ? s : e;
   for (let i = 0; i < a; ++i)
     t.set(1, i, i);
   const o = k(t.toTensor(), [s, e]);
@@ -267,7 +244,7 @@ function ge(s, e, n, r = "float32") {
     ]);
   throw new Error(`eye() currently supports only 1D and 2D batchShapes, but received ${n.length}D.`);
 }
-const $e = /* @__PURE__ */ m({ eye_: ge });
+const de = /* @__PURE__ */ m({ eye_: be });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -284,13 +261,13 @@ const $e = /* @__PURE__ */ m({ eye_: ge });
  * limitations under the License.
  * =============================================================================
  */
-function ke(s, e) {
+function ge(s, e) {
   let n = u(s, "a", "greater", "string_or_numeric"), r = u(e, "b", "greater", "string_or_numeric");
   [n, r] = v(n, r), S(n.shape, r.shape);
   const t = { a: n, b: r };
-  return f.runKernel(wn, t);
+  return f.runKernel(xn, t);
 }
-const nn = /* @__PURE__ */ m({ greater_: ke });
+const nn = /* @__PURE__ */ m({ greater_: ge });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -307,13 +284,13 @@ const nn = /* @__PURE__ */ m({ greater_: ke });
  * limitations under the License.
  * =============================================================================
  */
-function ye(s, e) {
+function $e(s, e) {
   let n = u(s, "a", "greaterEqual", "string_or_numeric"), r = u(e, "b", "greaterEqual", "string_or_numeric");
   [n, r] = v(n, r), S(n.shape, r.shape);
   const t = { a: n, b: r };
-  return f.runKernel(Sn, t);
+  return f.runKernel(wn, t);
 }
-const Ee = /* @__PURE__ */ m({ greaterEqual_: ye });
+const ke = /* @__PURE__ */ m({ greaterEqual_: $e });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -330,11 +307,11 @@ const Ee = /* @__PURE__ */ m({ greaterEqual_: ye });
  * limitations under the License.
  * =============================================================================
  */
-function _e(s) {
+function ye(s) {
   const n = { input: u(s, "input", "imag") };
-  return f.runKernel(Mn, n);
+  return f.runKernel(Sn, n);
 }
-const Ie = /* @__PURE__ */ m({ imag_: _e });
+const Ee = /* @__PURE__ */ m({ imag_: ye });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -351,13 +328,13 @@ const Ie = /* @__PURE__ */ m({ imag_: _e });
  * limitations under the License.
  * =============================================================================
  */
-function Ne(s, e) {
+function _e(s, e) {
   let n = u(s, "a", "less", "string_or_numeric"), r = u(e, "b", "less", "string_or_numeric");
   [n, r] = v(n, r), S(n.shape, r.shape);
   const t = { a: n, b: r };
-  return f.runKernel(zn, t);
+  return f.runKernel(Mn, t);
 }
-const on = /* @__PURE__ */ m({ less_: Ne });
+const on = /* @__PURE__ */ m({ less_: _e });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -374,13 +351,13 @@ const on = /* @__PURE__ */ m({ less_: Ne });
  * limitations under the License.
  * =============================================================================
  */
-function Ae(s, e) {
+function Ie(s, e) {
   let n = u(s, "a", "lessEqual", "string_or_numeric"), r = u(e, "b", "lessEqual", "string_or_numeric");
   [n, r] = v(n, r), S(n.shape, r.shape);
   const t = { a: n, b: r };
-  return f.runKernel(qn, t);
+  return f.runKernel(zn, t);
 }
-const bn = /* @__PURE__ */ m({ lessEqual_: Ae });
+const bn = /* @__PURE__ */ m({ lessEqual_: Ie });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -397,11 +374,11 @@ const bn = /* @__PURE__ */ m({ lessEqual_: Ae });
  * limitations under the License.
  * =============================================================================
  */
-function Te(s) {
+function Ne(s) {
   const n = { x: u(s, "x", "neg") };
-  return f.runKernel(Kn, n);
+  return f.runKernel(qn, n);
 }
-const en = /* @__PURE__ */ m({ neg_: Te });
+const en = /* @__PURE__ */ m({ neg_: Ne });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -418,13 +395,13 @@ const en = /* @__PURE__ */ m({ neg_: Te });
  * limitations under the License.
  * =============================================================================
  */
-function xe(s, e) {
+function Ae(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 we = /* @__PURE__ */ m({ logicalAnd_: xe });
+const Te = /* @__PURE__ */ m({ logicalAnd_: Ae });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -441,13 +418,13 @@ const we = /* @__PURE__ */ m({ logicalAnd_: xe });
  * limitations under the License.
  * =============================================================================
  */
-function Se(s, e) {
+function xe(s, e) {
   let n = u(s, "a", "minimum"), r = u(e, "b", "minimum");
-  [n, r] = v(n, r), n.dtype === "bool" && (n = G(n, "int32"), r = G(r, "int32")), S(n.shape, r.shape);
+  [n, r] = v(n, r), n.dtype === "bool" && (n = K(n, "int32"), r = K(r, "int32")), S(n.shape, r.shape);
   const t = { a: n, b: r };
   return f.runKernel(Gn, t);
 }
-const cn = /* @__PURE__ */ m({ minimum_: Se });
+const cn = /* @__PURE__ */ m({ minimum_: xe });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -464,11 +441,11 @@ const cn = /* @__PURE__ */ m({ minimum_: Se });
  * limitations under the License.
  * =============================================================================
  */
-function Me(s) {
+function we(s) {
   const n = { input: u(s, "input", "real") };
-  return f.runKernel(Rn, n);
+  return f.runKernel(Kn, n);
 }
-const ze = /* @__PURE__ */ m({ real_: Me });
+const Se = /* @__PURE__ */ m({ real_: we });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -485,11 +462,11 @@ const ze = /* @__PURE__ */ m({ real_: Me });
  * limitations under the License.
  * =============================================================================
  */
-function qe(s) {
+function Me(s) {
   const n = { x: u(s, "x", "round") };
-  return f.runKernel(Dn, n);
+  return f.runKernel(Rn, n);
 }
-const Ke = /* @__PURE__ */ m({ round_: qe });
+const ze = /* @__PURE__ */ m({ round_: Me });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -506,11 +483,11 @@ const Ke = /* @__PURE__ */ m({ round_: qe });
  * limitations under the License.
  * =============================================================================
  */
-function Be(s, e) {
+function qe(s, e) {
   const n = u(s, "x", "squeeze", "string_or_numeric");
-  return k(n, vn(n.shape, e).newShape);
+  return k(n, Dn(n.shape, e).newShape);
 }
-const Ge = /* @__PURE__ */ m({ squeeze_: Be });
+const Be = /* @__PURE__ */ m({ squeeze_: qe });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -528,11 +505,11 @@ const Ge = /* @__PURE__ */ m({ squeeze_: Be });
  * =============================================================================
  */
 function I(s, e) {
-  Vn(s);
-  const n = Pn(s, e);
+  vn(s);
+  const n = Vn(s, e);
   if (n.length !== 1)
     throw new Error("tensor1d() requires values to be a flat/TypedArray");
-  return jn(s, null, n, e);
+  return Pn(s, null, n, e);
 }
 /**
  * @license
@@ -550,13 +527,13 @@ function I(s, e) {
  * limitations under the License.
  * =============================================================================
  */
-function Re(s, e = 0) {
+function Ge(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(Fn, r, t);
+  return f.runKernel(jn, r, t);
 }
-const dn = /* @__PURE__ */ m({ unstack_: Re });
+const dn = /* @__PURE__ */ m({ unstack_: Ge });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -573,19 +550,19 @@ const dn = /* @__PURE__ */ m({ unstack_: Re });
  * limitations under the License.
  * =============================================================================
  */
-function De(s, e, n) {
+function Ke(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}`);
   }), r.rank <= 1)
     return r.clone();
   const t = { x: r }, a = { perm: e };
-  return r.dtype === "complex64" ? Wn(() => {
-    let o = ze(r), i = Ie(r);
-    return o = f.runKernel(C, { x: o }, a), i = f.runKernel(C, { x: i }, a), n && (i = en(i)), ae(o, i);
-  }) : f.runKernel(C, t, a);
+  return r.dtype === "complex64" ? Fn(() => {
+    let o = Se(r), i = Ee(r);
+    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_: De });
+const un = /* @__PURE__ */ m({ transpose_: Ke });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -602,13 +579,13 @@ const un = /* @__PURE__ */ m({ transpose_: De });
  * limitations under the License.
  * =============================================================================
  */
-function ve(s, e, n, r, t = "bilinear", a = 0) {
+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(On, b, h);
+  return f.runKernel(Wn, b, h);
 }
-const Ve = /* @__PURE__ */ m({ cropAndResize_: ve });
+const De = /* @__PURE__ */ m({ cropAndResize_: Re });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -625,13 +602,13 @@ const Ve = /* @__PURE__ */ m({ cropAndResize_: ve });
  * limitations under the License.
  * =============================================================================
  */
-function Pe(s) {
+function ve(s) {
   const e = u(s, "image", "flipLeftRight", "float32");
   l(e.rank === 4, () => `Error in flipLeftRight: image must be rank 4,but got rank ${e.rank}.`);
   const n = { image: e };
   return f.runKernel(Yn, n, {});
 }
-const je = /* @__PURE__ */ m({ flipLeftRight_: Pe });
+const Ve = /* @__PURE__ */ m({ flipLeftRight_: ve });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -648,13 +625,13 @@ const je = /* @__PURE__ */ m({ flipLeftRight_: Pe });
  * limitations under the License.
  * =============================================================================
  */
-function Fe(s) {
+function Pe(s) {
   const e = u(s, "image", "grayscaleToRGB"), n = e.rank - 1, r = e.shape[n];
   l(e.rank >= 2, () => `Error in grayscaleToRGB: images must be at least rank 2, but got rank ${e.rank}.`), l(r === 1, () => `Error in grayscaleToRGB: last dimension of a grayscale image should be size 1, but got size ${r}.`);
   const t = new Array(e.rank);
   return t.fill(1, 0, n), t[n] = 3, F(e, t);
 }
-const We = /* @__PURE__ */ m({ grayscaleToRGB_: Fe });
+const je = /* @__PURE__ */ m({ grayscaleToRGB_: Pe });
 /**
  * @license
  * Copyright 2023 Google LLC.
@@ -671,10 +648,10 @@ const We = /* @__PURE__ */ m({ grayscaleToRGB_: Fe });
  * limitations under the License.
  * =============================================================================
  */
-function Oe(s) {
+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 = G(e, "float32"), o = I([0.2989, 0.587, 0.114]);
+  const t = e.dtype, a = K(e, "float32"), o = I([0.2989, 0.587, 0.114]);
   let i;
   switch (e.rank) {
     case 2:
@@ -695,9 +672,9 @@ function Oe(s) {
     default:
       throw new Error("Not a valid tensor rank.");
   }
-  return i = z(i, -1), G(i, t);
+  return i = z(i, -1), K(i, t);
 }
-const Ye = /* @__PURE__ */ m({ rgbToGrayscale_: Oe });
+const We = /* @__PURE__ */ m({ rgbToGrayscale_: Fe });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -714,13 +691,13 @@ const Ye = /* @__PURE__ */ m({ rgbToGrayscale_: Oe });
  * limitations under the License.
  * =============================================================================
  */
-function Le(s, e, n = 0, r = 0.5) {
+function Ye(s, e, n = 0, r = 0.5) {
   const t = u(s, "image", "rotateWithOffset", "float32");
   l(t.rank === 4, () => `Error in rotateWithOffset: image must be rank 4,but got rank ${t.rank}.`);
   const a = { image: t }, o = { radians: e, fillValue: n, center: r };
-  return f.runKernel(Ln, a, o);
+  return f.runKernel(On, a, o);
 }
-const Ce = /* @__PURE__ */ m({ rotateWithOffset_: Le });
+const Oe = /* @__PURE__ */ m({ rotateWithOffset_: Ye });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -758,13 +735,13 @@ function R(s, e, n, r, t, a) {
  * limitations under the License.
  * =============================================================================
  */
-function Xe(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY) {
+function Ce(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY) {
   const a = u(s, "boxes", "nonMaxSuppression", "float32"), o = u(e, "scores", "nonMaxSuppression", "float32"), i = R(a, o, n, r, t);
   n = i.maxOutputSize, r = i.iouThreshold, t = i.scoreThreshold;
   const p = { maxOutputSize: n, iouThreshold: r, scoreThreshold: t };
   return f.runKernel(Cn, { boxes: a, scores: o }, p);
 }
-const Qe = /* @__PURE__ */ m({ nonMaxSuppression_: Xe });
+const Le = /* @__PURE__ */ m({ nonMaxSuppression_: Ce });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -781,13 +758,13 @@ const Qe = /* @__PURE__ */ m({ nonMaxSuppression_: Xe });
  * limitations under the License.
  * =============================================================================
  */
-async function Je(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY) {
+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 } = ee(c, b, n, r, t);
+  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 Ze = Je;
+const Ze = Xe;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -804,13 +781,13 @@ const Ze = Je;
  * limitations under the License.
  * =============================================================================
  */
-function He(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = 0) {
+function Je(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(Xn, c, b);
+  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 Ue = /* @__PURE__ */ m({ nonMaxSuppressionWithScore_: He });
+const Qe = /* @__PURE__ */ m({ nonMaxSuppressionWithScore_: Je });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -827,16 +804,16 @@ const Ue = /* @__PURE__ */ m({ nonMaxSuppressionWithScore_: He });
  * limitations under the License.
  * =============================================================================
  */
-async function ns(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = 0) {
+async function He(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 } = se(b, h, n, r, t, a);
+  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);
   return o !== s && o.dispose(), i !== e && i.dispose(), {
     selectedIndices: I(g, "int32"),
     selectedScores: I(d)
   };
 }
-const es = ns;
+const Ue = He;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -853,7 +830,7 @@ const es = ns;
  * limitations under the License.
  * =============================================================================
  */
-function ss(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = !1) {
+function ns(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = !1) {
   const o = u(s, "boxes", "nonMaxSuppression"), i = u(e, "scores", "nonMaxSuppression"), p = R(
     o,
     i,
@@ -867,10 +844,10 @@ function ss(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = !1) {
     iouThreshold: b,
     scoreThreshold: h,
     padToMaxOutputSize: a
-  }, y = f.runKernel(Qn, g, d);
+  }, y = f.runKernel(Xn, g, d);
   return { selectedIndices: y[0], validOutputs: y[1] };
 }
-const ts = /* @__PURE__ */ m({ nonMaxSuppressionPadded_: ss });
+const es = /* @__PURE__ */ m({ nonMaxSuppressionPadded_: ns });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -887,7 +864,7 @@ const ts = /* @__PURE__ */ m({ nonMaxSuppressionPadded_: ss });
  * limitations under the License.
  * =============================================================================
  */
-async function rs(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = !1) {
+async function ss(s, e, n, r = 0.5, t = Number.NEGATIVE_INFINITY, a = !1) {
   const o = u(s, "boxes", "nonMaxSuppressionAsync"), i = u(e, "scores", "nonMaxSuppressionAsync"), p = R(
     o,
     i,
@@ -896,13 +873,13 @@ async function rs(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 } = te(g, d, c, b, h, a);
+  ), 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);
   return o !== s && o.dispose(), i !== e && i.dispose(), {
     selectedIndices: I(y, "int32"),
     validOutputs: pn(M, "int32")
   };
 }
-const as = rs;
+const ts = ss;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -919,15 +896,15 @@ const as = rs;
  * limitations under the License.
  * =============================================================================
  */
-function os(s, e, n = !1, r = !1) {
+function rs(s, e, n = !1, r = !1) {
   const t = u(s, "images", "resizeBilinear");
   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(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({ resizeBilinear_: os });
+const as = /* @__PURE__ */ m({ resizeBilinear_: rs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -944,15 +921,15 @@ const is = /* @__PURE__ */ m({ resizeBilinear_: os });
  * limitations under the License.
  * =============================================================================
  */
-function cs(s, e, n = !1, r = !1) {
+function os(s, e, n = !1, r = !1) {
   const t = u(s, "images", "resizeNearestNeighbor");
   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(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 us = /* @__PURE__ */ m({ resizeNearestNeighbor_: cs });
+const is = /* @__PURE__ */ m({ resizeNearestNeighbor_: os });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -969,38 +946,38 @@ const us = /* @__PURE__ */ m({ resizeNearestNeighbor_: cs });
  * limitations under the License.
  * =============================================================================
  */
-function ls(s, e = "binary", n = !1, r = 0.5) {
+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;
   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), K = $(h, o), x = $(g, i);
-    d = U(U(T, K), x);
+    const T = $(b, a), B = $(h, o), x = $(g, i);
+    d = U(U(T, B), x);
   } else
     d = s;
   if (e === "otsu") {
-    const T = le(G(Ke(d), "int32"), re([]), 256);
-    c = ps(T, p);
+    const T = ce(K(ze(d), "int32"), te([]), 256);
+    c = us(T, p);
   }
   const y = n ? bn(d, c) : nn(d, c);
-  return G($(y, 255), "int32");
+  return K($(y, 255), "int32");
 }
-function ps(s, e) {
+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);
     const g = E($(a, W(0, a.size)));
     i = q(g, E(a));
-    const d = Hn(o.shape, a.size), y = U(W(0, o.size), d), M = $(o, y);
+    const d = Qn(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), K = A(i, p), x = $(c, b);
-    t = $($(x, T), K);
+    const T = A(i, p), B = A(i, p), x = $(c, b);
+    t = $($(x, T), B);
     const V = nn(t, r);
-    r = B(V, t, r), n = B(V, I([h]), n);
+    r = G(V, t, r), n = G(V, I([h]), n);
   }
   return n;
 }
-const ms = /* @__PURE__ */ m({ threshold_: ls });
+const ls = /* @__PURE__ */ m({ threshold_: cs });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -1017,13 +994,13 @@ const ms = /* @__PURE__ */ m({ threshold_: ls });
  * limitations under the License.
  * =============================================================================
  */
-function fs(s, e, n = "nearest", r = "constant", t = 0, a) {
+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(Un, p, c);
+  return f.runKernel(Hn, p, c);
 }
-const hs = /* @__PURE__ */ m({ transform_: fs });
+const ms = /* @__PURE__ */ m({ transform_: ps });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1040,16 +1017,16 @@ const hs = /* @__PURE__ */ m({ transform_: fs });
  * limitations under the License.
  * =============================================================================
  */
-function bs(s, e, n) {
+function fs(s, e, n) {
   const r = u(s, "a", "bandPart");
   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 = B(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 = B(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 = we(bn(h, i), Ee(h, en(p))), d = oe([a, o], r.dtype);
-  return k(O(dn(k(r, [-1, a, o])).map((y) => B(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 = 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);
 }
-const ds = /* @__PURE__ */ m({ bandPart_: bs });
+const hs = /* @__PURE__ */ m({ bandPart_: fs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1066,7 +1043,7 @@ const ds = /* @__PURE__ */ m({ bandPart_: bs });
  * limitations under the License.
  * =============================================================================
  */
-function gs(s) {
+function bs(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");
@@ -1074,7 +1051,7 @@ function gs(s) {
     for (let a = 1; a < s.length; ++a)
       l(s[a].shape[0] === t, () => `Gram-Schmidt: Non-unique lengths found in the input vectors: (${s[a].shape[0]} vs. ${t})`);
   } else
-    e = !0, s = mn(s, s.shape[0], 0).map((t) => Ge(t, [0]));
+    e = !0, s = mn(s, s.shape[0], 0).map((t) => Be(t, [0]));
   l(s.length <= s[0].shape[0], () => `Gram-Schmidt: Number of vectors (${s.length}) exceeds number of dimensions (${s[0].shape[0]}).`);
   const n = [], r = s;
   for (let t = 0; t < s.length; ++t)
@@ -1087,9 +1064,9 @@ function gs(s) {
         }
       return q(a, hn(a, "euclidean"));
     }));
-  return e ? O(n, 0) : n;
+  return e ? Y(n, 0) : n;
 }
-const $s = /* @__PURE__ */ m({ gramSchmidt_: gs });
+const ds = /* @__PURE__ */ m({ gramSchmidt_: bs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1106,7 +1083,7 @@ const $s = /* @__PURE__ */ m({ gramSchmidt_: gs });
  * limitations under the License.
  * =============================================================================
  */
-function ks(s, e = !1) {
+function gs(s, e = !1) {
   if (l(s.rank >= 2, () => `qr() requires input tensor to have a rank >= 2, but got rank ${s.rank}`), s.rank === 2)
     return ln(s, e);
   {
@@ -1119,7 +1096,7 @@ function ks(s, e = !1) {
       const [c, b] = ln(p, e);
       t.push(c), a.push(b);
     });
-    const o = k(O(t, 0), s.shape), i = k(O(a, 0), s.shape);
+    const o = k(Y(t, 0), s.shape), i = k(Y(a, 0), s.shape);
     return [o, i];
   }
 }
@@ -1127,39 +1104,39 @@ function ln(s, e = !1) {
   return f.tidy(() => {
     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 = $e(n), a = X(s);
+    let t = de(n), a = X(s);
     const o = H([[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;
       [i, a, t] = f.tidy(() => {
-        const d = _(a, [c, c], [n - c, 1]), y = hn(d), M = _(a, [c, c], [1, 1]), T = B(nn(M, 0), H([[-1]]), H([[1]])), K = A(M, $(T, y)), x = q(d, K);
-        x.shape[0] === 1 ? i = X(o) : i = Z([
+        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([
           o,
           _(x, [1, 0], [x.shape[0] - 1, x.shape[1]])
         ], 0);
-        const V = en(q(N(T, K), y)), P = _(a, [c, 0], [n - c, r]), Y = $(V, i), sn = un(i);
+        const V = en(q(N(T, B), y)), P = _(a, [c, 0], [n - c, r]), O = $(V, i), sn = un(i);
         if (c === 0)
-          a = A(P, N(Y, N(sn, P)));
+          a = A(P, N(O, N(sn, P)));
         else {
-          const L = A(P, N(Y, N(sn, P)));
-          a = Z([_(a, [0, 0], [c, r]), L], 0);
+          const C = A(P, N(O, N(sn, P)));
+          a = Q([_(a, [0, 0], [c, r]), C], 0);
         }
-        const tn = un(Y), j = _(t, [0, c], [n, t.shape[1] - c]);
+        const tn = un(O), j = _(t, [0, c], [n, t.shape[1] - c]);
         if (c === 0)
           t = A(j, N(N(j, i), tn));
         else {
-          const L = A(j, N(N(j, i), tn));
-          t = Z([_(t, [0, 0], [n, c]), L], 1);
+          const C = A(j, N(N(j, i), tn));
+          t = Q([_(t, [0, 0], [n, c]), C], 1);
         }
         return [i, a, t];
-      }), ne([b, h, g]);
+      }), Un([b, h, g]);
     }
     return !e && n > r && (t = _(t, [0, 0], [n, r]), a = _(a, [0, 0], [r, r])), [t, a];
   });
 }
-const ys = /* @__PURE__ */ m({ qr_: ks });
+const $s = /* @__PURE__ */ m({ qr_: gs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1176,51 +1153,50 @@ const ys = /* @__PURE__ */ m({ qr_: ks });
  * limitations under the License.
  * =============================================================================
  */
-const Rs = {
-  flipLeftRight: je,
-  grayscaleToRGB: We,
-  resizeNearestNeighbor: us,
-  resizeBilinear: is,
-  rgbToGrayscale: Ye,
-  rotateWithOffset: Ce,
-  cropAndResize: Ve,
-  nonMaxSuppression: Qe,
+const Ks = {
+  flipLeftRight: Ve,
+  grayscaleToRGB: je,
+  resizeNearestNeighbor: is,
+  resizeBilinear: as,
+  rgbToGrayscale: We,
+  rotateWithOffset: Oe,
+  cropAndResize: De,
+  nonMaxSuppression: Le,
   nonMaxSuppressionAsync: Ze,
-  nonMaxSuppressionWithScore: Ue,
-  nonMaxSuppressionWithScoreAsync: es,
-  nonMaxSuppressionPadded: ts,
-  nonMaxSuppressionPaddedAsync: as,
-  threshold: ms,
-  transform: hs
-}, Ds = {
-  bandPart: ds,
-  gramSchmidt: $s,
-  qr: ys
+  nonMaxSuppressionWithScore: Qe,
+  nonMaxSuppressionWithScoreAsync: Ue,
+  nonMaxSuppressionPadded: es,
+  nonMaxSuppressionPaddedAsync: ts,
+  threshold: ls,
+  transform: ms
+}, Rs = {
+  bandPart: hs,
+  gramSchmidt: ds,
+  qr: $s
 };
 export {
-  we as a,
+  Te as a,
   bn as b,
   F as c,
   nn as d,
   on as e,
   z as f,
-  Ee as g,
+  ke as g,
   I as h,
-  $e as i,
-  Ge as j,
-  Rs as k,
-  Ds as l,
+  de as i,
+  Ks as j,
+  an as k,
+  Rs as l,
   cn as m,
   en as n,
-  an as o,
-  hn as p,
-  Ie as q,
-  ze as r,
-  _ as s,
+  hn as o,
+  Ee as p,
+  as as q,
+  Se as r,
+  Be as s,
   un as t,
   dn as u,
   is as v,
-  B as w,
-  us as x,
-  Ke as y
+  G as w,
+  ze as x
 };