@genai-fi/nanogpt 0.2.12 → 0.3.0

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

@@ -1,5 +1,5 @@
 import { g as Ot } from "./index-D5v913EJ.js";
-import { p as Q } from "./index-xuotMAFm.js";
+import { p as Z } from "./index-xuotMAFm.js";
 import { B as gt } from "./index-Tf7vU29b.js";
 /**
  * @license
@@ -17,8 +17,8 @@ import { B as gt } from "./index-Tf7vU29b.js";
  * limitations under the License.
  * =============================================================================
  */
-const Ee = 1e-7, Ae = 1e-4;
-class Be {
+const Ae = 1e-7, Be = 1e-4;
+class ve {
   refCount(t) {
     return v("refCount");
   }
@@ -49,7 +49,7 @@ class Be {
   write(t, e, s) {
     return v("write");
   }
-  move(t, e, s, r, i) {
+  move(t, e, s, r, a) {
     return v("move");
   }
   createTensorFromGPUData(t, e, s) {
@@ -64,7 +64,7 @@ class Be {
   }
   /** Returns the smallest representable number.  */
   epsilon() {
-    return this.floatPrecision() === 32 ? Ee : Ae;
+    return this.floatPrecision() === 32 ? Ae : Be;
   }
   dispose() {
     return v("dispose");
@@ -89,14 +89,26 @@ function v(n) {
  * limitations under the License.
  * =============================================================================
  */
+function Bs(n) {
+  let t = n.length, e = 0;
+  for (; t > 0; )
+    e = Math.random() * t | 0, t--, Me(n, t, e);
+}
+function Me(n, t, e) {
+  const s = n[t];
+  n[t] = n[e], n[e] = s;
+}
 function y(n, t) {
   if (!n)
     throw new Error(typeof t == "string" ? t : t());
 }
-function Is(n, t, e = "") {
-  y(Rt(n, t), () => e + ` Shapes ${n} and ${t} must match`);
+function vs(n, t, e = "") {
+  y(Ft(n, t), () => e + ` Shapes ${n} and ${t} must match`);
+}
+function Ms(n) {
+  y(n != null, () => "The input to the tensor constructor must be a non-null value.");
 }
-function G(n) {
+function z(n) {
   if (n.length === 0)
     return 1;
   let t = n[0];
@@ -104,7 +116,7 @@ function G(n) {
     t *= n[e];
   return t;
 }
-function Rt(n, t) {
+function Ft(n, t) {
   if (n === t)
     return !0;
   if (n == null || t == null || n.length !== t.length)
@@ -114,17 +126,30 @@ function Rt(n, t) {
       return !1;
   return !0;
 }
-function ve(n) {
+function Ne(n) {
   return n % 1 === 0;
 }
-function ct(n, t) {
+function lt(n, t) {
   return t <= n.length ? n : n + " ".repeat(t - n.length);
 }
-function Ts(n, t) {
+function Re(n, t) {
   const e = t.length;
-  return n = n == null ? t.map((s, r) => r) : [].concat(n), y(n.every((s) => s >= -e && s < e), () => `All values in axis param must be in range [-${e}, ${e}) but got axis ${n}`), y(n.every((s) => ve(s)), () => `All values in axis param must be integers but got axis ${n}`), n.map((s) => s < 0 ? e + s : s);
+  return n = n == null ? t.map((s, r) => r) : [].concat(n), y(n.every((s) => s >= -e && s < e), () => `All values in axis param must be in range [-${e}, ${e}) but got axis ${n}`), y(n.every((s) => Ne(s)), () => `All values in axis param must be integers but got axis ${n}`), n.map((s) => s < 0 ? e + s : s);
+}
+function Ns(n, t) {
+  const e = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, a = t == null || r ? null : Re(t, n).sort();
+  let o = 0;
+  for (let i = 0; i < n.length; ++i) {
+    if (a != null) {
+      if (a[o] === i && n[i] !== 1)
+        throw new Error(`Can't squeeze axis ${i} since its dim '${n[i]}' is not 1`);
+      (a[o] == null || a[o] > i) && n[i] === 1 && (e.push(n[i]), s.push(i)), a[o] <= i && o++;
+    }
+    n[i] !== 1 && (e.push(n[i]), s.push(i));
+  }
+  return { newShape: e, keptDims: s };
 }
-function Me(n, t) {
+function Fe(n, t) {
   let e = null;
   if (n == null || n === "float32")
     e = new Float32Array(t);
@@ -138,7 +163,7 @@ function Me(n, t) {
     throw new Error(`Unknown data type ${n}`);
   return e;
 }
-function Fe(n, t) {
+function De(n, t) {
   for (let e = 0; e < n.length; e++) {
     const s = n[e];
     if (isNaN(s) || !isFinite(s))
@@ -157,28 +182,28 @@ function St(n) {
     return 1;
   throw new Error(`Unknown dtype ${n}`);
 }
-function Re(n) {
+function xe(n) {
   if (n == null)
     return 0;
   let t = 0;
   return n.forEach((e) => t += e.length), t;
 }
-function xt(n) {
+function Dt(n) {
   return typeof n == "string" || n instanceof String;
 }
-function xe(n) {
+function Ce(n) {
   return typeof n == "boolean";
 }
-function Ne(n) {
+function Pe(n) {
   return typeof n == "number";
 }
 function mt(n) {
-  return Array.isArray(n) ? mt(n[0]) : n instanceof Float32Array ? "float32" : n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray ? "int32" : Ne(n) ? "float32" : xt(n) ? "string" : xe(n) ? "bool" : "float32";
+  return Array.isArray(n) ? mt(n[0]) : n instanceof Float32Array ? "float32" : n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray ? "int32" : Pe(n) ? "float32" : Dt(n) ? "string" : Ce(n) ? "bool" : "float32";
 }
 function kt(n) {
   return !!(n && n.constructor && n.call && n.apply);
 }
-function Nt(n) {
+function $t(n) {
   const t = n.length;
   if (t < 2)
     return [];
@@ -188,36 +213,36 @@ function Nt(n) {
     e[s] = e[s + 1] * n[s + 1];
   return e;
 }
-function Qt(n, t, e, s = !1) {
+function Zt(n, t, e, s = !1) {
   const r = new Array();
   if (t.length === 1) {
-    const i = t[0] * (s ? 2 : 1);
-    for (let o = 0; o < i; o++)
+    const a = t[0] * (s ? 2 : 1);
+    for (let o = 0; o < a; o++)
       r[o] = e[n + o];
   } else {
-    const i = t[0], o = t.slice(1), a = o.reduce((c, l) => c * l) * (s ? 2 : 1);
-    for (let c = 0; c < i; c++)
-      r[c] = Qt(n + c * a, o, e, s);
+    const a = t[0], o = t.slice(1), i = o.reduce((c, l) => c * l) * (s ? 2 : 1);
+    for (let c = 0; c < a; c++)
+      r[c] = Zt(n + c * i, o, e, s);
   }
   return r;
 }
-function Lt(n, t, e = !1) {
+function _t(n, t, e = !1) {
   if (n.length === 0)
     return t[0];
-  const s = n.reduce((r, i) => r * i) * (e ? 2 : 1);
+  const s = n.reduce((r, a) => r * a) * (e ? 2 : 1);
   if (s === 0)
     return [];
   if (s !== t.length)
     throw new Error(`[${n}] does not match the input size ${t.length}${e ? " for a complex tensor" : ""}.`);
-  return Qt(0, n, t, e);
+  return Zt(0, n, t, e);
 }
-function De(n, t) {
-  const e = Zt(n, t);
+function Le(n, t) {
+  const e = te(n, t);
   for (let s = 0; s < e.length; s++)
     e[s] = 1;
   return e;
 }
-function Zt(n, t) {
+function te(n, t) {
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(n);
   if (t === "int32")
@@ -226,7 +251,7 @@ function Zt(n, t) {
     return new Uint8Array(n);
   throw new Error(`Unknown data type ${t}`);
 }
-function Dt(n) {
+function xt(n) {
   n.forEach((t) => {
     y(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${n}].`);
   });
@@ -251,18 +276,18 @@ function Ct(n) {
  * =============================================================================
  */
 const Ut = "tfjsflags";
-class Ce {
+class Oe {
   // tslint:disable-next-line: no-any
   constructor(t) {
     this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = _e, this.populateURLFlags();
   }
   setPlatform(t, e) {
-    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 = e;
+    this.platform != null && (k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(`Platform ${this.platformName} has already been set. Overwriting the platform with ${t}.`)), this.platformName = t, this.platform = e;
   }
   registerFlag(t, e, s) {
     if (this.flagRegistry[t] = { evaluationFn: e, setHook: s }, this.urlFlags[t] != null) {
       const r = this.urlFlags[t];
-      S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(`Setting feature override from URL ${t}: ${r}.`), this.set(t, r);
+      k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(`Setting feature override from URL ${t}: ${r}.`), this.set(t, r);
     }
   }
   async getAsync(t) {
@@ -313,28 +338,28 @@ class Ce {
       return;
     const t = this.getQueryParams(this.global.location.search);
     Ut in t && t[Ut].split(",").forEach((s) => {
-      const [r, i] = s.split(":");
-      this.urlFlags[r] = Oe(r, i);
+      const [r, a] = s.split(":");
+      this.urlFlags[r] = Ge(r, a);
     });
   }
 }
 function _e(n) {
   const t = {};
-  return n.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (e, ...s) => (Pe(t, s[0], s[1]), s.join("="))), t;
+  return n.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (e, ...s) => (Ue(t, s[0], s[1]), s.join("="))), t;
 }
-function Pe(n, t, e) {
+function Ue(n, t, e) {
   n[decodeURIComponent(t)] = decodeURIComponent(e || "");
 }
-function Oe(n, t) {
+function Ge(n, t) {
   const e = t.toLowerCase();
   return e === "true" || e === "false" ? e === "true" : `${+e}` === e ? +e : t;
 }
-function S() {
-  return te;
+function k() {
+  return ee;
 }
-let te = null;
-function Le(n) {
-  te = n;
+let ee = null;
+function ze(n) {
+  ee = n;
 }
 /**
  * @license
@@ -353,15 +378,15 @@ function Le(n) {
  * =============================================================================
  */
 let pt;
-function ee() {
+function ne() {
   if (pt == null) {
     let n;
     if (typeof window < "u")
       n = window;
     else if (typeof Ot < "u")
       n = Ot;
-    else if (typeof Q < "u")
-      n = Q;
+    else if (typeof Z < "u")
+      n = Z;
     else if (typeof self < "u")
       n = self;
     else
@@ -370,12 +395,12 @@ function ee() {
   }
   return pt;
 }
-function Ue() {
-  const n = ee();
+function Ve() {
+  const n = ne();
   return n._tfGlobals == null && (n._tfGlobals = /* @__PURE__ */ new Map()), n._tfGlobals;
 }
-function _t(n, t) {
-  const e = Ue();
+function Pt(n, t) {
+  const e = Ve();
   if (e.has(n))
     return e.get(n);
   {
@@ -383,7 +408,7 @@ function _t(n, t) {
     return e.set(n, s), e.get(n);
   }
 }
-const Ge = "Abs", ne = "Add", Es = "BatchMatMul", se = "Cast", As = "Complex", ze = "ComplexAbs", Bs = "Concat", We = "RealDiv", vs = "Elu", Ms = "Exp", je = "Fill", Ke = "FloorDiv", Fs = "GatherV2", $s = "GatherNd", re = "Identity", Rs = "Imag", xs = "LeakyRelu", Ns = "Log", Ds = "Max", Ve = "Maximum", qe = "Multiply", Cs = "Neg", _s = "Pack", He = "Pow", Ps = "Prelu", Os = "Range", Ls = "Real", Us = "Relu", Gs = "Reshape", zs = "Relu6", Ws = "ScatterNd", js = "Sigmoid", Je = "Sqrt", Ks = "Sum", Vs = "SplitV", qs = "Softmax", Xe = "Sub", Hs = "Transpose", Ye = "ZerosLike", Js = "Step", Xs = "_FusedMatMul";
+const We = "Abs", Rs = "Acos", Fs = "Acosh", se = "Add", Ds = "AddN", $s = "All", xs = "Any", Cs = "ArgMax", Ps = "ArgMin", Ls = "Asin", Os = "Asinh", _s = "Atan", Us = "Atanh", Gs = "Atan2", zs = "AvgPool", Vs = "AvgPoolGrad", Ws = "AvgPool3D", js = "AvgPool3DGrad", Ks = "BatchMatMul", qs = "BatchToSpaceND", Hs = "Bincount", Js = "BroadcastTo", re = "Cast", Xs = "Ceil", Ys = "ClipByValue", Qs = "Complex", je = "ComplexAbs", Zs = "Concat", tr = "Conv2D", er = "Conv2DBackpropFilter", nr = "Conv2DBackpropInput", sr = "Conv3D", rr = "Conv3DBackpropFilterV2", ar = "Conv3DBackpropInputV2", or = "Cos", ir = "Cosh", cr = "Cumprod", lr = "Cumsum", ur = "CropAndResize", hr = "DenseBincount", dr = "DepthwiseConv2dNative", fr = "DepthwiseConv2dNativeBackpropFilter", gr = "DepthwiseConv2dNativeBackpropInput", mr = "Dilation2D", pr = "Dilation2DBackpropInput", yr = "Dilation2DBackpropFilter", Ke = "RealDiv", br = "Einsum", wr = "Elu", Sr = "EluGrad", kr = "Erf", Ir = "Equal", Tr = "Exp", Er = "ExpandDims", Ar = "Expm1", qe = "Fill", Br = "FlipLeftRight", vr = "Floor", He = "FloorDiv", Mr = "FusedBatchNorm", Nr = "GatherV2", Rr = "GatherNd", Fr = "Greater", Dr = "GreaterEqual", ae = "Identity", $r = "Imag", xr = "IsFinite", Cr = "IsInf", Pr = "IsNan", Lr = "LeakyRelu", Or = "Less", _r = "LessEqual", Ur = "Log", Gr = "Log1p", zr = "LogicalAnd", Vr = "LogicalNot", Wr = "LogSoftmax", jr = "LRN", Kr = "LRNGrad", qr = "Max", Je = "Maximum", Hr = "MaxPool", Jr = "MaxPoolGrad", Xr = "MaxPool3D", Yr = "MaxPool3DGrad", Qr = "Mean", Zr = "Min", ta = "Minimum", ea = "MirrorPad", na = "Mod", sa = "Multinomial", Xe = "Multiply", ra = "Neg", aa = "NotEqual", oa = "NonMaxSuppressionV3", ia = "NonMaxSuppressionV4", ca = "NonMaxSuppressionV5", la = "OnesLike", ua = "OneHot", ha = "Pack", da = "PadV2", Ye = "Pow", fa = "Prelu", ga = "Prod", ma = "Range", pa = "Real", ya = "Reciprocal", ba = "Relu", wa = "Reshape", Sa = "ResizeNearestNeighbor", ka = "ResizeNearestNeighborGrad", Ia = "ResizeBilinear", Ta = "ResizeBilinearGrad", Ea = "Relu6", Aa = "Reverse", Ba = "Round", va = "Rsqrt", Ma = "ScatterNd", Na = "Select", Ra = "Selu", Fa = "Slice", Da = "Sin", $a = "Sinh", xa = "Sign", Ca = "Sigmoid", Pa = "Softplus", Qe = "Sqrt", La = "Sum", Oa = "SpaceToBatchND", _a = "SplitV", Ua = "Softmax", Ga = "SquaredDifference", za = "Square", Ze = "Sub", Va = "Tan", Wa = "Tanh", ja = "Tile", Ka = "TopK", qa = "Transform", Ha = "Transpose", Ja = "Unpack", Xa = "UnsortedSegmentSum", tn = "ZerosLike", Ya = "Step", Qa = "RotateWithOffset", Za = "_FusedMatMul", to = "FusedConv2D";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -400,8 +425,8 @@ const Ge = "Abs", ne = "Add", Es = "BatchMatMul", se = "Cast", As = "Complex", z
  * limitations under the License.
  * =============================================================================
  */
-function O(...n) {
-  S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(...n);
+function _(...n) {
+  k().getBool("IS_TEST") || k().getBool("PROD") || console.warn(...n);
 }
 /**
  * @license
@@ -419,34 +444,34 @@ function O(...n) {
  * limitations under the License.
  * =============================================================================
  */
-const ht = _t("kernelRegistry", () => /* @__PURE__ */ new Map()), It = _t("gradRegistry", () => /* @__PURE__ */ new Map());
+const ht = Pt("kernelRegistry", () => /* @__PURE__ */ new Map()), It = Pt("gradRegistry", () => /* @__PURE__ */ new Map());
 function Gt(n, t) {
-  const e = ie(n, t);
+  const e = oe(n, t);
   return ht.get(e);
 }
 function zt(n) {
   return It.get(n);
 }
-function Wt(n) {
+function Vt(n) {
   const t = ht.entries(), e = [];
   for (; ; ) {
     const { done: s, value: r } = t.next();
     if (s)
       break;
-    const [i, o] = r, [a] = i.split("_");
-    a === n && e.push(o);
+    const [a, o] = r, [i] = a.split("_");
+    i === n && e.push(o);
   }
   return e;
 }
-function Ys(n) {
-  const { kernelName: t, backendName: e } = n, s = ie(t, e);
-  ht.has(s) && O(`The kernel '${t}' for backend '${e}' is already registered`), ht.set(s, n);
+function eo(n) {
+  const { kernelName: t, backendName: e } = n, s = oe(t, e);
+  ht.has(s) && _(`The kernel '${t}' for backend '${e}' is already registered`), ht.set(s, n);
 }
-function Qs(n) {
+function no(n) {
   const { kernelName: t } = n;
-  It.has(t) && S().getBool("DEBUG") && O(`Overriding the gradient for '${t}'`), It.set(t, n);
+  It.has(t) && k().getBool("DEBUG") && _(`Overriding the gradient for '${t}'`), It.set(t, n);
 }
-function ie(n, t) {
+function oe(n, t) {
   return `${t}_${n}`;
 }
 /**
@@ -465,7 +490,7 @@ function ie(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function oe(n) {
+function ie(n) {
   return n instanceof Float32Array || n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray;
 }
 /**
@@ -484,13 +509,13 @@ function oe(n) {
  * limitations under the License.
  * =============================================================================
  */
-function Qe(n, t) {
+function en(n, t) {
   return n instanceof Float32Array && t === "float32" || n instanceof Int32Array && t === "int32" || n instanceof Uint8Array && t === "bool";
 }
-function ae(n, t) {
+function ce(n, t) {
   if (t === "string")
     throw new Error("Cannot convert a string[] to a TypedArray");
-  if (Array.isArray(n) && (n = at(n)), S().getBool("DEBUG") && Fe(n, t), Qe(n, t))
+  if (Array.isArray(n) && (n = ct(n)), k().getBool("DEBUG") && De(n, t), en(n, t))
     return n;
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(n);
@@ -504,30 +529,30 @@ function ae(n, t) {
   } else
     throw new Error(`Unknown data type ${t}`);
 }
-function ft() {
-  return S().platform.now();
+function dt() {
+  return k().platform.now();
 }
-function Ze(n, t = "utf-8") {
-  return t = t || "utf-8", S().platform.encode(n, t);
+function nn(n, t = "utf-8") {
+  return t = t || "utf-8", k().platform.encode(n, t);
 }
-function jt(n, t = "utf-8") {
-  return t = t || "utf-8", S().platform.decode(n, t);
+function Wt(n, t = "utf-8") {
+  return t = t || "utf-8", k().platform.decode(n, t);
 }
-function $(n) {
-  return S().platform.isTypedArray != null ? S().platform.isTypedArray(n) : oe(n);
+function R(n) {
+  return k().platform.isTypedArray != null ? k().platform.isTypedArray(n) : ie(n);
 }
-function at(n, t = [], e = !1) {
-  if (t == null && (t = []), typeof n == "boolean" || typeof n == "number" || typeof n == "string" || Ct(n) || n == null || $(n) && e)
+function ct(n, t = [], e = !1) {
+  if (t == null && (t = []), typeof n == "boolean" || typeof n == "number" || typeof n == "string" || Ct(n) || n == null || R(n) && e)
     t.push(n);
-  else if (Array.isArray(n) || $(n))
+  else if (Array.isArray(n) || R(n))
     for (let s = 0; s < n.length; ++s)
-      at(n[s], t, e);
+      ct(n[s], t, e);
   else {
     let s = -1;
     for (const r of Object.keys(n))
       /^([1-9]+[0-9]*|0)$/.test(r) && (s = Math.max(s, Number(r)));
     for (let r = 0; r <= s; r++)
-      at(n[r], t, e);
+      ct(n[r], t, e);
   }
   return t;
 }
@@ -547,30 +572,30 @@ function at(n, t = [], e = !1) {
  * limitations under the License.
  * =============================================================================
  */
-class tn {
+class sn {
   constructor(t, e) {
-    this.backendTimer = t, this.logger = e, e == null && (this.logger = new nn());
+    this.backendTimer = t, this.logger = e, e == null && (this.logger = new an());
   }
   profileKernel(t, e, s) {
     let r;
-    const i = () => {
+    const a = () => {
       r = s();
     };
     let o;
-    const a = ft();
+    const i = dt();
     if (this.backendTimer.timerAvailable())
-      o = this.backendTimer.time(i);
+      o = this.backendTimer.time(a);
     else {
-      i();
+      a();
       for (const l of r)
         l.dataSync();
-      o = Promise.resolve({ kernelMs: ft() - a });
+      o = Promise.resolve({ kernelMs: dt() - i });
     }
-    if (S().getBool("CHECK_COMPUTATION_FOR_ERRORS"))
+    if (k().getBool("CHECK_COMPUTATION_FOR_ERRORS"))
       for (let l = 0; l < r.length; l++) {
         const u = r[l];
         u.data().then((h) => {
-          en(h, u.dtype, t);
+          rn(h, u.dtype, t);
         });
       }
     return {
@@ -582,15 +607,15 @@ class tn {
     };
   }
   logKernelProfile(t) {
-    const { kernelName: e, outputs: s, timeMs: r, inputs: i, extraInfo: o } = t;
-    s.forEach((a) => {
-      Promise.all([a.data(), r, o]).then((c) => {
-        this.logger.logKernelProfile(e, a, c[0], c[1], i, c[2]);
+    const { kernelName: e, outputs: s, timeMs: r, inputs: a, extraInfo: o } = t;
+    s.forEach((i) => {
+      Promise.all([i.data(), r, o]).then((c) => {
+        this.logger.logKernelProfile(e, i, c[0], c[1], a, c[2]);
       });
     });
   }
 }
-function en(n, t, e) {
+function rn(n, t, e) {
   if (t !== "float32")
     return !1;
   for (let s = 0; s < n.length; s++) {
@@ -600,18 +625,18 @@ function en(n, t, e) {
   }
   return !1;
 }
-class nn {
-  logKernelProfile(t, e, s, r, i, o) {
-    const a = typeof r == "number" ? ct(`${r}ms`, 9) : r.error, c = ct(t, 25), l = e.rank, u = e.size, h = ct(e.shape.toString(), 14);
-    let f = "";
-    for (const m in i) {
-      const b = i[m];
-      if (b != null) {
-        const d = b.shape || e.shape, k = d.length;
-        f += `${m}: ${k}D ${k > 0 ? d : ""} `;
+class an {
+  logKernelProfile(t, e, s, r, a, o) {
+    const i = typeof r == "number" ? lt(`${r}ms`, 9) : r.error, c = lt(t, 25), l = e.rank, u = e.size, h = lt(e.shape.toString(), 14);
+    let d = "";
+    for (const m in a) {
+      const p = a[m];
+      if (p != null) {
+        const f = p.shape || e.shape, w = f.length;
+        d += `${m}: ${w}D ${w > 0 ? f : ""} `;
       }
     }
-    console.log(`%c${c}	%c${a}	%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");
   }
 }
 /**
@@ -630,69 +655,69 @@ class nn {
  * limitations under the License.
  * =============================================================================
  */
-function sn(n, t, e) {
+function on(n, t, e) {
   const s = {}, r = {};
   for (let c = 0; c < t.length; c++)
     s[t[c].id] = !0;
   for (let c = 0; c < n.length; c++) {
     const l = n[c], u = l.inputs;
     for (const h in u) {
-      const f = u[h];
+      const d = u[h];
       let m = !1;
-      for (let b = 0; b < t.length; b++)
-        if (s[f.id]) {
-          l.outputs.forEach((d) => s[d.id] = !0), m = !0, r[l.id] = !0;
+      for (let p = 0; p < t.length; p++)
+        if (s[d.id]) {
+          l.outputs.forEach((f) => s[f.id] = !0), m = !0, r[l.id] = !0;
           break;
         }
       if (m)
         break;
     }
   }
-  const i = {};
-  i[e.id] = !0;
+  const a = {};
+  a[e.id] = !0;
   const o = {};
   for (let c = n.length - 1; c >= 0; c--) {
     const l = n[c], u = l.inputs;
     for (let h = 0; h < l.outputs.length; h++)
-      if (i[l.outputs[h].id]) {
-        for (const f in u)
-          i[u[f].id] = !0, o[l.id] = !0;
+      if (a[l.outputs[h].id]) {
+        for (const d in u)
+          a[u[d].id] = !0, o[l.id] = !0;
         break;
       }
   }
-  const a = [];
+  const i = [];
   for (let c = 0; c < n.length; c++) {
     const l = n[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, a.push(h);
+      h.inputs = u, h.outputs = l.outputs, i.push(h);
     }
   }
-  return a;
+  return i;
 }
-function rn(n, t, e, s) {
+function cn(n, t, e, s) {
   for (let r = t.length - 1; r >= 0; r--) {
-    const i = t[r], o = [];
-    if (i.outputs.forEach((c) => {
+    const a = t[r], o = [];
+    if (a.outputs.forEach((c) => {
       const l = n[c.id];
       l != null ? o.push(l) : o.push(null);
-    }), i.gradient == null)
-      throw new Error(`Cannot compute gradient: gradient function not found for ${i.kernelName}.`);
-    const a = i.gradient(o);
-    for (const c in i.inputs) {
-      if (!(c in a))
-        throw new Error(`Cannot backprop through input ${c}. Available gradients found: ${Object.keys(a)}.`);
-      const l = e(() => a[c]());
+    }), a.gradient == null)
+      throw new Error(`Cannot compute gradient: gradient function not found for ${a.kernelName}.`);
+    const i = a.gradient(o);
+    for (const c in a.inputs) {
+      if (!(c in i))
+        throw new Error(`Cannot backprop through input ${c}. Available gradients found: ${Object.keys(i)}.`);
+      const l = e(() => i[c]());
       if (l.dtype !== "float32")
-        throw new Error(`Error in gradient for op ${i.kernelName}. The gradient of input ${c} must have 'float32' dtype, but has '${l.dtype}'`);
-      const u = i.inputs[c];
-      if (!Rt(l.shape, u.shape))
-        throw new Error(`Error in gradient for op ${i.kernelName}. The gradient of input '${c}' has shape '${l.shape}', which does not match the shape of the input '${u.shape}'`);
+        throw new Error(`Error in gradient for op ${a.kernelName}. The gradient of input ${c} must have 'float32' dtype, but has '${l.dtype}'`);
+      const u = a.inputs[c];
+      if (!Ft(l.shape, u.shape))
+        throw new Error(`Error in gradient for op ${a.kernelName}. The gradient of input '${c}' has shape '${l.shape}', which does not match the shape of the input '${u.shape}'`);
       if (n[u.id] == null)
         n[u.id] = l;
       else {
@@ -718,57 +743,57 @@ function rn(n, t, e, s) {
  * limitations under the License.
  * =============================================================================
  */
-const Kt = 20, rt = 3, yt = 7;
-function on(n, t, e, s) {
-  const r = Nt(t), i = an(n, t, e, r), o = t.length, a = ut(n, t, e, r, i), c = ["Tensor"];
-  return s && (c.push(`  dtype: ${e}`), c.push(`  rank: ${o}`), c.push(`  shape: [${t}]`), c.push("  values:")), c.push(a.map((l) => "    " + l).join(`
+const jt = 20, at = 3, yt = 7;
+function ln(n, t, e, s) {
+  const r = $t(t), a = un(n, t, e, r), o = t.length, i = ut(n, t, e, r, a), c = ["Tensor"];
+  return s && (c.push(`  dtype: ${e}`), c.push(`  rank: ${o}`), c.push(`  shape: [${t}]`), c.push("  values:")), c.push(i.map((l) => "    " + l).join(`
 `)), c.join(`
 `);
 }
-function an(n, t, e, s) {
-  const r = G(t), i = s[s.length - 1], o = new Array(i).fill(0), a = t.length, c = e === "complex64" ? ot(n) : n;
-  if (a > 1)
-    for (let l = 0; l < r / i; l++) {
-      const u = l * i;
-      for (let h = 0; h < i; h++)
-        o[h] = Math.max(o[h], it(c[u + h], 0, e).length);
+function un(n, t, e, s) {
+  const r = z(t), a = s[s.length - 1], o = new Array(a).fill(0), i = t.length, c = e === "complex64" ? it(n) : n;
+  if (i > 1)
+    for (let l = 0; l < r / a; l++) {
+      const u = l * a;
+      for (let h = 0; h < a; h++)
+        o[h] = Math.max(o[h], ot(c[u + h], 0, e).length);
     }
   return o;
 }
-function it(n, t, e) {
+function ot(n, t, e) {
   let s;
-  return Array.isArray(n) ? s = `${parseFloat(n[0].toFixed(yt))} + ${parseFloat(n[1].toFixed(yt))}j` : xt(n) ? s = `'${n}'` : e === "bool" ? s = le(n) : s = parseFloat(n.toFixed(yt)).toString(), ct(s, t);
+  return Array.isArray(n) ? s = `${parseFloat(n[0].toFixed(yt))} + ${parseFloat(n[1].toFixed(yt))}j` : Dt(n) ? s = `'${n}'` : e === "bool" ? s = le(n) : s = parseFloat(n.toFixed(yt)).toString(), lt(s, t);
 }
 function le(n) {
   return n === 0 ? "false" : "true";
 }
-function ut(n, t, e, s, r, i = !0) {
-  const o = e === "complex64" ? 2 : 1, a = t[0], c = t.length;
+function ut(n, t, e, s, r, a = !0) {
+  const o = e === "complex64" ? 2 : 1, i = t[0], c = t.length;
   if (c === 0) {
     if (e === "complex64") {
-      const d = ot(n);
-      return [it(d[0], 0, e)];
+      const f = it(n);
+      return [ot(f[0], 0, e)];
     }
     return e === "bool" ? [le(n[0])] : [n[0].toString()];
   }
   if (c === 1) {
-    if (a > Kt) {
-      const k = rt * o;
-      let T = Array.from(n.slice(0, k)), nt = Array.from(n.slice((a - rt) * o, a * o));
-      return e === "complex64" && (T = ot(T), nt = ot(nt)), [
-        "[" + T.map((H, J) => it(H, r[J], e)).join(", ") + ", ..., " + nt.map((H, J) => it(H, r[a - rt + J], e)).join(", ") + "]"
+    if (i > jt) {
+      const w = at * o;
+      let I = Array.from(n.slice(0, w)), O = Array.from(n.slice((i - at) * o, i * o));
+      return e === "complex64" && (I = it(I), O = it(O)), [
+        "[" + I.map((J, X) => ot(J, r[X], e)).join(", ") + ", ..., " + O.map((J, X) => ot(J, r[i - at + X], e)).join(", ") + "]"
       ];
     }
     return [
-      "[" + (e === "complex64" ? ot(n) : Array.from(n)).map((k, T) => it(k, r[T], e)).join(", ") + "]"
+      "[" + (e === "complex64" ? it(n) : Array.from(n)).map((w, I) => ot(w, r[I], e)).join(", ") + "]"
     ];
   }
-  const l = t.slice(1), u = s.slice(1), h = s[0] * o, f = [];
-  if (a > Kt) {
-    for (let d = 0; d < rt; d++) {
-      const k = d * h, T = k + h;
-      f.push(...ut(
-        n.slice(k, T),
+  const l = t.slice(1), u = s.slice(1), h = s[0] * o, d = [];
+  if (i > jt) {
+    for (let f = 0; f < at; f++) {
+      const w = f * h, I = w + h;
+      d.push(...ut(
+        n.slice(w, I),
         l,
         e,
         u,
@@ -777,44 +802,44 @@ function ut(n, t, e, s, r, i = !0) {
         /* isLast */
       ));
     }
-    f.push("...");
-    for (let d = a - rt; d < a; d++) {
-      const k = d * h, T = k + h;
-      f.push(...ut(
-        n.slice(k, T),
+    d.push("...");
+    for (let f = i - at; f < i; f++) {
+      const w = f * h, I = w + h;
+      d.push(...ut(
+        n.slice(w, I),
         l,
         e,
         u,
         r,
-        d === a - 1
+        f === i - 1
         /* isLast */
       ));
     }
   } else
-    for (let d = 0; d < a; d++) {
-      const k = d * h, T = k + h;
-      f.push(...ut(
-        n.slice(k, T),
+    for (let f = 0; f < i; f++) {
+      const w = f * h, I = w + h;
+      d.push(...ut(
+        n.slice(w, I),
         l,
         e,
         u,
         r,
-        d === a - 1
+        f === i - 1
         /* isLast */
       ));
     }
   const m = c === 2 ? "," : "";
-  f[0] = "[" + (a > 0 ? f[0] + m : "");
-  for (let d = 1; d < f.length - 1; d++)
-    f[d] = " " + f[d] + m;
-  let b = `,
+  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++)
-    b += `
+  for (let f = 2; f < c; f++)
+    p += `
 `;
-  return f[f.length - 1] = " " + f[f.length - 1] + "]" + (i ? "" : b), f;
+  return d[d.length - 1] = " " + d[d.length - 1] + "]" + (a ? "" : p), d;
 }
-function ot(n) {
+function it(n) {
   const t = [];
   for (let e = 0; e < n.length; e += 2)
     t.push([n[e], n[e + 1]]);
@@ -836,15 +861,15 @@ function ot(n) {
  * limitations under the License.
  * =============================================================================
  */
-class ln {
+class hn {
   constructor(t, e, s) {
-    if (this.dtype = e, this.shape = t.slice(), this.size = G(t), s != null) {
+    if (this.dtype = e, this.shape = t.slice(), this.size = z(t), s != null) {
       const r = s.length;
       y(r === this.size, () => `Length of values '${r}' does not match the size inferred by the shape '${this.size}'.`);
     }
     if (e === "complex64")
       throw new Error("complex64 dtype TensorBuffers are not supported. Please create a TensorBuffer for the real and imaginary parts separately and call tf.complex(real, imag).");
-    this.values = s || Me(e, this.size), this.strides = Nt(t);
+    this.values = s || Fe(e, this.size), this.strides = $t(t);
   }
   /**
    * Sets a value in the buffer at a given location.
@@ -871,8 +896,8 @@ class ln {
     let e = 0;
     for (const r of t) {
       if (r < 0 || r >= this.shape[e]) {
-        const i = `Requested out of range element at ${t}.   Buffer shape=${this.shape}`;
-        throw new Error(i);
+        const a = `Requested out of range element at ${t}.   Buffer shape=${this.shape}`;
+        throw new Error(a);
       }
       e++;
     }
@@ -910,19 +935,19 @@ class ln {
    * @doc {heading: 'Tensors', subheading: 'Creation'}
    */
   toTensor() {
-    return R().makeTensor(this.values, this.shape, this.dtype);
+    return F().makeTensor(this.values, this.shape, this.dtype);
   }
 }
-let R = null, X = null;
-function cn(n) {
-  R = n;
+let F = null, Y = null;
+function dn(n) {
+  F = n;
 }
-function un(n) {
-  X = n;
+function fn(n) {
+  Y = n;
 }
-class x {
+class D {
   constructor(t, e, s, r) {
-    this.kept = !1, this.isDisposedInternal = !1, this.shape = t.slice(), this.dtype = e || "float32", this.size = G(t), this.strides = Nt(t), this.dataId = s, this.id = r, this.rankType = this.rank < 5 ? this.rank.toString() : "higher";
+    this.kept = !1, this.isDisposedInternal = !1, this.shape = t.slice(), this.dtype = e || "float32", this.size = z(t), this.strides = $t(t), this.dataId = s, this.id = r, this.rankType = this.rank < 5 ? this.rank.toString() : "higher";
   }
   get rank() {
     return this.shape.length;
@@ -934,14 +959,14 @@ class x {
    */
   async buffer() {
     const t = await this.data();
-    return X.buffer(this.shape, this.dtype, t);
+    return Y.buffer(this.shape, this.dtype, t);
   }
   /**
    * Returns a `tf.TensorBuffer` that holds the underlying data.
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   bufferSync() {
-    return X.buffer(this.shape, this.dtype, this.dataSync());
+    return Y.buffer(this.shape, this.dtype, this.dataSync());
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -951,7 +976,7 @@ class x {
    */
   async array() {
     const t = await this.data();
-    return Lt(this.shape, t, this.dtype === "complex64");
+    return _t(this.shape, t, this.dtype === "complex64");
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -960,7 +985,7 @@ class x {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   arraySync() {
-    return Lt(this.shape, this.dataSync(), this.dtype === "complex64");
+    return _t(this.shape, this.dataSync(), this.dtype === "complex64");
   }
   /**
    * Asynchronously downloads the values from the `tf.Tensor`. Returns a
@@ -970,11 +995,11 @@ class x {
    */
   async data() {
     this.throwIfDisposed();
-    const t = R().read(this.dataId);
+    const t = F().read(this.dataId);
     if (this.dtype === "string") {
       const e = await t;
       try {
-        return e.map((s) => jt(s));
+        return e.map((s) => Wt(s));
       } catch {
         throw new Error("Failed to decode the string bytes into utf-8. To get the original bytes, call tensor.bytes().");
       }
@@ -1016,7 +1041,7 @@ class x {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dataToGPU(t) {
-    return this.throwIfDisposed(), R().readToGPU(this.dataId, t);
+    return this.throwIfDisposed(), F().readToGPU(this.dataId, t);
   }
   /**
    * Synchronously downloads the values from the `tf.Tensor`. This blocks the
@@ -1026,10 +1051,10 @@ class x {
    */
   dataSync() {
     this.throwIfDisposed();
-    const t = R().readSync(this.dataId);
+    const t = F().readSync(this.dataId);
     if (this.dtype === "string")
       try {
-        return t.map((e) => jt(e));
+        return t.map((e) => Wt(e));
       } catch {
         throw new Error("Failed to decode the string bytes into utf-8. To get the original bytes, call tensor.bytes().");
       }
@@ -1038,7 +1063,7 @@ class x {
   /** Returns the underlying bytes of the tensor's data. */
   async bytes() {
     this.throwIfDisposed();
-    const t = await R().read(this.dataId);
+    const t = await F().read(this.dataId);
     return this.dtype === "string" ? t : new Uint8Array(t.buffer);
   }
   /**
@@ -1047,7 +1072,7 @@ class x {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dispose() {
-    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), R().disposeTensor(this), this.isDisposedInternal = !0);
+    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), F().disposeTensor(this), this.isDisposedInternal = !0);
   }
   get isDisposed() {
     return this.isDisposedInternal;
@@ -1065,14 +1090,14 @@ class x {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   print(t = !1) {
-    return X.print(this, t);
+    return Y.print(this, t);
   }
   /**
    * Returns a copy of the tensor. See `tf.clone` for details.
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   clone() {
-    return this.throwIfDisposed(), X.clone(this);
+    return this.throwIfDisposed(), Y.clone(this);
   }
   /**
    * Returns a human-readable description of the tensor. Useful for logging.
@@ -1081,23 +1106,23 @@ class x {
    */
   toString(t = !1) {
     const e = this.dataSync();
-    return on(e, this.shape, this.dtype, t);
+    return ln(e, this.shape, this.dtype, t);
   }
   cast(t) {
-    return this.throwIfDisposed(), X.cast(this, t);
+    return this.throwIfDisposed(), Y.cast(this, t);
   }
   variable(t = !0, e, s) {
-    return this.throwIfDisposed(), R().makeVariable(this, t, e, s);
+    return this.throwIfDisposed(), F().makeVariable(this, t, e, s);
   }
 }
-Object.defineProperty(x, Symbol.hasInstance, {
+Object.defineProperty(D, Symbol.hasInstance, {
   value: (n) => !!n && n.data != null && n.dataSync != null && n.throwIfDisposed != null
 });
-function ce() {
-  return _t("Tensor", () => x);
+function ue() {
+  return Pt("Tensor", () => D);
 }
-ce();
-class dt extends x {
+ue();
+class ft extends D {
   constructor(t, e, s, r) {
     super(t.shape, t.dtype, t.dataId, r), this.trainable = e, this.name = s;
   }
@@ -1112,20 +1137,20 @@ class dt extends x {
   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 (!Ft(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(
+    F().disposeTensor(this), this.dataId = t.dataId, F().incRef(
       this,
       null
       /* backend */
     );
   }
   dispose() {
-    R().disposeVariable(this), this.isDisposedInternal = !0;
+    F().disposeVariable(this), this.isDisposedInternal = !0;
   }
 }
-Object.defineProperty(dt, Symbol.hasInstance, {
-  value: (n) => n instanceof x && n.assign != null && n.assign instanceof Function
+Object.defineProperty(ft, Symbol.hasInstance, {
+  value: (n) => n instanceof D && n.assign != null && n.assign instanceof Function
 });
 /**
  * @license
@@ -1143,10 +1168,10 @@ Object.defineProperty(dt, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-var Vt;
+var Kt;
 (function(n) {
   n.R0 = "R0", n.R1 = "R1", n.R2 = "R2", n.R3 = "R3", n.R4 = "R4", n.R5 = "R5", n.R6 = "R6";
-})(Vt || (Vt = {}));
+})(Kt || (Kt = {}));
 var Tt;
 (function(n) {
   n.float32 = "float32", n.int32 = "int32", n.bool = "int32", n.complex64 = "complex64";
@@ -1163,24 +1188,24 @@ var Bt;
 (function(n) {
   n.float32 = "complex64", n.int32 = "complex64", n.bool = "complex64", n.complex64 = "complex64";
 })(Bt || (Bt = {}));
-const hn = {
+const gn = {
   float32: At,
   int32: Tt,
   bool: Et,
   complex64: Bt
 };
-function fn(n, t) {
+function mn(n, t) {
   if (n === "string" || t === "string") {
     if (n === "string" && t === "string")
       return "string";
     throw new Error(`Can not upcast ${n} with ${t}`);
   }
-  return hn[n][t];
+  return gn[n][t];
 }
-function ue(n) {
+function he(n) {
   return n != null && typeof n == "object" && "texture" in n && n.texture instanceof WebGLTexture;
 }
-function he(n) {
+function de(n) {
   return typeof GPUBuffer < "u" && n != null && typeof n == "object" && "buffer" in n && n.buffer instanceof GPUBuffer;
 }
 /**
@@ -1199,32 +1224,35 @@ function he(n) {
  * limitations under the License.
  * =============================================================================
  */
-function V(n, t) {
+function q(n, t) {
   if (n.dtype === t.dtype)
     return [n, t];
-  const e = fn(n.dtype, t.dtype);
+  const e = mn(n.dtype, t.dtype);
   return [n.cast(e), t.cast(e)];
 }
+function so(n, t) {
+  return t.some((e) => e.id === n.id);
+}
 function fe(n) {
   const t = [];
-  return de(n, t, /* @__PURE__ */ new Set()), t;
+  return ge(n, t, /* @__PURE__ */ new Set()), t;
 }
-function de(n, t, e) {
+function ge(n, t, e) {
   if (n == null)
     return;
-  if (n instanceof x) {
+  if (n instanceof D) {
     t.push(n);
     return;
   }
-  if (!dn(n))
+  if (!pn(n))
     return;
   const s = n;
   for (const r in s) {
-    const i = s[r];
-    e.has(i) || (e.add(i), de(i, t, e));
+    const a = s[r];
+    e.has(a) || (e.add(a), ge(a, t, e));
   }
 }
-function dn(n) {
+function pn(n) {
   return Array.isArray(n) || typeof n == "object";
 }
 /**
@@ -1264,7 +1292,7 @@ class qt {
       this.registeredVariables[t].dispose();
   }
 }
-class tt {
+class et {
   constructor(t) {
     this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new qt();
   }
@@ -1312,7 +1340,7 @@ class tt {
     return t in this.registryFactory ? this.registryFactory[t].factory : null;
   }
   registerBackend(t, e, s = 1) {
-    return t in this.registryFactory ? (O(`${t} backend was already registered. Reusing existing backend factory.`), !1) : (this.registryFactory[t] = { factory: e, priority: s }, !0);
+    return t in this.registryFactory ? (_(`${t} backend was already registered. Reusing existing backend factory.`), !1) : (this.registryFactory[t] = { factory: e, priority: s }, !0);
   }
   async setBackend(t) {
     if (this.registryFactory[t] == null)
@@ -1323,15 +1351,15 @@ class tt {
       if (!(s ? await e : e))
         return !1;
     }
-    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new tn(this.backendInstance), !0;
+    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new sn(this.backendInstance), !0;
   }
   setupRegisteredKernels() {
-    Wt(this.backendName).forEach((e) => {
+    Vt(this.backendName).forEach((e) => {
       e.setupFunc != null && e.setupFunc(this.backendInstance);
     });
   }
   disposeRegisteredKernels(t) {
-    Wt(t).forEach((s) => {
+    Vt(t).forEach((s) => {
       s.disposeFunc != null && s.disposeFunc(this.registry[t]);
     });
   }
@@ -1347,13 +1375,13 @@ class tt {
       throw new Error(`Cannot initialize backend ${t}, no registration found.`);
     try {
       const s = e.factory();
-      if (s && !(s instanceof Be) && typeof s.then == "function") {
-        const r = ++this.pendingBackendInitId, i = s.then((o) => r < this.pendingBackendInitId ? !1 : (this.registry[t] = o, this.pendingBackendInit = null, !0)).catch((o) => (r < this.pendingBackendInitId || (this.pendingBackendInit = null, O(`Initialization of backend ${t} failed`), O(o.stack || o.message)), !1));
-        return this.pendingBackendInit = i, { success: i, asyncInit: !0 };
+      if (s && !(s instanceof ve) && typeof s.then == "function") {
+        const r = ++this.pendingBackendInitId, a = s.then((o) => r < this.pendingBackendInitId ? !1 : (this.registry[t] = o, this.pendingBackendInit = null, !0)).catch((o) => (r < this.pendingBackendInitId || (this.pendingBackendInit = null, _(`Initialization of backend ${t} failed`), _(o.stack || o.message)), !1));
+        return this.pendingBackendInit = a, { success: a, asyncInit: !0 };
       } else
         return this.registry[t] = s, { success: !0, asyncInit: !1 };
     } catch (s) {
-      return O(`Initialization of backend ${t} failed`), O(s.stack || s.message), { success: !1, asyncInit: !1 };
+      return _(`Initialization of backend ${t} failed`), _(s.stack || s.message), { success: !1, asyncInit: !1 };
     }
   }
   removeBackend(t) {
@@ -1369,15 +1397,15 @@ class tt {
   initializeBackendsAndReturnBest() {
     const t = this.getSortedBackends();
     for (let e = 0; e < t.length; e++) {
-      const s = t[e], { success: r, asyncInit: i } = this.initializeBackend(s);
-      if (i || r)
-        return { name: s, asyncInit: i };
+      const s = t[e], { success: r, asyncInit: a } = this.initializeBackend(s);
+      if (a || r)
+        return { name: s, asyncInit: a };
     }
     throw new Error("Could not initialize any backends, all backend initializations failed.");
   }
   moveData(t, e) {
-    const s = this.state.tensorInfo.get(e), r = s.backend, i = this.readSync(e), o = r.refCount(e);
-    r.disposeData(e, !0), s.backend = t, t.move(e, i, s.shape, s.dtype, o), this.shouldCheckForMemLeaks() && this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1]++;
+    const s = this.state.tensorInfo.get(e), r = s.backend, a = this.readSync(e), o = r.refCount(e);
+    r.disposeData(e, !0), s.backend = t, t.move(e, a, s.shape, s.dtype, o), this.shouldCheckForMemLeaks() && this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1]++;
   }
   tidy(t, e) {
     let s = null;
@@ -1405,10 +1433,10 @@ class tt {
     }
   }
   nextTensorId() {
-    return tt.nextTensorId++;
+    return et.nextTensorId++;
   }
   nextVariableId() {
-    return tt.nextVariableId++;
+    return et.nextVariableId++;
   }
   /**
    * This method is called instead of the public-facing tensor.clone() when
@@ -1417,18 +1445,18 @@ class tt {
    * execution.
    */
   clone(t) {
-    const e = g.runKernel(re, { x: t }), s = { x: t }, r = (o) => ({
+    const e = g.runKernel(ae, { x: t }), s = { x: t }, r = (o) => ({
       x: () => {
-        const a = "float32", c = { x: o }, l = { dtype: a };
+        const i = "float32", c = { x: o }, l = { dtype: i };
         return g.runKernel(
-          se,
+          re,
           c,
           // tslint:disable-next-line: no-unnecessary-type-assertion
           l
         );
       }
-    }), i = [];
-    return this.addTapeNode(this.state.activeScope.name, s, [e], r, i, {}), e;
+    }), a = [];
+    return this.addTapeNode(this.state.activeScope.name, s, [e], r, a, {}), e;
   }
   /**
    * Execute a kernel with the given name and return the output tensor.
@@ -1453,13 +1481,13 @@ class tt {
   }
   checkKernelForMemLeak(t, e, s) {
     const r = this.backend.numDataIds();
-    let i = 0;
+    let a = 0;
     s.forEach((c) => {
-      i += c.dtype === "complex64" ? 3 : 1;
+      a += c.dtype === "complex64" ? 3 : 1;
     });
-    const o = this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1], a = r - e - i - o;
-    if (a > 0)
-      throw new Error(`Backend '${this.backendName}' has an internal memory leak (${a} data ids) after running '${t}'`);
+    const o = this.state.numDataMovesStack[this.state.numDataMovesStack.length - 1], i = r - e - a - o;
+    if (i > 0)
+      throw new Error(`Backend '${this.backendName}' has an internal memory leak (${i} data ids) after running '${t}'`);
   }
   /**
    * Internal helper method to execute a kernel Func
@@ -1468,56 +1496,56 @@ class tt {
    */
   runKernelFunc(t) {
     let e, s = [];
-    const r = this.isTapeOn(), i = this.state.numBytes, o = this.state.numTensors;
+    const r = this.isTapeOn(), a = this.state.numBytes, o = this.state.numTensors;
     this.shouldCheckForMemLeaks() && this.state.numDataMovesStack.push(0);
-    let a;
+    let i;
     this.backendName == null && this.backend;
     let c;
     const l = bt(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
     if (bt(t)) {
-      const { kernelName: b, inputs: d, attrs: k } = t;
+      const { kernelName: p, inputs: f, attrs: w } = t;
       this.backendName == null && this.backend;
-      const T = Gt(b, this.backendName);
-      y(T != null, () => `Cannot find registered kernel '${b}' for backend '${this.backendName}'`), a = () => {
-        const nt = this.backend.numDataIds();
-        c = T.kernelFunc({ inputs: d, attrs: k, backend: this.backend });
-        const H = Array.isArray(c) ? c : [c];
-        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(b, nt, H);
-        const J = H.map((st) => st.rank != null ? st : this.makeTensorFromTensorInfo(st));
+      const I = Gt(p, this.backendName);
+      y(I != null, () => `Cannot find registered kernel '${p}' for backend '${this.backendName}'`), i = () => {
+        const O = this.backend.numDataIds();
+        c = I.kernelFunc({ inputs: f, attrs: w, backend: this.backend });
+        const J = Array.isArray(c) ? c : [c];
+        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(p, O, J);
+        const X = J.map((rt) => rt.rank != null ? rt : this.makeTensorFromTensorInfo(rt));
         if (r) {
-          const st = this.getTensorsForGradient(b, d, J);
-          s = this.saveTensorsForBackwardMode(st);
+          const rt = this.getTensorsForGradient(p, f, X);
+          s = this.saveTensorsForBackwardMode(rt);
         }
-        return J;
+        return X;
       };
     } else {
-      const { forwardFunc: b } = t, d = (k) => {
-        r && (s = k.map((T) => this.keep(this.clone(T))));
+      const { forwardFunc: p } = t, f = (w) => {
+        r && (s = w.map((I) => this.keep(this.clone(I))));
       };
-      a = () => {
-        const k = this.backend.numDataIds();
-        c = this.tidy(() => b(this.backend, d));
-        const T = Array.isArray(c) ? c : [c];
-        return this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(l, k, T), T;
+      i = () => {
+        const w = this.backend.numDataIds();
+        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 = bt(t) ? null : t.backwardsFunc;
+    const { inputs: u, attrs: h } = t, d = bt(t) ? null : t.backwardsFunc;
     let m;
     return this.scopedRun(
       // Stop recording to a tape when running a kernel.
       () => this.state.kernelDepth++,
       () => this.state.kernelDepth--,
       () => {
-        !this.ENV.getBool("DEBUG") && !this.state.profiling ? e = a() : (m = this.profiler.profileKernel(l, u, () => a()), this.ENV.getBool("DEBUG") && this.profiler.logKernelProfile(m), e = m.outputs);
+        !this.ENV.getBool("DEBUG") && !this.state.profiling ? e = i() : (m = this.profiler.profileKernel(l, u, () => i()), this.ENV.getBool("DEBUG") && this.profiler.logKernelProfile(m), e = m.outputs);
       }
-    ), r && this.addTapeNode(l, u, e, f, s, h), this.state.profiling && this.state.activeProfile.kernels.push({
+    ), r && this.addTapeNode(l, u, e, d, s, h), this.state.profiling && this.state.activeProfile.kernels.push({
       name: l,
-      bytesAdded: this.state.numBytes - i,
+      bytesAdded: this.state.numBytes - a,
       totalBytesSnapshot: this.state.numBytes,
       tensorsAdded: this.state.numTensors - o,
       totalTensorsSnapshot: this.state.numTensors,
-      inputShapes: Object.keys(u).map((b) => u[b] != null ? u[b].shape : null),
-      outputShapes: e.map((b) => b.shape),
+      inputShapes: Object.keys(u).map((p) => u[p] != null ? u[p].shape : null),
+      outputShapes: e.map((p) => p.shape),
       kernelTimeMs: m.timeMs,
       extraInfo: m.extraInfo
     }), Array.isArray(c) ? e : e[0];
@@ -1540,11 +1568,11 @@ class tt {
   getTensorsForGradient(t, e, s) {
     const r = zt(t);
     if (r != null) {
-      const i = r.inputsToSave || [], o = r.outputsToSave || [];
-      let a;
-      r.saveAllInputs ? (y(Array.isArray(e), () => "saveAllInputs is true, expected inputs to be an array."), a = Object.keys(e).map((l) => e[l])) : a = i.map((l) => e[l]);
+      const a = r.inputsToSave || [], o = r.outputsToSave || [];
+      let i;
+      r.saveAllInputs ? (y(Array.isArray(e), () => "saveAllInputs is true, expected inputs to be an array."), i = Object.keys(e).map((l) => e[l])) : i = a.map((l) => e[l]);
       const c = s.filter((l, u) => o[u]);
-      return a.concat(c);
+      return i.concat(c);
     }
     return [];
   }
@@ -1557,14 +1585,14 @@ class tt {
     if (t == null)
       throw new Error("Values passed to engine.makeTensor() are null");
     s = s || "float32", r = r || this.backend;
-    let i = t;
-    s === "string" && xt(t[0]) && (i = t.map((c) => Ze(c)));
-    const o = r.write(i, e, s), a = new x(e, s, o, this.nextTensorId());
-    if (this.trackTensor(a, r), s === "string") {
-      const c = this.state.tensorInfo.get(o), l = Re(i);
+    let a = t;
+    s === "string" && Dt(t[0]) && (a = t.map((c) => nn(c)));
+    const o = r.write(a, e, s), i = new D(e, s, o, this.nextTensorId());
+    if (this.trackTensor(i, r), s === "string") {
+      const c = this.state.tensorInfo.get(o), l = xe(a);
       this.state.numBytes += l - c.bytes, c.bytes = l;
     }
-    return a;
+    return i;
   }
   /**
    * Internal method used by backends. Makes a new tensor
@@ -1574,8 +1602,8 @@ class tt {
    */
   makeTensorFromDataId(t, e, s, r) {
     s = s || "float32";
-    const i = { dataId: t, shape: e, dtype: s };
-    return this.makeTensorFromTensorInfo(i, r);
+    const a = { dataId: t, shape: e, dtype: s };
+    return this.makeTensorFromTensorInfo(a, r);
   }
   /**
    * Internal method used by backends. Makes a new tensor that is a wrapper
@@ -1583,15 +1611,15 @@ class tt {
    * only increments the ref count used in memory tracking.
    */
   makeTensorFromTensorInfo(t, e) {
-    const { dataId: s, shape: r, dtype: i } = t, o = new x(r, i, s, this.nextTensorId());
+    const { dataId: s, shape: r, dtype: a } = t, o = new D(r, a, s, this.nextTensorId());
     return this.trackTensor(o, e), o;
   }
   makeVariable(t, e = !0, s, r) {
     s = s || this.nextVariableId().toString(), r != null && r !== t.dtype && (t = t.cast(r));
-    const i = new dt(t, e, s, this.nextTensorId());
-    if (this.state.registeredVariables[i.name] != null)
-      throw new Error(`Variable with name ${i.name} was already registered`);
-    return this.state.registeredVariables[i.name] = i, this.incRef(i, this.backend), i;
+    const a = new ft(t, e, s, this.nextTensorId());
+    if (this.state.registeredVariables[a.name] != null)
+      throw new Error(`Variable with name ${a.name} was already registered`);
+    return this.state.registeredVariables[a.name] = a, this.incRef(a, this.backend), a;
   }
   trackTensor(t, e) {
     this.state.numTensors++, t.dtype === "string" && this.state.numStringTensors++;
@@ -1601,7 +1629,7 @@ class tt {
       dtype: t.dtype,
       shape: t.shape,
       bytes: s
-    })), t instanceof dt || this.track(t);
+    })), t instanceof ft || this.track(t);
   }
   // Track the tensor by dataId and increase the refCount for the dataId in the
   // backend.
@@ -1648,15 +1676,15 @@ class tt {
   isTapeOn() {
     return this.state.gradientDepth > 0 && this.state.kernelDepth === 0;
   }
-  addTapeNode(t, e, s, r, i, o) {
-    const a = { id: this.state.nextTapeNodeId++, kernelName: t, inputs: e, outputs: s, saved: i }, c = zt(t);
-    c != null && (r = c.gradFunc), r != null && (a.gradient = (l) => (l = l.map((u, h) => {
+  addTapeNode(t, e, s, r, a, o) {
+    const i = { id: this.state.nextTapeNodeId++, kernelName: t, inputs: e, outputs: s, saved: a }, c = zt(t);
+    c != null && (r = c.gradFunc), r != null && (i.gradient = (l) => (l = l.map((u, h) => {
       if (u == null) {
-        const f = s[h], m = Zt(f.size, f.dtype);
-        return this.makeTensor(m, f.shape, f.dtype);
+        const d = s[h], m = te(d.size, d.dtype);
+        return this.makeTensor(m, d.shape, d.dtype);
       }
       return u;
-    }), r(l.length > 1 ? l : l[0], i, o))), this.state.activeTape.push(a);
+    }), r(l.length > 1 ? l : l[0], a, o))), this.state.activeTape.push(i);
   }
   keep(t) {
     return t.kept = !0, t;
@@ -1684,14 +1712,14 @@ class tt {
    * as scope() without the need for a function closure.
    */
   endScope(t) {
-    const e = fe(t), s = new Set(e.map((i) => i.id));
-    for (let i = 0; i < this.state.activeScope.track.length; i++) {
-      const o = this.state.activeScope.track[i];
+    const e = fe(t), s = new Set(e.map((a) => a.id));
+    for (let a = 0; a < this.state.activeScope.track.length; a++) {
+      const o = this.state.activeScope.track[a];
       !o.kept && !s.has(o.id) && o.dispose();
     }
     const r = this.state.scopeStack.pop();
-    this.state.activeScope = this.state.scopeStack.length === 0 ? null : this.state.scopeStack[this.state.scopeStack.length - 1], e.forEach((i) => {
-      !i.kept && i.scopeId === r.id && this.track(i);
+    this.state.activeScope = this.state.scopeStack.length === 0 ? null : this.state.scopeStack[this.state.scopeStack.length - 1], e.forEach((a) => {
+      !a.kept && a.scopeId === r.id && this.track(a);
     });
   }
   /**
@@ -1703,46 +1731,46 @@ class tt {
   gradients(t, e, s, r = !1) {
     if (y(e.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 i = this.scopedRun(() => this.startTape(), () => this.endTape(), () => this.tidy("forward", t));
-    y(i instanceof x, () => "The result y returned by f() must be a tensor.");
-    const o = sn(this.state.activeTape, e, i);
+    const a = this.scopedRun(() => this.startTape(), () => this.endTape(), () => this.tidy("forward", t));
+    y(a instanceof D, () => "The result y returned by f() must be a tensor.");
+    const o = on(this.state.activeTape, e, a);
     if (!r && o.length === 0 && e.length > 0)
       throw new Error("Cannot compute gradient of y=f(x) with respect to x. Make sure that the f you passed encloses all operations that lead from x to y.");
     return this.tidy("backward", () => {
-      const a = {};
-      a[i.id] = s ?? gn(i.shape), rn(
-        a,
+      const i = {};
+      i[a.id] = s ?? yn(a.shape), cn(
+        i,
         o,
         // Pass the tidy function to avoid circular dep with `tape.ts`.
         (l) => this.tidy(l),
         // Pass an add function to avoide a circular dep with `tape.ts`.
-        mn
+        bn
       );
-      const c = e.map((l) => a[l.id]);
+      const c = e.map((l) => i[l.id]);
       return this.state.gradientDepth === 0 && (this.state.activeTape.forEach((l) => {
         for (const u of l.saved)
           u.dispose();
-      }), this.state.activeTape = null), { value: i, grads: c };
+      }), this.state.activeTape = null), { value: a, grads: c };
     });
   }
   customGrad(t) {
     return y(kt(t), () => "The f passed in customGrad(f) must be a function."), (...e) => {
-      y(e.every((a) => a instanceof x), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
+      y(e.every((i) => i instanceof D), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
       let s;
       const r = {};
-      e.forEach((a, c) => {
-        r[c] = a;
+      e.forEach((i, c) => {
+        r[c] = i;
       });
-      const i = (a, c) => (s = t(...e, c), y(s.value instanceof x, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), y(kt(s.gradFunc), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function."), s.value), o = (a, c) => {
-        const l = s.gradFunc(a, c), u = Array.isArray(l) ? l : [l];
-        y(u.length === e.length, () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns the same number of tensors as inputs passed to f(...)."), y(u.every((f) => f 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 a = (i, c) => (s = t(...e, c), y(s.value instanceof D, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), y(kt(s.gradFunc), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function."), s.value), o = (i, c) => {
+        const l = s.gradFunc(i, c), u = Array.isArray(l) ? l : [l];
+        y(u.length === e.length, () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns the same number of tensors as inputs passed to f(...)."), y(u.every((d) => d instanceof D), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns a list of only tensors.");
         const h = {};
-        return u.forEach((f, m) => {
-          h[m] = () => f;
+        return u.forEach((d, m) => {
+          h[m] = () => d;
         }), h;
       };
       return this.runKernelFunc({
-        forwardFunc: i,
+        forwardFunc: a,
         backwardsFunc: o,
         inputs: r
       });
@@ -1758,8 +1786,8 @@ class tt {
     return this.state.tensorInfo.get(t).backend.readToGPU(t, e);
   }
   async time(t) {
-    const e = ft(), s = await this.backend.time(t);
-    return s.wallMs = ft() - e, s;
+    const e = dt(), s = await this.backend.time(t);
+    return s.wallMs = dt() - e, s;
   }
   /**
    * Tracks a Tensor in the current scope to be automatically cleaned up
@@ -1784,24 +1812,24 @@ class tt {
     this.backendName = null, this.backendInstance = null, this.pendingBackendInit = null;
   }
 }
-tt.nextTensorId = 0;
-tt.nextVariableId = 0;
-function gn(n) {
-  const t = De(G(n), "float32");
+et.nextTensorId = 0;
+et.nextVariableId = 0;
+function yn(n) {
+  const t = Le(z(n), "float32");
   return g.makeTensor(t, n, "float32");
 }
-function ge() {
-  const n = ee();
+function me() {
+  const n = ne();
   if (n._tfengine == null) {
-    const t = new Ce(n);
-    n._tfengine = new tt(t);
+    const t = new Oe(n);
+    n._tfengine = new et(t);
   }
-  return Le(n._tfengine.ENV), cn(() => n._tfengine), n._tfengine;
+  return ze(n._tfengine.ENV), dn(() => n._tfengine), n._tfengine;
 }
-const g = ge();
-function mn(n, t) {
+const g = me();
+function bn(n, t) {
   const e = { a: n, b: t };
-  return g.runKernel(ne, e);
+  return g.runKernel(se, e);
 }
 /**
  * @license
@@ -1819,16 +1847,16 @@ function mn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function pn() {
+function wn() {
   return typeof window < "u" && window.document != null || //@ts-ignore
   typeof WorkerGlobalScope < "u";
 }
-const B = S();
+const B = k();
 B.registerFlag("DEBUG", () => !1, (n) => {
   n && console.warn("Debugging mode is ON. The output of every math call will be downloaded to CPU and checked for NaNs. This significantly impacts performance.");
 });
-B.registerFlag("IS_BROWSER", () => pn());
-B.registerFlag("IS_NODE", () => typeof Q < "u" && typeof Q.versions < "u" && typeof Q.versions.node < "u");
+B.registerFlag("IS_BROWSER", () => wn());
+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);
@@ -1855,31 +1883,31 @@ B.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
  * limitations under the License.
  * =============================================================================
  */
-function yn(n, t) {
+function Sn(n, t) {
   let e = n;
-  if ($(n))
+  if (R(n))
     return t === "string" ? [] : [n.length];
-  if (ue(n)) {
+  if (he(n)) {
     const r = n.channels || "RGBA";
     return [n.height, n.width * r.length];
-  } else if (he(n))
+  } else if (de(n))
     return [n.buffer.size / (t == null ? 4 : St(t))];
   if (!Array.isArray(n))
     return [];
   const s = [];
-  for (; Array.isArray(e) || $(e) && t !== "string"; )
+  for (; Array.isArray(e) || R(e) && t !== "string"; )
     s.push(e.length), e = e[0];
-  return Array.isArray(n) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && me(n, s, []), s;
+  return Array.isArray(n) && k().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && pe(n, s, []), s;
 }
-function me(n, t, e) {
-  if (e = e || [], !Array.isArray(n) && !$(n)) {
+function pe(n, t, e) {
+  if (e = e || [], !Array.isArray(n) && !R(n)) {
     y(t.length === 0, () => `Element arr[${e.join("][")}] is a primitive, but should be an array/TypedArray of ${t[0]} elements`);
     return;
   }
   y(t.length > 0, () => `Element arr[${e.join("][")}] should be a primitive, but is an array of ${n.length} elements`), y(n.length === t[0], () => `Element arr[${e.join("][")}] should have ${t[0]} elements, but has ${n.length} elements`);
   const s = t.slice(1);
   for (let r = 0; r < n.length; ++r)
-    me(n[r], s, e.concat(r));
+    pe(n[r], s, e.concat(r));
 }
 function Ht(n, t, e, s) {
   if (n !== "string_or_numeric") {
@@ -1889,23 +1917,23 @@ function Ht(n, t, e, s) {
       throw new Error(`Argument '${e}' passed to '${s}' must be ${n} tensor, but got ${t} tensor`);
   }
 }
-function I(n, t, e, s = "numeric") {
-  if (n instanceof ce())
+function T(n, t, e, s = "numeric") {
+  if (n instanceof ue())
     return Ht(s, n.dtype, t, e), n;
   let r = mt(n);
-  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Ht(s, r, t, e), n == null || !$(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string") {
+  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Ht(s, r, t, e), n == null || !R(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string") {
     const c = n == null ? "null" : n.constructor.name;
     throw new Error(`Argument '${t}' passed to '${e}' must be a Tensor or TensorLike, but got '${c}'`);
   }
-  const i = yn(n, r);
-  !$(n) && !Array.isArray(n) && (n = [n]);
-  const a = r !== "string" ? ae(n, r) : at(n, [], !0);
-  return g.makeTensor(a, i, r);
+  const a = Sn(n, r);
+  !R(n) && !Array.isArray(n) && (n = [n]);
+  const i = r !== "string" ? ce(n, r) : ct(n, [], !0);
+  return g.makeTensor(i, a, r);
 }
-function Zs(n, t, e, s = "numeric") {
+function ro(n, t, e, s = "numeric") {
   if (!Array.isArray(n))
     throw new Error(`Argument ${t} passed to ${e} must be a \`Tensor[]\` or \`TensorLike[]\``);
-  return n.map((i, o) => I(i, `${t}[${o}]`, e, s));
+  return n.map((a, o) => T(a, `${t}[${o}]`, e, s));
 }
 /**
  * @license
@@ -1923,18 +1951,18 @@ function Zs(n, t, e, s = "numeric") {
  * limitations under the License.
  * =============================================================================
  */
-const bn = "__op";
-function F(n) {
+const kn = "__op";
+function N(n) {
   const t = Object.keys(n);
   if (t.length !== 1)
     throw new Error(`Please provide an object with a single key (operation name) mapping to a function. Got an object with ${t.length} keys.`);
   let e = t[0];
   const s = n[e];
-  e.endsWith("_") && (e = e.substring(0, e.length - 1)), e = e + bn;
-  const r = (...i) => {
+  e.endsWith("_") && (e = e.substring(0, e.length - 1)), e = e + kn;
+  const r = (...a) => {
     g.startScope(e);
     try {
-      const o = s(...i);
+      const o = s(...a);
       return Ct(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
     } catch (o) {
       throw g.endScope(null), o;
@@ -1958,30 +1986,30 @@ function F(n) {
  * limitations under the License.
  * =============================================================================
  */
-function wn(n, t, e, s) {
+function In(n, t, e, s) {
   if (s == null)
     s = mt(n);
   else if (s === "complex64")
     throw new Error("Cannot construct a complex64 tensor directly. Please use tf.complex(real, imag).");
-  if (he(n) || ue(n)) {
+  if (de(n) || he(n)) {
     if (s !== "float32" && s !== "int32")
       throw new Error(`Creating tensor from GPU data only supports 'float32'|'int32' dtype, while the dtype is ${s}.`);
     return g.backend.createTensorFromGPUData(n, t || e, s);
   }
-  if (!$(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string")
+  if (!R(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "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) {
-    Dt(t);
-    const r = G(t), i = G(e);
-    y(r === i, () => `Based on the provided shape, [${t}], the tensor should have ${r} values but has ${i}`);
+    xt(t);
+    const r = z(t), a = z(e);
+    y(r === a, () => `Based on the provided shape, [${t}], the tensor should have ${r} values but has ${a}`);
     for (let o = 0; o < e.length; ++o) {
-      const a = e[o], c = o === e.length - 1 ? a !== G(t.slice(o)) : !0;
+      const i = e[o], c = o === e.length - 1 ? i !== z(t.slice(o)) : !0;
       y(e[o] === t[o] || !c, () => `Error creating a new Tensor. Inferred shape (${e}) does not match the provided shape (${t}). `);
     }
   }
-  return !$(n) && !Array.isArray(n) && (n = [n]), t = t || e, n = s !== "string" ? ae(n, s) : at(n, [], !0), g.makeTensor(n, t, s);
+  return !R(n) && !Array.isArray(n) && (n = [n]), t = t || e, n = s !== "string" ? ce(n, s) : ct(n, [], !0), g.makeTensor(n, t, s);
 }
-class lt {
+class st {
   /**
    * Concatenate a number of ArrayBuffers into one.
    *
@@ -1990,18 +2018,18 @@ class lt {
    * @returns Result of concatenating `buffers` in order.
    */
   static join(t) {
-    return new lt(t).slice();
+    return new st(t).slice();
   }
   constructor(t) {
-    if (this.shards = [], this.previousShardIndex = 0, t == null || (t instanceof Array || (t = [t]), t = t.map((s) => $(s) ? s.buffer : s), t.length === 0))
+    if (this.shards = [], this.previousShardIndex = 0, t == null || (t instanceof Array || (t = [t]), t = t.map((s) => R(s) ? s.buffer : s), t.length === 0))
       return;
     this.bufferUniformSize = t[0].byteLength;
     let e = 0;
     for (let s = 0; s < t.length; s++) {
       const r = t[s];
       s !== t.length - 1 && r.byteLength !== this.bufferUniformSize && (this.bufferUniformSize = void 0);
-      const i = e + r.byteLength;
-      this.shards.push({ buffer: r, start: e, end: i }), e = i;
+      const a = e + r.byteLength;
+      this.shards.push({ buffer: r, start: e, end: a }), e = a;
     }
     this.shards.length === 0 && (this.byteLength = 0), this.byteLength = this.shards[this.shards.length - 1].end;
   }
@@ -2013,14 +2041,14 @@ class lt {
     const s = this.findShardForByte(t);
     if (s === -1)
       throw new Error(`Could not find start shard for byte ${t}`);
-    const r = e - t, i = new ArrayBuffer(r), o = new Uint8Array(i);
-    let a = 0;
+    const r = e - 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 + a - l.start, f = a, b = Math.min(e, l.end) - l.start, d = new Uint8Array(l.buffer, h, b - h);
-      if (o.set(d, f), a += d.length, e < l.end)
+      const l = this.shards[c], h = t + i - l.start, d = i, p = Math.min(e, l.end) - l.start, f = new Uint8Array(l.buffer, h, p - h);
+      if (o.set(f, d), i += f.length, e < l.end)
         break;
     }
-    return i;
+    return a;
   }
   /**
    * Get the index of the shard that contains the byte at `byteIndex`.
@@ -2035,17 +2063,17 @@ class lt {
     }
     if (e(this.shards[this.previousShardIndex]) === 0)
       return this.previousShardIndex;
-    const s = Sn(this.shards, e);
+    const s = Tn(this.shards, e);
     return s === -1 ? -1 : (this.previousShardIndex = s, this.previousShardIndex);
   }
 }
-function Sn(n, t) {
+function Tn(n, t) {
   let e = 0, s = n.length;
   for (; e <= s; ) {
-    const r = Math.floor((s - e) / 2) + e, i = t(n[r]);
-    if (i === 0)
+    const r = Math.floor((s - e) / 2) + e, a = t(n[r]);
+    if (a === 0)
       return r;
-    i < 0 ? s = r : e = r + 1;
+    a < 0 ? s = r : e = r + 1;
   }
   return -1;
 }
@@ -2065,10 +2093,13 @@ function Sn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function tr() {
+function ao() {
+  g.disposeVariables();
+}
+function oo() {
   return g;
 }
-function er() {
+function io() {
   return g.memory();
 }
 function E(n, t) {
@@ -2077,15 +2108,59 @@ function E(n, t) {
 function M(n) {
   fe(n).forEach((e) => e.dispose());
 }
-function kn(n) {
+function En(n) {
   return g.keep(n);
 }
-const Pt = typeof gt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
-function Jt(n) {
-  return Pt ? gt.byteLength(n, "utf8") : new Blob([n]).size;
+function co() {
+  return g.backend;
+}
+const Jt = 4;
+async function lo(n, t) {
+  const e = [], s = [], r = Array.isArray(n) ? n.map((o) => o.name) : Object.keys(n);
+  for (let o = 0; o < r.length; ++o) {
+    const i = r[o], c = Array.isArray(n) ? n[o].tensor : n[i];
+    if (c.dtype !== "float32" && c.dtype !== "int32" && c.dtype !== "bool" && c.dtype !== "string" && c.dtype !== "complex64")
+      throw new Error(`Unsupported dtype in weight '${i}': ${c.dtype}`);
+    const l = { name: i, shape: c.shape, dtype: c.dtype };
+    if (c.dtype === "string") {
+      const u = new Promise(async (h) => {
+        const d = await c.bytes(), m = d.reduce((w, I) => w + I.length, 0) + Jt * d.length, p = new Uint8Array(m);
+        let f = 0;
+        for (let w = 0; w < d.length; w++) {
+          const I = d[w], O = new Uint8Array(new Uint32Array([I.length]).buffer);
+          p.set(O, f), f += Jt, p.set(I, f), f += I.length;
+        }
+        h(p);
+      });
+      s.push(u);
+    } else
+      s.push(c.data());
+    t != null && (l.group = t), e.push(l);
+  }
+  const a = await Promise.all(s);
+  return { data: An(a), specs: e };
 }
-function In(n) {
-  if (Pt)
+function An(n) {
+  if (n === null)
+    throw new Error(`Invalid input value: ${JSON.stringify(n)}`);
+  let t = 0;
+  const e = [];
+  n.forEach((a) => {
+    if (t += a.byteLength, e.push(a.byteLength === a.buffer.byteLength ? a : new a.constructor(a)), !(a instanceof Float32Array || a instanceof Int32Array || a instanceof Uint8Array))
+      throw new Error(`Unsupported TypedArray subtype: ${a.constructor.name}`);
+  });
+  const s = new Uint8Array(t);
+  let r = 0;
+  return e.forEach((a) => {
+    s.set(new Uint8Array(a.buffer), r), r += a.byteLength;
+  }), s.buffer;
+}
+const Lt = typeof gt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
+function Xt(n) {
+  return Lt ? gt.byteLength(n, "utf8") : new Blob([n]).size;
+}
+function Bn(n) {
+  if (Lt)
     return gt.from(n).toString("base64");
   const t = new Uint8Array(n);
   let e = "";
@@ -2093,8 +2168,8 @@ function In(n) {
     e += String.fromCharCode(t[s]);
   return btoa(e);
 }
-function Tn(n) {
-  if (Pt) {
+function vn(n) {
+  if (Lt) {
     const s = gt.from(n, "base64");
     return s.buffer.slice(s.byteOffset, s.byteOffset + s.byteLength);
   }
@@ -2103,15 +2178,18 @@ function Tn(n) {
     e.set([t.charCodeAt(s)], s);
   return e.buffer;
 }
-function pe(n) {
+function uo(n) {
+  return st.join(n);
+}
+function ye(n) {
   if (n.modelTopology instanceof ArrayBuffer)
     throw new Error("Expected JSON model topology, received ArrayBuffer.");
   return {
     dateSaved: /* @__PURE__ */ new Date(),
     modelTopologyType: "JSON",
-    modelTopologyBytes: n.modelTopology == null ? 0 : Jt(JSON.stringify(n.modelTopology)),
-    weightSpecsBytes: n.weightSpecs == null ? 0 : Jt(JSON.stringify(n.weightSpecs)),
-    weightDataBytes: n.weightData == null ? 0 : new lt(n.weightData).byteLength
+    modelTopologyBytes: n.modelTopology == null ? 0 : Xt(JSON.stringify(n.modelTopology)),
+    weightSpecsBytes: n.weightSpecs == null ? 0 : Xt(JSON.stringify(n.weightSpecs)),
+    weightDataBytes: n.weightData == null ? 0 : new st(n.weightData).byteLength
   };
 }
 /**
@@ -2180,11 +2258,12 @@ class A {
   static getHandlers(t, e, s) {
     const r = [];
     return (e === "load" ? A.getInstance().loadRouters : A.getInstance().saveRouters).forEach((o) => {
-      const a = o(t, s);
-      a !== null && r.push(a);
+      const i = o(t, s);
+      i !== null && r.push(i);
     }), r;
   }
 }
+const ho = (n) => A.getSaveHandlers(n);
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2201,22 +2280,22 @@ class A {
  * limitations under the License.
  * =============================================================================
  */
-const vt = "tensorflowjs", Mt = 1, U = "models_store", P = "model_info_store";
-function ye() {
-  if (!S().getBool("IS_BROWSER"))
+const vt = "tensorflowjs", Mt = 1, G = "models_store", L = "model_info_store";
+function be() {
+  if (!k().getBool("IS_BROWSER"))
     throw new Error("Failed to obtain IndexedDB factory because the current environmentis not a web browser.");
   const n = typeof window > "u" ? self : window, t = n.indexedDB || n.mozIndexedDB || n.webkitIndexedDB || n.msIndexedDB || n.shimIndexedDB;
   if (t == null)
     throw new Error("The current browser does not appear to support IndexedDB.");
   return t;
 }
-function Ft(n) {
+function Nt(n) {
   const t = n.result;
-  t.createObjectStore(U, { keyPath: "modelPath" }), t.createObjectStore(P, { keyPath: "modelPath" });
+  t.createObjectStore(G, { keyPath: "modelPath" }), t.createObjectStore(L, { keyPath: "modelPath" });
 }
 class W {
   constructor(t) {
-    if (this.indexedDB = ye(), t == null || !t)
+    if (this.indexedDB = be(), t == null || !t)
       throw new Error("For IndexedDB, modelPath must not be null, undefined or empty.");
     this.modelPath = t;
   }
@@ -2244,101 +2323,101 @@ class W {
    */
   databaseAction(t, e) {
     return new Promise((s, r) => {
-      const i = this.indexedDB.open(vt, Mt);
-      i.onupgradeneeded = () => Ft(i), i.onsuccess = () => {
-        const o = i.result;
+      const a = this.indexedDB.open(vt, Mt);
+      a.onupgradeneeded = () => Nt(a), a.onsuccess = () => {
+        const o = a.result;
         if (e == null) {
-          const a = o.transaction(U, "readonly"), l = a.objectStore(U).get(this.modelPath);
+          const i = o.transaction(G, "readonly"), l = i.objectStore(G).get(this.modelPath);
           l.onsuccess = () => {
             if (l.result == null)
               return o.close(), r(new Error(`Cannot find model with path '${this.modelPath}' in IndexedDB.`));
             s(l.result.modelArtifacts);
-          }, l.onerror = (u) => (o.close(), r(l.error)), a.oncomplete = () => o.close();
+          }, l.onerror = (u) => (o.close(), r(l.error)), i.oncomplete = () => o.close();
         } else {
-          e.weightData = lt.join(e.weightData);
-          const a = pe(e), c = o.transaction(P, "readwrite");
-          let l = c.objectStore(P), u;
+          e.weightData = st.join(e.weightData);
+          const i = ye(e), c = o.transaction(L, "readwrite");
+          let l = c.objectStore(L), u;
           try {
-            u = l.put({ modelPath: this.modelPath, modelArtifactsInfo: a });
-          } catch (f) {
-            return r(f);
+            u = l.put({ modelPath: this.modelPath, modelArtifactsInfo: i });
+          } catch (d) {
+            return r(d);
           }
           let h;
           u.onsuccess = () => {
-            h = o.transaction(U, "readwrite");
-            const f = h.objectStore(U);
+            h = o.transaction(G, "readwrite");
+            const d = h.objectStore(G);
             let m;
             try {
-              m = f.put({
+              m = d.put({
                 modelPath: this.modelPath,
                 modelArtifacts: e,
-                modelArtifactsInfo: a
+                modelArtifactsInfo: i
               });
-            } catch (b) {
-              return r(b);
+            } catch (p) {
+              return r(p);
             }
-            m.onsuccess = () => s({ modelArtifactsInfo: a }), m.onerror = (b) => {
-              l = c.objectStore(P);
-              const d = l.delete(this.modelPath);
-              d.onsuccess = () => (o.close(), r(m.error)), d.onerror = (k) => (o.close(), r(m.error));
+            m.onsuccess = () => s({ modelArtifactsInfo: i }), m.onerror = (p) => {
+              l = c.objectStore(L);
+              const f = l.delete(this.modelPath);
+              f.onsuccess = () => (o.close(), r(m.error)), f.onerror = (w) => (o.close(), r(m.error));
             };
-          }, 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();
           };
         }
-      }, i.onerror = (o) => r(i.error);
+      }, a.onerror = (o) => r(a.error);
     });
   }
 }
 W.URL_SCHEME = "indexeddb://";
-const be = (n) => S().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(W.URL_SCHEME) ? En(n.slice(W.URL_SCHEME.length)) : null;
-A.registerSaveRouter(be);
-A.registerLoadRouter(be);
-function En(n) {
+const we = (n) => k().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(W.URL_SCHEME) ? Mn(n.slice(W.URL_SCHEME.length)) : null;
+A.registerSaveRouter(we);
+A.registerLoadRouter(we);
+function Mn(n) {
   return new W(n);
 }
-function An(n) {
+function Nn(n) {
   return n.startsWith(W.URL_SCHEME) ? n.slice(W.URL_SCHEME.length) : n;
 }
-class Bn {
+class Rn {
   constructor() {
-    this.indexedDB = ye();
+    this.indexedDB = be();
   }
   async listModels() {
     return new Promise((t, e) => {
       const s = this.indexedDB.open(vt, Mt);
-      s.onupgradeneeded = () => Ft(s), s.onsuccess = () => {
-        const r = s.result, i = r.transaction(P, "readonly"), a = i.objectStore(P).getAll();
-        a.onsuccess = () => {
+      s.onupgradeneeded = () => Nt(s), s.onsuccess = () => {
+        const r = s.result, a = r.transaction(L, "readonly"), i = a.objectStore(L).getAll();
+        i.onsuccess = () => {
           const c = {};
-          for (const l of a.result)
+          for (const l of i.result)
             c[l.modelPath] = l.modelArtifactsInfo;
           t(c);
-        }, a.onerror = (c) => (r.close(), e(a.error)), i.oncomplete = () => r.close();
+        }, i.onerror = (c) => (r.close(), e(i.error)), a.oncomplete = () => r.close();
       }, s.onerror = (r) => e(s.error);
     });
   }
   async removeModel(t) {
-    return t = An(t), new Promise((e, s) => {
+    return t = Nn(t), new Promise((e, s) => {
       const r = this.indexedDB.open(vt, Mt);
-      r.onupgradeneeded = () => Ft(r), r.onsuccess = () => {
-        const i = r.result, o = i.transaction(P, "readwrite"), a = o.objectStore(P), c = a.get(t);
+      r.onupgradeneeded = () => Nt(r), r.onsuccess = () => {
+        const a = r.result, o = a.transaction(L, "readwrite"), i = o.objectStore(L), c = i.get(t);
         let l;
         c.onsuccess = () => {
           if (c.result == null)
-            return i.close(), s(new Error(`Cannot find model with path '${t}' in IndexedDB.`));
+            return a.close(), s(new Error(`Cannot find model with path '${t}' in IndexedDB.`));
           {
-            const u = a.delete(t), h = () => {
-              l = i.transaction(U, "readwrite");
-              const m = l.objectStore(U).delete(t);
-              m.onsuccess = () => e(c.result.modelArtifactsInfo), m.onerror = (b) => s(c.error);
+            const u = i.delete(t), h = () => {
+              l = a.transaction(G, "readwrite");
+              const m = l.objectStore(G).delete(t);
+              m.onsuccess = () => e(c.result.modelArtifactsInfo), m.onerror = (p) => s(c.error);
             };
-            u.onsuccess = h, u.onerror = (f) => (h(), i.close(), s(c.error));
+            u.onsuccess = h, u.onerror = (d) => (h(), a.close(), s(c.error));
           }
-        }, c.onerror = (u) => (i.close(), s(c.error)), o.oncomplete = () => {
-          l == null ? i.close() : l.oncomplete = () => i.close();
+        }, c.onerror = (u) => (a.close(), s(c.error)), o.oncomplete = () => {
+          l == null ? a.close() : l.oncomplete = () => a.close();
         };
-      }, r.onerror = (i) => s(r.error);
+      }, r.onerror = (a) => s(r.error);
     });
   }
 }
@@ -2358,36 +2437,36 @@ class Bn {
  * limitations under the License.
  * =============================================================================
  */
-const _ = "/", Y = "tensorflowjs_models", we = "info", vn = "model_topology", Mn = "weight_specs", Fn = "weight_data", $n = "model_metadata";
-function Se(n) {
+const P = "/", Q = "tensorflowjs_models", Se = "info", Fn = "model_topology", Dn = "weight_specs", $n = "weight_data", xn = "model_metadata";
+function ke(n) {
   return {
-    info: [Y, n, we].join(_),
-    topology: [Y, n, vn].join(_),
-    weightSpecs: [Y, n, Mn].join(_),
-    weightData: [Y, n, Fn].join(_),
-    modelMetadata: [Y, n, $n].join(_)
+    info: [Q, n, Se].join(P),
+    topology: [Q, n, Fn].join(P),
+    weightSpecs: [Q, n, Dn].join(P),
+    weightData: [Q, n, $n].join(P),
+    modelMetadata: [Q, n, xn].join(P)
   };
 }
-function ke(n) {
+function Ie(n) {
   for (const t of Object.values(n))
     window.localStorage.removeItem(t);
 }
-function Rn(n) {
-  const t = n.split(_);
+function Cn(n) {
+  const t = n.split(P);
   if (t.length < 3)
     throw new Error(`Invalid key format: ${n}`);
-  return t.slice(1, t.length - 1).join(_);
+  return t.slice(1, t.length - 1).join(P);
 }
-function xn(n) {
+function Pn(n) {
   return n.startsWith(j.URL_SCHEME) ? n.slice(j.URL_SCHEME.length) : n;
 }
 class j {
   constructor(t) {
-    if (!S().getBool("IS_BROWSER") || typeof window > "u" || typeof window.localStorage > "u")
+    if (!k().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.");
-    this.modelPath = t, this.keys = Se(this.modelPath);
+    this.modelPath = t, this.keys = ke(this.modelPath);
   }
   /**
    * Save model artifacts to browser local storage.
@@ -2402,9 +2481,9 @@ class j {
     if (t.modelTopology instanceof ArrayBuffer)
       throw new Error("BrowserLocalStorage.save() does not support saving model topology in binary formats yet.");
     {
-      const e = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = pe(t), i = lt.join(t.weightData);
+      const e = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = ye(t), a = st.join(t.weightData);
       try {
-        this.LS.setItem(this.keys.info, JSON.stringify(r)), this.LS.setItem(this.keys.topology, e), this.LS.setItem(this.keys.weightSpecs, s), this.LS.setItem(this.keys.weightData, In(i));
+        this.LS.setItem(this.keys.info, JSON.stringify(r)), this.LS.setItem(this.keys.topology, e), this.LS.setItem(this.keys.weightSpecs, s), this.LS.setItem(this.keys.weightData, Bn(a));
         const o = {
           format: t.format,
           generatedBy: t.generatedBy,
@@ -2417,7 +2496,7 @@ class j {
         };
         return this.LS.setItem(this.keys.modelMetadata, JSON.stringify(o)), { modelArtifactsInfo: r };
       } catch {
-        throw ke(this.keys), new Error(`Failed to save model '${this.modelPath}' to local storage: size quota being exceeded is a possible cause of this failure: modelTopologyBytes=${r.modelTopologyBytes}, weightSpecsBytes=${r.weightSpecsBytes}, weightDataBytes=${r.weightDataBytes}.`);
+        throw Ie(this.keys), new Error(`Failed to save model '${this.modelPath}' to local storage: size quota being exceeded is a possible cause of this failure: modelTopologyBytes=${r.modelTopologyBytes}, weightSpecsBytes=${r.weightSpecsBytes}, weightDataBytes=${r.weightDataBytes}.`);
       }
     }
   }
@@ -2443,46 +2522,46 @@ class j {
     if (r == null)
       throw new Error(`In local storage, the weight specs of model '${this.modelPath}' are missing.`);
     e.weightSpecs = r;
-    const i = this.LS.getItem(this.keys.modelMetadata);
-    if (i != null) {
-      const a = JSON.parse(i);
-      e.format = a.format, e.generatedBy = a.generatedBy, e.convertedBy = a.convertedBy, a.signature != null && (e.signature = a.signature), a.userDefinedMetadata != null && (e.userDefinedMetadata = a.userDefinedMetadata), a.modelInitializer != null && (e.modelInitializer = a.modelInitializer), a.initializerSignature != null && (e.initializerSignature = a.initializerSignature), a.trainingConfig != null && (e.trainingConfig = a.trainingConfig);
+    const a = this.LS.getItem(this.keys.modelMetadata);
+    if (a != null) {
+      const i = JSON.parse(a);
+      e.format = i.format, e.generatedBy = i.generatedBy, e.convertedBy = i.convertedBy, i.signature != null && (e.signature = i.signature), i.userDefinedMetadata != null && (e.userDefinedMetadata = i.userDefinedMetadata), i.modelInitializer != null && (e.modelInitializer = i.modelInitializer), i.initializerSignature != null && (e.initializerSignature = i.initializerSignature), i.trainingConfig != null && (e.trainingConfig = i.trainingConfig);
     }
     const o = this.LS.getItem(this.keys.weightData);
     if (o == null)
       throw new Error(`In local storage, the binary weight values of model '${this.modelPath}' are missing.`);
-    return e.weightData = Tn(o), e;
+    return e.weightData = vn(o), e;
   }
 }
 j.URL_SCHEME = "localstorage://";
-const Ie = (n) => S().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(j.URL_SCHEME) ? Nn(n.slice(j.URL_SCHEME.length)) : null;
-A.registerSaveRouter(Ie);
-A.registerLoadRouter(Ie);
-function Nn(n) {
+const Te = (n) => k().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(j.URL_SCHEME) ? Ln(n.slice(j.URL_SCHEME.length)) : null;
+A.registerSaveRouter(Te);
+A.registerLoadRouter(Te);
+function Ln(n) {
   return new j(n);
 }
-class Dn {
+class On {
   constructor() {
-    y(S().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), y(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
+    y(k().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), y(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
   }
   async listModels() {
-    const t = {}, e = Y + _, s = _ + we;
+    const t = {}, e = Q + P, s = P + Se;
     for (let r = 0; r < this.LS.length; ++r) {
-      const i = this.LS.key(r);
-      if (i.startsWith(e) && i.endsWith(s)) {
-        const o = Rn(i);
-        t[o] = JSON.parse(this.LS.getItem(i));
+      const a = this.LS.key(r);
+      if (a.startsWith(e) && a.endsWith(s)) {
+        const o = Cn(a);
+        t[o] = JSON.parse(this.LS.getItem(a));
       }
     }
     return t;
   }
   async removeModel(t) {
-    t = xn(t);
-    const e = Se(t);
+    t = Pn(t);
+    const e = ke(t);
     if (this.LS.getItem(e.info) == null)
       throw new Error(`Cannot find model at path '${t}'`);
     const s = JSON.parse(this.LS.getItem(e.info));
-    return ke(e), s;
+    return Ie(e), s;
   }
 }
 /**
@@ -2501,13 +2580,13 @@ class Dn {
  * limitations under the License.
  * =============================================================================
  */
-const Xt = "://";
-class N {
+const Yt = "://";
+class $ {
   constructor() {
     this.managers = {};
   }
   static getInstance() {
-    return N.instance == null && (N.instance = new N()), N.instance;
+    return $.instance == null && ($.instance = new $()), $.instance;
   }
   /**
    * Register a save-handler router.
@@ -2516,18 +2595,18 @@ class N {
    * of `IOHandler` with the `save` method defined or `null`.
    */
   static registerManager(t, e) {
-    y(t != null, () => "scheme must not be undefined or null."), t.endsWith(Xt) && (t = t.slice(0, t.indexOf(Xt))), y(t.length > 0, () => "scheme must not be an empty string.");
-    const s = N.getInstance();
+    y(t != null, () => "scheme must not be undefined or null."), t.endsWith(Yt) && (t = t.slice(0, t.indexOf(Yt))), y(t.length > 0, () => "scheme must not be an empty string.");
+    const s = $.getInstance();
     y(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = e;
   }
   static getManager(t) {
-    const e = N.getInstance().managers[t];
+    const e = $.getInstance().managers[t];
     if (e == null)
       throw new Error(`Cannot find model manager for scheme '${t}'`);
     return e;
   }
   static getSchemes() {
-    return Object.keys(N.getInstance().managers);
+    return Object.keys($.getInstance().managers);
   }
 }
 /**
@@ -2546,7 +2625,7 @@ class N {
  * limitations under the License.
  * =============================================================================
  */
-class Cn {
+class _n {
   constructor() {
     this.messageName = "setTimeoutCustom", this.functionRefs = [], this.handledMessageCount = 0, this.hasEventListener = !1;
   }
@@ -2569,7 +2648,7 @@ class Cn {
   // Interleaving window.postMessage and setTimeout will trick the browser and
   // avoid the clamp.
   setTimeoutCustom(t, e) {
-    if (typeof window > "u" || !S().getBool("USE_SETTIMEOUTCUSTOM")) {
+    if (typeof window > "u" || !k().getBool("USE_SETTIMEOUTCUSTOM")) {
       setTimeout(t, e);
       return;
     }
@@ -2584,34 +2663,34 @@ class Cn {
     }, !0));
   }
   isTypedArray(t) {
-    return oe(t);
+    return ie(t);
   }
 }
-if (S().get("IS_BROWSER")) {
-  S().setPlatform("browser", new Cn());
+if (k().get("IS_BROWSER")) {
+  k().setPlatform("browser", new _n());
   try {
-    N.registerManager(j.URL_SCHEME, new Dn());
+    $.registerManager(j.URL_SCHEME, new On());
   } catch {
   }
   try {
-    N.registerManager(W.URL_SCHEME, new Bn());
+    $.registerManager(W.URL_SCHEME, new Rn());
   } catch {
   }
 }
-const _n = {
+const Un = {
   // tslint:disable-next-line:no-require-imports
   importFetch: () => require("node-fetch")
 };
 let wt;
-class Pn {
+class Gn {
   constructor() {
     this.util = require("util"), this.textEncoder = new this.util.TextEncoder();
   }
   fetch(t, e) {
-    return S().global.fetch != null ? S().global.fetch(t, e) : (wt == null && (wt = _n.importFetch()), wt(t, e));
+    return k().global.fetch != null ? k().global.fetch(t, e) : (wt == null && (wt = Un.importFetch()), wt(t, e));
   }
   now() {
-    const t = Q.hrtime();
+    const t = Z.hrtime();
     return t[0] * 1e3 + t[1] / 1e6;
   }
   encode(t, e) {
@@ -2626,7 +2705,7 @@ class Pn {
     return this.util.types.isFloat32Array(t) || this.util.types.isInt32Array(t) || this.util.types.isUint8Array(t) || this.util.types.isUint8ClampedArray(t);
   }
 }
-S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new Pn());
+k().get("IS_NODE") && !k().get("IS_BROWSER") && k().setPlatform("node", new Gn());
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2643,8 +2722,8 @@ S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new Pn()
  * limitations under the License.
  * =============================================================================
  */
-function On(n, t = "float32", e) {
-  return t = t || "float32", Dt(n), new ln(n, t, e);
+function zn(n, t = "float32", e) {
+  return t = t || "float32", xt(n), new hn(n, t, e);
 }
 /**
  * @license
@@ -2662,16 +2741,16 @@ function On(n, t = "float32", e) {
  * limitations under the License.
  * =============================================================================
  */
-function Ln(n, t) {
-  const e = I(n, "x", "cast");
+function Vn(n, t) {
+  const e = T(n, "x", "cast");
   if (!$e(t))
     throw new Error(`Failed to cast to unknown dtype ${t}`);
   if (t === "string" && e.dtype !== "string" || t !== "string" && e.dtype === "string")
     throw new Error("Only strings can be casted to strings");
   const s = { x: e }, r = { dtype: t };
-  return g.runKernel(se, s, r);
+  return g.runKernel(re, s, r);
 }
-const $t = /* @__PURE__ */ F({ cast_: Ln });
+const Rt = /* @__PURE__ */ N({ cast_: Vn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2688,11 +2767,11 @@ const $t = /* @__PURE__ */ F({ cast_: Ln });
  * limitations under the License.
  * =============================================================================
  */
-function Un(n) {
-  const e = { x: I(n, "x", "clone", "string_or_numeric") };
-  return g.runKernel(re, e);
+function Wn(n) {
+  const e = { x: T(n, "x", "clone", "string_or_numeric") };
+  return g.runKernel(ae, e);
 }
-const Gn = /* @__PURE__ */ F({ clone_: Un });
+const jn = /* @__PURE__ */ N({ clone_: Wn });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2709,7 +2788,7 @@ const Gn = /* @__PURE__ */ F({ clone_: Un });
  * limitations under the License.
  * =============================================================================
  */
-function zn(n, t = !1) {
+function Kn(n, t = !1) {
   console.log(n.toString(t));
 }
 /**
@@ -2728,14 +2807,14 @@ function zn(n, t = !1) {
  * limitations under the License.
  * =============================================================================
  */
-ge();
-const Wn = {
-  buffer: On,
-  cast: $t,
-  clone: Gn,
-  print: zn
+me();
+const qn = {
+  buffer: zn,
+  cast: Rt,
+  clone: jn,
+  print: Kn
 };
-un(Wn);
+fn(qn);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2752,13 +2831,13 @@ un(Wn);
  * limitations under the License.
  * =============================================================================
  */
-function jn(n, t) {
-  let e = I(n, "a", "add"), s = I(t, "b", "add");
-  [e, s] = V(e, s);
+function Hn(n, t) {
+  let e = T(n, "a", "add"), s = T(t, "b", "add");
+  [e, s] = q(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(ne, r);
+  return g.runKernel(se, r);
 }
-const w = /* @__PURE__ */ F({ add_: jn });
+const S = /* @__PURE__ */ N({ add_: Hn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2775,13 +2854,13 @@ const w = /* @__PURE__ */ F({ add_: jn });
  * limitations under the License.
  * =============================================================================
  */
-function Kn(n, t) {
-  let e = I(n, "a", "floorDiv"), s = I(t, "b", "floorDiv");
-  [e, s] = V(e, s);
+function Jn(n, t) {
+  let e = T(n, "a", "floorDiv"), s = T(t, "b", "floorDiv");
+  [e, s] = q(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(Ke, r);
+  return g.runKernel(He, r);
 }
-const Vn = /* @__PURE__ */ F({ floorDiv_: Kn });
+const Xn = /* @__PURE__ */ N({ floorDiv_: Jn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2798,14 +2877,14 @@ const Vn = /* @__PURE__ */ F({ floorDiv_: Kn });
  * limitations under the License.
  * =============================================================================
  */
-function qn(n, t) {
-  let e = I(n, "a", "div"), s = I(t, "b", "div");
-  if ([e, s] = V(e, s), e.dtype === "int32" && s.dtype === "int32")
-    return Vn(e, s);
-  const r = { a: e, b: s }, i = {};
-  return g.runKernel(We, r, i);
-}
-const D = /* @__PURE__ */ F({ div_: qn });
+function Yn(n, t) {
+  let e = T(n, "a", "div"), s = T(t, "b", "div");
+  if ([e, s] = q(e, s), e.dtype === "int32" && s.dtype === "int32")
+    return Xn(e, s);
+  const r = { a: e, b: s }, a = {};
+  return g.runKernel(Ke, r, a);
+}
+const x = /* @__PURE__ */ N({ div_: Yn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2822,13 +2901,13 @@ const D = /* @__PURE__ */ F({ div_: qn });
  * limitations under the License.
  * =============================================================================
  */
-function Hn(n, t) {
-  let e = I(n, "a", "mul"), s = I(t, "b", "mul");
-  [e, s] = V(e, s);
+function Qn(n, t) {
+  let e = T(n, "a", "mul"), s = T(t, "b", "mul");
+  [e, s] = q(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(qe, r);
+  return g.runKernel(Xe, r);
 }
-const p = /* @__PURE__ */ F({ mul_: Hn });
+const b = /* @__PURE__ */ N({ mul_: Qn });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2845,17 +2924,17 @@ const p = /* @__PURE__ */ F({ mul_: Hn });
  * limitations under the License.
  * =============================================================================
  */
-function Jn(n) {
-  const t = I(n, "x", "abs");
+function Zn(n) {
+  const t = T(n, "x", "abs");
   if (t.dtype === "complex64") {
     const e = { x: t };
-    return g.runKernel(ze, e);
+    return g.runKernel(je, e);
   } else {
     const e = { x: t };
-    return g.runKernel(Ge, e);
+    return g.runKernel(We, e);
   }
 }
-const Xn = /* @__PURE__ */ F({ abs_: Jn });
+const ts = /* @__PURE__ */ N({ abs_: Zn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2872,10 +2951,10 @@ const Xn = /* @__PURE__ */ F({ abs_: Jn });
  * limitations under the License.
  * =============================================================================
  */
-function Yn(n, t, e) {
-  Dt(n), e = e || mt(t);
+function es(n, t, e) {
+  xt(n), e = e || mt(t);
   const s = { shape: n, value: t, dtype: e };
-  return g.runKernel(je, {}, s);
+  return g.runKernel(qe, {}, s);
 }
 /**
  * @license
@@ -2893,29 +2972,29 @@ function Yn(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function nr(n, t) {
+function fo(n, t) {
   const e = [];
   for (let s = 0; s < t.length; s++) {
-    const r = n[n.length - s - 1], i = t.length - s - 1, o = t[i];
-    (r == null || r === 1 && o > 1) && e.unshift(i);
+    const r = n[n.length - s - 1], a = t.length - s - 1, o = t[a];
+    (r == null || r === 1 && o > 1) && e.unshift(a);
   }
   return e;
 }
-function Qn(n, t) {
+function ns(n, t) {
   const e = Math.max(n.length, t.length), s = new Array(e);
   for (let r = 0; r < e; r++) {
-    let i = n[n.length - r - 1];
-    i == null && (i = 1);
+    let a = n[n.length - r - 1];
+    a == null && (a = 1);
     let o = t[t.length - r - 1];
-    if (o == null && (o = 1), i === 1)
+    if (o == null && (o = 1), a === 1)
       s[e - r - 1] = o;
     else if (o === 1)
-      s[e - r - 1] = i;
-    else if (i !== o) {
-      const a = `Operands could not be broadcast together with shapes ${n} and ${t}.`;
-      throw Error(a);
+      s[e - r - 1] = a;
+    else if (a !== o) {
+      const i = `Operands could not be broadcast together with shapes ${n} and ${t}.`;
+      throw Error(i);
     } else
-      s[e - r - 1] = i;
+      s[e - r - 1] = a;
   }
   return s;
 }
@@ -2935,11 +3014,11 @@ function Qn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function Zn(n) {
-  const e = { x: I(n, "x", "zerosLike") };
-  return g.runKernel(Ye, e);
+function ss(n) {
+  const e = { x: T(n, "x", "zerosLike") };
+  return g.runKernel(tn, e);
 }
-const C = /* @__PURE__ */ F({ zerosLike_: Zn });
+const C = /* @__PURE__ */ N({ zerosLike_: ss });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2956,13 +3035,13 @@ const C = /* @__PURE__ */ F({ zerosLike_: Zn });
  * limitations under the License.
  * =============================================================================
  */
-function ts(n, t) {
-  let e = I(n, "base", "pow"), s = I(t, "exp", "pow");
-  [e, s] = V(e, s);
+function rs(n, t) {
+  let e = T(n, "base", "pow"), s = T(t, "exp", "pow");
+  [e, s] = q(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(He, r);
+  return g.runKernel(Ye, r);
 }
-const Yt = /* @__PURE__ */ F({ pow_: ts });
+const Qt = /* @__PURE__ */ N({ pow_: rs });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2980,11 +3059,11 @@ const Yt = /* @__PURE__ */ F({ pow_: ts });
  * =============================================================================
  */
 function K(n, t) {
-  if (($(n) && t !== "string" || Array.isArray(n)) && t !== "complex64")
+  if ((R(n) && t !== "string" || Array.isArray(n)) && t !== "complex64")
     throw new Error("Error creating a new Scalar: value must be a primitive (number|boolean|string)");
-  if (t === "string" && $(n) && !(n instanceof Uint8Array))
+  if (t === "string" && R(n) && !(n instanceof Uint8Array))
     throw new Error("When making a scalar from encoded string, the value must be `Uint8Array`.");
-  return wn(n, [], [], t);
+  return In(n, [], [], t);
 }
 /**
  * @license
@@ -3002,11 +3081,11 @@ function K(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function es(n) {
-  const e = { x: I(n, "x", "sqrt", "float32") };
-  return g.runKernel(Je, e);
+function as(n) {
+  const e = { x: T(n, "x", "sqrt", "float32") };
+  return g.runKernel(Qe, e);
 }
-const et = /* @__PURE__ */ F({ sqrt_: es });
+const nt = /* @__PURE__ */ N({ sqrt_: as });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -3023,11 +3102,11 @@ const et = /* @__PURE__ */ F({ sqrt_: es });
  * limitations under the License.
  * =============================================================================
  */
-function ns(n) {
-  const t = I(n, "x", "square"), e = {};
+function os(n) {
+  const t = T(n, "x", "square"), e = {};
   return g.runKernel("Square", { x: t }, e);
 }
-const z = /* @__PURE__ */ F({ square_: ns });
+const V = /* @__PURE__ */ N({ square_: os });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3044,8 +3123,8 @@ const z = /* @__PURE__ */ F({ square_: ns });
  * limitations under the License.
  * =============================================================================
  */
-function ss(n, t) {
-  y(kt(n), () => "The f passed in variableGrads(f) must be a function"), y(t == null || Array.isArray(t) && t.every((l) => l instanceof dt), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
+function is(n, t) {
+  y(kt(n), () => "The f passed in variableGrads(f) must be a function"), y(t == null || Array.isArray(t) && t.every((l) => l instanceof ft), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
   const e = t != null;
   if (!e) {
     t = [];
@@ -3054,14 +3133,14 @@ function ss(n, t) {
   }
   const s = e ? t.filter((l) => !l.trainable) : null, r = t.length;
   t = t.filter((l) => l.trainable), y(t.length > 0, () => `variableGrads() expects at least one of the input variables to be trainable, but none of the ${r} variables is trainable.`);
-  const i = !0, { value: o, grads: a } = g.gradients(n, t, null, i);
-  y(a.some((l) => l != null), () => "Cannot find a connection between any variable and the result of the loss function y=f(x). Please make sure the operations that use variables are inside the function f passed to minimize()."), y(o.rank === 0, () => `The f passed in variableGrads(f) must return a scalar, but it returned a rank-${o.rank} tensor`);
+  const a = !0, { value: o, grads: i } = g.gradients(n, t, null, a);
+  y(i.some((l) => l != null), () => "Cannot find a connection between any variable and the result of the loss function y=f(x). Please make sure the operations that use variables are inside the function f passed to minimize()."), y(o.rank === 0, () => `The f passed in variableGrads(f) must return a scalar, but it returned a rank-${o.rank} tensor`);
   const c = {};
   return t.forEach((l, u) => {
-    a[u] != null && (c[l.name] = a[u]);
+    i[u] != null && (c[l.name] = i[u]);
   }), s?.forEach((l) => c[l.name] = null), { value: o, grads: c };
 }
-function sr(n) {
+function go(n) {
   return g.customGrad(n);
 }
 /**
@@ -3080,13 +3159,13 @@ function sr(n) {
  * limitations under the License.
  * =============================================================================
  */
-function rs(n, t) {
-  let e = I(n, "a", "sub"), s = I(t, "b", "sub");
-  [e, s] = V(e, s);
+function cs(n, t) {
+  let e = T(n, "a", "sub"), s = T(t, "b", "sub");
+  [e, s] = q(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(Xe, r);
+  return g.runKernel(Ze, r);
 }
-const Z = /* @__PURE__ */ F({ sub_: rs });
+const tt = /* @__PURE__ */ N({ sub_: cs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3103,13 +3182,13 @@ const Z = /* @__PURE__ */ F({ sub_: rs });
  * limitations under the License.
  * =============================================================================
  */
-function is(n, t) {
-  let e = I(n, "a", "maximum"), s = I(t, "b", "maximum");
-  [e, s] = V(e, s), e.dtype === "bool" && (e = $t(e, "int32"), s = $t(s, "int32")), Qn(e.shape, s.shape);
+function ls(n, t) {
+  let e = T(n, "a", "maximum"), s = T(t, "b", "maximum");
+  [e, s] = q(e, s), e.dtype === "bool" && (e = Rt(e, "int32"), s = Rt(s, "int32")), ns(e.shape, s.shape);
   const r = { a: e, b: s };
-  return g.runKernel(Ve, r);
+  return g.runKernel(Je, r);
 }
-const os = /* @__PURE__ */ F({ maximum_: is });
+const us = /* @__PURE__ */ N({ maximum_: ls });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3126,8 +3205,8 @@ const os = /* @__PURE__ */ F({ maximum_: is });
  * limitations under the License.
  * =============================================================================
  */
-const as = /* @__PURE__ */ new Map(), ls = /* @__PURE__ */ new Map();
-class cs {
+const hs = /* @__PURE__ */ new Map(), ds = /* @__PURE__ */ new Map();
+class fs {
   /**
    * Return the class name for this class to use in serialization contexts.
    *
@@ -3155,7 +3234,7 @@ class cs {
     return new t(e);
   }
 }
-class L {
+class U {
   constructor() {
     this.classNameMap = {};
   }
@@ -3163,19 +3242,19 @@ class L {
    * Returns the singleton instance of the map.
    */
   static getMap() {
-    return L.instance == null && (L.instance = new L()), L.instance;
+    return U.instance == null && (U.instance = new U()), U.instance;
   }
   /**
    * Registers the class as serializable.
    */
   static register(t) {
-    L.getMap().classNameMap[t.className] = [t, t.fromConfig];
+    U.getMap().classNameMap[t.className] = [t, t.fromConfig];
   }
 }
-function us(n, t, e) {
+function gs(n, t, e) {
   y(n.className != null, () => "Class being registered does not have the static className property defined."), y(typeof n.className == "string", () => "className is required to be a string, but got type " + typeof n.className), y(n.className.length > 0, () => "Class being registered has an empty-string as its className, which is disallowed."), typeof t > "u" && (t = "Custom"), typeof e > "u" && (e = n.className);
   const s = e, r = t + ">" + s;
-  return L.register(n), as.set(r, n), ls.set(n, r), n;
+  return U.register(n), hs.set(r, n), ds.set(n, r), n;
 }
 /**
  * @license
@@ -3193,7 +3272,7 @@ function us(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-class q extends cs {
+class H extends fs {
   /**
    * Executes `f()` and minimizes the scalar output of `f()` by computing
    * gradients of y with respect to the list of trainable variables provided by
@@ -3209,13 +3288,13 @@ class q extends cs {
    * @doc {heading: 'Training', subheading: 'Optimizers'}
    */
   minimize(t, e = !1, s) {
-    const { value: r, grads: i } = this.computeGradients(t, s);
+    const { value: r, grads: a } = this.computeGradients(t, s);
     if (s != null) {
-      const o = s.map((a) => ({ name: a.name, tensor: i[a.name] }));
+      const o = s.map((i) => ({ name: i.name, tensor: a[i.name] }));
       this.applyGradients(o);
     } else
-      this.applyGradients(i);
-    return M(i), e ? r : (r.dispose(), null);
+      this.applyGradients(a);
+    return M(a), e ? r : (r.dispose(), null);
   }
   /**
    * The number of iterations that this optimizer instance has been invoked for.
@@ -3240,7 +3319,7 @@ class q extends cs {
    * @doc {heading: 'Training', subheading: 'Optimizers'}
    */
   computeGradients(t, e) {
-    return ss(t, e);
+    return is(t, e);
   }
   /**
    * Dispose the variables (if any) owned by this optimizer instance.
@@ -3272,7 +3351,7 @@ class q extends cs {
     return this.iterations_ = (await t[0].tensor.data())[0], t.slice(1);
   }
 }
-Object.defineProperty(q, Symbol.hasInstance, {
+Object.defineProperty(H, Symbol.hasInstance, {
   value: (n) => n.minimize != null && n.computeGradients != null && n.applyGradients != null
 });
 /**
@@ -3291,7 +3370,7 @@ Object.defineProperty(q, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-class hs extends q {
+class ms extends H {
   /** @nocollapse */
   static get className() {
     return "Adadelta";
@@ -3301,23 +3380,23 @@ class hs extends q {
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const i = g.registeredVariables[s], o = !1;
+      const a = g.registeredVariables[s], o = !1;
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accum_grad`,
-        variable: E(() => C(i).variable(o))
+        variable: E(() => C(a).variable(o))
       }), this.accumulatedUpdates[r] == null && (this.accumulatedUpdates[r] = {
         originalName: `${s}/accum_var`,
-        variable: E(() => C(i).variable(o))
+        variable: E(() => C(a).variable(o))
       });
-      const a = Array.isArray(t) ? t[r].tensor : t[s];
-      if (a == null)
+      const i = Array.isArray(t) ? t[r].tensor : t[s];
+      if (i == null)
         return;
       const c = this.accumulatedGrads[r].variable, l = this.accumulatedUpdates[r].variable;
       E(() => {
-        const u = w(p(c, this.rho), p(z(a), 1 - this.rho)), h = p(D(et(w(l, this.epsilon)), et(w(c, this.epsilon))), a), f = w(p(l, this.rho), p(z(h), 1 - this.rho));
-        c.assign(u), l.assign(f);
-        const m = w(p(h, -this.learningRate), i);
-        i.assign(m);
+        const u = S(b(c, this.rho), b(V(i), 1 - this.rho)), h = b(x(nt(S(l, this.epsilon)), nt(S(c, this.epsilon))), i), d = S(b(l, this.rho), b(V(h), 1 - this.rho));
+        c.assign(u), l.assign(d);
+        const m = S(b(h, -this.learningRate), a);
+        a.assign(m);
       });
     }), this.incrementIterations();
   }
@@ -3367,7 +3446,7 @@ class hs extends q {
  * limitations under the License.
  * =============================================================================
  */
-class fs extends q {
+class ps extends H {
   /** @nocollapse */
   static get className() {
     return "Adagrad";
@@ -3377,20 +3456,20 @@ class fs extends q {
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const i = g.registeredVariables[s];
+      const a = g.registeredVariables[s];
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accumulator`,
-        variable: E(() => Yn(i.shape, this.initialAccumulatorValue).variable(!1))
+        variable: E(() => es(a.shape, this.initialAccumulatorValue).variable(!1))
       });
       const o = Array.isArray(t) ? t[r].tensor : t[s];
       if (o == null)
         return;
-      const a = this.accumulatedGrads[r].variable;
+      const i = this.accumulatedGrads[r].variable;
       E(() => {
-        const c = w(a, z(o));
-        a.assign(c);
-        const l = w(p(D(o, et(w(c, g.backend.epsilon()))), -this.learningRate), i);
-        i.assign(l);
+        const c = S(i, V(o));
+        i.assign(c);
+        const l = S(b(x(o, nt(S(c, g.backend.epsilon()))), -this.learningRate), a);
+        a.assign(l);
       });
     }), this.incrementIterations();
   }
@@ -3432,7 +3511,7 @@ class fs extends q {
  * limitations under the License.
  * =============================================================================
  */
-class ds extends q {
+class ys extends H {
   /** @nocollapse */
   static get className() {
     return "Adam";
@@ -3445,24 +3524,24 @@ class ds extends q {
   applyGradients(t) {
     const e = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
-      const s = Z(1, this.accBeta1), r = Z(1, this.accBeta2);
-      e.forEach((i, o) => {
-        const a = g.registeredVariables[i], c = !1;
+      const s = tt(1, this.accBeta1), r = tt(1, this.accBeta2);
+      e.forEach((a, o) => {
+        const i = g.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
-          originalName: `${i}/m`,
-          variable: E(() => C(a).variable(c))
+          originalName: `${a}/m`,
+          variable: E(() => C(i).variable(c))
         }), this.accumulatedSecondMoment[o] == null && (this.accumulatedSecondMoment[o] = {
-          originalName: `${i}/v`,
-          variable: E(() => C(a).variable(c))
+          originalName: `${a}/v`,
+          variable: E(() => C(i).variable(c))
         });
-        const l = Array.isArray(t) ? t[o].tensor : t[i];
+        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 = w(p(u, this.beta1), p(l, 1 - this.beta1)), m = w(p(h, this.beta2), p(z(l), 1 - this.beta2)), b = D(f, s), d = D(m, r);
-        u.assign(f), h.assign(m);
-        const k = w(p(D(b, w(et(d), this.epsilon)), -this.learningRate), a);
-        a.assign(k);
-      }), this.accBeta1.assign(p(this.accBeta1, this.beta1)), this.accBeta2.assign(p(this.accBeta2, this.beta2));
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedSecondMoment[o].variable, d = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = S(b(h, this.beta2), b(V(l), 1 - this.beta2)), p = x(d, s), f = x(m, r);
+        u.assign(d), h.assign(m);
+        const w = S(b(x(p, S(nt(f), this.epsilon)), -this.learningRate), i);
+        i.assign(w);
+      }), this.accBeta1.assign(b(this.accBeta1, this.beta1)), this.accBeta2.assign(b(this.accBeta2, this.beta2));
     }), this.incrementIterations();
   }
   dispose() {
@@ -3474,7 +3553,7 @@ class ds extends q {
   }
   async setWeights(t) {
     t = await this.extractIterations(t), E(() => {
-      this.accBeta1.assign(Yt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Yt(this.beta2, this.iterations_ + 1));
+      this.accBeta1.assign(Qt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Qt(this.beta2, this.iterations_ + 1));
     });
     const e = t.length / 2, s = !1;
     this.accumulatedFirstMoment = t.slice(0, e).map((r) => ({
@@ -3514,37 +3593,37 @@ class ds extends q {
  * limitations under the License.
  * =============================================================================
  */
-class gs extends q {
+class bs extends H {
   /** @nocollapse */
   static get className() {
     return "Adamax";
   }
-  constructor(t, e, s, r = null, i = 0) {
-    super(), this.learningRate = t, this.beta1 = e, this.beta2 = s, this.epsilon = r, this.decay = i, this.accumulatedFirstMoment = [], this.accumulatedWeightedInfNorm = [], E(() => {
+  constructor(t, e, s, r = null, a = 0) {
+    super(), this.learningRate = t, this.beta1 = e, this.beta2 = s, this.epsilon = r, this.decay = a, this.accumulatedFirstMoment = [], this.accumulatedWeightedInfNorm = [], E(() => {
       this.iteration = K(0).variable(), this.accBeta1 = K(e).variable();
     }), r == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
     const e = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
-      const s = Z(1, this.accBeta1), r = D(-this.learningRate, w(p(this.iteration, this.decay), 1));
-      e.forEach((i, o) => {
-        const a = g.registeredVariables[i], c = !1;
+      const s = tt(1, this.accBeta1), r = x(-this.learningRate, S(b(this.iteration, this.decay), 1));
+      e.forEach((a, o) => {
+        const i = g.registeredVariables[a], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
-          originalName: `${i}/m`,
-          variable: C(a).variable(c)
+          originalName: `${a}/m`,
+          variable: C(i).variable(c)
         }), this.accumulatedWeightedInfNorm[o] == null && (this.accumulatedWeightedInfNorm[o] = {
-          originalName: `${i}/v`,
-          variable: C(a).variable(c)
+          originalName: `${a}/v`,
+          variable: C(i).variable(c)
         });
-        const l = Array.isArray(t) ? t[o].tensor : t[i];
+        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 = w(p(u, this.beta1), p(l, 1 - this.beta1)), m = p(h, this.beta2), b = Xn(l), d = os(m, b);
-        u.assign(f), h.assign(d);
-        const k = w(p(D(r, s), D(f, w(d, this.epsilon))), a);
-        a.assign(k);
-      }), this.iteration.assign(w(this.iteration, 1)), this.accBeta1.assign(p(this.accBeta1, this.beta1));
+        const u = this.accumulatedFirstMoment[o].variable, h = this.accumulatedWeightedInfNorm[o].variable, d = S(b(u, this.beta1), b(l, 1 - this.beta1)), m = b(h, this.beta2), p = ts(l), f = us(m, p);
+        u.assign(d), h.assign(f);
+        const w = S(b(x(r, s), x(d, S(f, this.epsilon))), i);
+        i.assign(w);
+      }), this.iteration.assign(S(this.iteration, 1)), this.accBeta1.assign(b(this.accBeta1, this.beta1));
     }), this.incrementIterations();
   }
   dispose() {
@@ -3586,7 +3665,7 @@ class gs extends q {
  * limitations under the License.
  * =============================================================================
  */
-class Te extends q {
+class Ee extends H {
   /** @nocollapse */
   static get className() {
     return "SGD";
@@ -3596,13 +3675,13 @@ class Te extends q {
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const i = Array.isArray(t) ? t[r].tensor : t[s];
-      if (i == null)
+      const a = Array.isArray(t) ? t[r].tensor : t[s];
+      if (a == null)
         return;
       const o = g.registeredVariables[s];
       E(() => {
-        const a = w(p(this.c, i), o);
-        o.assign(a);
+        const i = S(b(this.c, a), o);
+        o.assign(i);
       });
     }), this.incrementIterations();
   }
@@ -3610,7 +3689,7 @@ class Te extends q {
    * Sets the learning rate of the optimizer.
    */
   setLearningRate(t) {
-    this.learningRate = t, this.c != null && this.c.dispose(), this.c = kn(K(-t));
+    this.learningRate = t, this.c != null && this.c.dispose(), this.c = En(K(-t));
   }
   dispose() {
     this.c.dispose();
@@ -3646,7 +3725,7 @@ class Te extends q {
  * limitations under the License.
  * =============================================================================
  */
-class ms extends Te {
+class ws extends Ee {
   /** @nocollapse */
   // Name matters for Python compatibility.
   static get className() {
@@ -3657,16 +3736,16 @@ class ms extends Te {
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const i = g.registeredVariables[s];
+      const a = g.registeredVariables[s];
       this.accumulations[r] == null && (this.accumulations[r] = {
         originalName: `${s}/momentum`,
-        variable: E(() => C(i).variable(!1))
+        variable: E(() => C(a).variable(!1))
       });
-      const o = this.accumulations[r].variable, a = Array.isArray(t) ? t[r].tensor : t[s];
-      a != null && E(() => {
+      const o = this.accumulations[r].variable, i = Array.isArray(t) ? t[r].tensor : t[s];
+      i != null && E(() => {
         let c;
-        const l = w(p(this.m, o), a);
-        this.useNesterov ? c = w(p(this.c, w(a, p(l, this.m))), i) : c = w(p(this.c, l), i), o.assign(l), i.assign(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);
       });
     }), this.incrementIterations();
   }
@@ -3717,44 +3796,44 @@ class ms extends Te {
  * limitations under the License.
  * =============================================================================
  */
-class ps extends q {
+class Ss extends H {
   /** @nocollapse */
   static get className() {
     return "RMSProp";
   }
-  constructor(t, e = 0.9, s = 0, r = null, i = !1) {
-    if (super(), this.learningRate = t, this.decay = e, this.momentum = s, this.epsilon = r, this.accumulatedMeanSquares = [], this.accumulatedMoments = [], this.accumulatedMeanGrads = [], this.centered = i, r == null && (this.epsilon = g.backend.epsilon()), t == null)
+  constructor(t, e = 0.9, s = 0, r = null, a = !1) {
+    if (super(), this.learningRate = t, this.decay = e, this.momentum = s, this.epsilon = r, this.accumulatedMeanSquares = [], this.accumulatedMoments = [], this.accumulatedMeanGrads = [], this.centered = a, r == null && (this.epsilon = g.backend.epsilon()), t == null)
       throw new Error("learningRate for RMSPropOptimizer must be defined.");
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
-      const i = g.registeredVariables[s], o = !1;
+      const a = g.registeredVariables[s], o = !1;
       this.accumulatedMeanSquares[r] == null && (this.accumulatedMeanSquares[r] = {
         originalName: `${s}/rms`,
-        variable: E(() => C(i).variable(o))
+        variable: E(() => C(a).variable(o))
       }), this.accumulatedMoments[r] == null && (this.accumulatedMoments[r] = {
         originalName: `${s}/momentum`,
-        variable: E(() => C(i).variable(o))
+        variable: E(() => C(a).variable(o))
       }), this.accumulatedMeanGrads[r] == null && this.centered && (this.accumulatedMeanGrads[r] = {
         originalName: `${s}/mg`,
-        variable: E(() => C(i).variable(o))
+        variable: E(() => C(a).variable(o))
       });
-      const a = Array.isArray(t) ? t[r].tensor : t[s];
-      if (a == null)
+      const i = Array.isArray(t) ? t[r].tensor : t[s];
+      if (i == null)
         return;
       const c = this.accumulatedMeanSquares[r].variable, l = this.accumulatedMoments[r].variable;
       E(() => {
-        const u = w(p(c, this.decay), p(z(a), 1 - this.decay));
+        const u = S(b(c, this.decay), b(V(i), 1 - this.decay));
         if (this.centered) {
-          const h = this.accumulatedMeanGrads[r].variable, f = w(p(h, this.decay), p(a, 1 - this.decay)), m = D(p(a, this.learningRate), et(Z(u, w(z(f), this.epsilon)))), b = w(p(l, this.momentum), m);
-          c.assign(u), h.assign(f), l.assign(b);
-          const d = Z(i, b);
-          i.assign(d);
+          const h = this.accumulatedMeanGrads[r].variable, d = S(b(h, this.decay), b(i, 1 - this.decay)), m = x(b(i, this.learningRate), nt(tt(u, S(V(d), this.epsilon)))), p = S(b(l, this.momentum), m);
+          c.assign(u), h.assign(d), l.assign(p);
+          const f = tt(a, p);
+          a.assign(f);
         } else {
-          const h = w(p(c, this.decay), p(z(a), 1 - this.decay)), f = w(p(l, this.momentum), D(p(a, this.learningRate), et(w(h, this.epsilon))));
-          c.assign(h), l.assign(f);
-          const m = Z(i, f);
-          i.assign(m);
+          const h = S(b(c, this.decay), b(V(i), 1 - this.decay)), d = S(b(l, this.momentum), x(b(i, this.learningRate), nt(S(h, this.epsilon))));
+          c.assign(h), l.assign(d);
+          const m = tt(a, d);
+          a.assign(m);
         }
       });
     }), this.incrementIterations();
@@ -3810,18 +3889,18 @@ class ps extends q {
  * limitations under the License.
  * =============================================================================
  */
-const ys = [
-  hs,
-  fs,
-  ds,
-  gs,
+const ks = [
   ms,
   ps,
-  Te
+  ys,
+  bs,
+  ws,
+  Ss,
+  Ee
 ];
-function bs() {
-  for (const n of ys)
-    us(n);
+function Is() {
+  for (const n of ks)
+    gs(n);
 }
 /**
  * @license
@@ -3839,61 +3918,220 @@ function bs() {
  * limitations under the License.
  * =============================================================================
  */
-bs();
+Is();
 export {
-  Qn as $,
-  ds as A,
-  Es as B,
-  As as C,
-  w as D,
+  Ur as $,
+  ys as A,
+  Ks as B,
+  Zs as C,
+  Sn as D,
   g as E,
-  qs as F,
-  $s as G,
-  sr as H,
-  E as I,
-  C as J,
-  js as K,
-  Ns as L,
-  Ds as M,
-  vs as N,
-  Rs as O,
-  _s as P,
-  xs as Q,
-  Gs as R,
-  Ks as S,
-  Cs as T,
-  Ps as U,
-  Ls as V,
-  Us as W,
-  zs as X,
-  Js as Y,
-  Hs as Z,
-  nr as _,
-  p as a,
-  Xs as a0,
-  Z as b,
-  Qs as c,
-  I as d,
-  tr as e,
-  V as f,
-  Is as g,
-  $t as h,
-  Vs as i,
-  Os as j,
-  Zs as k,
-  y as l,
-  er as m,
-  Gn as n,
-  F as o,
-  Bs as p,
-  Fs as q,
-  Ys as r,
-  K as s,
-  Dt as t,
-  Zt as u,
-  G as v,
-  De as w,
-  Ws as x,
+  In as F,
+  Nr as G,
+  Rr as H,
+  ya as I,
+  Qt as J,
+  or as K,
+  Da as L,
+  vs as M,
+  Qs as N,
+  te as O,
+  ha as P,
+  Ma as Q,
+  ma as R,
+  _a as S,
+  qr as T,
+  Rt as U,
+  La as V,
+  na as W,
+  sa as X,
+  Ka as Y,
+  S as Z,
+  Tr as _,
+  M as a,
+  Oa as a$,
+  Re as a0,
+  Ua as a1,
+  Zr as a2,
+  ts as a3,
+  nt as a4,
+  V as a5,
+  Qr as a6,
+  R as a7,
+  D as a8,
+  k as a9,
+  ns as aA,
+  Ir as aB,
+  Na as aC,
+  br as aD,
+  wr as aE,
+  kr as aF,
+  Er as aG,
+  zn as aH,
+  vr as aI,
+  Fr as aJ,
+  Dr as aK,
+  $r as aL,
+  Lr as aM,
+  Or as aN,
+  _r as aO,
+  Gr as aP,
+  ra as aQ,
+  Pa as aR,
+  zr as aS,
+  Vr as aT,
+  Hr as aU,
+  Xr as aV,
+  ta as aW,
+  aa as aX,
+  ua as aY,
+  la as aZ,
+  da as a_,
+  fe as aa,
+  so as ab,
+  dt as ac,
+  $s as ad,
+  xs as ae,
+  Cs as af,
+  Ne as ag,
+  zs as ah,
+  Ws as ai,
+  Ca as aj,
+  Fa as ak,
+  Wa as al,
+  qs as am,
+  Mr as an,
+  Hs as ao,
+  ja as ap,
+  Ys as aq,
+  tr as ar,
+  nr as as,
+  sr as at,
+  ar as au,
+  ir as av,
+  cr as aw,
+  lr as ax,
+  hr as ay,
+  dr as az,
+  b,
+  Ar as b$,
+  fa as b0,
+  pa as b1,
+  ba as b2,
+  Ea as b3,
+  Aa as b4,
+  Ba as b5,
+  va as b6,
+  Ra as b7,
+  $a as b8,
+  Ns as b9,
+  ps as bA,
+  co as bB,
+  gs as bC,
+  fs as bD,
+  U as bE,
+  We as bF,
+  Rs as bG,
+  Fs as bH,
+  se as bI,
+  Ds as bJ,
+  Ps as bK,
+  Ls as bL,
+  Os as bM,
+  Gs as bN,
+  _s as bO,
+  Us as bP,
+  js as bQ,
+  Vs as bR,
+  Js as bS,
+  re as bT,
+  Xs as bU,
+  je as bV,
+  rr as bW,
+  mr as bX,
+  yr as bY,
+  pr as bZ,
+  Sr as b_,
+  Ya as ba,
+  Xa as bb,
+  Ja as bc,
+  Ha as bd,
+  Ft as be,
+  x as bf,
+  er as bg,
+  fo as bh,
+  to as bi,
+  fr as bj,
+  gr as bk,
+  Za as bl,
+  ur as bm,
+  Br as bn,
+  Qa as bo,
+  oa as bp,
+  ca as bq,
+  ia as br,
+  Ia as bs,
+  Sa as bt,
+  qa as bu,
+  Ee as bv,
+  ws as bw,
+  Ss as bx,
+  ms as by,
+  bs as bz,
+  go as c,
+  He as c0,
+  ae as c1,
+  xr as c2,
+  Cr as c3,
+  Pr as c4,
+  Wr as c5,
+  Kr as c6,
+  jr as c7,
+  Je as c8,
+  Yr as c9,
+  Jr as ca,
+  ea as cb,
+  Xe as cc,
+  Ye as cd,
+  ga as ce,
+  Ke as cf,
+  Ta as cg,
+  ka as ch,
+  xa as ci,
+  Qe as cj,
+  za as ck,
+  Ga as cl,
+  Ze as cm,
+  Va as cn,
+  us as co,
+  tn as cp,
+  Pe as cq,
+  H as cr,
+  Bs as cs,
+  ho as ct,
+  lo as cu,
+  uo as cv,
+  ao as d,
+  oo as e,
+  K as f,
+  no as g,
+  T as h,
+  ro as i,
+  y as j,
+  xt as k,
+  Le as l,
+  io as m,
+  z as n,
+  N as o,
+  q as p,
+  wa as q,
+  eo as r,
+  tt as s,
+  E as t,
+  jn as u,
+  is as v,
+  es as w,
+  En as x,
   Ms as y,
-  Ts as z
+  C as z
 };