@genai-fi/nanogpt 0.8.0 → 0.8.2

package/dist/{index-CUQrfsw_.js → index-DdmHGZjq.js}

@@ -17,7 +17,7 @@ import { B as pt } from "./index-Tf7vU29b.js";
  * limitations under the License.
  * =============================================================================
  */
-const Me = 1e-7, De = 1e-4;
+const Fe = 1e-7, Re = 1e-4;
 class Rs {
   constructor(t, n) {
     this.backend = t, this.dataMover = n, this.data = /* @__PURE__ */ new WeakMap(), this.dataIdsCount = 0;
@@ -38,7 +38,7 @@ class Rs {
     return this.dataIdsCount;
   }
 }
-class Fe {
+class xe {
   refCount(t) {
     return B("refCount");
   }
@@ -84,7 +84,7 @@ class Fe {
   }
   /** Returns the smallest representable number.  */
   epsilon() {
-    return this.floatPrecision() === 32 ? Me : De;
+    return this.floatPrecision() === 32 ? Fe : Re;
   }
   dispose() {
     return B("dispose");
@@ -112,7 +112,7 @@ function B(e) {
 function xs(e) {
   let t = e.length, n = 0;
   for (; t > 0; )
-    n = Math.random() * t | 0, t--, Re(e, t, n);
+    n = Math.random() * t | 0, t--, Ne(e, t, n);
 }
 function Ns(e, t, n) {
   return Math.max(e, Math.min(t, n));
@@ -120,7 +120,7 @@ function Ns(e, t, n) {
 function $s(e) {
   return e % 2 === 0 ? e : e + 1;
 }
-function Re(e, t, n) {
+function Ne(e, t, n) {
   const s = e[t];
   e[t] = e[n], e[n] = s;
 }
@@ -130,15 +130,15 @@ function Cs(e) {
     t += e[n];
   return t;
 }
-function y(e, t) {
+function p(e, t) {
   if (!e)
     throw new Error(typeof t == "string" ? t : t());
 }
-function xe(e, t, n = "") {
-  y(xt(e, t), () => n + ` Shapes ${e} and ${t} must match`);
+function te(e, t, n = "") {
+  p(xt(e, t), () => n + ` Shapes ${e} and ${t} must match`);
 }
 function Ps(e) {
-  y(e != null, () => "The input to the tensor constructor must be a non-null value.");
+  p(e != null, () => "The input to the tensor constructor must be a non-null value.");
 }
 function z(e) {
   if (e.length === 0)
@@ -161,14 +161,14 @@ function xt(e, t) {
       return !1;
   return !0;
 }
-function Ne(e) {
+function $e(e) {
   return e % 1 === 0;
 }
 function _s(e) {
   const t = Math.ceil(Math.sqrt(e));
   return [t, Math.ceil(e / t)];
 }
-function ut(e, t) {
+function ht(e, t) {
   return t <= e.length ? e : e + " ".repeat(t - e.length);
 }
 function Os(e, t = (r) => 0, n, s) {
@@ -213,12 +213,12 @@ function Gs(e, t) {
   const r = e.slice();
   return r[s] = t / n, r;
 }
-function $e(e, t) {
+function Ce(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) => Ne(s)), () => `All values in axis param must be integers but got axis ${e}`), e.map((s) => s < 0 ? n + s : s);
+  return e = e == null ? t.map((s, r) => r) : [].concat(e), p(e.every((s) => s >= -n && s < n), () => `All values in axis param must be in range [-${n}, ${n}) but got axis ${e}`), p(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 Us(e, t) {
-  const n = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : $e(t, e).sort();
+  const n = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : Ce(t, e).sort();
   let o = 0;
   for (let i = 0; i < e.length; ++i) {
     if (a != null) {
@@ -231,9 +231,9 @@ function Us(e, t) {
   return { newShape: n, keptDims: s };
 }
 function zs(e, t) {
-  return te(e, t);
+  return ee(e, t);
 }
-function te(e, t) {
+function ee(e, t) {
   let n = null;
   if (e == null || e === "float32")
     n = new Float32Array(t);
@@ -247,14 +247,14 @@ function te(e, t) {
     throw new Error(`Unknown data type ${e}`);
   return n;
 }
-function Ce(e, t) {
+function Pe(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 Pe(e) {
+function Le(e) {
   return e === "bool" || e === "complex64" || e === "float32" || e === "int32" || e === "string";
 }
 function Vs(e, t) {
@@ -269,7 +269,7 @@ function It(e) {
     return 1;
   throw new Error(`Unknown dtype ${e}`);
 }
-function Le(e) {
+function _e(e) {
   if (e == null)
     return 0;
   let t = 0;
@@ -278,16 +278,16 @@ function Le(e) {
 function Nt(e) {
   return typeof e == "string" || e instanceof String;
 }
-function _e(e) {
+function Oe(e) {
   return typeof e == "boolean";
 }
-function Oe(e) {
+function Ge(e) {
   return typeof e == "number";
 }
 function yt(e) {
-  return Array.isArray(e) ? yt(e[0]) : e instanceof Float32Array ? "float32" : e instanceof Int32Array || e instanceof Uint8Array || e instanceof Uint8ClampedArray ? "int32" : Oe(e) ? "float32" : Nt(e) ? "string" : _e(e) ? "bool" : "float32";
+  return Array.isArray(e) ? yt(e[0]) : e instanceof Float32Array ? "float32" : e instanceof Int32Array || e instanceof Uint8Array || e instanceof Uint8ClampedArray ? "int32" : Ge(e) ? "float32" : Nt(e) ? "string" : Oe(e) ? "bool" : "float32";
 }
-function dt(e) {
+function lt(e) {
   return !!(e && e.constructor && e.call && e.apply);
 }
 function Ws(e, t) {
@@ -306,7 +306,7 @@ function $t(e) {
     n[s] = n[s + 1] * e[s + 1];
   return n;
 }
-function ee(e, t, n, s = !1) {
+function ne(e, t, n, s = !1) {
   const r = new Array();
   if (t.length === 1) {
     const a = t[0] * (s ? 2 : 1);
@@ -315,7 +315,7 @@ function ee(e, t, n, s = !1) {
   } 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] = ee(e + c * i, o, n, s);
+      r[c] = ne(e + c * i, o, n, s);
   }
   return r;
 }
@@ -327,7 +327,7 @@ function ct(e, t, n = !1) {
     return [];
   if (s !== t.length)
     throw new Error(`[${e}] does not match the input size ${t.length}${n ? " for a complex tensor" : ""}.`);
-  return ee(0, e, t, n);
+  return ne(0, e, t, n);
 }
 function js(e, t) {
   if (Array.isArray(e))
@@ -340,13 +340,13 @@ function js(e, t) {
     return Uint8Array.from(new Int32Array(e));
   throw new Error(`Unknown dtype ${t}`);
 }
-function Ge(e, t) {
-  const n = ne(e, t);
+function Ue(e, t) {
+  const n = se(e, t);
   for (let s = 0; s < n.length; s++)
     n[s] = 1;
   return n;
 }
-function ne(e, t) {
+function se(e, t) {
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(e);
   if (t === "int32")
@@ -367,7 +367,7 @@ function qs(e, t) {
 }
 function Ct(e) {
   e.forEach((t) => {
-    y(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${e}].`);
+    p(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${e}].`);
   });
 }
 function Ks(e, t, n) {
@@ -410,10 +410,10 @@ function Pt(e) {
  * =============================================================================
  */
 const Ut = "tfjsflags";
-class Ue {
+class ze {
   // tslint:disable-next-line: no-any
   constructor(t) {
-    this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = ze, this.populateURLFlags();
+    this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = Ve, this.populateURLFlags();
   }
   setPlatform(t, n) {
     this.platform != null && (S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(`Platform ${this.platformName} has already been set. Overwriting the platform with ${t}.`)), this.platformName = t, this.platform = n;
@@ -473,27 +473,27 @@ class Ue {
     const t = this.getQueryParams(this.global.location.search);
     Ut in t && t[Ut].split(",").forEach((s) => {
       const [r, a] = s.split(":");
-      this.urlFlags[r] = We(r, a);
+      this.urlFlags[r] = je(r, a);
     });
   }
 }
-function ze(e) {
+function Ve(e) {
   const t = {};
-  return e.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (n, ...s) => (Ve(t, s[0], s[1]), s.join("="))), t;
+  return e.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (n, ...s) => (We(t, s[0], s[1]), s.join("="))), t;
 }
-function Ve(e, t, n) {
+function We(e, t, n) {
   e[decodeURIComponent(t)] = decodeURIComponent(n || "");
 }
-function We(e, t) {
+function je(e, t) {
   const n = t.toLowerCase();
   return n === "true" || n === "false" ? n === "true" : `${+n}` === n ? +n : t;
 }
 function S() {
-  return se;
+  return re;
 }
-let se = null;
-function je(e) {
-  se = e;
+let re = null;
+function qe(e) {
+  re = e;
 }
 /**
  * @license
@@ -512,7 +512,7 @@ function je(e) {
  * =============================================================================
  */
 let bt;
-function re() {
+function ae() {
   if (bt == null) {
     let e;
     if (typeof window < "u")
@@ -529,12 +529,12 @@ function re() {
   }
   return bt;
 }
-function qe() {
-  const e = re();
+function Ke() {
+  const e = ae();
   return e._tfGlobals == null && (e._tfGlobals = /* @__PURE__ */ new Map()), e._tfGlobals;
 }
 function Lt(e, t) {
-  const n = qe();
+  const n = Ke();
   if (n.has(e))
     return n.get(e);
   {
@@ -542,7 +542,7 @@ function Lt(e, t) {
     return n.set(e, s), n.get(e);
   }
 }
-const Ke = "Abs", Xs = "Acos", Js = "Acosh", ae = "Add", Ys = "AddN", Zs = "All", Qs = "Any", tr = "ArgMax", er = "ArgMin", nr = "Asin", sr = "Asinh", rr = "Atan", ar = "Atanh", or = "Atan2", ir = "AvgPool", cr = "AvgPoolGrad", lr = "AvgPool3D", ur = "AvgPool3DGrad", hr = "BatchMatMul", dr = "BatchToSpaceND", fr = "Bincount", gr = "BitwiseAnd", mr = "BroadcastTo", pr = "BroadcastArgs", oe = "Cast", yr = "Ceil", br = "ClipByValue", wr = "Complex", He = "ComplexAbs", Sr = "Concat", kr = "Conv2D", Ir = "Conv2DBackpropFilter", Tr = "Conv2DBackpropInput", Er = "Conv3D", Ar = "Conv3DBackpropFilterV2", vr = "Conv3DBackpropInputV2", Br = "Cos", Mr = "Cosh", Dr = "Cumprod", Fr = "Cumsum", Rr = "CropAndResize", xr = "DenseBincount", Nr = "DepthToSpace", $r = "DepthwiseConv2dNative", Cr = "DepthwiseConv2dNativeBackpropFilter", Pr = "DepthwiseConv2dNativeBackpropInput", Lr = "Diag", _r = "Dilation2D", Or = "Dilation2DBackpropInput", Gr = "Dilation2DBackpropFilter", Ur = "Draw", Xe = "RealDiv", zr = "Einsum", Vr = "Elu", Wr = "EluGrad", jr = "Erf", qr = "Equal", Kr = "Exp", Hr = "ExpandDims", Xr = "Expm1", Jr = "FFT", Je = "Fill", Yr = "FlipLeftRight", Zr = "Floor", Ye = "FloorDiv", Qr = "FusedBatchNorm", ta = "GatherV2", ea = "GatherNd", na = "Greater", sa = "GreaterEqual", ie = "Identity", ra = "IFFT", aa = "Imag", oa = "IsFinite", ia = "IsInf", ca = "IsNan", la = "LeakyRelu", ua = "Less", ha = "LessEqual", da = "LinSpace", fa = "Log", ga = "Log1p", ma = "LogicalAnd", pa = "LogicalNot", ya = "LogicalOr", ba = "LogSoftmax", wa = "LRN", Sa = "LRNGrad", ka = "Max", Ze = "Maximum", Ia = "MaxPool", Ta = "MaxPoolGrad", Ea = "MaxPool3D", Aa = "MaxPool3DGrad", va = "MaxPoolWithArgmax", Ba = "Mean", Ma = "Min", Da = "Minimum", Fa = "MirrorPad", Ra = "Mod", xa = "Multinomial", Qe = "Multiply", Na = "Neg", $a = "NotEqual", Ca = "NonMaxSuppressionV3", Pa = "NonMaxSuppressionV4", La = "NonMaxSuppressionV5", _a = "OnesLike", Oa = "OneHot", Ga = "Pack", Ua = "PadV2", tn = "Pow", za = "Prelu", Va = "Prod", Wa = "RaggedGather", ja = "RaggedRange", qa = "RaggedTensorToTensor", Ka = "Range", Ha = "Real", Xa = "Reciprocal", Ja = "Relu", Ya = "Reshape", Za = "ResizeNearestNeighbor", Qa = "ResizeNearestNeighborGrad", to = "ResizeBilinear", eo = "ResizeBilinearGrad", no = "Relu6", so = "Reverse", ro = "Round", ao = "Rsqrt", oo = "ScatterNd", io = "TensorScatterUpdate", co = "SearchSorted", lo = "Select", uo = "Selu", ho = "Slice", fo = "Sin", go = "Sinh", mo = "Sign", po = "Sigmoid", yo = "Softplus", en = "Sqrt", bo = "Sum", wo = "SpaceToBatchND", So = "SplitV", ko = "Softmax", Io = "SparseFillEmptyRows", To = "SparseReshape", Eo = "SparseSegmentMean", Ao = "SparseSegmentSum", vo = "SparseToDense", Bo = "SquaredDifference", Mo = "Square", Do = "StaticRegexReplace", Fo = "StridedSlice", Ro = "StringNGrams", xo = "StringSplit", No = "StringToHashBucketFast", nn = "Sub", $o = "Tan", Co = "Tanh", Po = "Tile", Lo = "TopK", _o = "Transform", Oo = "Transpose", Go = "Unique", Uo = "Unpack", zo = "UnsortedSegmentSum", sn = "ZerosLike", Vo = "Step", Wo = "FromPixels", jo = "RotateWithOffset", qo = "_FusedMatMul", Ko = "FusedConv2D", Ho = "FusedDepthwiseConv2D";
+const He = "Abs", Xs = "Acos", Js = "Acosh", oe = "Add", Ys = "AddN", Zs = "All", Qs = "Any", tr = "ArgMax", er = "ArgMin", nr = "Asin", sr = "Asinh", rr = "Atan", ar = "Atanh", or = "Atan2", ir = "AvgPool", cr = "AvgPoolGrad", lr = "AvgPool3D", ur = "AvgPool3DGrad", hr = "BatchMatMul", dr = "BatchToSpaceND", fr = "Bincount", gr = "BitwiseAnd", mr = "BroadcastTo", pr = "BroadcastArgs", ie = "Cast", yr = "Ceil", br = "ClipByValue", wr = "Complex", Xe = "ComplexAbs", Sr = "Concat", kr = "Conv2D", Ir = "Conv2DBackpropFilter", Tr = "Conv2DBackpropInput", Ar = "Conv3D", Er = "Conv3DBackpropFilterV2", vr = "Conv3DBackpropInputV2", Br = "Cos", Mr = "Cosh", Dr = "Cumprod", Fr = "Cumsum", Rr = "CropAndResize", xr = "DenseBincount", Nr = "DepthToSpace", $r = "DepthwiseConv2dNative", Cr = "DepthwiseConv2dNativeBackpropFilter", Pr = "DepthwiseConv2dNativeBackpropInput", Lr = "Diag", _r = "Dilation2D", Or = "Dilation2DBackpropInput", Gr = "Dilation2DBackpropFilter", Ur = "Draw", Je = "RealDiv", zr = "Einsum", Vr = "Elu", Wr = "EluGrad", jr = "Erf", qr = "Equal", Kr = "Exp", Hr = "ExpandDims", Xr = "Expm1", Jr = "FFT", Ye = "Fill", Yr = "FlipLeftRight", Zr = "Floor", Ze = "FloorDiv", Qr = "FusedBatchNorm", ta = "GatherV2", ea = "GatherNd", na = "Greater", sa = "GreaterEqual", ce = "Identity", ra = "IFFT", aa = "Imag", oa = "IsFinite", ia = "IsInf", ca = "IsNan", la = "LeakyRelu", ua = "Less", ha = "LessEqual", da = "LinSpace", fa = "Log", ga = "Log1p", ma = "LogicalAnd", pa = "LogicalNot", ya = "LogicalOr", ba = "LogSoftmax", wa = "LRN", Sa = "LRNGrad", ka = "Max", Qe = "Maximum", Ia = "MaxPool", Ta = "MaxPoolGrad", Aa = "MaxPool3D", Ea = "MaxPool3DGrad", va = "MaxPoolWithArgmax", Ba = "Mean", Ma = "Min", Da = "Minimum", Fa = "MirrorPad", Ra = "Mod", xa = "Multinomial", tn = "Multiply", Na = "Neg", $a = "NotEqual", Ca = "NonMaxSuppressionV3", Pa = "NonMaxSuppressionV4", La = "NonMaxSuppressionV5", _a = "OnesLike", Oa = "OneHot", Ga = "Pack", Ua = "PadV2", en = "Pow", za = "Prelu", Va = "Prod", Wa = "RaggedGather", ja = "RaggedRange", qa = "RaggedTensorToTensor", Ka = "Range", Ha = "Real", Xa = "Reciprocal", Ja = "Relu", Ya = "Reshape", Za = "ResizeNearestNeighbor", Qa = "ResizeNearestNeighborGrad", to = "ResizeBilinear", eo = "ResizeBilinearGrad", no = "Relu6", so = "Reverse", ro = "Round", ao = "Rsqrt", oo = "ScatterNd", io = "TensorScatterUpdate", co = "SearchSorted", lo = "Select", uo = "Selu", ho = "Slice", fo = "Sin", go = "Sinh", mo = "Sign", po = "Sigmoid", yo = "Softplus", nn = "Sqrt", bo = "Sum", wo = "SpaceToBatchND", So = "SplitV", ko = "Softmax", Io = "SparseFillEmptyRows", To = "SparseReshape", Ao = "SparseSegmentMean", Eo = "SparseSegmentSum", vo = "SparseToDense", Bo = "SquaredDifference", Mo = "Square", Do = "StaticRegexReplace", Fo = "StridedSlice", Ro = "StringNGrams", xo = "StringSplit", No = "StringToHashBucketFast", sn = "Sub", $o = "Tan", Co = "Tanh", Po = "Tile", Lo = "TopK", _o = "Transform", Oo = "Transpose", Go = "Unique", Uo = "Unpack", zo = "UnsortedSegmentSum", rn = "ZerosLike", Vo = "Step", Wo = "FromPixels", jo = "RotateWithOffset", qo = "_FusedMatMul", Ko = "FusedConv2D", Ho = "FusedDepthwiseConv2D";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -583,7 +583,7 @@ function Xo(...e) {
  */
 const ft = Lt("kernelRegistry", () => /* @__PURE__ */ new Map()), Tt = Lt("gradRegistry", () => /* @__PURE__ */ new Map());
 function zt(e, t) {
-  const n = ce(e, t);
+  const n = le(e, t);
   return ft.get(n);
 }
 function Vt(e) {
@@ -601,14 +601,14 @@ function Wt(e) {
   return n;
 }
 function Jo(e) {
-  const { kernelName: t, backendName: n } = e, s = ce(t, n);
+  const { kernelName: t, backendName: n } = e, s = le(t, n);
   ft.has(s) && O(`The kernel '${t}' for backend '${n}' is already registered`), ft.set(s, e);
 }
 function Yo(e) {
   const { kernelName: t } = e;
   Tt.has(t) && S().getBool("DEBUG") && O(`Overriding the gradient for '${t}'`), Tt.set(t, e);
 }
-function ce(e, t) {
+function le(e, t) {
   return `${t}_${e}`;
 }
 /**
@@ -627,7 +627,7 @@ function ce(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function le(e) {
+function ue(e) {
   return e instanceof Float32Array || e instanceof Int32Array || e instanceof Uint8Array || e instanceof Uint8ClampedArray;
 }
 /**
@@ -647,15 +647,15 @@ function le(e) {
  * =============================================================================
  */
 function Zo(e, t) {
-  return t === "string" ? ue(e) : _t([e], t);
+  return t === "string" ? he(e) : _t([e], t);
 }
-function rn(e, t) {
+function an(e, t) {
   return e instanceof Float32Array && t === "float32" || e instanceof Int32Array && t === "int32" || e instanceof Uint8Array && t === "bool";
 }
 function _t(e, t) {
   if (t === "string")
     throw new Error("Cannot convert a string[] to a TypedArray");
-  if (Array.isArray(e) && (e = lt(e)), S().getBool("DEBUG") && Ce(e, t), rn(e, t))
+  if (Array.isArray(e) && (e = ut(e)), S().getBool("DEBUG") && Pe(e, t), an(e, t))
     return e;
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(e);
@@ -672,27 +672,27 @@ function _t(e, t) {
 function gt() {
   return S().platform.now();
 }
-function ue(e, t = "utf-8") {
+function he(e, t = "utf-8") {
   return t = t || "utf-8", S().platform.encode(e, t);
 }
 function jt(e, t = "utf-8") {
   return t = t || "utf-8", S().platform.decode(e, t);
 }
-function F(e) {
-  return S().platform.isTypedArray != null ? S().platform.isTypedArray(e) : le(e);
+function R(e) {
+  return S().platform.isTypedArray != null ? S().platform.isTypedArray(e) : ue(e);
 }
-function lt(e, t = [], n = !1) {
-  if (t == null && (t = []), typeof e == "boolean" || typeof e == "number" || typeof e == "string" || Pt(e) || e == null || F(e) && n)
+function ut(e, t = [], n = !1) {
+  if (t == null && (t = []), typeof e == "boolean" || typeof e == "number" || typeof e == "string" || Pt(e) || e == null || R(e) && n)
     t.push(e);
-  else if (Array.isArray(e) || F(e))
+  else if (Array.isArray(e) || R(e))
     for (let s = 0; s < e.length; ++s)
-      lt(e[s], t, n);
+      ut(e[s], t, n);
   else {
     let s = -1;
     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++)
-      lt(e[r], t, n);
+      ut(e[r], t, n);
   }
   return t;
 }
@@ -712,9 +712,9 @@ function lt(e, t = [], n = !1) {
  * limitations under the License.
  * =============================================================================
  */
-class an {
+class on {
   constructor(t, n) {
-    this.backendTimer = t, this.logger = n, n == null && (this.logger = new cn());
+    this.backendTimer = t, this.logger = n, n == null && (this.logger = new ln());
   }
   profileKernel(t, n, s) {
     let r;
@@ -735,7 +735,7 @@ class an {
       for (let l = 0; l < r.length; l++) {
         const u = r[l];
         u.data().then((h) => {
-          on(h, u.dtype, t);
+          cn(h, u.dtype, t);
         });
       }
     return {
@@ -755,7 +755,7 @@ class an {
     });
   }
 }
-function on(e, t, n) {
+function cn(e, t, n) {
   if (t !== "float32")
     return !1;
   for (let s = 0; s < e.length; s++) {
@@ -765,14 +765,14 @@ function on(e, t, n) {
   }
   return !1;
 }
-class cn {
+class ln {
   logKernelProfile(t, n, s, r, a, o) {
-    const i = typeof r == "number" ? ut(`${r}ms`, 9) : r.error, c = ut(t, 25), l = n.rank, u = n.size, h = ut(n.shape.toString(), 14);
+    const i = typeof r == "number" ? ht(`${r}ms`, 9) : r.error, c = ht(t, 25), l = n.rank, u = n.size, h = ht(n.shape.toString(), 14);
     let d = "";
     for (const m in a) {
-      const p = a[m];
-      if (p != null) {
-        const g = p.shape || n.shape, w = g.length;
+      const y = a[m];
+      if (y != null) {
+        const g = y.shape || n.shape, w = g.length;
         d += `${m}: ${w}D ${w > 0 ? g : ""} `;
       }
     }
@@ -795,7 +795,7 @@ class cn {
  * limitations under the License.
  * =============================================================================
  */
-function ln(e, t, n) {
+function un(e, t, n) {
   const s = {}, r = {};
   for (let c = 0; c < t.length; c++)
     s[t[c].id] = !0;
@@ -804,7 +804,7 @@ function ln(e, t, n) {
     for (const h in u) {
       const d = u[h];
       let m = !1;
-      for (let p = 0; p < t.length; p++)
+      for (let y = 0; y < t.length; y++)
         if (s[d.id]) {
           l.outputs.forEach((g) => s[g.id] = !0), m = !0, r[l.id] = !0;
           break;
@@ -840,7 +840,7 @@ function ln(e, t, n) {
   }
   return i;
 }
-function un(e, t, n, s) {
+function hn(e, t, n, s) {
   for (let r = t.length - 1; r >= 0; r--) {
     const a = t[r], o = [];
     if (a.outputs.forEach((c) => {
@@ -884,13 +884,13 @@ function un(e, t, n, s) {
  * =============================================================================
  */
 const qt = 20, at = 3, wt = 7;
-function hn(e, t, n, s) {
-  const r = $t(t), a = dn(e, t, n, r), o = t.length, i = ht(e, t, n, r, a), c = ["Tensor"];
+function dn(e, t, n, s) {
+  const r = $t(t), a = fn(e, t, n, r), o = t.length, i = dt(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 dn(e, t, n, s) {
+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++) {
@@ -902,19 +902,19 @@ function dn(e, t, n, s) {
 }
 function ot(e, t, n) {
   let s;
-  return Array.isArray(e) ? s = `${parseFloat(e[0].toFixed(wt))} + ${parseFloat(e[1].toFixed(wt))}j` : Nt(e) ? s = `'${e}'` : n === "bool" ? s = he(e) : s = parseFloat(e.toFixed(wt)).toString(), ut(s, t);
+  return Array.isArray(e) ? s = `${parseFloat(e[0].toFixed(wt))} + ${parseFloat(e[1].toFixed(wt))}j` : Nt(e) ? s = `'${e}'` : n === "bool" ? s = de(e) : s = parseFloat(e.toFixed(wt)).toString(), ht(s, t);
 }
-function he(e) {
+function de(e) {
   return e === 0 ? "false" : "true";
 }
-function ht(e, t, n, s, r, a = !0) {
+function dt(e, t, n, s, r, a = !0) {
   const o = n === "complex64" ? 2 : 1, i = t[0], c = t.length;
   if (c === 0) {
     if (n === "complex64") {
       const g = it(e);
       return [ot(g[0], 0, n)];
     }
-    return n === "bool" ? [he(e[0])] : [e[0].toString()];
+    return n === "bool" ? [de(e[0])] : [e[0].toString()];
   }
   if (c === 1) {
     if (i > qt) {
@@ -932,7 +932,7 @@ function ht(e, t, n, s, r, a = !0) {
   if (i > qt) {
     for (let g = 0; g < at; g++) {
       const w = g * h, I = w + h;
-      d.push(...ht(
+      d.push(...dt(
         e.slice(w, I),
         l,
         n,
@@ -945,7 +945,7 @@ function ht(e, t, n, s, r, a = !0) {
     d.push("...");
     for (let g = i - at; g < i; g++) {
       const w = g * h, I = w + h;
-      d.push(...ht(
+      d.push(...dt(
         e.slice(w, I),
         l,
         n,
@@ -958,7 +958,7 @@ function ht(e, t, n, s, r, a = !0) {
   } else
     for (let g = 0; g < i; g++) {
       const w = g * h, I = w + h;
-      d.push(...ht(
+      d.push(...dt(
         e.slice(w, I),
         l,
         n,
@@ -972,12 +972,12 @@ function ht(e, t, n, s, r, a = !0) {
   d[0] = "[" + (i > 0 ? d[0] + m : "");
   for (let g = 1; g < d.length - 1; g++)
     d[g] = " " + d[g] + m;
-  let p = `,
+  let y = `,
 `;
   for (let g = 2; g < c; g++)
-    p += `
+    y += `
 `;
-  return d[d.length - 1] = " " + d[d.length - 1] + "]" + (a ? "" : p), d;
+  return d[d.length - 1] = " " + d[d.length - 1] + "]" + (a ? "" : y), d;
 }
 function it(e) {
   const t = [];
@@ -1001,15 +1001,15 @@ function it(e) {
  * limitations under the License.
  * =============================================================================
  */
-class fn {
+class gn {
   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}'.`);
+      p(r === this.size, () => `Length of values '${r}' does not match the size inferred by the shape '${this.size}'.`);
     }
     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 || te(n, this.size), this.strides = $t(t);
+    this.values = s || ee(n, this.size), this.strides = $t(t);
   }
   /**
    * Sets a value in the buffer at a given location.
@@ -1020,7 +1020,7 @@ class fn {
    * @doc {heading: 'Tensors', subheading: 'Creation'}
    */
   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})`);
+    n.length === 0 && (n = [0]), p(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;
   }
@@ -1075,17 +1075,17 @@ class fn {
    * @doc {heading: 'Tensors', subheading: 'Creation'}
    */
   toTensor() {
-    return R().makeTensor(this.values, this.shape, this.dtype);
+    return x().makeTensor(this.values, this.shape, this.dtype);
   }
 }
-let R = null, Y = null;
-function gn(e) {
-  R = e;
-}
+let x = null, Y = null;
 function mn(e) {
+  x = e;
+}
+function pn(e) {
   Y = e;
 }
-class x {
+class M {
   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";
   }
@@ -1135,7 +1135,7 @@ class x {
    */
   async data() {
     this.throwIfDisposed();
-    const t = R().read(this.dataId);
+    const t = x().read(this.dataId);
     if (this.dtype === "string") {
       const n = await t;
       try {
@@ -1181,7 +1181,7 @@ class x {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dataToGPU(t) {
-    return this.throwIfDisposed(), R().readToGPU(this.dataId, t);
+    return this.throwIfDisposed(), x().readToGPU(this.dataId, t);
   }
   /**
    * Synchronously downloads the values from the `tf.Tensor`. This blocks the
@@ -1191,7 +1191,7 @@ class x {
    */
   dataSync() {
     this.throwIfDisposed();
-    const t = R().readSync(this.dataId);
+    const t = x().readSync(this.dataId);
     if (this.dtype === "string")
       try {
         return t.map((n) => jt(n));
@@ -1203,7 +1203,7 @@ class x {
   /** Returns the underlying bytes of the tensor's data. */
   async bytes() {
     this.throwIfDisposed();
-    const t = await R().read(this.dataId);
+    const t = await x().read(this.dataId);
     return this.dtype === "string" ? t : new Uint8Array(t.buffer);
   }
   /**
@@ -1212,7 +1212,7 @@ class x {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dispose() {
-    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), R().disposeTensor(this), this.isDisposedInternal = !0);
+    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), x().disposeTensor(this), this.isDisposedInternal = !0);
   }
   get isDisposed() {
     return this.isDisposedInternal;
@@ -1246,23 +1246,23 @@ class x {
    */
   toString(t = !1) {
     const n = this.dataSync();
-    return hn(n, this.shape, this.dtype, t);
+    return dn(n, this.shape, this.dtype, t);
   }
   cast(t) {
     return this.throwIfDisposed(), Y.cast(this, t);
   }
   variable(t = !0, n, s) {
-    return this.throwIfDisposed(), R().makeVariable(this, t, n, s);
+    return this.throwIfDisposed(), x().makeVariable(this, t, n, s);
   }
 }
-Object.defineProperty(x, Symbol.hasInstance, {
+Object.defineProperty(M, Symbol.hasInstance, {
   value: (e) => !!e && e.data != null && e.dataSync != null && e.throwIfDisposed != null
 });
-function de() {
-  return Lt("Tensor", () => x);
+function fe() {
+  return Lt("Tensor", () => M);
 }
-de();
-class mt extends x {
+fe();
+class mt extends M {
   constructor(t, n, s, r) {
     super(t.shape, t.dtype, t.dataId, r), this.trainable = n, this.name = s;
   }
@@ -1279,18 +1279,18 @@ class mt extends x {
       throw new Error(`dtype of the new value (${t.dtype}) and previous value (${this.dtype}) must match`);
     if (!xt(t.shape, this.shape))
       throw new Error(`shape of the new value (${t.shape}) and previous value (${this.shape}) must match`);
-    R().disposeTensor(this), this.dataId = t.dataId, R().incRef(
+    x().disposeTensor(this), this.dataId = t.dataId, x().incRef(
       this,
       null
       /* backend */
     );
   }
   dispose() {
-    R().disposeVariable(this), this.isDisposedInternal = !0;
+    x().disposeVariable(this), this.isDisposedInternal = !0;
   }
 }
 Object.defineProperty(mt, Symbol.hasInstance, {
-  value: (e) => e instanceof x && e.assign != null && e.assign instanceof Function
+  value: (e) => e instanceof M && e.assign != null && e.assign instanceof Function
 });
 /**
  * @license
@@ -1312,14 +1312,14 @@ var Kt;
 (function(e) {
   e.R0 = "R0", e.R1 = "R1", e.R2 = "R2", e.R3 = "R3", e.R4 = "R4", e.R5 = "R5", e.R6 = "R6";
 })(Kt || (Kt = {}));
-var Et;
+var At;
 (function(e) {
   e.float32 = "float32", e.int32 = "int32", e.bool = "int32", e.complex64 = "complex64";
-})(Et || (Et = {}));
-var At;
+})(At || (At = {}));
+var Et;
 (function(e) {
   e.float32 = "float32", e.int32 = "int32", e.bool = "bool", e.complex64 = "complex64";
-})(At || (At = {}));
+})(Et || (Et = {}));
 var vt;
 (function(e) {
   e.float32 = "float32", e.int32 = "float32", e.bool = "float32", e.complex64 = "complex64";
@@ -1328,27 +1328,27 @@ var Bt;
 (function(e) {
   e.float32 = "complex64", e.int32 = "complex64", e.bool = "complex64", e.complex64 = "complex64";
 })(Bt || (Bt = {}));
-const pn = {
+const yn = {
   float32: vt,
-  int32: Et,
-  bool: At,
+  int32: At,
+  bool: Et,
   complex64: Bt
 };
-function fe(e, t) {
+function ge(e, t) {
   if (e === "string" || t === "string") {
     if (e === "string" && t === "string")
       return "string";
     throw new Error(`Can not upcast ${e} with ${t}`);
   }
-  return pn[e][t];
+  return yn[e][t];
 }
 function Qo(e) {
-  return fe(e, "int32");
+  return ge(e, "int32");
 }
-function ge(e) {
+function me(e) {
   return e != null && typeof e == "object" && "texture" in e && e.texture instanceof WebGLTexture;
 }
-function me(e) {
+function pe(e) {
   return typeof GPUBuffer < "u" && e != null && typeof e == "object" && "buffer" in e && e.buffer instanceof GPUBuffer;
 }
 /**
@@ -1370,32 +1370,32 @@ function me(e) {
 function K(e, t) {
   if (e.dtype === t.dtype)
     return [e, t];
-  const n = fe(e.dtype, t.dtype);
+  const n = ge(e.dtype, t.dtype);
   return [e.cast(n), t.cast(n)];
 }
 function ti(e, t) {
   return t.some((n) => n.id === e.id);
 }
-function pe(e) {
+function ye(e) {
   const t = [];
-  return ye(e, t, /* @__PURE__ */ new Set()), t;
+  return be(e, t, /* @__PURE__ */ new Set()), t;
 }
-function ye(e, t, n) {
+function be(e, t, n) {
   if (e == null)
     return;
-  if (e instanceof x) {
+  if (e instanceof M) {
     t.push(e);
     return;
   }
-  if (!yn(e))
+  if (!bn(e))
     return;
   const s = e;
   for (const r in s) {
     const a = s[r];
-    n.has(a) || (n.add(a), ye(a, t, n));
+    n.has(a) || (n.add(a), be(a, t, n));
   }
 }
-function yn(e) {
+function bn(e) {
   return Array.isArray(e) || typeof e == "object";
 }
 /**
@@ -1494,7 +1494,7 @@ class et {
       if (!(s ? await n : n))
         return !1;
     }
-    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new an(this.backendInstance), !0;
+    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new on(this.backendInstance), !0;
   }
   setupRegisteredKernels() {
     Wt(this.backendName).forEach((n) => {
@@ -1518,7 +1518,7 @@ class et {
       throw new Error(`Cannot initialize backend ${t}, no registration found.`);
     try {
       const s = n.factory();
-      if (s && !(s instanceof Fe) && typeof s.then == "function") {
+      if (s && !(s instanceof xe) && 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
@@ -1588,11 +1588,11 @@ class et {
    * execution.
    */
   clone(t) {
-    const n = f.runKernel(ie, { x: t }), s = { x: t }, r = (o) => ({
+    const n = f.runKernel(ce, { x: t }), s = { x: t }, r = (o) => ({
       x: () => {
         const i = "float32", c = { x: o }, l = { dtype: i };
         return f.runKernel(
-          oe,
+          ie,
           c,
           // tslint:disable-next-line: no-unnecessary-type-assertion
           l
@@ -1646,28 +1646,28 @@ class et {
     let c;
     const l = St(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
     if (St(t)) {
-      const { kernelName: p, inputs: g, attrs: w } = t;
+      const { kernelName: y, inputs: g, attrs: w } = t;
       this.backendName == null && this.backend;
-      const I = zt(p, this.backendName);
-      y(I != null, () => `Cannot find registered kernel '${p}' for backend '${this.backendName}'`), i = () => {
+      const I = zt(y, this.backendName);
+      p(I != null, () => `Cannot find registered kernel '${y}' for backend '${this.backendName}'`), i = () => {
         const _ = this.backend.numDataIds();
         c = I.kernelFunc({ inputs: g, attrs: w, backend: this.backend });
         const X = Array.isArray(c) ? c : [c];
-        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(p, _, X);
+        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(y, _, X);
         const J = X.map((rt) => rt.rank != null ? rt : this.makeTensorFromTensorInfo(rt));
         if (r) {
-          const rt = this.getTensorsForGradient(p, g, J);
+          const rt = this.getTensorsForGradient(y, g, J);
           s = this.saveTensorsForBackwardMode(rt);
         }
         return J;
       };
     } else {
-      const { forwardFunc: p } = t, g = (w) => {
+      const { forwardFunc: y } = t, g = (w) => {
         r && (s = w.map((I) => this.keep(this.clone(I))));
       };
       i = () => {
         const w = this.backend.numDataIds();
-        c = this.tidy(() => p(this.backend, g));
+        c = this.tidy(() => y(this.backend, g));
         const I = Array.isArray(c) ? c : [c];
         return this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(l, w, I), I;
       };
@@ -1687,8 +1687,8 @@ class et {
       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: n.map((p) => p.shape),
+      inputShapes: Object.keys(u).map((y) => u[y] != null ? u[y].shape : null),
+      outputShapes: n.map((y) => y.shape),
       kernelTimeMs: m.timeMs,
       extraInfo: m.extraInfo
     }), Array.isArray(c) ? n : n[0];
@@ -1713,7 +1713,7 @@ class et {
     if (r != null) {
       const a = r.inputsToSave || [], o = r.outputsToSave || [];
       let i;
-      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]);
+      r.saveAllInputs ? (p(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);
     }
@@ -1729,10 +1729,10 @@ class et {
       throw new Error("Values passed to engine.makeTensor() are null");
     s = s || "float32", r = r || this.backend;
     let a = t;
-    s === "string" && Nt(t[0]) && (a = t.map((c) => ue(c)));
-    const o = r.write(a, n, s), i = new x(n, s, o, this.nextTensorId());
+    s === "string" && Nt(t[0]) && (a = t.map((c) => he(c)));
+    const o = r.write(a, n, s), i = new M(n, s, o, this.nextTensorId());
     if (this.trackTensor(i, r), s === "string") {
-      const c = this.state.tensorInfo.get(o), l = Le(a);
+      const c = this.state.tensorInfo.get(o), l = _e(a);
       this.state.numBytes += l - c.bytes, c.bytes = l;
     }
     return i;
@@ -1754,7 +1754,7 @@ class et {
    * only increments the ref count used in memory tracking.
    */
   makeTensorFromTensorInfo(t, n) {
-    const { dataId: s, shape: r, dtype: a } = t, o = new x(r, a, s, this.nextTensorId());
+    const { dataId: s, shape: r, dtype: a } = t, o = new M(r, a, s, this.nextTensorId());
     return this.trackTensor(o, n), o;
   }
   makeVariable(t, n = !0, s, r) {
@@ -1823,7 +1823,7 @@ class et {
     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 = ne(d.size, d.dtype);
+        const d = s[h], m = se(d.size, d.dtype);
         return this.makeTensor(m, d.shape, d.dtype);
       }
       return u;
@@ -1855,7 +1855,7 @@ class et {
    * as scope() without the need for a function closure.
    */
   endScope(t) {
-    const n = pe(t), s = new Set(n.map((a) => a.id));
+    const n = ye(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();
@@ -1872,22 +1872,22 @@ class et {
    * gradient, which defaults to `1`.
    */
   gradients(t, n, s, r = !1) {
-    if (y(n.length > 0, () => "gradients() received an empty list of xs."), s != null && s.dtype !== "float32")
+    if (p(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 x, () => "The result y returned by f() must be a tensor.");
-    const o = ln(this.state.activeTape, n, a);
+    p(a instanceof M, () => "The result y returned by f() must be a tensor.");
+    const o = un(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 ?? bn(a.shape), un(
+      i[a.id] = s ?? wn(a.shape), hn(
         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`.
-        wn
+        Sn
       );
       const c = n.map((l) => i[l.id]);
       return this.state.gradientDepth === 0 && (this.state.activeTape.forEach((l) => {
@@ -1897,16 +1897,16 @@ class et {
     });
   }
   customGrad(t) {
-    return y(dt(t), () => "The f passed in customGrad(f) must be a function."), (...n) => {
-      y(n.every((i) => i instanceof x), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
+    return p(lt(t), () => "The f passed in customGrad(f) must be a function."), (...n) => {
+      p(n.every((i) => i instanceof M), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
       let s;
       const r = {};
       n.forEach((i, c) => {
         r[c] = i;
       });
-      const a = (i, c) => (s = t(...n, c), y(s.value instanceof x, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), y(dt(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), p(s.value instanceof M, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), p(lt(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 === 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((d) => d instanceof x), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns a list of only tensors.");
+        p(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(...)."), p(u.every((d) => d instanceof M), () => "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;
@@ -1957,22 +1957,22 @@ class et {
 }
 et.nextTensorId = 0;
 et.nextVariableId = 0;
-function bn(e) {
-  const t = Ge(z(e), "float32");
+function wn(e) {
+  const t = Ue(z(e), "float32");
   return f.makeTensor(t, e, "float32");
 }
-function be() {
-  const e = re();
+function we() {
+  const e = ae();
   if (e._tfengine == null) {
-    const t = new Ue(e);
+    const t = new ze(e);
     e._tfengine = new et(t);
   }
-  return je(e._tfengine.ENV), gn(() => e._tfengine), e._tfengine;
+  return qe(e._tfengine.ENV), mn(() => e._tfengine), e._tfengine;
 }
-const f = be();
-function wn(e, t) {
+const f = we();
+function Sn(e, t) {
   const n = { a: e, b: t };
-  return f.runKernel(ae, n);
+  return f.runKernel(oe, n);
 }
 /**
  * @license
@@ -1990,11 +1990,11 @@ function wn(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function Sn() {
+function kn() {
   return typeof navigator < "u" && navigator != null;
 }
 function ei(e) {
-  if (e || Sn()) {
+  if (e || kn()) {
     if (e || (e = navigator), e.product === "ReactNative")
       return !0;
     const t = e.userAgent || e.vendor || // tslint:disable-next-line:no-any
@@ -2008,7 +2008,7 @@ function ei(e) {
   }
   return !1;
 }
-function kn() {
+function In() {
   return typeof window < "u" && window.document != null || //@ts-ignore
   typeof WorkerGlobalScope < "u";
 }
@@ -2016,7 +2016,7 @@ const v = S();
 v.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.");
 });
-v.registerFlag("IS_BROWSER", () => kn());
+v.registerFlag("IS_BROWSER", () => In());
 v.registerFlag("IS_NODE", () => typeof Q < "u" && typeof Q.versions < "u" && typeof Q.versions.node < "u");
 v.registerFlag("IS_CHROME", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Chrome/.test(navigator.userAgent) && /Google Inc/.test(navigator.vendor));
 v.registerFlag("IS_SAFARI", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Safari/.test(navigator.userAgent) && /Apple/.test(navigator.vendor));
@@ -2044,31 +2044,31 @@ v.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
  * limitations under the License.
  * =============================================================================
  */
-function In(e, t) {
+function Tn(e, t) {
   let n = e;
-  if (F(e))
+  if (R(e))
     return t === "string" ? [] : [e.length];
-  if (ge(e)) {
+  if (me(e)) {
     const r = e.channels || "RGBA";
     return [e.height, e.width * r.length];
-  } else if (me(e))
+  } else if (pe(e))
     return [e.buffer.size / (t == null ? 4 : It(t))];
   if (!Array.isArray(e))
     return [];
   const s = [];
-  for (; Array.isArray(n) || F(n) && t !== "string"; )
+  for (; Array.isArray(n) || R(n) && t !== "string"; )
     s.push(n.length), n = n[0];
-  return Array.isArray(e) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && we(e, s, []), s;
+  return Array.isArray(e) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && Se(e, s, []), s;
 }
-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`);
+function Se(e, t, n) {
+  if (n = n || [], !Array.isArray(e) && !R(e)) {
+    p(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[${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`);
+  p(t.length > 0, () => `Element arr[${n.join("][")}] should be a primitive, but is an array of ${e.length} elements`), p(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 < e.length; ++r)
-    we(e[r], s, n.concat(r));
+    Se(e[r], s, n.concat(r));
 }
 function Xt(e, t, n, s) {
   if (e !== "string_or_numeric") {
@@ -2079,19 +2079,19 @@ function Xt(e, t, n, s) {
   }
 }
 function T(e, t, n, s = "numeric") {
-  if (e instanceof de())
+  if (e instanceof fe())
     return Xt(s, e.dtype, t, n), e;
   let r = yt(e);
-  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Xt(s, r, t, n), e == null || !F(e) && !Array.isArray(e) && typeof e != "number" && typeof e != "boolean" && typeof e != "string") {
+  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Xt(s, r, t, n), e == null || !R(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 = In(e, r);
-  !F(e) && !Array.isArray(e) && (e = [e]);
-  const i = r !== "string" ? _t(e, r) : lt(e, [], !0);
+  const a = Tn(e, r);
+  !R(e) && !Array.isArray(e) && (e = [e]);
+  const i = r !== "string" ? _t(e, r) : ut(e, [], !0);
   return f.makeTensor(i, a, r);
 }
-function Tn(e, t, n, s = "numeric") {
+function An(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));
@@ -2113,7 +2113,7 @@ function Tn(e, t, n, s = "numeric") {
  * =============================================================================
  */
 const En = "__op";
-function D(e) {
+function F(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.`);
@@ -2147,28 +2147,28 @@ function D(e) {
  * limitations under the License.
  * =============================================================================
  */
-function An(e, t, n, s) {
+function vn(e, t, n, s) {
   if (s == null)
     s = yt(e);
   else if (s === "complex64")
     throw new Error("Cannot construct a complex64 tensor directly. Please use tf.complex(real, imag).");
-  if (me(e) || ge(e)) {
+  if (pe(e) || me(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 f.backend.createTensorFromGPUData(e, t || n, s);
   }
-  if (!F(e) && !Array.isArray(e) && typeof e != "number" && typeof e != "boolean" && typeof e != "string")
+  if (!R(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) {
     Ct(t);
     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}`);
+    p(r === a, () => `Based on the provided shape, [${t}], the tensor should have ${r} values but has ${a}`);
     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}). `);
+      p(n[o] === t[o] || !c, () => `Error creating a new Tensor. Inferred shape (${n}) does not match the provided shape (${t}). `);
     }
   }
-  return !F(e) && !Array.isArray(e) && (e = [e]), t = t || n, e = s !== "string" ? _t(e, s) : lt(e, [], !0), f.makeTensor(e, t, s);
+  return !R(e) && !Array.isArray(e) && (e = [e]), t = t || n, e = s !== "string" ? _t(e, s) : ut(e, [], !0), f.makeTensor(e, t, s);
 }
 class st {
   /**
@@ -2182,7 +2182,7 @@ 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) => F(s) ? s.buffer : s), t.length === 0))
+    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))
       return;
     this.bufferUniformSize = t[0].byteLength;
     let n = 0;
@@ -2205,7 +2205,7 @@ class st {
     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(n, l.end) - l.start, g = new Uint8Array(l.buffer, h, p - h);
+      const l = this.shards[c], h = t + i - l.start, d = i, y = Math.min(n, l.end) - l.start, g = new Uint8Array(l.buffer, h, y - h);
       if (o.set(g, d), i += g.length, n < l.end)
         break;
     }
@@ -2224,11 +2224,11 @@ class st {
     }
     if (n(this.shards[this.previousShardIndex]) === 0)
       return this.previousShardIndex;
-    const s = vn(this.shards, n);
+    const s = Bn(this.shards, n);
     return s === -1 ? -1 : (this.previousShardIndex = s, this.previousShardIndex);
   }
 }
-function vn(e, t) {
+function Bn(e, t) {
   let n = 0, s = e.length;
   for (; n <= s; ) {
     const r = Math.floor((s - n) / 2) + n, a = t(e[r]);
@@ -2263,13 +2263,13 @@ function si() {
 function ri() {
   return f.memory();
 }
-function E(e, t) {
+function A(e, t) {
   return f.tidy(e, t);
 }
-function M(e) {
-  pe(e).forEach((n) => n.dispose());
+function D(e) {
+  ye(e).forEach((n) => n.dispose());
 }
-function Bn(e) {
+function Mn(e) {
   return f.keep(e);
 }
 function ai(e) {
@@ -2297,13 +2297,13 @@ async function ui(e, t) {
     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);
+        const d = await c.bytes(), m = d.reduce((w, I) => w + I.length, 0) + Jt * d.length, y = new Uint8Array(m);
         let g = 0;
         for (let w = 0; w < d.length; w++) {
           const I = d[w], _ = new Uint8Array(new Uint32Array([I.length]).buffer);
-          p.set(_, g), g += Jt, p.set(I, g), g += I.length;
+          y.set(_, g), g += Jt, y.set(I, g), g += I.length;
         }
-        h(p);
+        h(y);
       });
       s.push(u);
     } else
@@ -2311,9 +2311,9 @@ async function ui(e, t) {
     t != null && (l.group = t), n.push(l);
   }
   const a = await Promise.all(s);
-  return { data: Mn(a), specs: n };
+  return { data: Dn(a), specs: n };
 }
-function Mn(e) {
+function Dn(e) {
   if (e === null)
     throw new Error(`Invalid input value: ${JSON.stringify(e)}`);
   let t = 0;
@@ -2332,7 +2332,7 @@ const Ot = typeof pt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof
 function Yt(e) {
   return Ot ? pt.byteLength(e, "utf8") : new Blob([e]).size;
 }
-function Dn(e) {
+function Fn(e) {
   if (Ot)
     return pt.from(e).toString("base64");
   const t = new Uint8Array(e);
@@ -2341,7 +2341,7 @@ function Dn(e) {
     n += String.fromCharCode(t[s]);
   return btoa(n);
 }
-function Fn(e) {
+function Rn(e) {
   if (Ot) {
     const s = pt.from(e, "base64");
     return s.buffer.slice(s.byteOffset, s.byteOffset + s.byteLength);
@@ -2364,7 +2364,7 @@ function di(e, t) {
   };
   return e.signature != null && (n.signature = e.signature), e.userDefinedMetadata != null && (n.userDefinedMetadata = e.userDefinedMetadata), e.modelInitializer != null && (n.modelInitializer = e.modelInitializer), e.initializerSignature != null && (n.initializerSignature = e.initializerSignature), e.trainingConfig != null && (n.trainingConfig = e.trainingConfig), n;
 }
-function Rn(e, t, n) {
+function xn(e, t, n) {
   const s = {
     modelTopology: e.modelTopology,
     format: e.format,
@@ -2382,9 +2382,9 @@ function Rn(e, t, n) {
 }
 async function fi(e, t) {
   let n, s;
-  return e.weightsManifest != null && ([n, s] = await t(e.weightsManifest)), Rn(e, n, s);
+  return e.weightsManifest != null && ([n, s] = await t(e.weightsManifest)), xn(e, n, s);
 }
-function Se(e) {
+function ke(e) {
   if (e.modelTopology instanceof ArrayBuffer)
     throw new Error("Expected JSON model topology, received ArrayBuffer.");
   return {
@@ -2417,12 +2417,12 @@ function gi(e) {
  * limitations under the License.
  * =============================================================================
  */
-class A {
+class E {
   constructor() {
     this.saveRouters = [], this.loadRouters = [];
   }
   static getInstance() {
-    return A.instance == null && (A.instance = new A()), A.instance;
+    return E.instance == null && (E.instance = new E()), E.instance;
   }
   /**
    * Register a save-handler router.
@@ -2431,7 +2431,7 @@ class A {
    * of `IOHandler` with the `save` method defined or `null`.
    */
   static registerSaveRouter(t) {
-    A.getInstance().saveRouters.push(t);
+    E.getInstance().saveRouters.push(t);
   }
   /**
    * Register a load-handler router.
@@ -2440,7 +2440,7 @@ class A {
    * of `IOHandler` with the `load` method defined or `null`.
    */
   static registerLoadRouter(t) {
-    A.getInstance().loadRouters.push(t);
+    E.getInstance().loadRouters.push(t);
   }
   /**
    * Look up IOHandler for saving, given a URL-like string.
@@ -2451,7 +2451,7 @@ class A {
    * @throws Error, if more than one match is found.
    */
   static getSaveHandlers(t) {
-    return A.getHandlers(t, "save");
+    return E.getHandlers(t, "save");
   }
   /**
    * Look up IOHandler for loading, given a URL-like string.
@@ -2462,17 +2462,17 @@ class A {
    *   handler routers.
    */
   static getLoadHandlers(t, n) {
-    return A.getHandlers(t, "load", n);
+    return E.getHandlers(t, "load", n);
   }
   static getHandlers(t, n, s) {
     const r = [];
-    return (n === "load" ? A.getInstance().loadRouters : A.getInstance().saveRouters).forEach((o) => {
+    return (n === "load" ? E.getInstance().loadRouters : E.getInstance().saveRouters).forEach((o) => {
       const i = o(t, s);
       i !== null && r.push(i);
     }), r;
   }
 }
-const mi = (e) => A.getSaveHandlers(e);
+const mi = (e) => E.getSaveHandlers(e);
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2490,7 +2490,7 @@ const mi = (e) => A.getSaveHandlers(e);
  * =============================================================================
  */
 const Mt = "tensorflowjs", Dt = 1, U = "models_store", L = "model_info_store";
-function ke() {
+function Ie() {
   if (!S().getBool("IS_BROWSER"))
     throw new Error("Failed to obtain IndexedDB factory because the current environmentis not a web browser.");
   const e = typeof window > "u" ? self : window, t = e.indexedDB || e.mozIndexedDB || e.webkitIndexedDB || e.msIndexedDB || e.shimIndexedDB;
@@ -2504,7 +2504,7 @@ function Ft(e) {
 }
 class W {
   constructor(t) {
-    if (this.indexedDB = ke(), t == null || !t)
+    if (this.indexedDB = Ie(), t == null || !t)
       throw new Error("For IndexedDB, modelPath must not be null, undefined or empty.");
     this.modelPath = t;
   }
@@ -2544,7 +2544,7 @@ class W {
           }, l.onerror = (u) => (o.close(), r(l.error)), i.oncomplete = () => o.close();
         } else {
           n.weightData = st.join(n.weightData);
-          const i = Se(n), c = o.transaction(L, "readwrite");
+          const i = ke(n), c = o.transaction(L, "readwrite");
           let l = c.objectStore(L), u;
           try {
             u = l.put({ modelPath: this.modelPath, modelArtifactsInfo: i });
@@ -2562,10 +2562,10 @@ class W {
                 modelArtifacts: n,
                 modelArtifactsInfo: i
               });
-            } catch (p) {
-              return r(p);
+            } catch (y) {
+              return r(y);
             }
-            m.onsuccess = () => s({ modelArtifactsInfo: i }), m.onerror = (p) => {
+            m.onsuccess = () => s({ modelArtifactsInfo: i }), m.onerror = (y) => {
               l = c.objectStore(L);
               const g = l.delete(this.modelPath);
               g.onsuccess = () => (o.close(), r(m.error)), g.onerror = (w) => (o.close(), r(m.error));
@@ -2579,18 +2579,18 @@ class W {
   }
 }
 W.URL_SCHEME = "indexeddb://";
-const Ie = (e) => S().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(W.URL_SCHEME) ? xn(e.slice(W.URL_SCHEME.length)) : null;
-A.registerSaveRouter(Ie);
-A.registerLoadRouter(Ie);
-function xn(e) {
+const Te = (e) => S().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(W.URL_SCHEME) ? Nn(e.slice(W.URL_SCHEME.length)) : null;
+E.registerSaveRouter(Te);
+E.registerLoadRouter(Te);
+function Nn(e) {
   return new W(e);
 }
-function Nn(e) {
+function $n(e) {
   return e.startsWith(W.URL_SCHEME) ? e.slice(W.URL_SCHEME.length) : e;
 }
-class $n {
+class Cn {
   constructor() {
-    this.indexedDB = ke();
+    this.indexedDB = Ie();
   }
   async listModels() {
     return new Promise((t, n) => {
@@ -2607,7 +2607,7 @@ class $n {
     });
   }
   async removeModel(t) {
-    return t = Nn(t), new Promise((n, s) => {
+    return t = $n(t), new Promise((n, s) => {
       const r = this.indexedDB.open(Mt, Dt);
       r.onupgradeneeded = () => Ft(r), r.onsuccess = () => {
         const a = r.result, o = a.transaction(L, "readwrite"), i = o.objectStore(L), c = i.get(t);
@@ -2619,7 +2619,7 @@ class $n {
             const u = i.delete(t), h = () => {
               l = a.transaction(U, "readwrite");
               const m = l.objectStore(U).delete(t);
-              m.onsuccess = () => n(c.result.modelArtifactsInfo), m.onerror = (p) => s(c.error);
+              m.onsuccess = () => n(c.result.modelArtifactsInfo), m.onerror = (y) => s(c.error);
             };
             u.onsuccess = h, u.onerror = (d) => (h(), a.close(), s(c.error));
           }
@@ -2646,27 +2646,27 @@ class $n {
  * limitations under the License.
  * =============================================================================
  */
-const P = "/", Z = "tensorflowjs_models", Te = "info", Cn = "model_topology", Pn = "weight_specs", Ln = "weight_data", _n = "model_metadata";
+const P = "/", Z = "tensorflowjs_models", Ae = "info", Pn = "model_topology", Ln = "weight_specs", _n = "weight_data", On = "model_metadata";
 function Ee(e) {
   return {
-    info: [Z, e, Te].join(P),
-    topology: [Z, e, Cn].join(P),
-    weightSpecs: [Z, e, Pn].join(P),
-    weightData: [Z, e, Ln].join(P),
-    modelMetadata: [Z, e, _n].join(P)
+    info: [Z, e, Ae].join(P),
+    topology: [Z, e, Pn].join(P),
+    weightSpecs: [Z, e, Ln].join(P),
+    weightData: [Z, e, _n].join(P),
+    modelMetadata: [Z, e, On].join(P)
   };
 }
-function Ae(e) {
+function ve(e) {
   for (const t of Object.values(e))
     window.localStorage.removeItem(t);
 }
-function On(e) {
+function Gn(e) {
   const t = e.split(P);
   if (t.length < 3)
     throw new Error(`Invalid key format: ${e}`);
   return t.slice(1, t.length - 1).join(P);
 }
-function Gn(e) {
+function Un(e) {
   return e.startsWith(j.URL_SCHEME) ? e.slice(j.URL_SCHEME.length) : e;
 }
 class j {
@@ -2690,9 +2690,9 @@ class j {
     if (t.modelTopology instanceof ArrayBuffer)
       throw new Error("BrowserLocalStorage.save() does not support saving model topology in binary formats yet.");
     {
-      const n = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = Se(t), a = st.join(t.weightData);
+      const n = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = ke(t), a = st.join(t.weightData);
       try {
-        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, Dn(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, Fn(a));
         const o = {
           format: t.format,
           generatedBy: t.generatedBy,
@@ -2705,7 +2705,7 @@ class j {
         };
         return this.LS.setItem(this.keys.modelMetadata, JSON.stringify(o)), { modelArtifactsInfo: r };
       } catch {
-        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}.`);
+        throw ve(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}.`);
       }
     }
   }
@@ -2739,38 +2739,38 @@ class j {
     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 n.weightData = Fn(o), n;
+    return n.weightData = Rn(o), n;
   }
 }
 j.URL_SCHEME = "localstorage://";
-const ve = (e) => S().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(j.URL_SCHEME) ? Un(e.slice(j.URL_SCHEME.length)) : null;
-A.registerSaveRouter(ve);
-A.registerLoadRouter(ve);
-function Un(e) {
+const Be = (e) => S().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(j.URL_SCHEME) ? zn(e.slice(j.URL_SCHEME.length)) : null;
+E.registerSaveRouter(Be);
+E.registerLoadRouter(Be);
+function zn(e) {
   return new j(e);
 }
-class zn {
+class Vn {
   constructor() {
-    y(S().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;
+    p(S().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), p(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
   }
   async listModels() {
-    const t = {}, n = Z + P, s = P + Te;
+    const t = {}, n = Z + P, s = P + Ae;
     for (let r = 0; r < this.LS.length; ++r) {
       const a = this.LS.key(r);
       if (a.startsWith(n) && a.endsWith(s)) {
-        const o = On(a);
+        const o = Gn(a);
         t[o] = JSON.parse(this.LS.getItem(a));
       }
     }
     return t;
   }
   async removeModel(t) {
-    t = Gn(t);
+    t = Un(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(n.info));
-    return Ae(n), s;
+    return ve(n), s;
   }
 }
 /**
@@ -2804,9 +2804,9 @@ class N {
    * of `IOHandler` with the `save` method defined or `null`.
    */
   static registerManager(t, n) {
-    y(t != null, () => "scheme must not be undefined or null."), t.endsWith(Zt) && (t = t.slice(0, t.indexOf(Zt))), y(t.length > 0, () => "scheme must not be an empty string.");
+    p(t != null, () => "scheme must not be undefined or null."), t.endsWith(Zt) && (t = t.slice(0, t.indexOf(Zt))), p(t.length > 0, () => "scheme must not be an empty string.");
     const s = N.getInstance();
-    y(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = n;
+    p(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = n;
   }
   static getManager(t) {
     const n = N.getInstance().managers[t];
@@ -2834,7 +2834,7 @@ class N {
  * limitations under the License.
  * =============================================================================
  */
-class Vn {
+class Wn {
   constructor() {
     this.messageName = "setTimeoutCustom", this.functionRefs = [], this.handledMessageCount = 0, this.hasEventListener = !1;
   }
@@ -2872,31 +2872,31 @@ class Vn {
     }, !0));
   }
   isTypedArray(t) {
-    return le(t);
+    return ue(t);
   }
 }
 if (S().get("IS_BROWSER")) {
-  S().setPlatform("browser", new Vn());
+  S().setPlatform("browser", new Wn());
   try {
-    N.registerManager(j.URL_SCHEME, new zn());
+    N.registerManager(j.URL_SCHEME, new Vn());
   } catch {
   }
   try {
-    N.registerManager(W.URL_SCHEME, new $n());
+    N.registerManager(W.URL_SCHEME, new Cn());
   } catch {
   }
 }
-const Wn = {
+const jn = {
   // tslint:disable-next-line:no-require-imports
   importFetch: () => require("node-fetch")
 };
 let kt;
-class jn {
+class qn {
   constructor() {
     this.util = require("util"), this.textEncoder = new this.util.TextEncoder();
   }
   fetch(t, n) {
-    return S().global.fetch != null ? S().global.fetch(t, n) : (kt == null && (kt = Wn.importFetch()), kt(t, n));
+    return S().global.fetch != null ? S().global.fetch(t, n) : (kt == null && (kt = jn.importFetch()), kt(t, n));
   }
   now() {
     const t = Q.hrtime();
@@ -2914,7 +2914,7 @@ class jn {
     return this.util.types.isFloat32Array(t) || this.util.types.isInt32Array(t) || this.util.types.isUint8Array(t) || this.util.types.isUint8ClampedArray(t);
   }
 }
-S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new jn());
+S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new qn());
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2931,8 +2931,8 @@ S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new jn()
  * limitations under the License.
  * =============================================================================
  */
-function qn(e, t = "float32", n) {
-  return t = t || "float32", Ct(e), new fn(e, t, n);
+function Kn(e, t = "float32", n) {
+  return t = t || "float32", Ct(e), new gn(e, t, n);
 }
 /**
  * @license
@@ -2950,16 +2950,16 @@ function qn(e, t = "float32", n) {
  * limitations under the License.
  * =============================================================================
  */
-function Kn(e, t) {
+function Hn(e, t) {
   const n = T(e, "x", "cast");
-  if (!Pe(t))
+  if (!Le(t))
     throw new Error(`Failed to cast to unknown dtype ${t}`);
   if (t === "string" && n.dtype !== "string" || t !== "string" && n.dtype === "string")
     throw new Error("Only strings can be casted to strings");
   const s = { x: n }, r = { dtype: t };
-  return f.runKernel(oe, s, r);
+  return f.runKernel(ie, s, r);
 }
-const Rt = /* @__PURE__ */ D({ cast_: Kn });
+const Rt = /* @__PURE__ */ F({ cast_: Hn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2976,11 +2976,11 @@ const Rt = /* @__PURE__ */ D({ cast_: Kn });
  * limitations under the License.
  * =============================================================================
  */
-function Hn(e) {
+function Xn(e) {
   const n = { x: T(e, "x", "clone", "string_or_numeric") };
-  return f.runKernel(ie, n);
+  return f.runKernel(ce, n);
 }
-const Xn = /* @__PURE__ */ D({ clone_: Hn });
+const Jn = /* @__PURE__ */ F({ clone_: Xn });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2997,7 +2997,7 @@ const Xn = /* @__PURE__ */ D({ clone_: Hn });
  * limitations under the License.
  * =============================================================================
  */
-function Jn(e, t = !1) {
+function Yn(e, t = !1) {
   console.log(e.toString(t));
 }
 /**
@@ -3016,14 +3016,14 @@ function Jn(e, t = !1) {
  * limitations under the License.
  * =============================================================================
  */
-be();
-const Yn = {
-  buffer: qn,
+we();
+const Zn = {
+  buffer: Kn,
   cast: Rt,
-  clone: Xn,
-  print: Jn
+  clone: Jn,
+  print: Yn
 };
-mn(Yn);
+pn(Zn);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3040,13 +3040,13 @@ mn(Yn);
  * limitations under the License.
  * =============================================================================
  */
-function Zn(e, t) {
+function Qn(e, t) {
   let n = T(e, "a", "add"), s = T(t, "b", "add");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return f.runKernel(ae, r);
+  return f.runKernel(oe, r);
 }
-const k = /* @__PURE__ */ D({ add_: Zn });
+const k = /* @__PURE__ */ F({ add_: Qn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3063,13 +3063,13 @@ const k = /* @__PURE__ */ D({ add_: Zn });
  * limitations under the License.
  * =============================================================================
  */
-function Qn(e, t) {
+function ts(e, t) {
   let n = T(e, "a", "floorDiv"), s = T(t, "b", "floorDiv");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return f.runKernel(Ye, r);
+  return f.runKernel(Ze, r);
 }
-const ts = /* @__PURE__ */ D({ floorDiv_: Qn });
+const es = /* @__PURE__ */ F({ floorDiv_: ts });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3086,14 +3086,14 @@ const ts = /* @__PURE__ */ D({ floorDiv_: Qn });
  * limitations under the License.
  * =============================================================================
  */
-function es(e, t) {
+function ns(e, t) {
   let n = T(e, "a", "div"), s = T(t, "b", "div");
   if ([n, s] = K(n, s), n.dtype === "int32" && s.dtype === "int32")
-    return ts(n, s);
+    return es(n, s);
   const r = { a: n, b: s }, a = {};
-  return f.runKernel(Xe, r, a);
+  return f.runKernel(Je, r, a);
 }
-const $ = /* @__PURE__ */ D({ div_: es });
+const $ = /* @__PURE__ */ F({ div_: ns });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3110,13 +3110,13 @@ const $ = /* @__PURE__ */ D({ div_: es });
  * limitations under the License.
  * =============================================================================
  */
-function ns(e, t) {
+function ss(e, t) {
   let n = T(e, "a", "mul"), s = T(t, "b", "mul");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return f.runKernel(Qe, r);
+  return f.runKernel(tn, r);
 }
-const b = /* @__PURE__ */ D({ mul_: ns });
+const b = /* @__PURE__ */ F({ mul_: ss });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3133,17 +3133,17 @@ const b = /* @__PURE__ */ D({ mul_: ns });
  * limitations under the License.
  * =============================================================================
  */
-function ss(e) {
+function rs(e) {
   const t = T(e, "x", "abs");
   if (t.dtype === "complex64") {
     const n = { x: t };
-    return f.runKernel(He, n);
+    return f.runKernel(Xe, n);
   } else {
     const n = { x: t };
-    return f.runKernel(Ke, n);
+    return f.runKernel(He, n);
   }
 }
-const rs = /* @__PURE__ */ D({ abs_: ss });
+const as = /* @__PURE__ */ F({ abs_: rs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3160,10 +3160,10 @@ const rs = /* @__PURE__ */ D({ abs_: ss });
  * limitations under the License.
  * =============================================================================
  */
-function as(e, t, n) {
+function os(e, t, n) {
   Ct(e), n = n || yt(t);
   const s = { shape: e, value: t, dtype: n };
-  return f.runKernel(Je, {}, s);
+  return f.runKernel(Ye, {}, s);
 }
 /**
  * @license
@@ -3197,7 +3197,7 @@ function yi(e, t) {
   }
   return n;
 }
-function os(e, t) {
+function is(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];
@@ -3231,11 +3231,11 @@ function os(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function is(e) {
+function cs(e) {
   const n = { x: T(e, "x", "zerosLike") };
-  return f.runKernel(sn, n);
+  return f.runKernel(rn, n);
 }
-const C = /* @__PURE__ */ D({ zerosLike_: is });
+const C = /* @__PURE__ */ F({ zerosLike_: cs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3252,13 +3252,13 @@ const C = /* @__PURE__ */ D({ zerosLike_: is });
  * limitations under the License.
  * =============================================================================
  */
-function cs(e, t) {
+function ls(e, t) {
   let n = T(e, "base", "pow"), s = T(t, "exp", "pow");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return f.runKernel(tn, r);
+  return f.runKernel(en, r);
 }
-const Qt = /* @__PURE__ */ D({ pow_: cs });
+const Qt = /* @__PURE__ */ F({ pow_: ls });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3276,11 +3276,11 @@ const Qt = /* @__PURE__ */ D({ pow_: cs });
  * =============================================================================
  */
 function q(e, t) {
-  if ((F(e) && t !== "string" || Array.isArray(e)) && t !== "complex64")
+  if ((R(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" && F(e) && !(e instanceof Uint8Array))
+  if (t === "string" && R(e) && !(e instanceof Uint8Array))
     throw new Error("When making a scalar from encoded string, the value must be `Uint8Array`.");
-  return An(e, [], [], t);
+  return vn(e, [], [], t);
 }
 /**
  * @license
@@ -3298,11 +3298,11 @@ function q(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ls(e) {
+function us(e) {
   const n = { x: T(e, "x", "sqrt", "float32") };
-  return f.runKernel(en, n);
+  return f.runKernel(nn, n);
 }
-const nt = /* @__PURE__ */ D({ sqrt_: ls });
+const nt = /* @__PURE__ */ F({ sqrt_: us });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -3319,11 +3319,11 @@ const nt = /* @__PURE__ */ D({ sqrt_: ls });
  * limitations under the License.
  * =============================================================================
  */
-function us(e) {
+function hs(e) {
   const t = T(e, "x", "square"), n = {};
   return f.runKernel("Square", { x: t }, n);
 }
-const V = /* @__PURE__ */ D({ square_: us });
+const V = /* @__PURE__ */ F({ square_: hs });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3341,17 +3341,24 @@ const V = /* @__PURE__ */ D({ square_: us });
  * =============================================================================
  */
 function bi(e) {
-  return y(dt(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 = Tn(t, "args", "tf.grads", "string_or_numeric"), r = n != null ? T(n, "dy", "tf.grads") : null;
+  return p(lt(e), () => "The f passed in grads(f) must be a function"), (t, n) => {
+    p(Array.isArray(t), () => "The args passed in grads(f)(args) must be an array of `Tensor`s or `TensorLike`s");
+    const s = An(t, "args", "tf.grads", "string_or_numeric"), r = n != null ? T(n, "dy", "tf.grads") : null;
     return f.tidy(() => {
       const { value: a, grads: o } = f.gradients(() => e(...s), s, r);
-      return r != null && xe(a.shape, r.shape, "The shape of dy passed in grads(f)([x1,...], dy) must match the shape returned by f([x1,...])"), ds(o), o;
+      return r != null && te(a.shape, r.shape, "The shape of dy passed in grads(f)([x1,...], dy) must match the shape returned by f([x1,...])"), Me(o), o;
     });
   };
 }
-function hs(e, t) {
-  y(dt(e), () => "The f passed in variableGrads(f) must be a function"), y(t == null || Array.isArray(t) && t.every((l) => l instanceof mt), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
+function wi(e) {
+  return p(lt(e), () => "The f passed in valueAndGrads(f) must be a function"), (t, n) => {
+    p(Array.isArray(t) && t.every((r) => r instanceof M), () => "The args passed in valueAndGrads(f)(args) must be array of tensors"), p(n == null || n instanceof M, () => "The dy passed in valueAndGrads(f)(args, dy) must be a tensor");
+    const s = f.gradients(() => e(...t), t, n);
+    return n != null && te(s.value.shape, n.shape, "The shape of dy passed in valueAndGrads(f)([x1,...], dy) must match the shape returned by f([x1,...])"), Me(s.grads), s;
+  };
+}
+function ds(e, t) {
+  p(lt(e), () => "The f passed in variableGrads(f) must be a function"), p(t == null || Array.isArray(t) && t.every((l) => l instanceof mt), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
   const n = t != null;
   if (!n) {
     t = [];
@@ -3359,18 +3366,18 @@ function hs(e, t) {
       t.push(f.registeredVariables[l]);
   }
   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.`);
+  t = t.filter((l) => l.trainable), p(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 } = f.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`);
+  p(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()."), p(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 wi(e) {
+function Si(e) {
   return f.customGrad(e);
 }
-function ds(e) {
+function Me(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.`);
@@ -3395,9 +3402,9 @@ function fs(e, t) {
   let n = T(e, "a", "sub"), s = T(t, "b", "sub");
   [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return f.runKernel(nn, r);
+  return f.runKernel(sn, r);
 }
-const tt = /* @__PURE__ */ D({ sub_: fs });
+const tt = /* @__PURE__ */ F({ sub_: fs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3416,11 +3423,11 @@ const tt = /* @__PURE__ */ D({ sub_: fs });
  */
 function gs(e, t) {
   let n = T(e, "a", "maximum"), s = T(t, "b", "maximum");
-  [n, s] = K(n, s), n.dtype === "bool" && (n = Rt(n, "int32"), s = Rt(s, "int32")), os(n.shape, s.shape);
+  [n, s] = K(n, s), n.dtype === "bool" && (n = Rt(n, "int32"), s = Rt(s, "int32")), is(n.shape, s.shape);
   const r = { a: n, b: s };
-  return f.runKernel(Ze, r);
+  return f.runKernel(Qe, r);
 }
-const ms = /* @__PURE__ */ D({ maximum_: gs });
+const ms = /* @__PURE__ */ F({ maximum_: gs });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3484,7 +3491,7 @@ class G {
   }
 }
 function ws(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);
+  p(e.className != null, () => "Class being registered does not have the static className property defined."), p(typeof e.className == "string", () => "className is required to be a string, but got type " + typeof e.className), p(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), ps.set(r, e), ys.set(e, r), e;
 }
@@ -3526,7 +3533,7 @@ class H extends bs {
       this.applyGradients(o);
     } else
       this.applyGradients(a);
-    return M(a), n ? r : (r.dispose(), null);
+    return D(a), n ? r : (r.dispose(), null);
   }
   /**
    * The number of iterations that this optimizer instance has been invoked for.
@@ -3551,13 +3558,13 @@ class H extends bs {
    * @doc {heading: 'Training', subheading: 'Optimizers'}
    */
   computeGradients(t, n) {
-    return hs(t, n);
+    return ds(t, n);
   }
   /**
    * Dispose the variables (if any) owned by this optimizer instance.
    */
   dispose() {
-    this.iterations_ != null && M(this.iterations_);
+    this.iterations_ != null && D(this.iterations_);
   }
   async saveIterations() {
     return this.iterations_ == null && (this.iterations_ = 0), {
@@ -3615,16 +3622,16 @@ class Ss extends H {
       const a = f.registeredVariables[s], o = !1;
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accum_grad`,
-        variable: E(() => C(a).variable(o))
+        variable: A(() => C(a).variable(o))
       }), this.accumulatedUpdates[r] == null && (this.accumulatedUpdates[r] = {
         originalName: `${s}/accum_var`,
-        variable: E(() => C(a).variable(o))
+        variable: A(() => C(a).variable(o))
       });
       const i = Array.isArray(t) ? t[r].tensor : t[s];
       if (i == null)
         return;
       const c = this.accumulatedGrads[r].variable, l = this.accumulatedUpdates[r].variable;
-      E(() => {
+      A(() => {
         const u = k(b(c, this.rho), b(V(i), 1 - this.rho)), h = b($(nt(k(l, this.epsilon)), nt(k(c, this.epsilon))), i), d = k(b(l, this.rho), b(V(h), 1 - this.rho));
         c.assign(u), l.assign(d);
         const m = k(b(h, -this.learningRate), a);
@@ -3633,7 +3640,7 @@ class Ss extends H {
     }), this.incrementIterations();
   }
   dispose() {
-    this.accumulatedUpdates != null && (M(this.accumulatedGrads.map((t) => t.variable)), M(this.accumulatedUpdates.map((t) => t.variable)));
+    this.accumulatedUpdates != null && (D(this.accumulatedGrads.map((t) => t.variable)), D(this.accumulatedUpdates.map((t) => t.variable)));
   }
   async getWeights() {
     const t = [...this.accumulatedGrads, ...this.accumulatedUpdates];
@@ -3691,13 +3698,13 @@ class ks extends H {
       const a = f.registeredVariables[s];
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accumulator`,
-        variable: E(() => as(a.shape, this.initialAccumulatorValue).variable(!1))
+        variable: A(() => os(a.shape, this.initialAccumulatorValue).variable(!1))
       });
       const o = Array.isArray(t) ? t[r].tensor : t[s];
       if (o == null)
         return;
       const i = this.accumulatedGrads[r].variable;
-      E(() => {
+      A(() => {
         const c = k(i, V(o));
         i.assign(c);
         const l = k(b($(o, nt(k(c, f.backend.epsilon()))), -this.learningRate), a);
@@ -3706,7 +3713,7 @@ class ks extends H {
     }), this.incrementIterations();
   }
   dispose() {
-    this.accumulatedGrads != null && M(this.accumulatedGrads.map((t) => t.variable));
+    this.accumulatedGrads != null && D(this.accumulatedGrads.map((t) => t.variable));
   }
   async getWeights() {
     return [await this.saveIterations()].concat(this.accumulatedGrads.map((t) => ({ name: t.originalName, tensor: t.variable })));
@@ -3749,42 +3756,42 @@ class Is extends H {
     return "Adam";
   }
   constructor(t, n, s, r = null) {
-    super(), this.learningRate = t, this.beta1 = n, this.beta2 = s, this.epsilon = r, this.accumulatedFirstMoment = [], this.accumulatedSecondMoment = [], E(() => {
+    super(), this.learningRate = t, this.beta1 = n, this.beta2 = s, this.epsilon = r, this.accumulatedFirstMoment = [], this.accumulatedSecondMoment = [], A(() => {
       this.accBeta1 = q(n).variable(), this.accBeta2 = q(s).variable();
     }), r == null && (this.epsilon = f.backend.epsilon());
   }
   applyGradients(t) {
     const n = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
-    E(() => {
+    A(() => {
       const s = tt(1, this.accBeta1), r = tt(1, this.accBeta2);
       n.forEach((a, o) => {
         const i = f.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
           originalName: `${a}/m`,
-          variable: E(() => C(i).variable(c))
+          variable: A(() => C(i).variable(c))
         }), this.accumulatedSecondMoment[o] == null && (this.accumulatedSecondMoment[o] = {
           originalName: `${a}/v`,
-          variable: E(() => C(i).variable(c))
+          variable: A(() => C(i).variable(c))
         });
         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 = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = k(b(h, this.beta2), b(V(l), 1 - this.beta2)), p = $(d, s), g = $(m, r);
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedSecondMoment[o].variable, d = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = k(b(h, this.beta2), b(V(l), 1 - this.beta2)), y = $(d, s), g = $(m, r);
         u.assign(d), h.assign(m);
-        const w = k(b($(p, k(nt(g), this.epsilon)), -this.learningRate), i);
+        const w = k(b($(y, k(nt(g), 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();
   }
   dispose() {
-    this.accBeta1.dispose(), this.accBeta2.dispose(), this.accumulatedFirstMoment != null && M(this.accumulatedFirstMoment.map((t) => t.variable)), this.accumulatedSecondMoment != null && M(this.accumulatedSecondMoment.map((t) => t.variable));
+    this.accBeta1.dispose(), this.accBeta2.dispose(), this.accumulatedFirstMoment != null && D(this.accumulatedFirstMoment.map((t) => t.variable)), this.accumulatedSecondMoment != null && D(this.accumulatedSecondMoment.map((t) => t.variable));
   }
   async getWeights() {
     const t = [...this.accumulatedFirstMoment, ...this.accumulatedSecondMoment];
     return [await this.saveIterations()].concat(t.map((n) => ({ name: n.originalName, tensor: n.variable })));
   }
   async setWeights(t) {
-    t = await this.extractIterations(t), E(() => {
+    t = await this.extractIterations(t), A(() => {
       this.accBeta1.assign(Qt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Qt(this.beta2, this.iterations_ + 1));
     });
     const n = t.length / 2, s = !1;
@@ -3831,13 +3838,13 @@ class Ts extends H {
     return "Adamax";
   }
   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(() => {
+    super(), this.learningRate = t, this.beta1 = n, this.beta2 = s, this.epsilon = r, this.decay = a, this.accumulatedFirstMoment = [], this.accumulatedWeightedInfNorm = [], A(() => {
       this.iteration = q(0).variable(), this.accBeta1 = q(n).variable();
     }), r == null && (this.epsilon = f.backend.epsilon());
   }
   applyGradients(t) {
     const n = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
-    E(() => {
+    A(() => {
       const s = tt(1, this.accBeta1), r = $(-this.learningRate, k(b(this.iteration, this.decay), 1));
       n.forEach((a, o) => {
         const i = f.registeredVariables[a], c = !1;
@@ -3851,7 +3858,7 @@ class Ts 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 = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), p = rs(l), g = ms(m, p);
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedWeightedInfNorm[o].variable, d = k(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), y = as(l), g = ms(m, y);
         u.assign(d), h.assign(g);
         const w = k(b($(r, s), $(d, k(g, this.epsilon))), i);
         i.assign(w);
@@ -3859,7 +3866,7 @@ class Ts extends H {
     }), this.incrementIterations();
   }
   dispose() {
-    this.accBeta1.dispose(), this.iteration.dispose(), this.accumulatedFirstMoment != null && M(this.accumulatedFirstMoment.map((t) => t.variable)), this.accumulatedWeightedInfNorm != null && M(this.accumulatedWeightedInfNorm.map((t) => t.variable));
+    this.accBeta1.dispose(), this.iteration.dispose(), this.accumulatedFirstMoment != null && D(this.accumulatedFirstMoment.map((t) => t.variable)), this.accumulatedWeightedInfNorm != null && D(this.accumulatedWeightedInfNorm.map((t) => t.variable));
   }
   async getWeights() {
     throw new Error("getWeights() is not implemented for Adamax yet.");
@@ -3897,7 +3904,7 @@ class Ts extends H {
  * limitations under the License.
  * =============================================================================
  */
-class Be extends H {
+class De extends H {
   /** @nocollapse */
   static get className() {
     return "SGD";
@@ -3911,7 +3918,7 @@ class Be extends H {
       if (a == null)
         return;
       const o = f.registeredVariables[s];
-      E(() => {
+      A(() => {
         const i = k(b(this.c, a), o);
         o.assign(i);
       });
@@ -3921,7 +3928,7 @@ class Be extends H {
    * Sets the learning rate of the optimizer.
    */
   setLearningRate(t) {
-    this.learningRate = t, this.c != null && this.c.dispose(), this.c = Bn(q(-t));
+    this.learningRate = t, this.c != null && this.c.dispose(), this.c = Mn(q(-t));
   }
   dispose() {
     this.c.dispose();
@@ -3957,7 +3964,7 @@ class Be extends H {
  * limitations under the License.
  * =============================================================================
  */
-class Es extends Be {
+class As extends De {
   /** @nocollapse */
   // Name matters for Python compatibility.
   static get className() {
@@ -3971,10 +3978,10 @@ class Es extends Be {
       const a = f.registeredVariables[s];
       this.accumulations[r] == null && (this.accumulations[r] = {
         originalName: `${s}/momentum`,
-        variable: E(() => C(a).variable(!1))
+        variable: A(() => C(a).variable(!1))
       });
       const o = this.accumulations[r].variable, i = Array.isArray(t) ? t[r].tensor : t[s];
-      i != null && E(() => {
+      i != null && A(() => {
         let c;
         const l = k(b(this.m, o), i);
         this.useNesterov ? c = k(b(this.c, k(i, b(l, this.m))), a) : c = k(b(this.c, l), a), o.assign(l), a.assign(c);
@@ -3982,7 +3989,7 @@ class Es extends Be {
     }), this.incrementIterations();
   }
   dispose() {
-    this.m.dispose(), this.accumulations != null && M(this.accumulations.map((t) => t.variable));
+    this.m.dispose(), this.accumulations != null && D(this.accumulations.map((t) => t.variable));
   }
   /**
    * Sets the momentum of the optimizer.
@@ -4028,7 +4035,7 @@ class Es extends Be {
  * limitations under the License.
  * =============================================================================
  */
-class As extends H {
+class Es extends H {
   /** @nocollapse */
   static get className() {
     return "RMSProp";
@@ -4042,24 +4049,24 @@ class As extends H {
       const a = f.registeredVariables[s], o = !1;
       this.accumulatedMeanSquares[r] == null && (this.accumulatedMeanSquares[r] = {
         originalName: `${s}/rms`,
-        variable: E(() => C(a).variable(o))
+        variable: A(() => C(a).variable(o))
       }), this.accumulatedMoments[r] == null && (this.accumulatedMoments[r] = {
         originalName: `${s}/momentum`,
-        variable: E(() => C(a).variable(o))
+        variable: A(() => C(a).variable(o))
       }), this.accumulatedMeanGrads[r] == null && this.centered && (this.accumulatedMeanGrads[r] = {
         originalName: `${s}/mg`,
-        variable: E(() => C(a).variable(o))
+        variable: A(() => C(a).variable(o))
       });
       const i = Array.isArray(t) ? t[r].tensor : t[s];
       if (i == null)
         return;
       const c = this.accumulatedMeanSquares[r].variable, l = this.accumulatedMoments[r].variable;
-      E(() => {
+      A(() => {
         const u = k(b(c, this.decay), b(V(i), 1 - this.decay));
         if (this.centered) {
-          const h = this.accumulatedMeanGrads[r].variable, d = k(b(h, this.decay), b(i, 1 - this.decay)), m = $(b(i, this.learningRate), nt(tt(u, k(V(d), this.epsilon)))), p = k(b(l, this.momentum), m);
-          c.assign(u), h.assign(d), l.assign(p);
-          const g = tt(a, p);
+          const h = this.accumulatedMeanGrads[r].variable, d = k(b(h, this.decay), b(i, 1 - this.decay)), m = $(b(i, this.learningRate), nt(tt(u, k(V(d), this.epsilon)))), y = k(b(l, this.momentum), m);
+          c.assign(u), h.assign(d), l.assign(y);
+          const g = tt(a, y);
           a.assign(g);
         } else {
           const h = k(b(c, this.decay), b(V(i), 1 - this.decay)), d = k(b(l, this.momentum), $(b(i, this.learningRate), nt(k(h, this.epsilon))));
@@ -4071,7 +4078,7 @@ class As extends H {
     }), this.incrementIterations();
   }
   dispose() {
-    this.accumulatedMeanSquares != null && M(this.accumulatedMeanSquares.map((t) => t.variable)), this.accumulatedMeanGrads != null && this.centered && M(this.accumulatedMeanGrads.map((t) => t.variable)), this.accumulatedMoments != null && M(this.accumulatedMoments.map((t) => t.variable));
+    this.accumulatedMeanSquares != null && D(this.accumulatedMeanSquares.map((t) => t.variable)), this.accumulatedMeanGrads != null && this.centered && D(this.accumulatedMeanGrads.map((t) => t.variable)), this.accumulatedMoments != null && D(this.accumulatedMoments.map((t) => t.variable));
   }
   async getWeights() {
     const t = [...this.accumulatedMeanSquares, ...this.accumulatedMoments];
@@ -4126,9 +4133,9 @@ const vs = [
   ks,
   Is,
   Ts,
-  Es,
   As,
-  Be
+  Es,
+  De
 ];
 function Bs() {
   for (const e of vs)
@@ -4152,298 +4159,299 @@ function Bs() {
  */
 Bs();
 export {
-  Rt as $,
-  An as A,
-  D as B,
-  T as C,
-  Tn as D,
+  ho as $,
+  Tn as A,
+  vn as B,
+  F as C,
+  T as D,
   f as E,
-  Xn as F,
+  An as F,
   ta as G,
-  Sr as H,
-  wi as I,
-  bi as J,
-  C as K,
-  Ct as L,
-  Ge as M,
-  K as N,
+  Jn as H,
+  Sr as I,
+  Si as J,
+  bi as K,
+  C as L,
+  Ct as M,
+  Ue as N,
   H as O,
   Ga as P,
-  hr as Q,
+  K as Q,
   Ka as R,
   ko as S,
-  x as T,
-  Ya as U,
-  So as V,
-  Po as W,
-  ka as X,
+  M as T,
+  hr as U,
+  Ya as V,
+  So as W,
+  Po as X,
   Ra as Y,
   Xa as Z,
-  ho as _,
+  Ja as _,
   b as a,
-  ua as a$,
-  bo as a0,
-  ni as a1,
-  $t as a2,
-  xe as a3,
-  Gs as a4,
-  xa as a5,
-  oo as a6,
-  ea as a7,
-  wn as a8,
-  wr as a9,
-  Qo as aA,
-  Xe as aB,
-  A as aC,
-  st as aD,
-  di as aE,
-  Se as aF,
-  fi as aG,
-  gi as aH,
-  Us as aI,
-  _s as aJ,
-  $s as aK,
-  ut as aL,
-  Ws as aM,
-  jt as aN,
-  ue as aO,
-  Xo as aP,
-  O as aQ,
-  fr as aR,
-  lo as aS,
-  zr as aT,
-  Ma as aU,
-  rs as aV,
-  V as aW,
-  Hr as aX,
-  na as aY,
-  sa as aZ,
-  aa as a_,
-  ne as aa,
-  Br as ab,
-  fo as ac,
-  pi as ad,
-  xt as ae,
-  S as af,
-  Kr as ag,
-  fa as ah,
-  F as ai,
-  pe as aj,
-  ti as ak,
-  gt as al,
-  Zr as am,
-  qn as an,
-  ie as ao,
-  la as ap,
-  Zo as aq,
-  za as ar,
-  Ne as as,
-  po as at,
-  Vr as au,
-  Ja as av,
-  no as aw,
-  Vo as ax,
-  yi as ay,
-  Ns as az,
+  aa as a$,
+  Rt as a0,
+  bo as a1,
+  ni as a2,
+  $t as a3,
+  te as a4,
+  Gs as a5,
+  xa as a6,
+  oo as a7,
+  ea as a8,
+  Sn as a9,
+  Zo as aA,
+  Qo as aB,
+  Je as aC,
+  E as aD,
+  st as aE,
+  di as aF,
+  ke as aG,
+  fi as aH,
+  gi as aI,
+  Us as aJ,
+  _s as aK,
+  $s as aL,
+  ht as aM,
+  Ws as aN,
+  jt as aO,
+  he as aP,
+  Xo as aQ,
+  O as aR,
+  fr as aS,
+  lo as aT,
+  zr as aU,
+  Ma as aV,
+  as as aW,
+  V as aX,
+  Hr as aY,
+  na as aZ,
+  sa as a_,
+  wr as aa,
+  se as ab,
+  Br as ac,
+  fo as ad,
+  pi as ae,
+  xt as af,
+  S as ag,
+  ka as ah,
+  Kr as ai,
+  fa as aj,
+  R as ak,
+  ye as al,
+  ti as am,
+  gt as an,
+  Zr as ao,
+  Kn as ap,
+  $e as aq,
+  po as ar,
+  Vr as as,
+  la as at,
+  za as au,
+  no as av,
+  Vo as aw,
+  yi as ax,
+  Ns as ay,
+  ce as az,
   q as b,
-  pa as b$,
-  ha as b0,
-  Na as b1,
-  ma as b2,
-  Da as b3,
-  Ha as b4,
-  ro as b5,
-  Uo as b6,
-  Oo as b7,
-  Rr as b8,
-  Yr as b9,
-  fn as bA,
-  en as bB,
-  Bo as bC,
-  Do as bD,
-  nn as bE,
-  Re as bF,
-  Zs as bG,
-  Qs as bH,
-  tr as bI,
-  ir as bJ,
-  lr as bK,
-  Co as bL,
-  dr as bM,
-  Qr as bN,
-  br as bO,
-  kr as bP,
-  Tr as bQ,
-  Er as bR,
-  vr as bS,
-  Mr as bT,
-  Dr as bU,
-  Fr as bV,
-  xr as bW,
-  $r as bX,
-  jr as bY,
-  ga as bZ,
-  yo as b_,
-  jo as ba,
-  Ca as bb,
-  La as bc,
-  Pa as bd,
-  to as be,
-  Za as bf,
-  _o as bg,
-  Ke as bh,
-  zs as bi,
-  Hs as bj,
-  Ks as bk,
-  oe as bl,
-  Vs as bm,
-  _t as bn,
-  ae as bo,
-  gr as bp,
-  te as bq,
-  yr as br,
-  qr as bs,
-  Xr as bt,
-  Ye as bu,
-  Ze as bv,
-  Qe as bw,
-  $a as bx,
-  Va as by,
-  ao as bz,
+  jr as b$,
+  ua as b0,
+  ha as b1,
+  ga as b2,
+  Na as b3,
+  ma as b4,
+  Ba as b5,
+  Da as b6,
+  $a as b7,
+  Ha as b8,
+  ro as b9,
+  Qe as bA,
+  tn as bB,
+  Va as bC,
+  ao as bD,
+  gn as bE,
+  nn as bF,
+  Do as bG,
+  sn as bH,
+  Ne as bI,
+  Zs as bJ,
+  Qs as bK,
+  tr as bL,
+  ir as bM,
+  lr as bN,
+  Co as bO,
+  dr as bP,
+  Qr as bQ,
+  br as bR,
+  kr as bS,
+  Tr as bT,
+  Ar as bU,
+  vr as bV,
+  Mr as bW,
+  Dr as bX,
+  Fr as bY,
+  xr as bZ,
+  $r as b_,
+  Bo as ba,
+  Uo as bb,
+  Oo as bc,
+  Rr as bd,
+  Yr as be,
+  jo as bf,
+  Ca as bg,
+  La as bh,
+  Pa as bi,
+  to as bj,
+  Za as bk,
+  _o as bl,
+  He as bm,
+  zs as bn,
+  Hs as bo,
+  Ks as bp,
+  ie as bq,
+  Vs as br,
+  _t as bs,
+  oe as bt,
+  gr as bu,
+  ee as bv,
+  yr as bw,
+  qr as bx,
+  Xr as by,
+  Ze as bz,
   tt as c,
-  xs as c$,
-  Ia as c0,
-  Ea as c1,
-  Ba as c2,
-  Oa as c3,
-  _a as c4,
-  Ua as c5,
-  wo as c6,
-  so as c7,
-  uo as c8,
-  go as c9,
-  Ar as cA,
-  _r as cB,
-  Gr as cC,
-  Or as cD,
-  Wr as cE,
-  oa as cF,
-  ia as cG,
-  ca as cH,
-  ba as cI,
-  Sa as cJ,
-  wa as cK,
-  Aa as cL,
-  Ta as cM,
-  Fa as cN,
-  tn as cO,
-  eo as cP,
-  Qa as cQ,
-  mo as cR,
-  Mo as cS,
-  $o as cT,
-  ms as cU,
-  sn as cV,
-  li as cW,
-  ws as cX,
-  bs as cY,
-  G as cZ,
-  Oe as c_,
-  zo as ca,
-  Ir as cb,
-  Ko as cc,
-  Cr as cd,
-  Pr as ce,
-  qo as cf,
-  Be as cg,
-  Es as ch,
+  Ge as c$,
+  yo as c0,
+  pa as c1,
+  Ia as c2,
+  Aa as c3,
+  Oa as c4,
+  _a as c5,
+  Ua as c6,
+  wo as c7,
+  so as c8,
+  uo as c9,
+  Xe as cA,
+  Er as cB,
+  _r as cC,
+  Gr as cD,
+  Or as cE,
+  Wr as cF,
+  oa as cG,
+  ia as cH,
+  ca as cI,
+  ba as cJ,
+  Sa as cK,
+  wa as cL,
+  Ea as cM,
+  Ta as cN,
+  Fa as cO,
+  en as cP,
+  eo as cQ,
+  Qa as cR,
+  mo as cS,
+  Mo as cT,
+  $o as cU,
+  ms as cV,
+  rn as cW,
+  li as cX,
+  ws as cY,
+  bs as cZ,
+  G as c_,
+  go as ca,
+  zo as cb,
+  Ir as cc,
+  Ko as cd,
+  Cr as ce,
+  Pr as cf,
+  qo as cg,
+  De as ch,
   As as ci,
-  Is as cj,
-  Ss as ck,
-  Ts as cl,
-  ks as cm,
-  Xs as cn,
-  Js as co,
-  Ys as cp,
-  er as cq,
-  nr as cr,
-  sr as cs,
-  or as ct,
-  rr as cu,
-  ar as cv,
-  ur as cw,
-  cr as cx,
-  mr as cy,
-  He as cz,
-  M as d,
-  mi as d0,
-  ui as d1,
-  hi as d2,
-  Fe as d3,
-  Rs as d4,
-  js as d5,
-  lt as d6,
-  Cs as d7,
-  Nt as d8,
-  ci as d9,
-  ct as dA,
-  qs as dB,
-  Wa as dC,
-  ja as dD,
-  qa as dE,
-  Io as dF,
-  To as dG,
-  xo as dH,
-  No as dI,
-  ei as dJ,
-  Os as dK,
-  It as dL,
-  kn as dM,
-  Je as da,
-  yt as db,
-  Ls as dc,
-  pr as dd,
-  Nr as de,
-  Lr as df,
-  Ur as dg,
-  Jr as dh,
-  Wo as di,
-  Ho as dj,
-  ra as dk,
-  da as dl,
-  ya as dm,
-  va as dn,
-  co as dp,
-  Eo as dq,
+  Es as cj,
+  Is as ck,
+  Ss as cl,
+  Ts as cm,
+  ks as cn,
+  Xs as co,
+  Js as cp,
+  Ys as cq,
+  er as cr,
+  nr as cs,
+  sr as ct,
+  or as cu,
+  rr as cv,
+  ar as cw,
+  ur as cx,
+  cr as cy,
+  mr as cz,
+  D as d,
+  xs as d0,
+  mi as d1,
+  ui as d2,
+  hi as d3,
+  xe as d4,
+  Rs as d5,
+  js as d6,
+  ut as d7,
+  Cs as d8,
+  Nt as d9,
+  es as dA,
+  ct as dB,
+  qs as dC,
+  Wa as dD,
+  ja as dE,
+  qa as dF,
+  Io as dG,
+  To as dH,
+  xo as dI,
+  No as dJ,
+  ei as dK,
+  Os as dL,
+  It as dM,
+  In as dN,
+  ci as da,
+  Ye as db,
+  yt as dc,
+  Ls as dd,
+  pr as de,
+  Nr as df,
+  Lr as dg,
+  Ur as dh,
+  Jr as di,
+  Wo as dj,
+  Ho as dk,
+  ra as dl,
+  da as dm,
+  ya as dn,
+  va as dp,
+  co as dq,
   Ao as dr,
-  vo as ds,
-  Fo as dt,
-  Ro as du,
-  io as dv,
-  Lo as dw,
-  Go as dx,
-  de as dy,
-  ts as dz,
+  Eo as ds,
+  vo as dt,
+  Fo as du,
+  Ro as dv,
+  io as dw,
+  Lo as dx,
+  Go as dy,
+  fe as dz,
   si as e,
   Jo as f,
   ii as g,
-  as as h,
+  os as h,
   Yo as i,
   z as j,
-  Bn as k,
-  os as l,
+  Mn as k,
+  is as l,
   ri as m,
-  y as n,
+  p as n,
   $ as o,
-  $e as p,
+  Ce as p,
   k as q,
   oi as r,
   ai as s,
-  E as t,
-  fe as u,
-  hs as v,
+  A as t,
+  ge as u,
+  ds as v,
   nt as w,
   Qt as x,
-  Ps as y,
-  In as z
+  wi as y,
+  Ps as z
 };