@genai-fi/nanogpt 0.4.1 → 0.4.2

package/dist/{tfjs_backend-Bzl2SrRo.js → tfjs_backend-Cug-PH75.js}

@@ -1,18 +1,18 @@
-import { o as p, h as l, E as d, af as oe, ag as ae, j as f, ah as ie, D as Cn, ai as ce, aj as v, ak as ue, al as le, am as fe, an as pe, a1 as he, ao as In, ap as de, p as Y, aq as me, ar as ge, as as $e, at as be, au as ke, av as xe, aw as we, ax as ye, x as L, ay as _e, az as Ae, k as zn, aA as Ie, aB as Ee, aC as Te, aD as Se, aE as Ne, aF as De, I as Me, J as Oe, K as Ve, aG as ve, t as P, aH as dn, aI as Pe, aa as Be, aJ as K, a5 as C, b as A, aK as Re, n as Vn, c as vn, aL as Pn, aM as Ke, aN as qe, aO as Fe, aP as je, aQ as Ge, aR as Le, f as Ce, aS as ze, aT as Ue, s as R, aU as Je, w as mn, a as We, ae as Bn, aV as Ye, $ as Xe } from "./index-XjBAhiFO.js";
-import { r as $ } from "./reshape-DFzh97Sc.js";
-import { s as Un } from "./split-CkbeVdF8.js";
-import { s as j } from "./sum-C6u3xMi3.js";
-import { b as gn } from "./slice_util-CnVNPQI-.js";
-import { r as ln } from "./range-DQMNzBWs.js";
-import { t as Ze } from "./tensor-Cu1fU7H7.js";
-import { s as fn } from "./stack-DaIMO5iX.js";
-import { c as He, z as Qe } from "./zeros-CmJFiC84.js";
-import { n as Jn } from "./norm-BzY929B_.js";
-import { c as G } from "./concat-DS_qH7MI.js";
-import { m as _ } from "./mat_mul-CKwFEV1Q.js";
-import { t as $n } from "./tensor2d-D0CKdG6B.js";
-import { s as Wn } from "./index-C4L8Cm77.js";
-import { g as nt } from "./gather-BUmJIS8n.js";
+import { o as f, h as l, E as d, an as nn, ao as tn, j as p, ap as sn, D as Ve, aq as rn, al as P, ar as on, as as an, at as cn, au as un, a1 as ln, aa as pn, p as Y, av as fn, aw as hn, ax as dn, ay as mn, az as gn, aA as $n, aB as bn, aC as kn, x as C, aD as xn, aE as wn, aF as An, aG as yn, aH as _n, aI as In, aJ as En, aK as Sn, I as Tn, J as Nn, K as Dn, aL as Mn, t as K, aM as he, b as I, aN as On, a5 as U, n as Me, c as Oe, aO as Be, aP as Bn, aQ as Pn, aR as Kn, aS as Rn, aT as qn, aU as jn, f as Fn, aV as Gn, aW as Ln, ad as L, s as q, aX as Vn, w as de, a as Cn, ai as Pe, aY as vn, $ as zn } from "./index-C4JCoBvj.js";
+import { r as $ } from "./reshape-Boe4DuIO.js";
+import { s as Ce } from "./split-DbcNm1-i.js";
+import { s as G } from "./sum-R28pucR5.js";
+import { b as me } from "./slice_util-19zDNNSn.js";
+import { r as ue } from "./range-9AzeApCc.js";
+import { t as Wn } from "./tensor-BVeHdl7V.js";
+import { s as le } from "./stack-D1YjmgKN.js";
+import { c as Jn, z as Yn } from "./zeros-dnQxFgAD.js";
+import { n as ve } from "./norm-CZM380I3.js";
+import { c as V } from "./concat-CuRsVY-K.js";
+import { m as y } from "./mat_mul-415y5Qn2.js";
+import { t as ge } from "./tensor2d-DqFGNs_K.js";
+import { r as Un, d as Xn } from "./dropout-DfDdklfL.js";
+import { g as Zn } from "./gather-ZYRWhmXR.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -29,11 +29,11 @@ import { g as nt } from "./gather-BUmJIS8n.js";
  * limitations under the License.
  * =============================================================================
  */
