@genai-fi/nanogpt 0.6.0 → 0.6.1

package/dist/{index-bMBtI-WR.js → index-CamYe_M8.js}

@@ -1,6 +1,6 @@
-import { g as Ot } from "./index-D5v913EJ.js";
-import { p as Z } from "./index-xuotMAFm.js";
-import { B as mt } from "./index-Tf7vU29b.js";
+import { g as Gt } from "./index-D5v913EJ.js";
+import { p as Q } from "./index-xuotMAFm.js";
+import { B as pt } from "./index-Tf7vU29b.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -17,60 +17,80 @@ import { B as mt } from "./index-Tf7vU29b.js";
  * limitations under the License.
  * =============================================================================
  */
-const Me = 1e-7, Ne = 1e-4;
+const Me = 1e-7, De = 1e-4;
+class Rs {
+  constructor(t, n) {
+    this.backend = t, this.dataMover = n, this.data = /* @__PURE__ */ new WeakMap(), this.dataIdsCount = 0;
+  }
+  get(t) {
+    return this.data.has(t) || this.dataMover.moveData(this.backend, t), this.data.get(t);
+  }
+  set(t, n) {
+    this.dataIdsCount++, this.data.set(t, n);
+  }
+  has(t) {
+    return this.data.has(t);
+  }
+  delete(t) {
+    return this.dataIdsCount--, this.data.delete(t);
+  }
+  numDataIds() {
+    return this.dataIdsCount;
+  }
+}
 class Fe {
   refCount(t) {
-    return v("refCount");
+    return B("refCount");
   }
   incRef(t) {
-    return v("incRef");
+    return B("incRef");
   }
   timerAvailable() {
     return !0;
   }
   time(t) {
-    return v("time");
+    return B("time");
   }
   read(t) {
-    return v("read");
+    return B("read");
   }
   readSync(t) {
-    return v("readSync");
+    return B("readSync");
   }
   readToGPU(t, n) {
-    return v("readToGPU");
+    return B("readToGPU");
   }
   numDataIds() {
-    return v("numDataIds");
+    return B("numDataIds");
   }
   disposeData(t, n) {
-    return v("disposeData");
+    return B("disposeData");
   }
   write(t, n, s) {
-    return v("write");
+    return B("write");
   }
   move(t, n, s, r, a) {
-    return v("move");
+    return B("move");
   }
   createTensorFromGPUData(t, n, s) {
-    return v("createTensorFromGPUData");
+    return B("createTensorFromGPUData");
   }
   memory() {
-    return v("memory");
+    return B("memory");
   }
   /** Returns the highest precision for floats in bits (e.g. 16 or 32) */
   floatPrecision() {
-    return v("floatPrecision");
+    return B("floatPrecision");
   }
   /** Returns the smallest representable number.  */
   epsilon() {
-    return this.floatPrecision() === 32 ? Me : Ne;
+    return this.floatPrecision() === 32 ? Me : De;
   }
   dispose() {
-    return v("dispose");
+    return B("dispose");
   }
 }
