@genai-fi/nanogpt 0.2.8 → 0.2.10

package/dist/{index-DQfEAU9u.js → index-CWQLouWz.js}

@@ -1,4 +1,4 @@
-import { g as Pt } from "./index-D5v913EJ.js";
+import { g as Ot } from "./index-D5v913EJ.js";
 import { p as Q } from "./index-xuotMAFm.js";
 import { B as gt } from "./index-Tf7vU29b.js";
 /**
@@ -17,8 +17,8 @@ import { B as gt } from "./index-Tf7vU29b.js";
  * limitations under the License.
  * =============================================================================
  */
-const Te = 1e-7, Ee = 1e-4;
-class Ae {
+const Ee = 1e-7, Ae = 1e-4;
+class Be {
   refCount(t) {
     return v("refCount");
   }
@@ -64,7 +64,7 @@ class Ae {
   }
   /** Returns the smallest representable number.  */
   epsilon() {
-    return this.floatPrecision() === 32 ? Te : Ee;
+    return this.floatPrecision() === 32 ? Ee : Ae;
   }
   dispose() {
     return v("dispose");
@@ -94,9 +94,9 @@ function y(n, t) {
     throw new Error(typeof t == "string" ? t : t());
 }
 function Is(n, t, e = "") {
-  y($t(n, t), () => e + ` Shapes ${n} and ${t} must match`);
+  y(Rt(n, t), () => e + ` Shapes ${n} and ${t} must match`);
 }
-function U(n) {
+function G(n) {
   if (n.length === 0)
     return 1;
   let t = n[0];
@@ -104,7 +104,7 @@ function U(n) {
     t *= n[e];
   return t;
 }
-function $t(n, t) {
+function Rt(n, t) {
   if (n === t)
     return !0;
   if (n == null || t == null || n.length !== t.length)
@@ -114,7 +114,7 @@ function $t(n, t) {
       return !1;
   return !0;
 }
-function Be(n) {
+function ve(n) {
   return n % 1 === 0;
 }
 function ct(n, t) {
@@ -122,9 +122,9 @@ function ct(n, t) {
 }
 function Ts(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) => Be(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) => ve(s)), () => `All values in axis param must be integers but got axis ${n}`), n.map((s) => s < 0 ? e + s : s);
 }
-function ve(n, t) {
+function Me(n, t) {
   let e = null;
   if (n == null || n === "float32")
     e = new Float32Array(t);
@@ -138,14 +138,14 @@ function ve(n, t) {
     throw new Error(`Unknown data type ${n}`);
   return e;
 }
-function Me(n, t) {
+function Fe(n, t) {
   for (let e = 0; e < n.length; e++) {
     const s = n[e];
     if (isNaN(s) || !isFinite(s))
       throw Error(`A tensor of type ${t} being uploaded contains ${s}.`);
   }
 }
-function Fe(n) {
+function $e(n) {
   return n === "bool" || n === "complex64" || n === "float32" || n === "int32" || n === "string";
 }
 function St(n) {
@@ -157,28 +157,28 @@ function St(n) {
     return 1;
   throw new Error(`Unknown dtype ${n}`);
 }
-function $e(n) {
+function Re(n) {
   if (n == null)
     return 0;
   let t = 0;
   return n.forEach((e) => t += e.length), t;
 }
-function Rt(n) {
+function xt(n) {
   return typeof n == "string" || n instanceof String;
 }
-function Re(n) {
+function xe(n) {
   return typeof n == "boolean";
 }
-function xe(n) {
+function Ne(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" : xe(n) ? "float32" : Rt(n) ? "string" : Re(n) ? "bool" : "float32";
+  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";
 }
 function kt(n) {
   return !!(n && n.constructor && n.call && n.apply);
 }
-function xt(n) {
+function Nt(n) {
   const t = n.length;
   if (t < 2)
     return [];
@@ -188,7 +188,7 @@ function xt(n) {
     e[s] = e[s + 1] * n[s + 1];
   return e;
 }
-function Yt(n, t, e, s = !1) {
+function Qt(n, t, e, s = !1) {
   const r = new Array();
   if (t.length === 1) {
     const i = t[0] * (s ? 2 : 1);
@@ -197,11 +197,11 @@ function Yt(n, t, e, s = !1) {
   } 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] = Yt(n + c * a, o, e, s);
+      r[c] = Qt(n + c * a, o, e, s);
   }
   return r;
 }
-function Ot(n, t, e = !1) {
+function Lt(n, t, e = !1) {
   if (n.length === 0)
     return t[0];
   const s = n.reduce((r, i) => r * i) * (e ? 2 : 1);
@@ -209,15 +209,15 @@ function Ot(n, t, e = !1) {
     return [];
   if (s !== t.length)
     throw new Error(`[${n}] does not match the input size ${t.length}${e ? " for a complex tensor" : ""}.`);
-  return Yt(0, n, t, e);
+  return Qt(0, n, t, e);
 }
-function Ne(n, t) {
-  const e = Qt(n, t);
+function De(n, t) {
+  const e = Zt(n, t);
   for (let s = 0; s < e.length; s++)
     e[s] = 1;
   return e;
 }
-function Qt(n, t) {
+function Zt(n, t) {
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(n);
   if (t === "int32")
@@ -226,12 +226,12 @@ function Qt(n, t) {
     return new Uint8Array(n);
   throw new Error(`Unknown data type ${t}`);
 }
-function Nt(n) {
+function Dt(n) {
   n.forEach((t) => {
     y(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${n}].`);
   });
 }
-function Dt(n) {
+function Ct(n) {
   return n && n.then && typeof n.then == "function";
 }
 /**
@@ -250,11 +250,11 @@ function Dt(n) {
  * limitations under the License.
  * =============================================================================
  */
-const Lt = "tfjsflags";
-class De {
+const Ut = "tfjsflags";
+class Ce {
   // tslint:disable-next-line: no-any
   constructor(t) {
-    this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = Ce, this.populateURLFlags();
+    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;
@@ -272,7 +272,7 @@ class De {
     if (t in this.flags)
       return this.flags[t];
     const e = this.evaluateFlag(t);
-    if (Dt(e))
+    if (Ct(e))
       throw new Error(`Flag ${t} cannot be synchronously evaluated. Please use getAsync() instead.`);
     return this.flags[t] = e, this.flags[t];
   }
@@ -312,29 +312,29 @@ class De {
     if (typeof this.global > "u" || typeof this.global.location > "u" || typeof this.global.location.search > "u")
       return;
     const t = this.getQueryParams(this.global.location.search);
-    Lt in t && t[Lt].split(",").forEach((s) => {
+    Ut in t && t[Ut].split(",").forEach((s) => {
       const [r, i] = s.split(":");
-      this.urlFlags[r] = Pe(r, i);
+      this.urlFlags[r] = Oe(r, i);
     });
   }
 }
-function Ce(n) {
+function _e(n) {
   const t = {};
-  return n.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (e, ...s) => (_e(t, s[0], s[1]), s.join("="))), t;
+  return n.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (e, ...s) => (Pe(t, s[0], s[1]), s.join("="))), t;
 }
-function _e(n, t, e) {
+function Pe(n, t, e) {
   n[decodeURIComponent(t)] = decodeURIComponent(e || "");
 }
-function Pe(n, t) {
+function Oe(n, t) {
   const e = t.toLowerCase();
   return e === "true" || e === "false" ? e === "true" : `${+e}` === e ? +e : t;
 }
 function S() {
-  return Zt;
+  return te;
 }
-let Zt = null;
-function Oe(n) {
-  Zt = n;
+let te = null;
+function Le(n) {
+  te = n;
 }
 /**
  * @license
@@ -353,13 +353,13 @@ function Oe(n) {
  * =============================================================================
  */
 let pt;
-function te() {
+function ee() {
   if (pt == null) {
     let n;
     if (typeof window < "u")
       n = window;
-    else if (typeof Pt < "u")
-      n = Pt;
+    else if (typeof Ot < "u")
+      n = Ot;
     else if (typeof Q < "u")
       n = Q;
     else if (typeof self < "u")
@@ -370,12 +370,12 @@ function te() {
   }
   return pt;
 }
-function Le() {
-  const n = te();
+function Ue() {
+  const n = ee();
   return n._tfGlobals == null && (n._tfGlobals = /* @__PURE__ */ new Map()), n._tfGlobals;
 }
-function Ct(n, t) {
-  const e = Le();
+function _t(n, t) {
+  const e = Ue();
   if (e.has(n))
     return e.get(n);
   {
@@ -383,7 +383,7 @@ function Ct(n, t) {
     return e.set(n, s), e.get(n);
   }
 }
-const Ue = "Abs", ee = "Add", Es = "BatchMatMul", ne = "Cast", As = "Complex", Ge = "ComplexAbs", ze = "RealDiv", Bs = "Elu", vs = "Exp", We = "Fill", je = "FloorDiv", Ms = "GatherNd", se = "Identity", Fs = "Imag", $s = "LeakyRelu", Rs = "Log", xs = "Max", Ke = "Maximum", Ve = "Multiply", Ns = "Neg", Ds = "Pack", qe = "Pow", Cs = "Prelu", _s = "Range", Ps = "Real", Os = "Relu", Ls = "Reshape", Us = "Relu6", Gs = "ScatterNd", zs = "Sigmoid", He = "Sqrt", Ws = "Sum", js = "Softmax", Je = "Sub", Ks = "Transpose", Xe = "ZerosLike", Vs = "Step", qs = "_FusedMatMul";
+const Ge = "Abs", ne = "Add", Es = "BatchMatMul", se = "Cast", As = "Complex", ze = "ComplexAbs", We = "RealDiv", Bs = "Elu", vs = "Exp", je = "Fill", Ke = "FloorDiv", Ms = "GatherNd", re = "Identity", Fs = "Imag", $s = "LeakyRelu", Rs = "Log", xs = "Max", Ve = "Maximum", qe = "Multiply", Ns = "Neg", Ds = "Pack", He = "Pow", Cs = "Prelu", _s = "Range", Ps = "Real", Os = "Relu", Ls = "Reshape", Us = "Relu6", Gs = "ScatterNd", zs = "Sigmoid", Je = "Sqrt", Ws = "Sum", js = "Softmax", Xe = "Sub", Ks = "Transpose", Ye = "ZerosLike", Vs = "Step", qs = "_FusedMatMul";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -400,7 +400,7 @@ const Ue = "Abs", ee = "Add", Es = "BatchMatMul", ne = "Cast", As = "Complex", G
  * limitations under the License.
  * =============================================================================
  */
-function J(...n) {
+function O(...n) {
   S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(...n);
 }
 /**
@@ -419,15 +419,15 @@ function J(...n) {
  * limitations under the License.
  * =============================================================================
  */
-const ht = Ct("kernelRegistry", () => /* @__PURE__ */ new Map()), Ye = Ct("gradRegistry", () => /* @__PURE__ */ new Map());
-function Ut(n, t) {
-  const e = re(n, t);
+const ht = _t("kernelRegistry", () => /* @__PURE__ */ new Map()), It = _t("gradRegistry", () => /* @__PURE__ */ new Map());
+function Gt(n, t) {
+  const e = ie(n, t);
   return ht.get(e);
 }
-function Gt(n) {
-  return Ye.get(n);
-}
 function zt(n) {
+  return It.get(n);
+}
+function Wt(n) {
   const t = ht.entries(), e = [];
   for (; ; ) {
     const { done: s, value: r } = t.next();
@@ -439,10 +439,14 @@ function zt(n) {
   return e;
 }
 function Hs(n) {
-  const { kernelName: t, backendName: e } = n, s = re(t, e);
-  ht.has(s) && J(`The kernel '${t}' for backend '${e}' is already registered`), ht.set(s, 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 re(n, t) {
+function Js(n) {
+  const { kernelName: t } = n;
+  It.has(t) && S().getBool("DEBUG") && O(`Overriding the gradient for '${t}'`), It.set(t, n);
+}
+function ie(n, t) {
   return `${t}_${n}`;
 }
 /**
@@ -461,7 +465,7 @@ function re(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ie(n) {
+function oe(n) {
   return n instanceof Float32Array || n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray;
 }
 /**
@@ -483,10 +487,10 @@ function ie(n) {
 function Qe(n, t) {
   return n instanceof Float32Array && t === "float32" || n instanceof Int32Array && t === "int32" || n instanceof Uint8Array && t === "bool";
 }
-function oe(n, t) {
+function ae(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") && Me(n, t), Qe(n, t))
+  if (Array.isArray(n) && (n = at(n)), S().getBool("DEBUG") && Fe(n, t), Qe(n, t))
     return n;
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(n);
@@ -506,14 +510,14 @@ function ft() {
 function Ze(n, t = "utf-8") {
   return t = t || "utf-8", S().platform.encode(n, t);
 }
-function Wt(n, t = "utf-8") {
+function jt(n, t = "utf-8") {
   return t = t || "utf-8", S().platform.decode(n, t);
 }
 function $(n) {
-  return S().platform.isTypedArray != null ? S().platform.isTypedArray(n) : ie(n);
+  return S().platform.isTypedArray != null ? S().platform.isTypedArray(n) : oe(n);
 }
 function at(n, t = [], e = !1) {
-  if (t == null && (t = []), typeof n == "boolean" || typeof n == "number" || typeof n == "string" || Dt(n) || n == null || $(n) && e)
+  if (t == null && (t = []), typeof n == "boolean" || typeof n == "number" || typeof n == "string" || Ct(n) || n == null || $(n) && e)
     t.push(n);
   else if (Array.isArray(n) || $(n))
     for (let s = 0; s < n.length; ++s)
@@ -687,7 +691,7 @@ function rn(n, t, e, s) {
       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 (!$t(l.shape, u.shape))
+      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}'`);
       if (n[u.id] == null)
         n[u.id] = l;
@@ -714,15 +718,15 @@ function rn(n, t, e, s) {
  * limitations under the License.
  * =============================================================================
  */
-const jt = 20, rt = 3, yt = 7;
+const Kt = 20, rt = 3, yt = 7;
 function on(n, t, e, s) {
-  const r = xt(t), i = an(n, t, e, r), o = t.length, a = ut(n, t, e, r, i), c = ["Tensor"];
+  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(`
 `)), c.join(`
 `);
 }
 function an(n, t, e, s) {
-  const r = U(t), i = s[s.length - 1], o = new Array(i).fill(0), a = t.length, c = e === "complex64" ? ot(n) : n;
+  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;
@@ -733,9 +737,9 @@ function an(n, t, e, s) {
 }
 function it(n, t, e) {
   let s;
-  return Array.isArray(n) ? s = `${parseFloat(n[0].toFixed(yt))} + ${parseFloat(n[1].toFixed(yt))}j` : Rt(n) ? s = `'${n}'` : e === "bool" ? s = ae(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` : xt(n) ? s = `'${n}'` : e === "bool" ? s = le(n) : s = parseFloat(n.toFixed(yt)).toString(), ct(s, t);
 }
-function ae(n) {
+function le(n) {
   return n === 0 ? "false" : "true";
 }
 function ut(n, t, e, s, r, i = !0) {
@@ -745,14 +749,14 @@ function ut(n, t, e, s, r, i = !0) {
       const d = ot(n);
       return [it(d[0], 0, e)];
     }
-    return e === "bool" ? [ae(n[0])] : [n[0].toString()];
+    return e === "bool" ? [le(n[0])] : [n[0].toString()];
   }
   if (c === 1) {
-    if (a > jt) {
+    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((q, H) => it(q, r[H], e)).join(", ") + ", ..., " + nt.map((q, H) => it(q, r[a - rt + H], e)).join(", ") + "]"
+        "[" + T.map((H, J) => it(H, r[J], e)).join(", ") + ", ..., " + nt.map((H, J) => it(H, r[a - rt + J], e)).join(", ") + "]"
       ];
     }
     return [
@@ -760,7 +764,7 @@ function ut(n, t, e, s, r, i = !0) {
     ];
   }
   const l = t.slice(1), u = s.slice(1), h = s[0] * o, f = [];
-  if (a > jt) {
+  if (a > Kt) {
     for (let d = 0; d < rt; d++) {
       const k = d * h, T = k + h;
       f.push(...ut(
@@ -834,13 +838,13 @@ function ot(n) {
  */
 class ln {
   constructor(t, e, s) {
-    if (this.dtype = e, this.shape = t.slice(), this.size = U(t), s != null) {
+    if (this.dtype = e, this.shape = t.slice(), this.size = G(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 || ve(e, this.size), this.strides = xt(t);
+    this.values = s || Me(e, this.size), this.strides = Nt(t);
   }
   /**
    * Sets a value in the buffer at a given location.
@@ -918,7 +922,7 @@ function un(n) {
 }
 class x {
   constructor(t, e, s, r) {
-    this.kept = !1, this.isDisposedInternal = !1, this.shape = t.slice(), this.dtype = e || "float32", this.size = U(t), this.strides = xt(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 = G(t), this.strides = Nt(t), this.dataId = s, this.id = r, this.rankType = this.rank < 5 ? this.rank.toString() : "higher";
   }
   get rank() {
     return this.shape.length;
@@ -947,7 +951,7 @@ class x {
    */
   async array() {
     const t = await this.data();
-    return Ot(this.shape, t, this.dtype === "complex64");
+    return Lt(this.shape, t, this.dtype === "complex64");
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -956,7 +960,7 @@ class x {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   arraySync() {
-    return Ot(this.shape, this.dataSync(), this.dtype === "complex64");
+    return Lt(this.shape, this.dataSync(), this.dtype === "complex64");
   }
   /**
    * Asynchronously downloads the values from the `tf.Tensor`. Returns a
@@ -970,7 +974,7 @@ class x {
     if (this.dtype === "string") {
       const e = await t;
       try {
-        return e.map((s) => Wt(s));
+        return e.map((s) => jt(s));
       } catch {
         throw new Error("Failed to decode the string bytes into utf-8. To get the original bytes, call tensor.bytes().");
       }
@@ -1025,7 +1029,7 @@ class x {
     const t = R().readSync(this.dataId);
     if (this.dtype === "string")
       try {
-        return t.map((e) => Wt(e));
+        return t.map((e) => jt(e));
       } catch {
         throw new Error("Failed to decode the string bytes into utf-8. To get the original bytes, call tensor.bytes().");
       }
@@ -1089,10 +1093,10 @@ class x {
 Object.defineProperty(x, Symbol.hasInstance, {
   value: (n) => !!n && n.data != null && n.dataSync != null && n.throwIfDisposed != null
 });
-function le() {
-  return Ct("Tensor", () => x);
+function ce() {
+  return _t("Tensor", () => x);
 }
-le();
+ce();
 class dt extends x {
   constructor(t, e, s, r) {
     super(t.shape, t.dtype, t.dataId, r), this.trainable = e, this.name = s;
@@ -1108,7 +1112,7 @@ 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 (!$t(t.shape, this.shape))
+    if (!Rt(t.shape, this.shape))
       throw new Error(`shape of the new value (${t.shape}) and previous value (${this.shape}) must match`);
     R().disposeTensor(this), this.dataId = t.dataId, R().incRef(
       this,
@@ -1139,31 +1143,31 @@ Object.defineProperty(dt, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-var Kt;
+var Vt;
 (function(n) {
   n.R0 = "R0", n.R1 = "R1", n.R2 = "R2", n.R3 = "R3", n.R4 = "R4", n.R5 = "R5", n.R6 = "R6";
-})(Kt || (Kt = {}));
-var It;
-(function(n) {
-  n.float32 = "float32", n.int32 = "int32", n.bool = "int32", n.complex64 = "complex64";
-})(It || (It = {}));
+})(Vt || (Vt = {}));
 var Tt;
 (function(n) {
-  n.float32 = "float32", n.int32 = "int32", n.bool = "bool", n.complex64 = "complex64";
+  n.float32 = "float32", n.int32 = "int32", n.bool = "int32", n.complex64 = "complex64";
 })(Tt || (Tt = {}));
 var Et;
 (function(n) {
-  n.float32 = "float32", n.int32 = "float32", n.bool = "float32", n.complex64 = "complex64";
+  n.float32 = "float32", n.int32 = "int32", n.bool = "bool", n.complex64 = "complex64";
 })(Et || (Et = {}));
 var At;
 (function(n) {
-  n.float32 = "complex64", n.int32 = "complex64", n.bool = "complex64", n.complex64 = "complex64";
+  n.float32 = "float32", n.int32 = "float32", n.bool = "float32", n.complex64 = "complex64";
 })(At || (At = {}));
+var Bt;
+(function(n) {
+  n.float32 = "complex64", n.int32 = "complex64", n.bool = "complex64", n.complex64 = "complex64";
+})(Bt || (Bt = {}));
 const hn = {
-  float32: Et,
-  int32: It,
-  bool: Tt,
-  complex64: At
+  float32: At,
+  int32: Tt,
+  bool: Et,
+  complex64: Bt
 };
 function fn(n, t) {
   if (n === "string" || t === "string") {
@@ -1173,10 +1177,10 @@ function fn(n, t) {
   }
   return hn[n][t];
 }
-function ce(n) {
+function ue(n) {
   return n != null && typeof n == "object" && "texture" in n && n.texture instanceof WebGLTexture;
 }
-function ue(n) {
+function he(n) {
   return typeof GPUBuffer < "u" && n != null && typeof n == "object" && "buffer" in n && n.buffer instanceof GPUBuffer;
 }
 /**
@@ -1195,17 +1199,17 @@ function ue(n) {
  * limitations under the License.
  * =============================================================================
  */
-function K(n, t) {
+function V(n, t) {
   if (n.dtype === t.dtype)
     return [n, t];
   const e = fn(n.dtype, t.dtype);
   return [n.cast(e), t.cast(e)];
 }
-function he(n) {
+function fe(n) {
   const t = [];
-  return fe(n, t, /* @__PURE__ */ new Set()), t;
+  return de(n, t, /* @__PURE__ */ new Set()), t;
 }
-function fe(n, t, e) {
+function de(n, t, e) {
   if (n == null)
     return;
   if (n instanceof x) {
@@ -1217,7 +1221,7 @@ function fe(n, t, e) {
   const s = n;
   for (const r in s) {
     const i = s[r];
-    e.has(i) || (e.add(i), fe(i, t, e));
+    e.has(i) || (e.add(i), de(i, t, e));
   }
 }
 function dn(n) {
@@ -1242,7 +1246,7 @@ function dn(n) {
 function bt(n) {
   return n.kernelName != null;
 }
-class Vt {
+class qt {
   constructor() {
     this.registeredVariables = {}, this.nextTapeNodeId = 0, this.numBytes = 0, this.numTensors = 0, this.numStringTensors = 0, this.numDataBuffers = 0, this.gradientDepth = 0, this.kernelDepth = 0, this.scopeStack = [], this.numDataMovesStack = [], this.nextScopeId = 0, this.tensorInfo = /* @__PURE__ */ new WeakMap(), this.profiling = !1, this.activeProfile = {
       newBytes: 0,
@@ -1262,7 +1266,7 @@ class Vt {
 }
 class tt {
   constructor(t) {
-    this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new Vt();
+    this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new qt();
   }
   async ready() {
     if (this.pendingBackendInit != null)
@@ -1308,7 +1312,7 @@ class tt {
     return t in this.registryFactory ? this.registryFactory[t].factory : null;
   }
   registerBackend(t, e, s = 1) {
-    return t in this.registryFactory ? (J(`${t} backend was already registered. Reusing existing backend factory.`), !1) : (this.registryFactory[t] = { factory: e, priority: s }, !0);
+    return t in this.registryFactory ? (O(`${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)
@@ -1322,12 +1326,12 @@ class tt {
     return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new tn(this.backendInstance), !0;
   }
   setupRegisteredKernels() {
-    zt(this.backendName).forEach((e) => {
+    Wt(this.backendName).forEach((e) => {
       e.setupFunc != null && e.setupFunc(this.backendInstance);
     });
   }
   disposeRegisteredKernels(t) {
-    zt(t).forEach((s) => {
+    Wt(t).forEach((s) => {
       s.disposeFunc != null && s.disposeFunc(this.registry[t]);
     });
   }
@@ -1343,13 +1347,13 @@ class tt {
       throw new Error(`Cannot initialize backend ${t}, no registration found.`);
     try {
       const s = e.factory();
-      if (s && !(s instanceof Ae) && 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, J(`Initialization of backend ${t} failed`), J(o.stack || o.message)), !1));
+      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 };
       } else
         return this.registry[t] = s, { success: !0, asyncInit: !1 };
     } catch (s) {
-      return J(`Initialization of backend ${t} failed`), J(s.stack || s.message), { success: !1, asyncInit: !1 };
+      return O(`Initialization of backend ${t} failed`), O(s.stack || s.message), { success: !1, asyncInit: !1 };
     }
   }
   removeBackend(t) {
@@ -1413,11 +1417,11 @@ class tt {
    * execution.
    */
   clone(t) {
-    const e = g.runKernel(se, { x: t }), s = { x: t }, r = (o) => ({
+    const e = g.runKernel(re, { x: t }), s = { x: t }, r = (o) => ({
       x: () => {
         const a = "float32", c = { x: o }, l = { dtype: a };
         return g.runKernel(
-          ne,
+          se,
           c,
           // tslint:disable-next-line: no-unnecessary-type-assertion
           l
@@ -1440,7 +1444,7 @@ class tt {
    * tensors are not visible to the user.
    */
   runKernel(t, e, s) {
-    if (this.backendName == null && this.backend, !(Ut(t, this.backendName) != null))
+    if (this.backendName == null && this.backend, !(Gt(t, this.backendName) != null))
       throw new Error(`Kernel '${t}' not registered for backend '${this.backendName}'`);
     return this.runKernelFunc({ kernelName: t, inputs: e, attrs: s });
   }
@@ -1473,18 +1477,18 @@ class tt {
     if (bt(t)) {
       const { kernelName: b, inputs: d, attrs: k } = t;
       this.backendName == null && this.backend;
-      const T = Ut(b, this.backendName);
+      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 q = Array.isArray(c) ? c : [c];
-        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(b, nt, q);
-        const H = q.map((st) => st.rank != null ? st : this.makeTensorFromTensorInfo(st));
+        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));
         if (r) {
-          const st = this.getTensorsForGradient(b, d, H);
+          const st = this.getTensorsForGradient(b, d, J);
           s = this.saveTensorsForBackwardMode(st);
         }
-        return H;
+        return J;
       };
     } else {
       const { forwardFunc: b } = t, d = (k) => {
@@ -1534,7 +1538,7 @@ class tt {
    * @param outputs an array of output tensors from forward mode of kernel.
    */
   getTensorsForGradient(t, e, s) {
-    const r = Gt(t);
+    const r = zt(t);
     if (r != null) {
       const i = r.inputsToSave || [], o = r.outputsToSave || [];
       let a;
@@ -1554,10 +1558,10 @@ class tt {
       throw new Error("Values passed to engine.makeTensor() are null");
     s = s || "float32", r = r || this.backend;
     let i = t;
-    s === "string" && Rt(t[0]) && (i = t.map((c) => Ze(c)));
+    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 = $e(i);
+      const c = this.state.tensorInfo.get(o), l = Re(i);
       this.state.numBytes += l - c.bytes, c.bytes = l;
     }
     return a;
@@ -1645,10 +1649,10 @@ class tt {
     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 = Gt(t);
+    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) => {
       if (u == null) {
-        const f = s[h], m = Qt(f.size, f.dtype);
+        const f = s[h], m = Zt(f.size, f.dtype);
         return this.makeTensor(m, f.shape, f.dtype);
       }
       return u;
@@ -1680,7 +1684,7 @@ class tt {
    * as scope() without the need for a function closure.
    */
   endScope(t) {
-    const e = he(t), s = new Set(e.map((i) => i.id));
+    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];
       !o.kept && !s.has(o.id) && o.dispose();
@@ -1774,7 +1778,7 @@ class tt {
    * registered backend factories.
    */
   reset() {
-    this.pendingBackendInitId++, this.state.dispose(), this.ENV.reset(), this.state = new Vt();
+    this.pendingBackendInitId++, this.state.dispose(), this.ENV.reset(), this.state = new qt();
     for (const t in this.registry)
       this.disposeRegisteredKernels(t), this.registry[t].dispose(), delete this.registry[t];
     this.backendName = null, this.backendInstance = null, this.pendingBackendInit = null;
@@ -1783,21 +1787,21 @@ class tt {
 tt.nextTensorId = 0;
 tt.nextVariableId = 0;
 function gn(n) {
-  const t = Ne(U(n), "float32");
+  const t = De(G(n), "float32");
   return g.makeTensor(t, n, "float32");
 }
-function de() {
-  const n = te();
+function ge() {
+  const n = ee();
   if (n._tfengine == null) {
-    const t = new De(n);
+    const t = new Ce(n);
     n._tfengine = new tt(t);
   }
-  return Oe(n._tfengine.ENV), cn(() => n._tfengine), n._tfengine;
+  return Le(n._tfengine.ENV), cn(() => n._tfengine), n._tfengine;
 }
-const g = de();
+const g = ge();
 function mn(n, t) {
   const e = { a: n, b: t };
-  return g.runKernel(ee, e);
+  return g.runKernel(ne, e);
 }
 /**
  * @license
@@ -1855,19 +1859,19 @@ function yn(n, t) {
   let e = n;
   if ($(n))
     return t === "string" ? [] : [n.length];
-  if (ce(n)) {
+  if (ue(n)) {
     const r = n.channels || "RGBA";
     return [n.height, n.width * r.length];
-  } else if (ue(n))
+  } else if (he(n))
     return [n.buffer.size / (t == null ? 4 : St(t))];
   if (!Array.isArray(n))
     return [];
   const s = [];
   for (; Array.isArray(e) || $(e) && t !== "string"; )
     s.push(e.length), e = e[0];
-  return Array.isArray(n) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && ge(n, s, []), s;
+  return Array.isArray(n) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && me(n, s, []), s;
 }
-function ge(n, t, e) {
+function me(n, t, e) {
   if (e = e || [], !Array.isArray(n) && !$(n)) {
     y(t.length === 0, () => `Element arr[${e.join("][")}] is a primitive, but should be an array/TypedArray of ${t[0]} elements`);
     return;
@@ -1875,9 +1879,9 @@ function ge(n, t, e) {
   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)
-    ge(n[r], s, e.concat(r));
+    me(n[r], s, e.concat(r));
 }
-function qt(n, t, e, s) {
+function Ht(n, t, e, s) {
   if (n !== "string_or_numeric") {
     if (n == null)
       throw new Error("Expected dtype cannot be null.");
@@ -1886,19 +1890,19 @@ function qt(n, t, e, s) {
   }
 }
 function I(n, t, e, s = "numeric") {
-  if (n instanceof le())
-    return qt(s, n.dtype, t, e), n;
+  if (n instanceof ce())
+    return Ht(s, n.dtype, t, e), n;
   let r = mt(n);
-  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), qt(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 || !$(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" ? oe(n, r) : at(n, [], !0);
+  const a = r !== "string" ? ae(n, r) : at(n, [], !0);
   return g.makeTensor(a, i, r);
 }
-function Js(n, t, e, s = "numeric") {
+function Xs(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));
@@ -1931,7 +1935,7 @@ function F(n) {
     g.startScope(e);
     try {
       const o = s(...i);
-      return Dt(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
+      return Ct(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
     } catch (o) {
       throw g.endScope(null), o;
     }
@@ -1959,7 +1963,7 @@ function wn(n, t, e, s) {
     s = mt(n);
   else if (s === "complex64")
     throw new Error("Cannot construct a complex64 tensor directly. Please use tf.complex(real, imag).");
-  if (ue(n) || ce(n)) {
+  if (he(n) || ue(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);
@@ -1967,15 +1971,15 @@ function wn(n, t, e, s) {
   if (!$(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) {
-    Nt(t);
-    const r = U(t), i = U(e);
+    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}`);
     for (let o = 0; o < e.length; ++o) {
-      const a = e[o], c = o === e.length - 1 ? a !== U(t.slice(o)) : !0;
+      const a = e[o], c = o === e.length - 1 ? a !== G(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" ? oe(n, s) : at(n, [], !0), g.makeTensor(n, t, s);
+  return !$(n) && !Array.isArray(n) && (n = [n]), t = t || e, n = s !== "string" ? ae(n, s) : at(n, [], !0), g.makeTensor(n, t, s);
 }
 class lt {
   /**
@@ -2061,24 +2065,27 @@ function Sn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function Xs() {
+function Ys() {
   return g;
 }
+function Qs() {
+  return g.memory();
+}
 function E(n, t) {
   return g.tidy(n, t);
 }
 function M(n) {
-  he(n).forEach((e) => e.dispose());
+  fe(n).forEach((e) => e.dispose());
 }
 function kn(n) {
   return g.keep(n);
 }
-const _t = typeof gt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
-function Ht(n) {
-  return _t ? gt.byteLength(n, "utf8") : new Blob([n]).size;
+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 In(n) {
-  if (_t)
+  if (Pt)
     return gt.from(n).toString("base64");
   const t = new Uint8Array(n);
   let e = "";
@@ -2087,7 +2094,7 @@ function In(n) {
   return btoa(e);
 }
 function Tn(n) {
-  if (_t) {
+  if (Pt) {
     const s = gt.from(n, "base64");
     return s.buffer.slice(s.byteOffset, s.byteOffset + s.byteLength);
   }
@@ -2096,14 +2103,14 @@ function Tn(n) {
     e.set([t.charCodeAt(s)], s);
   return e.buffer;
 }
-function me(n) {
+function pe(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 : Ht(JSON.stringify(n.modelTopology)),
-    weightSpecsBytes: n.weightSpecs == null ? 0 : Ht(JSON.stringify(n.weightSpecs)),
+    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
   };
 }
@@ -2194,8 +2201,8 @@ class A {
  * limitations under the License.
  * =============================================================================
  */
-const Bt = "tensorflowjs", vt = 1, L = "models_store", P = "model_info_store";
-function pe() {
+const vt = "tensorflowjs", Mt = 1, U = "models_store", P = "model_info_store";
+function ye() {
   if (!S().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;
@@ -2203,13 +2210,13 @@ function pe() {
     throw new Error("The current browser does not appear to support IndexedDB.");
   return t;
 }
-function Mt(n) {
+function Ft(n) {
   const t = n.result;
-  t.createObjectStore(L, { keyPath: "modelPath" }), t.createObjectStore(P, { keyPath: "modelPath" });
+  t.createObjectStore(U, { keyPath: "modelPath" }), t.createObjectStore(P, { keyPath: "modelPath" });
 }
-class z {
+class W {
   constructor(t) {
-    if (this.indexedDB = pe(), t == null || !t)
+    if (this.indexedDB = ye(), t == null || !t)
       throw new Error("For IndexedDB, modelPath must not be null, undefined or empty.");
     this.modelPath = t;
   }
@@ -2237,11 +2244,11 @@ class z {
    */
   databaseAction(t, e) {
     return new Promise((s, r) => {
-      const i = this.indexedDB.open(Bt, vt);
-      i.onupgradeneeded = () => Mt(i), i.onsuccess = () => {
+      const i = this.indexedDB.open(vt, Mt);
+      i.onupgradeneeded = () => Ft(i), i.onsuccess = () => {
         const o = i.result;
         if (e == null) {
-          const a = o.transaction(L, "readonly"), l = a.objectStore(L).get(this.modelPath);
+          const a = o.transaction(U, "readonly"), l = a.objectStore(U).get(this.modelPath);
           l.onsuccess = () => {
             if (l.result == null)
               return o.close(), r(new Error(`Cannot find model with path '${this.modelPath}' in IndexedDB.`));
@@ -2249,7 +2256,7 @@ class z {
           }, l.onerror = (u) => (o.close(), r(l.error)), a.oncomplete = () => o.close();
         } else {
           e.weightData = lt.join(e.weightData);
-          const a = me(e), c = o.transaction(P, "readwrite");
+          const a = pe(e), c = o.transaction(P, "readwrite");
           let l = c.objectStore(P), u;
           try {
             u = l.put({ modelPath: this.modelPath, modelArtifactsInfo: a });
@@ -2258,8 +2265,8 @@ class z {
           }
           let h;
           u.onsuccess = () => {
-            h = o.transaction(L, "readwrite");
-            const f = h.objectStore(L);
+            h = o.transaction(U, "readwrite");
+            const f = h.objectStore(U);
             let m;
             try {
               m = f.put({
@@ -2283,24 +2290,24 @@ class z {
     });
   }
 }
-z.URL_SCHEME = "indexeddb://";
-const ye = (n) => S().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(z.URL_SCHEME) ? En(n.slice(z.URL_SCHEME.length)) : null;
-A.registerSaveRouter(ye);
-A.registerLoadRouter(ye);
+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) {
-  return new z(n);
+  return new W(n);
 }
 function An(n) {
-  return n.startsWith(z.URL_SCHEME) ? n.slice(z.URL_SCHEME.length) : n;
+  return n.startsWith(W.URL_SCHEME) ? n.slice(W.URL_SCHEME.length) : n;
 }
 class Bn {
   constructor() {
-    this.indexedDB = pe();
+    this.indexedDB = ye();
   }
   async listModels() {
     return new Promise((t, e) => {
-      const s = this.indexedDB.open(Bt, vt);
-      s.onupgradeneeded = () => Mt(s), s.onsuccess = () => {
+      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 = () => {
           const c = {};
@@ -2313,8 +2320,8 @@ class Bn {
   }
   async removeModel(t) {
     return t = An(t), new Promise((e, s) => {
-      const r = this.indexedDB.open(Bt, vt);
-      r.onupgradeneeded = () => Mt(r), r.onsuccess = () => {
+      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);
         let l;
         c.onsuccess = () => {
@@ -2322,8 +2329,8 @@ class Bn {
             return i.close(), s(new Error(`Cannot find model with path '${t}' in IndexedDB.`));
           {
             const u = a.delete(t), h = () => {
-              l = i.transaction(L, "readwrite");
-              const m = l.objectStore(L).delete(t);
+              l = i.transaction(U, "readwrite");
+              const m = l.objectStore(U).delete(t);
               m.onsuccess = () => e(c.result.modelArtifactsInfo), m.onerror = (b) => s(c.error);
             };
             u.onsuccess = h, u.onerror = (f) => (h(), i.close(), s(c.error));
@@ -2351,17 +2358,17 @@ class Bn {
  * limitations under the License.
  * =============================================================================
  */
-const _ = "/", Y = "tensorflowjs_models", be = "info", vn = "model_topology", Mn = "weight_specs", Fn = "weight_data", $n = "model_metadata";
-function we(n) {
+const _ = "/", Y = "tensorflowjs_models", we = "info", vn = "model_topology", Mn = "weight_specs", Fn = "weight_data", $n = "model_metadata";
+function Se(n) {
   return {
-    info: [Y, n, be].join(_),
+    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(_)
   };
 }
-function Se(n) {
+function ke(n) {
   for (const t of Object.values(n))
     window.localStorage.removeItem(t);
 }
@@ -2372,15 +2379,15 @@ function Rn(n) {
   return t.slice(1, t.length - 1).join(_);
 }
 function xn(n) {
-  return n.startsWith(W.URL_SCHEME) ? n.slice(W.URL_SCHEME.length) : n;
+  return n.startsWith(j.URL_SCHEME) ? n.slice(j.URL_SCHEME.length) : n;
 }
-class W {
+class j {
   constructor(t) {
     if (!S().getBool("IS_BROWSER") || typeof window > "u" || typeof window.localStorage > "u")
       throw new Error("The current environment does not support local storage.");
     if (this.LS = window.localStorage, t == null || !t)
       throw new Error("For local storage, modelPath must not be null, undefined or empty.");
-    this.modelPath = t, this.keys = we(this.modelPath);
+    this.modelPath = t, this.keys = Se(this.modelPath);
   }
   /**
    * Save model artifacts to browser local storage.
@@ -2395,7 +2402,7 @@ class W {
     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 = me(t), i = lt.join(t.weightData);
+      const e = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = pe(t), i = lt.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));
         const o = {
@@ -2410,7 +2417,7 @@ class W {
         };
         return this.LS.setItem(this.keys.modelMetadata, JSON.stringify(o)), { modelArtifactsInfo: r };
       } catch {
-        throw Se(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 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}.`);
       }
     }
   }
@@ -2447,19 +2454,19 @@ class W {
     return e.weightData = Tn(o), e;
   }
 }
-W.URL_SCHEME = "localstorage://";
-const ke = (n) => S().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(W.URL_SCHEME) ? Nn(n.slice(W.URL_SCHEME.length)) : null;
-A.registerSaveRouter(ke);
-A.registerLoadRouter(ke);
+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) {
-  return new W(n);
+  return new j(n);
 }
 class Dn {
   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;
   }
   async listModels() {
-    const t = {}, e = Y + _, s = _ + be;
+    const t = {}, e = Y + _, s = _ + we;
     for (let r = 0; r < this.LS.length; ++r) {
       const i = this.LS.key(r);
       if (i.startsWith(e) && i.endsWith(s)) {
@@ -2471,11 +2478,11 @@ class Dn {
   }
   async removeModel(t) {
     t = xn(t);
-    const e = we(t);
+    const e = Se(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 Se(e), s;
+    return ke(e), s;
   }
 }
 /**
@@ -2494,7 +2501,7 @@ class Dn {
  * limitations under the License.
  * =============================================================================
  */
-const Jt = "://";
+const Xt = "://";
 class N {
   constructor() {
     this.managers = {};
@@ -2509,7 +2516,7 @@ 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(Jt) && (t = t.slice(0, t.indexOf(Jt))), y(t.length > 0, () => "scheme must not be an empty string.");
+    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(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = e;
   }
@@ -2577,17 +2584,17 @@ class Cn {
     }, !0));
   }
   isTypedArray(t) {
-    return ie(t);
+    return oe(t);
   }
 }
 if (S().get("IS_BROWSER")) {
   S().setPlatform("browser", new Cn());
   try {
-    N.registerManager(W.URL_SCHEME, new Dn());
+    N.registerManager(j.URL_SCHEME, new Dn());
   } catch {
   }
   try {
-    N.registerManager(z.URL_SCHEME, new Bn());
+    N.registerManager(W.URL_SCHEME, new Bn());
   } catch {
   }
 }
@@ -2637,7 +2644,7 @@ S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new Pn()
  * =============================================================================
  */
 function On(n, t = "float32", e) {
-  return t = t || "float32", Nt(n), new ln(n, t, e);
+  return t = t || "float32", Dt(n), new ln(n, t, e);
 }
 /**
  * @license
@@ -2657,14 +2664,14 @@ function On(n, t = "float32", e) {
  */
 function Ln(n, t) {
   const e = I(n, "x", "cast");
-  if (!Fe(t))
+  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(ne, s, r);
+  return g.runKernel(se, s, r);
 }
-const Ft = /* @__PURE__ */ F({ cast_: Ln });
+const $t = /* @__PURE__ */ F({ cast_: Ln });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2683,7 +2690,7 @@ const Ft = /* @__PURE__ */ F({ cast_: Ln });
  */
 function Un(n) {
   const e = { x: I(n, "x", "clone", "string_or_numeric") };
-  return g.runKernel(se, e);
+  return g.runKernel(re, e);
 }
 const Gn = /* @__PURE__ */ F({ clone_: Un });
 /**
@@ -2721,10 +2728,10 @@ function zn(n, t = !1) {
  * limitations under the License.
  * =============================================================================
  */
-de();
+ge();
 const Wn = {
   buffer: On,
-  cast: Ft,
+  cast: $t,
   clone: Gn,
   print: zn
 };
@@ -2747,9 +2754,9 @@ un(Wn);
  */
 function jn(n, t) {
   let e = I(n, "a", "add"), s = I(t, "b", "add");
-  [e, s] = K(e, s);
+  [e, s] = V(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(ee, r);
+  return g.runKernel(ne, r);
 }
 const w = /* @__PURE__ */ F({ add_: jn });
 /**
@@ -2770,9 +2777,9 @@ const w = /* @__PURE__ */ F({ add_: jn });
  */
 function Kn(n, t) {
   let e = I(n, "a", "floorDiv"), s = I(t, "b", "floorDiv");
-  [e, s] = K(e, s);
+  [e, s] = V(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(je, r);
+  return g.runKernel(Ke, r);
 }
 const Vn = /* @__PURE__ */ F({ floorDiv_: Kn });
 /**
@@ -2793,10 +2800,10 @@ const Vn = /* @__PURE__ */ F({ floorDiv_: Kn });
  */
 function qn(n, t) {
   let e = I(n, "a", "div"), s = I(t, "b", "div");
-  if ([e, s] = K(e, s), e.dtype === "int32" && s.dtype === "int32")
+  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(ze, r, i);
+  return g.runKernel(We, r, i);
 }
 const D = /* @__PURE__ */ F({ div_: qn });
 /**
@@ -2817,9 +2824,9 @@ const D = /* @__PURE__ */ F({ div_: qn });
  */
 function Hn(n, t) {
   let e = I(n, "a", "mul"), s = I(t, "b", "mul");
-  [e, s] = K(e, s);
+  [e, s] = V(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(Ve, r);
+  return g.runKernel(qe, r);
 }
 const p = /* @__PURE__ */ F({ mul_: Hn });
 /**
@@ -2842,10 +2849,10 @@ function Jn(n) {
   const t = I(n, "x", "abs");
   if (t.dtype === "complex64") {
     const e = { x: t };
-    return g.runKernel(Ge, e);
+    return g.runKernel(ze, e);
   } else {
     const e = { x: t };
-    return g.runKernel(Ue, e);
+    return g.runKernel(Ge, e);
   }
 }
 const Xn = /* @__PURE__ */ F({ abs_: Jn });
@@ -2866,9 +2873,9 @@ const Xn = /* @__PURE__ */ F({ abs_: Jn });
  * =============================================================================
  */
 function Yn(n, t, e) {
-  Nt(n), e = e || mt(t);
+  Dt(n), e = e || mt(t);
   const s = { shape: n, value: t, dtype: e };
-  return g.runKernel(We, {}, s);
+  return g.runKernel(je, {}, s);
 }
 /**
  * @license
@@ -2886,7 +2893,7 @@ function Yn(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function Ys(n, t) {
+function Zs(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];
@@ -2930,7 +2937,7 @@ function Qn(n, t) {
  */
 function Zn(n) {
   const e = { x: I(n, "x", "zerosLike") };
-  return g.runKernel(Xe, e);
+  return g.runKernel(Ye, e);
 }
 const C = /* @__PURE__ */ F({ zerosLike_: Zn });
 /**
@@ -2951,11 +2958,11 @@ const C = /* @__PURE__ */ F({ zerosLike_: Zn });
  */
 function ts(n, t) {
   let e = I(n, "base", "pow"), s = I(t, "exp", "pow");
-  [e, s] = K(e, s);
+  [e, s] = V(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(qe, r);
+  return g.runKernel(He, r);
 }
-const Xt = /* @__PURE__ */ F({ pow_: ts });
+const Yt = /* @__PURE__ */ F({ pow_: ts });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2972,7 +2979,7 @@ const Xt = /* @__PURE__ */ F({ pow_: ts });
  * limitations under the License.
  * =============================================================================
  */
-function j(n, t) {
+function K(n, t) {
   if (($(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))
@@ -2997,7 +3004,7 @@ function j(n, t) {
  */
 function es(n) {
   const e = { x: I(n, "x", "sqrt", "float32") };
-  return g.runKernel(He, e);
+  return g.runKernel(Je, e);
 }
 const et = /* @__PURE__ */ F({ sqrt_: es });
 /**
@@ -3020,7 +3027,7 @@ function ns(n) {
   const t = I(n, "x", "square"), e = {};
   return g.runKernel("Square", { x: t }, e);
 }
-const G = /* @__PURE__ */ F({ square_: ns });
+const z = /* @__PURE__ */ F({ square_: ns });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3054,7 +3061,7 @@ function ss(n, t) {
     a[u] != null && (c[l.name] = a[u]);
   }), s?.forEach((l) => c[l.name] = null), { value: o, grads: c };
 }
-function Qs(n) {
+function tr(n) {
   return g.customGrad(n);
 }
 /**
@@ -3075,9 +3082,9 @@ function Qs(n) {
  */
 function rs(n, t) {
   let e = I(n, "a", "sub"), s = I(t, "b", "sub");
-  [e, s] = K(e, s);
+  [e, s] = V(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(Je, r);
+  return g.runKernel(Xe, r);
 }
 const Z = /* @__PURE__ */ F({ sub_: rs });
 /**
@@ -3098,9 +3105,9 @@ const Z = /* @__PURE__ */ F({ sub_: rs });
  */
 function is(n, t) {
   let e = I(n, "a", "maximum"), s = I(t, "b", "maximum");
-  [e, s] = K(e, s), e.dtype === "bool" && (e = Ft(e, "int32"), s = Ft(s, "int32")), Qn(e.shape, s.shape);
+  [e, s] = V(e, s), e.dtype === "bool" && (e = $t(e, "int32"), s = $t(s, "int32")), Qn(e.shape, s.shape);
   const r = { a: e, b: s };
-  return g.runKernel(Ke, r);
+  return g.runKernel(Ve, r);
 }
 const os = /* @__PURE__ */ F({ maximum_: is });
 /**
@@ -3148,7 +3155,7 @@ class cs {
     return new t(e);
   }
 }
-class O {
+class L {
   constructor() {
     this.classNameMap = {};
   }
@@ -3156,19 +3163,19 @@ class O {
    * Returns the singleton instance of the map.
    */
   static getMap() {
-    return O.instance == null && (O.instance = new O()), O.instance;
+    return L.instance == null && (L.instance = new L()), L.instance;
   }
   /**
    * Registers the class as serializable.
    */
   static register(t) {
-    O.getMap().classNameMap[t.className] = [t, t.fromConfig];
+    L.getMap().classNameMap[t.className] = [t, t.fromConfig];
   }
 }
 function us(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 O.register(n), as.set(r, n), ls.set(n, r), n;
+  return L.register(n), as.set(r, n), ls.set(n, r), n;
 }
 /**
  * @license
@@ -3186,7 +3193,7 @@ function us(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-class V extends cs {
+class q extends cs {
   /**
    * Executes `f()` and minimizes the scalar output of `f()` by computing
    * gradients of y with respect to the list of trainable variables provided by
@@ -3245,7 +3252,7 @@ class V extends cs {
     return this.iterations_ == null && (this.iterations_ = 0), {
       name: "iter",
       // TODO(cais): Use 'int64' type when available.
-      tensor: j(this.iterations_, "int32")
+      tensor: K(this.iterations_, "int32")
     };
   }
   async getWeights() {
@@ -3265,7 +3272,7 @@ class V extends cs {
     return this.iterations_ = (await t[0].tensor.data())[0], t.slice(1);
   }
 }
-Object.defineProperty(V, Symbol.hasInstance, {
+Object.defineProperty(q, Symbol.hasInstance, {
   value: (n) => n.minimize != null && n.computeGradients != null && n.applyGradients != null
 });
 /**
@@ -3284,7 +3291,7 @@ Object.defineProperty(V, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-class hs extends V {
+class hs extends q {
   /** @nocollapse */
   static get className() {
     return "Adadelta";
@@ -3307,7 +3314,7 @@ class hs extends V {
         return;
       const c = this.accumulatedGrads[r].variable, l = this.accumulatedUpdates[r].variable;
       E(() => {
-        const u = w(p(c, this.rho), p(G(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(G(h), 1 - this.rho));
+        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);
@@ -3360,7 +3367,7 @@ class hs extends V {
  * limitations under the License.
  * =============================================================================
  */
-class fs extends V {
+class fs extends q {
   /** @nocollapse */
   static get className() {
     return "Adagrad";
@@ -3380,7 +3387,7 @@ class fs extends V {
         return;
       const a = this.accumulatedGrads[r].variable;
       E(() => {
-        const c = w(a, G(o));
+        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);
@@ -3425,14 +3432,14 @@ class fs extends V {
  * limitations under the License.
  * =============================================================================
  */
-class ds extends V {
+class ds extends q {
   /** @nocollapse */
   static get className() {
     return "Adam";
   }
   constructor(t, e, s, r = null) {
     super(), this.learningRate = t, this.beta1 = e, this.beta2 = s, this.epsilon = r, this.accumulatedFirstMoment = [], this.accumulatedSecondMoment = [], E(() => {
-      this.accBeta1 = j(e).variable(), this.accBeta2 = j(s).variable();
+      this.accBeta1 = K(e).variable(), this.accBeta2 = K(s).variable();
     }), r == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
@@ -3451,7 +3458,7 @@ class ds extends V {
         const l = Array.isArray(t) ? t[o].tensor : t[i];
         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(G(l), 1 - this.beta2)), b = D(f, s), d = D(m, r);
+        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);
@@ -3467,7 +3474,7 @@ class ds extends V {
   }
   async setWeights(t) {
     t = await this.extractIterations(t), E(() => {
-      this.accBeta1.assign(Xt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Xt(this.beta2, this.iterations_ + 1));
+      this.accBeta1.assign(Yt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Yt(this.beta2, this.iterations_ + 1));
     });
     const e = t.length / 2, s = !1;
     this.accumulatedFirstMoment = t.slice(0, e).map((r) => ({
@@ -3507,14 +3514,14 @@ class ds extends V {
  * limitations under the License.
  * =============================================================================
  */
-class gs extends V {
+class gs extends q {
   /** @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(() => {
-      this.iteration = j(0).variable(), this.accBeta1 = j(e).variable();
+      this.iteration = K(0).variable(), this.accBeta1 = K(e).variable();
     }), r == null && (this.epsilon = g.backend.epsilon());
   }
   applyGradients(t) {
@@ -3579,7 +3586,7 @@ class gs extends V {
  * limitations under the License.
  * =============================================================================
  */
-class Ie extends V {
+class Te extends q {
   /** @nocollapse */
   static get className() {
     return "SGD";
@@ -3603,7 +3610,7 @@ class Ie extends V {
    * Sets the learning rate of the optimizer.
    */
   setLearningRate(t) {
-    this.learningRate = t, this.c != null && this.c.dispose(), this.c = kn(j(-t));
+    this.learningRate = t, this.c != null && this.c.dispose(), this.c = kn(K(-t));
   }
   dispose() {
     this.c.dispose();
@@ -3639,14 +3646,14 @@ class Ie extends V {
  * limitations under the License.
  * =============================================================================
  */
-class ms extends Ie {
+class ms extends Te {
   /** @nocollapse */
   // Name matters for Python compatibility.
   static get className() {
     return "Momentum";
   }
   constructor(t, e, s = !1) {
-    super(t), this.learningRate = t, this.momentum = e, this.useNesterov = s, this.accumulations = [], this.m = j(this.momentum);
+    super(t), this.learningRate = t, this.momentum = e, this.useNesterov = s, this.accumulations = [], this.m = K(this.momentum);
   }
   applyGradients(t) {
     (Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t)).forEach((s, r) => {
@@ -3710,7 +3717,7 @@ class ms extends Ie {
  * limitations under the License.
  * =============================================================================
  */
-class ps extends V {
+class ps extends q {
   /** @nocollapse */
   static get className() {
     return "RMSProp";
@@ -3737,14 +3744,14 @@ class ps extends V {
         return;
       const c = this.accumulatedMeanSquares[r].variable, l = this.accumulatedMoments[r].variable;
       E(() => {
-        const u = w(p(c, this.decay), p(G(a), 1 - this.decay));
+        const u = w(p(c, this.decay), p(z(a), 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(G(f), this.epsilon)))), b = w(p(l, this.momentum), m);
+          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);
         } else {
-          const h = w(p(c, this.decay), p(G(a), 1 - this.decay)), f = w(p(l, this.momentum), D(p(a, this.learningRate), et(w(h, this.epsilon))));
+          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);
@@ -3810,7 +3817,7 @@ const ys = [
   gs,
   ms,
   ps,
-  Ie
+  Te
 ];
 function bs() {
   for (const n of ys)
@@ -3837,50 +3844,52 @@ export {
   ds as A,
   Es as B,
   As as C,
-  Bs as D,
+  C as D,
   g as E,
-  $s as F,
+  zs as F,
   Ms as G,
-  Cs as H,
+  Bs as H,
   Fs as I,
-  Ps as J,
-  Os as K,
+  $s as J,
+  Cs as K,
   Rs as L,
   xs as M,
   Ns as N,
-  Us as O,
+  Ps as O,
   Ds as P,
-  Vs as Q,
+  Os as Q,
   _s as R,
   Ws as S,
-  Ks as T,
-  Ys as U,
-  Qn as V,
+  Us as T,
+  Vs as U,
+  Ks as V,
+  Zs as W,
+  Qn as X,
   qs as _,
-  Z as a,
-  K as b,
-  I as c,
-  Is as d,
-  Xs as e,
-  Js as f,
-  y as g,
-  Ls as h,
-  Ft as i,
-  Nt as j,
-  Qt as k,
-  U as l,
-  p as m,
-  Ne as n,
+  p as a,
+  Z as b,
+  Js as c,
+  I as d,
+  Ys as e,
+  V as f,
+  Is as g,
+  Xs as h,
+  y as i,
+  Ls as j,
+  $t as k,
+  Dt as l,
+  Qs as m,
+  Zt as n,
   F as o,
-  Gs as p,
-  vs as q,
+  G as p,
+  De as q,
   Hs as r,
-  j as s,
-  Ts as t,
-  w as u,
-  js as v,
-  Qs as w,
-  E as x,
-  zs as y,
-  C as z
+  K as s,
+  Gs as t,
+  vs as u,
+  Ts as v,
+  w,
+  js as x,
+  tr as y,
+  E as z
 };