@genai-fi/nanogpt 0.3.2 → 0.4.1

package/dist/{index-pWA4_lUh.js → index-XjBAhiFO.js}

@@ -1,6 +1,6 @@
 import { g as Ot } from "./index-D5v913EJ.js";
 import { p as Z } from "./index-xuotMAFm.js";
-import { B as gt } from "./index-Tf7vU29b.js";
+import { B as mt } from "./index-Tf7vU29b.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -17,8 +17,8 @@ import { B as gt } from "./index-Tf7vU29b.js";
  * limitations under the License.
  * =============================================================================
  */
-const Ae = 1e-7, Be = 1e-4;
-class ve {
+const Me = 1e-7, Ne = 1e-4;
+class Fe {
   refCount(t) {
     return v("refCount");
   }
@@ -37,22 +37,22 @@ class ve {
   readSync(t) {
     return v("readSync");
   }
-  readToGPU(t, e) {
+  readToGPU(t, n) {
     return v("readToGPU");
   }
   numDataIds() {
     return v("numDataIds");
   }
-  disposeData(t, e) {
+  disposeData(t, n) {
     return v("disposeData");
   }
-  write(t, e, s) {
+  write(t, n, s) {
     return v("write");
   }
-  move(t, e, s, r, a) {
+  move(t, n, s, r, a) {
     return v("move");
   }
-  createTensorFromGPUData(t, e, s) {
+  createTensorFromGPUData(t, n, s) {
     return v("createTensorFromGPUData");
   }
   memory() {
@@ -64,14 +64,14 @@ class ve {
   }
   /** Returns the smallest representable number.  */
   epsilon() {
-    return this.floatPrecision() === 32 ? Ae : Be;
+    return this.floatPrecision() === 32 ? Me : Ne;
   }
   dispose() {
     return v("dispose");
   }
 }
-function v(n) {
-  throw new Error(`'${n}' not yet implemented or not found in the registry. This kernel may not be supported by the tfjs backend you have chosen`);
+function v(e) {
+  throw new Error(`'${e}' not yet implemented or not found in the registry. This kernel may not be supported by the tfjs backend you have chosen`);
 }
 /**
  * @license
@@ -89,175 +89,227 @@ function v(n) {
  * limitations under the License.
  * =============================================================================
  */
-function Bs(n) {
-  let t = n.length, e = 0;
+function Ns(e) {
+  let t = e.length, n = 0;
   for (; t > 0; )
-    e = Math.random() * t | 0, t--, Me(n, t, e);
+    n = Math.random() * t | 0, t--, Re(e, t, n);
 }
-function Me(n, t, e) {
-  const s = n[t];
-  n[t] = n[e], n[e] = s;
+function Re(e, t, n) {
+  const s = e[t];
+  e[t] = e[n], e[n] = s;
 }
-function y(n, t) {
-  if (!n)
+function y(e, t) {
+  if (!e)
     throw new Error(typeof t == "string" ? t : t());
 }
-function vs(n, t, e = "") {
-  y(Ft(n, t), () => e + ` Shapes ${n} and ${t} must match`);
+function De(e, t, n = "") {
+  y(Rt(e, t), () => n + ` Shapes ${e} and ${t} must match`);
 }
-function Ms(n) {
-  y(n != null, () => "The input to the tensor constructor must be a non-null value.");
+function Fs(e) {
+  y(e != null, () => "The input to the tensor constructor must be a non-null value.");
 }
-function z(n) {
-  if (n.length === 0)
+function z(e) {
+  if (e.length === 0)
     return 1;
-  let t = n[0];
-  for (let e = 1; e < n.length; e++)
-    t *= n[e];
+  let t = e[0];
+  for (let n = 1; n < e.length; n++)
+    t *= e[n];
   return t;
 }
-function Ft(n, t) {
-  if (n === t)
+function Rt(e, t) {
+  if (e === t)
     return !0;
-  if (n == null || t == null || n.length !== t.length)
+  if (e == null || t == null || e.length !== t.length)
     return !1;
-  for (let e = 0; e < n.length; e++)
-    if (n[e] !== t[e])
+  for (let n = 0; n < e.length; n++)
+    if (e[n] !== t[n])
       return !1;
   return !0;
 }
-function Ne(n) {
-  return n % 1 === 0;
-}
-function lt(n, t) {
-  return t <= n.length ? n : n + " ".repeat(t - n.length);
+function $e(e) {
+  return e % 1 === 0;
+}
+function lt(e, t) {
+  return t <= e.length ? e : e + " ".repeat(t - e.length);
+}
+function Rs(e, t) {
+  let n = 1, s = -1;
+  for (let a = 0; a < e.length; ++a)
+    if (e[a] >= 0)
+      n *= e[a];
+    else if (e[a] === -1) {
+      if (s !== -1)
+        throw Error(`Shapes can only have 1 implicit size. Found -1 at dim ${s} and dim ${a}`);
+      s = a;
+    } else if (e[a] < 0)
+      throw Error(`Shapes can not be < 0. Found ${e[a]} at dim ${a}`);
+  if (s === -1) {
+    if (t > 0 && t !== n)
+      throw Error(`Size(${t}) must match the product of shape ${e}`);
+    return e;
+  }
+  if (n === 0)
+    throw Error(`Cannot infer the missing size in [${e}] when there are 0 elements`);
+  if (t % n !== 0)
+    throw Error(`The implicit shape can't be a fractional number. Got ${t} / ${n}`);
+  const r = e.slice();
+  return r[s] = t / n, r;
 }
-function Re(n, t) {
-  const e = t.length;
-  return n = n == null ? t.map((s, r) => r) : [].concat(n), y(n.every((s) => s >= -e && s < e), () => `All values in axis param must be in range [-${e}, ${e}) but got axis ${n}`), y(n.every((s) => Ne(s)), () => `All values in axis param must be integers but got axis ${n}`), n.map((s) => s < 0 ? e + s : s);
+function xe(e, t) {
+  const n = t.length;
+  return e = e == null ? t.map((s, r) => r) : [].concat(e), y(e.every((s) => s >= -n && s < n), () => `All values in axis param must be in range [-${n}, ${n}) but got axis ${e}`), y(e.every((s) => $e(s)), () => `All values in axis param must be integers but got axis ${e}`), e.map((s) => s < 0 ? n + s : s);
 }
-function Ns(n, t) {
-  const e = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : Re(t, n).sort();
+function Ds(e, t) {
+  const n = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : xe(t, e).sort();
   let o = 0;
-  for (let i = 0; i < n.length; ++i) {
+  for (let i = 0; i < e.length; ++i) {
     if (a != null) {
-      if (a[o] === i && n[i] !== 1)
-        throw new Error(`Can't squeeze axis ${i} since its dim '${n[i]}' is not 1`);
-      (a[o] == null || a[o] > i) && n[i] === 1 && (e.push(n[i]), s.push(i)), a[o] <= i && o++;
+      if (a[o] === i && e[i] !== 1)
+        throw new Error(`Can't squeeze axis ${i} since its dim '${e[i]}' is not 1`);
+      (a[o] == null || a[o] > i) && e[i] === 1 && (n.push(e[i]), s.push(i)), a[o] <= i && o++;
     }
-    n[i] !== 1 && (e.push(n[i]), s.push(i));
-  }
-  return { newShape: e, keptDims: s };
-}
-function Fe(n, t) {
-  let e = null;
-  if (n == null || n === "float32")
-    e = new Float32Array(t);
-  else if (n === "int32")
-    e = new Int32Array(t);
-  else if (n === "bool")
-    e = new Uint8Array(t);
-  else if (n === "string")
-    e = new Array(t);
+    e[i] !== 1 && (n.push(e[i]), s.push(i));
+  }
+  return { newShape: n, keptDims: s };
+}
+function $s(e, t) {
+  return te(e, t);
+}
+function te(e, t) {
+  let n = null;
+  if (e == null || e === "float32")
+    n = new Float32Array(t);
+  else if (e === "int32")
+    n = new Int32Array(t);
+  else if (e === "bool")
+    n = new Uint8Array(t);
+  else if (e === "string")
+    n = new Array(t);
   else
-    throw new Error(`Unknown data type ${n}`);
-  return e;
+    throw new Error(`Unknown data type ${e}`);
+  return n;
 }
-function De(n, t) {
-  for (let e = 0; e < n.length; e++) {
-    const s = n[e];
+function Ce(e, t) {
+  for (let n = 0; n < e.length; n++) {
+    const s = e[n];
     if (isNaN(s) || !isFinite(s))
       throw Error(`A tensor of type ${t} being uploaded contains ${s}.`);
   }
 }
-function $e(n) {
-  return n === "bool" || n === "complex64" || n === "float32" || n === "int32" || n === "string";
+function Pe(e) {
+  return e === "bool" || e === "complex64" || e === "float32" || e === "int32" || e === "string";
 }
-function St(n) {
-  if (n === "float32" || n === "int32")
+function kt(e) {
+  if (e === "float32" || e === "int32")
     return 4;
-  if (n === "complex64")
+  if (e === "complex64")
     return 8;
-  if (n === "bool")
+  if (e === "bool")
     return 1;
-  throw new Error(`Unknown dtype ${n}`);
+  throw new Error(`Unknown dtype ${e}`);
 }
-function xe(n) {
-  if (n == null)
+function Le(e) {
+  if (e == null)
     return 0;
   let t = 0;
-  return n.forEach((e) => t += e.length), t;
+  return e.forEach((n) => t += n.length), t;
 }
-function Dt(n) {
-  return typeof n == "string" || n instanceof String;
+function Dt(e) {
+  return typeof e == "string" || e instanceof String;
 }
-function Ce(n) {
-  return typeof n == "boolean";
+function _e(e) {
+  return typeof e == "boolean";
 }
-function Pe(n) {
-  return typeof n == "number";
+function Oe(e) {
+  return typeof e == "number";
 }
-function mt(n) {
-  return Array.isArray(n) ? mt(n[0]) : n instanceof Float32Array ? "float32" : n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray ? "int32" : Pe(n) ? "float32" : Dt(n) ? "string" : Ce(n) ? "bool" : "float32";
+function pt(e) {
+  return Array.isArray(e) ? pt(e[0]) : e instanceof Float32Array ? "float32" : e instanceof Int32Array || e instanceof Uint8Array || e instanceof Uint8ClampedArray ? "int32" : Oe(e) ? "float32" : Dt(e) ? "string" : _e(e) ? "bool" : "float32";
 }
-function kt(n) {
-  return !!(n && n.constructor && n.call && n.apply);
+function ht(e) {
+  return !!(e && e.constructor && e.call && e.apply);
 }
-function $t(n) {
-  const t = n.length;
+function xs(e, t) {
+  for (let n = t; n < e; ++n)
+    if (e % n === 0)
+      return n;
+  return e;
+}
+function $t(e) {
+  const t = e.length;
   if (t < 2)
     return [];
-  const e = new Array(t - 1);
-  e[t - 2] = n[t - 1];
+  const n = new Array(t - 1);
+  n[t - 2] = e[t - 1];
   for (let s = t - 3; s >= 0; --s)
-    e[s] = e[s + 1] * n[s + 1];
-  return e;
+    n[s] = n[s + 1] * e[s + 1];
+  return n;
 }
-function Zt(n, t, e, s = !1) {
+function ee(e, t, n, s = !1) {
   const r = new Array();
   if (t.length === 1) {
     const a = t[0] * (s ? 2 : 1);
     for (let o = 0; o < a; o++)
-      r[o] = e[n + o];
+      r[o] = n[e + o];
   } else {
     const a = t[0], o = t.slice(1), i = o.reduce((c, l) => c * l) * (s ? 2 : 1);
     for (let c = 0; c < a; c++)
-      r[c] = Zt(n + c * i, o, e, s);
+      r[c] = ee(e + c * i, o, n, s);
   }
   return r;
 }
-function _t(n, t, e = !1) {
-  if (n.length === 0)
+function Gt(e, t, n = !1) {
+  if (e.length === 0)
     return t[0];
-  const s = n.reduce((r, a) => r * a) * (e ? 2 : 1);
+  const s = e.reduce((r, a) => r * a) * (n ? 2 : 1);
   if (s === 0)
     return [];
   if (s !== t.length)
-    throw new Error(`[${n}] does not match the input size ${t.length}${e ? " for a complex tensor" : ""}.`);
-  return Zt(0, n, t, e);
+    throw new Error(`[${e}] does not match the input size ${t.length}${n ? " for a complex tensor" : ""}.`);
+  return ee(0, e, t, n);
 }
-function Le(n, t) {
-  const e = te(n, t);
-  for (let s = 0; s < e.length; s++)
-    e[s] = 1;
-  return e;
+function Ge(e, t) {
+  const n = ne(e, t);
+  for (let s = 0; s < n.length; s++)
+    n[s] = 1;
+  return n;
 }
-function te(n, t) {
+function ne(e, t) {
   if (t == null || t === "float32" || t === "complex64")
-    return new Float32Array(n);
+    return new Float32Array(e);
   if (t === "int32")
-    return new Int32Array(n);
+    return new Int32Array(e);
   if (t === "bool")
-    return new Uint8Array(n);
+    return new Uint8Array(e);
   throw new Error(`Unknown data type ${t}`);
 }
-function xt(n) {
-  n.forEach((t) => {
-    y(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${n}].`);
+function xt(e) {
+  e.forEach((t) => {
+    y(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${e}].`);
   });
 }
-function Ct(n) {
-  return n && n.then && typeof n.then == "function";
+function Cs(e, t, n) {
+  if (t === 0)
+    return 0;
+  if (t === 1)
+    return e[0];
+  let s = e[e.length - 1];
+  for (let r = 0; r < e.length - 1; ++r)
+    s += n[r] * e[r];
+  return s;
+}
+function Ps(e, t, n) {
+  if (t === 0)
+    return [];
+  if (t === 1)
+    return [e];
+  const s = new Array(t);
+  for (let r = 0; r < s.length - 1; ++r)
+    s[r] = Math.floor(e / n[r]), e -= s[r] * n[r];
+  return s[s.length - 1] = e, s;
+}
+function Ct(e) {
+  return e && e.then && typeof e.then == "function";
 }
 /**
  * @license
@@ -276,16 +328,16 @@ function Ct(n) {
  * =============================================================================
  */
 const Ut = "tfjsflags";
-class Oe {
+class Ue {
   // tslint:disable-next-line: no-any
   constructor(t) {
-    this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = _e, this.populateURLFlags();
+    this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = ze, this.populateURLFlags();
   }
-  setPlatform(t, e) {
-    this.platform != null && (k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(`Platform ${this.platformName} has already been set. Overwriting the platform with ${t}.`)), this.platformName = t, this.platform = e;
+  setPlatform(t, n) {
+    this.platform != null && (k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(`Platform ${this.platformName} has already been set. Overwriting the platform with ${t}.`)), this.platformName = t, this.platform = n;
   }
-  registerFlag(t, e, s) {
-    if (this.flagRegistry[t] = { evaluationFn: e, setHook: s }, this.urlFlags[t] != null) {
+  registerFlag(t, n, s) {
+    if (this.flagRegistry[t] = { evaluationFn: n, setHook: s }, this.urlFlags[t] != null) {
       const r = this.urlFlags[t];
       k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(`Setting feature override from URL ${t}: ${r}.`), this.set(t, r);
     }
@@ -296,10 +348,10 @@ class Oe {
   get(t) {
     if (t in this.flags)
       return this.flags[t];
-    const e = this.evaluateFlag(t);
-    if (Ct(e))
+    const n = this.evaluateFlag(t);
+    if (Ct(n))
       throw new Error(`Flag ${t} cannot be synchronously evaluated. Please use getAsync() instead.`);
-    return this.flags[t] = e, this.flags[t];
+    return this.flags[t] = n, this.flags[t];
   }
   getNumber(t) {
     return this.get(t);
@@ -317,10 +369,10 @@ class Oe {
   get features() {
     return this.flags;
   }
-  set(t, e) {
+  set(t, n) {
     if (this.flagRegistry[t] == null)
       throw new Error(`Cannot set flag ${t} as it has not been registered.`);
-    this.flags[t] = e, this.flagRegistry[t].setHook != null && this.flagRegistry[t].setHook(e);
+    this.flags[t] = n, this.flagRegistry[t].setHook != null && this.flagRegistry[t].setHook(n);
   }
   evaluateFlag(t) {
     if (this.flagRegistry[t] == null)
@@ -339,27 +391,27 @@ class Oe {
     const t = this.getQueryParams(this.global.location.search);
     Ut in t && t[Ut].split(",").forEach((s) => {
       const [r, a] = s.split(":");
-      this.urlFlags[r] = Ge(r, a);
+      this.urlFlags[r] = We(r, a);
     });
   }
 }
-function _e(n) {
+function ze(e) {
   const t = {};
-  return n.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (e, ...s) => (Ue(t, s[0], s[1]), s.join("="))), t;
+  return e.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (n, ...s) => (Ve(t, s[0], s[1]), s.join("="))), t;
 }
-function Ue(n, t, e) {
-  n[decodeURIComponent(t)] = decodeURIComponent(e || "");
+function Ve(e, t, n) {
+  e[decodeURIComponent(t)] = decodeURIComponent(n || "");
 }
-function Ge(n, t) {
-  const e = t.toLowerCase();
-  return e === "true" || e === "false" ? e === "true" : `${+e}` === e ? +e : t;
+function We(e, t) {
+  const n = t.toLowerCase();
+  return n === "true" || n === "false" ? n === "true" : `${+n}` === n ? +n : t;
 }
 function k() {
-  return ee;
+  return se;
 }
-let ee = null;
-function ze(n) {
-  ee = n;
+let se = null;
+function je(e) {
+  se = e;
 }
 /**
  * @license
@@ -377,38 +429,38 @@ function ze(n) {
  * limitations under the License.
  * =============================================================================
  */
-let pt;
-function ne() {
-  if (pt == null) {
-    let n;
+let yt;
+function re() {
+  if (yt == null) {
+    let e;
     if (typeof window < "u")
-      n = window;
+      e = window;
     else if (typeof Ot < "u")
-      n = Ot;
+      e = Ot;
     else if (typeof Z < "u")
-      n = Z;
+      e = Z;
     else if (typeof self < "u")
-      n = self;
+      e = self;
     else
       throw new Error("Could not find a global object");
-    pt = n;
+    yt = e;
   }
-  return pt;
+  return yt;
 }
-function Ve() {
-  const n = ne();
-  return n._tfGlobals == null && (n._tfGlobals = /* @__PURE__ */ new Map()), n._tfGlobals;
+function Ke() {
+  const e = re();
+  return e._tfGlobals == null && (e._tfGlobals = /* @__PURE__ */ new Map()), e._tfGlobals;
 }
-function Pt(n, t) {
-  const e = Ve();
-  if (e.has(n))
-    return e.get(n);
+function Pt(e, t) {
+  const n = Ke();
+  if (n.has(e))
+    return n.get(e);
   {
     const s = t();
-    return e.set(n, s), e.get(n);
+    return n.set(e, s), n.get(e);
   }
 }
-const We = "Abs", Rs = "Acos", Fs = "Acosh", se = "Add", Ds = "AddN", $s = "All", xs = "Any", Cs = "ArgMax", Ps = "ArgMin", Ls = "Asin", Os = "Asinh", _s = "Atan", Us = "Atanh", Gs = "Atan2", zs = "AvgPool", Vs = "AvgPoolGrad", Ws = "AvgPool3D", js = "AvgPool3DGrad", Ks = "BatchMatMul", qs = "BatchToSpaceND", Hs = "Bincount", Js = "BroadcastTo", re = "Cast", Xs = "Ceil", Ys = "ClipByValue", Qs = "Complex", je = "ComplexAbs", Zs = "Concat", tr = "Conv2D", er = "Conv2DBackpropFilter", nr = "Conv2DBackpropInput", sr = "Conv3D", rr = "Conv3DBackpropFilterV2", ar = "Conv3DBackpropInputV2", or = "Cos", ir = "Cosh", cr = "Cumprod", lr = "Cumsum", ur = "CropAndResize", hr = "DenseBincount", dr = "DepthwiseConv2dNative", fr = "DepthwiseConv2dNativeBackpropFilter", gr = "DepthwiseConv2dNativeBackpropInput", mr = "Dilation2D", pr = "Dilation2DBackpropInput", yr = "Dilation2DBackpropFilter", Ke = "RealDiv", br = "Einsum", wr = "Elu", Sr = "EluGrad", kr = "Erf", Ir = "Equal", Tr = "Exp", Er = "ExpandDims", Ar = "Expm1", qe = "Fill", Br = "FlipLeftRight", vr = "Floor", He = "FloorDiv", Mr = "FusedBatchNorm", Nr = "GatherV2", Rr = "GatherNd", Fr = "Greater", Dr = "GreaterEqual", ae = "Identity", $r = "Imag", xr = "IsFinite", Cr = "IsInf", Pr = "IsNan", Lr = "LeakyRelu", Or = "Less", _r = "LessEqual", Ur = "Log", Gr = "Log1p", zr = "LogicalAnd", Vr = "LogicalNot", Wr = "LogSoftmax", jr = "LRN", Kr = "LRNGrad", qr = "Max", Je = "Maximum", Hr = "MaxPool", Jr = "MaxPoolGrad", Xr = "MaxPool3D", Yr = "MaxPool3DGrad", Qr = "Mean", Zr = "Min", ta = "Minimum", ea = "MirrorPad", na = "Mod", sa = "Multinomial", Xe = "Multiply", ra = "Neg", aa = "NotEqual", oa = "NonMaxSuppressionV3", ia = "NonMaxSuppressionV4", ca = "NonMaxSuppressionV5", la = "OnesLike", ua = "OneHot", ha = "Pack", da = "PadV2", Ye = "Pow", fa = "Prelu", ga = "Prod", ma = "Range", pa = "Real", ya = "Reciprocal", ba = "Relu", wa = "Reshape", Sa = "ResizeNearestNeighbor", ka = "ResizeNearestNeighborGrad", Ia = "ResizeBilinear", Ta = "ResizeBilinearGrad", Ea = "Relu6", Aa = "Reverse", Ba = "Round", va = "Rsqrt", Ma = "ScatterNd", Na = "Select", Ra = "Selu", Fa = "Slice", Da = "Sin", $a = "Sinh", xa = "Sign", Ca = "Sigmoid", Pa = "Softplus", Qe = "Sqrt", La = "Sum", Oa = "SpaceToBatchND", _a = "SplitV", Ua = "Softmax", Ga = "SquaredDifference", za = "Square", Ze = "Sub", Va = "Tan", Wa = "Tanh", ja = "Tile", Ka = "TopK", qa = "Transform", Ha = "Transpose", Ja = "Unpack", Xa = "UnsortedSegmentSum", tn = "ZerosLike", Ya = "Step", Qa = "RotateWithOffset", Za = "_FusedMatMul", to = "FusedConv2D";
+const qe = "Abs", Ls = "Acos", _s = "Acosh", ae = "Add", Os = "AddN", Gs = "All", Us = "Any", zs = "ArgMax", Vs = "ArgMin", Ws = "Asin", js = "Asinh", Ks = "Atan", qs = "Atanh", Hs = "Atan2", Js = "AvgPool", Xs = "AvgPoolGrad", Ys = "AvgPool3D", Qs = "AvgPool3DGrad", Zs = "BatchMatMul", tr = "BatchToSpaceND", er = "Bincount", nr = "BroadcastTo", oe = "Cast", sr = "Ceil", rr = "ClipByValue", ar = "Complex", He = "ComplexAbs", or = "Concat", ir = "Conv2D", cr = "Conv2DBackpropFilter", lr = "Conv2DBackpropInput", ur = "Conv3D", hr = "Conv3DBackpropFilterV2", fr = "Conv3DBackpropInputV2", dr = "Cos", gr = "Cosh", mr = "Cumprod", pr = "Cumsum", yr = "CropAndResize", br = "DenseBincount", wr = "DepthwiseConv2dNative", Sr = "DepthwiseConv2dNativeBackpropFilter", kr = "DepthwiseConv2dNativeBackpropInput", Ir = "Dilation2D", Tr = "Dilation2DBackpropInput", Er = "Dilation2DBackpropFilter", Je = "RealDiv", Ar = "Einsum", Br = "Elu", vr = "EluGrad", Mr = "Erf", Nr = "Equal", Fr = "Exp", Rr = "ExpandDims", Dr = "Expm1", Xe = "Fill", $r = "FlipLeftRight", xr = "Floor", Ye = "FloorDiv", Cr = "FusedBatchNorm", Pr = "GatherV2", Lr = "GatherNd", _r = "Greater", Or = "GreaterEqual", ie = "Identity", Gr = "Imag", Ur = "IsFinite", zr = "IsInf", Vr = "IsNan", Wr = "LeakyRelu", jr = "Less", Kr = "LessEqual", qr = "Log", Hr = "Log1p", Jr = "LogicalAnd", Xr = "LogicalNot", Yr = "LogSoftmax", Qr = "LRN", Zr = "LRNGrad", ta = "Max", Qe = "Maximum", ea = "MaxPool", na = "MaxPoolGrad", sa = "MaxPool3D", ra = "MaxPool3DGrad", aa = "Mean", oa = "Min", ia = "Minimum", ca = "MirrorPad", la = "Mod", ua = "Multinomial", Ze = "Multiply", ha = "Neg", fa = "NotEqual", da = "NonMaxSuppressionV3", ga = "NonMaxSuppressionV4", ma = "NonMaxSuppressionV5", pa = "OnesLike", ya = "OneHot", ba = "Pack", wa = "PadV2", tn = "Pow", Sa = "Prelu", ka = "Prod", Ia = "Range", Ta = "Real", Ea = "Reciprocal", Aa = "Relu", Ba = "Reshape", va = "ResizeNearestNeighbor", Ma = "ResizeNearestNeighborGrad", Na = "ResizeBilinear", Fa = "ResizeBilinearGrad", Ra = "Relu6", Da = "Reverse", $a = "Round", xa = "Rsqrt", Ca = "ScatterNd", Pa = "Select", La = "Selu", _a = "Slice", Oa = "Sin", Ga = "Sinh", Ua = "Sign", za = "Sigmoid", Va = "Softplus", en = "Sqrt", Wa = "Sum", ja = "SpaceToBatchND", Ka = "SplitV", qa = "Softmax", Ha = "SquaredDifference", Ja = "Square", nn = "Sub", Xa = "Tan", Ya = "Tanh", Qa = "Tile", Za = "TopK", to = "Transform", eo = "Transpose", no = "Unpack", so = "UnsortedSegmentSum", sn = "ZerosLike", ro = "Step", ao = "RotateWithOffset", oo = "_FusedMatMul", io = "FusedConv2D";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -425,8 +477,8 @@ const We = "Abs", Rs = "Acos", Fs = "Acosh", se = "Add", Ds = "AddN", $s = "All"
  * limitations under the License.
  * =============================================================================
  */
-function _(...n) {
-  k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(...n);
+function O(...e) {
+  k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(...e);
 }
 /**
  * @license
@@ -444,35 +496,35 @@ function _(...n) {
  * limitations under the License.
  * =============================================================================
  */
-const ht = Pt("kernelRegistry", () => /* @__PURE__ */ new Map()), It = Pt("gradRegistry", () => /* @__PURE__ */ new Map());
-function Gt(n, t) {
-  const e = oe(n, t);
-  return ht.get(e);
+const ft = Pt("kernelRegistry", () => /* @__PURE__ */ new Map()), It = Pt("gradRegistry", () => /* @__PURE__ */ new Map());
+function zt(e, t) {
+  const n = ce(e, t);
+  return ft.get(n);
 }
-function zt(n) {
-  return It.get(n);
+function Vt(e) {
+  return It.get(e);
 }
-function Vt(n) {
-  const t = ht.entries(), e = [];
+function Wt(e) {
+  const t = ft.entries(), n = [];
   for (; ; ) {
     const { done: s, value: r } = t.next();
     if (s)
       break;
     const [a, o] = r, [i] = a.split("_");
-    i === n && e.push(o);
+    i === e && n.push(o);
   }
-  return e;
+  return n;
 }
-function eo(n) {
-  const { kernelName: t, backendName: e } = n, s = oe(t, e);
-  ht.has(s) && _(`The kernel '${t}' for backend '${e}' is already registered`), ht.set(s, n);
+function co(e) {
+  const { kernelName: t, backendName: n } = e, s = ce(t, n);
+  ft.has(s) && O(`The kernel '${t}' for backend '${n}' is already registered`), ft.set(s, e);
 }
-function no(n) {
-  const { kernelName: t } = n;
-  It.has(t) && k().getBool("DEBUG") && _(`Overriding the gradient for '${t}'`), It.set(t, n);
+function lo(e) {
+  const { kernelName: t } = e;
+  It.has(t) && k().getBool("DEBUG") && O(`Overriding the gradient for '${t}'`), It.set(t, e);
 }
-function oe(n, t) {
-  return `${t}_${n}`;
+function ce(e, t) {
+  return `${t}_${e}`;
 }
 /**
  * @license
@@ -490,8 +542,8 @@ function oe(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ie(n) {
-  return n instanceof Float32Array || n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray;
+function le(e) {
+  return e instanceof Float32Array || e instanceof Int32Array || e instanceof Uint8Array || e instanceof Uint8ClampedArray;
 }
 /**
  * @license
@@ -509,50 +561,53 @@ function ie(n) {
  * limitations under the License.
  * =============================================================================
  */
-function en(n, t) {
-  return n instanceof Float32Array && t === "float32" || n instanceof Int32Array && t === "int32" || n instanceof Uint8Array && t === "bool";
+function uo(e, t) {
+  return t === "string" ? ue(e) : Lt([e], t);
 }
-function ce(n, t) {
+function rn(e, t) {
+  return e instanceof Float32Array && t === "float32" || e instanceof Int32Array && t === "int32" || e instanceof Uint8Array && t === "bool";
+}
+function Lt(e, t) {
   if (t === "string")
     throw new Error("Cannot convert a string[] to a TypedArray");
-  if (Array.isArray(n) && (n = ct(n)), k().getBool("DEBUG") && De(n, t), en(n, t))
-    return n;
+  if (Array.isArray(e) && (e = ct(e)), k().getBool("DEBUG") && Ce(e, t), rn(e, t))
+    return e;
   if (t == null || t === "float32" || t === "complex64")
-    return new Float32Array(n);
+    return new Float32Array(e);
   if (t === "int32")
-    return new Int32Array(n);
+    return new Int32Array(e);
   if (t === "bool") {
-    const e = new Uint8Array(n.length);
-    for (let s = 0; s < e.length; ++s)
-      Math.round(n[s]) !== 0 && (e[s] = 1);
-    return e;
+    const n = new Uint8Array(e.length);
+    for (let s = 0; s < n.length; ++s)
+      Math.round(e[s]) !== 0 && (n[s] = 1);
+    return n;
   } else
     throw new Error(`Unknown data type ${t}`);
 }
 function dt() {
   return k().platform.now();
 }
-function nn(n, t = "utf-8") {
-  return t = t || "utf-8", k().platform.encode(n, t);
+function ue(e, t = "utf-8") {
+  return t = t || "utf-8", k().platform.encode(e, t);
 }
-function Wt(n, t = "utf-8") {
-  return t = t || "utf-8", k().platform.decode(n, t);
+function jt(e, t = "utf-8") {
+  return t = t || "utf-8", k().platform.decode(e, t);
 }
-function R(n) {
-  return k().platform.isTypedArray != null ? k().platform.isTypedArray(n) : ie(n);
+function F(e) {
+  return k().platform.isTypedArray != null ? k().platform.isTypedArray(e) : le(e);
 }
-function ct(n, t = [], e = !1) {
-  if (t == null && (t = []), typeof n == "boolean" || typeof n == "number" || typeof n == "string" || Ct(n) || n == null || R(n) && e)
-    t.push(n);
-  else if (Array.isArray(n) || R(n))
-    for (let s = 0; s < n.length; ++s)
-      ct(n[s], t, e);
+function ct(e, t = [], n = !1) {
+  if (t == null && (t = []), typeof e == "boolean" || typeof e == "number" || typeof e == "string" || Ct(e) || e == null || F(e) && n)
+    t.push(e);
+  else if (Array.isArray(e) || F(e))
+    for (let s = 0; s < e.length; ++s)
+      ct(e[s], t, n);
   else {
     let s = -1;
-    for (const r of Object.keys(n))
+    for (const r of Object.keys(e))
       /^([1-9]+[0-9]*|0)$/.test(r) && (s = Math.max(s, Number(r)));
     for (let r = 0; r <= s; r++)
-      ct(n[r], t, e);
+      ct(e[r], t, n);
   }
   return t;
 }
@@ -572,11 +627,11 @@ function ct(n, t = [], e = !1) {
  * limitations under the License.
  * =============================================================================
  */
-class sn {
-  constructor(t, e) {
-    this.backendTimer = t, this.logger = e, e == null && (this.logger = new an());
+class an {
+  constructor(t, n) {
+    this.backendTimer = t, this.logger = n, n == null && (this.logger = new cn());
   }
-  profileKernel(t, e, s) {
+  profileKernel(t, n, s) {
     let r;
     const a = () => {
       r = s();
@@ -595,48 +650,48 @@ class sn {
       for (let l = 0; l < r.length; l++) {
         const u = r[l];
         u.data().then((h) => {
-          rn(h, u.dtype, t);
+          on(h, u.dtype, t);
         });
       }
     return {
       kernelName: t,
       outputs: r,
-      inputs: e,
+      inputs: n,
       timeMs: o.then((l) => l.kernelMs),
       extraInfo: o.then((l) => l.getExtraProfileInfo != null ? l.getExtraProfileInfo() : "")
     };
   }
   logKernelProfile(t) {
-    const { kernelName: e, outputs: s, timeMs: r, inputs: a, extraInfo: o } = t;
+    const { kernelName: n, outputs: s, timeMs: r, inputs: a, extraInfo: o } = t;
     s.forEach((i) => {
       Promise.all([i.data(), r, o]).then((c) => {
-        this.logger.logKernelProfile(e, i, c[0], c[1], a, c[2]);
+        this.logger.logKernelProfile(n, i, c[0], c[1], a, c[2]);
       });
     });
   }
 }
-function rn(n, t, e) {
+function on(e, t, n) {
   if (t !== "float32")
     return !1;
-  for (let s = 0; s < n.length; s++) {
-    const r = n[s];
+  for (let s = 0; s < e.length; s++) {
+    const r = e[s];
     if (isNaN(r) || !isFinite(r))
-      return console.warn(`Found ${r} in the result of '${e}'`), !0;
+      return console.warn(`Found ${r} in the result of '${n}'`), !0;
   }
   return !1;
 }
-class an {
-  logKernelProfile(t, e, s, r, a, o) {
-    const i = typeof r == "number" ? lt(`${r}ms`, 9) : r.error, c = lt(t, 25), l = e.rank, u = e.size, h = lt(e.shape.toString(), 14);
-    let d = "";
+class cn {
+  logKernelProfile(t, n, s, r, a, o) {
+    const i = typeof r == "number" ? lt(`${r}ms`, 9) : r.error, c = lt(t, 25), l = n.rank, u = n.size, h = lt(n.shape.toString(), 14);
+    let f = "";
     for (const m in a) {
       const p = a[m];
       if (p != null) {
-        const f = p.shape || e.shape, w = f.length;
-        d += `${m}: ${w}D ${w > 0 ? f : ""} `;
+        const d = p.shape || n.shape, w = d.length;
+        f += `${m}: ${w}D ${w > 0 ? d : ""} `;
       }
     }
-    console.log(`%c${c}	%c${i}	%c${l}D ${h}	%c${u}	%c${d}	%c${o}`, "font-weight:bold", "color:red", "color:blue", "color: orange", "color: green", "color: steelblue");
+    console.log(`%c${c}	%c${i}	%c${l}D ${h}	%c${u}	%c${f}	%c${o}`, "font-weight:bold", "color:red", "color:blue", "color: orange", "color: green", "color: steelblue");
   }
 }
 /**
@@ -655,18 +710,18 @@ class an {
  * limitations under the License.
  * =============================================================================
  */
-function on(n, t, e) {
+function ln(e, t, n) {
   const s = {}, r = {};
   for (let c = 0; c < t.length; c++)
     s[t[c].id] = !0;
-  for (let c = 0; c < n.length; c++) {
-    const l = n[c], u = l.inputs;
+  for (let c = 0; c < e.length; c++) {
+    const l = e[c], u = l.inputs;
     for (const h in u) {
-      const d = u[h];
+      const f = u[h];
       let m = !1;
       for (let p = 0; p < t.length; p++)
-        if (s[d.id]) {
-          l.outputs.forEach((f) => s[f.id] = !0), m = !0, r[l.id] = !0;
+        if (s[f.id]) {
+          l.outputs.forEach((d) => s[d.id] = !0), m = !0, r[l.id] = !0;
           break;
         }
       if (m)
@@ -674,25 +729,25 @@ function on(n, t, e) {
     }
   }
   const a = {};
-  a[e.id] = !0;
+  a[n.id] = !0;
   const o = {};
-  for (let c = n.length - 1; c >= 0; c--) {
-    const l = n[c], u = l.inputs;
+  for (let c = e.length - 1; c >= 0; c--) {
+    const l = e[c], u = l.inputs;
     for (let h = 0; h < l.outputs.length; h++)
       if (a[l.outputs[h].id]) {
-        for (const d in u)
-          a[u[d].id] = !0, o[l.id] = !0;
+        for (const f in u)
+          a[u[f].id] = !0, o[l.id] = !0;
         break;
       }
   }
   const i = [];
-  for (let c = 0; c < n.length; c++) {
-    const l = n[c];
+  for (let c = 0; c < e.length; c++) {
+    const l = e[c];
     if (r[l.id] && o[l.id]) {
       const u = {};
-      for (const d in l.inputs) {
-        const m = l.inputs[d];
-        s[m.id] && (u[d] = m);
+      for (const f in l.inputs) {
+        const m = l.inputs[f];
+        s[m.id] && (u[f] = m);
       }
       const h = Object.assign({}, l);
       h.inputs = u, h.outputs = l.outputs, i.push(h);
@@ -700,11 +755,11 @@ function on(n, t, e) {
   }
   return i;
 }
-function cn(n, t, e, s) {
+function un(e, t, n, s) {
   for (let r = t.length - 1; r >= 0; r--) {
     const a = t[r], o = [];
     if (a.outputs.forEach((c) => {
-      const l = n[c.id];
+      const l = e[c.id];
       l != null ? o.push(l) : o.push(null);
     }), a.gradient == null)
       throw new Error(`Cannot compute gradient: gradient function not found for ${a.kernelName}.`);
@@ -712,17 +767,17 @@ function cn(n, t, e, s) {
     for (const c in a.inputs) {
       if (!(c in i))
         throw new Error(`Cannot backprop through input ${c}. Available gradients found: ${Object.keys(i)}.`);
-      const l = e(() => i[c]());
+      const l = n(() => i[c]());
       if (l.dtype !== "float32")
         throw new Error(`Error in gradient for op ${a.kernelName}. The gradient of input ${c} must have 'float32' dtype, but has '${l.dtype}'`);
       const u = a.inputs[c];
-      if (!Ft(l.shape, u.shape))
+      if (!Rt(l.shape, u.shape))
         throw new Error(`Error in gradient for op ${a.kernelName}. The gradient of input '${c}' has shape '${l.shape}', which does not match the shape of the input '${u.shape}'`);
-      if (n[u.id] == null)
-        n[u.id] = l;
+      if (e[u.id] == null)
+        e[u.id] = l;
       else {
-        const h = n[u.id];
-        n[u.id] = s(h, l), h.dispose();
+        const h = e[u.id];
+        e[u.id] = s(h, l), h.dispose();
       }
     }
   }
@@ -743,106 +798,106 @@ function cn(n, t, e, s) {
  * limitations under the License.
  * =============================================================================
  */
-const jt = 20, at = 3, yt = 7;
-function ln(n, t, e, s) {
-  const r = $t(t), a = un(n, t, e, r), o = t.length, i = ut(n, t, e, r, a), c = ["Tensor"];
-  return s && (c.push(`  dtype: ${e}`), c.push(`  rank: ${o}`), c.push(`  shape: [${t}]`), c.push("  values:")), c.push(i.map((l) => "    " + l).join(`
+const Kt = 20, at = 3, bt = 7;
+function hn(e, t, n, s) {
+  const r = $t(t), a = fn(e, t, n, r), o = t.length, i = ut(e, t, n, r, a), c = ["Tensor"];
+  return s && (c.push(`  dtype: ${n}`), c.push(`  rank: ${o}`), c.push(`  shape: [${t}]`), c.push("  values:")), c.push(i.map((l) => "    " + l).join(`
 `)), c.join(`
 `);
 }
-function un(n, t, e, s) {
-  const r = z(t), a = s[s.length - 1], o = new Array(a).fill(0), i = t.length, c = e === "complex64" ? it(n) : n;
+function fn(e, t, n, s) {
+  const r = z(t), a = s[s.length - 1], o = new Array(a).fill(0), i = t.length, c = n === "complex64" ? it(e) : e;
   if (i > 1)
     for (let l = 0; l < r / a; l++) {
       const u = l * a;
       for (let h = 0; h < a; h++)
-        o[h] = Math.max(o[h], ot(c[u + h], 0, e).length);
+        o[h] = Math.max(o[h], ot(c[u + h], 0, n).length);
     }
   return o;
 }
-function ot(n, t, e) {
+function ot(e, t, n) {
   let s;
-  return Array.isArray(n) ? s = `${parseFloat(n[0].toFixed(yt))} + ${parseFloat(n[1].toFixed(yt))}j` : Dt(n) ? s = `'${n}'` : e === "bool" ? s = le(n) : s = parseFloat(n.toFixed(yt)).toString(), lt(s, t);
+  return Array.isArray(e) ? s = `${parseFloat(e[0].toFixed(bt))} + ${parseFloat(e[1].toFixed(bt))}j` : Dt(e) ? s = `'${e}'` : n === "bool" ? s = he(e) : s = parseFloat(e.toFixed(bt)).toString(), lt(s, t);
 }
-function le(n) {
-  return n === 0 ? "false" : "true";
+function he(e) {
+  return e === 0 ? "false" : "true";
 }
-function ut(n, t, e, s, r, a = !0) {
-  const o = e === "complex64" ? 2 : 1, i = t[0], c = t.length;
+function ut(e, t, n, s, r, a = !0) {
+  const o = n === "complex64" ? 2 : 1, i = t[0], c = t.length;
   if (c === 0) {
-    if (e === "complex64") {
-      const f = it(n);
-      return [ot(f[0], 0, e)];
+    if (n === "complex64") {
+      const d = it(e);
+      return [ot(d[0], 0, n)];
     }
-    return e === "bool" ? [le(n[0])] : [n[0].toString()];
+    return n === "bool" ? [he(e[0])] : [e[0].toString()];
   }
   if (c === 1) {
-    if (i > jt) {
+    if (i > Kt) {
       const w = at * o;
-      let I = Array.from(n.slice(0, w)), O = Array.from(n.slice((i - at) * o, i * o));
-      return e === "complex64" && (I = it(I), O = it(O)), [
-        "[" + I.map((J, X) => ot(J, r[X], e)).join(", ") + ", ..., " + O.map((J, X) => ot(J, r[i - at + X], e)).join(", ") + "]"
+      let I = Array.from(e.slice(0, w)), _ = Array.from(e.slice((i - at) * o, i * o));
+      return n === "complex64" && (I = it(I), _ = it(_)), [
+        "[" + I.map((J, X) => ot(J, r[X], n)).join(", ") + ", ..., " + _.map((J, X) => ot(J, r[i - at + X], n)).join(", ") + "]"
       ];
     }
     return [
-      "[" + (e === "complex64" ? it(n) : Array.from(n)).map((w, I) => ot(w, r[I], e)).join(", ") + "]"
+      "[" + (n === "complex64" ? it(e) : Array.from(e)).map((w, I) => ot(w, r[I], n)).join(", ") + "]"
     ];
   }
-  const l = t.slice(1), u = s.slice(1), h = s[0] * o, d = [];
-  if (i > jt) {
-    for (let f = 0; f < at; f++) {
-      const w = f * h, I = w + h;
-      d.push(...ut(
-        n.slice(w, I),
+  const l = t.slice(1), u = s.slice(1), h = s[0] * o, f = [];
+  if (i > Kt) {
+    for (let d = 0; d < at; d++) {
+      const w = d * h, I = w + h;
+      f.push(...ut(
+        e.slice(w, I),
         l,
-        e,
+        n,
         u,
         r,
         !1
         /* isLast */
       ));
     }
-    d.push("...");
-    for (let f = i - at; f < i; f++) {
-      const w = f * h, I = w + h;
-      d.push(...ut(
-        n.slice(w, I),
+    f.push("...");
+    for (let d = i - at; d < i; d++) {
+      const w = d * h, I = w + h;
+      f.push(...ut(
+        e.slice(w, I),
         l,
-        e,
+        n,
         u,
         r,
-        f === i - 1
+        d === i - 1
         /* isLast */
       ));
     }
   } else
-    for (let f = 0; f < i; f++) {
-      const w = f * h, I = w + h;
-      d.push(...ut(
-        n.slice(w, I),
+    for (let d = 0; d < i; d++) {
+      const w = d * h, I = w + h;
+      f.push(...ut(
+        e.slice(w, I),
         l,
-        e,
+        n,
         u,
         r,
-        f === i - 1
+        d === i - 1
         /* isLast */
       ));
     }
   const m = c === 2 ? "," : "";
-  d[0] = "[" + (i > 0 ? d[0] + m : "");
-  for (let f = 1; f < d.length - 1; f++)
-    d[f] = " " + d[f] + m;
+  f[0] = "[" + (i > 0 ? f[0] + m : "");
+  for (let d = 1; d < f.length - 1; d++)
+    f[d] = " " + f[d] + m;
   let p = `,
 `;
-  for (let f = 2; f < c; f++)
+  for (let d = 2; d < c; d++)
     p += `
 `;
-  return d[d.length - 1] = " " + d[d.length - 1] + "]" + (a ? "" : p), d;
+  return f[f.length - 1] = " " + f[f.length - 1] + "]" + (a ? "" : p), f;
 }
-function it(n) {
+function it(e) {
   const t = [];
-  for (let e = 0; e < n.length; e += 2)
-    t.push([n[e], n[e + 1]]);
+  for (let n = 0; n < e.length; n += 2)
+    t.push([e[n], e[n + 1]]);
   return t;
 }
 /**
@@ -861,15 +916,15 @@ function it(n) {
  * limitations under the License.
  * =============================================================================
  */
-class hn {
-  constructor(t, e, s) {
-    if (this.dtype = e, this.shape = t.slice(), this.size = z(t), s != null) {
+class dn {
+  constructor(t, n, s) {
+    if (this.dtype = n, this.shape = t.slice(), this.size = z(t), s != null) {
       const r = s.length;
       y(r === this.size, () => `Length of values '${r}' does not match the size inferred by the shape '${this.size}'.`);
     }
-    if (e === "complex64")
+    if (n === "complex64")
       throw new Error("complex64 dtype TensorBuffers are not supported. Please create a TensorBuffer for the real and imaginary parts separately and call tf.complex(real, imag).");
-    this.values = s || Fe(e, this.size), this.strides = $t(t);
+    this.values = s || te(n, this.size), this.strides = $t(t);
   }
   /**
    * Sets a value in the buffer at a given location.
@@ -879,9 +934,9 @@ class hn {
    *
    * @doc {heading: 'Tensors', subheading: 'Creation'}
    */
-  set(t, ...e) {
-    e.length === 0 && (e = [0]), y(e.length === this.rank, () => `The number of provided coordinates (${e.length}) must match the rank (${this.rank})`);
-    const s = this.locToIndex(e);
+  set(t, ...n) {
+    n.length === 0 && (n = [0]), y(n.length === this.rank, () => `The number of provided coordinates (${n.length}) must match the rank (${this.rank})`);
+    const s = this.locToIndex(n);
     this.values[s] = t;
   }
   /**
@@ -893,13 +948,13 @@ class hn {
    */
   get(...t) {
     t.length === 0 && (t = [0]);
-    let e = 0;
+    let n = 0;
     for (const r of t) {
-      if (r < 0 || r >= this.shape[e]) {
+      if (r < 0 || r >= this.shape[n]) {
         const a = `Requested out of range element at ${t}.   Buffer shape=${this.shape}`;
         throw new Error(a);
       }
-      e++;
+      n++;
     }
     let s = t[t.length - 1];
     for (let r = 0; r < t.length - 1; ++r)
@@ -911,20 +966,20 @@ class hn {
       return 0;
     if (this.rank === 1)
       return t[0];
-    let e = t[t.length - 1];
+    let n = t[t.length - 1];
     for (let s = 0; s < t.length - 1; ++s)
-      e += this.strides[s] * t[s];
-    return e;
+      n += this.strides[s] * t[s];
+    return n;
   }
   indexToLoc(t) {
     if (this.rank === 0)
       return [];
     if (this.rank === 1)
       return [t];
-    const e = new Array(this.shape.length);
-    for (let s = 0; s < e.length - 1; ++s)
-      e[s] = Math.floor(t / this.strides[s]), t -= e[s] * this.strides[s];
-    return e[e.length - 1] = t, e;
+    const n = new Array(this.shape.length);
+    for (let s = 0; s < n.length - 1; ++s)
+      n[s] = Math.floor(t / this.strides[s]), t -= n[s] * this.strides[s];
+    return n[n.length - 1] = t, n;
   }
   get rank() {
     return this.shape.length;
@@ -935,19 +990,19 @@ class hn {
    * @doc {heading: 'Tensors', subheading: 'Creation'}
    */
   toTensor() {
-    return F().makeTensor(this.values, this.shape, this.dtype);
+    return R().makeTensor(this.values, this.shape, this.dtype);
   }
 }
-let F = null, Y = null;
-function dn(n) {
-  F = n;
+let R = null, Y = null;
+function gn(e) {
+  R = e;
 }
-function fn(n) {
-  Y = n;
+function mn(e) {
+  Y = e;
 }
 class D {
-  constructor(t, e, s, r) {
-    this.kept = !1, this.isDisposedInternal = !1, this.shape = t.slice(), this.dtype = e || "float32", this.size = z(t), this.strides = $t(t), this.dataId = s, this.id = r, this.rankType = this.rank < 5 ? this.rank.toString() : "higher";
+  constructor(t, n, s, r) {
+    this.kept = !1, this.isDisposedInternal = !1, this.shape = t.slice(), this.dtype = n || "float32", this.size = z(t), this.strides = $t(t), this.dataId = s, this.id = r, this.rankType = this.rank < 5 ? this.rank.toString() : "higher";
   }
   get rank() {
     return this.shape.length;
@@ -976,7 +1031,7 @@ class D {
    */
   async array() {
     const t = await this.data();
-    return _t(this.shape, t, this.dtype === "complex64");
+    return Gt(this.shape, t, this.dtype === "complex64");
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -985,7 +1040,7 @@ class D {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   arraySync() {
-    return _t(this.shape, this.dataSync(), this.dtype === "complex64");
+    return Gt(this.shape, this.dataSync(), this.dtype === "complex64");
   }
   /**
    * Asynchronously downloads the values from the `tf.Tensor`. Returns a
@@ -995,11 +1050,11 @@ class D {
    */
   async data() {
     this.throwIfDisposed();
-    const t = F().read(this.dataId);
+    const t = R().read(this.dataId);
     if (this.dtype === "string") {
-      const e = await t;
+      const n = await t;
       try {
-        return e.map((s) => Wt(s));
+        return n.map((s) => jt(s));
       } catch {
         throw new Error("Failed to decode the string bytes into utf-8. To get the original bytes, call tensor.bytes().");
       }
@@ -1041,7 +1096,7 @@ class D {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dataToGPU(t) {
-    return this.throwIfDisposed(), F().readToGPU(this.dataId, t);
+    return this.throwIfDisposed(), R().readToGPU(this.dataId, t);
   }
   /**
    * Synchronously downloads the values from the `tf.Tensor`. This blocks the
@@ -1051,10 +1106,10 @@ class D {
    */
   dataSync() {
     this.throwIfDisposed();
-    const t = F().readSync(this.dataId);
+    const t = R().readSync(this.dataId);
     if (this.dtype === "string")
       try {
-        return t.map((e) => Wt(e));
+        return t.map((n) => jt(n));
       } catch {
         throw new Error("Failed to decode the string bytes into utf-8. To get the original bytes, call tensor.bytes().");
       }
@@ -1063,7 +1118,7 @@ class D {
   /** Returns the underlying bytes of the tensor's data. */
   async bytes() {
     this.throwIfDisposed();
-    const t = await F().read(this.dataId);
+    const t = await R().read(this.dataId);
     return this.dtype === "string" ? t : new Uint8Array(t.buffer);
   }
   /**
@@ -1072,7 +1127,7 @@ class D {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dispose() {
-    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), F().disposeTensor(this), this.isDisposedInternal = !0);
+    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), R().disposeTensor(this), this.isDisposedInternal = !0);
   }
   get isDisposed() {
     return this.isDisposedInternal;
@@ -1105,26 +1160,26 @@ class D {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   toString(t = !1) {
-    const e = this.dataSync();
-    return ln(e, this.shape, this.dtype, t);
+    const n = this.dataSync();
+    return hn(n, this.shape, this.dtype, t);
   }
   cast(t) {
     return this.throwIfDisposed(), Y.cast(this, t);
   }
-  variable(t = !0, e, s) {
-    return this.throwIfDisposed(), F().makeVariable(this, t, e, s);
+  variable(t = !0, n, s) {
+    return this.throwIfDisposed(), R().makeVariable(this, t, n, s);
   }
 }
 Object.defineProperty(D, Symbol.hasInstance, {
-  value: (n) => !!n && n.data != null && n.dataSync != null && n.throwIfDisposed != null
+  value: (e) => !!e && e.data != null && e.dataSync != null && e.throwIfDisposed != null
 });
-function ue() {
+function fe() {
   return Pt("Tensor", () => D);
 }
-ue();
-class ft extends D {
-  constructor(t, e, s, r) {
-    super(t.shape, t.dtype, t.dataId, r), this.trainable = e, this.name = s;
+fe();
+class gt extends D {
+  constructor(t, n, s, r) {
+    super(t.shape, t.dtype, t.dataId, r), this.trainable = n, this.name = s;
   }
   /**
    * Assign a new `tf.Tensor` to this variable. The new `tf.Tensor` must have
@@ -1137,20 +1192,20 @@ class ft extends D {
   assign(t) {
     if (t.dtype !== this.dtype)
       throw new Error(`dtype of the new value (${t.dtype}) and previous value (${this.dtype}) must match`);
-    if (!Ft(t.shape, this.shape))
+    if (!Rt(t.shape, this.shape))
       throw new Error(`shape of the new value (${t.shape}) and previous value (${this.shape}) must match`);
-    F().disposeTensor(this), this.dataId = t.dataId, F().incRef(
+    R().disposeTensor(this), this.dataId = t.dataId, R().incRef(
       this,
       null
       /* backend */
     );
   }
   dispose() {
-    F().disposeVariable(this), this.isDisposedInternal = !0;
+    R().disposeVariable(this), this.isDisposedInternal = !0;
   }
 }
-Object.defineProperty(ft, Symbol.hasInstance, {
-  value: (n) => n instanceof D && n.assign != null && n.assign instanceof Function
+Object.defineProperty(gt, Symbol.hasInstance, {
+  value: (e) => e instanceof D && e.assign != null && e.assign instanceof Function
 });
 /**
  * @license
@@ -1168,45 +1223,48 @@ Object.defineProperty(ft, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-var Kt;
-(function(n) {
-  n.R0 = "R0", n.R1 = "R1", n.R2 = "R2", n.R3 = "R3", n.R4 = "R4", n.R5 = "R5", n.R6 = "R6";
-})(Kt || (Kt = {}));
+var qt;
+(function(e) {
+  e.R0 = "R0", e.R1 = "R1", e.R2 = "R2", e.R3 = "R3", e.R4 = "R4", e.R5 = "R5", e.R6 = "R6";
+})(qt || (qt = {}));
 var Tt;
-(function(n) {
-  n.float32 = "float32", n.int32 = "int32", n.bool = "int32", n.complex64 = "complex64";
+(function(e) {
+  e.float32 = "float32", e.int32 = "int32", e.bool = "int32", e.complex64 = "complex64";
 })(Tt || (Tt = {}));
 var Et;
-(function(n) {
-  n.float32 = "float32", n.int32 = "int32", n.bool = "bool", n.complex64 = "complex64";
+(function(e) {
+  e.float32 = "float32", e.int32 = "int32", e.bool = "bool", e.complex64 = "complex64";
 })(Et || (Et = {}));
 var At;
-(function(n) {
-  n.float32 = "float32", n.int32 = "float32", n.bool = "float32", n.complex64 = "complex64";
+(function(e) {
+  e.float32 = "float32", e.int32 = "float32", e.bool = "float32", e.complex64 = "complex64";
 })(At || (At = {}));
 var Bt;
-(function(n) {
-  n.float32 = "complex64", n.int32 = "complex64", n.bool = "complex64", n.complex64 = "complex64";
+(function(e) {
+  e.float32 = "complex64", e.int32 = "complex64", e.bool = "complex64", e.complex64 = "complex64";
 })(Bt || (Bt = {}));
-const gn = {
+const pn = {
   float32: At,
   int32: Tt,
   bool: Et,
   complex64: Bt
 };
-function mn(n, t) {
-  if (n === "string" || t === "string") {
-    if (n === "string" && t === "string")
+function de(e, t) {
+  if (e === "string" || t === "string") {
+    if (e === "string" && t === "string")
       return "string";
-    throw new Error(`Can not upcast ${n} with ${t}`);
+    throw new Error(`Can not upcast ${e} with ${t}`);
   }
-  return gn[n][t];
+  return pn[e][t];
+}
+function ho(e) {
+  return de(e, "int32");
 }
-function he(n) {
-  return n != null && typeof n == "object" && "texture" in n && n.texture instanceof WebGLTexture;
+function ge(e) {
+  return e != null && typeof e == "object" && "texture" in e && e.texture instanceof WebGLTexture;
 }
-function de(n) {
-  return typeof GPUBuffer < "u" && n != null && typeof n == "object" && "buffer" in n && n.buffer instanceof GPUBuffer;
+function me(e) {
+  return typeof GPUBuffer < "u" && e != null && typeof e == "object" && "buffer" in e && e.buffer instanceof GPUBuffer;
 }
 /**
  * @license
@@ -1224,36 +1282,36 @@ function de(n) {
  * limitations under the License.
  * =============================================================================
  */
-function q(n, t) {
-  if (n.dtype === t.dtype)
-    return [n, t];
-  const e = mn(n.dtype, t.dtype);
-  return [n.cast(e), t.cast(e)];
+function q(e, t) {
+  if (e.dtype === t.dtype)
+    return [e, t];
+  const n = de(e.dtype, t.dtype);
+  return [e.cast(n), t.cast(n)];
 }
-function so(n, t) {
-  return t.some((e) => e.id === n.id);
+function fo(e, t) {
+  return t.some((n) => n.id === e.id);
 }
-function fe(n) {
+function pe(e) {
   const t = [];
-  return ge(n, t, /* @__PURE__ */ new Set()), t;
+  return ye(e, t, /* @__PURE__ */ new Set()), t;
 }
-function ge(n, t, e) {
-  if (n == null)
+function ye(e, t, n) {
+  if (e == null)
     return;
-  if (n instanceof D) {
-    t.push(n);
+  if (e instanceof D) {
+    t.push(e);
     return;
   }
-  if (!pn(n))
+  if (!yn(e))
     return;
-  const s = n;
+  const s = e;
   for (const r in s) {
     const a = s[r];
-    e.has(a) || (e.add(a), ge(a, t, e));
+    n.has(a) || (n.add(a), ye(a, t, n));
   }
 }
-function pn(n) {
-  return Array.isArray(n) || typeof n == "object";
+function yn(e) {
+  return Array.isArray(e) || typeof e == "object";
 }
 /**
  * @license
@@ -1271,10 +1329,10 @@ function pn(n) {
  * limitations under the License.
  * =============================================================================
  */
-function bt(n) {
-  return n.kernelName != null;
+function wt(e) {
+  return e.kernelName != null;
 }
-class qt {
+class Ht {
   constructor() {
     this.registeredVariables = {}, this.nextTapeNodeId = 0, this.numBytes = 0, this.numTensors = 0, this.numStringTensors = 0, this.numDataBuffers = 0, this.gradientDepth = 0, this.kernelDepth = 0, this.scopeStack = [], this.numDataMovesStack = [], this.nextScopeId = 0, this.tensorInfo = /* @__PURE__ */ new WeakMap(), this.profiling = !1, this.activeProfile = {
       newBytes: 0,
@@ -1294,7 +1352,7 @@ class qt {
 }
 class et {
   constructor(t) {
-    this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new qt();
+    this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new Ht();
   }
   async ready() {
     if (this.pendingBackendInit != null)
@@ -1303,8 +1361,8 @@ class et {
     if (this.backendInstance != null)
       return;
     const t = this.getSortedBackends();
-    for (let e = 0; e < t.length; e++) {
-      const s = t[e];
+    for (let n = 0; n < t.length; n++) {
+      const s = t[n];
       if (await this.initializeBackend(s).success) {
         await this.setBackend(s);
         return;
@@ -1316,8 +1374,8 @@ class et {
     if (this.pendingBackendInit != null)
       throw new Error(`Backend '${this.backendName}' has not yet been initialized. Make sure to await tf.ready() or await tf.setBackend() before calling other methods`);
     if (this.backendInstance == null) {
-      const { name: t, asyncInit: e } = this.initializeBackendsAndReturnBest();
-      if (e)
+      const { name: t, asyncInit: n } = this.initializeBackendsAndReturnBest();
+      if (n)
         throw new Error(`The highest priority backend '${t}' has not yet been initialized. Make sure to await tf.ready() or await tf.setBackend() before calling other methods`);
       this.setBackend(t);
     }
@@ -1329,8 +1387,8 @@ class et {
   findBackend(t) {
     if (!(t in this.registry))
       if (t in this.registryFactory) {
-        const { asyncInit: e } = this.initializeBackend(t);
-        if (e)
+        const { asyncInit: n } = this.initializeBackend(t);
+        if (n)
           return null;
       } else
         return null;
@@ -1339,27 +1397,27 @@ class et {
   findBackendFactory(t) {
     return t in this.registryFactory ? this.registryFactory[t].factory : null;
   }
-  registerBackend(t, e, s = 1) {
-    return t in this.registryFactory ? (_(`${t} backend was already registered. Reusing existing backend factory.`), !1) : (this.registryFactory[t] = { factory: e, priority: s }, !0);
+  registerBackend(t, n, s = 1) {
+    return t in this.registryFactory ? (O(`${t} backend was already registered. Reusing existing backend factory.`), !1) : (this.registryFactory[t] = { factory: n, priority: s }, !0);
   }
   async setBackend(t) {
     if (this.registryFactory[t] == null)
       throw new Error(`Backend name '${t}' not found in registry`);
     if (this.backendName = t, this.registry[t] == null) {
       this.backendInstance = null;
-      const { success: e, asyncInit: s } = this.initializeBackend(t);
-      if (!(s ? await e : e))
+      const { success: n, asyncInit: s } = this.initializeBackend(t);
+      if (!(s ? await n : n))
         return !1;
     }
-    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new sn(this.backendInstance), !0;
+    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new an(this.backendInstance), !0;
   }
   setupRegisteredKernels() {
-    Vt(this.backendName).forEach((e) => {
-      e.setupFunc != null && e.setupFunc(this.backendInstance);
+    Wt(this.backendName).forEach((n) => {
+      n.setupFunc != null && n.setupFunc(this.backendInstance);
     });
   }
   disposeRegisteredKernels(t) {
-    Vt(t).forEach((s) => {
+    Wt(t).forEach((s) => {
       s.disposeFunc != null && s.disposeFunc(this.registry[t]);
     });
   }
@@ -1370,18 +1428,18 @@ class et {
    * there is no backend in the factory registry.
    */
   initializeBackend(t) {
-    const e = this.registryFactory[t];
-    if (e == null)
+    const n = this.registryFactory[t];
+    if (n == null)
       throw new Error(`Cannot initialize backend ${t}, no registration found.`);
     try {
-      const s = e.factory();
-      if (s && !(s instanceof ve) && typeof s.then == "function") {
-        const r = ++this.pendingBackendInitId, a = s.then((o) => r < this.pendingBackendInitId ? !1 : (this.registry[t] = o, this.pendingBackendInit = null, !0)).catch((o) => (r < this.pendingBackendInitId || (this.pendingBackendInit = null, _(`Initialization of backend ${t} failed`), _(o.stack || o.message)), !1));
+      const s = n.factory();
+      if (s && !(s instanceof Fe) && typeof s.then == "function") {
+        const r = ++this.pendingBackendInitId, a = s.then((o) => r < this.pendingBackendInitId ? !1 : (this.registry[t] = o, this.pendingBackendInit = null, !0)).catch((o) => (r < this.pendingBackendInitId || (this.pendingBackendInit = null, O(`Initialization of backend ${t} failed`), O(o.stack || o.message)), !1));
         return this.pendingBackendInit = a, { success: a, asyncInit: !0 };
       } else
         return this.registry[t] = s, { success: !0, asyncInit: !1 };
     } catch (s) {
-      return _(`Initialization of backend ${t} failed`), _(s.stack || s.message), { success: !1, asyncInit: !1 };
+      return O(`Initialization of backend ${t} failed`), O(s.stack || s.message), { success: !1, asyncInit: !1 };
     }
   }
   removeBackend(t) {
@@ -1392,44 +1450,44 @@ class et {
   getSortedBackends() {
     if (Object.keys(this.registryFactory).length === 0)
       throw new Error("No backend found in registry.");
-    return Object.keys(this.registryFactory).sort((t, e) => this.registryFactory[e].priority - this.registryFactory[t].priority);
+    return Object.keys(this.registryFactory).sort((t, n) => this.registryFactory[n].priority - this.registryFactory[t].priority);
   }
   initializeBackendsAndReturnBest() {
     const t = this.getSortedBackends();
-    for (let e = 0; e < t.length; e++) {
-      const s = t[e], { success: r, asyncInit: a } = this.initializeBackend(s);
+    for (let n = 0; n < t.length; n++) {
+      const s = t[n], { success: r, asyncInit: a } = this.initializeBackend(s);
       if (a || r)
         return { name: s, asyncInit: a };
     }
     throw new Error("Could not initialize any backends, all backend initializations failed.");
   }
-  moveData(t, e) {
-    const s = this.state.tensorInfo.get(e), r = s.backend, a = this.readSync(e), o = r.refCount(e);
-    r.disposeData(e, !0), s.backend = t, t.move(e, a, s.shape, s.dtype, o), this.shouldCheckForMemLeaks() && this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1]++;
+  moveData(t, n) {
+    const s = this.state.tensorInfo.get(n), r = s.backend, a = this.readSync(n), o = r.refCount(n);
+    r.disposeData(n, !0), s.backend = t, t.move(n, a, s.shape, s.dtype, o), this.shouldCheckForMemLeaks() && this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1]++;
   }
-  tidy(t, e) {
+  tidy(t, n) {
     let s = null;
-    if (e == null) {
+    if (n == null) {
       if (typeof t != "function")
         throw new Error("Please provide a function to tidy()");
-      e = t;
+      n = t;
     } else {
       if (typeof t != "string" && !(t instanceof String))
         throw new Error("When calling with two arguments, the first argument to tidy() must be a string");
-      if (typeof e != "function")
+      if (typeof n != "function")
         throw new Error("When calling with two arguments, the 2nd argument to tidy() must be a function");
       s = t;
     }
     let r;
-    return this.scopedRun(() => this.startScope(s), () => this.endScope(r), () => (r = e(), r instanceof Promise && console.error("Cannot return a Promise inside of tidy."), r));
+    return this.scopedRun(() => this.startScope(s), () => this.endScope(r), () => (r = n(), r instanceof Promise && console.error("Cannot return a Promise inside of tidy."), r));
   }
-  scopedRun(t, e, s) {
+  scopedRun(t, n, s) {
     t();
     try {
       const r = s();
-      return e(), r;
+      return n(), r;
     } catch (r) {
-      throw e(), r;
+      throw n(), r;
     }
   }
   nextTensorId() {
@@ -1445,18 +1503,18 @@ class et {
    * execution.
    */
   clone(t) {
-    const e = g.runKernel(ae, { x: t }), s = { x: t }, r = (o) => ({
+    const n = g.runKernel(ie, { x: t }), s = { x: t }, r = (o) => ({
       x: () => {
         const i = "float32", c = { x: o }, l = { dtype: i };
         return g.runKernel(
-          re,
+          oe,
           c,
           // tslint:disable-next-line: no-unnecessary-type-assertion
           l
         );
       }
     }), a = [];
-    return this.addTapeNode(this.state.activeScope.name, s, [e], r, a, {}), e;
+    return this.addTapeNode(this.state.activeScope.name, s, [n], r, a, {}), n;
   }
   /**
    * Execute a kernel with the given name and return the output tensor.
@@ -1471,21 +1529,21 @@ class et {
    *     for the backprop computation. These are booleans since the output
    * tensors are not visible to the user.
    */
-  runKernel(t, e, s) {
-    if (this.backendName == null && this.backend, !(Gt(t, this.backendName) != null))
+  runKernel(t, n, s) {
+    if (this.backendName == null && this.backend, !(zt(t, this.backendName) != null))
       throw new Error(`Kernel '${t}' not registered for backend '${this.backendName}'`);
-    return this.runKernelFunc({ kernelName: t, inputs: e, attrs: s });
+    return this.runKernelFunc({ kernelName: t, inputs: n, attrs: s });
   }
   shouldCheckForMemLeaks() {
     return this.ENV.getBool("IS_TEST");
   }
-  checkKernelForMemLeak(t, e, s) {
+  checkKernelForMemLeak(t, n, s) {
     const r = this.backend.numDataIds();
     let a = 0;
     s.forEach((c) => {
       a += c.dtype === "complex64" ? 3 : 1;
     });
-    const o = this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1], i = r - e - a - o;
+    const o = this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1], i = r - n - a - o;
     if (i > 0)
       throw new Error(`Backend '${this.backendName}' has an internal memory leak (${i} data ids) after running '${t}'`);
   }
@@ -1495,60 +1553,60 @@ class et {
    * Use `runKernel` to execute kernels from outside of engine.
    */
   runKernelFunc(t) {
-    let e, s = [];
+    let n, s = [];
     const r = this.isTapeOn(), a = this.state.numBytes, o = this.state.numTensors;
     this.shouldCheckForMemLeaks() && this.state.numDataMovesStack.push(0);
     let i;
     this.backendName == null && this.backend;
     let c;
-    const l = bt(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
-    if (bt(t)) {
-      const { kernelName: p, inputs: f, attrs: w } = t;
+    const l = wt(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
+    if (wt(t)) {
+      const { kernelName: p, inputs: d, attrs: w } = t;
       this.backendName == null && this.backend;
-      const I = Gt(p, this.backendName);
+      const I = zt(p, this.backendName);
       y(I != null, () => `Cannot find registered kernel '${p}' for backend '${this.backendName}'`), i = () => {
-        const O = this.backend.numDataIds();
-        c = I.kernelFunc({ inputs: f, attrs: w, backend: this.backend });
+        const _ = this.backend.numDataIds();
+        c = I.kernelFunc({ inputs: d, attrs: w, backend: this.backend });
         const J = Array.isArray(c) ? c : [c];
-        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(p, O, J);
+        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(p, _, J);
         const X = J.map((rt) => rt.rank != null ? rt : this.makeTensorFromTensorInfo(rt));
         if (r) {
-          const rt = this.getTensorsForGradient(p, f, X);
+          const rt = this.getTensorsForGradient(p, d, X);
           s = this.saveTensorsForBackwardMode(rt);
         }
         return X;
       };
     } else {
-      const { forwardFunc: p } = t, f = (w) => {
+      const { forwardFunc: p } = t, d = (w) => {
         r && (s = w.map((I) => this.keep(this.clone(I))));
       };
       i = () => {
         const w = this.backend.numDataIds();
-        c = this.tidy(() => p(this.backend, f));
+        c = this.tidy(() => p(this.backend, d));
         const I = Array.isArray(c) ? c : [c];
         return this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(l, w, I), I;
       };
     }
-    const { inputs: u, attrs: h } = t, d = bt(t) ? null : t.backwardsFunc;
+    const { inputs: u, attrs: h } = t, f = wt(t) ? null : t.backwardsFunc;
     let m;
     return this.scopedRun(
       // Stop recording to a tape when running a kernel.
       () => this.state.kernelDepth++,
       () => this.state.kernelDepth--,
       () => {
-        !this.ENV.getBool("DEBUG") && !this.state.profiling ? e = i() : (m = this.profiler.profileKernel(l, u, () => i()), this.ENV.getBool("DEBUG") && this.profiler.logKernelProfile(m), e = m.outputs);
+        !this.ENV.getBool("DEBUG") && !this.state.profiling ? n = i() : (m = this.profiler.profileKernel(l, u, () => i()), this.ENV.getBool("DEBUG") && this.profiler.logKernelProfile(m), n = m.outputs);
       }
-    ), r && this.addTapeNode(l, u, e, d, s, h), this.state.profiling && this.state.activeProfile.kernels.push({
+    ), r && this.addTapeNode(l, u, n, f, s, h), this.state.profiling && this.state.activeProfile.kernels.push({
       name: l,
       bytesAdded: this.state.numBytes - a,
       totalBytesSnapshot: this.state.numBytes,
       tensorsAdded: this.state.numTensors - o,
       totalTensorsSnapshot: this.state.numTensors,
       inputShapes: Object.keys(u).map((p) => u[p] != null ? u[p].shape : null),
-      outputShapes: e.map((p) => p.shape),
+      outputShapes: n.map((p) => p.shape),
       kernelTimeMs: m.timeMs,
       extraInfo: m.extraInfo
-    }), Array.isArray(c) ? e : e[0];
+    }), Array.isArray(c) ? n : n[0];
   }
   /**
    * Saves tensors used in forward mode for use in backward mode.
@@ -1565,12 +1623,12 @@ class et {
    * @param inputs a map of input tensors.
    * @param outputs an array of output tensors from forward mode of kernel.
    */
-  getTensorsForGradient(t, e, s) {
-    const r = zt(t);
+  getTensorsForGradient(t, n, s) {
+    const r = Vt(t);
     if (r != null) {
       const a = r.inputsToSave || [], o = r.outputsToSave || [];
       let i;
-      r.saveAllInputs ? (y(Array.isArray(e), () => "saveAllInputs is true, expected inputs to be an array."), i = Object.keys(e).map((l) => e[l])) : i = a.map((l) => e[l]);
+      r.saveAllInputs ? (y(Array.isArray(n), () => "saveAllInputs is true, expected inputs to be an array."), i = Object.keys(n).map((l) => n[l])) : i = a.map((l) => n[l]);
       const c = s.filter((l, u) => o[u]);
       return i.concat(c);
     }
@@ -1581,15 +1639,15 @@ class et {
    * tensor with the provided shape, dtype and values. It always
    * creates a new data id and writes the values to the underlying backend.
    */
-  makeTensor(t, e, s, r) {
+  makeTensor(t, n, s, r) {
     if (t == null)
       throw new Error("Values passed to engine.makeTensor() are null");
     s = s || "float32", r = r || this.backend;
     let a = t;
-    s === "string" && Dt(t[0]) && (a = t.map((c) => nn(c)));
-    const o = r.write(a, e, s), i = new D(e, s, o, this.nextTensorId());
+    s === "string" && Dt(t[0]) && (a = t.map((c) => ue(c)));
+    const o = r.write(a, n, s), i = new D(n, s, o, this.nextTensorId());
     if (this.trackTensor(i, r), s === "string") {
-      const c = this.state.tensorInfo.get(o), l = xe(a);
+      const c = this.state.tensorInfo.get(o), l = Le(a);
       this.state.numBytes += l - c.bytes, c.bytes = l;
     }
     return i;
@@ -1600,9 +1658,9 @@ class et {
    * a new data id, only increments the ref count used in memory tracking.
    * @deprecated
    */
-  makeTensorFromDataId(t, e, s, r) {
+  makeTensorFromDataId(t, n, s, r) {
     s = s || "float32";
-    const a = { dataId: t, shape: e, dtype: s };
+    const a = { dataId: t, shape: n, dtype: s };
     return this.makeTensorFromTensorInfo(a, r);
   }
   /**
@@ -1610,52 +1668,52 @@ class et {
    * around an existing data id in TensorInfo. It doesn't create a new data id,
    * only increments the ref count used in memory tracking.
    */
-  makeTensorFromTensorInfo(t, e) {
+  makeTensorFromTensorInfo(t, n) {
     const { dataId: s, shape: r, dtype: a } = t, o = new D(r, a, s, this.nextTensorId());
-    return this.trackTensor(o, e), o;
+    return this.trackTensor(o, n), o;
   }
-  makeVariable(t, e = !0, s, r) {
+  makeVariable(t, n = !0, s, r) {
     s = s || this.nextVariableId().toString(), r != null && r !== t.dtype && (t = t.cast(r));
-    const a = new ft(t, e, s, this.nextTensorId());
+    const a = new gt(t, n, s, this.nextTensorId());
     if (this.state.registeredVariables[a.name] != null)
       throw new Error(`Variable with name ${a.name} was already registered`);
     return this.state.registeredVariables[a.name] = a, this.incRef(a, this.backend), a;
   }
-  trackTensor(t, e) {
+  trackTensor(t, n) {
     this.state.numTensors++, t.dtype === "string" && this.state.numStringTensors++;
     let s = 0;
-    t.dtype !== "complex64" && t.dtype !== "string" && (s = t.size * St(t.dtype)), this.state.numBytes += s, this.state.tensorInfo.has(t.dataId) || (this.state.numDataBuffers++, this.state.tensorInfo.set(t.dataId, {
-      backend: e || this.backend,
+    t.dtype !== "complex64" && t.dtype !== "string" && (s = t.size * kt(t.dtype)), this.state.numBytes += s, this.state.tensorInfo.has(t.dataId) || (this.state.numDataBuffers++, this.state.tensorInfo.set(t.dataId, {
+      backend: n || this.backend,
       dtype: t.dtype,
       shape: t.shape,
       bytes: s
-    })), t instanceof ft || this.track(t);
+    })), t instanceof gt || this.track(t);
   }
   // Track the tensor by dataId and increase the refCount for the dataId in the
   // backend.
   // TODO(pyu10055): This is currently used by makeVariable method, to increase
   // refCount on the backend for the dataId. It can potentially be replaced with
   // Identity op indead of calling backend directly.
-  incRef(t, e) {
-    this.trackTensor(t, e), this.backend.incRef(t.dataId);
+  incRef(t, n) {
+    this.trackTensor(t, n), this.backend.incRef(t.dataId);
   }
-  removeDataId(t, e) {
-    this.state.tensorInfo.has(t) && this.state.tensorInfo.get(t).backend === e && (this.state.tensorInfo.delete(t), this.state.numDataBuffers--);
+  removeDataId(t, n) {
+    this.state.tensorInfo.has(t) && this.state.tensorInfo.get(t).backend === n && (this.state.tensorInfo.delete(t), this.state.numDataBuffers--);
   }
   disposeTensor(t) {
     if (!this.state.tensorInfo.has(t.dataId))
       return;
-    const e = this.state.tensorInfo.get(t.dataId);
-    if (this.state.numTensors--, t.dtype === "string" && (this.state.numStringTensors--, this.state.numBytes -= e.bytes), t.dtype !== "complex64" && t.dtype !== "string") {
-      const s = t.size * St(t.dtype);
+    const n = this.state.tensorInfo.get(t.dataId);
+    if (this.state.numTensors--, t.dtype === "string" && (this.state.numStringTensors--, this.state.numBytes -= n.bytes), t.dtype !== "complex64" && t.dtype !== "string") {
+      const s = t.size * kt(t.dtype);
       this.state.numBytes -= s;
     }
-    e.backend.disposeData(t.dataId) && this.removeDataId(t.dataId, e.backend);
+    n.backend.disposeData(t.dataId) && this.removeDataId(t.dataId, n.backend);
   }
   disposeVariables() {
     for (const t in this.state.registeredVariables) {
-      const e = this.state.registeredVariables[t];
-      this.disposeVariable(e);
+      const n = this.state.registeredVariables[t];
+      this.disposeVariable(n);
     }
   }
   disposeVariable(t) {
@@ -1667,8 +1725,8 @@ class et {
   }
   async profile(t) {
     this.state.profiling = !0;
-    const e = this.state.numBytes, s = this.state.numTensors;
-    this.state.activeProfile.kernels = [], this.state.activeProfile.result = await t(), this.state.profiling = !1, this.state.activeProfile.peakBytes = Math.max(...this.state.activeProfile.kernels.map((r) => r.totalBytesSnapshot)), this.state.activeProfile.newBytes = this.state.numBytes - e, this.state.activeProfile.newTensors = this.state.numTensors - s;
+    const n = this.state.numBytes, s = this.state.numTensors;
+    this.state.activeProfile.kernels = [], this.state.activeProfile.result = await t(), this.state.profiling = !1, this.state.activeProfile.peakBytes = Math.max(...this.state.activeProfile.kernels.map((r) => r.totalBytesSnapshot)), this.state.activeProfile.newBytes = this.state.numBytes - n, this.state.activeProfile.newTensors = this.state.numTensors - s;
     for (const r of this.state.activeProfile.kernels)
       r.kernelTimeMs = await r.kernelTimeMs, r.extraInfo = await r.extraInfo;
     return this.state.activeProfile;
@@ -1676,12 +1734,12 @@ class et {
   isTapeOn() {
     return this.state.gradientDepth > 0 && this.state.kernelDepth === 0;
   }
-  addTapeNode(t, e, s, r, a, o) {
-    const i = { id: this.state.nextTapeNodeId++, kernelName: t, inputs: e, outputs: s, saved: a }, c = zt(t);
+  addTapeNode(t, n, s, r, a, o) {
+    const i = { id: this.state.nextTapeNodeId++, kernelName: t, inputs: n, outputs: s, saved: a }, c = Vt(t);
     c != null && (r = c.gradFunc), r != null && (i.gradient = (l) => (l = l.map((u, h) => {
       if (u == null) {
-        const d = s[h], m = te(d.size, d.dtype);
-        return this.makeTensor(m, d.shape, d.dtype);
+        const f = s[h], m = ne(f.size, f.dtype);
+        return this.makeTensor(m, f.shape, f.dtype);
       }
       return u;
     }), r(l.length > 1 ? l : l[0], a, o))), this.state.activeTape.push(i);
@@ -1700,25 +1758,25 @@ class et {
    * as scope() without the need for a function closure.
    */
   startScope(t) {
-    const e = {
+    const n = {
       track: [],
       name: "unnamed scope",
       id: this.state.nextScopeId++
     };
-    t && (e.name = t), this.state.scopeStack.push(e), this.state.activeScope = e;
+    t && (n.name = t), this.state.scopeStack.push(n), this.state.activeScope = n;
   }
   /**
    * End a scope. Use this with startScope() to achieve the same functionality
    * as scope() without the need for a function closure.
    */
   endScope(t) {
-    const e = fe(t), s = new Set(e.map((a) => a.id));
+    const n = pe(t), s = new Set(n.map((a) => a.id));
     for (let a = 0; a < this.state.activeScope.track.length; a++) {
       const o = this.state.activeScope.track[a];
       !o.kept && !s.has(o.id) && o.dispose();
     }
     const r = this.state.scopeStack.pop();
-    this.state.activeScope = this.state.scopeStack.length === 0 ? null : this.state.scopeStack[this.state.scopeStack.length - 1], e.forEach((a) => {
+    this.state.activeScope = this.state.scopeStack.length === 0 ? null : this.state.scopeStack[this.state.scopeStack.length - 1], n.forEach((a) => {
       !a.kept && a.scopeId === r.id && this.track(a);
     });
   }
@@ -1728,25 +1786,25 @@ class et {
    * was not a function of that `x`. It also takes optional dy to multiply the
    * gradient, which defaults to `1`.
    */
-  gradients(t, e, s, r = !1) {
-    if (y(e.length > 0, () => "gradients() received an empty list of xs."), s != null && s.dtype !== "float32")
+  gradients(t, n, s, r = !1) {
+    if (y(n.length > 0, () => "gradients() received an empty list of xs."), s != null && s.dtype !== "float32")
       throw new Error(`dy must have 'float32' dtype, but has '${s.dtype}'`);
     const a = this.scopedRun(() => this.startTape(), () => this.endTape(), () => this.tidy("forward", t));
     y(a instanceof D, () => "The result y returned by f() must be a tensor.");
-    const o = on(this.state.activeTape, e, a);
-    if (!r && o.length === 0 && e.length > 0)
+    const o = ln(this.state.activeTape, n, a);
+    if (!r && o.length === 0 && n.length > 0)
       throw new Error("Cannot compute gradient of y=f(x) with respect to x. Make sure that the f you passed encloses all operations that lead from x to y.");
     return this.tidy("backward", () => {
       const i = {};
-      i[a.id] = s ?? yn(a.shape), cn(
+      i[a.id] = s ?? bn(a.shape), un(
         i,
         o,
         // Pass the tidy function to avoid circular dep with `tape.ts`.
         (l) => this.tidy(l),
         // Pass an add function to avoide a circular dep with `tape.ts`.
-        bn
+        wn
       );
-      const c = e.map((l) => i[l.id]);
+      const c = n.map((l) => i[l.id]);
       return this.state.gradientDepth === 0 && (this.state.activeTape.forEach((l) => {
         for (const u of l.saved)
           u.dispose();
@@ -1754,19 +1812,19 @@ class et {
     });
   }
   customGrad(t) {
-    return y(kt(t), () => "The f passed in customGrad(f) must be a function."), (...e) => {
-      y(e.every((i) => i instanceof D), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
+    return y(ht(t), () => "The f passed in customGrad(f) must be a function."), (...n) => {
+      y(n.every((i) => i instanceof D), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
       let s;
       const r = {};
-      e.forEach((i, c) => {
+      n.forEach((i, c) => {
         r[c] = i;
       });
-      const a = (i, c) => (s = t(...e, c), y(s.value instanceof D, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), y(kt(s.gradFunc), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function."), s.value), o = (i, c) => {
+      const a = (i, c) => (s = t(...n, c), y(s.value instanceof D, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), y(ht(s.gradFunc), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function."), s.value), o = (i, c) => {
         const l = s.gradFunc(i, c), u = Array.isArray(l) ? l : [l];
-        y(u.length === e.length, () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns the same number of tensors as inputs passed to f(...)."), y(u.every((d) => d instanceof D), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns a list of only tensors.");
+        y(u.length === n.length, () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns the same number of tensors as inputs passed to f(...)."), y(u.every((f) => f instanceof D), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns a list of only tensors.");
         const h = {};
-        return u.forEach((d, m) => {
-          h[m] = () => d;
+        return u.forEach((f, m) => {
+          h[m] = () => f;
         }), h;
       };
       return this.runKernelFunc({
@@ -1782,12 +1840,12 @@ class et {
   read(t) {
     return this.state.tensorInfo.get(t).backend.read(t);
   }
-  readToGPU(t, e) {
-    return this.state.tensorInfo.get(t).backend.readToGPU(t, e);
+  readToGPU(t, n) {
+    return this.state.tensorInfo.get(t).backend.readToGPU(t, n);
   }
   async time(t) {
-    const e = dt(), s = await this.backend.time(t);
-    return s.wallMs = dt() - e, s;
+    const n = dt(), s = await this.backend.time(t);
+    return s.wallMs = dt() - n, s;
   }
   /**
    * Tracks a Tensor in the current scope to be automatically cleaned up
@@ -1806,7 +1864,7 @@ class et {
    * registered backend factories.
    */
   reset() {
-    this.pendingBackendInitId++, this.state.dispose(), this.ENV.reset(), this.state = new qt();
+    this.pendingBackendInitId++, this.state.dispose(), this.ENV.reset(), this.state = new Ht();
     for (const t in this.registry)
       this.disposeRegisteredKernels(t), this.registry[t].dispose(), delete this.registry[t];
     this.backendName = null, this.backendInstance = null, this.pendingBackendInit = null;
@@ -1814,22 +1872,22 @@ class et {
 }
 et.nextTensorId = 0;
 et.nextVariableId = 0;
-function yn(n) {
-  const t = Le(z(n), "float32");
-  return g.makeTensor(t, n, "float32");
+function bn(e) {
+  const t = Ge(z(e), "float32");
+  return g.makeTensor(t, e, "float32");
 }
-function me() {
-  const n = ne();
-  if (n._tfengine == null) {
-    const t = new Oe(n);
-    n._tfengine = new et(t);
+function be() {
+  const e = re();
+  if (e._tfengine == null) {
+    const t = new Ue(e);
+    e._tfengine = new et(t);
   }
-  return ze(n._tfengine.ENV), dn(() => n._tfengine), n._tfengine;
+  return je(e._tfengine.ENV), gn(() => e._tfengine), e._tfengine;
 }
-const g = me();
-function bn(n, t) {
-  const e = { a: n, b: t };
-  return g.runKernel(se, e);
+const g = be();
+function wn(e, t) {
+  const n = { a: e, b: t };
+  return g.runKernel(ae, n);
 }
 /**
  * @license
@@ -1847,15 +1905,15 @@ function bn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function wn() {
+function Sn() {
   return typeof window < "u" && window.document != null || //@ts-ignore
   typeof WorkerGlobalScope < "u";
 }
 const B = k();
-B.registerFlag("DEBUG", () => !1, (n) => {
-  n && console.warn("Debugging mode is ON. The output of every math call will be downloaded to CPU and checked for NaNs. This significantly impacts performance.");
+B.registerFlag("DEBUG", () => !1, (e) => {
+  e && console.warn("Debugging mode is ON. The output of every math call will be downloaded to CPU and checked for NaNs. This significantly impacts performance.");
 });
-B.registerFlag("IS_BROWSER", () => wn());
+B.registerFlag("IS_BROWSER", () => Sn());
 B.registerFlag("IS_NODE", () => typeof Z < "u" && typeof Z.versions < "u" && typeof Z.versions.node < "u");
 B.registerFlag("IS_CHROME", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Chrome/.test(navigator.userAgent) && /Google Inc/.test(navigator.vendor));
 B.registerFlag("IS_SAFARI", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Safari/.test(navigator.userAgent) && /Apple/.test(navigator.vendor));
@@ -1883,57 +1941,57 @@ B.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
  * limitations under the License.
  * =============================================================================
  */
-function Sn(n, t) {
-  let e = n;
-  if (R(n))
-    return t === "string" ? [] : [n.length];
-  if (he(n)) {
-    const r = n.channels || "RGBA";
-    return [n.height, n.width * r.length];
-  } else if (de(n))
-    return [n.buffer.size / (t == null ? 4 : St(t))];
-  if (!Array.isArray(n))
+function kn(e, t) {
+  let n = e;
+  if (F(e))
+    return t === "string" ? [] : [e.length];
+  if (ge(e)) {
+    const r = e.channels || "RGBA";
+    return [e.height, e.width * r.length];
+  } else if (me(e))
+    return [e.buffer.size / (t == null ? 4 : kt(t))];
+  if (!Array.isArray(e))
     return [];
   const s = [];
-  for (; Array.isArray(e) || R(e) && t !== "string"; )
-    s.push(e.length), e = e[0];
-  return Array.isArray(n) && k().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && pe(n, s, []), s;
+  for (; Array.isArray(n) || F(n) && t !== "string"; )
+    s.push(n.length), n = n[0];
+  return Array.isArray(e) && k().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && we(e, s, []), s;
 }
-function pe(n, t, e) {
-  if (e = e || [], !Array.isArray(n) && !R(n)) {
-    y(t.length === 0, () => `Element arr[${e.join("][")}] is a primitive, but should be an array/TypedArray of ${t[0]} elements`);
+function we(e, t, n) {
+  if (n = n || [], !Array.isArray(e) && !F(e)) {
+    y(t.length === 0, () => `Element arr[${n.join("][")}] is a primitive, but should be an array/TypedArray of ${t[0]} elements`);
     return;
   }
-  y(t.length > 0, () => `Element arr[${e.join("][")}] should be a primitive, but is an array of ${n.length} elements`), y(n.length === t[0], () => `Element arr[${e.join("][")}] should have ${t[0]} elements, but has ${n.length} elements`);
+  y(t.length > 0, () => `Element arr[${n.join("][")}] should be a primitive, but is an array of ${e.length} elements`), y(e.length === t[0], () => `Element arr[${n.join("][")}] should have ${t[0]} elements, but has ${e.length} elements`);
   const s = t.slice(1);
-  for (let r = 0; r < n.length; ++r)
-    pe(n[r], s, e.concat(r));
+  for (let r = 0; r < e.length; ++r)
+    we(e[r], s, n.concat(r));
 }
-function Ht(n, t, e, s) {
-  if (n !== "string_or_numeric") {
-    if (n == null)
+function Jt(e, t, n, s) {
+  if (e !== "string_or_numeric") {
+    if (e == null)
       throw new Error("Expected dtype cannot be null.");
-    if (n !== "numeric" && n !== t || n === "numeric" && t === "string")
-      throw new Error(`Argument '${e}' passed to '${s}' must be ${n} tensor, but got ${t} tensor`);
+    if (e !== "numeric" && e !== t || e === "numeric" && t === "string")
+      throw new Error(`Argument '${n}' passed to '${s}' must be ${e} tensor, but got ${t} tensor`);
   }
 }
-function T(n, t, e, s = "numeric") {
-  if (n instanceof ue())
-    return Ht(s, n.dtype, t, e), n;
-  let r = mt(n);
-  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Ht(s, r, t, e), n == null || !R(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string") {
-    const c = n == null ? "null" : n.constructor.name;
-    throw new Error(`Argument '${t}' passed to '${e}' must be a Tensor or TensorLike, but got '${c}'`);
+function T(e, t, n, s = "numeric") {
+  if (e instanceof fe())
+    return Jt(s, e.dtype, t, n), e;
+  let r = pt(e);
+  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Jt(s, r, t, n), e == null || !F(e) && !Array.isArray(e) && typeof e != "number" && typeof e != "boolean" && typeof e != "string") {
+    const c = e == null ? "null" : e.constructor.name;
+    throw new Error(`Argument '${t}' passed to '${n}' must be a Tensor or TensorLike, but got '${c}'`);
   }
-  const a = Sn(n, r);
-  !R(n) && !Array.isArray(n) && (n = [n]);
-  const i = r !== "string" ? ce(n, r) : ct(n, [], !0);
+  const a = kn(e, r);
+  !F(e) && !Array.isArray(e) && (e = [e]);
+  const i = r !== "string" ? Lt(e, r) : ct(e, [], !0);
   return g.makeTensor(i, a, r);
 }
-function ro(n, t, e, s = "numeric") {
-  if (!Array.isArray(n))
-    throw new Error(`Argument ${t} passed to ${e} must be a \`Tensor[]\` or \`TensorLike[]\``);
-  return n.map((a, o) => T(a, `${t}[${o}]`, e, s));
+function In(e, t, n, s = "numeric") {
+  if (!Array.isArray(e))
+    throw new Error(`Argument ${t} passed to ${n} must be a \`Tensor[]\` or \`TensorLike[]\``);
+  return e.map((a, o) => T(a, `${t}[${o}]`, n, s));
 }
 /**
  * @license
@@ -1951,16 +2009,16 @@ function ro(n, t, e, s = "numeric") {
  * limitations under the License.
  * =============================================================================
  */
-const kn = "__op";
-function N(n) {
-  const t = Object.keys(n);
+const Tn = "__op";
+function N(e) {
+  const t = Object.keys(e);
   if (t.length !== 1)
     throw new Error(`Please provide an object with a single key (operation name) mapping to a function. Got an object with ${t.length} keys.`);
-  let e = t[0];
-  const s = n[e];
-  e.endsWith("_") && (e = e.substring(0, e.length - 1)), e = e + kn;
+  let n = t[0];
+  const s = e[n];
+  n.endsWith("_") && (n = n.substring(0, n.length - 1)), n = n + Tn;
   const r = (...a) => {
-    g.startScope(e);
+    g.startScope(n);
     try {
       const o = s(...a);
       return Ct(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
@@ -1968,7 +2026,7 @@ function N(n) {
       throw g.endScope(null), o;
     }
   };
-  return Object.defineProperty(r, "name", { value: e, configurable: !0 }), r;
+  return Object.defineProperty(r, "name", { value: n, configurable: !0 }), r;
 }
 /**
  * @license
@@ -1986,28 +2044,28 @@ function N(n) {
  * limitations under the License.
  * =============================================================================
  */
-function In(n, t, e, s) {
+function En(e, t, n, s) {
   if (s == null)
-    s = mt(n);
+    s = pt(e);
   else if (s === "complex64")
     throw new Error("Cannot construct a complex64 tensor directly. Please use tf.complex(real, imag).");
-  if (de(n) || he(n)) {
+  if (me(e) || ge(e)) {
     if (s !== "float32" && s !== "int32")
       throw new Error(`Creating tensor from GPU data only supports 'float32'|'int32' dtype, while the dtype is ${s}.`);
-    return g.backend.createTensorFromGPUData(n, t || e, s);
+    return g.backend.createTensorFromGPUData(e, t || n, s);
   }
-  if (!R(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string")
+  if (!F(e) && !Array.isArray(e) && typeof e != "number" && typeof e != "boolean" && typeof e != "string")
     throw new Error("values passed to tensor(values) must be a number/boolean/string or an array of numbers/booleans/strings, or a TypedArray");
   if (t != null) {
     xt(t);
-    const r = z(t), a = z(e);
+    const r = z(t), a = z(n);
     y(r === a, () => `Based on the provided shape, [${t}], the tensor should have ${r} values but has ${a}`);
-    for (let o = 0; o < e.length; ++o) {
-      const i = e[o], c = o === e.length - 1 ? i !== z(t.slice(o)) : !0;
-      y(e[o] === t[o] || !c, () => `Error creating a new Tensor. Inferred shape (${e}) does not match the provided shape (${t}). `);
+    for (let o = 0; o < n.length; ++o) {
+      const i = n[o], c = o === n.length - 1 ? i !== z(t.slice(o)) : !0;
+      y(n[o] === t[o] || !c, () => `Error creating a new Tensor. Inferred shape (${n}) does not match the provided shape (${t}). `);
     }
   }
-  return !R(n) && !Array.isArray(n) && (n = [n]), t = t || e, n = s !== "string" ? ce(n, s) : ct(n, [], !0), g.makeTensor(n, t, s);
+  return !F(e) && !Array.isArray(e) && (e = [e]), t = t || n, e = s !== "string" ? Lt(e, s) : ct(e, [], !0), g.makeTensor(e, t, s);
 }
 class st {
   /**
@@ -2021,31 +2079,31 @@ class st {
     return new st(t).slice();
   }
   constructor(t) {
-    if (this.shards = [], this.previousShardIndex = 0, t == null || (t instanceof Array || (t = [t]), t = t.map((s) => R(s) ? s.buffer : s), t.length === 0))
+    if (this.shards = [], this.previousShardIndex = 0, t == null || (t instanceof Array || (t = [t]), t = t.map((s) => F(s) ? s.buffer : s), t.length === 0))
       return;
     this.bufferUniformSize = t[0].byteLength;
-    let e = 0;
+    let n = 0;
     for (let s = 0; s < t.length; s++) {
       const r = t[s];
       s !== t.length - 1 && r.byteLength !== this.bufferUniformSize && (this.bufferUniformSize = void 0);
-      const a = e + r.byteLength;
-      this.shards.push({ buffer: r, start: e, end: a }), e = a;
+      const a = n + r.byteLength;
+      this.shards.push({ buffer: r, start: n, end: a }), n = a;
     }
     this.shards.length === 0 && (this.byteLength = 0), this.byteLength = this.shards[this.shards.length - 1].end;
   }
-  slice(t = 0, e = this.byteLength) {
+  slice(t = 0, n = this.byteLength) {
     if (this.shards.length === 0)
       return new ArrayBuffer(0);
-    if (t = isNaN(Number(t)) ? 0 : t, e = isNaN(Number(e)) ? 0 : e, t = Math.max(0, t), e = Math.min(this.byteLength, e), e <= t)
+    if (t = isNaN(Number(t)) ? 0 : t, n = isNaN(Number(n)) ? 0 : n, t = Math.max(0, t), n = Math.min(this.byteLength, n), n <= t)
       return new ArrayBuffer(0);
     const s = this.findShardForByte(t);
     if (s === -1)
       throw new Error(`Could not find start shard for byte ${t}`);
-    const r = e - t, a = new ArrayBuffer(r), o = new Uint8Array(a);
+    const r = n - t, a = new ArrayBuffer(r), o = new Uint8Array(a);
     let i = 0;
     for (let c = s; c < this.shards.length; c++) {
-      const l = this.shards[c], h = t + i - l.start, d = i, p = Math.min(e, l.end) - l.start, f = new Uint8Array(l.buffer, h, p - h);
-      if (o.set(f, d), i += f.length, e < l.end)
+      const l = this.shards[c], h = t + i - l.start, f = i, p = Math.min(n, l.end) - l.start, d = new Uint8Array(l.buffer, h, p - h);
+      if (o.set(d, f), i += d.length, n < l.end)
         break;
     }
     return a;
@@ -2058,22 +2116,22 @@ class st {
       return -1;
     if (this.bufferUniformSize != null)
       return this.previousShardIndex = Math.floor(t / this.bufferUniformSize), this.previousShardIndex;
-    function e(r) {
+    function n(r) {
       return t < r.start ? -1 : t >= r.end ? 1 : 0;
     }
-    if (e(this.shards[this.previousShardIndex]) === 0)
+    if (n(this.shards[this.previousShardIndex]) === 0)
       return this.previousShardIndex;
-    const s = Tn(this.shards, e);
+    const s = An(this.shards, n);
     return s === -1 ? -1 : (this.previousShardIndex = s, this.previousShardIndex);
   }
 }
-function Tn(n, t) {
-  let e = 0, s = n.length;
-  for (; e <= s; ) {
-    const r = Math.floor((s - e) / 2) + e, a = t(n[r]);
+function An(e, t) {
+  let n = 0, s = e.length;
+  for (; n <= s; ) {
+    const r = Math.floor((s - n) / 2) + n, a = t(e[r]);
     if (a === 0)
       return r;
-    a < 0 ? s = r : e = r + 1;
+    a < 0 ? s = r : n = r + 1;
   }
   return -1;
 }
@@ -2093,103 +2151,103 @@ function Tn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ao() {
+function go() {
   g.disposeVariables();
 }
-function oo() {
+function mo() {
   return g;
 }
-function io() {
+function po() {
   return g.memory();
 }
-function E(n, t) {
-  return g.tidy(n, t);
+function E(e, t) {
+  return g.tidy(e, t);
 }
-function M(n) {
-  fe(n).forEach((e) => e.dispose());
+function M(e) {
+  pe(e).forEach((n) => n.dispose());
 }
-function En(n) {
-  return g.keep(n);
+function Bn(e) {
+  return g.keep(e);
 }
-function co() {
+function yo() {
   return g.backend;
 }
-const Jt = 4;
-async function lo(n, t) {
-  const e = [], s = [], r = Array.isArray(n) ? n.map((o) => o.name) : Object.keys(n);
+const Xt = 4;
+async function bo(e, t) {
+  const n = [], s = [], r = Array.isArray(e) ? e.map((o) => o.name) : Object.keys(e);
   for (let o = 0; o < r.length; ++o) {
-    const i = r[o], c = Array.isArray(n) ? n[o].tensor : n[i];
+    const i = r[o], c = Array.isArray(e) ? e[o].tensor : e[i];
     if (c.dtype !== "float32" && c.dtype !== "int32" && c.dtype !== "bool" && c.dtype !== "string" && c.dtype !== "complex64")
       throw new Error(`Unsupported dtype in weight '${i}': ${c.dtype}`);
     const l = { name: i, shape: c.shape, dtype: c.dtype };
     if (c.dtype === "string") {
       const u = new Promise(async (h) => {
-        const d = await c.bytes(), m = d.reduce((w, I) => w + I.length, 0) + Jt * d.length, p = new Uint8Array(m);
-        let f = 0;
-        for (let w = 0; w < d.length; w++) {
-          const I = d[w], O = new Uint8Array(new Uint32Array([I.length]).buffer);
-          p.set(O, f), f += Jt, p.set(I, f), f += I.length;
+        const f = await c.bytes(), m = f.reduce((w, I) => w + I.length, 0) + Xt * f.length, p = new Uint8Array(m);
+        let d = 0;
+        for (let w = 0; w < f.length; w++) {
+          const I = f[w], _ = new Uint8Array(new Uint32Array([I.length]).buffer);
+          p.set(_, d), d += Xt, p.set(I, d), d += I.length;
         }
         h(p);
       });
       s.push(u);
     } else
       s.push(c.data());
-    t != null && (l.group = t), e.push(l);
+    t != null && (l.group = t), n.push(l);
   }
   const a = await Promise.all(s);
-  return { data: An(a), specs: e };
+  return { data: vn(a), specs: n };
 }
-function An(n) {
-  if (n === null)
-    throw new Error(`Invalid input value: ${JSON.stringify(n)}`);
+function vn(e) {
+  if (e === null)
+    throw new Error(`Invalid input value: ${JSON.stringify(e)}`);
   let t = 0;
-  const e = [];
-  n.forEach((a) => {
-    if (t += a.byteLength, e.push(a.byteLength === a.buffer.byteLength ? a : new a.constructor(a)), !(a instanceof Float32Array || a instanceof Int32Array || a instanceof Uint8Array))
+  const n = [];
+  e.forEach((a) => {
+    if (t += a.byteLength, n.push(a.byteLength === a.buffer.byteLength ? a : new a.constructor(a)), !(a instanceof Float32Array || a instanceof Int32Array || a instanceof Uint8Array))
       throw new Error(`Unsupported TypedArray subtype: ${a.constructor.name}`);
   });
   const s = new Uint8Array(t);
   let r = 0;
-  return e.forEach((a) => {
+  return n.forEach((a) => {
     s.set(new Uint8Array(a.buffer), r), r += a.byteLength;
   }), s.buffer;
 }
-const Lt = typeof gt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
-function Xt(n) {
-  return Lt ? gt.byteLength(n, "utf8") : new Blob([n]).size;
+const _t = typeof mt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
+function Yt(e) {
+  return _t ? mt.byteLength(e, "utf8") : new Blob([e]).size;
 }
-function Bn(n) {
-  if (Lt)
-    return gt.from(n).toString("base64");
-  const t = new Uint8Array(n);
-  let e = "";
+function Mn(e) {
+  if (_t)
+    return mt.from(e).toString("base64");
+  const t = new Uint8Array(e);
+  let n = "";
   for (let s = 0, r = t.length; s < r; s++)
-    e += String.fromCharCode(t[s]);
-  return btoa(e);
+    n += String.fromCharCode(t[s]);
+  return btoa(n);
 }
-function vn(n) {
-  if (Lt) {
-    const s = gt.from(n, "base64");
+function Nn(e) {
+  if (_t) {
+    const s = mt.from(e, "base64");
     return s.buffer.slice(s.byteOffset, s.byteOffset + s.byteLength);
   }
-  const t = atob(n), e = new Uint8Array(t.length);
+  const t = atob(e), n = new Uint8Array(t.length);
   for (let s = 0; s < t.length; ++s)
-    e.set([t.charCodeAt(s)], s);
-  return e.buffer;
+    n.set([t.charCodeAt(s)], s);
+  return n.buffer;
 }
-function uo(n) {
-  return st.join(n);
+function wo(e) {
+  return st.join(e);
 }
-function ye(n) {
-  if (n.modelTopology instanceof ArrayBuffer)
+function Se(e) {
+  if (e.modelTopology instanceof ArrayBuffer)
     throw new Error("Expected JSON model topology, received ArrayBuffer.");
   return {
     dateSaved: /* @__PURE__ */ new Date(),
     modelTopologyType: "JSON",
-    modelTopologyBytes: n.modelTopology == null ? 0 : Xt(JSON.stringify(n.modelTopology)),
-    weightSpecsBytes: n.weightSpecs == null ? 0 : Xt(JSON.stringify(n.weightSpecs)),
-    weightDataBytes: n.weightData == null ? 0 : new st(n.weightData).byteLength
+    modelTopologyBytes: e.modelTopology == null ? 0 : Yt(JSON.stringify(e.modelTopology)),
+    weightSpecsBytes: e.weightSpecs == null ? 0 : Yt(JSON.stringify(e.weightSpecs)),
+    weightDataBytes: e.weightData == null ? 0 : new st(e.weightData).byteLength
   };
 }
 /**
@@ -2252,18 +2310,18 @@ class A {
    * @returns All valid handlers for `url`, given the currently registered
    *   handler routers.
    */
-  static getLoadHandlers(t, e) {
-    return A.getHandlers(t, "load", e);
+  static getLoadHandlers(t, n) {
+    return A.getHandlers(t, "load", n);
   }
-  static getHandlers(t, e, s) {
+  static getHandlers(t, n, s) {
     const r = [];
-    return (e === "load" ? A.getInstance().loadRouters : A.getInstance().saveRouters).forEach((o) => {
+    return (n === "load" ? A.getInstance().loadRouters : A.getInstance().saveRouters).forEach((o) => {
       const i = o(t, s);
       i !== null && r.push(i);
     }), r;
   }
 }
-const ho = (n) => A.getSaveHandlers(n);
+const So = (e) => A.getSaveHandlers(e);
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2280,22 +2338,22 @@ const ho = (n) => A.getSaveHandlers(n);
  * limitations under the License.
  * =============================================================================
  */
-const vt = "tensorflowjs", Mt = 1, G = "models_store", L = "model_info_store";
-function be() {
+const vt = "tensorflowjs", Mt = 1, U = "models_store", L = "model_info_store";
+function ke() {
   if (!k().getBool("IS_BROWSER"))
     throw new Error("Failed to obtain IndexedDB factory because the current environmentis not a web browser.");
-  const n = typeof window > "u" ? self : window, t = n.indexedDB || n.mozIndexedDB || n.webkitIndexedDB || n.msIndexedDB || n.shimIndexedDB;
+  const e = typeof window > "u" ? self : window, t = e.indexedDB || e.mozIndexedDB || e.webkitIndexedDB || e.msIndexedDB || e.shimIndexedDB;
   if (t == null)
     throw new Error("The current browser does not appear to support IndexedDB.");
   return t;
 }
-function Nt(n) {
-  const t = n.result;
-  t.createObjectStore(G, { keyPath: "modelPath" }), t.createObjectStore(L, { keyPath: "modelPath" });
+function Nt(e) {
+  const t = e.result;
+  t.createObjectStore(U, { keyPath: "modelPath" }), t.createObjectStore(L, { keyPath: "modelPath" });
 }
 class W {
   constructor(t) {
-    if (this.indexedDB = be(), t == null || !t)
+    if (this.indexedDB = ke(), t == null || !t)
       throw new Error("For IndexedDB, modelPath must not be null, undefined or empty.");
     this.modelPath = t;
   }
@@ -2321,36 +2379,36 @@ class W {
    * @returns A `Promise` of `SaveResult`, if the action is put, or a `Promise`
    *   of `ModelArtifacts`, if the action is get.
    */
-  databaseAction(t, e) {
+  databaseAction(t, n) {
     return new Promise((s, r) => {
       const a = this.indexedDB.open(vt, Mt);
       a.onupgradeneeded = () => Nt(a), a.onsuccess = () => {
         const o = a.result;
-        if (e == null) {
-          const i = o.transaction(G, "readonly"), l = i.objectStore(G).get(this.modelPath);
+        if (n == null) {
+          const i = o.transaction(U, "readonly"), l = i.objectStore(U).get(this.modelPath);
           l.onsuccess = () => {
             if (l.result == null)
               return o.close(), r(new Error(`Cannot find model with path '${this.modelPath}' in IndexedDB.`));
             s(l.result.modelArtifacts);
           }, l.onerror = (u) => (o.close(), r(l.error)), i.oncomplete = () => o.close();
         } else {
-          e.weightData = st.join(e.weightData);
-          const i = ye(e), c = o.transaction(L, "readwrite");
+          n.weightData = st.join(n.weightData);
+          const i = Se(n), c = o.transaction(L, "readwrite");
           let l = c.objectStore(L), u;
           try {
             u = l.put({ modelPath: this.modelPath, modelArtifactsInfo: i });
-          } catch (d) {
-            return r(d);
+          } catch (f) {
+            return r(f);
           }
           let h;
           u.onsuccess = () => {
-            h = o.transaction(G, "readwrite");
-            const d = h.objectStore(G);
+            h = o.transaction(U, "readwrite");
+            const f = h.objectStore(U);
             let m;
             try {
-              m = d.put({
+              m = f.put({
                 modelPath: this.modelPath,
-                modelArtifacts: e,
+                modelArtifacts: n,
                 modelArtifactsInfo: i
               });
             } catch (p) {
@@ -2358,10 +2416,10 @@ class W {
             }
             m.onsuccess = () => s({ modelArtifactsInfo: i }), m.onerror = (p) => {
               l = c.objectStore(L);
-              const f = l.delete(this.modelPath);
-              f.onsuccess = () => (o.close(), r(m.error)), f.onerror = (w) => (o.close(), r(m.error));
+              const d = l.delete(this.modelPath);
+              d.onsuccess = () => (o.close(), r(m.error)), d.onerror = (w) => (o.close(), r(m.error));
             };
-          }, u.onerror = (d) => (o.close(), r(u.error)), c.oncomplete = () => {
+          }, u.onerror = (f) => (o.close(), r(u.error)), c.oncomplete = () => {
             h == null ? o.close() : h.oncomplete = () => o.close();
           };
         }
@@ -2370,21 +2428,21 @@ class W {
   }
 }
 W.URL_SCHEME = "indexeddb://";
-const we = (n) => k().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(W.URL_SCHEME) ? Mn(n.slice(W.URL_SCHEME.length)) : null;
-A.registerSaveRouter(we);
-A.registerLoadRouter(we);
-function Mn(n) {
-  return new W(n);
+const Ie = (e) => k().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(W.URL_SCHEME) ? Fn(e.slice(W.URL_SCHEME.length)) : null;
+A.registerSaveRouter(Ie);
+A.registerLoadRouter(Ie);
+function Fn(e) {
+  return new W(e);
 }
-function Nn(n) {
-  return n.startsWith(W.URL_SCHEME) ? n.slice(W.URL_SCHEME.length) : n;
+function Rn(e) {
+  return e.startsWith(W.URL_SCHEME) ? e.slice(W.URL_SCHEME.length) : e;
 }
-class Rn {
+class Dn {
   constructor() {
-    this.indexedDB = be();
+    this.indexedDB = ke();
   }
   async listModels() {
-    return new Promise((t, e) => {
+    return new Promise((t, n) => {
       const s = this.indexedDB.open(vt, Mt);
       s.onupgradeneeded = () => Nt(s), s.onsuccess = () => {
         const r = s.result, a = r.transaction(L, "readonly"), i = a.objectStore(L).getAll();
@@ -2393,12 +2451,12 @@ class Rn {
           for (const l of i.result)
             c[l.modelPath] = l.modelArtifactsInfo;
           t(c);
-        }, i.onerror = (c) => (r.close(), e(i.error)), a.oncomplete = () => r.close();
-      }, s.onerror = (r) => e(s.error);
+        }, i.onerror = (c) => (r.close(), n(i.error)), a.oncomplete = () => r.close();
+      }, s.onerror = (r) => n(s.error);
     });
   }
   async removeModel(t) {
-    return t = Nn(t), new Promise((e, s) => {
+    return t = Rn(t), new Promise((n, s) => {
       const r = this.indexedDB.open(vt, Mt);
       r.onupgradeneeded = () => Nt(r), r.onsuccess = () => {
         const a = r.result, o = a.transaction(L, "readwrite"), i = o.objectStore(L), c = i.get(t);
@@ -2408,11 +2466,11 @@ class Rn {
             return a.close(), s(new Error(`Cannot find model with path '${t}' in IndexedDB.`));
           {
             const u = i.delete(t), h = () => {
-              l = a.transaction(G, "readwrite");
-              const m = l.objectStore(G).delete(t);
-              m.onsuccess = () => e(c.result.modelArtifactsInfo), m.onerror = (p) => s(c.error);
+              l = a.transaction(U, "readwrite");
+              const m = l.objectStore(U).delete(t);
+              m.onsuccess = () => n(c.result.modelArtifactsInfo), m.onerror = (p) => s(c.error);
             };
-            u.onsuccess = h, u.onerror = (d) => (h(), a.close(), s(c.error));
+            u.onsuccess = h, u.onerror = (f) => (h(), a.close(), s(c.error));
           }
         }, c.onerror = (u) => (a.close(), s(c.error)), o.oncomplete = () => {
           l == null ? a.close() : l.oncomplete = () => a.close();
@@ -2437,28 +2495,28 @@ class Rn {
  * limitations under the License.
  * =============================================================================
  */
-const P = "/", Q = "tensorflowjs_models", Se = "info", Fn = "model_topology", Dn = "weight_specs", $n = "weight_data", xn = "model_metadata";
-function ke(n) {
+const P = "/", Q = "tensorflowjs_models", Te = "info", $n = "model_topology", xn = "weight_specs", Cn = "weight_data", Pn = "model_metadata";
+function Ee(e) {
   return {
-    info: [Q, n, Se].join(P),
-    topology: [Q, n, Fn].join(P),
-    weightSpecs: [Q, n, Dn].join(P),
-    weightData: [Q, n, $n].join(P),
-    modelMetadata: [Q, n, xn].join(P)
+    info: [Q, e, Te].join(P),
+    topology: [Q, e, $n].join(P),
+    weightSpecs: [Q, e, xn].join(P),
+    weightData: [Q, e, Cn].join(P),
+    modelMetadata: [Q, e, Pn].join(P)
   };
 }
-function Ie(n) {
-  for (const t of Object.values(n))
+function Ae(e) {
+  for (const t of Object.values(e))
     window.localStorage.removeItem(t);
 }
-function Cn(n) {
-  const t = n.split(P);
+function Ln(e) {
+  const t = e.split(P);
   if (t.length < 3)
-    throw new Error(`Invalid key format: ${n}`);
+    throw new Error(`Invalid key format: ${e}`);
   return t.slice(1, t.length - 1).join(P);
 }
-function Pn(n) {
-  return n.startsWith(j.URL_SCHEME) ? n.slice(j.URL_SCHEME.length) : n;
+function _n(e) {
+  return e.startsWith(j.URL_SCHEME) ? e.slice(j.URL_SCHEME.length) : e;
 }
 class j {
   constructor(t) {
@@ -2466,7 +2524,7 @@ class j {
       throw new Error("The current environment does not support local storage.");
     if (this.LS = window.localStorage, t == null || !t)
       throw new Error("For local storage, modelPath must not be null, undefined or empty.");
-    this.modelPath = t, this.keys = ke(this.modelPath);
+    this.modelPath = t, this.keys = Ee(this.modelPath);
   }
   /**
    * Save model artifacts to browser local storage.
@@ -2481,9 +2539,9 @@ class j {
     if (t.modelTopology instanceof ArrayBuffer)
       throw new Error("BrowserLocalStorage.save() does not support saving model topology in binary formats yet.");
     {
-      const e = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = ye(t), a = st.join(t.weightData);
+      const n = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = Se(t), a = st.join(t.weightData);
       try {
-        this.LS.setItem(this.keys.info, JSON.stringify(r)), this.LS.setItem(this.keys.topology, e), this.LS.setItem(this.keys.weightSpecs, s), this.LS.setItem(this.keys.weightData, Bn(a));
+        this.LS.setItem(this.keys.info, JSON.stringify(r)), this.LS.setItem(this.keys.topology, n), this.LS.setItem(this.keys.weightSpecs, s), this.LS.setItem(this.keys.weightData, Mn(a));
         const o = {
           format: t.format,
           generatedBy: t.generatedBy,
@@ -2496,7 +2554,7 @@ class j {
         };
         return this.LS.setItem(this.keys.modelMetadata, JSON.stringify(o)), { modelArtifactsInfo: r };
       } catch {
-        throw Ie(this.keys), new Error(`Failed to save model '${this.modelPath}' to local storage: size quota being exceeded is a possible cause of this failure: modelTopologyBytes=${r.modelTopologyBytes}, weightSpecsBytes=${r.weightSpecsBytes}, weightDataBytes=${r.weightDataBytes}.`);
+        throw Ae(this.keys), new Error(`Failed to save model '${this.modelPath}' to local storage: size quota being exceeded is a possible cause of this failure: modelTopologyBytes=${r.modelTopologyBytes}, weightSpecsBytes=${r.weightSpecsBytes}, weightDataBytes=${r.weightDataBytes}.`);
       }
     }
   }
@@ -2514,54 +2572,54 @@ class j {
       throw new Error(`In local storage, there is no model with name '${this.modelPath}'`);
     if (t.modelTopologyType !== "JSON")
       throw new Error("BrowserLocalStorage does not support loading non-JSON model topology yet.");
-    const e = {}, s = JSON.parse(this.LS.getItem(this.keys.topology));
+    const n = {}, s = JSON.parse(this.LS.getItem(this.keys.topology));
     if (s == null)
       throw new Error(`In local storage, the topology of model '${this.modelPath}' is missing.`);
-    e.modelTopology = s;
+    n.modelTopology = s;
     const r = JSON.parse(this.LS.getItem(this.keys.weightSpecs));
     if (r == null)
       throw new Error(`In local storage, the weight specs of model '${this.modelPath}' are missing.`);
-    e.weightSpecs = r;
+    n.weightSpecs = r;
     const a = this.LS.getItem(this.keys.modelMetadata);
     if (a != null) {
       const i = JSON.parse(a);
-      e.format = i.format, e.generatedBy = i.generatedBy, e.convertedBy = i.convertedBy, i.signature != null && (e.signature = i.signature), i.userDefinedMetadata != null && (e.userDefinedMetadata = i.userDefinedMetadata), i.modelInitializer != null && (e.modelInitializer = i.modelInitializer), i.initializerSignature != null && (e.initializerSignature = i.initializerSignature), i.trainingConfig != null && (e.trainingConfig = i.trainingConfig);
+      n.format = i.format, n.generatedBy = i.generatedBy, n.convertedBy = i.convertedBy, i.signature != null && (n.signature = i.signature), i.userDefinedMetadata != null && (n.userDefinedMetadata = i.userDefinedMetadata), i.modelInitializer != null && (n.modelInitializer = i.modelInitializer), i.initializerSignature != null && (n.initializerSignature = i.initializerSignature), i.trainingConfig != null && (n.trainingConfig = i.trainingConfig);
     }
     const o = this.LS.getItem(this.keys.weightData);
     if (o == null)
       throw new Error(`In local storage, the binary weight values of model '${this.modelPath}' are missing.`);
-    return e.weightData = vn(o), e;
+    return n.weightData = Nn(o), n;
   }
 }
 j.URL_SCHEME = "localstorage://";
-const Te = (n) => k().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(j.URL_SCHEME) ? Ln(n.slice(j.URL_SCHEME.length)) : null;
-A.registerSaveRouter(Te);
-A.registerLoadRouter(Te);
-function Ln(n) {
-  return new j(n);
+const Be = (e) => k().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(j.URL_SCHEME) ? On(e.slice(j.URL_SCHEME.length)) : null;
+A.registerSaveRouter(Be);
+A.registerLoadRouter(Be);
+function On(e) {
+  return new j(e);
 }
-class On {
+class Gn {
   constructor() {
     y(k().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), y(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
   }
   async listModels() {
-    const t = {}, e = Q + P, s = P + Se;
+    const t = {}, n = Q + P, s = P + Te;
     for (let r = 0; r < this.LS.length; ++r) {
       const a = this.LS.key(r);
-      if (a.startsWith(e) && a.endsWith(s)) {
-        const o = Cn(a);
+      if (a.startsWith(n) && a.endsWith(s)) {
+        const o = Ln(a);
         t[o] = JSON.parse(this.LS.getItem(a));
       }
     }
     return t;
   }
   async removeModel(t) {
-    t = Pn(t);
-    const e = ke(t);
-    if (this.LS.getItem(e.info) == null)
+    t = _n(t);
+    const n = Ee(t);
+    if (this.LS.getItem(n.info) == null)
       throw new Error(`Cannot find model at path '${t}'`);
-    const s = JSON.parse(this.LS.getItem(e.info));
-    return Ie(e), s;
+    const s = JSON.parse(this.LS.getItem(n.info));
+    return Ae(n), s;
   }
 }
 /**
@@ -2580,7 +2638,7 @@ class On {
  * limitations under the License.
  * =============================================================================
  */
-const Yt = "://";
+const Qt = "://";
 class $ {
   constructor() {
     this.managers = {};
@@ -2594,16 +2652,16 @@ class $ {
    * @param saveRouter A function that maps a URL-like string onto an instance
    * of `IOHandler` with the `save` method defined or `null`.
    */
-  static registerManager(t, e) {
-    y(t != null, () => "scheme must not be undefined or null."), t.endsWith(Yt) && (t = t.slice(0, t.indexOf(Yt))), y(t.length > 0, () => "scheme must not be an empty string.");
+  static registerManager(t, n) {
+    y(t != null, () => "scheme must not be undefined or null."), t.endsWith(Qt) && (t = t.slice(0, t.indexOf(Qt))), y(t.length > 0, () => "scheme must not be an empty string.");
     const s = $.getInstance();
-    y(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = e;
+    y(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = n;
   }
   static getManager(t) {
-    const e = $.getInstance().managers[t];
-    if (e == null)
+    const n = $.getInstance().managers[t];
+    if (n == null)
       throw new Error(`Cannot find model manager for scheme '${t}'`);
-    return e;
+    return n;
   }
   static getSchemes() {
     return Object.keys($.getInstance().managers);
@@ -2625,36 +2683,36 @@ class $ {
  * limitations under the License.
  * =============================================================================
  */
-class _n {
+class Un {
   constructor() {
     this.messageName = "setTimeoutCustom", this.functionRefs = [], this.handledMessageCount = 0, this.hasEventListener = !1;
   }
-  fetch(t, e) {
-    return fetch(t, e);
+  fetch(t, n) {
+    return fetch(t, n);
   }
   now() {
     return performance.now();
   }
-  encode(t, e) {
-    if (e !== "utf-8" && e !== "utf8")
-      throw new Error(`Browser's encoder only supports utf-8, but got ${e}`);
+  encode(t, n) {
+    if (n !== "utf-8" && n !== "utf8")
+      throw new Error(`Browser's encoder only supports utf-8, but got ${n}`);
     return this.textEncoder == null && (this.textEncoder = new TextEncoder()), this.textEncoder.encode(t);
   }
-  decode(t, e) {
-    return new TextDecoder(e).decode(t);
+  decode(t, n) {
+    return new TextDecoder(n).decode(t);
   }
   // If the setTimeout nesting level is greater than 5 and timeout is less
   // than 4ms, timeout will be clamped to 4ms, which hurts the perf.
   // Interleaving window.postMessage and setTimeout will trick the browser and
   // avoid the clamp.
-  setTimeoutCustom(t, e) {
+  setTimeoutCustom(t, n) {
     if (typeof window > "u" || !k().getBool("USE_SETTIMEOUTCUSTOM")) {
-      setTimeout(t, e);
+      setTimeout(t, n);
       return;
     }
     this.functionRefs.push(t), setTimeout(() => {
       window.postMessage({ name: this.messageName, index: this.functionRefs.length - 1 }, "*");
-    }, e), this.hasEventListener || (this.hasEventListener = !0, window.addEventListener("message", (s) => {
+    }, n), this.hasEventListener || (this.hasEventListener = !0, window.addEventListener("message", (s) => {
       if (s.source === window && s.data.name === this.messageName) {
         s.stopPropagation();
         const r = this.functionRefs[s.data.index];
@@ -2663,49 +2721,49 @@ class _n {
     }, !0));
   }
   isTypedArray(t) {
-    return ie(t);
+    return le(t);
   }
 }
 if (k().get("IS_BROWSER")) {
-  k().setPlatform("browser", new _n());
+  k().setPlatform("browser", new Un());
   try {
-    $.registerManager(j.URL_SCHEME, new On());
+    $.registerManager(j.URL_SCHEME, new Gn());
   } catch {
   }
   try {
-    $.registerManager(W.URL_SCHEME, new Rn());
+    $.registerManager(W.URL_SCHEME, new Dn());
   } catch {
   }
 }
-const Un = {
+const zn = {
   // tslint:disable-next-line:no-require-imports
   importFetch: () => require("node-fetch")
 };
-let wt;
-class Gn {
+let St;
+class Vn {
   constructor() {
     this.util = require("util"), this.textEncoder = new this.util.TextEncoder();
   }
-  fetch(t, e) {
-    return k().global.fetch != null ? k().global.fetch(t, e) : (wt == null && (wt = Un.importFetch()), wt(t, e));
+  fetch(t, n) {
+    return k().global.fetch != null ? k().global.fetch(t, n) : (St == null && (St = zn.importFetch()), St(t, n));
   }
   now() {
     const t = Z.hrtime();
     return t[0] * 1e3 + t[1] / 1e6;
   }
-  encode(t, e) {
-    if (e !== "utf-8" && e !== "utf8")
-      throw new Error(`Node built-in encoder only supports utf-8, but got ${e}`);
+  encode(t, n) {
+    if (n !== "utf-8" && n !== "utf8")
+      throw new Error(`Node built-in encoder only supports utf-8, but got ${n}`);
     return this.textEncoder.encode(t);
   }
-  decode(t, e) {
-    return t.length === 0 ? "" : new this.util.TextDecoder(e).decode(t);
+  decode(t, n) {
+    return t.length === 0 ? "" : new this.util.TextDecoder(n).decode(t);
   }
   isTypedArray(t) {
     return this.util.types.isFloat32Array(t) || this.util.types.isInt32Array(t) || this.util.types.isUint8Array(t) || this.util.types.isUint8ClampedArray(t);
   }
 }
-k().get("IS_NODE") && !k().get("IS_BROWSER") && k().setPlatform("node", new Gn());
+k().get("IS_NODE") && !k().get("IS_BROWSER") && k().setPlatform("node", new Vn());
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2722,8 +2780,8 @@ k().get("IS_NODE") && !k().get("IS_BROWSER") && k().setPlatform("node", new Gn()
  * limitations under the License.
  * =============================================================================
  */
-function zn(n, t = "float32", e) {
-  return t = t || "float32", xt(n), new hn(n, t, e);
+function Wn(e, t = "float32", n) {
+  return t = t || "float32", xt(e), new dn(e, t, n);
 }
 /**
  * @license
@@ -2741,16 +2799,16 @@ function zn(n, t = "float32", e) {
  * limitations under the License.
  * =============================================================================
  */
-function Vn(n, t) {
-  const e = T(n, "x", "cast");
-  if (!$e(t))
+function jn(e, t) {
+  const n = T(e, "x", "cast");
+  if (!Pe(t))
     throw new Error(`Failed to cast to unknown dtype ${t}`);
-  if (t === "string" && e.dtype !== "string" || t !== "string" && e.dtype === "string")
+  if (t === "string" && n.dtype !== "string" || t !== "string" && n.dtype === "string")
     throw new Error("Only strings can be casted to strings");
-  const s = { x: e }, r = { dtype: t };
-  return g.runKernel(re, s, r);
+  const s = { x: n }, r = { dtype: t };
+  return g.runKernel(oe, s, r);
 }
-const Rt = /* @__PURE__ */ N({ cast_: Vn });
+const Ft = /* @__PURE__ */ N({ cast_: jn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2767,11 +2825,11 @@ const Rt = /* @__PURE__ */ N({ cast_: Vn });
  * limitations under the License.
  * =============================================================================
  */
-function Wn(n) {
-  const e = { x: T(n, "x", "clone", "string_or_numeric") };
-  return g.runKernel(ae, e);
+function Kn(e) {
+  const n = { x: T(e, "x", "clone", "string_or_numeric") };
+  return g.runKernel(ie, n);
 }
-const jn = /* @__PURE__ */ N({ clone_: Wn });
+const qn = /* @__PURE__ */ N({ clone_: Kn });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2788,8 +2846,8 @@ const jn = /* @__PURE__ */ N({ clone_: Wn });
  * limitations under the License.
  * =============================================================================
  */
-function Kn(n, t = !1) {
-  console.log(n.toString(t));
+function Hn(e, t = !1) {
+  console.log(e.toString(t));
 }
 /**
  * @license
@@ -2807,14 +2865,14 @@ function Kn(n, t = !1) {
  * limitations under the License.
  * =============================================================================
  */
-me();
-const qn = {
-  buffer: zn,
-  cast: Rt,
-  clone: jn,
-  print: Kn
+be();
+const Jn = {
+  buffer: Wn,
+  cast: Ft,
+  clone: qn,
+  print: Hn
 };
-fn(qn);
+mn(Jn);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2831,13 +2889,13 @@ fn(qn);
  * limitations under the License.
  * =============================================================================
  */
-function Hn(n, t) {
-  let e = T(n, "a", "add"), s = T(t, "b", "add");
-  [e, s] = q(e, s);
-  const r = { a: e, b: s };
-  return g.runKernel(se, r);
+function Xn(e, t) {
+  let n = T(e, "a", "add"), s = T(t, "b", "add");
+  [n, s] = q(n, s);
+  const r = { a: n, b: s };
+  return g.runKernel(ae, r);
 }
-const S = /* @__PURE__ */ N({ add_: Hn });
+const S = /* @__PURE__ */ N({ add_: Xn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2854,13 +2912,13 @@ const S = /* @__PURE__ */ N({ add_: Hn });
  * limitations under the License.
  * =============================================================================
  */
-function Jn(n, t) {
-  let e = T(n, "a", "floorDiv"), s = T(t, "b", "floorDiv");
-  [e, s] = q(e, s);
-  const r = { a: e, b: s };
-  return g.runKernel(He, r);
+function Yn(e, t) {
+  let n = T(e, "a", "floorDiv"), s = T(t, "b", "floorDiv");
+  [n, s] = q(n, s);
+  const r = { a: n, b: s };
+  return g.runKernel(Ye, r);
 }
-const Xn = /* @__PURE__ */ N({ floorDiv_: Jn });
+const Qn = /* @__PURE__ */ N({ floorDiv_: Yn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2877,14 +2935,14 @@ const Xn = /* @__PURE__ */ N({ floorDiv_: Jn });
  * limitations under the License.
  * =============================================================================
  */
-function Yn(n, t) {
-  let e = T(n, "a", "div"), s = T(t, "b", "div");
-  if ([e, s] = q(e, s), e.dtype === "int32" && s.dtype === "int32")
-    return Xn(e, s);
-  const r = { a: e, b: s }, a = {};
-  return g.runKernel(Ke, r, a);
-}
-const x = /* @__PURE__ */ N({ div_: Yn });
+function Zn(e, t) {
+  let n = T(e, "a", "div"), s = T(t, "b", "div");
+  if ([n, s] = q(n, s), n.dtype === "int32" && s.dtype === "int32")
+    return Qn(n, s);
+  const r = { a: n, b: s }, a = {};
+  return g.runKernel(Je, r, a);
+}
+const x = /* @__PURE__ */ N({ div_: Zn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2901,13 +2959,13 @@ const x = /* @__PURE__ */ N({ div_: Yn });
  * limitations under the License.
  * =============================================================================
  */
-function Qn(n, t) {
-  let e = T(n, "a", "mul"), s = T(t, "b", "mul");
-  [e, s] = q(e, s);
-  const r = { a: e, b: s };
-  return g.runKernel(Xe, r);
+function ts(e, t) {
+  let n = T(e, "a", "mul"), s = T(t, "b", "mul");
+  [n, s] = q(n, s);
+  const r = { a: n, b: s };
+  return g.runKernel(Ze, r);
 }
-const b = /* @__PURE__ */ N({ mul_: Qn });
+const b = /* @__PURE__ */ N({ mul_: ts });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2924,17 +2982,17 @@ const b = /* @__PURE__ */ N({ mul_: Qn });
  * limitations under the License.
  * =============================================================================
  */
-function Zn(n) {
-  const t = T(n, "x", "abs");
+function es(e) {
+  const t = T(e, "x", "abs");
   if (t.dtype === "complex64") {
-    const e = { x: t };
-    return g.runKernel(je, e);
+    const n = { x: t };
+    return g.runKernel(He, n);
   } else {
-    const e = { x: t };
-    return g.runKernel(We, e);
+    const n = { x: t };
+    return g.runKernel(qe, n);
   }
 }
-const ts = /* @__PURE__ */ N({ abs_: Zn });
+const ns = /* @__PURE__ */ N({ abs_: es });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2951,10 +3009,10 @@ const ts = /* @__PURE__ */ N({ abs_: Zn });
  * limitations under the License.
  * =============================================================================
  */
-function es(n, t, e) {
-  xt(n), e = e || mt(t);
-  const s = { shape: n, value: t, dtype: e };
-  return g.runKernel(qe, {}, s);
+function ss(e, t, n) {
+  xt(e), n = n || pt(t);
+  const s = { shape: e, value: t, dtype: n };
+  return g.runKernel(Xe, {}, s);
 }
 /**
  * @license
@@ -2972,29 +3030,37 @@ function es(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function fo(n, t) {
-  const e = [];
+function ko(e, t) {
+  const n = e.length, s = [];
+  for (let r = 0; r < n; r++) {
+    const a = n - 1 - r, o = e[a] || 1;
+    (t[t.length - 1 - r] || 1) > 1 && o === 1 && s.unshift(a);
+  }
+  return s;
+}
+function Io(e, t) {
+  const n = [];
   for (let s = 0; s < t.length; s++) {
-    const r = n[n.length - s - 1], a = t.length - s - 1, o = t[a];
-    (r == null || r === 1 && o > 1) && e.unshift(a);
+    const r = e[e.length - s - 1], a = t.length - s - 1, o = t[a];
+    (r == null || r === 1 && o > 1) && n.unshift(a);
   }
-  return e;
+  return n;
 }
-function ns(n, t) {
-  const e = Math.max(n.length, t.length), s = new Array(e);
-  for (let r = 0; r < e; r++) {
-    let a = n[n.length - r - 1];
+function rs(e, t) {
+  const n = Math.max(e.length, t.length), s = new Array(n);
+  for (let r = 0; r < n; r++) {
+    let a = e[e.length - r - 1];
     a == null && (a = 1);
     let o = t[t.length - r - 1];
     if (o == null && (o = 1), a === 1)
-      s[e - r - 1] = o;
+      s[n - r - 1] = o;
     else if (o === 1)
-      s[e - r - 1] = a;
+      s[n - r - 1] = a;
     else if (a !== o) {
-      const i = `Operands could not be broadcast together with shapes ${n} and ${t}.`;
+      const i = `Operands could not be broadcast together with shapes ${e} and ${t}.`;
       throw Error(i);
     } else
-      s[e - r - 1] = a;
+      s[n - r - 1] = a;
   }
   return s;
 }
@@ -3014,11 +3080,11 @@ function ns(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ss(n) {
-  const e = { x: T(n, "x", "zerosLike") };
-  return g.runKernel(tn, e);
+function as(e) {
+  const n = { x: T(e, "x", "zerosLike") };
+  return g.runKernel(sn, n);
 }
-const C = /* @__PURE__ */ N({ zerosLike_: ss });
+const C = /* @__PURE__ */ N({ zerosLike_: as });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3035,13 +3101,13 @@ const C = /* @__PURE__ */ N({ zerosLike_: ss });
  * limitations under the License.
  * =============================================================================
  */
-function rs(n, t) {
-  let e = T(n, "base", "pow"), s = T(t, "exp", "pow");
-  [e, s] = q(e, s);
-  const r = { a: e, b: s };
-  return g.runKernel(Ye, r);
+function os(e, t) {
+  let n = T(e, "base", "pow"), s = T(t, "exp", "pow");
+  [n, s] = q(n, s);
+  const r = { a: n, b: s };
+  return g.runKernel(tn, r);
 }
-const Qt = /* @__PURE__ */ N({ pow_: rs });
+const Zt = /* @__PURE__ */ N({ pow_: os });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3058,12 +3124,12 @@ const Qt = /* @__PURE__ */ N({ pow_: rs });
  * limitations under the License.
  * =============================================================================
  */
-function K(n, t) {
-  if ((R(n) && t !== "string" || Array.isArray(n)) && t !== "complex64")
+function K(e, t) {
+  if ((F(e) && t !== "string" || Array.isArray(e)) && t !== "complex64")
     throw new Error("Error creating a new Scalar: value must be a primitive (number|boolean|string)");
-  if (t === "string" && R(n) && !(n instanceof Uint8Array))
+  if (t === "string" && F(e) && !(e instanceof Uint8Array))
     throw new Error("When making a scalar from encoded string, the value must be `Uint8Array`.");
-  return In(n, [], [], t);
+  return En(e, [], [], t);
 }
 /**
  * @license
@@ -3081,11 +3147,11 @@ function K(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function as(n) {
-  const e = { x: T(n, "x", "sqrt", "float32") };
-  return g.runKernel(Qe, e);
+function is(e) {
+  const n = { x: T(e, "x", "sqrt", "float32") };
+  return g.runKernel(en, n);
 }
-const nt = /* @__PURE__ */ N({ sqrt_: as });
+const nt = /* @__PURE__ */ N({ sqrt_: is });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -3102,11 +3168,11 @@ const nt = /* @__PURE__ */ N({ sqrt_: as });
  * limitations under the License.
  * =============================================================================
  */
-function os(n) {
-  const t = T(n, "x", "square"), e = {};
-  return g.runKernel("Square", { x: t }, e);
+function cs(e) {
+  const t = T(e, "x", "square"), n = {};
+  return g.runKernel("Square", { x: t }, n);
 }
-const V = /* @__PURE__ */ N({ square_: os });
+const V = /* @__PURE__ */ N({ square_: cs });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3123,25 +3189,40 @@ const V = /* @__PURE__ */ N({ square_: os });
  * limitations under the License.
  * =============================================================================
  */
-function is(n, t) {
-  y(kt(n), () => "The f passed in variableGrads(f) must be a function"), y(t == null || Array.isArray(t) && t.every((l) => l instanceof ft), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
-  const e = t != null;
-  if (!e) {
+function To(e) {
+  return y(ht(e), () => "The f passed in grads(f) must be a function"), (t, n) => {
+    y(Array.isArray(t), () => "The args passed in grads(f)(args) must be an array of `Tensor`s or `TensorLike`s");
+    const s = In(t, "args", "tf.grads", "string_or_numeric"), r = n != null ? T(n, "dy", "tf.grads") : null;
+    return g.tidy(() => {
+      const { value: a, grads: o } = g.gradients(() => e(...s), s, r);
+      return r != null && De(a.shape, r.shape, "The shape of dy passed in grads(f)([x1,...], dy) must match the shape returned by f([x1,...])"), us(o), o;
+    });
+  };
+}
+function ls(e, t) {
+  y(ht(e), () => "The f passed in variableGrads(f) must be a function"), y(t == null || Array.isArray(t) && t.every((l) => l instanceof gt), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
+  const n = t != null;
+  if (!n) {
     t = [];
     for (const l in g.registeredVariables)
       t.push(g.registeredVariables[l]);
   }
-  const s = e ? t.filter((l) => !l.trainable) : null, r = t.length;
+  const s = n ? t.filter((l) => !l.trainable) : null, r = t.length;
   t = t.filter((l) => l.trainable), y(t.length > 0, () => `variableGrads() expects at least one of the input variables to be trainable, but none of the ${r} variables is trainable.`);
-  const a = !0, { value: o, grads: i } = g.gradients(n, t, null, a);
+  const a = !0, { value: o, grads: i } = g.gradients(e, t, null, a);
   y(i.some((l) => l != null), () => "Cannot find a connection between any variable and the result of the loss function y=f(x). Please make sure the operations that use variables are inside the function f passed to minimize()."), y(o.rank === 0, () => `The f passed in variableGrads(f) must return a scalar, but it returned a rank-${o.rank} tensor`);
   const c = {};
   return t.forEach((l, u) => {
     i[u] != null && (c[l.name] = i[u]);
   }), s?.forEach((l) => c[l.name] = null), { value: o, grads: c };
 }
-function go(n) {
-  return g.customGrad(n);
+function Eo(e) {
+  return g.customGrad(e);
+}
+function us(e) {
+  if (e.filter((n) => n == null).length > 0)
+    throw new Error(`Cannot compute gradient of y=f(x) with respect to x. Make sure that
+    the f you passed encloses all operations that lead from x to y.`);
 }
 /**
  * @license
@@ -3159,13 +3240,13 @@ function go(n) {
  * limitations under the License.
  * =============================================================================
  */
-function cs(n, t) {
-  let e = T(n, "a", "sub"), s = T(t, "b", "sub");
-  [e, s] = q(e, s);
-  const r = { a: e, b: s };
-  return g.runKernel(Ze, r);
+function hs(e, t) {
+  let n = T(e, "a", "sub"), s = T(t, "b", "sub");
+  [n, s] = q(n, s);
+  const r = { a: n, b: s };
+  return g.runKernel(nn, r);
 }
-const tt = /* @__PURE__ */ N({ sub_: cs });
+const tt = /* @__PURE__ */ N({ sub_: hs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3182,13 +3263,13 @@ const tt = /* @__PURE__ */ N({ sub_: cs });
  * limitations under the License.
  * =============================================================================
  */
-function ls(n, t) {
-  let e = T(n, "a", "maximum"), s = T(t, "b", "maximum");
-  [e, s] = q(e, s), e.dtype === "bool" && (e = Rt(e, "int32"), s = Rt(s, "int32")), ns(e.shape, s.shape);
-  const r = { a: e, b: s };
-  return g.runKernel(Je, r);
+function fs(e, t) {
+  let n = T(e, "a", "maximum"), s = T(t, "b", "maximum");
+  [n, s] = q(n, s), n.dtype === "bool" && (n = Ft(n, "int32"), s = Ft(s, "int32")), rs(n.shape, s.shape);
+  const r = { a: n, b: s };
+  return g.runKernel(Qe, r);
 }
-const us = /* @__PURE__ */ N({ maximum_: ls });
+const ds = /* @__PURE__ */ N({ maximum_: fs });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3205,8 +3286,8 @@ const us = /* @__PURE__ */ N({ maximum_: ls });
  * limitations under the License.
  * =============================================================================
  */
-const hs = /* @__PURE__ */ new Map(), ds = /* @__PURE__ */ new Map();
-class fs {
+const gs = /* @__PURE__ */ new Map(), ms = /* @__PURE__ */ new Map();
+class ps {
   /**
    * Return the class name for this class to use in serialization contexts.
    *
@@ -3230,11 +3311,11 @@ class fs {
    * @param config The Configuration for the object.
    */
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e);
+  static fromConfig(t, n) {
+    return new t(n);
   }
 }
-class U {
+class G {
   constructor() {
     this.classNameMap = {};
   }
@@ -3242,19 +3323,19 @@ class U {
    * Returns the singleton instance of the map.
    */
   static getMap() {
-    return U.instance == null && (U.instance = new U()), U.instance;
+    return G.instance == null && (G.instance = new G()), G.instance;
   }
   /**
    * Registers the class as serializable.
    */
   static register(t) {
-    U.getMap().classNameMap[t.className] = [t, t.fromConfig];
+    G.getMap().classNameMap[t.className] = [t, t.fromConfig];
   }
 }
-function gs(n, t, e) {
-  y(n.className != null, () => "Class being registered does not have the static className property defined."), y(typeof n.className == "string", () => "className is required to be a string, but got type " + typeof n.className), y(n.className.length > 0, () => "Class being registered has an empty-string as its className, which is disallowed."), typeof t > "u" && (t = "Custom"), typeof e > "u" && (e = n.className);
-  const s = e, r = t + ">" + s;
-  return U.register(n), hs.set(r, n), ds.set(n, r), n;
+function ys(e, t, n) {
+  y(e.className != null, () => "Class being registered does not have the static className property defined."), y(typeof e.className == "string", () => "className is required to be a string, but got type " + typeof e.className), y(e.className.length > 0, () => "Class being registered has an empty-string as its className, which is disallowed."), typeof t > "u" && (t = "Custom"), typeof n > "u" && (n = e.className);
+  const s = n, r = t + ">" + s;
+  return G.register(e), gs.set(r, e), ms.set(e, r), e;
 }
 /**
  * @license
@@ -3272,7 +3353,7 @@ function gs(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-class H extends fs {
+class H extends ps {
   /**
    * Executes `f()` and minimizes the scalar output of `f()` by computing
    * gradients of y with respect to the list of trainable variables provided by
@@ -3287,14 +3368,14 @@ class H extends fs {
    *
    * @doc {heading: 'Training', subheading: 'Optimizers'}
    */
-  minimize(t, e = !1, s) {
+  minimize(t, n = !1, s) {
     const { value: r, grads: a } = this.computeGradients(t, s);
     if (s != null) {
       const o = s.map((i) => ({ name: i.name, tensor: a[i.name] }));
       this.applyGradients(o);
     } else
       this.applyGradients(a);
-    return M(a), e ? r : (r.dispose(), null);
+    return M(a), n ? r : (r.dispose(), null);
   }
   /**
    * The number of iterations that this optimizer instance has been invoked for.
@@ -3318,8 +3399,8 @@ class H extends fs {
    *
    * @doc {heading: 'Training', subheading: 'Optimizers'}
    */
-  computeGradients(t, e) {
-    return is(t, e);
+  computeGradients(t, n) {
+    return ls(t, n);
   }
   /**
    * Dispose the variables (if any) owned by this optimizer instance.
@@ -3352,7 +3433,7 @@ class H extends fs {
   }
 }
 Object.defineProperty(H, Symbol.hasInstance, {
-  value: (n) => n.minimize != null && n.computeGradients != null && n.applyGradients != null
+  value: (e) => e.minimize != null && e.computeGradients != null && e.applyGradients != null
 });
 /**
  * @license
@@ -3370,13 +3451,13 @@ Object.defineProperty(H, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-class ms extends H {
+class bs extends H {
   /** @nocollapse */
   static get className() {
     return "Adadelta";
   }
-  constructor(t, e, s = null) {
-    super(), this.learningRate = t, this.rho = e, this.epsilon = s, this.accumulatedGrads = [], this.accumulatedUpdates = [], s == null && (this.epsilon = g.backend.epsilon());
+  constructor(t, n, s = null) {
+    super(), this.learningRate = t, this.rho = n, this.epsilon = s, this.accumulatedGrads = [], this.accumulatedUpdates = [], s == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
@@ -3393,8 +3474,8 @@ class ms extends H {
         return;
       const c = this.accumulatedGrads[r].variable, l = this.accumulatedUpdates[r].variable;
       E(() => {
-        const u = S(b(c, this.rho), b(V(i), 1 - this.rho)), h = b(x(nt(S(l, this.epsilon)), nt(S(c, this.epsilon))), i), d = S(b(l, this.rho), b(V(h), 1 - this.rho));
-        c.assign(u), l.assign(d);
+        const u = S(b(c, this.rho), b(V(i), 1 - this.rho)), h = b(x(nt(S(l, this.epsilon)), nt(S(c, this.epsilon))), i), f = S(b(l, this.rho), b(V(h), 1 - this.rho));
+        c.assign(u), l.assign(f);
         const m = S(b(h, -this.learningRate), a);
         a.assign(m);
       });
@@ -3405,15 +3486,15 @@ class ms extends H {
   }
   async getWeights() {
     const t = [...this.accumulatedGrads, ...this.accumulatedUpdates];
-    return [await this.saveIterations()].concat(t.map((e) => ({ name: e.originalName, tensor: e.variable })));
+    return [await this.saveIterations()].concat(t.map((n) => ({ name: n.originalName, tensor: n.variable })));
   }
   async setWeights(t) {
     t = await this.extractIterations(t);
-    const e = t.length / 2, s = !1;
-    this.accumulatedGrads = t.slice(0, e).map((r) => ({
+    const n = t.length / 2, s = !1;
+    this.accumulatedGrads = t.slice(0, n).map((r) => ({
       originalName: r.name,
       variable: r.tensor.variable(s)
-    })), this.accumulatedUpdates = t.slice(e, e * 2).map((r) => ({
+    })), this.accumulatedUpdates = t.slice(n, n * 2).map((r) => ({
       originalName: r.name,
       variable: r.tensor.variable(s)
     }));
@@ -3426,8 +3507,8 @@ class ms extends H {
     };
   }
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e.learningRate, e.rho, e.epsilon);
+  static fromConfig(t, n) {
+    return new t(n.learningRate, n.rho, n.epsilon);
   }
 }
 /**
@@ -3446,20 +3527,20 @@ class ms extends H {
  * limitations under the License.
  * =============================================================================
  */
-class ps extends H {
+class ws extends H {
   /** @nocollapse */
   static get className() {
     return "Adagrad";
   }
-  constructor(t, e = 0.1) {
-    super(), this.learningRate = t, this.initialAccumulatorValue = e, this.accumulatedGrads = [];
+  constructor(t, n = 0.1) {
+    super(), this.learningRate = t, this.initialAccumulatorValue = n, this.accumulatedGrads = [];
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
       const a = g.registeredVariables[s];
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accumulator`,
-        variable: E(() => es(a.shape, this.initialAccumulatorValue).variable(!1))
+        variable: E(() => ss(a.shape, this.initialAccumulatorValue).variable(!1))
       });
       const o = Array.isArray(t) ? t[r].tensor : t[s];
       if (o == null)
@@ -3481,8 +3562,8 @@ class ps extends H {
   }
   async setWeights(t) {
     t = await this.extractIterations(t);
-    const e = !1;
-    this.accumulatedGrads = t.map((s) => ({ originalName: s.name, variable: s.tensor.variable(e) }));
+    const n = !1;
+    this.accumulatedGrads = t.map((s) => ({ originalName: s.name, variable: s.tensor.variable(n) }));
   }
   getConfig() {
     return {
@@ -3491,8 +3572,8 @@ class ps extends H {
     };
   }
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e.learningRate, e.initialAccumulatorValue);
+  static fromConfig(t, n) {
+    return new t(n.learningRate, n.initialAccumulatorValue);
   }
 }
 /**
@@ -3511,21 +3592,21 @@ class ps extends H {
  * limitations under the License.
  * =============================================================================
  */
-class ys extends H {
+class Ss extends H {
   /** @nocollapse */
   static get className() {
     return "Adam";
   }
-  constructor(t, e, s, r = null) {
-    super(), this.learningRate = t, this.beta1 = e, this.beta2 = s, this.epsilon = r, this.accumulatedFirstMoment = [], this.accumulatedSecondMoment = [], E(() => {
-      this.accBeta1 = K(e).variable(), this.accBeta2 = K(s).variable();
+  constructor(t, n, s, r = null) {
+    super(), this.learningRate = t, this.beta1 = n, this.beta2 = s, this.epsilon = r, this.accumulatedFirstMoment = [], this.accumulatedSecondMoment = [], E(() => {
+      this.accBeta1 = K(n).variable(), this.accBeta2 = K(s).variable();
     }), r == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
-    const e = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
+    const n = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
       const s = tt(1, this.accBeta1), r = tt(1, this.accBeta2);
-      e.forEach((a, o) => {
+      n.forEach((a, o) => {
         const i = g.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
           originalName: `${a}/m`,
@@ -3537,9 +3618,9 @@ class ys extends H {
         const l = Array.isArray(t) ? t[o].tensor : t[a];
         if (l == null)
           return;
-        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedSecondMoment[o].variable, d = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = S(b(h, this.beta2), b(V(l), 1 - this.beta2)), p = x(d, s), f = x(m, r);
-        u.assign(d), h.assign(m);
-        const w = S(b(x(p, S(nt(f), this.epsilon)), -this.learningRate), i);
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedSecondMoment[o].variable, f = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = S(b(h, this.beta2), b(V(l), 1 - this.beta2)), p = x(f, s), d = x(m, r);
+        u.assign(f), h.assign(m);
+        const w = S(b(x(p, S(nt(d), this.epsilon)), -this.learningRate), i);
         i.assign(w);
       }), this.accBeta1.assign(b(this.accBeta1, this.beta1)), this.accBeta2.assign(b(this.accBeta2, this.beta2));
     }), this.incrementIterations();
@@ -3549,17 +3630,17 @@ class ys extends H {
   }
   async getWeights() {
     const t = [...this.accumulatedFirstMoment, ...this.accumulatedSecondMoment];
-    return [await this.saveIterations()].concat(t.map((e) => ({ name: e.originalName, tensor: e.variable })));
+    return [await this.saveIterations()].concat(t.map((n) => ({ name: n.originalName, tensor: n.variable })));
   }
   async setWeights(t) {
     t = await this.extractIterations(t), E(() => {
-      this.accBeta1.assign(Qt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Qt(this.beta2, this.iterations_ + 1));
+      this.accBeta1.assign(Zt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Zt(this.beta2, this.iterations_ + 1));
     });
-    const e = t.length / 2, s = !1;
-    this.accumulatedFirstMoment = t.slice(0, e).map((r) => ({
+    const n = t.length / 2, s = !1;
+    this.accumulatedFirstMoment = t.slice(0, n).map((r) => ({
       originalName: r.name,
       variable: r.tensor.variable(s)
-    })), this.accumulatedSecondMoment = t.slice(e, e * 2).map((r) => ({
+    })), this.accumulatedSecondMoment = t.slice(n, n * 2).map((r) => ({
       originalName: r.name,
       variable: r.tensor.variable(s)
     }));
@@ -3573,8 +3654,8 @@ class ys extends H {
     };
   }
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e.learningRate, e.beta1, e.beta2, e.epsilon);
+  static fromConfig(t, n) {
+    return new t(n.learningRate, n.beta1, n.beta2, n.epsilon);
   }
 }
 /**
@@ -3593,21 +3674,21 @@ class ys extends H {
  * limitations under the License.
  * =============================================================================
  */
-class bs extends H {
+class ks extends H {
   /** @nocollapse */
   static get className() {
     return "Adamax";
   }
-  constructor(t, e, s, r = null, a = 0) {
-    super(), this.learningRate = t, this.beta1 = e, this.beta2 = s, this.epsilon = r, this.decay = a, this.accumulatedFirstMoment = [], this.accumulatedWeightedInfNorm = [], E(() => {
-      this.iteration = K(0).variable(), this.accBeta1 = K(e).variable();
+  constructor(t, n, s, r = null, a = 0) {
+    super(), this.learningRate = t, this.beta1 = n, this.beta2 = s, this.epsilon = r, this.decay = a, this.accumulatedFirstMoment = [], this.accumulatedWeightedInfNorm = [], E(() => {
+      this.iteration = K(0).variable(), this.accBeta1 = K(n).variable();
     }), r == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
-    const e = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
+    const n = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
       const s = tt(1, this.accBeta1), r = x(-this.learningRate, S(b(this.iteration, this.decay), 1));
-      e.forEach((a, o) => {
+      n.forEach((a, o) => {
         const i = g.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
           originalName: `${a}/m`,
@@ -3619,9 +3700,9 @@ class bs extends H {
         const l = Array.isArray(t) ? t[o].tensor : t[a];
         if (l == null)
           return;
-        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedWeightedInfNorm[o].variable, d = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), p = ts(l), f = us(m, p);
-        u.assign(d), h.assign(f);
-        const w = S(b(x(r, s), x(d, S(f, this.epsilon))), i);
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedWeightedInfNorm[o].variable, f = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), p = ns(l), d = ds(m, p);
+        u.assign(f), h.assign(d);
+        const w = S(b(x(r, s), x(f, S(d, this.epsilon))), i);
         i.assign(w);
       }), this.iteration.assign(S(this.iteration, 1)), this.accBeta1.assign(b(this.accBeta1, this.beta1));
     }), this.incrementIterations();
@@ -3645,8 +3726,8 @@ class bs extends H {
     };
   }
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e.learningRate, e.beta1, e.beta2, e.epsilon, e.decay);
+  static fromConfig(t, n) {
+    return new t(n.learningRate, n.beta1, n.beta2, n.epsilon, n.decay);
   }
 }
 /**
@@ -3665,7 +3746,7 @@ class bs extends H {
  * limitations under the License.
  * =============================================================================
  */
-class Ee extends H {
+class ve extends H {
   /** @nocollapse */
   static get className() {
     return "SGD";
@@ -3689,7 +3770,7 @@ class Ee extends H {
    * Sets the learning rate of the optimizer.
    */
   setLearningRate(t) {
-    this.learningRate = t, this.c != null && this.c.dispose(), this.c = En(K(-t));
+    this.learningRate = t, this.c != null && this.c.dispose(), this.c = Bn(K(-t));
   }
   dispose() {
     this.c.dispose();
@@ -3705,8 +3786,8 @@ class Ee extends H {
     return { learningRate: this.learningRate };
   }
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e.learningRate);
+  static fromConfig(t, n) {
+    return new t(n.learningRate);
   }
 }
 /**
@@ -3725,14 +3806,14 @@ class Ee extends H {
  * limitations under the License.
  * =============================================================================
  */
-class ws extends Ee {
+class Is extends ve {
   /** @nocollapse */
   // Name matters for Python compatibility.
   static get className() {
     return "Momentum";
   }
-  constructor(t, e, s = !1) {
-    super(t), this.learningRate = t, this.momentum = e, this.useNesterov = s, this.accumulations = [], this.m = K(this.momentum);
+  constructor(t, n, s = !1) {
+    super(t), this.learningRate = t, this.momentum = n, this.useNesterov = s, this.accumulations = [], this.m = K(this.momentum);
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
@@ -3765,8 +3846,8 @@ class ws extends Ee {
   }
   async setWeights(t) {
     t = await this.extractIterations(t);
-    const e = !1;
-    this.accumulations = t.map((s) => ({ originalName: s.name, variable: s.tensor.variable(e) }));
+    const n = !1;
+    this.accumulations = t.map((s) => ({ originalName: s.name, variable: s.tensor.variable(n) }));
   }
   getConfig() {
     return {
@@ -3776,8 +3857,8 @@ class ws extends Ee {
     };
   }
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e.learningRate, e.momentum, e.useNesterov);
+  static fromConfig(t, n) {
+    return new t(n.learningRate, n.momentum, n.useNesterov);
   }
 }
 /**
@@ -3796,13 +3877,13 @@ class ws extends Ee {
  * limitations under the License.
  * =============================================================================
  */
-class Ss extends H {
+class Ts extends H {
   /** @nocollapse */
   static get className() {
     return "RMSProp";
   }
-  constructor(t, e = 0.9, s = 0, r = null, a = !1) {
-    if (super(), this.learningRate = t, this.decay = e, this.momentum = s, this.epsilon = r, this.accumulatedMeanSquares = [], this.accumulatedMoments = [], this.accumulatedMeanGrads = [], this.centered = a, r == null && (this.epsilon = g.backend.epsilon()), t == null)
+  constructor(t, n = 0.9, s = 0, r = null, a = !1) {
+    if (super(), this.learningRate = t, this.decay = n, this.momentum = s, this.epsilon = r, this.accumulatedMeanSquares = [], this.accumulatedMoments = [], this.accumulatedMeanGrads = [], this.centered = a, r == null && (this.epsilon = g.backend.epsilon()), t == null)
       throw new Error("learningRate for RMSPropOptimizer must be defined.");
   }
   applyGradients(t) {
@@ -3825,14 +3906,14 @@ class Ss extends H {
       E(() => {
         const u = S(b(c, this.decay), b(V(i), 1 - this.decay));
         if (this.centered) {
-          const h = this.accumulatedMeanGrads[r].variable, d = S(b(h, this.decay), b(i, 1 - this.decay)), m = x(b(i, this.learningRate), nt(tt(u, S(V(d), this.epsilon)))), p = S(b(l, this.momentum), m);
-          c.assign(u), h.assign(d), l.assign(p);
-          const f = tt(a, p);
-          a.assign(f);
+          const h = this.accumulatedMeanGrads[r].variable, f = S(b(h, this.decay), b(i, 1 - this.decay)), m = x(b(i, this.learningRate), nt(tt(u, S(V(f), this.epsilon)))), p = S(b(l, this.momentum), m);
+          c.assign(u), h.assign(f), l.assign(p);
+          const d = tt(a, p);
+          a.assign(d);
         } else {
-          const h = S(b(c, this.decay), b(V(i), 1 - this.decay)), d = S(b(l, this.momentum), x(b(i, this.learningRate), nt(S(h, this.epsilon))));
-          c.assign(h), l.assign(d);
-          const m = tt(a, d);
+          const h = S(b(c, this.decay), b(V(i), 1 - this.decay)), f = S(b(l, this.momentum), x(b(i, this.learningRate), nt(S(h, this.epsilon))));
+          c.assign(h), l.assign(f);
+          const m = tt(a, f);
           a.assign(m);
         }
       });
@@ -3843,18 +3924,18 @@ class Ss extends H {
   }
   async getWeights() {
     const t = [...this.accumulatedMeanSquares, ...this.accumulatedMoments];
-    return this.centered && t.push(...this.accumulatedMeanGrads), [await this.saveIterations()].concat(t.map((e) => ({ name: e.originalName, tensor: e.variable })));
+    return this.centered && t.push(...this.accumulatedMeanGrads), [await this.saveIterations()].concat(t.map((n) => ({ name: n.originalName, tensor: n.variable })));
   }
   async setWeights(t) {
     t = await this.extractIterations(t);
-    const e = this.centered ? t.length / 3 : t.length / 2, s = !1;
-    this.accumulatedMeanSquares = t.slice(0, e).map((r) => ({
+    const n = this.centered ? t.length / 3 : t.length / 2, s = !1;
+    this.accumulatedMeanSquares = t.slice(0, n).map((r) => ({
       originalName: r.name,
       variable: r.tensor.variable(s)
-    })), this.accumulatedMoments = t.slice(e, e * 2).map((r) => ({
+    })), this.accumulatedMoments = t.slice(n, n * 2).map((r) => ({
       originalName: r.name,
       variable: r.tensor.variable(s)
-    })), this.centered && (this.accumulatedMeanGrads = t.slice(e * 2, e * 3).map((r) => ({
+    })), this.centered && (this.accumulatedMeanGrads = t.slice(n * 2, n * 3).map((r) => ({
       originalName: r.name,
       variable: r.tensor.variable(s)
     })));
@@ -3869,8 +3950,8 @@ class Ss extends H {
     };
   }
   /** @nocollapse */
-  static fromConfig(t, e) {
-    return new t(e.learningRate, e.decay, e.momentum, e.epsilon, e.centered);
+  static fromConfig(t, n) {
+    return new t(n.learningRate, n.decay, n.momentum, n.epsilon, n.centered);
   }
 }
 /**
@@ -3889,18 +3970,18 @@ class Ss extends H {
  * limitations under the License.
  * =============================================================================
  */
-const ks = [
-  ms,
-  ps,
-  ys,
+const Es = [
   bs,
   ws,
   Ss,
-  Ee
+  ks,
+  Is,
+  Ts,
+  ve
 ];
-function Is() {
-  for (const n of ks)
-    gs(n);
+function As() {
+  for (const e of Es)
+    ys(e);
 }
 /**
  * @license
@@ -3918,220 +3999,237 @@ function Is() {
  * limitations under the License.
  * =============================================================================
  */
-Is();
+As();
 export {
-  Ur as $,
-  ys as A,
-  Ks as B,
-  Zs as C,
-  Sn as D,
+  ns as $,
+  Ss as A,
+  Zs as B,
+  or as C,
+  ss as D,
   g as E,
-  In as F,
-  Nr as G,
-  Rr as H,
-  ya as I,
-  Qt as J,
-  or as K,
-  Da as L,
-  vs as M,
-  Qs as N,
-  te as O,
-  ha as P,
-  Ma as Q,
-  ma as R,
-  _a as S,
-  qr as T,
-  Rt as U,
-  La as V,
-  na as W,
-  sa as X,
-  Ka as Y,
-  S as Z,
-  Tr as _,
+  Bn as F,
+  Pr as G,
+  To as H,
+  Fs as I,
+  kn as J,
+  En as K,
+  Lr as L,
+  ta as M,
+  Ea as N,
+  Zt as O,
+  ba as P,
+  dr as Q,
+  Ia as R,
+  qa as S,
+  Oa as T,
+  De as U,
+  ar as V,
+  ne as W,
+  aa as X,
+  xe as Y,
+  V as Z,
+  oa as _,
   M as a,
-  Oa as a$,
-  Re as a0,
-  Ua as a1,
-  Zr as a2,
-  ts as a3,
-  nt as a4,
-  V as a5,
-  Qr as a6,
-  R as a7,
-  D as a8,
-  k as a9,
-  ns as aA,
-  Ir as aB,
-  Na as aC,
-  br as aD,
-  wr as aE,
-  kr as aF,
-  Er as aG,
-  zn as aH,
-  vr as aI,
-  Fr as aJ,
-  Dr as aK,
-  $r as aL,
-  Lr as aM,
-  Or as aN,
-  _r as aO,
-  Gr as aP,
-  ra as aQ,
-  Pa as aR,
-  zr as aS,
-  Vr as aT,
-  Hr as aU,
-  Xr as aV,
-  ta as aW,
-  aa as aX,
-  ua as aY,
-  la as aZ,
-  da as a_,
-  fe as aa,
-  so as ab,
-  dt as ac,
-  $s as ad,
-  xs as ae,
-  Cs as af,
-  Ne as ag,
-  zs as ah,
-  Ws as ai,
-  Ca as aj,
-  Fa as ak,
-  Wa as al,
-  qs as am,
-  Mr as an,
-  Hs as ao,
-  ja as ap,
-  Ys as aq,
-  tr as ar,
-  nr as as,
-  sr as at,
-  ar as au,
-  ir as av,
-  cr as aw,
-  lr as ax,
-  hr as ay,
-  dr as az,
+  ko as a$,
+  nt as a0,
+  Qa as a1,
+  Ca as a2,
+  Fr as a3,
+  qr as a4,
+  S as a5,
+  la as a6,
+  ua as a7,
+  Za as a8,
+  F as a9,
+  Ta as aA,
+  Aa as aB,
+  Ra as aC,
+  $a as aD,
+  Ds as aE,
+  ro as aF,
+  no as aG,
+  eo as aH,
+  Rt as aI,
+  x as aJ,
+  Io as aK,
+  oo as aL,
+  yr as aM,
+  $r as aN,
+  ao as aO,
+  da as aP,
+  ma as aQ,
+  ga as aR,
+  Na as aS,
+  va as aT,
+  to as aU,
+  yo as aV,
+  xs as aW,
+  jt as aX,
+  ue as aY,
+  $t as aZ,
+  $s as a_,
+  D as aa,
+  k as ab,
+  pe as ac,
+  fo as ad,
+  dt as ae,
+  za as af,
+  _a as ag,
+  er as ah,
+  rr as ai,
+  rs as aj,
+  Pa as ak,
+  Ar as al,
+  Br as am,
+  Rr as an,
+  Wn as ao,
+  xr as ap,
+  _r as aq,
+  Or as ar,
+  Gr as as,
+  Wr as at,
+  jr as au,
+  Kr as av,
+  ha as aw,
+  Jr as ax,
+  ia as ay,
+  Sa as az,
   b,
-  Ar as b$,
-  fa as b0,
-  pa as b1,
-  ba as b2,
-  Ea as b3,
-  Aa as b4,
-  Ba as b5,
-  va as b6,
-  Ra as b7,
-  $a as b8,
-  Ns as b9,
-  ps as bA,
-  co as bB,
-  gs as bC,
-  fs as bD,
-  U as bE,
-  We as bF,
-  Rs as bG,
-  Fs as bH,
-  se as bI,
-  Ds as bJ,
-  Ps as bK,
-  Ls as bL,
-  Os as bM,
-  Gs as bN,
-  _s as bO,
-  Us as bP,
-  js as bQ,
-  Vs as bR,
-  Js as bS,
-  re as bT,
-  Xs as bU,
-  je as bV,
-  rr as bW,
-  mr as bX,
-  yr as bY,
-  pr as bZ,
-  Sr as b_,
-  Ya as ba,
-  Xa as bb,
-  Ja as bc,
-  Ha as bd,
-  Ft as be,
-  x as bf,
-  er as bg,
-  fo as bh,
-  to as bi,
-  fr as bj,
-  gr as bk,
-  Za as bl,
-  ur as bm,
-  Br as bn,
-  Qa as bo,
-  oa as bp,
-  ca as bq,
-  ia as br,
-  Ia as bs,
-  Sa as bt,
-  qa as bu,
-  Ee as bv,
-  ws as bw,
-  Ss as bx,
-  ms as by,
-  bs as bz,
-  go as c,
-  He as c0,
-  ae as c1,
-  xr as c2,
-  Cr as c3,
-  Pr as c4,
-  Wr as c5,
-  Kr as c6,
-  jr as c7,
-  Je as c8,
-  Yr as c9,
-  Jr as ca,
-  ea as cb,
-  Xe as cc,
-  Ye as cd,
-  ga as ce,
-  Ke as cf,
-  Ta as cg,
-  ka as ch,
-  xa as ci,
-  Qe as cj,
-  za as ck,
-  Ga as cl,
-  Ze as cm,
-  Va as cn,
-  us as co,
-  tn as cp,
-  Pe as cq,
-  H as cr,
-  Bs as cs,
-  ho as ct,
-  lo as cu,
-  uo as cv,
-  ao as d,
-  oo as e,
+  Vs as b$,
+  Ps as b0,
+  Cs as b1,
+  Lt as b2,
+  te as b3,
+  uo as b4,
+  de as b5,
+  dn as b6,
+  Re as b7,
+  $e as b8,
+  Rs as b9,
+  ya as bA,
+  pa as bB,
+  wa as bC,
+  ja as bD,
+  Da as bE,
+  xa as bF,
+  La as bG,
+  Ga as bH,
+  so as bI,
+  cr as bJ,
+  io as bK,
+  Sr as bL,
+  kr as bM,
+  ve as bN,
+  Is as bO,
+  Ts as bP,
+  bs as bQ,
+  ks as bR,
+  ws as bS,
+  ys as bT,
+  ps as bU,
+  G as bV,
+  qe as bW,
+  Ls as bX,
+  _s as bY,
+  ae as bZ,
+  Os as b_,
+  ho as ba,
+  Gs as bb,
+  Us as bc,
+  zs as bd,
+  Js as be,
+  Ys as bf,
+  Ya as bg,
+  tr as bh,
+  Cr as bi,
+  ir as bj,
+  lr as bk,
+  ur as bl,
+  fr as bm,
+  gr as bn,
+  mr as bo,
+  pr as bp,
+  br as bq,
+  wr as br,
+  Nr as bs,
+  Mr as bt,
+  Hr as bu,
+  Va as bv,
+  Xr as bw,
+  ea as bx,
+  sa as by,
+  fa as bz,
+  Eo as c,
+  Ws as c0,
+  js as c1,
+  Hs as c2,
+  Ks as c3,
+  qs as c4,
+  Qs as c5,
+  Xs as c6,
+  nr as c7,
+  oe as c8,
+  sr as c9,
+  en as cA,
+  Ja as cB,
+  Ha as cC,
+  nn as cD,
+  Xa as cE,
+  ds as cF,
+  sn as cG,
+  Oe as cH,
+  H as cI,
+  Ns as cJ,
+  So as cK,
+  bo as cL,
+  wo as cM,
+  He as ca,
+  hr as cb,
+  Ir as cc,
+  Er as cd,
+  Tr as ce,
+  vr as cf,
+  Dr as cg,
+  Ye as ch,
+  ie as ci,
+  Ur as cj,
+  zr as ck,
+  Vr as cl,
+  Yr as cm,
+  Zr as cn,
+  Qr as co,
+  Qe as cp,
+  ra as cq,
+  na as cr,
+  ca as cs,
+  Ze as ct,
+  tn as cu,
+  ka as cv,
+  Je as cw,
+  Fa as cx,
+  Ma as cy,
+  Ua as cz,
+  go as d,
+  mo as e,
   K as f,
-  no as g,
+  lo as g,
   T as h,
-  ro as i,
+  In as i,
   y as j,
   xt as k,
-  Le as l,
-  io as m,
+  Ge as l,
+  po as m,
   z as n,
   N as o,
   q as p,
-  wa as q,
-  eo as r,
+  Ba as q,
+  co as r,
   tt as s,
   E as t,
-  jn as u,
-  is as v,
-  es as w,
-  En as x,
-  Ms as y,
+  Ka as u,
+  ls as v,
+  qn as w,
+  Ft as x,
+  Wa as y,
   C as z
 };