-function v(e) {
+function B(e) {
   throw new Error(`'${e}' not yet implemented or not found in the registry. This kernel may not be supported by the tfjs backend you have chosen`);
 }
 /**
@@ -89,23 +109,35 @@ function v(e) {
  * limitations under the License.
  * =============================================================================
  */
-function Ns(e) {
+function xs(e) {
   let t = e.length, n = 0;
   for (; t > 0; )
     n = Math.random() * t | 0, t--, Re(e, t, n);
 }
+function Ns(e, t, n) {
+  return Math.max(e, Math.min(t, n));
+}
+function $s(e) {
+  return e % 2 === 0 ? e : e + 1;
+}
 function Re(e, t, n) {
   const s = e[t];
   e[t] = e[n], e[n] = s;
 }
+function Cs(e) {
+  let t = 0;
+  for (let n = 0; n < e.length; n++)
+    t += e[n];
+  return t;
+}
 function y(e, t) {
   if (!e)
     throw new Error(typeof t == "string" ? t : t());
 }
-function De(e, t, n = "") {
-  y(Rt(e, t), () => n + ` Shapes ${e} and ${t} must match`);
+function xe(e, t, n = "") {
+  y(xt(e, t), () => n + ` Shapes ${e} and ${t} must match`);
 }
-function Fs(e) {
+function Ps(e) {
   y(e != null, () => "The input to the tensor constructor must be a non-null value.");
 }
 function z(e) {
@@ -116,7 +148,7 @@ function z(e) {
     t *= e[n];
   return t;
 }
-function Rt(e, t) {
+function xt(e, t) {
   if (e === t)
     return !0;
   if (e == null || t == null || e.length !== t.length)
@@ -126,13 +158,36 @@ function Rt(e, t) {
       return !1;
   return !0;
 }
-function $e(e) {
+function Ne(e) {
   return e % 1 === 0;
 }
-function lt(e, t) {
+function Ls(e) {
+  const t = Math.ceil(Math.sqrt(e));
+  return [t, Math.ceil(e / t)];
+}
+function ut(e, t) {
   return t <= e.length ? e : e + " ".repeat(t - e.length);
 }
-function Rs(e, t) {
+function _s(e, t = (r) => 0, n, s) {
+  return new Promise((r, a) => {
+    let o = 0;
+    const i = () => {
+      if (e()) {
+        r();
+        return;
+      }
+      o++;
+      const c = t(o);
+      if (n != null && o >= n) {
+        a();
+        return;
+      }
+      s != null ? s(i, c) : setTimeout(i, c);
+    };
+    i();
+  });
+}
+function Os(e, t) {
   let n = 1, s = -1;
   for (let a = 0; a < e.length; ++a)
     if (e[a] >= 0)
@@ -155,12 +210,12 @@ function Rs(e, t) {
   const r = e.slice();
   return r[s] = t / n, r;
 }
-function xe(e, t) {
+function $e(e, t) {
   const n = t.length;
-  return e = e == null ? t.map((s, r) => r) : [].concat(e), y(e.every((s) => s >= -n && s < n), () => `All values in axis param must be in range [-${n}, ${n}) but got axis ${e}`), y(e.every((s) => $e(s)), () => `All values in axis param must be integers but got axis ${e}`), e.map((s) => s < 0 ? n + s : s);
+  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);
 }
-function Ds(e, t) {
-  const n = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : xe(t, e).sort();
+function Gs(e, t) {
+  const n = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : $e(t, e).sort();
   let o = 0;
   for (let i = 0; i < e.length; ++i) {
     if (a != null) {
@@ -172,7 +227,7 @@ function Ds(e, t) {
   }
   return { newShape: n, keptDims: s };
 }
-function $s(e, t) {
+function Us(e, t) {
   return te(e, t);
 }
 function te(e, t) {
@@ -199,7 +254,10 @@ function Ce(e, t) {
 function Pe(e) {
   return e === "bool" || e === "complex64" || e === "float32" || e === "int32" || e === "string";
 }
-function kt(e) {
+function zs(e, t) {
+  return !(t === "complex64" || t === "float32" && e !== "complex64" || t === "int32" && e !== "float32" && e !== "complex64" || t === "bool" && e === "bool");
+}
+function It(e) {
   if (e === "float32" || e === "int32")
     return 4;
   if (e === "complex64")
@@ -214,7 +272,7 @@ function Le(e) {
   let t = 0;
   return e.forEach((n) => t += n.length), t;
 }
-function Dt(e) {
+function Nt(e) {
   return typeof e == "string" || e instanceof String;
 }
 function _e(e) {
@@ -223,13 +281,13 @@ function _e(e) {
 function Oe(e) {
   return typeof e == "number";
 }
-function pt(e) {
-  return Array.isArray(e) ? pt(e[0]) : e instanceof Float32Array ? "float32" : e instanceof Int32Array || e instanceof Uint8Array || e instanceof Uint8ClampedArray ? "int32" : Oe(e) ? "float32" : Dt(e) ? "string" : _e(e) ? "bool" : "float32";
+function 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";
 }
-function ht(e) {
+function dt(e) {
   return !!(e && e.constructor && e.call && e.apply);
 }
-function xs(e, t) {
+function Vs(e, t) {
   for (let n = t; n < e; ++n)
     if (e % n === 0)
       return n;
@@ -258,7 +316,7 @@ function ee(e, t, n, s = !1) {
   }
   return r;
 }
-function Gt(e, t, n = !1) {
+function ct(e, t, n = !1) {
   if (e.length === 0)
     return t[0];
   const s = e.reduce((r, a) => r * a) * (n ? 2 : 1);
@@ -268,6 +326,17 @@ function Gt(e, t, n = !1) {
     throw new Error(`[${e}] does not match the input size ${t.length}${n ? " for a complex tensor" : ""}.`);
   return ee(0, e, t, n);
 }
+function Ws(e, t) {
+  if (Array.isArray(e))
+    return e;
+  if (t === "float32")
+    return e instanceof Float32Array ? e : new Float32Array(e);
+  if (t === "int32")
+    return e instanceof Int32Array ? e : new Int32Array(e);
+  if (t === "bool" || t === "string")
+    return Uint8Array.from(new Int32Array(e));
+  throw new Error(`Unknown dtype ${t}`);
+}
 function Ge(e, t) {
   const n = ne(e, t);
   for (let s = 0; s < n.length; s++)
@@ -283,12 +352,22 @@ function ne(e, t) {
     return new Uint8Array(e);
   throw new Error(`Unknown data type ${t}`);
 }
-function xt(e) {
+function js(e, t) {
+  const n = e.reduce((s, r) => s * r, 1);
+  if (t == null || t === "float32")
+    return ct(e, new Float32Array(n));
+  if (t === "int32")
+    return ct(e, new Int32Array(n));
+  if (t === "bool")
+    return ct(e, new Uint8Array(n));
+  throw new Error(`Unknown data type ${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}].`);
   });
 }
-function Cs(e, t, n) {
+function qs(e, t, n) {
   if (t === 0)
     return 0;
   if (t === 1)
@@ -298,7 +377,7 @@ function Cs(e, t, n) {
     s += n[r] * e[r];
   return s;
 }
-function Ps(e, t, n) {
+function Ks(e, t, n) {
   if (t === 0)
     return [];
   if (t === 1)
@@ -308,7 +387,7 @@ function Ps(e, t, n) {
     s[r] = Math.floor(e / n[r]), e -= s[r] * n[r];
   return s[s.length - 1] = e, s;
 }
-function Ct(e) {
+function Pt(e) {
   return e && e.then && typeof e.then == "function";
 }
 /**
@@ -334,12 +413,12 @@ class Ue {
     this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = ze, this.populateURLFlags();
   }
   setPlatform(t, n) {
-    this.platform != null && (k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(`Platform ${this.platformName} has already been set. Overwriting the platform with ${t}.`)), this.platformName = t, this.platform = n;
+    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;
   }
   registerFlag(t, n, s) {
     if (this.flagRegistry[t] = { evaluationFn: n, setHook: s }, this.urlFlags[t] != null) {
       const r = this.urlFlags[t];
-      k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(`Setting feature override from URL ${t}: ${r}.`), this.set(t, r);
+      S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(`Setting feature override from URL ${t}: ${r}.`), this.set(t, r);
     }
   }
   async getAsync(t) {
@@ -349,7 +428,7 @@ class Ue {
     if (t in this.flags)
       return this.flags[t];
     const n = this.evaluateFlag(t);
-    if (Ct(n))
+    if (Pt(n))
       throw new Error(`Flag ${t} cannot be synchronously evaluated. Please use getAsync() instead.`);
     return this.flags[t] = n, this.flags[t];
   }
@@ -406,7 +485,7 @@ function We(e, t) {
   const n = t.toLowerCase();
   return n === "true" || n === "false" ? n === "true" : `${+n}` === n ? +n : t;
 }
-function k() {
+function S() {
   return se;
 }
 let se = null;
@@ -429,30 +508,30 @@ function je(e) {
  * limitations under the License.
  * =============================================================================
  */
-let yt;
+let bt;
 function re() {
-  if (yt == null) {
+  if (bt == null) {
     let e;
     if (typeof window < "u")
       e = window;
-    else if (typeof Ot < "u")
-      e = Ot;
-    else if (typeof Z < "u")
-      e = Z;
+    else if (typeof Gt < "u")
+      e = Gt;
+    else if (typeof Q < "u")
+      e = Q;
     else if (typeof self < "u")
       e = self;
     else
       throw new Error("Could not find a global object");
-    yt = e;
+    bt = e;
   }
-  return yt;
+  return bt;
 }
-function Ke() {
+function qe() {
   const e = re();
   return e._tfGlobals == null && (e._tfGlobals = /* @__PURE__ */ new Map()), e._tfGlobals;
 }
-function Pt(e, t) {
-  const n = Ke();
+function Lt(e, t) {
+  const n = qe();
   if (n.has(e))
     return n.get(e);
   {
@@ -460,7 +539,7 @@ function Pt(e, t) {
     return n.set(e, s), n.get(e);
   }
 }
-const qe = "Abs", Ls = "Acos", _s = "Acosh", ae = "Add", Os = "AddN", Gs = "All", Us = "Any", zs = "ArgMax", Vs = "ArgMin", Ws = "Asin", js = "Asinh", Ks = "Atan", qs = "Atanh", Hs = "Atan2", Js = "AvgPool", Xs = "AvgPoolGrad", Ys = "AvgPool3D", Qs = "AvgPool3DGrad", Zs = "BatchMatMul", tr = "BatchToSpaceND", er = "Bincount", nr = "BroadcastTo", oe = "Cast", sr = "Ceil", rr = "ClipByValue", ar = "Complex", He = "ComplexAbs", or = "Concat", ir = "Conv2D", cr = "Conv2DBackpropFilter", lr = "Conv2DBackpropInput", ur = "Conv3D", hr = "Conv3DBackpropFilterV2", fr = "Conv3DBackpropInputV2", dr = "Cos", gr = "Cosh", mr = "Cumprod", pr = "Cumsum", yr = "CropAndResize", br = "DenseBincount", wr = "DepthwiseConv2dNative", Sr = "DepthwiseConv2dNativeBackpropFilter", kr = "DepthwiseConv2dNativeBackpropInput", Ir = "Dilation2D", Tr = "Dilation2DBackpropInput", Er = "Dilation2DBackpropFilter", Je = "RealDiv", Ar = "Einsum", Br = "Elu", vr = "EluGrad", Mr = "Erf", Nr = "Equal", Fr = "Exp", Rr = "ExpandDims", Dr = "Expm1", Xe = "Fill", $r = "FlipLeftRight", xr = "Floor", Ye = "FloorDiv", Cr = "FusedBatchNorm", Pr = "GatherV2", Lr = "GatherNd", _r = "Greater", Or = "GreaterEqual", ie = "Identity", Gr = "Imag", Ur = "IsFinite", zr = "IsInf", Vr = "IsNan", Wr = "LeakyRelu", jr = "Less", Kr = "LessEqual", qr = "Log", Hr = "Log1p", Jr = "LogicalAnd", Xr = "LogicalNot", Yr = "LogSoftmax", Qr = "LRN", Zr = "LRNGrad", ta = "Max", Qe = "Maximum", ea = "MaxPool", na = "MaxPoolGrad", sa = "MaxPool3D", ra = "MaxPool3DGrad", aa = "Mean", oa = "Min", ia = "Minimum", ca = "MirrorPad", la = "Mod", ua = "Multinomial", Ze = "Multiply", ha = "Neg", fa = "NotEqual", da = "NonMaxSuppressionV3", ga = "NonMaxSuppressionV4", ma = "NonMaxSuppressionV5", pa = "OnesLike", ya = "OneHot", ba = "Pack", wa = "PadV2", tn = "Pow", Sa = "Prelu", ka = "Prod", Ia = "Range", Ta = "Real", Ea = "Reciprocal", Aa = "Relu", Ba = "Reshape", va = "ResizeNearestNeighbor", Ma = "ResizeNearestNeighborGrad", Na = "ResizeBilinear", Fa = "ResizeBilinearGrad", Ra = "Relu6", Da = "Reverse", $a = "Round", xa = "Rsqrt", Ca = "ScatterNd", Pa = "Select", La = "Selu", _a = "Slice", Oa = "Sin", Ga = "Sinh", Ua = "Sign", za = "Sigmoid", Va = "Softplus", en = "Sqrt", Wa = "Sum", ja = "SpaceToBatchND", Ka = "SplitV", qa = "Softmax", Ha = "SquaredDifference", Ja = "Square", nn = "Sub", Xa = "Tan", Ya = "Tanh", Qa = "Tile", Za = "TopK", to = "Transform", eo = "Transpose", no = "Unpack", so = "UnsortedSegmentSum", sn = "ZerosLike", ro = "Step", ao = "RotateWithOffset", oo = "_FusedMatMul", io = "FusedConv2D";
+const Ke = "Abs", Hs = "Acos", Xs = "Acosh", ae = "Add", Js = "AddN", Ys = "All", Zs = "Any", Qs = "ArgMax", tr = "ArgMin", er = "Asin", nr = "Asinh", sr = "Atan", rr = "Atanh", ar = "Atan2", or = "AvgPool", ir = "AvgPoolGrad", cr = "AvgPool3D", lr = "AvgPool3DGrad", ur = "BatchMatMul", hr = "BatchToSpaceND", dr = "Bincount", fr = "BitwiseAnd", gr = "BroadcastTo", mr = "BroadcastArgs", oe = "Cast", pr = "Ceil", yr = "ClipByValue", br = "Complex", He = "ComplexAbs", wr = "Concat", Sr = "Conv2D", kr = "Conv2DBackpropFilter", Ir = "Conv2DBackpropInput", Tr = "Conv3D", Er = "Conv3DBackpropFilterV2", Ar = "Conv3DBackpropInputV2", vr = "Cos", Br = "Cosh", Mr = "Cumprod", Dr = "Cumsum", Fr = "CropAndResize", Rr = "DenseBincount", xr = "DepthToSpace", Nr = "DepthwiseConv2dNative", $r = "DepthwiseConv2dNativeBackpropFilter", Cr = "DepthwiseConv2dNativeBackpropInput", Pr = "Diag", Lr = "Dilation2D", _r = "Dilation2DBackpropInput", Or = "Dilation2DBackpropFilter", Gr = "Draw", Xe = "RealDiv", Ur = "Einsum", zr = "Elu", Vr = "EluGrad", Wr = "Erf", jr = "Equal", qr = "Exp", Kr = "ExpandDims", Hr = "Expm1", Xr = "FFT", Je = "Fill", Jr = "FlipLeftRight", Yr = "Floor", Ye = "FloorDiv", Zr = "FusedBatchNorm", Qr = "GatherV2", ta = "GatherNd", ea = "Greater", na = "GreaterEqual", ie = "Identity", sa = "IFFT", ra = "Imag", aa = "IsFinite", oa = "IsInf", ia = "IsNan", ca = "LeakyRelu", la = "Less", ua = "LessEqual", ha = "LinSpace", da = "Log", fa = "Log1p", ga = "LogicalAnd", ma = "LogicalNot", pa = "LogicalOr", ya = "LogSoftmax", ba = "LRN", wa = "LRNGrad", Sa = "Max", Ze = "Maximum", ka = "MaxPool", Ia = "MaxPoolGrad", Ta = "MaxPool3D", Ea = "MaxPool3DGrad", Aa = "MaxPoolWithArgmax", va = "Mean", Ba = "Min", Ma = "Minimum", Da = "MirrorPad", Fa = "Mod", Ra = "Multinomial", Qe = "Multiply", xa = "Neg", Na = "NotEqual", $a = "NonMaxSuppressionV3", Ca = "NonMaxSuppressionV4", Pa = "NonMaxSuppressionV5", La = "OnesLike", _a = "OneHot", Oa = "Pack", Ga = "PadV2", tn = "Pow", Ua = "Prelu", za = "Prod", Va = "RaggedGather", Wa = "RaggedRange", ja = "RaggedTensorToTensor", qa = "Range", Ka = "Real", Ha = "Reciprocal", Xa = "Relu", Ja = "Reshape", Ya = "ResizeNearestNeighbor", Za = "ResizeNearestNeighborGrad", Qa = "ResizeBilinear", to = "ResizeBilinearGrad", eo = "Relu6", no = "Reverse", so = "Round", ro = "Rsqrt", ao = "ScatterNd", oo = "TensorScatterUpdate", io = "SearchSorted", co = "Select", lo = "Selu", uo = "Slice", ho = "Sin", fo = "Sinh", go = "Sign", mo = "Sigmoid", po = "Softplus", en = "Sqrt", yo = "Sum", bo = "SpaceToBatchND", wo = "SplitV", So = "Softmax", ko = "SparseFillEmptyRows", Io = "SparseReshape", To = "SparseSegmentMean", Eo = "SparseSegmentSum", Ao = "SparseToDense", vo = "SquaredDifference", Bo = "Square", Mo = "StaticRegexReplace", Do = "StridedSlice", Fo = "StringNGrams", Ro = "StringSplit", xo = "StringToHashBucketFast", nn = "Sub", No = "Tan", $o = "Tanh", Co = "Tile", Po = "TopK", Lo = "Transform", _o = "Transpose", Oo = "Unique", Go = "Unpack", Uo = "UnsortedSegmentSum", sn = "ZerosLike", zo = "Step", Vo = "FromPixels", Wo = "RotateWithOffset", jo = "_FusedMatMul", qo = "FusedConv2D", Ko = "FusedDepthwiseConv2D";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -478,7 +557,10 @@ const qe = "Abs", Ls = "Acos", _s = "Acosh", ae = "Add", Os = "AddN", Gs = "All"
  * =============================================================================
  */
 function O(...e) {
-  k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(...e);
+  S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(...e);
+}
+function Ho(...e) {
+  S().getBool("IS_TEST") || S().getBool("PROD") || console.log(...e);
 }
 /**
  * @license
@@ -496,13 +578,13 @@ function O(...e) {
  * limitations under the License.
  * =============================================================================
  */
-const ft = Pt("kernelRegistry", () => /* @__PURE__ */ new Map()), It = Pt("gradRegistry", () => /* @__PURE__ */ new Map());
+const ft = Lt("kernelRegistry", () => /* @__PURE__ */ new Map()), Tt = Lt("gradRegistry", () => /* @__PURE__ */ new Map());
 function zt(e, t) {
   const n = ce(e, t);
   return ft.get(n);
 }
 function Vt(e) {
-  return It.get(e);
+  return Tt.get(e);
 }
 function Wt(e) {
   const t = ft.entries(), n = [];
@@ -515,13 +597,13 @@ function Wt(e) {
   }
   return n;
 }
-function co(e) {
+function Xo(e) {
   const { kernelName: t, backendName: n } = e, s = ce(t, n);
   ft.has(s) && O(`The kernel '${t}' for backend '${n}' is already registered`), ft.set(s, e);
 }
-function lo(e) {
+function Jo(e) {
   const { kernelName: t } = e;
-  It.has(t) && k().getBool("DEBUG") && O(`Overriding the gradient for '${t}'`), It.set(t, e);
+  Tt.has(t) && S().getBool("DEBUG") && O(`Overriding the gradient for '${t}'`), Tt.set(t, e);
 }
 function ce(e, t) {
   return `${t}_${e}`;
@@ -561,16 +643,16 @@ function le(e) {
  * limitations under the License.
  * =============================================================================
  */
-function uo(e, t) {
-  return t === "string" ? ue(e) : Lt([e], t);
+function Yo(e, t) {
+  return t === "string" ? ue(e) : _t([e], t);
 }
 function rn(e, t) {
   return e instanceof Float32Array && t === "float32" || e instanceof Int32Array && t === "int32" || e instanceof Uint8Array && t === "bool";
 }
-function Lt(e, t) {
+function _t(e, t) {
   if (t === "string")
     throw new Error("Cannot convert a string[] to a TypedArray");
-  if (Array.isArray(e) && (e = ct(e)), k().getBool("DEBUG") && Ce(e, t), rn(e, t))
+  if (Array.isArray(e) && (e = lt(e)), S().getBool("DEBUG") && Ce(e, t), rn(e, t))
     return e;
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(e);
@@ -584,30 +666,30 @@ function Lt(e, t) {
   } else
     throw new Error(`Unknown data type ${t}`);
 }
-function dt() {
-  return k().platform.now();
+function gt() {
+  return S().platform.now();
 }
 function ue(e, t = "utf-8") {
-  return t = t || "utf-8", k().platform.encode(e, t);
+  return t = t || "utf-8", S().platform.encode(e, t);
 }
 function jt(e, t = "utf-8") {
-  return t = t || "utf-8", k().platform.decode(e, t);
+  return t = t || "utf-8", S().platform.decode(e, t);
 }
 function F(e) {
-  return k().platform.isTypedArray != null ? k().platform.isTypedArray(e) : le(e);
+  return S().platform.isTypedArray != null ? S().platform.isTypedArray(e) : le(e);
 }
-function ct(e, t = [], n = !1) {
-  if (t == null && (t = []), typeof e == "boolean" || typeof e == "number" || typeof e == "string" || Ct(e) || e == null || F(e) && n)
+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)
     t.push(e);
   else if (Array.isArray(e) || F(e))
     for (let s = 0; s < e.length; ++s)
-      ct(e[s], t, n);
+      lt(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++)
-      ct(e[r], t, n);
+      lt(e[r], t, n);
   }
   return t;
 }
@@ -637,16 +719,16 @@ class an {
       r = s();
     };
     let o;
-    const i = dt();
+    const i = gt();
     if (this.backendTimer.timerAvailable())
       o = this.backendTimer.time(a);
     else {
       a();
       for (const l of r)
         l.dataSync();
-      o = Promise.resolve({ kernelMs: dt() - i });
+      o = Promise.resolve({ kernelMs: gt() - i });
     }
-    if (k().getBool("CHECK_COMPUTATION_FOR_ERRORS"))
+    if (S().getBool("CHECK_COMPUTATION_FOR_ERRORS"))
       for (let l = 0; l < r.length; l++) {
         const u = r[l];
         u.data().then((h) => {
@@ -682,16 +764,16 @@ function on(e, t, n) {
 }
 class cn {
   logKernelProfile(t, n, s, r, a, o) {
-    const i = typeof r == "number" ? lt(`${r}ms`, 9) : r.error, c = lt(t, 25), l = n.rank, u = n.size, h = lt(n.shape.toString(), 14);
-    let f = "";
+    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);
+    let d = "";
     for (const m in a) {
       const p = a[m];
       if (p != null) {
-        const d = p.shape || n.shape, w = d.length;
-        f += `${m}: ${w}D ${w > 0 ? d : ""} `;
+        const f = p.shape || n.shape, w = f.length;
+        d += `${m}: ${w}D ${w > 0 ? f : ""} `;
       }
     }
-    console.log(`%c${c}	%c${i}	%c${l}D ${h}	%c${u}	%c${f}	%c${o}`, "font-weight:bold", "color:red", "color:blue", "color: orange", "color: green", "color: steelblue");
+    console.log(`%c${c}	%c${i}	%c${l}D ${h}	%c${u}	%c${d}	%c${o}`, "font-weight:bold", "color:red", "color:blue", "color: orange", "color: green", "color: steelblue");
   }
 }
 /**
@@ -717,11 +799,11 @@ function ln(e, t, n) {
   for (let c = 0; c < e.length; c++) {
     const l = e[c], u = l.inputs;
     for (const h in u) {
-      const f = u[h];
+      const d = u[h];
       let m = !1;
       for (let p = 0; p < t.length; p++)
-        if (s[f.id]) {
-          l.outputs.forEach((d) => s[d.id] = !0), m = !0, r[l.id] = !0;
+        if (s[d.id]) {
+          l.outputs.forEach((f) => s[f.id] = !0), m = !0, r[l.id] = !0;
           break;
         }
       if (m)
@@ -735,8 +817,8 @@ function ln(e, t, n) {
     const l = e[c], u = l.inputs;
     for (let h = 0; h < l.outputs.length; h++)
       if (a[l.outputs[h].id]) {
-        for (const f in u)
-          a[u[f].id] = !0, o[l.id] = !0;
+        for (const d in u)
+          a[u[d].id] = !0, o[l.id] = !0;
         break;
       }
   }
@@ -745,9 +827,9 @@ function ln(e, t, n) {
     const l = e[c];
     if (r[l.id] && o[l.id]) {
       const u = {};
-      for (const f in l.inputs) {
-        const m = l.inputs[f];
-        s[m.id] && (u[f] = m);
+      for (const d in l.inputs) {
+        const m = l.inputs[d];
+        s[m.id] && (u[d] = m);
       }
       const h = Object.assign({}, l);
       h.inputs = u, h.outputs = l.outputs, i.push(h);
@@ -771,7 +853,7 @@ function un(e, t, n, s) {
       if (l.dtype !== "float32")
         throw new Error(`Error in gradient for op ${a.kernelName}. The gradient of input ${c} must have 'float32' dtype, but has '${l.dtype}'`);
       const u = a.inputs[c];
-      if (!Rt(l.shape, u.shape))
+      if (!xt(l.shape, u.shape))
         throw new Error(`Error in gradient for op ${a.kernelName}. The gradient of input '${c}' has shape '${l.shape}', which does not match the shape of the input '${u.shape}'`);
       if (e[u.id] == null)
         e[u.id] = l;
@@ -798,14 +880,14 @@ function un(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-const Kt = 20, at = 3, bt = 7;
+const qt = 20, at = 3, wt = 7;
 function hn(e, t, n, s) {
-  const r = $t(t), a = fn(e, t, n, r), o = t.length, i = ut(e, t, n, r, a), c = ["Tensor"];
+  const r = $t(t), a = dn(e, t, n, r), o = t.length, i = ht(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 fn(e, t, n, s) {
+function dn(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++) {
@@ -817,37 +899,37 @@ function fn(e, t, n, s) {
 }
 function ot(e, t, n) {
   let s;
-  return Array.isArray(e) ? s = `${parseFloat(e[0].toFixed(bt))} + ${parseFloat(e[1].toFixed(bt))}j` : Dt(e) ? s = `'${e}'` : n === "bool" ? s = he(e) : s = parseFloat(e.toFixed(bt)).toString(), lt(s, t);
+  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);
 }
 function he(e) {
   return e === 0 ? "false" : "true";
 }
-function ut(e, t, n, s, r, a = !0) {
+function ht(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 d = it(e);
-      return [ot(d[0], 0, n)];
+      const f = it(e);
+      return [ot(f[0], 0, n)];
     }
     return n === "bool" ? [he(e[0])] : [e[0].toString()];
   }
   if (c === 1) {
-    if (i > Kt) {
+    if (i > qt) {
       const w = at * o;
       let I = Array.from(e.slice(0, w)), _ = Array.from(e.slice((i - at) * o, i * o));
       return n === "complex64" && (I = it(I), _ = it(_)), [
-        "[" + I.map((J, X) => ot(J, r[X], n)).join(", ") + ", ..., " + _.map((J, X) => ot(J, r[i - at + X], n)).join(", ") + "]"
+        "[" + I.map((X, J) => ot(X, r[J], n)).join(", ") + ", ..., " + _.map((X, J) => ot(X, r[i - at + J], n)).join(", ") + "]"
       ];
     }
     return [
       "[" + (n === "complex64" ? it(e) : Array.from(e)).map((w, I) => ot(w, r[I], n)).join(", ") + "]"
     ];
   }
-  const l = t.slice(1), u = s.slice(1), h = s[0] * o, f = [];
-  if (i > Kt) {
-    for (let d = 0; d < at; d++) {
-      const w = d * h, I = w + h;
-      f.push(...ut(
+  const l = t.slice(1), u = s.slice(1), h = s[0] * o, d = [];
+  if (i > qt) {
+    for (let f = 0; f < at; f++) {
+      const w = f * h, I = w + h;
+      d.push(...ht(
         e.slice(w, I),
         l,
         n,
@@ -857,42 +939,42 @@ function ut(e, t, n, s, r, a = !0) {
         /* isLast */
       ));
     }
-    f.push("...");
-    for (let d = i - at; d < i; d++) {
-      const w = d * h, I = w + h;
-      f.push(...ut(
+    d.push("...");
+    for (let f = i - at; f < i; f++) {
+      const w = f * h, I = w + h;
+      d.push(...ht(
         e.slice(w, I),
         l,
         n,
         u,
         r,
-        d === i - 1
+        f === i - 1
         /* isLast */
       ));
     }
   } else
-    for (let d = 0; d < i; d++) {
-      const w = d * h, I = w + h;
-      f.push(...ut(
+    for (let f = 0; f < i; f++) {
+      const w = f * h, I = w + h;
+      d.push(...ht(
         e.slice(w, I),
         l,
         n,
         u,
         r,
-        d === i - 1
+        f === i - 1
         /* isLast */
       ));
     }
   const m = c === 2 ? "," : "";
-  f[0] = "[" + (i > 0 ? f[0] + m : "");
-  for (let d = 1; d < f.length - 1; d++)
-    f[d] = " " + f[d] + m;
+  d[0] = "[" + (i > 0 ? d[0] + m : "");
+  for (let f = 1; f < d.length - 1; f++)
+    d[f] = " " + d[f] + m;
   let p = `,
 `;
-  for (let d = 2; d < c; d++)
+  for (let f = 2; f < c; f++)
     p += `
 `;
-  return f[f.length - 1] = " " + f[f.length - 1] + "]" + (a ? "" : p), f;
+  return d[d.length - 1] = " " + d[d.length - 1] + "]" + (a ? "" : p), d;
 }
 function it(e) {
   const t = [];
@@ -916,7 +998,7 @@ function it(e) {
  * limitations under the License.
  * =============================================================================
  */
-class dn {
+class fn {
   constructor(t, n, s) {
     if (this.dtype = n, this.shape = t.slice(), this.size = z(t), s != null) {
       const r = s.length;
@@ -1000,7 +1082,7 @@ function gn(e) {
 function mn(e) {
   Y = e;
 }
-class D {
+class x {
   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";
   }
@@ -1031,7 +1113,7 @@ class D {
    */
   async array() {
     const t = await this.data();
-    return Gt(this.shape, t, this.dtype === "complex64");
+    return ct(this.shape, t, this.dtype === "complex64");
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -1040,7 +1122,7 @@ class D {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   arraySync() {
-    return Gt(this.shape, this.dataSync(), this.dtype === "complex64");
+    return ct(this.shape, this.dataSync(), this.dtype === "complex64");
   }
   /**
    * Asynchronously downloads the values from the `tf.Tensor`. Returns a
@@ -1170,14 +1252,14 @@ class D {
     return this.throwIfDisposed(), R().makeVariable(this, t, n, s);
   }
 }
-Object.defineProperty(D, Symbol.hasInstance, {
+Object.defineProperty(x, Symbol.hasInstance, {
   value: (e) => !!e && e.data != null && e.dataSync != null && e.throwIfDisposed != null
 });
-function fe() {
-  return Pt("Tensor", () => D);
+function de() {
+  return Lt("Tensor", () => x);
 }
-fe();
-class gt extends D {
+de();
+class mt extends x {
   constructor(t, n, s, r) {
     super(t.shape, t.dtype, t.dataId, r), this.trainable = n, this.name = s;
   }
@@ -1192,7 +1274,7 @@ class gt extends D {
   assign(t) {
     if (t.dtype !== this.dtype)
       throw new Error(`dtype of the new value (${t.dtype}) and previous value (${this.dtype}) must match`);
-    if (!Rt(t.shape, this.shape))
+    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(
       this,
@@ -1204,8 +1286,8 @@ class gt extends D {
     R().disposeVariable(this), this.isDisposedInternal = !0;
   }
 }
-Object.defineProperty(gt, Symbol.hasInstance, {
-  value: (e) => e instanceof D && e.assign != null && e.assign instanceof Function
+Object.defineProperty(mt, Symbol.hasInstance, {
+  value: (e) => e instanceof x && e.assign != null && e.assign instanceof Function
 });
 /**
  * @license
@@ -1223,33 +1305,33 @@ Object.defineProperty(gt, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-var qt;
+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";
-})(qt || (qt = {}));
-var Tt;
-(function(e) {
-  e.float32 = "float32", e.int32 = "int32", e.bool = "int32", e.complex64 = "complex64";
-})(Tt || (Tt = {}));
+})(Kt || (Kt = {}));
 var Et;
 (function(e) {
-  e.float32 = "float32", e.int32 = "int32", e.bool = "bool", e.complex64 = "complex64";
+  e.float32 = "float32", e.int32 = "int32", e.bool = "int32", e.complex64 = "complex64";
 })(Et || (Et = {}));
 var At;
 (function(e) {
-  e.float32 = "float32", e.int32 = "float32", e.bool = "float32", e.complex64 = "complex64";
+  e.float32 = "float32", e.int32 = "int32", e.bool = "bool", e.complex64 = "complex64";
 })(At || (At = {}));
+var vt;
+(function(e) {
+  e.float32 = "float32", e.int32 = "float32", e.bool = "float32", e.complex64 = "complex64";
+})(vt || (vt = {}));
 var Bt;
 (function(e) {
   e.float32 = "complex64", e.int32 = "complex64", e.bool = "complex64", e.complex64 = "complex64";
 })(Bt || (Bt = {}));
 const pn = {
-  float32: At,
-  int32: Tt,
-  bool: Et,
+  float32: vt,
+  int32: Et,
+  bool: At,
   complex64: Bt
 };
-function de(e, t) {
+function fe(e, t) {
   if (e === "string" || t === "string") {
     if (e === "string" && t === "string")
       return "string";
@@ -1257,8 +1339,8 @@ function de(e, t) {
   }
   return pn[e][t];
 }
-function ho(e) {
-  return de(e, "int32");
+function Zo(e) {
+  return fe(e, "int32");
 }
 function ge(e) {
   return e != null && typeof e == "object" && "texture" in e && e.texture instanceof WebGLTexture;
@@ -1282,13 +1364,13 @@ function me(e) {
  * limitations under the License.
  * =============================================================================
  */
-function q(e, t) {
+function K(e, t) {
   if (e.dtype === t.dtype)
     return [e, t];
-  const n = de(e.dtype, t.dtype);
+  const n = fe(e.dtype, t.dtype);
   return [e.cast(n), t.cast(n)];
 }
-function fo(e, t) {
+function Qo(e, t) {
   return t.some((n) => n.id === e.id);
 }
 function pe(e) {
@@ -1298,7 +1380,7 @@ function pe(e) {
 function ye(e, t, n) {
   if (e == null)
     return;
-  if (e instanceof D) {
+  if (e instanceof x) {
     t.push(e);
     return;
   }
@@ -1329,7 +1411,7 @@ function yn(e) {
  * limitations under the License.
  * =============================================================================
  */
-function wt(e) {
+function St(e) {
   return e.kernelName != null;
 }
 class Ht {
@@ -1559,35 +1641,35 @@ class et {
     let i;
     this.backendName == null && this.backend;
     let c;
-    const l = wt(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
-    if (wt(t)) {
-      const { kernelName: p, inputs: d, attrs: w } = t;
+    const l = St(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
+    if (St(t)) {
+      const { kernelName: p, inputs: f, 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 _ = this.backend.numDataIds();
-        c = I.kernelFunc({ inputs: d, attrs: w, backend: this.backend });
-        const J = Array.isArray(c) ? c : [c];
-        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(p, _, J);
-        const X = J.map((rt) => rt.rank != null ? rt : this.makeTensorFromTensorInfo(rt));
+        c = I.kernelFunc({ inputs: f, attrs: w, backend: this.backend });
+        const X = Array.isArray(c) ? c : [c];
+        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(p, _, X);
+        const J = X.map((rt) => rt.rank != null ? rt : this.makeTensorFromTensorInfo(rt));
         if (r) {
-          const rt = this.getTensorsForGradient(p, d, X);
+          const rt = this.getTensorsForGradient(p, f, J);
           s = this.saveTensorsForBackwardMode(rt);
         }
-        return X;
+        return J;
       };
     } else {
-      const { forwardFunc: p } = t, d = (w) => {
+      const { forwardFunc: p } = t, f = (w) => {
         r && (s = w.map((I) => this.keep(this.clone(I))));
       };
       i = () => {
         const w = this.backend.numDataIds();
-        c = this.tidy(() => p(this.backend, d));
+        c = this.tidy(() => p(this.backend, f));
         const I = Array.isArray(c) ? c : [c];
         return this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(l, w, I), I;
       };
     }
-    const { inputs: u, attrs: h } = t, f = wt(t) ? null : t.backwardsFunc;
+    const { inputs: u, attrs: h } = t, d = St(t) ? null : t.backwardsFunc;
     let m;
     return this.scopedRun(
       // Stop recording to a tape when running a kernel.
@@ -1596,7 +1678,7 @@ class et {
       () => {
         !this.ENV.getBool("DEBUG") && !this.state.profiling ? n = i() : (m = this.profiler.profileKernel(l, u, () => i()), this.ENV.getBool("DEBUG") && this.profiler.logKernelProfile(m), n = m.outputs);
       }
-    ), r && this.addTapeNode(l, u, n, f, s, h), this.state.profiling && this.state.activeProfile.kernels.push({
+    ), r && this.addTapeNode(l, u, n, d, s, h), this.state.profiling && this.state.activeProfile.kernels.push({
       name: l,
       bytesAdded: this.state.numBytes - a,
       totalBytesSnapshot: this.state.numBytes,
@@ -1644,8 +1726,8 @@ class et {
       throw new Error("Values passed to engine.makeTensor() are null");
     s = s || "float32", r = r || this.backend;
     let a = t;
-    s === "string" && Dt(t[0]) && (a = t.map((c) => ue(c)));
-    const o = r.write(a, n, s), i = new D(n, s, o, this.nextTensorId());
+    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());
     if (this.trackTensor(i, r), s === "string") {
       const c = this.state.tensorInfo.get(o), l = Le(a);
       this.state.numBytes += l - c.bytes, c.bytes = l;
@@ -1669,12 +1751,12 @@ class et {
    * only increments the ref count used in memory tracking.
    */
   makeTensorFromTensorInfo(t, n) {
-    const { dataId: s, shape: r, dtype: a } = t, o = new D(r, a, s, this.nextTensorId());
+    const { dataId: s, shape: r, dtype: a } = t, o = new x(r, a, s, this.nextTensorId());
     return this.trackTensor(o, n), o;
   }
   makeVariable(t, n = !0, s, r) {
     s = s || this.nextVariableId().toString(), r != null && r !== t.dtype && (t = t.cast(r));
-    const a = new gt(t, n, s, this.nextTensorId());
+    const a = new mt(t, n, s, this.nextTensorId());
     if (this.state.registeredVariables[a.name] != null)
       throw new Error(`Variable with name ${a.name} was already registered`);
     return this.state.registeredVariables[a.name] = a, this.incRef(a, this.backend), a;
@@ -1682,12 +1764,12 @@ class et {
   trackTensor(t, n) {
     this.state.numTensors++, t.dtype === "string" && this.state.numStringTensors++;
     let s = 0;
-    t.dtype !== "complex64" && t.dtype !== "string" && (s = t.size * kt(t.dtype)), this.state.numBytes += s, this.state.tensorInfo.has(t.dataId) || (this.state.numDataBuffers++, this.state.tensorInfo.set(t.dataId, {
+    t.dtype !== "complex64" && t.dtype !== "string" && (s = t.size * It(t.dtype)), this.state.numBytes += s, this.state.tensorInfo.has(t.dataId) || (this.state.numDataBuffers++, this.state.tensorInfo.set(t.dataId, {
       backend: n || this.backend,
       dtype: t.dtype,
       shape: t.shape,
       bytes: s
-    })), t instanceof gt || this.track(t);
+    })), t instanceof mt || this.track(t);
   }
   // Track the tensor by dataId and increase the refCount for the dataId in the
   // backend.
@@ -1705,7 +1787,7 @@ class et {
       return;
     const n = this.state.tensorInfo.get(t.dataId);
     if (this.state.numTensors--, t.dtype === "string" && (this.state.numStringTensors--, this.state.numBytes -= n.bytes), t.dtype !== "complex64" && t.dtype !== "string") {
-      const s = t.size * kt(t.dtype);
+      const s = t.size * It(t.dtype);
       this.state.numBytes -= s;
     }
     n.backend.disposeData(t.dataId) && this.removeDataId(t.dataId, n.backend);
@@ -1738,8 +1820,8 @@ 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 f = s[h], m = ne(f.size, f.dtype);
-        return this.makeTensor(m, f.shape, f.dtype);
+        const d = s[h], m = ne(d.size, d.dtype);
+        return this.makeTensor(m, d.shape, d.dtype);
       }
       return u;
     }), r(l.length > 1 ? l : l[0], a, o))), this.state.activeTape.push(i);
@@ -1790,7 +1872,7 @@ class et {
     if (y(n.length > 0, () => "gradients() received an empty list of xs."), s != null && s.dtype !== "float32")
       throw new Error(`dy must have 'float32' dtype, but has '${s.dtype}'`);
     const a = this.scopedRun(() => this.startTape(), () => this.endTape(), () => this.tidy("forward", t));
-    y(a instanceof D, () => "The result y returned by f() must be a tensor.");
+    y(a instanceof x, () => "The result y returned by f() must be a tensor.");
     const o = ln(this.state.activeTape, n, a);
     if (!r && o.length === 0 && n.length > 0)
       throw new Error("Cannot compute gradient of y=f(x) with respect to x. Make sure that the f you passed encloses all operations that lead from x to y.");
@@ -1812,19 +1894,19 @@ class et {
     });
   }
   customGrad(t) {
-    return y(ht(t), () => "The f passed in customGrad(f) must be a function."), (...n) => {
-      y(n.every((i) => i instanceof D), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
+    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");
       let s;
       const r = {};
       n.forEach((i, c) => {
         r[c] = i;
       });
-      const a = (i, c) => (s = t(...n, c), y(s.value instanceof D, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), y(ht(s.gradFunc), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function."), s.value), o = (i, c) => {
+      const 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 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((f) => f instanceof D), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns a list of only tensors.");
+        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.");
         const h = {};
-        return u.forEach((f, m) => {
-          h[m] = () => f;
+        return u.forEach((d, m) => {
+          h[m] = () => d;
         }), h;
       };
       return this.runKernelFunc({
@@ -1844,8 +1926,8 @@ class et {
     return this.state.tensorInfo.get(t).backend.readToGPU(t, n);
   }
   async time(t) {
-    const n = dt(), s = await this.backend.time(t);
-    return s.wallMs = dt() - n, s;
+    const n = gt(), s = await this.backend.time(t);
+    return s.wallMs = gt() - n, s;
   }
   /**
    * Tracks a Tensor in the current scope to be automatically cleaned up
@@ -1906,25 +1988,43 @@ function wn(e, t) {
  * =============================================================================
  */
 function Sn() {
+  return typeof navigator < "u" && navigator != null;
+}
+function ti(e) {
+  if (e || Sn()) {
+    if (e || (e = navigator), e.product === "ReactNative")
+      return !0;
+    const t = e.userAgent || e.vendor || // tslint:disable-next-line:no-any
+    (typeof window < "u" ? window.opera : "");
+    if (!t) {
+      const n = e;
+      return n.userAgentData && n.userAgentData.mobile;
+    }
+    return /(android|bb\d+|meego).+mobile|avantgo|bada\/|blackberry|blazer|compal|elaine|fennec|hiptop|iemobile|ip(hone|od)|iris|kindle|lge |maemo|midp|mmp|mobile.+firefox|netfront|opera m(ob|in)i|palm( os)?|phone|p(ixi|re)\/|plucker|pocket|psp|series(4|6)0|symbian|treo|up\.(browser|link)|vodafone|wap|windows ce|xda|xiino/i.test(t) || // tslint:disable-next-line:max-line-length
+    /1207|6310|6590|3gso|4thp|50[1-6]i|770s|802s|a wa|abac|ac(er|oo|s\-)|ai(ko|rn)|al(av|ca|co)|amoi|an(ex|ny|yw)|aptu|ar(ch|go)|as(te|us)|attw|au(di|\-m|r |s )|avan|be(ck|ll|nq)|bi(lb|rd)|bl(ac|az)|br(e|v)w|bumb|bw\-(n|u)|c55\/|capi|ccwa|cdm\-|cell|chtm|cldc|cmd\-|co(mp|nd)|craw|da(it|ll|ng)|dbte|dc\-s|devi|dica|dmob|do(c|p)o|ds(12|\-d)|el(49|ai)|em(l2|ul)|er(ic|k0)|esl8|ez([4-7]0|os|wa|ze)|fetc|fly(\-|_)|g1 u|g560|gene|gf\-5|g\-mo|go(\.w|od)|gr(ad|un)|haie|hcit|hd\-(m|p|t)|hei\-|hi(pt|ta)|hp( i|ip)|hs\-c|ht(c(\-| |_|a|g|p|s|t)|tp)|hu(aw|tc)|i\-(20|go|ma)|i230|iac( |\-|\/)|ibro|idea|ig01|ikom|im1k|inno|ipaq|iris|ja(t|v)a|jbro|jemu|jigs|kddi|keji|kgt( |\/)|klon|kpt |kwc\-|kyo(c|k)|le(no|xi)|lg( g|\/(k|l|u)|50|54|\-[a-w])|libw|lynx|m1\-w|m3ga|m50\/|ma(te|ui|xo)|mc(01|21|ca)|m\-cr|me(rc|ri)|mi(o8|oa|ts)|mmef|mo(01|02|bi|de|do|t(\-| |o|v)|zz)|mt(50|p1|v )|mwbp|mywa|n10[0-2]|n20[2-3]|n30(0|2)|n50(0|2|5)|n7(0(0|1)|10)|ne((c|m)\-|on|tf|wf|wg|wt)|nok(6|i)|nzph|o2im|op(ti|wv)|oran|owg1|p800|pan(a|d|t)|pdxg|pg(13|\-([1-8]|c))|phil|pire|pl(ay|uc)|pn\-2|po(ck|rt|se)|prox|psio|pt\-g|qa\-a|qc(07|12|21|32|60|\-[2-7]|i\-)|qtek|r380|r600|raks|rim9|ro(ve|zo)|s55\/|sa(ge|ma|mm|ms|ny|va)|sc(01|h\-|oo|p\-)|sdk\/|se(c(\-|0|1)|47|mc|nd|ri)|sgh\-|shar|sie(\-|m)|sk\-0|sl(45|id)|sm(al|ar|b3|it|t5)|so(ft|ny)|sp(01|h\-|v\-|v )|sy(01|mb)|t2(18|50)|t6(00|10|18)|ta(gt|lk)|tcl\-|tdg\-|tel(i|m)|tim\-|t\-mo|to(pl|sh)|ts(70|m\-|m3|m5)|tx\-9|up(\.b|g1|si)|utst|v400|v750|veri|vi(rg|te)|vk(40|5[0-3]|\-v)|vm40|voda|vulc|vx(52|53|60|61|70|80|81|83|85|98)|w3c(\-| )|webc|whit|wi(g |nc|nw)|wmlb|wonu|x700|yas\-|your|zeto|zte\-/i.test(t.substr(0, 4));
+  }
+  return !1;
+}
+function kn() {
   return typeof window < "u" && window.document != null || //@ts-ignore
   typeof WorkerGlobalScope < "u";
 }
-const B = k();
-B.registerFlag("DEBUG", () => !1, (e) => {
+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.");
 });
-B.registerFlag("IS_BROWSER", () => Sn());
-B.registerFlag("IS_NODE", () => typeof Z < "u" && typeof Z.versions < "u" && typeof Z.versions.node < "u");
-B.registerFlag("IS_CHROME", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Chrome/.test(navigator.userAgent) && /Google Inc/.test(navigator.vendor));
-B.registerFlag("IS_SAFARI", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Safari/.test(navigator.userAgent) && /Apple/.test(navigator.vendor));
-B.registerFlag("PROD", () => !1);
-B.registerFlag("TENSORLIKE_CHECK_SHAPE_CONSISTENCY", () => B.getBool("DEBUG"));
-B.registerFlag("DEPRECATION_WARNINGS_ENABLED", () => !0);
-B.registerFlag("IS_TEST", () => !1);
-B.registerFlag("CHECK_COMPUTATION_FOR_ERRORS", () => B.getBool("DEBUG"));
-B.registerFlag("WRAP_TO_IMAGEBITMAP", () => !1);
-B.registerFlag("CANVAS2D_WILL_READ_FREQUENTLY_FOR_GPU", () => !1);
-B.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
+v.registerFlag("IS_BROWSER", () => kn());
+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));
+v.registerFlag("PROD", () => !1);
+v.registerFlag("TENSORLIKE_CHECK_SHAPE_CONSISTENCY", () => v.getBool("DEBUG"));
+v.registerFlag("DEPRECATION_WARNINGS_ENABLED", () => !0);
+v.registerFlag("IS_TEST", () => !1);
+v.registerFlag("CHECK_COMPUTATION_FOR_ERRORS", () => v.getBool("DEBUG"));
+v.registerFlag("WRAP_TO_IMAGEBITMAP", () => !1);
+v.registerFlag("CANVAS2D_WILL_READ_FREQUENTLY_FOR_GPU", () => !1);
+v.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -1941,7 +2041,7 @@ B.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
  * limitations under the License.
  * =============================================================================
  */
-function kn(e, t) {
+function In(e, t) {
   let n = e;
   if (F(e))
     return t === "string" ? [] : [e.length];
@@ -1949,13 +2049,13 @@ function kn(e, t) {
     const r = e.channels || "RGBA";
     return [e.height, e.width * r.length];
   } else if (me(e))
-    return [e.buffer.size / (t == null ? 4 : kt(t))];
+    return [e.buffer.size / (t == null ? 4 : It(t))];
   if (!Array.isArray(e))
     return [];
   const s = [];
   for (; Array.isArray(n) || F(n) && t !== "string"; )
     s.push(n.length), n = n[0];
-  return Array.isArray(e) && k().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && we(e, s, []), s;
+  return Array.isArray(e) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && we(e, s, []), s;
 }
 function we(e, t, n) {
   if (n = n || [], !Array.isArray(e) && !F(e)) {
@@ -1967,7 +2067,7 @@ function we(e, t, n) {
   for (let r = 0; r < e.length; ++r)
     we(e[r], s, n.concat(r));
 }
-function Jt(e, t, n, s) {
+function Xt(e, t, n, s) {
   if (e !== "string_or_numeric") {
     if (e == null)
       throw new Error("Expected dtype cannot be null.");
@@ -1976,19 +2076,19 @@ function Jt(e, t, n, s) {
   }
 }
 function T(e, t, n, s = "numeric") {
-  if (e instanceof fe())
-    return Jt(s, e.dtype, t, n), e;
-  let r = pt(e);
-  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Jt(s, r, t, n), e == null || !F(e) && !Array.isArray(e) && typeof e != "number" && typeof e != "boolean" && typeof e != "string") {
+  if (e instanceof de())
+    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") {
     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 = kn(e, r);
+  const a = In(e, r);
   !F(e) && !Array.isArray(e) && (e = [e]);
-  const i = r !== "string" ? Lt(e, r) : ct(e, [], !0);
+  const i = r !== "string" ? _t(e, r) : lt(e, [], !0);
   return g.makeTensor(i, a, r);
 }
-function In(e, t, n, s = "numeric") {
+function Tn(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));
@@ -2009,19 +2109,19 @@ function In(e, t, n, s = "numeric") {
  * limitations under the License.
  * =============================================================================
  */
-const Tn = "__op";
-function N(e) {
+const En = "__op";
+function D(e) {
   const t = Object.keys(e);
   if (t.length !== 1)
     throw new Error(`Please provide an object with a single key (operation name) mapping to a function. Got an object with ${t.length} keys.`);
   let n = t[0];
   const s = e[n];
-  n.endsWith("_") && (n = n.substring(0, n.length - 1)), n = n + Tn;
+  n.endsWith("_") && (n = n.substring(0, n.length - 1)), n = n + En;
   const r = (...a) => {
     g.startScope(n);
     try {
       const o = s(...a);
-      return Ct(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
+      return Pt(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
     } catch (o) {
       throw g.endScope(null), o;
     }
@@ -2044,9 +2144,9 @@ function N(e) {
  * limitations under the License.
  * =============================================================================
  */
-function En(e, t, n, s) {
+function An(e, t, n, s) {
   if (s == null)
-    s = pt(e);
+    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)) {
@@ -2057,7 +2157,7 @@ function En(e, t, n, s) {
   if (!F(e) && !Array.isArray(e) && typeof e != "number" && typeof e != "boolean" && typeof e != "string")
     throw new Error("values passed to tensor(values) must be a number/boolean/string or an array of numbers/booleans/strings, or a TypedArray");
   if (t != null) {
-    xt(t);
+    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}`);
     for (let o = 0; o < n.length; ++o) {
@@ -2065,7 +2165,7 @@ function En(e, t, n, s) {
       y(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" ? Lt(e, s) : ct(e, [], !0), g.makeTensor(e, t, s);
+  return !F(e) && !Array.isArray(e) && (e = [e]), t = t || n, e = s !== "string" ? _t(e, s) : lt(e, [], !0), g.makeTensor(e, t, s);
 }
 class st {
   /**
@@ -2102,8 +2202,8 @@ 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, f = i, p = Math.min(n, l.end) - l.start, d = new Uint8Array(l.buffer, h, p - h);
-      if (o.set(d, f), i += d.length, n < l.end)
+      const l = this.shards[c], h = t + i - l.start, d = i, p = Math.min(n, l.end) - l.start, f = new Uint8Array(l.buffer, h, p - h);
+      if (o.set(f, d), i += f.length, n < l.end)
         break;
     }
     return a;
@@ -2121,11 +2221,11 @@ class st {
     }
     if (n(this.shards[this.previousShardIndex]) === 0)
       return this.previousShardIndex;
-    const s = An(this.shards, n);
+    const s = vn(this.shards, n);
     return s === -1 ? -1 : (this.previousShardIndex = s, this.previousShardIndex);
   }
 }
-function An(e, t) {
+function vn(e, t) {
   let n = 0, s = e.length;
   for (; n <= s; ) {
     const r = Math.floor((s - n) / 2) + n, a = t(e[r]);
@@ -2151,13 +2251,13 @@ function An(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function go() {
+function ei() {
   g.disposeVariables();
 }
-function mo() {
+function ni() {
   return g;
 }
-function po() {
+function si() {
   return g.memory();
 }
 function E(e, t) {
@@ -2169,11 +2269,14 @@ function M(e) {
 function Bn(e) {
   return g.keep(e);
 }
-function yo() {
+function ri(e, t, n = 1) {
+  return g.registerBackend(e, t, n);
+}
+function ai() {
   return g.backend;
 }
-const Xt = 4;
-async function bo(e, t) {
+const Jt = 4;
+async function oi(e, t) {
   const n = [], s = [], r = Array.isArray(e) ? e.map((o) => o.name) : Object.keys(e);
   for (let o = 0; o < r.length; ++o) {
     const i = r[o], c = Array.isArray(e) ? e[o].tensor : e[i];
@@ -2182,11 +2285,11 @@ async function bo(e, t) {
     const l = { name: i, shape: c.shape, dtype: c.dtype };
     if (c.dtype === "string") {
       const u = new Promise(async (h) => {
-        const f = await c.bytes(), m = f.reduce((w, I) => w + I.length, 0) + Xt * f.length, p = new Uint8Array(m);
-        let d = 0;
-        for (let w = 0; w < f.length; w++) {
-          const I = f[w], _ = new Uint8Array(new Uint32Array([I.length]).buffer);
-          p.set(_, d), d += Xt, p.set(I, d), d += I.length;
+        const d = await c.bytes(), m = d.reduce((w, I) => w + I.length, 0) + Jt * d.length, p = new Uint8Array(m);
+        let f = 0;
+        for (let w = 0; w < d.length; w++) {
+          const I = d[w], _ = new Uint8Array(new Uint32Array([I.length]).buffer);
+          p.set(_, f), f += Jt, p.set(I, f), f += I.length;
         }
         h(p);
       });
@@ -2196,9 +2299,9 @@ async function bo(e, t) {
     t != null && (l.group = t), n.push(l);
   }
   const a = await Promise.all(s);
-  return { data: vn(a), specs: n };
+  return { data: Mn(a), specs: n };
 }
-function vn(e) {
+function Mn(e) {
   if (e === null)
     throw new Error(`Invalid input value: ${JSON.stringify(e)}`);
   let t = 0;
@@ -2213,22 +2316,22 @@ function vn(e) {
     s.set(new Uint8Array(a.buffer), r), r += a.byteLength;
   }), s.buffer;
 }
-const _t = typeof mt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
+const Ot = typeof pt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
 function Yt(e) {
-  return _t ? mt.byteLength(e, "utf8") : new Blob([e]).size;
+  return Ot ? pt.byteLength(e, "utf8") : new Blob([e]).size;
 }
-function Mn(e) {
-  if (_t)
-    return mt.from(e).toString("base64");
+function Dn(e) {
+  if (Ot)
+    return pt.from(e).toString("base64");
   const t = new Uint8Array(e);
   let n = "";
   for (let s = 0, r = t.length; s < r; s++)
     n += String.fromCharCode(t[s]);
   return btoa(n);
 }
-function Nn(e) {
-  if (_t) {
-    const s = mt.from(e, "base64");
+function Fn(e) {
+  if (Ot) {
+    const s = pt.from(e, "base64");
     return s.buffer.slice(s.byteOffset, s.byteOffset + s.byteLength);
   }
   const t = atob(e), n = new Uint8Array(t.length);
@@ -2236,9 +2339,39 @@ function Nn(e) {
     n.set([t.charCodeAt(s)], s);
   return n.buffer;
 }
-function wo(e) {
+function ii(e) {
   return st.join(e);
 }
+function ci(e, t) {
+  const n = {
+    modelTopology: e.modelTopology,
+    format: e.format,
+    generatedBy: e.generatedBy,
+    convertedBy: e.convertedBy,
+    weightsManifest: 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) {
+  const s = {
+    modelTopology: e.modelTopology,
+    format: e.format,
+    generatedBy: e.generatedBy,
+    convertedBy: e.convertedBy
+  };
+  if (e.trainingConfig != null && (s.trainingConfig = e.trainingConfig), e.weightsManifest != null) {
+    if (!t)
+      throw new Error("modelJSON has weightsManifest but weightSpecs is null");
+    if (!n)
+      throw new Error("modelJSON has weightsManifest but weightData is null");
+    s.weightSpecs = t, s.weightData = n;
+  }
+  return e.signature != null && (s.signature = e.signature), e.userDefinedMetadata != null && (s.userDefinedMetadata = e.userDefinedMetadata), e.modelInitializer != null && (s.modelInitializer = e.modelInitializer), e.initializerSignature != null && (s.initializerSignature = e.initializerSignature), s;
+}
+async function li(e, t) {
+  let n, s;
+  return e.weightsManifest != null && ([n, s] = await t(e.weightsManifest)), Rn(e, n, s);
+}
 function Se(e) {
   if (e.modelTopology instanceof ArrayBuffer)
     throw new Error("Expected JSON model topology, received ArrayBuffer.");
@@ -2250,6 +2383,12 @@ function Se(e) {
     weightDataBytes: e.weightData == null ? 0 : new st(e.weightData).byteLength
   };
 }
+function ui(e) {
+  const t = [];
+  for (const n of e)
+    t.push(...n.weights);
+  return t;
+}
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2321,7 +2460,7 @@ class A {
     }), r;
   }
 }
-const So = (e) => A.getSaveHandlers(e);
+const hi = (e) => A.getSaveHandlers(e);
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2338,16 +2477,16 @@ const So = (e) => A.getSaveHandlers(e);
  * limitations under the License.
  * =============================================================================
  */
-const vt = "tensorflowjs", Mt = 1, U = "models_store", L = "model_info_store";
+const Mt = "tensorflowjs", Dt = 1, U = "models_store", L = "model_info_store";
 function ke() {
-  if (!k().getBool("IS_BROWSER"))
+  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;
   if (t == null)
     throw new Error("The current browser does not appear to support IndexedDB.");
   return t;
 }
-function Nt(e) {
+function Ft(e) {
   const t = e.result;
   t.createObjectStore(U, { keyPath: "modelPath" }), t.createObjectStore(L, { keyPath: "modelPath" });
 }
@@ -2381,8 +2520,8 @@ class W {
    */
   databaseAction(t, n) {
     return new Promise((s, r) => {
-      const a = this.indexedDB.open(vt, Mt);
-      a.onupgradeneeded = () => Nt(a), a.onsuccess = () => {
+      const a = this.indexedDB.open(Mt, Dt);
+      a.onupgradeneeded = () => Ft(a), a.onsuccess = () => {
         const o = a.result;
         if (n == null) {
           const i = o.transaction(U, "readonly"), l = i.objectStore(U).get(this.modelPath);
@@ -2397,16 +2536,16 @@ class W {
           let l = c.objectStore(L), u;
           try {
             u = l.put({ modelPath: this.modelPath, modelArtifactsInfo: i });
-          } catch (f) {
-            return r(f);
+          } catch (d) {
+            return r(d);
           }
           let h;
           u.onsuccess = () => {
             h = o.transaction(U, "readwrite");
-            const f = h.objectStore(U);
+            const d = h.objectStore(U);
             let m;
             try {
-              m = f.put({
+              m = d.put({
                 modelPath: this.modelPath,
                 modelArtifacts: n,
                 modelArtifactsInfo: i
@@ -2416,10 +2555,10 @@ class W {
             }
             m.onsuccess = () => s({ modelArtifactsInfo: i }), m.onerror = (p) => {
               l = c.objectStore(L);
-              const d = l.delete(this.modelPath);
-              d.onsuccess = () => (o.close(), r(m.error)), d.onerror = (w) => (o.close(), r(m.error));
+              const f = l.delete(this.modelPath);
+              f.onsuccess = () => (o.close(), r(m.error)), f.onerror = (w) => (o.close(), r(m.error));
             };
-          }, u.onerror = (f) => (o.close(), r(u.error)), c.oncomplete = () => {
+          }, u.onerror = (d) => (o.close(), r(u.error)), c.oncomplete = () => {
             h == null ? o.close() : h.oncomplete = () => o.close();
           };
         }
@@ -2428,23 +2567,23 @@ class W {
   }
 }
 W.URL_SCHEME = "indexeddb://";
-const Ie = (e) => k().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(W.URL_SCHEME) ? Fn(e.slice(W.URL_SCHEME.length)) : null;
+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 Fn(e) {
+function xn(e) {
   return new W(e);
 }
-function Rn(e) {
+function Nn(e) {
   return e.startsWith(W.URL_SCHEME) ? e.slice(W.URL_SCHEME.length) : e;
 }
-class Dn {
+class $n {
   constructor() {
     this.indexedDB = ke();
   }
   async listModels() {
     return new Promise((t, n) => {
-      const s = this.indexedDB.open(vt, Mt);
-      s.onupgradeneeded = () => Nt(s), s.onsuccess = () => {
+      const s = this.indexedDB.open(Mt, Dt);
+      s.onupgradeneeded = () => Ft(s), s.onsuccess = () => {
         const r = s.result, a = r.transaction(L, "readonly"), i = a.objectStore(L).getAll();
         i.onsuccess = () => {
           const c = {};
@@ -2456,9 +2595,9 @@ class Dn {
     });
   }
   async removeModel(t) {
-    return t = Rn(t), new Promise((n, s) => {
-      const r = this.indexedDB.open(vt, Mt);
-      r.onupgradeneeded = () => Nt(r), r.onsuccess = () => {
+    return t = Nn(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);
         let l;
         c.onsuccess = () => {
@@ -2470,7 +2609,7 @@ class Dn {
               const m = l.objectStore(U).delete(t);
               m.onsuccess = () => n(c.result.modelArtifactsInfo), m.onerror = (p) => s(c.error);
             };
-            u.onsuccess = h, u.onerror = (f) => (h(), a.close(), s(c.error));
+            u.onsuccess = h, u.onerror = (d) => (h(), a.close(), s(c.error));
           }
         }, c.onerror = (u) => (a.close(), s(c.error)), o.oncomplete = () => {
           l == null ? a.close() : l.oncomplete = () => a.close();
@@ -2495,32 +2634,32 @@ class Dn {
  * limitations under the License.
  * =============================================================================
  */
-const P = "/", Q = "tensorflowjs_models", Te = "info", $n = "model_topology", xn = "weight_specs", Cn = "weight_data", Pn = "model_metadata";
+const P = "/", Z = "tensorflowjs_models", Te = "info", Cn = "model_topology", Pn = "weight_specs", Ln = "weight_data", _n = "model_metadata";
 function Ee(e) {
   return {
-    info: [Q, e, Te].join(P),
-    topology: [Q, e, $n].join(P),
-    weightSpecs: [Q, e, xn].join(P),
-    weightData: [Q, e, Cn].join(P),
-    modelMetadata: [Q, e, Pn].join(P)
+    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)
   };
 }
 function Ae(e) {
   for (const t of Object.values(e))
     window.localStorage.removeItem(t);
 }
-function Ln(e) {
+function On(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 _n(e) {
+function Gn(e) {
   return e.startsWith(j.URL_SCHEME) ? e.slice(j.URL_SCHEME.length) : e;
 }
 class j {
   constructor(t) {
-    if (!k().getBool("IS_BROWSER") || typeof window > "u" || typeof window.localStorage > "u")
+    if (!S().getBool("IS_BROWSER") || typeof window > "u" || typeof window.localStorage > "u")
       throw new Error("The current environment does not support local storage.");
     if (this.LS = window.localStorage, t == null || !t)
       throw new Error("For local storage, modelPath must not be null, undefined or empty.");
@@ -2541,7 +2680,7 @@ class j {
     {
       const n = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = Se(t), a = st.join(t.weightData);
       try {
-        this.LS.setItem(this.keys.info, JSON.stringify(r)), this.LS.setItem(this.keys.topology, n), this.LS.setItem(this.keys.weightSpecs, s), this.LS.setItem(this.keys.weightData, Mn(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, Dn(a));
         const o = {
           format: t.format,
           generatedBy: t.generatedBy,
@@ -2588,33 +2727,33 @@ 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 = Nn(o), n;
+    return n.weightData = Fn(o), n;
   }
 }
 j.URL_SCHEME = "localstorage://";
-const Be = (e) => k().getBool("IS_BROWSER") && !Array.isArray(e) && e.startsWith(j.URL_SCHEME) ? On(e.slice(j.URL_SCHEME.length)) : null;
-A.registerSaveRouter(Be);
-A.registerLoadRouter(Be);
-function On(e) {
+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) {
   return new j(e);
 }
-class Gn {
+class zn {
   constructor() {
-    y(k().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), y(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
+    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;
   }
   async listModels() {
-    const t = {}, n = Q + P, s = P + Te;
+    const t = {}, n = Z + P, s = P + Te;
     for (let r = 0; r < this.LS.length; ++r) {
       const a = this.LS.key(r);
       if (a.startsWith(n) && a.endsWith(s)) {
-        const o = Ln(a);
+        const o = On(a);
         t[o] = JSON.parse(this.LS.getItem(a));
       }
     }
     return t;
   }
   async removeModel(t) {
-    t = _n(t);
+    t = Gn(t);
     const n = Ee(t);
     if (this.LS.getItem(n.info) == null)
       throw new Error(`Cannot find model at path '${t}'`);
@@ -2638,13 +2777,13 @@ class Gn {
  * limitations under the License.
  * =============================================================================
  */
-const Qt = "://";
-class $ {
+const Zt = "://";
+class N {
   constructor() {
     this.managers = {};
   }
   static getInstance() {
-    return $.instance == null && ($.instance = new $()), $.instance;
+    return N.instance == null && (N.instance = new N()), N.instance;
   }
   /**
    * Register a save-handler router.
@@ -2653,18 +2792,18 @@ class $ {
    * 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(Qt) && (t = t.slice(0, t.indexOf(Qt))), y(t.length > 0, () => "scheme must not be an empty string.");
-    const s = $.getInstance();
+    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.");
+    const s = N.getInstance();
     y(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = n;
   }
   static getManager(t) {
-    const n = $.getInstance().managers[t];
+    const n = N.getInstance().managers[t];
     if (n == null)
       throw new Error(`Cannot find model manager for scheme '${t}'`);
     return n;
   }
   static getSchemes() {
-    return Object.keys($.getInstance().managers);
+    return Object.keys(N.getInstance().managers);
   }
 }
 /**
@@ -2683,7 +2822,7 @@ class $ {
  * limitations under the License.
  * =============================================================================
  */
-class Un {
+class Vn {
   constructor() {
     this.messageName = "setTimeoutCustom", this.functionRefs = [], this.handledMessageCount = 0, this.hasEventListener = !1;
   }
@@ -2706,7 +2845,7 @@ class Un {
   // Interleaving window.postMessage and setTimeout will trick the browser and
   // avoid the clamp.
   setTimeoutCustom(t, n) {
-    if (typeof window > "u" || !k().getBool("USE_SETTIMEOUTCUSTOM")) {
+    if (typeof window > "u" || !S().getBool("USE_SETTIMEOUTCUSTOM")) {
       setTimeout(t, n);
       return;
     }
@@ -2724,31 +2863,31 @@ class Un {
     return le(t);
   }
 }
-if (k().get("IS_BROWSER")) {
-  k().setPlatform("browser", new Un());
+if (S().get("IS_BROWSER")) {
+  S().setPlatform("browser", new Vn());
   try {
-    $.registerManager(j.URL_SCHEME, new Gn());
+    N.registerManager(j.URL_SCHEME, new zn());
   } catch {
   }
   try {
-    $.registerManager(W.URL_SCHEME, new Dn());
+    N.registerManager(W.URL_SCHEME, new $n());
   } catch {
   }
 }
-const zn = {
+const Wn = {
   // tslint:disable-next-line:no-require-imports
   importFetch: () => require("node-fetch")
 };
-let St;
-class Vn {
+let kt;
+class jn {
   constructor() {
     this.util = require("util"), this.textEncoder = new this.util.TextEncoder();
   }
   fetch(t, n) {
-    return k().global.fetch != null ? k().global.fetch(t, n) : (St == null && (St = zn.importFetch()), St(t, n));
+    return S().global.fetch != null ? S().global.fetch(t, n) : (kt == null && (kt = Wn.importFetch()), kt(t, n));
   }
   now() {
-    const t = Z.hrtime();
+    const t = Q.hrtime();
     return t[0] * 1e3 + t[1] / 1e6;
   }
   encode(t, n) {
@@ -2763,7 +2902,7 @@ class Vn {
     return this.util.types.isFloat32Array(t) || this.util.types.isInt32Array(t) || this.util.types.isUint8Array(t) || this.util.types.isUint8ClampedArray(t);
   }
 }
-k().get("IS_NODE") && !k().get("IS_BROWSER") && k().setPlatform("node", new Vn());
+S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new jn());
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2780,8 +2919,8 @@ k().get("IS_NODE") && !k().get("IS_BROWSER") && k().setPlatform("node", new Vn()
  * limitations under the License.
  * =============================================================================
  */
-function Wn(e, t = "float32", n) {
-  return t = t || "float32", xt(e), new dn(e, t, n);
+function qn(e, t = "float32", n) {
+  return t = t || "float32", Ct(e), new fn(e, t, n);
 }
 /**
  * @license
@@ -2799,7 +2938,7 @@ function Wn(e, t = "float32", n) {
  * limitations under the License.
  * =============================================================================
  */
-function jn(e, t) {
+function Kn(e, t) {
   const n = T(e, "x", "cast");
   if (!Pe(t))
     throw new Error(`Failed to cast to unknown dtype ${t}`);
@@ -2808,7 +2947,7 @@ function jn(e, t) {
   const s = { x: n }, r = { dtype: t };
   return g.runKernel(oe, s, r);
 }
-const Ft = /* @__PURE__ */ N({ cast_: jn });
+const Rt = /* @__PURE__ */ D({ cast_: Kn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2825,11 +2964,11 @@ const Ft = /* @__PURE__ */ N({ cast_: jn });
  * limitations under the License.
  * =============================================================================
  */
-function Kn(e) {
+function Hn(e) {
   const n = { x: T(e, "x", "clone", "string_or_numeric") };
   return g.runKernel(ie, n);
 }
-const qn = /* @__PURE__ */ N({ clone_: Kn });
+const Xn = /* @__PURE__ */ D({ clone_: Hn });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2846,7 +2985,7 @@ const qn = /* @__PURE__ */ N({ clone_: Kn });
  * limitations under the License.
  * =============================================================================
  */
-function Hn(e, t = !1) {
+function Jn(e, t = !1) {
   console.log(e.toString(t));
 }
 /**
@@ -2866,13 +3005,13 @@ function Hn(e, t = !1) {
  * =============================================================================
  */
 be();
-const Jn = {
-  buffer: Wn,
-  cast: Ft,
-  clone: qn,
-  print: Hn
+const Yn = {
+  buffer: qn,
+  cast: Rt,
+  clone: Xn,
+  print: Jn
 };
-mn(Jn);
+mn(Yn);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2889,13 +3028,13 @@ mn(Jn);
  * limitations under the License.
  * =============================================================================
  */
-function Xn(e, t) {
+function Zn(e, t) {
   let n = T(e, "a", "add"), s = T(t, "b", "add");
-  [n, s] = q(n, s);
+  [n, s] = K(n, s);
   const r = { a: n, b: s };
   return g.runKernel(ae, r);
 }
-const S = /* @__PURE__ */ N({ add_: Xn });
+const k = /* @__PURE__ */ D({ add_: Zn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2912,13 +3051,13 @@ const S = /* @__PURE__ */ N({ add_: Xn });
  * limitations under the License.
  * =============================================================================
  */
-function Yn(e, t) {
+function Qn(e, t) {
   let n = T(e, "a", "floorDiv"), s = T(t, "b", "floorDiv");
-  [n, s] = q(n, s);
+  [n, s] = K(n, s);
   const r = { a: n, b: s };
   return g.runKernel(Ye, r);
 }
-const Qn = /* @__PURE__ */ N({ floorDiv_: Yn });
+const ts = /* @__PURE__ */ D({ floorDiv_: Qn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2935,14 +3074,14 @@ const Qn = /* @__PURE__ */ N({ floorDiv_: Yn });
  * limitations under the License.
  * =============================================================================
  */
-function Zn(e, t) {
+function es(e, t) {
   let n = T(e, "a", "div"), s = T(t, "b", "div");
-  if ([n, s] = q(n, s), n.dtype === "int32" && s.dtype === "int32")
-    return Qn(n, s);
+  if ([n, s] = K(n, s), n.dtype === "int32" && s.dtype === "int32")
+    return ts(n, s);
   const r = { a: n, b: s }, a = {};
-  return g.runKernel(Je, r, a);
+  return g.runKernel(Xe, r, a);
 }
-const x = /* @__PURE__ */ N({ div_: Zn });
+const $ = /* @__PURE__ */ D({ div_: es });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2959,13 +3098,13 @@ const x = /* @__PURE__ */ N({ div_: Zn });
  * limitations under the License.
  * =============================================================================
  */
-function ts(e, t) {
+function ns(e, t) {
   let n = T(e, "a", "mul"), s = T(t, "b", "mul");
-  [n, s] = q(n, s);
+  [n, s] = K(n, s);
   const r = { a: n, b: s };
-  return g.runKernel(Ze, r);
+  return g.runKernel(Qe, r);
 }
-const b = /* @__PURE__ */ N({ mul_: ts });
+const b = /* @__PURE__ */ D({ mul_: ns });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2982,17 +3121,17 @@ const b = /* @__PURE__ */ N({ mul_: ts });
  * limitations under the License.
  * =============================================================================
  */
-function es(e) {
+function ss(e) {
   const t = T(e, "x", "abs");
   if (t.dtype === "complex64") {
     const n = { x: t };
     return g.runKernel(He, n);
   } else {
     const n = { x: t };
-    return g.runKernel(qe, n);
+    return g.runKernel(Ke, n);
   }
 }
-const ns = /* @__PURE__ */ N({ abs_: es });
+const rs = /* @__PURE__ */ D({ abs_: ss });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3009,10 +3148,10 @@ const ns = /* @__PURE__ */ N({ abs_: es });
  * limitations under the License.
  * =============================================================================
  */
-function ss(e, t, n) {
-  xt(e), n = n || pt(t);
+function as(e, t, n) {
+  Ct(e), n = n || yt(t);
   const s = { shape: e, value: t, dtype: n };
-  return g.runKernel(Xe, {}, s);
+  return g.runKernel(Je, {}, s);
 }
 /**
  * @license
@@ -3030,7 +3169,7 @@ function ss(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-function ko(e, t) {
+function di(e, t) {
   const n = e.length, s = [];
   for (let r = 0; r < n; r++) {
     const a = n - 1 - r, o = e[a] || 1;
@@ -3038,7 +3177,7 @@ function ko(e, t) {
   }
   return s;
 }
-function Io(e, t) {
+function fi(e, t) {
   const n = [];
   for (let s = 0; s < t.length; s++) {
     const r = e[e.length - s - 1], a = t.length - s - 1, o = t[a];
@@ -3046,7 +3185,7 @@ function Io(e, t) {
   }
   return n;
 }
-function rs(e, t) {
+function os(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];
@@ -3080,11 +3219,11 @@ function rs(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function as(e) {
+function is(e) {
   const n = { x: T(e, "x", "zerosLike") };
   return g.runKernel(sn, n);
 }
-const C = /* @__PURE__ */ N({ zerosLike_: as });
+const C = /* @__PURE__ */ D({ zerosLike_: is });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3101,13 +3240,13 @@ const C = /* @__PURE__ */ N({ zerosLike_: as });
  * limitations under the License.
  * =============================================================================
  */
-function os(e, t) {
+function cs(e, t) {
   let n = T(e, "base", "pow"), s = T(t, "exp", "pow");
-  [n, s] = q(n, s);
+  [n, s] = K(n, s);
   const r = { a: n, b: s };
   return g.runKernel(tn, r);
 }
-const Zt = /* @__PURE__ */ N({ pow_: os });
+const Qt = /* @__PURE__ */ D({ pow_: cs });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3124,12 +3263,12 @@ const Zt = /* @__PURE__ */ N({ pow_: os });
  * limitations under the License.
  * =============================================================================
  */
-function K(e, t) {
+function q(e, t) {
   if ((F(e) && t !== "string" || Array.isArray(e)) && t !== "complex64")
     throw new Error("Error creating a new Scalar: value must be a primitive (number|boolean|string)");
   if (t === "string" && F(e) && !(e instanceof Uint8Array))
     throw new Error("When making a scalar from encoded string, the value must be `Uint8Array`.");
-  return En(e, [], [], t);
+  return An(e, [], [], t);
 }
 /**
  * @license
@@ -3147,11 +3286,11 @@ function K(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function is(e) {
+function ls(e) {
   const n = { x: T(e, "x", "sqrt", "float32") };
   return g.runKernel(en, n);
 }
-const nt = /* @__PURE__ */ N({ sqrt_: is });
+const nt = /* @__PURE__ */ D({ sqrt_: ls });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -3168,11 +3307,11 @@ const nt = /* @__PURE__ */ N({ sqrt_: is });
  * limitations under the License.
  * =============================================================================
  */
-function cs(e) {
+function us(e) {
   const t = T(e, "x", "square"), n = {};
   return g.runKernel("Square", { x: t }, n);
 }
-const V = /* @__PURE__ */ N({ square_: cs });
+const V = /* @__PURE__ */ D({ square_: us });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3189,18 +3328,18 @@ const V = /* @__PURE__ */ N({ square_: cs });
  * limitations under the License.
  * =============================================================================
  */
-function To(e) {
-  return y(ht(e), () => "The f passed in grads(f) must be a function"), (t, n) => {
+function gi(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 = In(t, "args", "tf.grads", "string_or_numeric"), r = n != null ? T(n, "dy", "tf.grads") : null;
+    const s = Tn(t, "args", "tf.grads", "string_or_numeric"), r = n != null ? T(n, "dy", "tf.grads") : null;
     return g.tidy(() => {
       const { value: a, grads: o } = g.gradients(() => e(...s), s, r);
-      return r != null && De(a.shape, r.shape, "The shape of dy passed in grads(f)([x1,...], dy) must match the shape returned by f([x1,...])"), us(o), o;
+      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;
     });
   };
 }
-function ls(e, t) {
-  y(ht(e), () => "The f passed in variableGrads(f) must be a function"), y(t == null || Array.isArray(t) && t.every((l) => l instanceof gt), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
+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");
   const n = t != null;
   if (!n) {
     t = [];
@@ -3216,10 +3355,10 @@ function ls(e, t) {
     i[u] != null && (c[l.name] = i[u]);
   }), s?.forEach((l) => c[l.name] = null), { value: o, grads: c };
 }
-function Eo(e) {
+function mi(e) {
   return g.customGrad(e);
 }
-function us(e) {
+function ds(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.`);
@@ -3240,13 +3379,13 @@ function us(e) {
  * limitations under the License.
  * =============================================================================
  */
-function hs(e, t) {
+function fs(e, t) {
   let n = T(e, "a", "sub"), s = T(t, "b", "sub");
-  [n, s] = q(n, s);
+  [n, s] = K(n, s);
   const r = { a: n, b: s };
   return g.runKernel(nn, r);
 }
-const tt = /* @__PURE__ */ N({ sub_: hs });
+const tt = /* @__PURE__ */ D({ sub_: fs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3263,13 +3402,13 @@ const tt = /* @__PURE__ */ N({ sub_: hs });
  * limitations under the License.
  * =============================================================================
  */
-function fs(e, t) {
+function gs(e, t) {
   let n = T(e, "a", "maximum"), s = T(t, "b", "maximum");
-  [n, s] = q(n, s), n.dtype === "bool" && (n = Ft(n, "int32"), s = Ft(s, "int32")), rs(n.shape, s.shape);
+  [n, s] = K(n, s), n.dtype === "bool" && (n = Rt(n, "int32"), s = Rt(s, "int32")), os(n.shape, s.shape);
   const r = { a: n, b: s };
-  return g.runKernel(Qe, r);
+  return g.runKernel(Ze, r);
 }
-const ds = /* @__PURE__ */ N({ maximum_: fs });
+const ms = /* @__PURE__ */ D({ maximum_: gs });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3286,8 +3425,8 @@ const ds = /* @__PURE__ */ N({ maximum_: fs });
  * limitations under the License.
  * =============================================================================
  */
-const gs = /* @__PURE__ */ new Map(), ms = /* @__PURE__ */ new Map();
-class ps {
+const ps = /* @__PURE__ */ new Map(), ys = /* @__PURE__ */ new Map();
+class bs {
   /**
    * Return the class name for this class to use in serialization contexts.
    *
@@ -3332,10 +3471,10 @@ class G {
     G.getMap().classNameMap[t.className] = [t, t.fromConfig];
   }
 }
-function ys(e, t, n) {
+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);
   const s = n, r = t + ">" + s;
-  return G.register(e), gs.set(r, e), ms.set(e, r), e;
+  return G.register(e), ps.set(r, e), ys.set(e, r), e;
 }
 /**
  * @license
@@ -3353,7 +3492,7 @@ function ys(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-class H extends ps {
+class H extends bs {
   /**
    * Executes `f()` and minimizes the scalar output of `f()` by computing
    * gradients of y with respect to the list of trainable variables provided by
@@ -3400,7 +3539,7 @@ class H extends ps {
    * @doc {heading: 'Training', subheading: 'Optimizers'}
    */
   computeGradients(t, n) {
-    return ls(t, n);
+    return hs(t, n);
   }
   /**
    * Dispose the variables (if any) owned by this optimizer instance.
@@ -3412,7 +3551,7 @@ class H extends ps {
     return this.iterations_ == null && (this.iterations_ = 0), {
       name: "iter",
       // TODO(cais): Use 'int64' type when available.
-      tensor: K(this.iterations_, "int32")
+      tensor: q(this.iterations_, "int32")
     };
   }
   async getWeights() {
@@ -3451,7 +3590,7 @@ Object.defineProperty(H, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-class bs extends H {
+class Ss extends H {
   /** @nocollapse */
   static get className() {
     return "Adadelta";
@@ -3474,9 +3613,9 @@ class bs extends H {
         return;
       const c = this.accumulatedGrads[r].variable, l = this.accumulatedUpdates[r].variable;
       E(() => {
-        const u = S(b(c, this.rho), b(V(i), 1 - this.rho)), h = b(x(nt(S(l, this.epsilon)), nt(S(c, this.epsilon))), i), f = S(b(l, this.rho), b(V(h), 1 - this.rho));
-        c.assign(u), l.assign(f);
-        const m = S(b(h, -this.learningRate), a);
+        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);
         a.assign(m);
       });
     }), this.incrementIterations();
@@ -3527,7 +3666,7 @@ class bs extends H {
  * limitations under the License.
  * =============================================================================
  */
-class ws extends H {
+class ks extends H {
   /** @nocollapse */
   static get className() {
     return "Adagrad";
@@ -3540,16 +3679,16 @@ class ws extends H {
       const a = g.registeredVariables[s];
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accumulator`,
-        variable: E(() => ss(a.shape, this.initialAccumulatorValue).variable(!1))
+        variable: E(() => as(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(() => {
-        const c = S(i, V(o));
+        const c = k(i, V(o));
         i.assign(c);
-        const l = S(b(x(o, nt(S(c, g.backend.epsilon()))), -this.learningRate), a);
+        const l = k(b($(o, nt(k(c, g.backend.epsilon()))), -this.learningRate), a);
         a.assign(l);
       });
     }), this.incrementIterations();
@@ -3592,14 +3731,14 @@ class ws extends H {
  * limitations under the License.
  * =============================================================================
  */
-class Ss extends H {
+class Is extends H {
   /** @nocollapse */
   static get className() {
     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(() => {
-      this.accBeta1 = K(n).variable(), this.accBeta2 = K(s).variable();
+      this.accBeta1 = q(n).variable(), this.accBeta2 = q(s).variable();
     }), r == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
@@ -3618,9 +3757,9 @@ class Ss extends H {
         const l = Array.isArray(t) ? t[o].tensor : t[a];
         if (l == null)
           return;
-        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedSecondMoment[o].variable, f = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = S(b(h, this.beta2), b(V(l), 1 - this.beta2)), p = x(f, s), d = x(m, r);
-        u.assign(f), h.assign(m);
-        const w = S(b(x(p, S(nt(d), this.epsilon)), -this.learningRate), i);
+        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), f = $(m, r);
+        u.assign(d), h.assign(m);
+        const w = k(b($(p, k(nt(f), 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();
@@ -3634,7 +3773,7 @@ class Ss extends H {
   }
   async setWeights(t) {
     t = await this.extractIterations(t), E(() => {
-      this.accBeta1.assign(Zt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Zt(this.beta2, this.iterations_ + 1));
+      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;
     this.accumulatedFirstMoment = t.slice(0, n).map((r) => ({
@@ -3674,20 +3813,20 @@ class Ss extends H {
  * limitations under the License.
  * =============================================================================
  */
-class ks extends H {
+class Ts extends H {
   /** @nocollapse */
   static get className() {
     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(() => {
-      this.iteration = K(0).variable(), this.accBeta1 = K(n).variable();
+      this.iteration = q(0).variable(), this.accBeta1 = q(n).variable();
     }), r == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
     const n = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
-      const s = tt(1, this.accBeta1), r = x(-this.learningRate, S(b(this.iteration, this.decay), 1));
+      const s = tt(1, this.accBeta1), r = $(-this.learningRate, k(b(this.iteration, this.decay), 1));
       n.forEach((a, o) => {
         const i = g.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
@@ -3700,11 +3839,11 @@ class ks 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, f = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), p = ns(l), d = ds(m, p);
-        u.assign(f), h.assign(d);
-        const w = S(b(x(r, s), x(f, S(d, this.epsilon))), i);
+        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), f = ms(m, p);
+        u.assign(d), h.assign(f);
+        const w = k(b($(r, s), $(d, k(f, this.epsilon))), i);
         i.assign(w);
-      }), this.iteration.assign(S(this.iteration, 1)), this.accBeta1.assign(b(this.accBeta1, this.beta1));
+      }), this.iteration.assign(k(this.iteration, 1)), this.accBeta1.assign(b(this.accBeta1, this.beta1));
     }), this.incrementIterations();
   }
   dispose() {
@@ -3746,7 +3885,7 @@ class ks extends H {
  * limitations under the License.
  * =============================================================================
  */
-class ve extends H {
+class Be extends H {
   /** @nocollapse */
   static get className() {
     return "SGD";
@@ -3761,7 +3900,7 @@ class ve extends H {
         return;
       const o = g.registeredVariables[s];
       E(() => {
-        const i = S(b(this.c, a), o);
+        const i = k(b(this.c, a), o);
         o.assign(i);
       });
     }), this.incrementIterations();
@@ -3770,7 +3909,7 @@ class ve extends H {
    * Sets the learning rate of the optimizer.
    */
   setLearningRate(t) {
-    this.learningRate = t, this.c != null && this.c.dispose(), this.c = Bn(K(-t));
+    this.learningRate = t, this.c != null && this.c.dispose(), this.c = Bn(q(-t));
   }
   dispose() {
     this.c.dispose();
@@ -3806,14 +3945,14 @@ class ve extends H {
  * limitations under the License.
  * =============================================================================
  */
-class Is extends ve {
+class Es extends Be {
   /** @nocollapse */
   // Name matters for Python compatibility.
   static get className() {
     return "Momentum";
   }
   constructor(t, n, s = !1) {
-    super(t), this.learningRate = t, this.momentum = n, this.useNesterov = s, this.accumulations = [], this.m = K(this.momentum);
+    super(t), this.learningRate = t, this.momentum = n, this.useNesterov = s, this.accumulations = [], this.m = q(this.momentum);
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
@@ -3825,8 +3964,8 @@ class Is extends ve {
       const o = this.accumulations[r].variable, i = Array.isArray(t) ? t[r].tensor : t[s];
       i != null && E(() => {
         let c;
-        const l = S(b(this.m, o), i);
-        this.useNesterov ? c = S(b(this.c, S(i, b(l, this.m))), a) : c = S(b(this.c, l), a), o.assign(l), a.assign(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);
       });
     }), this.incrementIterations();
   }
@@ -3877,7 +4016,7 @@ class Is extends ve {
  * limitations under the License.
  * =============================================================================
  */
-class Ts extends H {
+class As extends H {
   /** @nocollapse */
   static get className() {
     return "RMSProp";
@@ -3904,16 +4043,16 @@ class Ts extends H {
         return;
       const c = this.accumulatedMeanSquares[r].variable, l = this.accumulatedMoments[r].variable;
       E(() => {
-        const u = S(b(c, this.decay), b(V(i), 1 - this.decay));
+        const u = k(b(c, this.decay), b(V(i), 1 - this.decay));
         if (this.centered) {
-          const h = this.accumulatedMeanGrads[r].variable, f = S(b(h, this.decay), b(i, 1 - this.decay)), m = x(b(i, this.learningRate), nt(tt(u, S(V(f), this.epsilon)))), p = S(b(l, this.momentum), m);
-          c.assign(u), h.assign(f), l.assign(p);
-          const d = tt(a, p);
-          a.assign(d);
+          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 f = tt(a, p);
+          a.assign(f);
         } else {
-          const h = S(b(c, this.decay), b(V(i), 1 - this.decay)), f = S(b(l, this.momentum), x(b(i, this.learningRate), nt(S(h, this.epsilon))));
-          c.assign(h), l.assign(f);
-          const m = tt(a, f);
+          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))));
+          c.assign(h), l.assign(d);
+          const m = tt(a, d);
           a.assign(m);
         }
       });
@@ -3970,18 +4109,18 @@ class Ts extends H {
  * limitations under the License.
  * =============================================================================
  */
-const Es = [
-  bs,
-  ws,
+const vs = [
   Ss,
   ks,
   Is,
   Ts,
-  ve
+  Es,
+  As,
+  Be
 ];
-function As() {
-  for (const e of Es)
-    ys(e);
+function Bs() {
+  for (const e of vs)
+    ws(e);
 }
 /**
  * @license
@@ -3999,237 +4138,295 @@ function As() {
  * limitations under the License.
  * =============================================================================
  */
-As();
+Bs();
 export {
-  Oa as $,
-  Ss as A,
-  Zs as B,
-  or as C,
-  Ft as D,
+  ne as $,
+  Is as A,
+  Ge as B,
+  K as C,
+  ur as D,
   g as E,
-  Wa as F,
-  Pr as G,
-  Bn as H,
-  Fs as I,
-  kn as J,
-  En as K,
-  Qa as L,
-  ta as M,
-  k as N,
-  Lr as O,
-  ba as P,
-  rs as Q,
-  Ia as R,
-  qa as S,
-  D as T,
-  de as U,
-  Ea as V,
-  Zt as W,
-  De as X,
-  ar as Y,
-  ne as Z,
-  dr as _,
+  Ja as F,
+  Qr as G,
+  wo as H,
+  Xn as I,
+  Co as J,
+  wr as K,
+  Ha as L,
+  Sa as M,
+  Rt as N,
+  yo as O,
+  Oa as P,
+  In as Q,
+  qa as R,
+  So as S,
+  x as T,
+  An as U,
+  Ps as V,
+  $t as W,
+  ao as X,
+  ta as Y,
+  xe as Z,
+  br as _,
   M as a,
-  va as a$,
-  oa as a0,
-  xe as a1,
-  ns as a2,
-  nt as a3,
-  V as a4,
-  Ca as a5,
-  Fr as a6,
-  qr as a7,
-  S as a8,
-  la as a9,
-  oo as aA,
-  yo as aB,
-  _a as aC,
-  er as aD,
-  Pa as aE,
-  Ar as aF,
-  Rr as aG,
-  _r as aH,
-  Or as aI,
-  Gr as aJ,
-  jr as aK,
-  Kr as aL,
-  ha as aM,
-  Jr as aN,
-  ia as aO,
-  Ta as aP,
-  $a as aQ,
-  Ds as aR,
-  no as aS,
-  eo as aT,
-  yr as aU,
-  $r as aV,
-  ao as aW,
-  da as aX,
-  ma as aY,
+  Ka as a$,
+  vr as a0,
+  ho as a1,
+  Ba as a2,
+  rs as a3,
+  nt as a4,
+  V as a5,
+  Ra as a6,
+  k as a7,
+  qr as a8,
+  da as a9,
+  ci as aA,
+  Se as aB,
+  li as aC,
+  ui as aD,
+  Vs as aE,
+  jt as aF,
+  ue as aG,
+  di as aH,
+  Ho as aI,
+  O as aJ,
+  Gs as aK,
+  Ls as aL,
+  $s as aM,
+  ut as aN,
+  uo as aO,
+  dr as aP,
+  co as aQ,
+  Ur as aR,
+  Kr as aS,
+  ea as aT,
+  na as aU,
+  ra as aV,
+  la as aW,
+  ua as aX,
+  xa as aY,
   ga as aZ,
-  Na as a_,
-  ua as aa,
-  Za as ab,
-  $t as ac,
-  Rt as ad,
-  Rs as ae,
-  F as af,
-  pe as ag,
-  fo as ah,
-  dt as ai,
-  xr as aj,
-  Wn as ak,
-  x as al,
-  jt as am,
-  ue as an,
-  xs as ao,
-  $e as ap,
-  ho as aq,
-  za as ar,
-  rr as as,
-  Br as at,
-  Wr as au,
-  Sa as av,
-  Aa as aw,
-  Ra as ax,
-  ro as ay,
-  Io as az,
+  Ma as a_,
+  Os as aa,
+  F as ab,
+  S as ac,
+  pe as ad,
+  Qo as ae,
+  gt as af,
+  Yr as ag,
+  qn as ah,
+  xt as ai,
+  $ as aj,
+  ie as ak,
+  ca as al,
+  Yo as am,
+  Ua as an,
+  Ne as ao,
+  mo as ap,
+  zr as aq,
+  Xa as ar,
+  eo as as,
+  zo as at,
+  fi as au,
+  Ns as av,
+  Zo as aw,
+  Xe as ax,
+  A as ay,
+  st as az,
   b,
-  Vs as b$,
-  to as b0,
-  $s as b1,
-  ko as b2,
-  Ps as b3,
-  Cs as b4,
-  Lt as b5,
-  te as b6,
-  uo as b7,
-  dn as b8,
-  Re as b9,
-  ya as bA,
-  pa as bB,
-  wa as bC,
-  ja as bD,
-  Da as bE,
-  xa as bF,
-  La as bG,
-  Ga as bH,
-  so as bI,
-  cr as bJ,
-  io as bK,
-  Sr as bL,
-  kr as bM,
-  ve as bN,
-  Is as bO,
-  Ts as bP,
-  bs as bQ,
-  ks as bR,
-  ws as bS,
-  ys as bT,
-  ps as bU,
-  G as bV,
-  qe as bW,
-  Ls as bX,
-  _s as bY,
-  ae as bZ,
-  Os as b_,
-  Gs as ba,
-  Us as bb,
-  zs as bc,
-  Js as bd,
-  Ys as be,
-  Ya as bf,
-  tr as bg,
-  Cr as bh,
-  ir as bi,
-  lr as bj,
-  ur as bk,
-  fr as bl,
-  gr as bm,
-  mr as bn,
-  pr as bo,
-  br as bp,
-  wr as bq,
-  Nr as br,
-  Mr as bs,
-  Hr as bt,
-  Va as bu,
-  Xr as bv,
-  ea as bw,
-  sa as bx,
-  aa as by,
-  fa as bz,
-  Eo as c,
-  Ws as c0,
-  js as c1,
-  Hs as c2,
-  Ks as c3,
-  qs as c4,
-  Qs as c5,
-  Xs as c6,
-  nr as c7,
-  oe as c8,
-  sr as c9,
-  en as cA,
-  Ja as cB,
-  Ha as cC,
-  nn as cD,
-  Xa as cE,
-  ds as cF,
-  sn as cG,
-  Oe as cH,
-  H as cI,
-  Ns as cJ,
-  So as cK,
-  bo as cL,
-  wo as cM,
-  He as ca,
-  hr as cb,
-  Ir as cc,
-  Er as cd,
-  Tr as ce,
-  vr as cf,
-  Dr as cg,
-  Ye as ch,
-  ie as ci,
-  Ur as cj,
-  zr as ck,
-  Vr as cl,
-  Yr as cm,
-  Zr as cn,
-  Qr as co,
-  Qe as cp,
-  ra as cq,
-  na as cr,
-  ca as cs,
-  Ze as ct,
-  tn as cu,
-  ka as cv,
-  Je as cw,
-  Fa as cx,
-  Ma as cy,
-  Ua as cz,
-  go as d,
-  mo as e,
-  K as f,
-  ss as g,
-  lo as h,
-  To as i,
-  T as j,
-  In as k,
-  y as l,
-  po as m,
-  xt as n,
-  N as o,
-  Ge as p,
-  z as q,
-  co as r,
+  La as b$,
+  so as b0,
+  Go as b1,
+  _o as b2,
+  Fr as b3,
+  Jr as b4,
+  Wo as b5,
+  $a as b6,
+  Pa as b7,
+  Ca as b8,
+  Qa as b9,
+  Re as bA,
+  Ys as bB,
+  Zs as bC,
+  Qs as bD,
+  or as bE,
+  cr as bF,
+  $o as bG,
+  hr as bH,
+  Zr as bI,
+  yr as bJ,
+  Sr as bK,
+  Ir as bL,
+  Tr as bM,
+  Ar as bN,
+  Br as bO,
+  Mr as bP,
+  Dr as bQ,
+  Rr as bR,
+  Nr as bS,
+  Wr as bT,
+  fa as bU,
+  po as bV,
+  ma as bW,
+  ka as bX,
+  Ta as bY,
+  va as bZ,
+  _a as b_,
+  Ya as ba,
+  Lo as bb,
+  Ke as bc,
+  Us as bd,
+  Ks as be,
+  qs as bf,
+  oe as bg,
+  zs as bh,
+  _t as bi,
+  ae as bj,
+  fr as bk,
+  te as bl,
+  pr as bm,
+  jr as bn,
+  Hr as bo,
+  Ye as bp,
+  Ze as bq,
+  Qe as br,
+  Na as bs,
+  za as bt,
+  ro as bu,
+  fn as bv,
+  en as bw,
+  vo as bx,
+  Mo as by,
+  nn as bz,
+  mi as c,
+  xr as c$,
+  Ga as c0,
+  bo as c1,
+  no as c2,
+  lo as c3,
+  fo as c4,
+  Uo as c5,
+  kr as c6,
+  qo as c7,
+  $r as c8,
+  Cr as c9,
+  oa as cA,
+  ia as cB,
+  ya as cC,
+  wa as cD,
+  ba as cE,
+  Ea as cF,
+  Ia as cG,
+  Da as cH,
+  Fa as cI,
+  tn as cJ,
+  to as cK,
+  Za as cL,
+  go as cM,
+  Bo as cN,
+  No as cO,
+  ms as cP,
+  sn as cQ,
+  ai as cR,
+  ws as cS,
+  bs as cT,
+  G as cU,
+  Oe as cV,
+  H as cW,
+  xs as cX,
+  hi as cY,
+  oi as cZ,
+  ii as c_,
+  jo as ca,
+  Be as cb,
+  Es as cc,
+  As as cd,
+  Ss as ce,
+  Ts as cf,
+  ks as cg,
+  Hs as ch,
+  Xs as ci,
+  Js as cj,
+  tr as ck,
+  er as cl,
+  nr as cm,
+  ar as cn,
+  sr as co,
+  rr as cp,
+  lr as cq,
+  ir as cr,
+  gr as cs,
+  He as ct,
+  Er as cu,
+  Lr as cv,
+  Or as cw,
+  _r as cx,
+  Vr as cy,
+  aa as cz,
+  ei as d,
+  pa as d0,
+  Xr as d1,
+  sa as d2,
+  Do as d3,
+  Po as d4,
+  Oo as d5,
+  de as d6,
+  ts as d7,
+  Fe as d8,
+  Rs as d9,
+  oo as dA,
+  ti as dB,
+  _s as dC,
+  lt as dD,
+  Cs as dE,
+  It as dF,
+  kn as dG,
+  Vo as dH,
+  Nt as da,
+  Ws as db,
+  ri as dc,
+  mr as dd,
+  Pr as de,
+  ct as df,
+  js as dg,
+  Gr as dh,
+  Je as di,
+  yt as dj,
+  Ko as dk,
+  ha as dl,
+  Aa as dm,
+  Va as dn,
+  Wa as dp,
+  ja as dq,
+  io as dr,
+  ko as ds,
+  Io as dt,
+  To as du,
+  Eo as dv,
+  Ao as dw,
+  Fo as dx,
+  Ro as dy,
+  xo as dz,
+  ni as e,
+  q as f,
+  as as g,
+  Jo as h,
+  z as i,
+  os as j,
+  y as k,
+  Qt as l,
+  si as m,
+  Bn as n,
+  gi as o,
+  $e as p,
+  D as q,
+  Xo as r,
   tt as s,
   E as t,
-  q as u,
-  ls as v,
-  Ba as w,
-  Ka as x,
-  qn as y,
+  fe as u,
+  hs as v,
+  T as w,
+  Tn as x,
+  Ct as y,
   C as z
 };