-function et(n) {
-  const t = { x: l(n, "x", "sigmoid", "float32") };
-  return d.runKernel(oe, t);
+function Hn(e) {
+  const t = { x: l(e, "x", "sigmoid", "float32") };
+  return d.runKernel(nn, t);
 }
-const tt = /* @__PURE__ */ p({ sigmoid_: et });
+const Qn = /* @__PURE__ */ f({ sigmoid_: Hn });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -50,14 +50,14 @@ const tt = /* @__PURE__ */ p({ sigmoid_: et });
  * limitations under the License.
  * =============================================================================
  */
-function st(n, e, t) {
-  const s = l(n, "x", "slice", "string_or_numeric");
+function et(e, n, t) {
+  const s = l(e, "x", "slice", "string_or_numeric");
   if (s.rank === 0)
     throw new Error("Slicing scalar is not possible");
-  const r = { x: s }, o = { begin: e, size: t };
-  return d.runKernel(ae, r, o);
+  const r = { x: s }, o = { begin: n, size: t };
+  return d.runKernel(tn, r, o);
 }
-const I = /* @__PURE__ */ p({ slice_: st });
+const _ = /* @__PURE__ */ f({ slice_: et });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -74,13 +74,13 @@ const I = /* @__PURE__ */ p({ slice_: st });
  * limitations under the License.
  * =============================================================================
  */
-function rt(n, e, t) {
-  const s = l(n, "x", "bincount"), r = l(e, "weights", "bincount");
-  f(s.dtype === "int32", () => `Error in bincount: input dtype must be int32, but got ${s.dtype}`), f(t >= 0, () => `size must be non-negative, but got ${t}.`), f(r.size === s.size || r.size === 0, () => `Error in bincount: weights must have the same size as input or0-length, but got input shape: ${s.shape}, weights shape: ${r.shape}.`);
+function nt(e, n, t) {
+  const s = l(e, "x", "bincount"), r = l(n, "weights", "bincount");
+  p(s.dtype === "int32", () => `Error in bincount: input dtype must be int32, but got ${s.dtype}`), p(t >= 0, () => `size must be non-negative, but got ${t}.`), p(r.size === s.size || r.size === 0, () => `Error in bincount: weights must have the same size as input or0-length, but got input shape: ${s.shape}, weights shape: ${r.shape}.`);
   const o = { x: s, weights: r }, a = { size: t };
-  return d.runKernel(ie, o, a);
+  return d.runKernel(sn, o, a);
 }
-const ot = /* @__PURE__ */ p({ bincount_: rt });
+const tt = /* @__PURE__ */ f({ bincount_: nt });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -97,34 +97,34 @@ const ot = /* @__PURE__ */ p({ bincount_: rt });
  * limitations under the License.
  * =============================================================================
  */
-function at(n, e, t) {
-  const s = l(n, "x", "clipByValue");
-  if (f(e <= t, () => `Error in clip: min (${e}) must be less than or equal to max (${t}).`), e === t)
-    return Cn(s.shape, e, s.dtype);
-  const r = { x: s }, o = { clipValueMin: e, clipValueMax: t };
-  return d.runKernel(ce, r, o);
+function st(e, n, t) {
+  const s = l(e, "x", "clipByValue");
+  if (p(n <= t, () => `Error in clip: min (${n}) must be less than or equal to max (${t}).`), n === t)
+    return Ve(s.shape, n, s.dtype);
+  const r = { x: s }, o = { clipValueMin: n, clipValueMax: t };
+  return d.runKernel(rn, r, o);
 }
-const it = /* @__PURE__ */ p({ clipByValue_: at });
-function ct(n) {
-  return G(
-    n,
+const rt = /* @__PURE__ */ f({ clipByValue_: st });
+function ot(e) {
+  return V(
+    e,
     0
     /* axis */
   );
 }
-const ut = /* @__PURE__ */ p({ concat1d_: ct });
-function lt(n, e) {
-  return G(n, e);
+const at = /* @__PURE__ */ f({ concat1d_: ot });
+function it(e, n) {
+  return V(e, n);
 }
-const ft = /* @__PURE__ */ p({ concat2d_: lt });
-function pt(n, e) {
-  return G(n, e);
+const ct = /* @__PURE__ */ f({ concat2d_: it });
+function ut(e, n) {
+  return V(e, n);
 }
-const ht = /* @__PURE__ */ p({ concat3d_: pt });
-function dt(n, e) {
-  return G(n, e);
+const lt = /* @__PURE__ */ f({ concat3d_: ut });
+function pt(e, n) {
+  return V(e, n);
 }
-const mt = /* @__PURE__ */ p({ concat4d_: dt });
+const ft = /* @__PURE__ */ f({ concat4d_: pt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -141,15 +141,15 @@ const mt = /* @__PURE__ */ p({ concat4d_: dt });
  * limitations under the License.
  * =============================================================================
  */
-function gt(n, e, t) {
-  const s = l(e, "a", "where"), r = l(t, "b", "where"), o = l(n, "condition", "where", "bool"), a = v(v(o.shape, s.shape), r.shape), i = gn(o, a), u = gn(s, a), c = gn(r, a), m = {
+function ht(e, n, t) {
+  const s = l(n, "a", "where"), r = l(t, "b", "where"), o = l(e, "condition", "where", "bool"), a = P(P(o.shape, s.shape), r.shape), i = me(o, a), u = me(s, a), c = me(r, a), m = {
     condition: i,
     t: u,
     e: c
   };
-  return d.runKernel(ue, m);
+  return d.runKernel(on, m);
 }
-const nn = /* @__PURE__ */ p({ where_: gt });
+const ee = /* @__PURE__ */ f({ where_: ht });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -166,11 +166,11 @@ const nn = /* @__PURE__ */ p({ where_: gt });
  * limitations under the License.
  * =============================================================================
  */
-function $t(n, ...e) {
-  const t = e.map((r, o) => l(r, `tensors${o}`, "einsum")), s = { equation: n };
-  return d.runKernel(le, t, s);
+function dt(e, ...n) {
+  const t = n.map((r, o) => l(r, `tensors${o}`, "einsum")), s = { equation: e };
+  return d.runKernel(an, t, s);
 }
-const rn = /* @__PURE__ */ p({ einsum_: $t });
+const re = /* @__PURE__ */ f({ einsum_: dt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -187,11 +187,11 @@ const rn = /* @__PURE__ */ p({ einsum_: $t });
  * limitations under the License.
  * =============================================================================
  */
-function bt(n) {
-  const t = { x: l(n, "x", "elu", "float32") };
-  return d.runKernel(fe, t);
+function mt(e) {
+  const t = { x: l(e, "x", "elu", "float32") };
+  return d.runKernel(cn, t);
 }
-const Yn = /* @__PURE__ */ p({ elu_: bt });
+const ze = /* @__PURE__ */ f({ elu_: mt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -208,13 +208,13 @@ const Yn = /* @__PURE__ */ p({ elu_: bt });
  * limitations under the License.
  * =============================================================================
  */
-function kt(n, e = 0) {
-  const t = l(n, "x", "expandDims", "string_or_numeric");
-  f(e <= t.rank, () => "Axis must be <= rank of the tensor");
-  const s = { input: t }, r = { dim: e };
-  return d.runKernel(pe, s, r);
+function gt(e, n = 0) {
+  const t = l(e, "x", "expandDims", "string_or_numeric");
+  p(n <= t.rank, () => "Axis must be <= rank of the tensor");
+  const s = { input: t }, r = { dim: n };
+  return d.runKernel(un, s, r);
 }
-const W = /* @__PURE__ */ p({ expandDims_: kt });
+const J = /* @__PURE__ */ f({ expandDims_: gt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -231,13 +231,13 @@ const W = /* @__PURE__ */ p({ expandDims_: kt });
  * limitations under the License.
  * =============================================================================
  */
-function xt(n, e) {
-  const t = l(n, "x", "tile", "string_or_numeric");
-  f(t.rank === e.length, () => `Error in transpose: rank of input ${t.rank} must match length of reps ${e}.`);
-  const s = { x: t }, r = { reps: e };
-  return d.runKernel(he, s, r);
+function $t(e, n) {
+  const t = l(e, "x", "tile", "string_or_numeric");
+  p(t.rank === n.length, () => `Error in transpose: rank of input ${t.rank} must match length of reps ${n}.`);
+  const s = { x: t }, r = { reps: n };
+  return d.runKernel(ln, s, r);
 }
-const on = /* @__PURE__ */ p({ tile_: xt });
+const oe = /* @__PURE__ */ f({ tile_: $t });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -254,20 +254,20 @@ const on = /* @__PURE__ */ p({ tile_: xt });
  * limitations under the License.
  * =============================================================================
  */
-function wt(n, e, t, s = "float32") {
-  e == null && (e = n);
-  const r = In([n, e], s), o = n <= e ? n : e;
+function bt(e, n, t, s = "float32") {
+  n == null && (n = e);
+  const r = pn([e, n], s), o = e <= n ? e : n;
   for (let i = 0; i < o; ++i)
     r.set(1, i, i);
-  const a = $(r.toTensor(), [n, e]);
+  const a = $(r.toTensor(), [e, n]);
   if (t == null)
     return a;
   if (t.length === 1)
-    return on(W(a, 0), [t[0], 1, 1]);
+    return oe(J(a, 0), [t[0], 1, 1]);
   if (t.length === 2)
-    return on(W(W(a, 0), 0), [t[0], t[1], 1, 1]);
+    return oe(J(J(a, 0), 0), [t[0], t[1], 1, 1]);
   if (t.length === 3)
-    return on(W(W(W(a, 0), 0), 0), [
+    return oe(J(J(J(a, 0), 0), 0), [
       t[0],
       t[1],
       t[2],
@@ -276,28 +276,7 @@ function wt(n, e, t, s = "float32") {
     ]);
   throw new Error(`eye() currently supports only 1D and 2D batchShapes, but received ${t.length}D.`);
 }
-const yt = /* @__PURE__ */ p({ eye_: wt });
-/**
- * @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 _t(n) {
-  const t = { x: l(n, "x", "floor", "float32") };
-  return d.runKernel(de, t);
-}
-const At = /* @__PURE__ */ p({ floor_: _t });
+const kt = /* @__PURE__ */ f({ eye_: bt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -314,13 +293,13 @@ const At = /* @__PURE__ */ p({ floor_: _t });
  * limitations under the License.
  * =============================================================================
  */
-function It(n, e) {
-  let t = l(n, "a", "greater", "string_or_numeric"), s = l(e, "b", "greater", "string_or_numeric");
-  [t, s] = Y(t, s), v(t.shape, s.shape);
+function xt(e, n) {
+  let t = l(e, "a", "greater", "string_or_numeric"), s = l(n, "b", "greater", "string_or_numeric");
+  [t, s] = Y(t, s), P(t.shape, s.shape);
   const r = { a: t, b: s };
-  return d.runKernel(me, r);
+  return d.runKernel(fn, r);
 }
-const En = /* @__PURE__ */ p({ greater_: It });
+const _e = /* @__PURE__ */ f({ greater_: xt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -337,13 +316,13 @@ const En = /* @__PURE__ */ p({ greater_: It });
  * limitations under the License.
  * =============================================================================
  */
-function Et(n, e) {
-  let t = l(n, "a", "greaterEqual", "string_or_numeric"), s = l(e, "b", "greaterEqual", "string_or_numeric");
-  [t, s] = Y(t, s), v(t.shape, s.shape);
+function wt(e, n) {
+  let t = l(e, "a", "greaterEqual", "string_or_numeric"), s = l(n, "b", "greaterEqual", "string_or_numeric");
+  [t, s] = Y(t, s), P(t.shape, s.shape);
   const r = { a: t, b: s };
-  return d.runKernel(ge, r);
+  return d.runKernel(hn, r);
 }
-const Tt = /* @__PURE__ */ p({ greaterEqual_: Et });
+const At = /* @__PURE__ */ f({ greaterEqual_: wt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -360,11 +339,11 @@ const Tt = /* @__PURE__ */ p({ greaterEqual_: Et });
  * limitations under the License.
  * =============================================================================
  */
-function St(n) {
-  const t = { input: l(n, "input", "imag") };
-  return d.runKernel($e, t);
+function yt(e) {
+  const t = { input: l(e, "input", "imag") };
+  return d.runKernel(dn, t);
 }
-const Nt = /* @__PURE__ */ p({ imag_: St });
+const _t = /* @__PURE__ */ f({ imag_: yt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -381,11 +360,11 @@ const Nt = /* @__PURE__ */ p({ imag_: St });
  * limitations under the License.
  * =============================================================================
  */
-function Dt(n, e = 0.2) {
-  const s = { x: l(n, "x", "leakyRelu") }, r = { alpha: e };
-  return d.runKernel(be, s, r);
+function It(e, n = 0.2) {
+  const s = { x: l(e, "x", "leakyRelu") }, r = { alpha: n };
+  return d.runKernel(mn, s, r);
 }
-const Mt = /* @__PURE__ */ p({ leakyRelu_: Dt });
+const Et = /* @__PURE__ */ f({ leakyRelu_: It });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -402,13 +381,13 @@ const Mt = /* @__PURE__ */ p({ leakyRelu_: Dt });
  * limitations under the License.
  * =============================================================================
  */
-function Ot(n, e) {
-  let t = l(n, "a", "less", "string_or_numeric"), s = l(e, "b", "less", "string_or_numeric");
-  [t, s] = Y(t, s), v(t.shape, s.shape);
+function St(e, n) {
+  let t = l(e, "a", "less", "string_or_numeric"), s = l(n, "b", "less", "string_or_numeric");
+  [t, s] = Y(t, s), P(t.shape, s.shape);
   const r = { a: t, b: s };
-  return d.runKernel(ke, r);
+  return d.runKernel(gn, r);
 }
-const Rn = /* @__PURE__ */ p({ less_: Ot });
+const Ke = /* @__PURE__ */ f({ less_: St });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -425,13 +404,13 @@ const Rn = /* @__PURE__ */ p({ less_: Ot });
  * limitations under the License.
  * =============================================================================
  */
-function Vt(n, e) {
-  let t = l(n, "a", "lessEqual", "string_or_numeric"), s = l(e, "b", "lessEqual", "string_or_numeric");
-  [t, s] = Y(t, s), v(t.shape, s.shape);
+function Tt(e, n) {
+  let t = l(e, "a", "lessEqual", "string_or_numeric"), s = l(n, "b", "lessEqual", "string_or_numeric");
+  [t, s] = Y(t, s), P(t.shape, s.shape);
   const r = { a: t, b: s };
-  return d.runKernel(xe, r);
+  return d.runKernel($n, r);
 }
-const Xn = /* @__PURE__ */ p({ lessEqual_: Vt });
+const We = /* @__PURE__ */ f({ lessEqual_: Tt });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -448,11 +427,11 @@ const Xn = /* @__PURE__ */ p({ lessEqual_: Vt });
  * limitations under the License.
  * =============================================================================
  */
-function vt(n) {
-  const t = { x: l(n, "x", "neg") };
-  return d.runKernel(we, t);
+function Nt(e) {
+  const t = { x: l(e, "x", "neg") };
+  return d.runKernel(bn, t);
 }
-const Tn = /* @__PURE__ */ p({ neg_: vt });
+const Ie = /* @__PURE__ */ f({ neg_: Nt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -469,13 +448,13 @@ const Tn = /* @__PURE__ */ p({ neg_: vt });
  * limitations under the License.
  * =============================================================================
  */
-function Pt(n, e) {
-  const t = l(n, "a", "logicalAnd", "bool"), s = l(e, "b", "logicalAnd", "bool");
-  v(t.shape, s.shape);
+function Dt(e, n) {
+  const t = l(e, "a", "logicalAnd", "bool"), s = l(n, "b", "logicalAnd", "bool");
+  P(t.shape, s.shape);
   const r = { a: t, b: s };
-  return d.runKernel(ye, r);
+  return d.runKernel(kn, r);
 }
-const Bt = /* @__PURE__ */ p({ logicalAnd_: Pt });
+const Mt = /* @__PURE__ */ f({ logicalAnd_: Dt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -492,120 +471,13 @@ const Bt = /* @__PURE__ */ p({ logicalAnd_: Pt });
  * limitations under the License.
  * =============================================================================
  */
-function Rt(n, e) {
-  let t = l(n, "a", "minimum"), s = l(e, "b", "minimum");
-  [t, s] = Y(t, s), t.dtype === "bool" && (t = L(t, "int32"), s = L(s, "int32")), v(t.shape, s.shape);
+function Ot(e, n) {
+  let t = l(e, "a", "minimum"), s = l(n, "b", "minimum");
+  [t, s] = Y(t, s), t.dtype === "bool" && (t = C(t, "int32"), s = C(s, "int32")), P(t.shape, s.shape);
   const r = { a: t, b: s };
-  return d.runKernel(_e, r);
-}
-const Kn = /* @__PURE__ */ p({ minimum_: Rt });
-/**
- * @license
- * Copyright 2020 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 Kt(n, e) {
-  const t = l(n, "x", "prelu"), s = l(e, "alpha", "prelu"), r = { x: t, alpha: s };
-  return d.runKernel(Ae, r);
-}
-const qt = /* @__PURE__ */ p({ prelu_: Kt });
-/**
- * @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.
- * =============================================================================
- */
-class Ft {
-  constructor(e, t, s, r, o) {
-    this.mean = e, this.stdDev = t, this.dtype = s, this.nextVal = NaN, this.truncated = r, this.truncated && (this.upper = this.mean + this.stdDev * 2, this.lower = this.mean - this.stdDev * 2);
-    const a = o || Math.random();
-    this.random = Wn.alea(a.toString());
-  }
-  /** Returns next sample from a Gaussian distribution. */
-  nextValue() {
-    if (!isNaN(this.nextVal)) {
-      const r = this.nextVal;
-      return this.nextVal = NaN, r;
-    }
-    let e, t, s = !1;
-    for (; !s; ) {
-      let r, o, a;
-      do
-        r = 2 * this.random() - 1, o = 2 * this.random() - 1, a = r * r + o * o;
-      while (a >= 1 || a === 0);
-      const i = Math.sqrt(-2 * Math.log(a) / a);
-      e = this.mean + this.stdDev * r * i, t = this.mean + this.stdDev * o * i, (!this.truncated || this.isValidTruncated(e)) && (s = !0);
-    }
-    return (!this.truncated || this.isValidTruncated(t)) && (this.nextVal = this.convertValue(t)), this.convertValue(e);
-  }
-  /** Handles proper rounding for non-floating-point numbers. */
-  convertValue(e) {
-    return this.dtype == null || this.dtype === "float32" ? e : Math.round(e);
-  }
-  /** Returns true if less than 2-standard-deviations from the mean. */
-  isValidTruncated(e) {
-    return e <= this.upper && e >= this.lower;
-  }
-}
-class jt {
-  constructor(e = 0, t = 1, s, r) {
-    if (this.canReturnFloat = () => this.dtype == null || this.dtype === "float32", this.min = e, this.range = t - e, this.dtype = s, r == null && (r = Math.random()), typeof r == "number" && (r = r.toString()), !this.canReturnFloat() && this.range <= 1)
-      throw new Error(`The difference between ${e} - ${t} <= 1 and dtype is not float`);
-    this.random = Wn.alea(r);
-  }
-  convertValue(e) {
-    return this.canReturnFloat() ? e : Math.round(e);
-  }
-  nextValue() {
-    return this.convertValue(this.min + this.range * this.random());
-  }
-}
-/**
- * @license
- * Copyright 2020 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 Gt(n, e = 0, t = 1, s, r) {
-  if (zn(n), s != null && s === "bool")
-    throw new Error(`Unsupported data type ${s}`);
-  const o = new Ft(e, t, s, !1, r), a = In(n, s);
-  for (let i = 0; i < a.values.length; i++)
-    a.values[i] = o.nextValue();
-  return a.toTensor();
+  return d.runKernel(xn, r);
 }
-const Lt = /* @__PURE__ */ p({ randomNormal_: Gt });
+const Re = /* @__PURE__ */ f({ minimum_: Ot });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -622,14 +494,11 @@ const Lt = /* @__PURE__ */ p({ randomNormal_: Gt });
  * limitations under the License.
  * =============================================================================
  */
-function Ct(n, e = 0, t = 1, s = "float32", r) {
-  zn(n);
-  const o = In(n, s), a = new jt(e, t, null, r);
-  for (let i = 0; i < o.values.length; i++)
-    o.values[i] = a.nextValue();
-  return o.toTensor();
+function Bt(e, n) {
+  const t = l(e, "x", "prelu"), s = l(n, "alpha", "prelu"), r = { x: t, alpha: s };
+  return d.runKernel(wn, r);
 }
-const zt = /* @__PURE__ */ p({ randomUniform_: Ct });
+const Pt = /* @__PURE__ */ f({ prelu_: Bt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -646,11 +515,11 @@ const zt = /* @__PURE__ */ p({ randomUniform_: Ct });
  * limitations under the License.
  * =============================================================================
  */
-function Ut(n) {
-  const t = { input: l(n, "input", "real") };
-  return d.runKernel(Ie, t);
+function Kt(e) {
+  const t = { input: l(e, "input", "real") };
+  return d.runKernel(An, t);
 }
-const Jt = /* @__PURE__ */ p({ real_: Ut });
+const Rt = /* @__PURE__ */ f({ real_: Kt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -667,11 +536,11 @@ const Jt = /* @__PURE__ */ p({ real_: Ut });
  * limitations under the License.
  * =============================================================================
  */
-function Wt(n) {
-  const t = { x: l(n, "x", "relu") };
-  return d.runKernel(Ee, t);
+function qt(e) {
+  const t = { x: l(e, "x", "relu") };
+  return d.runKernel(yn, t);
 }
-const Yt = /* @__PURE__ */ p({ relu_: Wt });
+const jt = /* @__PURE__ */ f({ relu_: qt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -688,11 +557,11 @@ const Yt = /* @__PURE__ */ p({ relu_: Wt });
  * limitations under the License.
  * =============================================================================
  */
-function Xt(n) {
-  const t = { x: l(n, "x", "relu6") };
-  return d.runKernel(Te, t);
+function Ft(e) {
+  const t = { x: l(e, "x", "relu6") };
+  return d.runKernel(_n, t);
 }
-const Zt = /* @__PURE__ */ p({ relu6_: Xt });
+const Gt = /* @__PURE__ */ f({ relu6_: Ft });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -709,11 +578,11 @@ const Zt = /* @__PURE__ */ p({ relu6_: Xt });
  * limitations under the License.
  * =============================================================================
  */
-function Ht(n) {
-  const t = { x: l(n, "x", "round") };
-  return d.runKernel(Se, t);
+function Lt(e) {
+  const t = { x: l(e, "x", "round") };
+  return d.runKernel(In, t);
 }
-const Qt = /* @__PURE__ */ p({ round_: Ht });
+const Vt = /* @__PURE__ */ f({ round_: Lt });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -730,11 +599,11 @@ const Qt = /* @__PURE__ */ p({ round_: Ht });
  * limitations under the License.
  * =============================================================================
  */
-function ns(n, e, t) {
-  const s = l(n, "x", "slice1d");
-  return f(s.rank === 1, () => `slice1d expects a rank-1 tensor, but got a rank-${s.rank} tensor`), I(s, [e], [t]);
+function Ct(e, n, t) {
+  const s = l(e, "x", "slice1d");
+  return p(s.rank === 1, () => `slice1d expects a rank-1 tensor, but got a rank-${s.rank} tensor`), _(s, [n], [t]);
 }
-const Sn = /* @__PURE__ */ p({ slice1d_: ns });
+const Ee = /* @__PURE__ */ f({ slice1d_: Ct });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -751,11 +620,11 @@ const Sn = /* @__PURE__ */ p({ slice1d_: ns });
  * limitations under the License.
  * =============================================================================
  */
-function es(n, e, t) {
-  const s = l(n, "x", "slice2d");
-  return f(s.rank === 2, () => `slice2d expects a rank-2 tensor, but got a rank-${s.rank} tensor`), I(s, e, t);
+function vt(e, n, t) {
+  const s = l(e, "x", "slice2d");
+  return p(s.rank === 2, () => `slice2d expects a rank-2 tensor, but got a rank-${s.rank} tensor`), _(s, n, t);
 }
-const Zn = /* @__PURE__ */ p({ slice2d_: es });
+const Je = /* @__PURE__ */ f({ slice2d_: vt });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -772,11 +641,11 @@ const Zn = /* @__PURE__ */ p({ slice2d_: es });
  * limitations under the License.
  * =============================================================================
  */
-function ts(n, e, t) {
-  const s = l(n, "x", "slice3d");
-  return f(s.rank === 3, () => `slice3d expects a rank-3 tensor, but got a rank-${s.rank} tensor`), I(s, e, t);
+function zt(e, n, t) {
+  const s = l(e, "x", "slice3d");
+  return p(s.rank === 3, () => `slice3d expects a rank-3 tensor, but got a rank-${s.rank} tensor`), _(s, n, t);
 }
-const Nn = /* @__PURE__ */ p({ slice3d_: ts });
+const Se = /* @__PURE__ */ f({ slice3d_: zt });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -793,11 +662,11 @@ const Nn = /* @__PURE__ */ p({ slice3d_: ts });
  * limitations under the License.
  * =============================================================================
  */
-function ss(n, e, t) {
-  const s = l(n, "x", "slice4d");
-  return f(s.rank === 4, () => `slice4d expects a rank-4 tensor, but got a rank-${s.rank} tensor`), I(s, e, t);
+function Wt(e, n, t) {
+  const s = l(e, "x", "slice4d");
+  return p(s.rank === 4, () => `slice4d expects a rank-4 tensor, but got a rank-${s.rank} tensor`), _(s, n, t);
 }
-const pn = /* @__PURE__ */ p({ slice4d_: ss });
+const pe = /* @__PURE__ */ f({ slice4d_: Wt });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -814,11 +683,11 @@ const pn = /* @__PURE__ */ p({ slice4d_: ss });
  * limitations under the License.
  * =============================================================================
  */
-function rs(n, e) {
-  const t = l(n, "x", "squeeze", "string_or_numeric");
-  return $(t, Ne(t.shape, e).newShape);
+function Jt(e, n) {
+  const t = l(e, "x", "squeeze", "string_or_numeric");
+  return $(t, En(t.shape, n).newShape);
 }
-const os = /* @__PURE__ */ p({ squeeze_: rs });
+const Yt = /* @__PURE__ */ f({ squeeze_: Jt });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -835,11 +704,11 @@ const os = /* @__PURE__ */ p({ squeeze_: rs });
  * limitations under the License.
  * =============================================================================
  */
-function as(n, e = 0) {
-  const s = { x: l(n, "x", "step") }, r = { alpha: e };
-  return d.runKernel(De, s, r);
+function Ut(e, n = 0) {
+  const s = { x: l(e, "x", "step") }, r = { alpha: n };
+  return d.runKernel(Sn, s, r);
 }
-const is = /* @__PURE__ */ p({ step_: as });
+const Xt = /* @__PURE__ */ f({ step_: Ut });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -856,12 +725,12 @@ const is = /* @__PURE__ */ p({ step_: as });
  * limitations under the License.
  * =============================================================================
  */
-function V(n, e) {
-  Me(n);
-  const t = Oe(n, e);
+function B(e, n) {
+  Tn(e);
+  const t = Nn(e, n);
   if (t.length !== 1)
     throw new Error("tensor1d() requires values to be a flat/TypedArray");
-  return Ve(n, null, t, e);
+  return Dn(e, null, t, n);
 }
 /**
  * @license
@@ -879,13 +748,13 @@ function V(n, e) {
  * limitations under the License.
  * =============================================================================
  */
-function cs(n, e = 0) {
-  const t = l(n, "x", "unstack", "string_or_numeric");
-  f(e >= -t.shape.length && e < t.shape.length, () => `Axis = ${e} is not in [-${t.shape.length}, ${t.shape.length})`);
-  const s = { value: t }, r = { axis: e };
-  return d.runKernel(ve, s, r);
+function Zt(e, n = 0) {
+  const t = l(e, "x", "unstack", "string_or_numeric");
+  p(n >= -t.shape.length && n < t.shape.length, () => `Axis = ${n} is not in [-${t.shape.length}, ${t.shape.length})`);
+  const s = { value: t }, r = { axis: n };
+  return d.runKernel(Mn, s, r);
 }
-const Hn = /* @__PURE__ */ p({ unstack_: cs });
+const Ye = /* @__PURE__ */ f({ unstack_: Zt });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -902,19 +771,19 @@ const Hn = /* @__PURE__ */ p({ unstack_: cs });
  * limitations under the License.
  * =============================================================================
  */
-function us(n, e, t) {
-  const s = l(n, "x", "transpose");
-  if (e == null && (e = s.shape.map((a, i) => i).reverse()), f(s.rank === e.length, () => `Error in transpose: rank of input ${s.rank} must match length of perm ${e}.`), e.forEach((a) => {
-    f(a >= 0 && a < s.rank, () => `All entries in 'perm' must be between 0 and ${s.rank - 1} but got ${e}`);
+function Ht(e, n, t) {
+  const s = l(e, "x", "transpose");
+  if (n == null && (n = s.shape.map((a, i) => i).reverse()), p(s.rank === n.length, () => `Error in transpose: rank of input ${s.rank} must match length of perm ${n}.`), n.forEach((a) => {
+    p(a >= 0 && a < s.rank, () => `All entries in 'perm' must be between 0 and ${s.rank - 1} but got ${n}`);
   }), s.rank <= 1)
     return s.clone();
-  const r = { x: s }, o = { perm: e };
-  return s.dtype === "complex64" ? P(() => {
-    let a = Jt(s), i = Nt(s);
-    return a = d.runKernel(dn, { x: a }, o), i = d.runKernel(dn, { x: i }, o), t && (i = Tn(i)), He(a, i);
-  }) : d.runKernel(dn, r, o);
+  const r = { x: s }, o = { perm: n };
+  return s.dtype === "complex64" ? K(() => {
+    let a = Rt(s), i = _t(s);
+    return a = d.runKernel(he, { x: a }, o), i = d.runKernel(he, { x: i }, o), t && (i = Ie(i)), Jn(a, i);
+  }) : d.runKernel(he, r, o);
 }
-const wn = /* @__PURE__ */ p({ transpose_: us });
+const xe = /* @__PURE__ */ f({ transpose_: Ht });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -931,89 +800,36 @@ const wn = /* @__PURE__ */ p({ transpose_: us });
  * limitations under the License.
  * =============================================================================
  */
-function ls(n, e) {
-  if (e == null)
-    return n.shape.slice();
-  if (Pe(n.shape, e))
-    return e;
-  if (n.shape.length === e.length) {
-    const t = [];
-    for (let s = 0; s < n.shape.length; s++)
-      e[s] == null && n.shape[s] != null ? t.push(n.shape[s]) : t.push(e[s]);
-    return t;
-  }
-  return e;
-}
-/**
- * @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 fs(n, e, t, s) {
-  const r = l(n, "x", "dropout");
-  if (f(r.dtype === "float32", () => `x has to be a floating point tensor since it's going to be scaled, but got a ${r.dtype} tensor instead.`), f(e >= 0 && e < 1, () => `rate must be a float in the range [0, 1), but got ${e}.`), e === 0)
-    return n instanceof Be ? r.clone() : r;
-  const o = ls(r, t), a = 1 - e, i = K(At(C(zt(o, 0, 1, "float32", s), a)), a);
-  return A(r, i);
-}
-const ps = /* @__PURE__ */ p({ dropout_: fs });
-/**
- * @license
- * Copyright 2019 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 hs(n, e, t) {
+function Qt(e, n, t) {
   if (t == null || t === "linear")
-    return n;
+    return e;
   if (t === "relu")
-    return A(n, is(e));
+    return I(e, Xt(n));
   throw new Error(`Cannot compute gradient for fused activation ${t}.`);
 }
-function ds(n, e) {
-  let t = e;
-  const s = Re(n.shape, e.shape);
-  return s.length > 0 && (t = j(t, s)), $(t, n.shape);
+function es(e, n) {
+  let t = n;
+  const s = On(e.shape, n.shape);
+  return s.length > 0 && (t = G(t, s)), $(t, e.shape);
 }
-function ms(n, e, t, s) {
-  if (e === "linear")
-    return n;
-  if (e === "relu")
-    return Yt(n);
-  if (e === "elu")
-    return Yn(n);
-  if (e === "relu6")
-    return Zt(n);
-  if (e === "prelu")
-    return qt(n, t);
-  if (e === "leakyrelu")
-    return Mt(n, s);
-  if (e === "sigmoid")
-    return tt(n);
-  throw new Error(`Unknown fused activation ${e}.`);
-}
-const gs = (n, e) => !(n > 0) || e === "linear";
+function ns(e, n, t, s) {
+  if (n === "linear")
+    return e;
+  if (n === "relu")
+    return jt(e);
+  if (n === "elu")
+    return ze(e);
+  if (n === "relu6")
+    return Gt(e);
+  if (n === "prelu")
+    return Pt(e, t);
+  if (n === "leakyrelu")
+    return Et(e, s);
+  if (n === "sigmoid")
+    return Qn(e);
+  throw new Error(`Unknown fused activation ${n}.`);
+}
+const ts = (e, n) => !(e > 0) || n === "linear";
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -1030,49 +846,49 @@ const gs = (n, e) => !(n > 0) || e === "linear";
  * limitations under the License.
  * =============================================================================
  */
-function $s({ a: n, b: e, transposeA: t = !1, transposeB: s = !1, bias: r, activation: o = "linear", preluActivationWeights: a, leakyreluAlpha: i = 0.2 }) {
-  if (gs(d.state.gradientDepth, o) === !1) {
-    let U = _(n, e, t, s);
-    return r != null && (U = C(U, r)), ms(U, o, a, i);
+function ss({ a: e, b: n, transposeA: t = !1, transposeB: s = !1, bias: r, activation: o = "linear", preluActivationWeights: a, leakyreluAlpha: i = 0.2 }) {
+  if (ts(d.state.gradientDepth, o) === !1) {
+    let z = y(e, n, t, s);
+    return r != null && (z = U(z, r)), ns(z, o, a, i);
   }
-  let u = l(n, "a", "fused matMul"), c = l(e, "b", "fused matMul");
+  let u = l(e, "a", "fused matMul"), c = l(n, "b", "fused matMul");
   [u, c] = Y(u, c);
-  const m = t ? u.shape[u.rank - 2] : u.shape[u.rank - 1], h = s ? c.shape[c.rank - 1] : c.shape[c.rank - 2], b = t ? u.shape[u.rank - 1] : u.shape[u.rank - 2], g = s ? c.shape[c.rank - 2] : c.shape[c.rank - 1], x = u.shape.slice(0, -2), w = c.shape.slice(0, -2), k = Vn(x), E = Vn(w);
-  f(m === h, () => `Error in fused matMul: inner shapes (${m}) and (${h}) of Tensors with shapes ${u.shape} and ${c.shape} and transposeA=${t} and transposeB=${s} must match.`);
-  const S = v(u.shape.slice(0, -2), c.shape.slice(0, -2)).concat([b, g]), M = t ? $(u, [k, m, b]) : $(u, [k, b, m]), O = s ? $(c, [E, g, h]) : $(c, [E, h, g]);
+  const m = t ? u.shape[u.rank - 2] : u.shape[u.rank - 1], h = s ? c.shape[c.rank - 1] : c.shape[c.rank - 2], b = t ? u.shape[u.rank - 1] : u.shape[u.rank - 2], g = s ? c.shape[c.rank - 2] : c.shape[c.rank - 1], x = u.shape.slice(0, -2), w = c.shape.slice(0, -2), k = Me(x), E = Me(w);
+  p(m === h, () => `Error in fused matMul: inner shapes (${m}) and (${h}) of Tensors with shapes ${u.shape} and ${c.shape} and transposeA=${t} and transposeB=${s} must match.`);
+  const T = P(u.shape.slice(0, -2), c.shape.slice(0, -2)).concat([b, g]), M = t ? $(u, [k, m, b]) : $(u, [k, b, m]), O = s ? $(c, [E, g, h]) : $(c, [E, h, g]);
   let N;
-  r != null && (N = l(r, "bias", "fused matMul"), [N] = Y(N, u), v(S, N.shape));
-  let tn;
-  a != null && (tn = l(a, "prelu weights", "fused matMul"));
-  const z = (U, sn) => {
-    const [q, F, J, un] = sn, B = hs($(U, J.shape), J, o);
+  r != null && (N = l(r, "bias", "fused matMul"), [N] = Y(N, u), P(T, N.shape));
+  let te;
+  a != null && (te = l(a, "prelu weights", "fused matMul"));
+  const v = (z, se) => {
+    const [j, F, W, ce] = se, R = Qt($(z, W.shape), W, o);
     let Z, H;
-    if (!t && !s ? (Z = _(B, F, !1, !0), H = _(q, B, !0, !1)) : !t && s ? (Z = _(B, F, !1, !1), H = _(B, q, !0, !1)) : t && !s ? (Z = _(F, B, !1, !0), H = _(q, B, !1, !1)) : (Z = _(F, B, !0, !0), H = _(B, q, !0, !0)), r != null) {
-      const re = ds(un, B);
-      return [Z, H, re];
+    if (!t && !s ? (Z = y(R, F, !1, !0), H = y(j, R, !0, !1)) : !t && s ? (Z = y(R, F, !1, !1), H = y(R, j, !0, !1)) : t && !s ? (Z = y(F, R, !1, !0), H = y(j, R, !1, !1)) : (Z = y(F, R, !0, !0), H = y(R, j, !0, !0)), r != null) {
+      const en = es(ce, R);
+      return [Z, H, en];
     } else
       return [Z, H];
   }, X = {
     a: M,
     b: O,
     bias: N,
-    preluActivationWeights: tn
-  }, On = { transposeA: t, transposeB: s, activation: o, leakyreluAlpha: i };
-  return r == null ? vn((sn, q, F) => {
-    const J = (
+    preluActivationWeights: te
+  }, De = { transposeA: t, transposeB: s, activation: o, leakyreluAlpha: i };
+  return r == null ? Oe((se, j, F) => {
+    const W = (
       // tslint:disable-next-line: no-unnecessary-type-assertion
-      d.runKernel(Pn, X, On)
+      d.runKernel(Be, X, De)
     );
-    return F([sn, q, J]), { value: $(J, S), gradFunc: z };
-  })(M, O) : vn((sn, q, F, J) => {
-    const un = (
+    return F([se, j, W]), { value: $(W, T), gradFunc: v };
+  })(M, O) : Oe((se, j, F, W) => {
+    const ce = (
       // tslint:disable-next-line: no-unnecessary-type-assertion
-      d.runKernel(Pn, X, On)
+      d.runKernel(Be, X, De)
     );
-    return J([sn, q, un, F]), { value: $(un, S), gradFunc: z };
+    return W([se, j, ce, F]), { value: $(ce, T), gradFunc: v };
   })(M, O, N);
 }
-const qn = /* @__PURE__ */ p({ fusedMatMul_: $s });
+const qe = /* @__PURE__ */ f({ fusedMatMul_: ss });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1089,13 +905,13 @@ const qn = /* @__PURE__ */ p({ fusedMatMul_: $s });
  * limitations under the License.
  * =============================================================================
  */
-function bs(n, e, t, s, r = "bilinear", o = 0) {
-  const a = l(n, "image", "cropAndResize"), i = l(e, "boxes", "cropAndResize", "float32"), u = l(t, "boxInd", "cropAndResize", "int32"), c = i.shape[0];
-  f(a.rank === 4, () => `Error in cropAndResize: image must be rank 4,but got rank ${a.rank}.`), f(i.rank === 2 && i.shape[1] === 4, () => `Error in cropAndResize: boxes must be have size [${c},4] but had shape ${i.shape}.`), f(u.rank === 1 && u.shape[0] === c, () => `Error in cropAndResize: boxInd must be have size [${c}] but had shape ${i.shape}.`), f(s.length === 2, () => `Error in cropAndResize: cropSize must be of length 2, but got length ${s.length}.`), f(s[0] >= 1 && s[1] >= 1, () => `cropSize must be atleast [1,1], but was ${s}`), f(r === "bilinear" || r === "nearest", () => `method must be bilinear or nearest, but was ${r}`);
+function rs(e, n, t, s, r = "bilinear", o = 0) {
+  const a = l(e, "image", "cropAndResize"), i = l(n, "boxes", "cropAndResize", "float32"), u = l(t, "boxInd", "cropAndResize", "int32"), c = i.shape[0];
+  p(a.rank === 4, () => `Error in cropAndResize: image must be rank 4,but got rank ${a.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(s.length === 2, () => `Error in cropAndResize: cropSize must be of length 2, but got length ${s.length}.`), p(s[0] >= 1 && s[1] >= 1, () => `cropSize must be atleast [1,1], but was ${s}`), p(r === "bilinear" || r === "nearest", () => `method must be bilinear or nearest, but was ${r}`);
   const m = { image: a, boxes: i, boxInd: u }, h = { method: r, extrapolationValue: o, cropSize: s };
-  return d.runKernel(Ke, m, h);
+  return d.runKernel(Bn, m, h);
 }
-const ks = /* @__PURE__ */ p({ cropAndResize_: bs });
+const os = /* @__PURE__ */ f({ cropAndResize_: rs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1112,13 +928,13 @@ const ks = /* @__PURE__ */ p({ cropAndResize_: bs });
  * limitations under the License.
  * =============================================================================
  */
-function xs(n) {
-  const e = l(n, "image", "flipLeftRight", "float32");
-  f(e.rank === 4, () => `Error in flipLeftRight: image must be rank 4,but got rank ${e.rank}.`);
-  const t = { image: e };
-  return d.runKernel(qe, t, {});
+function as(e) {
+  const n = l(e, "image", "flipLeftRight", "float32");
+  p(n.rank === 4, () => `Error in flipLeftRight: image must be rank 4,but got rank ${n.rank}.`);
+  const t = { image: n };
+  return d.runKernel(Pn, t, {});
 }
-const ws = /* @__PURE__ */ p({ flipLeftRight_: xs });
+const is = /* @__PURE__ */ f({ flipLeftRight_: as });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -1135,13 +951,13 @@ const ws = /* @__PURE__ */ p({ flipLeftRight_: xs });
  * limitations under the License.
  * =============================================================================
  */
-function ys(n) {
-  const e = l(n, "image", "grayscaleToRGB"), t = e.rank - 1, s = e.shape[t];
-  f(e.rank >= 2, () => `Error in grayscaleToRGB: images must be at least rank 2, but got rank ${e.rank}.`), f(s === 1, () => `Error in grayscaleToRGB: last dimension of a grayscale image should be size 1, but got size ${s}.`);
-  const r = new Array(e.rank);
-  return r.fill(1, 0, t), r[t] = 3, on(e, r);
+function cs(e) {
+  const n = l(e, "image", "grayscaleToRGB"), t = n.rank - 1, s = n.shape[t];
+  p(n.rank >= 2, () => `Error in grayscaleToRGB: images must be at least rank 2, but got rank ${n.rank}.`), p(s === 1, () => `Error in grayscaleToRGB: last dimension of a grayscale image should be size 1, but got size ${s}.`);
+  const r = new Array(n.rank);
+  return r.fill(1, 0, t), r[t] = 3, oe(n, r);
 }
-const _s = /* @__PURE__ */ p({ grayscaleToRGB_: ys });
+const us = /* @__PURE__ */ f({ grayscaleToRGB_: cs });
 /**
  * @license
  * Copyright 2023 Google LLC.
@@ -1158,33 +974,33 @@ const _s = /* @__PURE__ */ p({ grayscaleToRGB_: ys });
  * limitations under the License.
  * =============================================================================
  */
-function As(n) {
-  const e = l(n, "image", "RGBToGrayscale"), t = e.rank - 1, s = e.shape[t];
-  f(e.rank >= 2, () => `Error in RGBToGrayscale: images must be at least rank 2, but got rank ${e.rank}.`), f(s === 3, () => `Error in RGBToGrayscale: last dimension of an RGB image should be size 3, but got size ${s}.`);
-  const r = e.dtype, o = L(e, "float32"), a = V([0.2989, 0.587, 0.114]);
+function ls(e) {
+  const n = l(e, "image", "RGBToGrayscale"), t = n.rank - 1, s = n.shape[t];
+  p(n.rank >= 2, () => `Error in RGBToGrayscale: images must be at least rank 2, but got rank ${n.rank}.`), p(s === 3, () => `Error in RGBToGrayscale: last dimension of an RGB image should be size 3, but got size ${s}.`);
+  const r = n.dtype, o = C(n, "float32"), a = B([0.2989, 0.587, 0.114]);
   let i;
-  switch (e.rank) {
+  switch (n.rank) {
     case 2:
-      i = rn("ij,j->i", o, a);
+      i = re("ij,j->i", o, a);
       break;
     case 3:
-      i = rn("ijk,k->ij", o, a);
+      i = re("ijk,k->ij", o, a);
       break;
     case 4:
-      i = rn("ijkl,l->ijk", o, a);
+      i = re("ijkl,l->ijk", o, a);
       break;
     case 5:
-      i = rn("ijklm,m->ijkl", o, a);
+      i = re("ijklm,m->ijkl", o, a);
       break;
     case 6:
-      i = rn("ijklmn,n->ijklm", o, a);
+      i = re("ijklmn,n->ijklm", o, a);
       break;
     default:
       throw new Error("Not a valid tensor rank.");
   }
-  return i = W(i, -1), L(i, r);
+  return i = J(i, -1), C(i, r);
 }
-const Is = /* @__PURE__ */ p({ rgbToGrayscale_: As });
+const ps = /* @__PURE__ */ f({ rgbToGrayscale_: ls });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1201,13 +1017,13 @@ const Is = /* @__PURE__ */ p({ rgbToGrayscale_: As });
  * limitations under the License.
  * =============================================================================
  */
-function Es(n, e, t = 0, s = 0.5) {
-  const r = l(n, "image", "rotateWithOffset", "float32");
-  f(r.rank === 4, () => `Error in rotateWithOffset: image must be rank 4,but got rank ${r.rank}.`);
-  const o = { image: r }, a = { radians: e, fillValue: t, center: s };
-  return d.runKernel(Fe, o, a);
+function fs(e, n, t = 0, s = 0.5) {
+  const r = l(e, "image", "rotateWithOffset", "float32");
+  p(r.rank === 4, () => `Error in rotateWithOffset: image must be rank 4,but got rank ${r.rank}.`);
+  const o = { image: r }, a = { radians: n, fillValue: t, center: s };
+  return d.runKernel(Kn, o, a);
 }
-const Ts = /* @__PURE__ */ p({ rotateWithOffset_: Es });
+const hs = /* @__PURE__ */ f({ rotateWithOffset_: fs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1224,10 +1040,10 @@ const Ts = /* @__PURE__ */ p({ rotateWithOffset_: Es });
  * limitations under the License.
  * =============================================================================
  */
-function en(n, e, t, s, r, o) {
+function ne(e, n, t, s, r, o) {
   s == null && (s = 0.5), r == null && (r = Number.NEGATIVE_INFINITY), o == null && (o = 0);
-  const a = n.shape[0];
-  return t = Math.min(t, a), f(0 <= s && s <= 1, () => `iouThreshold must be in [0, 1], but was '${s}'`), f(n.rank === 2, () => `boxes must be a 2D tensor, but was of rank '${n.rank}'`), f(n.shape[1] === 4, () => `boxes must have 4 columns, but 2nd dimension was ${n.shape[1]}`), f(e.rank === 1, () => "scores must be a 1D tensor"), f(e.shape[0] === a, () => `scores has incompatible shape with boxes. Expected ${a}, but was ${e.shape[0]}`), f(0 <= o && o <= 1, () => `softNmsSigma must be in [0, 1], but was '${o}'`), { maxOutputSize: t, iouThreshold: s, scoreThreshold: r, softNmsSigma: o };
+  const a = e.shape[0];
+  return t = Math.min(t, a), p(0 <= s && s <= 1, () => `iouThreshold must be in [0, 1], but was '${s}'`), p(e.rank === 2, () => `boxes must be a 2D tensor, but was of rank '${e.rank}'`), p(e.shape[1] === 4, () => `boxes must have 4 columns, but 2nd dimension was ${e.shape[1]}`), p(n.rank === 1, () => "scores must be a 1D tensor"), p(n.shape[0] === a, () => `scores has incompatible shape with boxes. Expected ${a}, but was ${n.shape[0]}`), p(0 <= o && o <= 1, () => `softNmsSigma must be in [0, 1], but was '${o}'`), { maxOutputSize: t, iouThreshold: s, scoreThreshold: r, softNmsSigma: o };
 }
 /**
  * @license
@@ -1245,13 +1061,13 @@ function en(n, e, t, s, r, o) {
  * limitations under the License.
  * =============================================================================
  */
-function Ss(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY) {
-  const o = l(n, "boxes", "nonMaxSuppression", "float32"), a = l(e, "scores", "nonMaxSuppression", "float32"), i = en(o, a, t, s, r);
+function ds(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY) {
+  const o = l(e, "boxes", "nonMaxSuppression", "float32"), a = l(n, "scores", "nonMaxSuppression", "float32"), i = ne(o, a, t, s, r);
   t = i.maxOutputSize, s = i.iouThreshold, r = i.scoreThreshold;
   const u = { maxOutputSize: t, iouThreshold: s, scoreThreshold: r };
-  return d.runKernel(je, { boxes: o, scores: a }, u);
+  return d.runKernel(Rn, { boxes: o, scores: a }, u);
 }
-const Ns = /* @__PURE__ */ p({ nonMaxSuppression_: Ss });
+const ms = /* @__PURE__ */ f({ nonMaxSuppression_: ds });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -1268,21 +1084,21 @@ const Ns = /* @__PURE__ */ p({ nonMaxSuppression_: Ss });
  * limitations under the License.
  * =============================================================================
  */
-function Ds(n, e, t) {
-  const s = Ms(n, e, t), r = s < 0 ? -(s + 1) : s;
-  n.splice(r, 0, e);
+function gs(e, n, t) {
+  const s = $s(e, n, t), r = s < 0 ? -(s + 1) : s;
+  e.splice(r, 0, n);
 }
-function Ms(n, e, t) {
-  return Vs(n, e, t || Os);
+function $s(e, n, t) {
+  return ks(e, n, t || bs);
 }
-function Os(n, e) {
-  return n > e ? 1 : n < e ? -1 : 0;
+function bs(e, n) {
+  return e > n ? 1 : e < n ? -1 : 0;
 }
-function Vs(n, e, t) {
-  let s = 0, r = n.length, o = 0, a = !1;
+function ks(e, n, t) {
+  let s = 0, r = e.length, o = 0, a = !1;
   for (; s < r; ) {
     o = s + (r - s >>> 1);
-    const i = t(e, n[o]);
+    const i = t(n, e[o]);
     i > 0 ? s = o + 1 : (r = o, a = !i);
   }
   return a ? s : -s - 1;
@@ -1303,10 +1119,10 @@ function Vs(n, e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function vs(n, e, t, s, r) {
-  return Dn(
-    n,
+function xs(e, n, t, s, r) {
+  return Te(
     e,
+    n,
     t,
     s,
     r,
@@ -1314,10 +1130,10 @@ function vs(n, e, t, s, r) {
     /* softNmsSigma */
   );
 }
-function Ps(n, e, t, s, r, o) {
-  return Dn(
-    n,
+function ws(e, n, t, s, r, o) {
+  return Te(
     e,
+    n,
     t,
     s,
     r,
@@ -1328,10 +1144,10 @@ function Ps(n, e, t, s, r, o) {
     /* returnValidOutputs */
   );
 }
-function Bs(n, e, t, s, r, o) {
-  return Dn(
-    n,
+function As(e, n, t, s, r, o) {
+  return Te(
     e,
+    n,
     t,
     s,
     r,
@@ -1340,46 +1156,46 @@ function Bs(n, e, t, s, r, o) {
     /* returnScoresTensor */
   );
 }
-function Dn(n, e, t, s, r, o, a = !1, i = !1, u = !1) {
+function Te(e, n, t, s, r, o, a = !1, i = !1, u = !1) {
   const c = [];
-  for (let k = 0; k < e.length; k++)
-    e[k] > r && c.push({ score: e[k], boxIndex: k, suppressBeginIndex: 0 });
-  c.sort(Fn);
+  for (let k = 0; k < n.length; k++)
+    n[k] > r && c.push({ score: n[k], boxIndex: k, suppressBeginIndex: 0 });
+  c.sort(je);
   const m = o > 0 ? -0.5 / o : 0, h = [], b = [];
   for (; h.length < t && c.length > 0; ) {
-    const k = c.pop(), { score: E, boxIndex: T, suppressBeginIndex: S } = k;
+    const k = c.pop(), { score: E, boxIndex: S, suppressBeginIndex: T } = k;
     if (E < r)
       break;
     let M = !1;
-    for (let O = h.length - 1; O >= S; --O) {
-      const N = Rs(n, T, h[O]);
+    for (let O = h.length - 1; O >= T; --O) {
+      const N = ys(e, S, h[O]);
       if (N >= s) {
         M = !0;
         break;
       }
-      if (k.score = k.score * Ks(s, m, N), k.score <= r)
+      if (k.score = k.score * _s(s, m, N), k.score <= r)
         break;
     }
-    k.suppressBeginIndex = h.length, M || (k.score === E ? (h.push(T), b.push(k.score)) : k.score > r && Ds(c, k, Fn));
+    k.suppressBeginIndex = h.length, M || (k.score === E ? (h.push(S), b.push(k.score)) : k.score > r && gs(c, k, je));
   }
   const g = h.length, x = t - g;
   i && x > 0 && (h.push(...new Array(x).fill(0)), b.push(...new Array(x).fill(0)));
   const w = { selectedIndices: h };
   return a && (w.selectedScores = b), u && (w.validOutputs = g), w;
 }
-function Rs(n, e, t) {
-  const s = n.subarray(e * 4, e * 4 + 4), r = n.subarray(t * 4, t * 4 + 4), o = Math.min(s[0], s[2]), a = Math.min(s[1], s[3]), i = Math.max(s[0], s[2]), u = Math.max(s[1], s[3]), c = Math.min(r[0], r[2]), m = Math.min(r[1], r[3]), h = Math.max(r[0], r[2]), b = Math.max(r[1], r[3]), g = (i - o) * (u - a), x = (h - c) * (b - m);
+function ys(e, n, t) {
+  const s = e.subarray(n * 4, n * 4 + 4), r = e.subarray(t * 4, t * 4 + 4), o = Math.min(s[0], s[2]), a = Math.min(s[1], s[3]), i = Math.max(s[0], s[2]), u = Math.max(s[1], s[3]), c = Math.min(r[0], r[2]), m = Math.min(r[1], r[3]), h = Math.max(r[0], r[2]), b = Math.max(r[1], r[3]), g = (i - o) * (u - a), x = (h - c) * (b - m);
   if (g <= 0 || x <= 0)
     return 0;
-  const w = Math.max(o, c), k = Math.max(a, m), E = Math.min(i, h), T = Math.min(u, b), S = Math.max(E - w, 0) * Math.max(T - k, 0);
-  return S / (g + x - S);
+  const w = Math.max(o, c), k = Math.max(a, m), E = Math.min(i, h), S = Math.min(u, b), T = Math.max(E - w, 0) * Math.max(S - k, 0);
+  return T / (g + x - T);
 }
-function Ks(n, e, t) {
-  const s = Math.exp(e * t * t);
-  return t <= n ? s : 0;
+function _s(e, n, t) {
+  const s = Math.exp(n * t * t);
+  return t <= e ? s : 0;
 }
-function Fn(n, e) {
-  return n.score - e.score || n.score === e.score && e.boxIndex - n.boxIndex;
+function je(e, n) {
+  return e.score - n.score || e.score === n.score && n.boxIndex - e.boxIndex;
 }
 /**
  * @license
@@ -1397,13 +1213,13 @@ function Fn(n, e) {
  * limitations under the License.
  * =============================================================================
  */
-async function qs(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY) {
-  const o = l(n, "boxes", "nonMaxSuppressionAsync"), a = l(e, "scores", "nonMaxSuppressionAsync"), i = en(o, a, t, s, r);
+async function Is(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY) {
+  const o = l(e, "boxes", "nonMaxSuppressionAsync"), a = l(n, "scores", "nonMaxSuppressionAsync"), i = ne(o, a, t, s, r);
   t = i.maxOutputSize, s = i.iouThreshold, r = i.scoreThreshold;
-  const u = await Promise.all([o.data(), a.data()]), c = u[0], m = u[1], { selectedIndices: h } = vs(c, m, t, s, r);
-  return o !== n && o.dispose(), a !== e && a.dispose(), V(h, "int32");
+  const u = await Promise.all([o.data(), a.data()]), c = u[0], m = u[1], { selectedIndices: h } = xs(c, m, t, s, r);
+  return o !== e && o.dispose(), a !== n && a.dispose(), B(h, "int32");
 }
-const Fs = qs;
+const Es = Is;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1420,13 +1236,13 @@ const Fs = qs;
  * limitations under the License.
  * =============================================================================
  */
-function js(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
-  const a = l(n, "boxes", "nonMaxSuppression"), i = l(e, "scores", "nonMaxSuppression"), u = en(a, i, t, s, r, o);
+function Ss(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
+  const a = l(e, "boxes", "nonMaxSuppression"), i = l(n, "scores", "nonMaxSuppression"), u = ne(a, i, t, s, r, o);
   t = u.maxOutputSize, s = u.iouThreshold, r = u.scoreThreshold, o = u.softNmsSigma;
-  const c = { boxes: a, scores: i }, m = { maxOutputSize: t, iouThreshold: s, scoreThreshold: r, softNmsSigma: o }, h = d.runKernel(Ge, c, m);
+  const c = { boxes: a, scores: i }, m = { maxOutputSize: t, iouThreshold: s, scoreThreshold: r, softNmsSigma: o }, h = d.runKernel(qn, c, m);
   return { selectedIndices: h[0], selectedScores: h[1] };
 }
-const Gs = /* @__PURE__ */ p({ nonMaxSuppressionWithScore_: js });
+const Ts = /* @__PURE__ */ f({ nonMaxSuppressionWithScore_: Ss });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1443,16 +1259,16 @@ const Gs = /* @__PURE__ */ p({ nonMaxSuppressionWithScore_: js });
  * limitations under the License.
  * =============================================================================
  */
-async function Ls(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
-  const a = l(n, "boxes", "nonMaxSuppressionAsync"), i = l(e, "scores", "nonMaxSuppressionAsync"), u = en(a, i, t, s, r, o);
+async function Ns(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
+  const a = l(e, "boxes", "nonMaxSuppressionAsync"), i = l(n, "scores", "nonMaxSuppressionAsync"), u = ne(a, i, t, s, r, o);
   t = u.maxOutputSize, s = u.iouThreshold, r = u.scoreThreshold, o = u.softNmsSigma;
-  const c = await Promise.all([a.data(), i.data()]), m = c[0], h = c[1], { selectedIndices: b, selectedScores: g } = Bs(m, h, t, s, r, o);
-  return a !== n && a.dispose(), i !== e && i.dispose(), {
-    selectedIndices: V(b, "int32"),
-    selectedScores: V(g)
+  const c = await Promise.all([a.data(), i.data()]), m = c[0], h = c[1], { selectedIndices: b, selectedScores: g } = As(m, h, t, s, r, o);
+  return a !== e && a.dispose(), i !== n && i.dispose(), {
+    selectedIndices: B(b, "int32"),
+    selectedScores: B(g)
   };
 }
-const Cs = Ls;
+const Ds = Ns;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1469,8 +1285,8 @@ const Cs = Ls;
  * limitations under the License.
  * =============================================================================
  */
-function zs(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
-  const a = l(n, "boxes", "nonMaxSuppression"), i = l(e, "scores", "nonMaxSuppression"), u = en(
+function Ms(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
+  const a = l(e, "boxes", "nonMaxSuppression"), i = l(n, "scores", "nonMaxSuppression"), u = ne(
     a,
     i,
     t,
@@ -1483,10 +1299,10 @@ function zs(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
     iouThreshold: m,
     scoreThreshold: h,
     padToMaxOutputSize: o
-  }, x = d.runKernel(Le, b, g);
+  }, x = d.runKernel(jn, b, g);
   return { selectedIndices: x[0], validOutputs: x[1] };
 }
-const Us = /* @__PURE__ */ p({ nonMaxSuppressionPadded_: zs });
+const Os = /* @__PURE__ */ f({ nonMaxSuppressionPadded_: Ms });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1503,8 +1319,8 @@ const Us = /* @__PURE__ */ p({ nonMaxSuppressionPadded_: zs });
  * limitations under the License.
  * =============================================================================
  */
-async function Js(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
-  const a = l(n, "boxes", "nonMaxSuppressionAsync"), i = l(e, "scores", "nonMaxSuppressionAsync"), u = en(
+async function Bs(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
+  const a = l(e, "boxes", "nonMaxSuppressionAsync"), i = l(n, "scores", "nonMaxSuppressionAsync"), u = ne(
     a,
     i,
     t,
@@ -1512,13 +1328,13 @@ async function Js(n, e, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
     r,
     null
     /* softNmsSigma */
-  ), c = u.maxOutputSize, m = u.iouThreshold, h = u.scoreThreshold, [b, g] = await Promise.all([a.data(), i.data()]), { selectedIndices: x, validOutputs: w } = Ps(b, g, c, m, h, o);
-  return a !== n && a.dispose(), i !== e && i.dispose(), {
-    selectedIndices: V(x, "int32"),
-    validOutputs: Ce(w, "int32")
+  ), c = u.maxOutputSize, m = u.iouThreshold, h = u.scoreThreshold, [b, g] = await Promise.all([a.data(), i.data()]), { selectedIndices: x, validOutputs: w } = ws(b, g, c, m, h, o);
+  return a !== e && a.dispose(), i !== n && i.dispose(), {
+    selectedIndices: B(x, "int32"),
+    validOutputs: Fn(w, "int32")
   };
 }
-const Ws = Js;
+const Ps = Bs;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1535,15 +1351,15 @@ const Ws = Js;
  * limitations under the License.
  * =============================================================================
  */
-function Ys(n, e, t = !1, s = !1) {
-  const r = l(n, "images", "resizeBilinear");
-  f(r.rank === 3 || r.rank === 4, () => `Error in resizeBilinear: x must be rank 3 or 4, but got rank ${r.rank}.`), f(e.length === 2, () => `Error in resizeBilinear: new shape must 2D, but got shape ${e}.`), f(s === !1 || t === !1, () => "Error in resizeBilinear: If halfPixelCenters is true, alignCorners must be false.");
+function Ks(e, n, t = !1, s = !1) {
+  const r = l(e, "images", "resizeBilinear");
+  p(r.rank === 3 || r.rank === 4, () => `Error in resizeBilinear: x must be rank 3 or 4, but got rank ${r.rank}.`), p(n.length === 2, () => `Error in resizeBilinear: new shape must 2D, but got shape ${n}.`), p(s === !1 || t === !1, () => "Error in resizeBilinear: If halfPixelCenters is true, alignCorners must be false.");
   let o = r, a = !1;
   r.rank === 3 && (a = !0, o = $(r, [1, r.shape[0], r.shape[1], r.shape[2]]));
-  const i = { images: o }, u = { alignCorners: t, halfPixelCenters: s, size: e }, c = d.runKernel(ze, i, u);
+  const i = { images: o }, u = { alignCorners: t, halfPixelCenters: s, size: n }, c = d.runKernel(Gn, i, u);
   return a ? $(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
 }
-const Xs = /* @__PURE__ */ p({ resizeBilinear_: Ys });
+const Rs = /* @__PURE__ */ f({ resizeBilinear_: Ks });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1560,15 +1376,15 @@ const Xs = /* @__PURE__ */ p({ resizeBilinear_: Ys });
  * limitations under the License.
  * =============================================================================
  */
-function Zs(n, e, t = !1, s = !1) {
-  const r = l(n, "images", "resizeNearestNeighbor");
-  f(r.rank === 3 || r.rank === 4, () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got rank ${r.rank}.`), f(e.length === 2, () => `Error in resizeNearestNeighbor: new shape must 2D, but got shape ${e}.`), f(r.dtype === "float32" || r.dtype === "int32", () => "`images` must have `int32` or `float32` as dtype"), f(s === !1 || t === !1, () => "Error in resizeNearestNeighbor: If halfPixelCenters is true, alignCorners must be false.");
+function qs(e, n, t = !1, s = !1) {
+  const r = l(e, "images", "resizeNearestNeighbor");
+  p(r.rank === 3 || r.rank === 4, () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got rank ${r.rank}.`), p(n.length === 2, () => `Error in resizeNearestNeighbor: new shape must 2D, but got shape ${n}.`), p(r.dtype === "float32" || r.dtype === "int32", () => "`images` must have `int32` or `float32` as dtype"), p(s === !1 || t === !1, () => "Error in resizeNearestNeighbor: If halfPixelCenters is true, alignCorners must be false.");
   let o = r, a = !1;
   r.rank === 3 && (a = !0, o = $(r, [1, r.shape[0], r.shape[1], r.shape[2]]));
-  const i = { images: o }, u = { alignCorners: t, halfPixelCenters: s, size: e }, c = d.runKernel(Ue, i, u);
+  const i = { images: o }, u = { alignCorners: t, halfPixelCenters: s, size: n }, c = d.runKernel(Ln, i, u);
   return a ? $(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
 }
-const Hs = /* @__PURE__ */ p({ resizeNearestNeighbor_: Zs });
+const js = /* @__PURE__ */ f({ resizeNearestNeighbor_: qs });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -1585,38 +1401,38 @@ const Hs = /* @__PURE__ */ p({ resizeNearestNeighbor_: Zs });
  * limitations under the License.
  * =============================================================================
  */
-function Qs(n, e = "binary", t = !1, s = 0.5) {
-  const r = l(n, "image", "threshold"), o = 0.2989, a = 0.587, i = 0.114, u = r.shape[0] * r.shape[1];
-  let c = A(V([s]), 255), m, h, b, g;
-  if (f(r.rank === 3, () => `Error in threshold: image must be rank 3,but got rank ${r.rank}.`), f(r.shape[2] === 3 || r.shape[2] === 1, () => `Error in threshold: image color channel must be equal to 3 or 1but got ${r.shape[2]}.`), f(r.dtype === "int32" || r.dtype === "float32", () => `Error in dtype: image dtype must be int32 or float32,but got dtype ${r.dtype}.`), f(e === "otsu" || e === "binary", () => `Method must be binary or otsu, but was ${e}`), r.shape[2] === 3) {
-    [m, h, b] = Un(r, [1, 1, 1], -1);
-    const k = A(m, o), E = A(h, a), T = A(b, i);
-    g = C(C(k, E), T);
+function Fs(e, n = "binary", t = !1, s = 0.5) {
+  const r = l(e, "image", "threshold"), o = 0.2989, a = 0.587, i = 0.114, u = r.shape[0] * r.shape[1];
+  let c = I(B([s]), 255), m, h, b, g;
+  if (p(r.rank === 3, () => `Error in threshold: image must be rank 3,but got rank ${r.rank}.`), p(r.shape[2] === 3 || r.shape[2] === 1, () => `Error in threshold: image color channel must be equal to 3 or 1but got ${r.shape[2]}.`), p(r.dtype === "int32" || r.dtype === "float32", () => `Error in dtype: image dtype must be int32 or float32,but got dtype ${r.dtype}.`), p(n === "otsu" || n === "binary", () => `Method must be binary or otsu, but was ${n}`), r.shape[2] === 3) {
+    [m, h, b] = Ce(r, [1, 1, 1], -1);
+    const k = I(m, o), E = I(h, a), S = I(b, i);
+    g = U(U(k, E), S);
   } else
-    g = n;
-  if (e === "otsu") {
-    const k = ot(L(Qt(g), "int32"), Ze([]), 256);
-    c = nr(k, u);
+    g = e;
+  if (n === "otsu") {
+    const k = tt(C(Vt(g), "int32"), Wn([]), 256);
+    c = Gs(k, u);
   }
-  const x = t ? Xn(g, c) : En(g, c);
-  return L(A(x, 255), "int32");
-}
-function nr(n, e) {
-  let t = V([-1]), s = V([0]), r = V([0]), o, a, i, u, c, m;
-  for (let h = 0; h < n.size - 1; h++) {
-    o = I(n, 0, h + 1), a = I(n, h + 1), c = K(j(o), e), m = K(j(a), e);
-    const b = j(A(o, ln(0, o.size)));
-    i = K(b, j(o));
-    const g = Cn(a.shape, o.size), x = C(ln(0, a.size), g), w = A(a, x);
-    u = K(j(w), j(a));
-    const k = R(i, u), E = R(i, u), T = A(c, m);
-    r = A(A(T, k), E);
-    const S = En(r, s);
-    s = nn(S, r, s), t = nn(S, V([h]), t);
+  const x = t ? We(g, c) : _e(g, c);
+  return C(I(x, 255), "int32");
+}
+function Gs(e, n) {
+  let t = B([-1]), s = B([0]), r = B([0]), o, a, i, u, c, m;
+  for (let h = 0; h < e.size - 1; h++) {
+    o = _(e, 0, h + 1), a = _(e, h + 1), c = L(G(o), n), m = L(G(a), n);
+    const b = G(I(o, ue(0, o.size)));
+    i = L(b, G(o));
+    const g = Ve(a.shape, o.size), x = U(ue(0, a.size), g), w = I(a, x);
+    u = L(G(w), G(a));
+    const k = q(i, u), E = q(i, u), S = I(c, m);
+    r = I(I(S, k), E);
+    const T = _e(r, s);
+    s = ee(T, r, s), t = ee(T, B([h]), t);
   }
   return t;
 }
-const er = /* @__PURE__ */ p({ threshold_: Qs });
+const Ls = /* @__PURE__ */ f({ threshold_: Fs });
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -1633,13 +1449,13 @@ const er = /* @__PURE__ */ p({ threshold_: Qs });
  * limitations under the License.
  * =============================================================================
  */
-function tr(n, e, t = "nearest", s = "constant", r = 0, o) {
-  const a = l(n, "image", "transform", "float32"), i = l(e, "transforms", "transform", "float32");
-  f(a.rank === 4, () => `Error in transform: image must be rank 4,but got rank ${a.rank}.`), f(i.rank === 2 && (i.shape[0] === a.shape[0] || i.shape[0] === 1) && i.shape[1] === 8, () => "Error in transform: Input transform should be batch x 8 or 1 x 8"), f(o == null || o.length === 2, () => `Error in transform: outputShape must be [height, width] or null, but got ${o}.`);
+function Vs(e, n, t = "nearest", s = "constant", r = 0, o) {
+  const a = l(e, "image", "transform", "float32"), i = l(n, "transforms", "transform", "float32");
+  p(a.rank === 4, () => `Error in transform: image must be rank 4,but got rank ${a.rank}.`), p(i.rank === 2 && (i.shape[0] === a.shape[0] || i.shape[0] === 1) && i.shape[1] === 8, () => "Error in transform: Input transform should be batch x 8 or 1 x 8"), p(o == null || o.length === 2, () => `Error in transform: outputShape must be [height, width] or null, but got ${o}.`);
   const u = { image: a, transforms: i }, c = { interpolation: t, fillMode: s, fillValue: r, outputShape: o };
-  return d.runKernel(Je, u, c);
+  return d.runKernel(Vn, u, c);
 }
-const sr = /* @__PURE__ */ p({ transform_: tr });
+const Cs = /* @__PURE__ */ f({ transform_: Vs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1656,16 +1472,16 @@ const sr = /* @__PURE__ */ p({ transform_: tr });
  * limitations under the License.
  * =============================================================================
  */
-function rr(n, e, t) {
-  const s = l(n, "a", "bandPart");
-  f(s.rank >= 2, () => `bandPart(): Rank must be at least 2, got ${s.rank}.`);
+function vs(e, n, t) {
+  const s = l(e, "a", "bandPart");
+  p(s.rank >= 2, () => `bandPart(): Rank must be at least 2, got ${s.rank}.`);
   const r = s.shape, [o, a] = s.shape.slice(-2);
   let i, u;
-  typeof e == "number" ? (f(e % 1 === 0, () => `bandPart(): numLower must be an integer, got ${e}.`), f(e <= o, () => `bandPart(): numLower (${e}) must not be greater than the number of rows (${o}).`), i = l(e < 0 ? o : e, "numLower", "bandPart")) : (f(e.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), i = nn(Rn(e, 0), o, Kn(e, o))), typeof t == "number" ? (f(t % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${t}.`), f(t <= a, () => `bandPart(): numUpper (${t}) must not be greater than the number of columns (${a}).`), u = l(t < 0 ? a : t, "numUpper", "bandPart")) : (f(t.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), u = nn(Rn(t, 0), a, Kn(t, a)));
-  const c = $(ln(0, o, 1, "int32"), [-1, 1]), m = ln(0, a, 1, "int32"), h = R(c, m), b = Bt(Xn(h, i), Tt(h, Tn(u))), g = Qe([o, a], s.dtype);
-  return $(fn(Hn($(s, [-1, o, a])).map((x) => nn(b, x, g))), r);
+  typeof n == "number" ? (p(n % 1 === 0, () => `bandPart(): numLower must be an integer, got ${n}.`), p(n <= o, () => `bandPart(): numLower (${n}) must not be greater than the number of rows (${o}).`), i = l(n < 0 ? o : n, "numLower", "bandPart")) : (p(n.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), i = ee(Ke(n, 0), o, Re(n, o))), typeof t == "number" ? (p(t % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${t}.`), p(t <= a, () => `bandPart(): numUpper (${t}) must not be greater than the number of columns (${a}).`), u = l(t < 0 ? a : t, "numUpper", "bandPart")) : (p(t.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), u = ee(Ke(t, 0), a, Re(t, a)));
+  const c = $(ue(0, o, 1, "int32"), [-1, 1]), m = ue(0, a, 1, "int32"), h = q(c, m), b = Mt(We(h, i), At(h, Ie(u))), g = Yn([o, a], s.dtype);
+  return $(le(Ye($(s, [-1, o, a])).map((x) => ee(b, x, g))), r);
 }
-const or = /* @__PURE__ */ p({ bandPart_: rr });
+const zs = /* @__PURE__ */ f({ bandPart_: vs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1682,30 +1498,30 @@ const or = /* @__PURE__ */ p({ bandPart_: rr });
  * limitations under the License.
  * =============================================================================
  */
-function ar(n) {
-  let e;
-  if (Array.isArray(n)) {
-    e = !1, f(n != null && n.length > 0, () => "Gram-Schmidt process: input must not be null, undefined, or empty");
-    const r = n[0].shape[0];
-    for (let o = 1; o < n.length; ++o)
-      f(n[o].shape[0] === r, () => `Gram-Schmidt: Non-unique lengths found in the input vectors: (${n[o].shape[0]} vs. ${r})`);
+function Ws(e) {
+  let n;
+  if (Array.isArray(e)) {
+    n = !1, p(e != null && e.length > 0, () => "Gram-Schmidt process: input must not be null, undefined, or empty");
+    const r = e[0].shape[0];
+    for (let o = 1; o < e.length; ++o)
+      p(e[o].shape[0] === r, () => `Gram-Schmidt: Non-unique lengths found in the input vectors: (${e[o].shape[0]} vs. ${r})`);
   } else
-    e = !0, n = Un(n, n.shape[0], 0).map((r) => os(r, [0]));
-  f(n.length <= n[0].shape[0], () => `Gram-Schmidt: Number of vectors (${n.length}) exceeds number of dimensions (${n[0].shape[0]}).`);
-  const t = [], s = n;
-  for (let r = 0; r < n.length; ++r)
+    n = !0, e = Ce(e, e.shape[0], 0).map((r) => Yt(r, [0]));
+  p(e.length <= e[0].shape[0], () => `Gram-Schmidt: Number of vectors (${e.length}) exceeds number of dimensions (${e[0].shape[0]}).`);
+  const t = [], s = e;
+  for (let r = 0; r < e.length; ++r)
     t.push(d.tidy(() => {
       let o = s[r];
       if (r > 0)
         for (let a = 0; a < r; ++a) {
-          const i = A(j(A(t[a], o)), t[a]);
-          o = R(o, i);
+          const i = I(G(I(t[a], o)), t[a]);
+          o = q(o, i);
         }
-      return K(o, Jn(o, "euclidean"));
+      return L(o, ve(o, "euclidean"));
     }));
-  return e ? fn(t, 0) : t;
+  return n ? le(t, 0) : t;
 }
-const ir = /* @__PURE__ */ p({ gramSchmidt_: ar });
+const Js = /* @__PURE__ */ f({ gramSchmidt_: Ws });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1722,60 +1538,60 @@ const ir = /* @__PURE__ */ p({ gramSchmidt_: ar });
  * limitations under the License.
  * =============================================================================
  */
-function cr(n, e = !1) {
-  if (f(n.rank >= 2, () => `qr() requires input tensor to have a rank >= 2, but got rank ${n.rank}`), n.rank === 2)
-    return jn(n, e);
+function Ys(e, n = !1) {
+  if (p(e.rank >= 2, () => `qr() requires input tensor to have a rank >= 2, but got rank ${e.rank}`), e.rank === 2)
+    return Fe(e, n);
   {
-    const t = n.shape.slice(0, n.shape.length - 2).reduce((u, c) => u * c), s = Hn($(n, [
+    const t = e.shape.slice(0, e.shape.length - 2).reduce((u, c) => u * c), s = Ye($(e, [
       t,
-      n.shape[n.shape.length - 2],
-      n.shape[n.shape.length - 1]
+      e.shape[e.shape.length - 2],
+      e.shape[e.shape.length - 1]
     ]), 0), r = [], o = [];
     s.forEach((u) => {
-      const [c, m] = jn(u, e);
+      const [c, m] = Fe(u, n);
       r.push(c), o.push(m);
     });
-    const a = $(fn(r, 0), n.shape), i = $(fn(o, 0), n.shape);
+    const a = $(le(r, 0), e.shape), i = $(le(o, 0), e.shape);
     return [a, i];
   }
 }
-function jn(n, e = !1) {
+function Fe(e, n = !1) {
   return d.tidy(() => {
-    f(n.shape.length === 2, () => `qr2d() requires a 2D Tensor, but got a ${n.shape.length}D Tensor.`);
-    const t = n.shape[0], s = n.shape[1];
-    let r = yt(t), o = mn(n);
-    const a = $n([[1]], [1, 1]);
-    let i = mn(a);
+    p(e.shape.length === 2, () => `qr2d() requires a 2D Tensor, but got a ${e.shape.length}D Tensor.`);
+    const t = e.shape[0], s = e.shape[1];
+    let r = kt(t), o = de(e);
+    const a = ge([[1]], [1, 1]);
+    let i = de(a);
     const u = t >= s ? s : t;
     for (let c = 0; c < u; ++c) {
       const m = o, h = i, b = r;
       [i, o, r] = d.tidy(() => {
-        const g = I(o, [c, c], [t - c, 1]), x = Jn(g), w = I(o, [c, c], [1, 1]), k = nn(En(w, 0), $n([[-1]]), $n([[1]])), E = R(w, A(k, x)), T = K(g, E);
-        T.shape[0] === 1 ? i = mn(a) : i = G([
+        const g = _(o, [c, c], [t - c, 1]), x = ve(g), w = _(o, [c, c], [1, 1]), k = ee(_e(w, 0), ge([[-1]]), ge([[1]])), E = q(w, I(k, x)), S = L(g, E);
+        S.shape[0] === 1 ? i = de(a) : i = V([
           a,
-          I(T, [1, 0], [T.shape[0] - 1, T.shape[1]])
+          _(S, [1, 0], [S.shape[0] - 1, S.shape[1]])
         ], 0);
-        const S = Tn(K(_(k, E), x)), M = I(o, [c, 0], [t - c, s]), O = A(S, i), N = wn(i);
+        const T = Ie(L(y(k, E), x)), M = _(o, [c, 0], [t - c, s]), O = I(T, i), N = xe(i);
         if (c === 0)
-          o = R(M, _(O, _(N, M)));
+          o = q(M, y(O, y(N, M)));
         else {
-          const X = R(M, _(O, _(N, M)));
-          o = G([I(o, [0, 0], [c, s]), X], 0);
+          const X = q(M, y(O, y(N, M)));
+          o = V([_(o, [0, 0], [c, s]), X], 0);
         }
-        const tn = wn(O), z = I(r, [0, c], [t, r.shape[1] - c]);
+        const te = xe(O), v = _(r, [0, c], [t, r.shape[1] - c]);
         if (c === 0)
-          r = R(z, _(_(z, i), tn));
+          r = q(v, y(y(v, i), te));
         else {
-          const X = R(z, _(_(z, i), tn));
-          r = G([I(r, [0, 0], [t, c]), X], 1);
+          const X = q(v, y(y(v, i), te));
+          r = V([_(r, [0, 0], [t, c]), X], 1);
         }
         return [i, o, r];
-      }), We([m, h, b]);
+      }), Cn([m, h, b]);
     }
-    return !e && t > s && (r = I(r, [0, 0], [t, s]), o = I(o, [0, 0], [s, s])), [r, o];
+    return !n && t > s && (r = _(r, [0, 0], [t, s]), o = _(o, [0, 0], [s, s])), [r, o];
   });
 }
-const ur = /* @__PURE__ */ p({ qr_: cr });
+const Us = /* @__PURE__ */ f({ qr_: Ys });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1792,26 +1608,26 @@ const ur = /* @__PURE__ */ p({ qr_: cr });
  * limitations under the License.
  * =============================================================================
  */
-const Br = {
-  flipLeftRight: ws,
-  grayscaleToRGB: _s,
-  resizeNearestNeighbor: Hs,
-  resizeBilinear: Xs,
-  rgbToGrayscale: Is,
-  rotateWithOffset: Ts,
-  cropAndResize: ks,
-  nonMaxSuppression: Ns,
-  nonMaxSuppressionAsync: Fs,
-  nonMaxSuppressionWithScore: Gs,
-  nonMaxSuppressionWithScoreAsync: Cs,
-  nonMaxSuppressionPadded: Us,
-  nonMaxSuppressionPaddedAsync: Ws,
-  threshold: er,
-  transform: sr
-}, Rr = {
-  bandPart: or,
-  gramSchmidt: ir,
-  qr: ur
+const Ar = {
+  flipLeftRight: is,
+  grayscaleToRGB: us,
+  resizeNearestNeighbor: js,
+  resizeBilinear: Rs,
+  rgbToGrayscale: ps,
+  rotateWithOffset: hs,
+  cropAndResize: os,
+  nonMaxSuppression: ms,
+  nonMaxSuppressionAsync: Es,
+  nonMaxSuppressionWithScore: Ts,
+  nonMaxSuppressionWithScoreAsync: Ds,
+  nonMaxSuppressionPadded: Os,
+  nonMaxSuppressionPaddedAsync: Ps,
+  threshold: Ls,
+  transform: Cs
+}, yr = {
+  bandPart: zs,
+  gramSchmidt: Js,
+  qr: Us
 };
 /**
  * @license
@@ -1822,7 +1638,7 @@ const Br = {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-const lr = ["channelsFirst", "channelsLast"], fr = ["nearest", "bilinear"], pr = ["valid", "same", "causal"], hr = ["max", "avg"], Kr = ["sum", "mul", "concat", "ave"];
+const Xs = ["channelsFirst", "channelsLast"], Zs = ["nearest", "bilinear"], Hs = ["valid", "same", "causal"], Qs = ["max", "avg"], _r = ["sum", "mul", "concat", "ave"];
 /**
  * @license
  * Copyright 2018 Google LLC
@@ -1832,29 +1648,29 @@ const lr = ["channelsFirst", "channelsLast"], fr = ["nearest", "bilinear"], pr =
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-class Qn extends Error {
-  constructor(e) {
-    super(e), Object.setPrototypeOf(this, Qn.prototype);
+class Ue extends Error {
+  constructor(n) {
+    super(n), Object.setPrototypeOf(this, Ue.prototype);
   }
 }
-class ne extends Error {
-  constructor(e) {
-    super(e), Object.setPrototypeOf(this, ne.prototype);
+class Xe extends Error {
+  constructor(n) {
+    super(n), Object.setPrototypeOf(this, Xe.prototype);
   }
 }
-class y extends Error {
-  constructor(e) {
-    super(e), Object.setPrototypeOf(this, y.prototype);
+class A extends Error {
+  constructor(n) {
+    super(n), Object.setPrototypeOf(this, A.prototype);
   }
 }
-class cn extends Error {
-  constructor(e) {
-    super(e), Object.setPrototypeOf(this, cn.prototype);
+class ie extends Error {
+  constructor(n) {
+    super(n), Object.setPrototypeOf(this, ie.prototype);
   }
 }
-class Mn extends Error {
-  constructor(e) {
-    super(e), Object.setPrototypeOf(this, Mn.prototype);
+class Ne extends Error {
+  constructor(n) {
+    super(n), Object.setPrototypeOf(this, Ne.prototype);
   }
 }
 /**
@@ -1866,81 +1682,81 @@ class Mn extends Error {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-function qr(n, e) {
-  if (Array.isArray(n)) {
+function Ir(e, n) {
+  if (Array.isArray(e)) {
     let t = [];
-    for (let s = 0; s < e; s++)
-      t = t.concat(n);
+    for (let s = 0; s < n; s++)
+      t = t.concat(e);
     return t;
   } else {
-    const t = new Array(e);
-    return t.fill(n), t;
+    const t = new Array(n);
+    return t.fill(e), t;
   }
 }
-function Gn(n, e) {
-  if (!n)
-    throw new Mn(e);
+function Ge(e, n) {
+  if (!e)
+    throw new Ne(n);
 }
-function Fr(n, e) {
+function Er(e, n) {
   let t = 0;
-  for (const s of n)
-    s === e && t++;
+  for (const s of e)
+    s === n && t++;
   return t;
 }
-function jr(n) {
-  return n.length === 1 ? n[0] : n;
+function Sr(e) {
+  return e.length === 1 ? e[0] : e;
 }
-function Gr(n) {
-  return Array.isArray(n) ? n : [n];
+function Tr(e) {
+  return Array.isArray(e) ? e : [e];
 }
-function Lr(n) {
-  const t = n.replace(/(.)([A-Z][a-z0-9]+)/g, "$1_$2").replace(/([a-z])([A-Z])/g, "$1_$2").toLowerCase();
+function Nr(e) {
+  const t = e.replace(/(.)([A-Z][a-z0-9]+)/g, "$1_$2").replace(/([a-z])([A-Z])/g, "$1_$2").toLowerCase();
   return t[0] !== "_" ? t : "private" + t;
 }
-function Cr(n) {
-  return n.length <= 1 || n.indexOf("_") === -1 ? n : n.replace(/[_]+(\w|$)/g, (e, t) => t.toUpperCase());
+function Dr(e) {
+  return e.length <= 1 || e.indexOf("_") === -1 ? e : e.replace(/[_]+(\w|$)/g, (n, t) => t.toUpperCase());
 }
 let D = {};
-function zr(n) {
-  if (n == null)
+function Mr(e) {
+  if (e == null)
     return null;
-  const e = {};
-  return e.className = n.getClassName(), e.config = n.getConfig(), e;
+  const n = {};
+  return n.className = e.getClassName(), n.config = e.getConfig(), n;
 }
-function yn(n) {
-  if (!(n == null || typeof n != "object"))
-    if (Array.isArray(n))
-      n.forEach((e) => yn(e));
+function we(e) {
+  if (!(e == null || typeof e != "object"))
+    if (Array.isArray(e))
+      e.forEach((n) => we(n));
     else {
-      const e = Object.keys(n);
-      for (const t of e) {
-        const s = n[t];
-        s != null && typeof s == "object" && (!Array.isArray(s) && s.type === "ndarray" && typeof s.value == "number" ? n[t] = s.value : yn(s));
+      const n = Object.keys(e);
+      for (const t of n) {
+        const s = e[t];
+        s != null && typeof s == "object" && (!Array.isArray(s) && s.type === "ndarray" && typeof s.value == "number" ? e[t] = s.value : we(s));
       }
     }
 }
-function Ur(n, e = {}, t = {}, s = "object", r = !1) {
-  if (typeof n == "string") {
-    const o = n;
+function Or(e, n = {}, t = {}, s = "object", r = !1) {
+  if (typeof e == "string") {
+    const o = e;
     let a;
     if (o in t)
       a = t[o];
     else if (o in D)
       a = D[o];
-    else if (a = e[o], a == null)
-      throw new y(`Unknown ${s}: ${n}. This may be due to one of the following reasons:
+    else if (a = n[o], a == null)
+      throw new A(`Unknown ${s}: ${e}. This may be due to one of the following reasons:
 1. The ${s} is defined in Python, in which case it needs to be ported to TensorFlow.js or your JavaScript code.
 2. The custom ${s} is defined in JavaScript, but is not registered properly with tf.serialization.registerClass().`);
     return a;
   } else {
-    const o = n;
+    const o = e;
     if (o.className == null || o.config == null)
-      throw new y(`${s}: Improper config format: ${JSON.stringify(o)}.
+      throw new A(`${s}: Improper config format: ${JSON.stringify(o)}.
 'className' and 'config' must set.`);
     const a = o.className;
     let i, u;
-    if (a in t ? [i, u] = t[a] : a in D ? [i, u] = D.className : a in e && ([i, u] = e[a]), i == null)
-      throw new y(`Unknown ${s}: ${a}. This may be due to one of the following reasons:
+    if (a in t ? [i, u] = t[a] : a in D ? [i, u] = D.className : a in n && ([i, u] = n[a]), i == null)
+      throw new A(`Unknown ${s}: ${a}. This may be due to one of the following reasons:
 1. The ${s} is defined in Python, in which case it needs to be ported to TensorFlow.js or your JavaScript code.
 2. The custom ${s} is defined in JavaScript, but is not registered properly with tf.serialization.registerClass().`);
     if (u != null) {
@@ -1954,7 +1770,7 @@ function Ur(n, e = {}, t = {}, s = "object", r = !1) {
       const h = Object.assign({}, D);
       for (const g of Object.keys(t))
         D[g] = t[g];
-      yn(o.config);
+      we(o.config);
       const b = u(i, o.config, t, r);
       return D = Object.assign({}, h), b;
     } else {
@@ -1966,50 +1782,50 @@ function Ur(n, e = {}, t = {}, s = "object", r = !1) {
     }
   }
 }
-function dr(n, e) {
-  return n < e ? -1 : n > e ? 1 : 0;
+function er(e, n) {
+  return e < n ? -1 : e > n ? 1 : 0;
 }
-function Jr(n, e) {
-  return -1 * dr(n, e);
+function Br(e, n) {
+  return -1 * er(e, n);
 }
-function Wr(n) {
-  if (n == null)
-    return n;
-  const e = [];
-  for (const t of n)
-    e.indexOf(t) === -1 && e.push(t);
-  return e;
-}
-function Yr(n) {
-  if (n == null)
-    throw new y(`Invalid value in obj: ${JSON.stringify(n)}`);
-  for (const e in n)
-    if (n.hasOwnProperty(e))
+function Pr(e) {
+  if (e == null)
+    return e;
+  const n = [];
+  for (const t of e)
+    n.indexOf(t) === -1 && n.push(t);
+  return n;
+}
+function Kr(e) {
+  if (e == null)
+    throw new A(`Invalid value in obj: ${JSON.stringify(e)}`);
+  for (const n in e)
+    if (e.hasOwnProperty(n))
       return !1;
   return !0;
 }
-function hn(n, e, t) {
-  if (t != null && n.indexOf(t) < 0)
-    throw new y(`${t} is not a valid ${e}.  Valid values are ${n} or null/undefined.`);
+function fe(e, n, t) {
+  if (t != null && e.indexOf(t) < 0)
+    throw new A(`${t} is not a valid ${n}.  Valid values are ${e} or null/undefined.`);
 }
-function Xr(n, e, t = 0, s = 1 / 0) {
-  return Gn(t >= 0), Gn(s >= t), Array.isArray(n) && n.length >= t && n.length <= s && n.every((r) => typeof r === e);
+function Rr(e, n, t = 0, s = 1 / 0) {
+  return Ge(t >= 0), Ge(s >= t), Array.isArray(e) && e.length >= t && e.length <= s && e.every((r) => typeof r === n);
 }
-function mr(n, e) {
-  Array.isArray(n) ? (f(n.length > 0, () => `${e} is unexpectedly an empty array.`), n.forEach((t, s) => mr(t, `element ${s + 1} of ${e}`))) : f(Number.isInteger(n) && n > 0, () => `Expected ${e} to be a positive integer, but got ${ee(n)}.`);
+function nr(e, n) {
+  Array.isArray(e) ? (p(e.length > 0, () => `${n} is unexpectedly an empty array.`), e.forEach((t, s) => nr(t, `element ${s + 1} of ${n}`))) : p(Number.isInteger(e) && e > 0, () => `Expected ${n} to be a positive integer, but got ${Ze(e)}.`);
 }
-function ee(n) {
-  return n === null ? "null" : Array.isArray(n) ? "[" + n.map((e) => ee(e)).join(",") + "]" : typeof n == "string" ? `"${n}"` : `${n}`;
+function Ze(e) {
+  return e === null ? "null" : Array.isArray(e) ? "[" + e.map((n) => Ze(n)).join(",") + "]" : typeof e == "string" ? `"${e}"` : `${e}`;
 }
-function Zr(n, e, t) {
-  let s = t != null ? t() : Bn(), r;
+function qr(e, n, t) {
+  let s = t != null ? t() : Pe(), r;
   return (...a) => {
-    const i = t != null ? t() : Bn();
-    return i - s < e || (s = i, r = n(...a)), r;
+    const i = t != null ? t() : Pe();
+    return i - s < n || (s = i, r = e(...a)), r;
   };
 }
-function Hr(n) {
-  return n === "relu" ? "relu" : n === "linear" ? "linear" : n === "elu" ? "elu" : null;
+function jr(e) {
+  return e === "relu" ? "relu" : e === "linear" ? "linear" : e === "elu" ? "elu" : null;
 }
 /**
  * @license
@@ -2021,50 +1837,50 @@ function Hr(n) {
  * =============================================================================
  */
 const Q = /* @__PURE__ */ new Map();
-function gr(n) {
-  hn(lr, "DataFormat", n);
+function tr(e) {
+  fe(Xs, "DataFormat", e);
 }
-function Qr(n) {
-  hn(fr, "InterpolationFormat", n);
+function Fr(e) {
+  fe(Zs, "InterpolationFormat", e);
 }
-function no(n) {
-  hn(pr, "PaddingMode", n);
+function Gr(e) {
+  fe(Hs, "PaddingMode", e);
 }
-function eo(n) {
-  hn(hr, "PoolMode", n);
+function Lr(e) {
+  fe(Qs, "PoolMode", e);
 }
-const an = [], Ln = "/";
-function to(n, e) {
-  an.push(n);
+const ae = [], Le = "/";
+function Vr(e, n) {
+  ae.push(e);
   try {
-    const t = e();
-    return an.pop(), t;
+    const t = n();
+    return ae.pop(), t;
   } catch (t) {
-    throw an.pop(), t;
+    throw ae.pop(), t;
   }
 }
-function $r() {
-  return an.length === 0 ? "" : an.join(Ln) + Ln;
-}
-function so(n) {
-  if (!te(n))
-    throw new Error("Not a valid tensor name: '" + n + "'");
-  return $r() + n;
-}
-function ro(n) {
-  if (!te(n))
-    throw new Error("Not a valid tensor name: '" + n + "'");
-  Q.has(n) || Q.set(n, 0);
-  const e = Q.get(n);
-  if (Q.set(n, Q.get(n) + 1), e > 0) {
-    const t = `${n}_${e}`;
+function sr() {
+  return ae.length === 0 ? "" : ae.join(Le) + Le;
+}
+function Cr(e) {
+  if (!He(e))
+    throw new Error("Not a valid tensor name: '" + e + "'");
+  return sr() + e;
+}
+function vr(e) {
+  if (!He(e))
+    throw new Error("Not a valid tensor name: '" + e + "'");
+  Q.has(e) || Q.set(e, 0);
+  const n = Q.get(e);
+  if (Q.set(e, Q.get(e) + 1), n > 0) {
+    const t = `${e}_${n}`;
     return Q.set(t, 1), t;
   } else
-    return n;
+    return e;
 }
-const br = new RegExp(/^[A-Za-z0-9][-A-Za-z0-9\._\/]*$/);
-function te(n) {
-  return !!n.match(br);
+const rr = new RegExp(/^[A-Za-z0-9][-A-Za-z0-9\._\/]*$/);
+function He(e) {
+  return !!e.match(rr);
 }
 /**
  * @license
@@ -2075,41 +1891,41 @@ function te(n) {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-function oo(n) {
-  return n === parseInt(n.toString(), 10);
+function zr(e) {
+  return e === parseInt(e.toString(), 10);
 }
-function se(n, e, t) {
-  e == null && (e = 0), t == null && (t = n.length);
+function Qe(e, n, t) {
+  n == null && (n = 0), t == null && (t = e.length);
   let s = 1;
-  for (let r = e; r < t; ++r)
-    s *= n[r];
+  for (let r = n; r < t; ++r)
+    s *= e[r];
   return s;
 }
-function ao(n) {
-  if (n.length === 0)
+function Wr(e) {
+  if (e.length === 0)
     return Number.NaN;
-  let e = Number.POSITIVE_INFINITY;
-  for (let t = 0; t < n.length; t++) {
-    const s = n[t];
-    s < e && (e = s);
+  let n = Number.POSITIVE_INFINITY;
+  for (let t = 0; t < e.length; t++) {
+    const s = e[t];
+    s < n && (n = s);
   }
-  return e;
+  return n;
 }
-function io(n) {
-  if (n.length === 0)
+function Jr(e) {
+  if (e.length === 0)
     return Number.NaN;
-  let e = Number.NEGATIVE_INFINITY;
-  for (let t = 0; t < n.length; t++) {
-    const s = n[t];
-    s > e && (e = s);
+  let n = Number.NEGATIVE_INFINITY;
+  for (let t = 0; t < e.length; t++) {
+    const s = e[t];
+    s > n && (n = s);
   }
-  return e;
+  return n;
 }
-function co(n, e) {
-  if (e < n)
-    throw new y(`end (${e}) < begin (${n}) is forbidden.`);
+function Yr(e, n) {
+  if (n < e)
+    throw new A(`end (${n}) < begin (${e}) is forbidden.`);
   const t = [];
-  for (let s = n; s < e; ++s)
+  for (let s = e; s < n; ++s)
     t.push(s);
   return t;
 }
@@ -2122,11 +1938,11 @@ function co(n, e) {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-let bn;
-function uo() {
-  return bn == null && (bn = Ye().epsilon()), bn;
+let $e;
+function Ur() {
+  return $e == null && ($e = vn().epsilon()), $e;
 }
-function _n() {
+function Ae() {
   return "channelsLast";
 }
 /**
@@ -2138,323 +1954,318 @@ function _n() {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-function lo(n, e) {
-  return L(n, e);
+function Xr(e, n) {
+  return C(e, n);
 }
-function kr(n, e = -1) {
-  const t = n.shape.slice();
-  return e < 0 && (e = t.length + e + 1), t.splice(e, 0, 1), $(n, t);
+function or(e, n = -1) {
+  const t = e.shape.slice();
+  return n < 0 && (n = t.length + n + 1), t.splice(n, 0, 1), $(e, t);
 }
-function fo(n, e) {
-  return P(() => {
-    if (n.shape.length !== 2)
-      throw new y(`repeat() expects a rank-2 tensor, but received a rank-${n.shape.length} tensor.`);
-    const t = kr(n, 1);
-    return xr(t, [1, e, 1]);
+function Zr(e, n) {
+  return K(() => {
+    if (e.shape.length !== 2)
+      throw new A(`repeat() expects a rank-2 tensor, but received a rank-${e.shape.length} tensor.`);
+    const t = or(e, 1);
+    return ar(t, [1, n, 1]);
   });
 }
-function po(n) {
-  const e = [se(n.shape)];
-  return $(n, e);
+function Hr(e) {
+  const n = [Qe(e.shape)];
+  return $(e, n);
 }
-function ho(n) {
-  if (n.rank <= 1)
-    throw new y(`batchFlatten requires a minimum rank of 2. Got rank: ${n.rank}.`);
-  const e = [n.shape[0], se(n.shape, 1)];
-  return $(n, e);
+function Qr(e) {
+  if (e.rank <= 1)
+    throw new A(`batchFlatten requires a minimum rank of 2. Got rank: ${e.rank}.`);
+  const n = [e.shape[0], Qe(e.shape, 1)];
+  return $(e, n);
 }
-function kn(n, e, t) {
-  return P(() => {
-    switch (n.rank) {
+function be(e, n, t) {
+  return K(() => {
+    switch (e.rank) {
       case 1:
-        return Sn(n, e, t);
+        return Ee(e, n, t);
       case 2:
-        return Zn(n, [e, 0], [t, n.shape[1]]);
+        return Je(e, [n, 0], [t, e.shape[1]]);
       case 3:
-        return Nn(n, [e, 0, 0], [t, n.shape[1], n.shape[2]]);
+        return Se(e, [n, 0, 0], [t, e.shape[1], e.shape[2]]);
       case 4:
-        return pn(n, [e, 0, 0, 0], [t, n.shape[1], n.shape[2], n.shape[3]]);
+        return pe(e, [n, 0, 0, 0], [t, e.shape[1], e.shape[2], e.shape[3]]);
       case 5:
-        return I(n, [e, 0, 0, 0, 0], [
+        return _(e, [n, 0, 0, 0, 0], [
           t,
-          n.shape[1],
-          n.shape[2],
-          n.shape[3],
-          n.shape[4]
+          e.shape[1],
+          e.shape[2],
+          e.shape[3],
+          e.shape[4]
         ]);
       case 6:
-        return I(n, [e, 0, 0, 0, 0, 0], [
+        return _(e, [n, 0, 0, 0, 0, 0], [
           t,
-          n.shape[1],
-          n.shape[2],
-          n.shape[3],
-          n.shape[4],
-          n.shape[5]
+          e.shape[1],
+          e.shape[2],
+          e.shape[3],
+          e.shape[4],
+          e.shape[5]
         ]);
       default:
-        throw new y(`sliceAlongFirstAxis() received an unsupported tensor rank: ${n.rank}`);
+        throw new A(`sliceAlongFirstAxis() received an unsupported tensor rank: ${e.rank}`);
     }
   });
 }
-function xn(n, e, t) {
-  return P(() => {
-    switch (n.rank) {
+function ke(e, n, t) {
+  return K(() => {
+    switch (e.rank) {
       case 1:
-        return Sn(n, e, t);
+        return Ee(e, n, t);
       case 2:
-        return Zn(n, [0, e], [n.shape[0], t]);
+        return Je(e, [0, n], [e.shape[0], t]);
       case 3:
-        return Nn(n, [0, 0, e], [n.shape[0], n.shape[1], t]);
+        return Se(e, [0, 0, n], [e.shape[0], e.shape[1], t]);
       case 4:
-        return pn(n, [0, 0, 0, e], [n.shape[0], n.shape[1], n.shape[2], t]);
+        return pe(e, [0, 0, 0, n], [e.shape[0], e.shape[1], e.shape[2], t]);
       default:
-        throw new y(`sliceAlongLastAxis() received an unsupported tensor rank: ${n.rank}`);
+        throw new A(`sliceAlongLastAxis() received an unsupported tensor rank: ${e.rank}`);
     }
   });
 }
-function mo(n, e, t, s) {
-  return P(() => {
-    switch (n.rank) {
+function eo(e, n, t, s) {
+  return K(() => {
+    switch (e.rank) {
       case 1:
-        return Sn(n, e, t);
+        return Ee(e, n, t);
       case 2:
         switch (s) {
           case 1:
-            return kn(n, e, t);
+            return be(e, n, t);
           case 2:
-            return xn(n, e, t);
+            return ke(e, n, t);
           default:
-            throw new y(`The axis is not within the rank of the tensor ${s}`);
+            throw new A(`The axis is not within the rank of the tensor ${s}`);
         }
       case 3:
         switch (s) {
           case 1:
-            return kn(n, e, t);
+            return be(e, n, t);
           case 2:
-            return Nn(n, [0, e, 0], [n.shape[0], t, n.shape[2]]);
+            return Se(e, [0, n, 0], [e.shape[0], t, e.shape[2]]);
           case 3:
-            return xn(n, e, t);
+            return ke(e, n, t);
           default:
-            throw new y(`The axis is not within the rank of the tensor ${s}`);
+            throw new A(`The axis is not within the rank of the tensor ${s}`);
         }
       case 4:
         switch (s) {
           case 1:
-            return kn(n, e, t);
+            return be(e, n, t);
           case 2:
-            return pn(n, [0, e, 0, 0], [n.shape[0], t, n.shape[2], n.shape[3]]);
+            return pe(e, [0, n, 0, 0], [e.shape[0], t, e.shape[2], e.shape[3]]);
           case 3:
-            return pn(n, [0, 0, e, 0], [n.shape[0], n.shape[1], t, n.shape[3]]);
+            return pe(e, [0, 0, n, 0], [e.shape[0], e.shape[1], t, e.shape[3]]);
           case 4:
-            return xn(n, e, t);
+            return ke(e, n, t);
           default:
-            throw new y(`The axis is not within the rank of the tensor ${s}`);
+            throw new A(`The axis is not within the rank of the tensor ${s}`);
         }
       default:
-        throw new y(`sliceAlongLastAxis() received an unsupported tensor rank: ${n.rank}`);
+        throw new A(`sliceAlongLastAxis() received an unsupported tensor rank: ${e.rank}`);
     }
   });
 }
-function go(n, e = -1) {
+function no(e, n = -1) {
   let t;
-  return e < 0 && (t = n[0].rank, t !== 0 ? e = t : e = 0), e === n[0].rank && (e = -1), G(n, e);
+  return n < 0 && (t = e[0].rank, t !== 0 ? n = t : n = 0), n === e[0].rank && (n = -1), V(e, n);
 }
-function $o(n, e) {
-  switch (n.rank) {
+function to(e, n) {
+  switch (e.rank) {
     case 1:
-      return ut([n, e]);
+      return at([e, n]);
     case 2:
-      return ft([n, e], 0);
+      return ct([e, n], 0);
     case 3:
-      return ht([n, e], 0);
+      return lt([e, n], 0);
     case 4:
-      return mt([n, e], 0);
+      return ft([e, n], 0);
     default:
-      throw new y(`concatAlongFirstAxis() received an unsupported tensor rank: ${n.rank}`);
+      throw new A(`concatAlongFirstAxis() received an unsupported tensor rank: ${e.rank}`);
   }
 }
-function xr(n, e) {
-  if (Array.isArray(e) || (e = [e]), n.rank !== e.length)
-    throw new y(`The length of input n (${e.length}) does not match the number of dimensions in input x (${n.rank})`);
-  return on(n, e);
+function ar(e, n) {
+  if (Array.isArray(n) || (n = [n]), e.rank !== n.length)
+    throw new A(`The length of input n (${n.length}) does not match the number of dimensions in input x (${e.rank})`);
+  return oe(e, n);
 }
-function bo(n, e = 0, t = 1, s, r) {
-  return Lt(n, e, t, s, r);
+function so(e, n = 0, t = 1, s, r) {
+  return Un(e, n, t, s, r);
 }
-function ko(n, e, t, s) {
-  if (n.rank < 2 || e.rank < 2)
-    throw new cn(`dot requires both inputs to be rank >= 2 but got x shape = ${n.shape} and y shape = ${e.shape}`);
-  if (e.rank >= 3) {
-    const r = n.shape.slice(-1)[0], o = e.shape.slice(-2)[0];
+function ro(e, n, t, s) {
+  if (e.rank < 2 || n.rank < 2)
+    throw new ie(`dot requires both inputs to be rank >= 2 but got x shape = ${e.shape} and y shape = ${n.shape}`);
+  if (n.rank >= 3) {
+    const r = e.shape.slice(-1)[0], o = n.shape.slice(-2)[0];
     if (r !== o)
-      throw new cn(`If rank y >= 3, then the second last dim of y must equal the last dim of x but got x shape = ${n.shape} and  y shape = ${e.shape}`);
+      throw new ie(`If rank y >= 3, then the second last dim of y must equal the last dim of x but got x shape = ${e.shape} and  y shape = ${n.shape}`);
   }
-  if (n.rank === 2 && e.rank === 2)
-    return qn({
-      a: n,
-      b: e,
+  if (e.rank === 2 && n.rank === 2)
+    return qe({
+      a: e,
+      b: n,
       transposeA: !1,
       transposeB: !1,
-      bias: s ? An(n.rank, s, _n()) : null,
+      bias: s ? ye(e.rank, s, Ae()) : null,
       activation: t
     });
   {
-    const r = n.shape.slice(), o = r.pop();
-    n = $(n, [-1, o]);
-    const a = e.shape.slice(), i = a.pop(), u = a.pop(), c = [...a, i], m = Array.from({ length: e.rank }, (x, w) => w === 0 ? e.rank - 2 : w <= e.rank - 2 ? w - 1 : w);
-    e = $(wn(e, m), [u, -1]);
+    const r = e.shape.slice(), o = r.pop();
+    e = $(e, [-1, o]);
+    const a = n.shape.slice(), i = a.pop(), u = a.pop(), c = [...a, i], m = Array.from({ length: n.rank }, (x, w) => w === 0 ? n.rank - 2 : w <= n.rank - 2 ? w - 1 : w);
+    n = $(xe(n, m), [u, -1]);
     const h = [...r, ...c];
-    return $(qn({
-      a: n,
-      b: e,
+    return $(qe({
+      a: e,
+      b: n,
       transposeA: !1,
       transposeB: !1,
-      bias: s ? An(n.rank, s, _n()) : null,
+      bias: s ? ye(e.rank, s, Ae()) : null,
       activation: t
     }), h);
   }
 }
-function xo(n, e, t) {
-  return P(() => (Array.isArray(e) ? e = V(e, "int32") : e = L(e, "int32"), nt(n, e, t)));
+function oo(e, n, t) {
+  return K(() => (Array.isArray(n) ? n = B(n, "int32") : n = C(n, "int32"), Zn(e, n, t)));
 }
-function wo(n) {
-  return A(n, n);
+function ao(e) {
+  return I(e, e);
 }
-function An(n, e, t) {
-  const s = e.shape;
-  if (e.rank !== 1 && e.rank !== n)
-    throw new y(`Unexpected bias dimensions: ${e.rank}; expected it to be 1 or ${n}`);
-  if (n === 5) {
+function ye(e, n, t) {
+  const s = n.shape;
+  if (n.rank !== 1 && n.rank !== e)
+    throw new A(`Unexpected bias dimensions: ${n.rank}; expected it to be 1 or ${e}`);
+  if (e === 5) {
     if (t === "channelsFirst")
-      return s.length === 1 ? $(e, [1, s[0], 1, 1, 1]) : $(e, [1, s[3], s[0], s[1], s[2]]);
+      return s.length === 1 ? $(n, [1, s[0], 1, 1, 1]) : $(n, [1, s[3], s[0], s[1], s[2]]);
     if (t === "channelsLast")
-      return s.length === 1 ? $(e, [1, 1, 1, 1, s[0]]) : $(e, [1].concat(s));
-  } else if (n === 4) {
+      return s.length === 1 ? $(n, [1, 1, 1, 1, s[0]]) : $(n, [1].concat(s));
+  } else if (e === 4) {
     if (t === "channelsFirst")
-      return s.length === 1 ? $(e, [1, s[0], 1, 1]) : $(e, [1, s[2], s[0], s[1]]);
+      return s.length === 1 ? $(n, [1, s[0], 1, 1]) : $(n, [1, s[2], s[0], s[1]]);
     if (t === "channelsLast")
-      return s.length === 1 ? $(e, [1, 1, 1, s[0]]) : $(e, [1].concat(s));
-  } else if (n === 3) {
+      return s.length === 1 ? $(n, [1, 1, 1, s[0]]) : $(n, [1].concat(s));
+  } else if (e === 3) {
     if (t === "channelsFirst")
-      return s.length === 1 ? $(e, [1, s[0], 1]) : $(e, [1, s[1], s[0]]);
+      return s.length === 1 ? $(n, [1, s[0], 1]) : $(n, [1, s[1], s[0]]);
     if (t === "channelsLast")
-      return s.length === 1 ? $(e, [1, 1, s[0]]) : $(e, [1].concat(s));
-  } else if (n < 3)
-    return e;
-  throw new y(`Unsupported input rank by biasAdd: ${e.rank}`);
+      return s.length === 1 ? $(n, [1, 1, s[0]]) : $(n, [1].concat(s));
+  } else if (e < 3)
+    return n;
+  throw new A(`Unsupported input rank by biasAdd: ${n.rank}`);
 }
-function yo(n, e, t) {
-  return P(() => (t == null && (t = _n()), gr(t), C(n, An(n.rank, e, t))));
+function io(e, n, t) {
+  return K(() => (t == null && (t = Ae()), tr(t), U(e, ye(e.rank, n, t))));
 }
-function _o(n, e = 1) {
-  if (e !== 1)
-    throw new cn(`Support for alpha values other than 1 (${e}) is not implemented yet.`);
-  return Yn(n);
+function co(e, n = 1) {
+  if (n !== 1)
+    throw new ie(`Support for alpha values other than 1 (${n}) is not implemented yet.`);
+  return ze(e);
 }
-function Ao(n) {
-  return P(() => K(n, C(Xe(n), 1)));
+function uo(e) {
+  return K(() => L(e, U(zn(e), 1)));
 }
-function Io(n, e, t, s) {
-  return P(() => ps(n, e, t, s));
+function lo(e, n, t, s) {
+  return K(() => Xn(e, n, t, s));
 }
-function Eo(n) {
-  return P(() => {
-    const e = C(0.5, A(0.2, n));
-    return it(e, 0, 1);
+function po(e) {
+  return K(() => {
+    const n = U(0.5, I(0.2, e));
+    return rt(n, 0, 1);
   });
 }
-function To(n, e, t = !1) {
-  return t ? n() : e();
+function fo(e, n, t = !1) {
+  return t ? e() : n();
 }
 export {
-  Jr as $,
-  Qn as A,
-  Tt as B,
-  Xn as C,
-  wn as D,
-  on as E,
-  En as F,
-  Rn as G,
-  I as H,
-  At as I,
-  Hn as J,
-  tt as K,
-  W as L,
-  Ft as M,
-  cn as N,
-  it as O,
-  uo as P,
-  Yt as Q,
-  ne as R,
-  Zr as S,
-  po as T,
-  wo as U,
-  y as V,
-  Gn as W,
-  lo as X,
-  os as Y,
-  Cr as Z,
-  Wr as _,
-  ps as a,
-  qr as a0,
+  or as $,
+  Ue as A,
+  oe as B,
+  _e as C,
+  Ke as D,
+  _ as E,
+  Ye as F,
+  Qn as G,
+  J as H,
+  rt as I,
+  Ur as J,
+  jt as K,
+  qr as L,
+  Hr as M,
+  ie as N,
+  ao as O,
+  Ge as P,
+  Xr as Q,
+  Xe as R,
+  Yt as S,
+  Dr as T,
+  Pr as U,
+  A as V,
+  Br as W,
+  Ir as X,
+  Kr as Y,
+  B as Z,
+  be as _,
+  ns as a,
+  oo as a0,
   Yr as a1,
-  V as a2,
-  kn as a3,
-  kr as a4,
-  xo as a5,
-  co as a6,
-  Fr as a7,
-  _o as a8,
-  Kn as a9,
-  Eo as aa,
-  Ao as ab,
-  Mt as ac,
-  qt as ad,
-  Yn as ae,
-  io as af,
-  oo as ag,
-  Xr as ah,
-  yo as ai,
-  mo as aj,
-  Qr as ak,
-  Br as al,
-  mr as am,
-  Hr as an,
-  no as ao,
-  _n as ap,
-  xr as aq,
-  ao as ar,
-  $o as as,
-  To as at,
-  Io as au,
-  go as av,
-  ho as aw,
-  fo as ax,
-  eo as ay,
-  Kr as az,
-  ms as b,
-  ds as c,
-  ko as d,
-  yt as e,
-  zt as f,
-  hs as g,
-  bo as h,
-  hn as i,
-  gr as j,
-  se as k,
-  Rr as l,
-  Ur as m,
-  zr as n,
-  so as o,
-  ro as p,
-  jr as q,
-  Lt as r,
-  gs as s,
-  Lr as t,
-  Gr as u,
-  to as v,
-  nn as w,
-  is as x,
-  Tn as y,
-  Bt as z
+  Er as a2,
+  co as a3,
+  Re as a4,
+  po as a5,
+  uo as a6,
+  Et as a7,
+  Pt as a8,
+  ze as a9,
+  Jr as aa,
+  zr as ab,
+  Rr as ac,
+  io as ad,
+  eo as ae,
+  Fr as af,
+  Ar as ag,
+  nr as ah,
+  jr as ai,
+  Gr as aj,
+  Ae as ak,
+  ar as al,
+  Wr as am,
+  to as an,
+  fo as ao,
+  lo as ap,
+  no as aq,
+  Qr as ar,
+  Zr as as,
+  Lr as at,
+  _r as au,
+  es as b,
+  fe as c,
+  ro as d,
+  kt as e,
+  tr as f,
+  Qt as g,
+  Qe as h,
+  Or as i,
+  Mr as j,
+  Cr as k,
+  yr as l,
+  vr as m,
+  Sr as n,
+  Tr as o,
+  Vr as p,
+  Xt as q,
+  so as r,
+  ts as s,
+  Nr as t,
+  Ie as u,
+  Mt as v,
+  ee as w,
+  At as x,
+  We as y,
+  xe as z
 };