@genai-fi/nanogpt 0.2.5 → 0.2.7

package/dist/{index-DcaSvB38.js → index-D1SlunD-.js}

@@ -1,6 +1,6 @@
-import { g as _t } from "./index-D5v913EJ.js";
-import { p as Y } from "./index-xuotMAFm.js";
-import { B as dt } from "./index-Tf7vU29b.js";
+import { g as Pt } from "./index-D5v913EJ.js";
+import { p as Q } from "./index-xuotMAFm.js";
+import { B as gt } from "./index-Tf7vU29b.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -17,8 +17,8 @@ import { B as dt } from "./index-Tf7vU29b.js";
  * limitations under the License.
  * =============================================================================
  */
-const ke = 1e-7, Te = 1e-4;
-class Ee {
+const Te = 1e-7, Ee = 1e-4;
+class Ae {
   refCount(t) {
     return v("refCount");
   }
@@ -64,7 +64,7 @@ class Ee {
   }
   /** Returns the smallest representable number.  */
   epsilon() {
-    return this.floatPrecision() === 32 ? ke : Te;
+    return this.floatPrecision() === 32 ? Te : Ee;
   }
   dispose() {
     return v("dispose");
@@ -89,12 +89,12 @@ function v(n) {
  * limitations under the License.
  * =============================================================================
  */
-function b(n, t) {
+function y(n, t) {
   if (!n)
     throw new Error(typeof t == "string" ? t : t());
 }
 function Is(n, t, e = "") {
-  b(Ft(n, t), () => e + ` Shapes ${n} and ${t} must match`);
+  y($t(n, t), () => e + ` Shapes ${n} and ${t} must match`);
 }
 function U(n) {
   if (n.length === 0)
@@ -104,7 +104,7 @@ function U(n) {
     t *= n[e];
   return t;
 }
-function Ft(n, t) {
+function $t(n, t) {
   if (n === t)
     return !0;
   if (n == null || t == null || n.length !== t.length)
@@ -114,10 +114,17 @@ function Ft(n, t) {
       return !1;
   return !0;
 }
+function Be(n) {
+  return n % 1 === 0;
+}
 function ct(n, t) {
   return t <= n.length ? n : n + " ".repeat(t - n.length);
 }
-function Be(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);
+}
+function ve(n, t) {
   let e = null;
   if (n == null || n === "float32")
     e = new Float32Array(t);
@@ -131,17 +138,17 @@ function Be(n, t) {
     throw new Error(`Unknown data type ${n}`);
   return e;
 }
-function Ae(n, t) {
+function Me(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 ve(n) {
+function Fe(n) {
   return n === "bool" || n === "complex64" || n === "float32" || n === "int32" || n === "string";
 }
-function wt(n) {
+function St(n) {
   if (n === "float32" || n === "int32")
     return 4;
   if (n === "complex64")
@@ -150,7 +157,7 @@ function wt(n) {
     return 1;
   throw new Error(`Unknown dtype ${n}`);
 }
-function Me(n) {
+function $e(n) {
   if (n == null)
     return 0;
   let t = 0;
@@ -159,16 +166,16 @@ function Me(n) {
 function Rt(n) {
   return typeof n == "string" || n instanceof String;
 }
-function Fe(n) {
+function Re(n) {
   return typeof n == "boolean";
 }
-function Re(n) {
+function xe(n) {
   return typeof n == "number";
 }
-function gt(n) {
-  return Array.isArray(n) ? gt(n[0]) : n instanceof Float32Array ? "float32" : n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray ? "int32" : Re(n) ? "float32" : Rt(n) ? "string" : Fe(n) ? "bool" : "float32";
+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";
 }
-function St(n) {
+function kt(n) {
   return !!(n && n.constructor && n.call && n.apply);
 }
 function xt(n) {
@@ -181,7 +188,7 @@ function xt(n) {
     e[s] = e[s + 1] * n[s + 1];
   return e;
 }
-function Xt(n, t, e, s = !1) {
+function Yt(n, t, e, s = !1) {
   const r = new Array();
   if (t.length === 1) {
     const i = t[0] * (s ? 2 : 1);
@@ -190,11 +197,11 @@ function Xt(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] = Xt(n + c * a, o, e, s);
+      r[c] = Yt(n + c * a, o, e, s);
   }
   return r;
 }
-function Pt(n, t, e = !1) {
+function Ot(n, t, e = !1) {
   if (n.length === 0)
     return t[0];
   const s = n.reduce((r, i) => r * i) * (e ? 2 : 1);
@@ -202,15 +209,15 @@ function Pt(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 Xt(0, n, t, e);
+  return Yt(0, n, t, e);
 }
-function xe(n, t) {
-  const e = Yt(n, t);
+function Ne(n, t) {
+  const e = Qt(n, t);
   for (let s = 0; s < e.length; s++)
     e[s] = 1;
   return e;
 }
-function Yt(n, t) {
+function Qt(n, t) {
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(n);
   if (t === "int32")
@@ -219,12 +226,12 @@ function Yt(n, t) {
     return new Uint8Array(n);
   throw new Error(`Unknown data type ${t}`);
 }
-function $t(n) {
+function Nt(n) {
   n.forEach((t) => {
-    b(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${n}].`);
+    y(Number.isInteger(t) && t >= 0, () => `Tensor must have a shape comprised of positive integers but got shape [${n}].`);
   });
 }
-function Nt(n) {
+function Dt(n) {
   return n && n.then && typeof n.then == "function";
 }
 /**
@@ -243,11 +250,11 @@ function Nt(n) {
  * limitations under the License.
  * =============================================================================
  */
-const Ot = "tfjsflags";
-class $e {
+const Lt = "tfjsflags";
+class De {
   // tslint:disable-next-line: no-any
   constructor(t) {
-    this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = Ne, this.populateURLFlags();
+    this.global = t, this.flags = {}, this.flagRegistry = {}, this.urlFlags = {}, this.getQueryParams = Ce, 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;
@@ -265,7 +272,7 @@ class $e {
     if (t in this.flags)
       return this.flags[t];
     const e = this.evaluateFlag(t);
-    if (Nt(e))
+    if (Dt(e))
       throw new Error(`Flag ${t} cannot be synchronously evaluated. Please use getAsync() instead.`);
     return this.flags[t] = e, this.flags[t];
   }
@@ -305,29 +312,29 @@ class $e {
     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);
-    Ot in t && t[Ot].split(",").forEach((s) => {
+    Lt in t && t[Lt].split(",").forEach((s) => {
       const [r, i] = s.split(":");
-      this.urlFlags[r] = Ce(r, i);
+      this.urlFlags[r] = Pe(r, i);
     });
   }
 }
-function Ne(n) {
+function Ce(n) {
   const t = {};
-  return n.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (e, ...s) => (De(t, s[0], s[1]), s.join("="))), t;
+  return n.replace(/[?&]([^=?&]+)(?:=([^&]*))?/g, (e, ...s) => (_e(t, s[0], s[1]), s.join("="))), t;
 }
-function De(n, t, e) {
+function _e(n, t, e) {
   n[decodeURIComponent(t)] = decodeURIComponent(e || "");
 }
-function Ce(n, t) {
+function Pe(n, t) {
   const e = t.toLowerCase();
   return e === "true" || e === "false" ? e === "true" : `${+e}` === e ? +e : t;
 }
 function S() {
-  return Qt;
+  return Zt;
 }
-let Qt = null;
-function _e(n) {
-  Qt = n;
+let Zt = null;
+function Oe(n) {
+  Zt = n;
 }
 /**
  * @license
@@ -345,30 +352,30 @@ function _e(n) {
  * limitations under the License.
  * =============================================================================
  */
-let mt;
-function Zt() {
-  if (mt == null) {
+let pt;
+function te() {
+  if (pt == null) {
     let n;
     if (typeof window < "u")
       n = window;
-    else if (typeof _t < "u")
-      n = _t;
-    else if (typeof Y < "u")
-      n = Y;
+    else if (typeof Pt < "u")
+      n = Pt;
+    else if (typeof Q < "u")
+      n = Q;
     else if (typeof self < "u")
       n = self;
     else
       throw new Error("Could not find a global object");
-    mt = n;
+    pt = n;
   }
-  return mt;
+  return pt;
 }
-function Pe() {
-  const n = Zt();
+function Le() {
+  const n = te();
   return n._tfGlobals == null && (n._tfGlobals = /* @__PURE__ */ new Map()), n._tfGlobals;
 }
-function Dt(n, t) {
-  const e = Pe();
+function Ct(n, t) {
+  const e = Le();
   if (e.has(n))
     return e.get(n);
   {
@@ -376,7 +383,7 @@ function Dt(n, t) {
     return e.set(n, s), e.get(n);
   }
 }
-const Oe = "Abs", te = "Add", ks = "BatchMatMul", ee = "Cast", Ts = "Complex", Le = "ComplexAbs", Ue = "RealDiv", Es = "Elu", Ge = "Fill", ze = "FloorDiv", ne = "Identity", Bs = "Imag", As = "LeakyRelu", We = "Maximum", je = "Multiply", vs = "Neg", Ke = "Pow", Ms = "Prelu", Fs = "Real", Rs = "Relu", xs = "Reshape", $s = "Relu6", Ns = "Sigmoid", Ve = "Sqrt", Ds = "Sum", qe = "Sub", Cs = "Transpose", He = "ZerosLike", _s = "Step", Ps = "_FusedMatMul";
+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";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -393,7 +400,7 @@ const Oe = "Abs", te = "Add", ks = "BatchMatMul", ee = "Cast", Ts = "Complex", L
  * limitations under the License.
  * =============================================================================
  */
-function st(...n) {
+function J(...n) {
   S().getBool("IS_TEST") || S().getBool("PROD") || console.warn(...n);
 }
 /**
@@ -412,16 +419,16 @@ function st(...n) {
  * limitations under the License.
  * =============================================================================
  */
-const se = Dt("kernelRegistry", () => /* @__PURE__ */ new Map()), Je = Dt("gradRegistry", () => /* @__PURE__ */ new Map());
-function Lt(n, t) {
-  const e = Xe(n, t);
-  return se.get(e);
-}
-function Ut(n) {
-  return Je.get(n);
+const ht = Ct("kernelRegistry", () => /* @__PURE__ */ new Map()), Ye = Ct("gradRegistry", () => /* @__PURE__ */ new Map());
+function Ut(n, t) {
+  const e = re(n, t);
+  return ht.get(e);
 }
 function Gt(n) {
-  const t = se.entries(), e = [];
+  return Ye.get(n);
+}
+function zt(n) {
+  const t = ht.entries(), e = [];
   for (; ; ) {
     const { done: s, value: r } = t.next();
     if (s)
@@ -431,7 +438,11 @@ function Gt(n) {
   }
   return e;
 }
-function Xe(n, t) {
+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);
+}
+function re(n, t) {
   return `${t}_${n}`;
 }
 /**
@@ -450,7 +461,7 @@ function Xe(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function re(n) {
+function ie(n) {
   return n instanceof Float32Array || n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray;
 }
 /**
@@ -469,13 +480,13 @@ function re(n) {
  * limitations under the License.
  * =============================================================================
  */
-function Ye(n, t) {
+function Qe(n, t) {
   return n instanceof Float32Array && t === "float32" || n instanceof Int32Array && t === "int32" || n instanceof Uint8Array && t === "bool";
 }
-function ie(n, t) {
+function oe(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") && Ae(n, t), Ye(n, t))
+  if (Array.isArray(n) && (n = at(n)), S().getBool("DEBUG") && Me(n, t), Qe(n, t))
     return n;
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(n);
@@ -489,22 +500,22 @@ function ie(n, t) {
   } else
     throw new Error(`Unknown data type ${t}`);
 }
-function ht() {
+function ft() {
   return S().platform.now();
 }
-function Qe(n, t = "utf-8") {
+function Ze(n, t = "utf-8") {
   return t = t || "utf-8", S().platform.encode(n, t);
 }
-function zt(n, t = "utf-8") {
+function Wt(n, t = "utf-8") {
   return t = t || "utf-8", S().platform.decode(n, t);
 }
-function R(n) {
-  return S().platform.isTypedArray != null ? S().platform.isTypedArray(n) : re(n);
+function $(n) {
+  return S().platform.isTypedArray != null ? S().platform.isTypedArray(n) : ie(n);
 }
 function at(n, t = [], e = !1) {
-  if (t == null && (t = []), typeof n == "boolean" || typeof n == "number" || typeof n == "string" || Nt(n) || n == null || R(n) && e)
+  if (t == null && (t = []), typeof n == "boolean" || typeof n == "number" || typeof n == "string" || Dt(n) || n == null || $(n) && e)
     t.push(n);
-  else if (Array.isArray(n) || R(n))
+  else if (Array.isArray(n) || $(n))
     for (let s = 0; s < n.length; ++s)
       at(n[s], t, e);
   else {
@@ -532,9 +543,9 @@ function at(n, t = [], e = !1) {
  * limitations under the License.
  * =============================================================================
  */
-class Ze {
+class tn {
   constructor(t, e) {
-    this.backendTimer = t, this.logger = e, e == null && (this.logger = new en());
+    this.backendTimer = t, this.logger = e, e == null && (this.logger = new nn());
   }
   profileKernel(t, e, s) {
     let r;
@@ -542,20 +553,20 @@ class Ze {
       r = s();
     };
     let o;
-    const a = ht();
+    const a = ft();
     if (this.backendTimer.timerAvailable())
       o = this.backendTimer.time(i);
     else {
       i();
       for (const l of r)
         l.dataSync();
-      o = Promise.resolve({ kernelMs: ht() - a });
+      o = Promise.resolve({ kernelMs: ft() - a });
     }
     if (S().getBool("CHECK_COMPUTATION_FOR_ERRORS"))
       for (let l = 0; l < r.length; l++) {
         const u = r[l];
         u.data().then((h) => {
-          tn(h, u.dtype, t);
+          en(h, u.dtype, t);
         });
       }
     return {
@@ -575,7 +586,7 @@ class Ze {
     });
   }
 }
-function tn(n, t, e) {
+function en(n, t, e) {
   if (t !== "float32")
     return !1;
   for (let s = 0; s < n.length; s++) {
@@ -585,15 +596,15 @@ function tn(n, t, e) {
   }
   return !1;
 }
-class en {
+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 y = i[m];
-      if (y != null) {
-        const d = y.shape || e.shape, I = d.length;
-        f += `${m}: ${I}D ${I > 0 ? d : ""} `;
+      const b = i[m];
+      if (b != null) {
+        const d = b.shape || e.shape, k = d.length;
+        f += `${m}: ${k}D ${k > 0 ? d : ""} `;
       }
     }
     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");
@@ -615,7 +626,7 @@ class en {
  * limitations under the License.
  * =============================================================================
  */
-function nn(n, t, e) {
+function sn(n, t, e) {
   const s = {}, r = {};
   for (let c = 0; c < t.length; c++)
     s[t[c].id] = !0;
@@ -624,7 +635,7 @@ function nn(n, t, e) {
     for (const h in u) {
       const f = u[h];
       let m = !1;
-      for (let y = 0; y < t.length; y++)
+      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;
           break;
@@ -660,7 +671,7 @@ function nn(n, t, e) {
   }
   return a;
 }
-function sn(n, t, e, s) {
+function rn(n, t, e, s) {
   for (let r = t.length - 1; r >= 0; r--) {
     const i = t[r], o = [];
     if (i.outputs.forEach((c) => {
@@ -676,7 +687,7 @@ function sn(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 (!Ft(l.shape, u.shape))
+      if (!$t(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;
@@ -703,14 +714,14 @@ function sn(n, t, e, s) {
  * limitations under the License.
  * =============================================================================
  */
-const Wt = 20, rt = 3, pt = 7;
-function rn(n, t, e, s) {
-  const r = xt(t), i = on(n, t, e, r), o = t.length, a = ut(n, t, e, r, i), c = ["Tensor"];
+const jt = 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"];
   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 on(n, t, e, s) {
+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;
   if (a > 1)
     for (let l = 0; l < r / i; l++) {
@@ -722,9 +733,9 @@ function on(n, t, e, s) {
 }
 function it(n, t, e) {
   let s;
-  return Array.isArray(n) ? s = `${parseFloat(n[0].toFixed(pt))} + ${parseFloat(n[1].toFixed(pt))}j` : Rt(n) ? s = `'${n}'` : e === "bool" ? s = oe(n) : s = parseFloat(n.toFixed(pt)).toString(), ct(s, t);
+  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);
 }
-function oe(n) {
+function ae(n) {
   return n === 0 ? "false" : "true";
 }
 function ut(n, t, e, s, r, i = !0) {
@@ -734,26 +745,26 @@ function ut(n, t, e, s, r, i = !0) {
       const d = ot(n);
       return [it(d[0], 0, e)];
     }
-    return e === "bool" ? [oe(n[0])] : [n[0].toString()];
+    return e === "bool" ? [ae(n[0])] : [n[0].toString()];
   }
   if (c === 1) {
-    if (a > Wt) {
-      const I = rt * o;
-      let T = Array.from(n.slice(0, I)), et = Array.from(n.slice((a - rt) * o, a * o));
-      return e === "complex64" && (T = ot(T), et = ot(et)), [
-        "[" + T.map((q, H) => it(q, r[H], e)).join(", ") + ", ..., " + et.map((q, H) => it(q, r[a - rt + H], e)).join(", ") + "]"
+    if (a > jt) {
+      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(", ") + "]"
       ];
     }
     return [
-      "[" + (e === "complex64" ? ot(n) : Array.from(n)).map((I, T) => it(I, r[T], e)).join(", ") + "]"
+      "[" + (e === "complex64" ? ot(n) : Array.from(n)).map((k, T) => it(k, r[T], e)).join(", ") + "]"
     ];
   }
   const l = t.slice(1), u = s.slice(1), h = s[0] * o, f = [];
-  if (a > Wt) {
+  if (a > jt) {
     for (let d = 0; d < rt; d++) {
-      const I = d * h, T = I + h;
+      const k = d * h, T = k + h;
       f.push(...ut(
-        n.slice(I, T),
+        n.slice(k, T),
         l,
         e,
         u,
@@ -764,9 +775,9 @@ function ut(n, t, e, s, r, i = !0) {
     }
     f.push("...");
     for (let d = a - rt; d < a; d++) {
-      const I = d * h, T = I + h;
+      const k = d * h, T = k + h;
       f.push(...ut(
-        n.slice(I, T),
+        n.slice(k, T),
         l,
         e,
         u,
@@ -777,9 +788,9 @@ function ut(n, t, e, s, r, i = !0) {
     }
   } else
     for (let d = 0; d < a; d++) {
-      const I = d * h, T = I + h;
+      const k = d * h, T = k + h;
       f.push(...ut(
-        n.slice(I, T),
+        n.slice(k, T),
         l,
         e,
         u,
@@ -792,12 +803,12 @@ function ut(n, t, e, s, r, i = !0) {
   f[0] = "[" + (a > 0 ? f[0] + m : "");
   for (let d = 1; d < f.length - 1; d++)
     f[d] = " " + f[d] + m;
-  let y = `,
+  let b = `,
 `;
   for (let d = 2; d < c; d++)
-    y += `
+    b += `
 `;
-  return f[f.length - 1] = " " + f[f.length - 1] + "]" + (i ? "" : y), f;
+  return f[f.length - 1] = " " + f[f.length - 1] + "]" + (i ? "" : b), f;
 }
 function ot(n) {
   const t = [];
@@ -821,15 +832,15 @@ function ot(n) {
  * limitations under the License.
  * =============================================================================
  */
-class an {
+class ln {
   constructor(t, e, s) {
     if (this.dtype = e, this.shape = t.slice(), this.size = U(t), s != null) {
       const r = s.length;
-      b(r === this.size, () => `Length of values '${r}' does not match the size inferred by the shape '${this.size}'.`);
+      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 || Be(e, this.size), this.strides = xt(t);
+    this.values = s || ve(e, this.size), this.strides = xt(t);
   }
   /**
    * Sets a value in the buffer at a given location.
@@ -840,7 +851,7 @@ class an {
    * @doc {heading: 'Tensors', subheading: 'Creation'}
    */
   set(t, ...e) {
-    e.length === 0 && (e = [0]), b(e.length === this.rank, () => `The number of provided coordinates (${e.length}) must match the rank (${this.rank})`);
+    e.length === 0 && (e = [0]), y(e.length === this.rank, () => `The number of provided coordinates (${e.length}) must match the rank (${this.rank})`);
     const s = this.locToIndex(e);
     this.values[s] = t;
   }
@@ -895,17 +906,17 @@ class an {
    * @doc {heading: 'Tensors', subheading: 'Creation'}
    */
   toTensor() {
-    return x().makeTensor(this.values, this.shape, this.dtype);
+    return R().makeTensor(this.values, this.shape, this.dtype);
   }
 }
-let x = null, J = null;
-function ln(n) {
-  x = n;
-}
+let R = null, X = null;
 function cn(n) {
-  J = n;
+  R = n;
 }
-class $ {
+function un(n) {
+  X = 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";
   }
@@ -919,14 +930,14 @@ class $ {
    */
   async buffer() {
     const t = await this.data();
-    return J.buffer(this.shape, this.dtype, t);
+    return X.buffer(this.shape, this.dtype, t);
   }
   /**
    * Returns a `tf.TensorBuffer` that holds the underlying data.
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   bufferSync() {
-    return J.buffer(this.shape, this.dtype, this.dataSync());
+    return X.buffer(this.shape, this.dtype, this.dataSync());
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -936,7 +947,7 @@ class $ {
    */
   async array() {
     const t = await this.data();
-    return Pt(this.shape, t, this.dtype === "complex64");
+    return Ot(this.shape, t, this.dtype === "complex64");
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -945,7 +956,7 @@ class $ {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   arraySync() {
-    return Pt(this.shape, this.dataSync(), this.dtype === "complex64");
+    return Ot(this.shape, this.dataSync(), this.dtype === "complex64");
   }
   /**
    * Asynchronously downloads the values from the `tf.Tensor`. Returns a
@@ -955,11 +966,11 @@ class $ {
    */
   async data() {
     this.throwIfDisposed();
-    const t = x().read(this.dataId);
+    const t = R().read(this.dataId);
     if (this.dtype === "string") {
       const e = await t;
       try {
-        return e.map((s) => zt(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().");
       }
@@ -1001,7 +1012,7 @@ class $ {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dataToGPU(t) {
-    return this.throwIfDisposed(), x().readToGPU(this.dataId, t);
+    return this.throwIfDisposed(), R().readToGPU(this.dataId, t);
   }
   /**
    * Synchronously downloads the values from the `tf.Tensor`. This blocks the
@@ -1011,10 +1022,10 @@ class $ {
    */
   dataSync() {
     this.throwIfDisposed();
-    const t = x().readSync(this.dataId);
+    const t = R().readSync(this.dataId);
     if (this.dtype === "string")
       try {
-        return t.map((e) => zt(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().");
       }
@@ -1023,7 +1034,7 @@ class $ {
   /** Returns the underlying bytes of the tensor's data. */
   async bytes() {
     this.throwIfDisposed();
-    const t = await x().read(this.dataId);
+    const t = await R().read(this.dataId);
     return this.dtype === "string" ? t : new Uint8Array(t.buffer);
   }
   /**
@@ -1032,7 +1043,7 @@ class $ {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   dispose() {
-    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), x().disposeTensor(this), this.isDisposedInternal = !0);
+    this.isDisposed || (this.kerasMask && this.kerasMask.dispose(), R().disposeTensor(this), this.isDisposedInternal = !0);
   }
   get isDisposed() {
     return this.isDisposedInternal;
@@ -1050,14 +1061,14 @@ class $ {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   print(t = !1) {
-    return J.print(this, t);
+    return X.print(this, t);
   }
   /**
    * Returns a copy of the tensor. See `tf.clone` for details.
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   clone() {
-    return this.throwIfDisposed(), J.clone(this);
+    return this.throwIfDisposed(), X.clone(this);
   }
   /**
    * Returns a human-readable description of the tensor. Useful for logging.
@@ -1066,23 +1077,23 @@ class $ {
    */
   toString(t = !1) {
     const e = this.dataSync();
-    return rn(e, this.shape, this.dtype, t);
+    return on(e, this.shape, this.dtype, t);
   }
   cast(t) {
-    return this.throwIfDisposed(), J.cast(this, t);
+    return this.throwIfDisposed(), X.cast(this, t);
   }
   variable(t = !0, e, s) {
-    return this.throwIfDisposed(), x().makeVariable(this, t, e, s);
+    return this.throwIfDisposed(), R().makeVariable(this, t, e, s);
   }
 }
-Object.defineProperty($, Symbol.hasInstance, {
+Object.defineProperty(x, Symbol.hasInstance, {
   value: (n) => !!n && n.data != null && n.dataSync != null && n.throwIfDisposed != null
 });
-function ae() {
-  return Dt("Tensor", () => $);
+function le() {
+  return Ct("Tensor", () => x);
 }
-ae();
-class ft extends $ {
+le();
+class dt extends x {
   constructor(t, e, s, r) {
     super(t.shape, t.dtype, t.dataId, r), this.trainable = e, this.name = s;
   }
@@ -1097,20 +1108,20 @@ class ft extends $ {
   assign(t) {
     if (t.dtype !== this.dtype)
       throw new Error(`dtype of the new value (${t.dtype}) and previous value (${this.dtype}) must match`);
-    if (!Ft(t.shape, this.shape))
+    if (!$t(t.shape, this.shape))
       throw new Error(`shape of the new value (${t.shape}) and previous value (${this.shape}) must match`);
-    x().disposeTensor(this), this.dataId = t.dataId, x().incRef(
+    R().disposeTensor(this), this.dataId = t.dataId, R().incRef(
       this,
       null
       /* backend */
     );
   }
   dispose() {
-    x().disposeVariable(this), this.isDisposedInternal = !0;
+    R().disposeVariable(this), this.isDisposedInternal = !0;
   }
 }
-Object.defineProperty(ft, Symbol.hasInstance, {
-  value: (n) => n instanceof $ && n.assign != null && n.assign instanceof Function
+Object.defineProperty(dt, Symbol.hasInstance, {
+  value: (n) => n instanceof x && n.assign != null && n.assign instanceof Function
 });
 /**
  * @license
@@ -1128,44 +1139,44 @@ Object.defineProperty(ft, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-var jt;
+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";
-})(jt || (jt = {}));
+})(Kt || (Kt = {}));
 var It;
 (function(n) {
   n.float32 = "float32", n.int32 = "int32", n.bool = "int32", n.complex64 = "complex64";
 })(It || (It = {}));
-var kt;
-(function(n) {
-  n.float32 = "float32", n.int32 = "int32", n.bool = "bool", n.complex64 = "complex64";
-})(kt || (kt = {}));
 var Tt;
 (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";
 })(Tt || (Tt = {}));
 var Et;
 (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";
 })(Et || (Et = {}));
-const un = {
-  float32: Tt,
+var At;
+(function(n) {
+  n.float32 = "complex64", n.int32 = "complex64", n.bool = "complex64", n.complex64 = "complex64";
+})(At || (At = {}));
+const hn = {
+  float32: Et,
   int32: It,
-  bool: kt,
-  complex64: Et
+  bool: Tt,
+  complex64: At
 };
-function hn(n, t) {
+function fn(n, t) {
   if (n === "string" || t === "string") {
     if (n === "string" && t === "string")
       return "string";
     throw new Error(`Can not upcast ${n} with ${t}`);
   }
-  return un[n][t];
+  return hn[n][t];
 }
-function le(n) {
+function ce(n) {
   return n != null && typeof n == "object" && "texture" in n && n.texture instanceof WebGLTexture;
 }
-function ce(n) {
+function ue(n) {
   return typeof GPUBuffer < "u" && n != null && typeof n == "object" && "buffer" in n && n.buffer instanceof GPUBuffer;
 }
 /**
@@ -1187,29 +1198,29 @@ function ce(n) {
 function K(n, t) {
   if (n.dtype === t.dtype)
     return [n, t];
-  const e = hn(n.dtype, t.dtype);
+  const e = fn(n.dtype, t.dtype);
   return [n.cast(e), t.cast(e)];
 }
-function ue(n) {
+function he(n) {
   const t = [];
-  return he(n, t, /* @__PURE__ */ new Set()), t;
+  return fe(n, t, /* @__PURE__ */ new Set()), t;
 }
-function he(n, t, e) {
+function fe(n, t, e) {
   if (n == null)
     return;
-  if (n instanceof $) {
+  if (n instanceof x) {
     t.push(n);
     return;
   }
-  if (!fn(n))
+  if (!dn(n))
     return;
   const s = n;
   for (const r in s) {
     const i = s[r];
-    e.has(i) || (e.add(i), he(i, t, e));
+    e.has(i) || (e.add(i), fe(i, t, e));
   }
 }
-function fn(n) {
+function dn(n) {
   return Array.isArray(n) || typeof n == "object";
 }
 /**
@@ -1228,10 +1239,10 @@ function fn(n) {
  * limitations under the License.
  * =============================================================================
  */
-function yt(n) {
+function bt(n) {
   return n.kernelName != null;
 }
-class Kt {
+class Vt {
   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,
@@ -1249,9 +1260,9 @@ class Kt {
       this.registeredVariables[t].dispose();
   }
 }
-class Z {
+class tt {
   constructor(t) {
-    this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new Kt();
+    this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new Vt();
   }
   async ready() {
     if (this.pendingBackendInit != null)
@@ -1297,7 +1308,7 @@ class Z {
     return t in this.registryFactory ? this.registryFactory[t].factory : null;
   }
   registerBackend(t, e, s = 1) {
-    return t in this.registryFactory ? (st(`${t} backend was already registered. Reusing existing backend factory.`), !1) : (this.registryFactory[t] = { factory: e, priority: s }, !0);
+    return t in this.registryFactory ? (J(`${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)
@@ -1308,15 +1319,15 @@ class Z {
       if (!(s ? await e : e))
         return !1;
     }
-    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new Ze(this.backendInstance), !0;
+    return this.backendInstance = this.registry[t], this.setupRegisteredKernels(), this.profiler = new tn(this.backendInstance), !0;
   }
   setupRegisteredKernels() {
-    Gt(this.backendName).forEach((e) => {
+    zt(this.backendName).forEach((e) => {
       e.setupFunc != null && e.setupFunc(this.backendInstance);
     });
   }
   disposeRegisteredKernels(t) {
-    Gt(t).forEach((s) => {
+    zt(t).forEach((s) => {
       s.disposeFunc != null && s.disposeFunc(this.registry[t]);
     });
   }
@@ -1332,13 +1343,13 @@ class Z {
       throw new Error(`Cannot initialize backend ${t}, no registration found.`);
     try {
       const s = e.factory();
-      if (s && !(s instanceof Ee) && 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, st(`Initialization of backend ${t} failed`), st(o.stack || o.message)), !1));
+      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));
         return this.pendingBackendInit = i, { success: i, asyncInit: !0 };
       } else
         return this.registry[t] = s, { success: !0, asyncInit: !1 };
     } catch (s) {
-      return st(`Initialization of backend ${t} failed`), st(s.stack || s.message), { success: !1, asyncInit: !1 };
+      return J(`Initialization of backend ${t} failed`), J(s.stack || s.message), { success: !1, asyncInit: !1 };
     }
   }
   removeBackend(t) {
@@ -1390,10 +1401,10 @@ class Z {
     }
   }
   nextTensorId() {
-    return Z.nextTensorId++;
+    return tt.nextTensorId++;
   }
   nextVariableId() {
-    return Z.nextVariableId++;
+    return tt.nextVariableId++;
   }
   /**
    * This method is called instead of the public-facing tensor.clone() when
@@ -1402,11 +1413,11 @@ class Z {
    * execution.
    */
   clone(t) {
-    const e = g.runKernel(ne, { x: t }), s = { x: t }, r = (o) => ({
+    const e = g.runKernel(se, { x: t }), s = { x: t }, r = (o) => ({
       x: () => {
         const a = "float32", c = { x: o }, l = { dtype: a };
         return g.runKernel(
-          ee,
+          ne,
           c,
           // tslint:disable-next-line: no-unnecessary-type-assertion
           l
@@ -1429,7 +1440,7 @@ class Z {
    * tensors are not visible to the user.
    */
   runKernel(t, e, s) {
-    if (this.backendName == null && this.backend, !(Lt(t, this.backendName) != null))
+    if (this.backendName == null && this.backend, !(Ut(t, this.backendName) != null))
       throw new Error(`Kernel '${t}' not registered for backend '${this.backendName}'`);
     return this.runKernelFunc({ kernelName: t, inputs: e, attrs: s });
   }
@@ -1458,35 +1469,35 @@ class Z {
     let a;
     this.backendName == null && this.backend;
     let c;
-    const l = yt(t) ? t.kernelName : this.state.activeScope != null ? this.state.activeScope.name : "";
-    if (yt(t)) {
-      const { kernelName: y, inputs: d, attrs: I } = t;
+    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;
       this.backendName == null && this.backend;
-      const T = Lt(y, this.backendName);
-      b(T != null, () => `Cannot find registered kernel '${y}' for backend '${this.backendName}'`), a = () => {
-        const et = this.backend.numDataIds();
-        c = T.kernelFunc({ inputs: d, attrs: I, backend: this.backend });
+      const T = Ut(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(y, et, q);
-        const H = q.map((nt) => nt.rank != null ? nt : this.makeTensorFromTensorInfo(nt));
+        this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(b, nt, q);
+        const H = q.map((st) => st.rank != null ? st : this.makeTensorFromTensorInfo(st));
         if (r) {
-          const nt = this.getTensorsForGradient(y, d, H);
-          s = this.saveTensorsForBackwardMode(nt);
+          const st = this.getTensorsForGradient(b, d, H);
+          s = this.saveTensorsForBackwardMode(st);
         }
         return H;
       };
     } else {
-      const { forwardFunc: y } = t, d = (I) => {
-        r && (s = I.map((T) => this.keep(this.clone(T))));
+      const { forwardFunc: b } = t, d = (k) => {
+        r && (s = k.map((T) => this.keep(this.clone(T))));
       };
       a = () => {
-        const I = this.backend.numDataIds();
-        c = this.tidy(() => y(this.backend, d));
+        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, I, T), T;
+        return this.shouldCheckForMemLeaks() && this.checkKernelForMemLeak(l, k, T), T;
       };
     }
-    const { inputs: u, attrs: h } = t, f = yt(t) ? null : t.backwardsFunc;
+    const { inputs: u, attrs: h } = t, f = bt(t) ? null : t.backwardsFunc;
     let m;
     return this.scopedRun(
       // Stop recording to a tape when running a kernel.
@@ -1501,8 +1512,8 @@ class Z {
       totalBytesSnapshot: this.state.numBytes,
       tensorsAdded: this.state.numTensors - o,
       totalTensorsSnapshot: this.state.numTensors,
-      inputShapes: Object.keys(u).map((y) => u[y] != null ? u[y].shape : null),
-      outputShapes: e.map((y) => y.shape),
+      inputShapes: Object.keys(u).map((b) => u[b] != null ? u[b].shape : null),
+      outputShapes: e.map((b) => b.shape),
       kernelTimeMs: m.timeMs,
       extraInfo: m.extraInfo
     }), Array.isArray(c) ? e : e[0];
@@ -1523,11 +1534,11 @@ class Z {
    * @param outputs an array of output tensors from forward mode of kernel.
    */
   getTensorsForGradient(t, e, s) {
-    const r = Ut(t);
+    const r = Gt(t);
     if (r != null) {
       const i = r.inputsToSave || [], o = r.outputsToSave || [];
       let a;
-      r.saveAllInputs ? (b(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]);
+      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 c = s.filter((l, u) => o[u]);
       return a.concat(c);
     }
@@ -1543,10 +1554,10 @@ class Z {
       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) => Qe(c)));
-    const o = r.write(i, e, s), a = new $(e, s, o, this.nextTensorId());
+    s === "string" && Rt(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 = Me(i);
+      const c = this.state.tensorInfo.get(o), l = $e(i);
       this.state.numBytes += l - c.bytes, c.bytes = l;
     }
     return a;
@@ -1568,12 +1579,12 @@ class Z {
    * only increments the ref count used in memory tracking.
    */
   makeTensorFromTensorInfo(t, e) {
-    const { dataId: s, shape: r, dtype: i } = t, o = new $(r, i, s, this.nextTensorId());
+    const { dataId: s, shape: r, dtype: i } = t, o = new x(r, i, 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 ft(t, e, s, this.nextTensorId());
+    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;
@@ -1581,12 +1592,12 @@ class Z {
   trackTensor(t, e) {
     this.state.numTensors++, t.dtype === "string" && this.state.numStringTensors++;
     let s = 0;
-    t.dtype !== "complex64" && t.dtype !== "string" && (s = t.size * wt(t.dtype)), this.state.numBytes += s, this.state.tensorInfo.has(t.dataId) || (this.state.numDataBuffers++, this.state.tensorInfo.set(t.dataId, {
+    t.dtype !== "complex64" && t.dtype !== "string" && (s = t.size * St(t.dtype)), this.state.numBytes += s, this.state.tensorInfo.has(t.dataId) || (this.state.numDataBuffers++, this.state.tensorInfo.set(t.dataId, {
       backend: e || this.backend,
       dtype: t.dtype,
       shape: t.shape,
       bytes: s
-    })), t instanceof ft || this.track(t);
+    })), t instanceof dt || this.track(t);
   }
   // Track the tensor by dataId and increase the refCount for the dataId in the
   // backend.
@@ -1604,7 +1615,7 @@ class Z {
       return;
     const e = this.state.tensorInfo.get(t.dataId);
     if (this.state.numTensors--, t.dtype === "string" && (this.state.numStringTensors--, this.state.numBytes -= e.bytes), t.dtype !== "complex64" && t.dtype !== "string") {
-      const s = t.size * wt(t.dtype);
+      const s = t.size * St(t.dtype);
       this.state.numBytes -= s;
     }
     e.backend.disposeData(t.dataId) && this.removeDataId(t.dataId, e.backend);
@@ -1634,10 +1645,10 @@ class Z {
     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 = Ut(t);
+    const a = { id: this.state.nextTapeNodeId++, kernelName: t, inputs: e, outputs: s, saved: i }, c = Gt(t);
     c != null && (r = c.gradFunc), r != null && (a.gradient = (l) => (l = l.map((u, h) => {
       if (u == null) {
-        const f = s[h], m = Yt(f.size, f.dtype);
+        const f = s[h], m = Qt(f.size, f.dtype);
         return this.makeTensor(m, f.shape, f.dtype);
       }
       return u;
@@ -1669,7 +1680,7 @@ class Z {
    * as scope() without the need for a function closure.
    */
   endScope(t) {
-    const e = ue(t), s = new Set(e.map((i) => i.id));
+    const e = he(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();
@@ -1686,22 +1697,22 @@ class Z {
    * gradient, which defaults to `1`.
    */
   gradients(t, e, s, r = !1) {
-    if (b(e.length > 0, () => "gradients() received an empty list of xs."), s != null && s.dtype !== "float32")
+    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));
-    b(i instanceof $, () => "The result y returned by f() must be a tensor.");
-    const o = nn(this.state.activeTape, e, i);
+    y(i instanceof x, () => "The result y returned by f() must be a tensor.");
+    const o = sn(this.state.activeTape, e, i);
     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 ?? dn(i.shape), sn(
+      a[i.id] = s ?? gn(i.shape), rn(
         a,
         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`.
-        gn
+        mn
       );
       const c = e.map((l) => a[l.id]);
       return this.state.gradientDepth === 0 && (this.state.activeTape.forEach((l) => {
@@ -1711,16 +1722,16 @@ class Z {
     });
   }
   customGrad(t) {
-    return b(St(t), () => "The f passed in customGrad(f) must be a function."), (...e) => {
-      b(e.every((a) => a instanceof $), () => "The args passed in customGrad(f)(x1, x2,...) must all be tensors");
+    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");
       let s;
       const r = {};
       e.forEach((a, c) => {
         r[c] = a;
       });
-      const i = (a, c) => (s = t(...e, c), b(s.value instanceof $, () => "The function f passed in customGrad(f) must return an object where `obj.value` is a tensor"), b(St(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 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];
-        b(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(...)."), b(u.every((f) => f instanceof $), () => "The function f passed in customGrad(f) must return an object where `obj.gradFunc` is a function that returns a list of only tensors.");
+        y(u.length === 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 h = {};
         return u.forEach((f, m) => {
           h[m] = () => f;
@@ -1743,8 +1754,8 @@ class Z {
     return this.state.tensorInfo.get(t).backend.readToGPU(t, e);
   }
   async time(t) {
-    const e = ht(), s = await this.backend.time(t);
-    return s.wallMs = ht() - e, s;
+    const e = ft(), s = await this.backend.time(t);
+    return s.wallMs = ft() - e, s;
   }
   /**
    * Tracks a Tensor in the current scope to be automatically cleaned up
@@ -1763,30 +1774,30 @@ class Z {
    * registered backend factories.
    */
   reset() {
-    this.pendingBackendInitId++, this.state.dispose(), this.ENV.reset(), this.state = new Kt();
+    this.pendingBackendInitId++, this.state.dispose(), this.ENV.reset(), this.state = new Vt();
     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;
   }
 }
-Z.nextTensorId = 0;
-Z.nextVariableId = 0;
-function dn(n) {
-  const t = xe(U(n), "float32");
+tt.nextTensorId = 0;
+tt.nextVariableId = 0;
+function gn(n) {
+  const t = Ne(U(n), "float32");
   return g.makeTensor(t, n, "float32");
 }
-function fe() {
-  const n = Zt();
+function de() {
+  const n = te();
   if (n._tfengine == null) {
-    const t = new $e(n);
-    n._tfengine = new Z(t);
+    const t = new De(n);
+    n._tfengine = new tt(t);
   }
-  return _e(n._tfengine.ENV), ln(() => n._tfengine), n._tfengine;
+  return Oe(n._tfengine.ENV), cn(() => n._tfengine), n._tfengine;
 }
-const g = fe();
-function gn(n, t) {
+const g = de();
+function mn(n, t) {
   const e = { a: n, b: t };
-  return g.runKernel(te, e);
+  return g.runKernel(ee, e);
 }
 /**
  * @license
@@ -1804,26 +1815,26 @@ function gn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function mn() {
+function pn() {
   return typeof window < "u" && window.document != null || //@ts-ignore
   typeof WorkerGlobalScope < "u";
 }
-const A = S();
-A.registerFlag("DEBUG", () => !1, (n) => {
+const B = S();
+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.");
 });
-A.registerFlag("IS_BROWSER", () => mn());
-A.registerFlag("IS_NODE", () => typeof Y < "u" && typeof Y.versions < "u" && typeof Y.versions.node < "u");
-A.registerFlag("IS_CHROME", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Chrome/.test(navigator.userAgent) && /Google Inc/.test(navigator.vendor));
-A.registerFlag("IS_SAFARI", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Safari/.test(navigator.userAgent) && /Apple/.test(navigator.vendor));
-A.registerFlag("PROD", () => !1);
-A.registerFlag("TENSORLIKE_CHECK_SHAPE_CONSISTENCY", () => A.getBool("DEBUG"));
-A.registerFlag("DEPRECATION_WARNINGS_ENABLED", () => !0);
-A.registerFlag("IS_TEST", () => !1);
-A.registerFlag("CHECK_COMPUTATION_FOR_ERRORS", () => A.getBool("DEBUG"));
-A.registerFlag("WRAP_TO_IMAGEBITMAP", () => !1);
-A.registerFlag("CANVAS2D_WILL_READ_FREQUENTLY_FOR_GPU", () => !1);
-A.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
+B.registerFlag("IS_BROWSER", () => pn());
+B.registerFlag("IS_NODE", () => typeof Q < "u" && typeof Q.versions < "u" && typeof Q.versions.node < "u");
+B.registerFlag("IS_CHROME", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Chrome/.test(navigator.userAgent) && /Google Inc/.test(navigator.vendor));
+B.registerFlag("IS_SAFARI", () => typeof navigator < "u" && navigator != null && navigator.userAgent != null && /Safari/.test(navigator.userAgent) && /Apple/.test(navigator.vendor));
+B.registerFlag("PROD", () => !1);
+B.registerFlag("TENSORLIKE_CHECK_SHAPE_CONSISTENCY", () => B.getBool("DEBUG"));
+B.registerFlag("DEPRECATION_WARNINGS_ENABLED", () => !0);
+B.registerFlag("IS_TEST", () => !1);
+B.registerFlag("CHECK_COMPUTATION_FOR_ERRORS", () => B.getBool("DEBUG"));
+B.registerFlag("WRAP_TO_IMAGEBITMAP", () => !1);
+B.registerFlag("CANVAS2D_WILL_READ_FREQUENTLY_FOR_GPU", () => !1);
+B.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -1840,33 +1851,33 @@ A.registerFlag("USE_SETTIMEOUTCUSTOM", () => !1);
  * limitations under the License.
  * =============================================================================
  */
-function pn(n, t) {
+function yn(n, t) {
   let e = n;
-  if (R(n))
+  if ($(n))
     return t === "string" ? [] : [n.length];
-  if (le(n)) {
+  if (ce(n)) {
     const r = n.channels || "RGBA";
     return [n.height, n.width * r.length];
-  } else if (ce(n))
-    return [n.buffer.size / (t == null ? 4 : wt(t))];
+  } else if (ue(n))
+    return [n.buffer.size / (t == null ? 4 : St(t))];
   if (!Array.isArray(n))
     return [];
   const s = [];
-  for (; Array.isArray(e) || R(e) && t !== "string"; )
+  for (; Array.isArray(e) || $(e) && t !== "string"; )
     s.push(e.length), e = e[0];
-  return Array.isArray(n) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && de(n, s, []), s;
+  return Array.isArray(n) && S().getBool("TENSORLIKE_CHECK_SHAPE_CONSISTENCY") && ge(n, s, []), s;
 }
-function de(n, t, e) {
-  if (e = e || [], !Array.isArray(n) && !R(n)) {
-    b(t.length === 0, () => `Element arr[${e.join("][")}] is a primitive, but should be an array/TypedArray of ${t[0]} elements`);
+function ge(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;
   }
-  b(t.length > 0, () => `Element arr[${e.join("][")}] should be a primitive, but is an array of ${n.length} elements`), b(n.length === t[0], () => `Element arr[${e.join("][")}] should have ${t[0]} elements, but has ${n.length} elements`);
+  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)
-    de(n[r], s, e.concat(r));
+    ge(n[r], s, e.concat(r));
 }
-function Vt(n, t, e, s) {
+function qt(n, t, e, s) {
   if (n !== "string_or_numeric") {
     if (n == null)
       throw new Error("Expected dtype cannot be null.");
@@ -1874,19 +1885,24 @@ function Vt(n, t, e, s) {
       throw new Error(`Argument '${e}' passed to '${s}' must be ${n} tensor, but got ${t} tensor`);
   }
 }
-function k(n, t, e, s = "numeric") {
-  if (n instanceof ae())
-    return Vt(s, n.dtype, t, e), n;
-  let r = gt(n);
-  if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), Vt(s, r, t, e), n == null || !R(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string") {
+function I(n, t, e, s = "numeric") {
+  if (n instanceof le())
+    return qt(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") {
     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 = pn(n, r);
-  !R(n) && !Array.isArray(n) && (n = [n]);
-  const a = r !== "string" ? ie(n, r) : at(n, [], !0);
+  const i = yn(n, r);
+  !$(n) && !Array.isArray(n) && (n = [n]);
+  const a = r !== "string" ? oe(n, r) : at(n, [], !0);
   return g.makeTensor(a, i, r);
 }
+function Js(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));
+}
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -1903,19 +1919,19 @@ function k(n, t, e, s = "numeric") {
  * limitations under the License.
  * =============================================================================
  */
-const yn = "__op";
+const bn = "__op";
 function F(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 + yn;
+  e.endsWith("_") && (e = e.substring(0, e.length - 1)), e = e + bn;
   const r = (...i) => {
     g.startScope(e);
     try {
       const o = s(...i);
-      return Nt(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
+      return Dt(o) && console.error("Cannot return a Promise inside of tidy."), g.endScope(o), o;
     } catch (o) {
       throw g.endScope(null), o;
     }
@@ -1938,28 +1954,28 @@ function F(n) {
  * limitations under the License.
  * =============================================================================
  */
-function bn(n, t, e, s) {
+function wn(n, t, e, s) {
   if (s == null)
-    s = gt(n);
+    s = mt(n);
   else if (s === "complex64")
     throw new Error("Cannot construct a complex64 tensor directly. Please use tf.complex(real, imag).");
-  if (ce(n) || le(n)) {
+  if (ue(n) || ce(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 (!R(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string")
+  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) {
-    $t(t);
+    Nt(t);
     const r = U(t), i = U(e);
-    b(r === i, () => `Based on the provided shape, [${t}], the tensor should have ${r} values but has ${i}`);
+    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;
-      b(e[o] === t[o] || !c, () => `Error creating a new Tensor. Inferred shape (${e}) does not match the provided shape (${t}). `);
+      y(e[o] === t[o] || !c, () => `Error creating a new Tensor. Inferred shape (${e}) does not match the provided shape (${t}). `);
     }
   }
-  return !R(n) && !Array.isArray(n) && (n = [n]), t = t || e, n = s !== "string" ? ie(n, s) : at(n, [], !0), g.makeTensor(n, t, s);
+  return !$(n) && !Array.isArray(n) && (n = [n]), t = t || e, n = s !== "string" ? oe(n, s) : at(n, [], !0), g.makeTensor(n, t, s);
 }
 class lt {
   /**
@@ -1973,7 +1989,7 @@ class lt {
     return new lt(t).slice();
   }
   constructor(t) {
-    if (this.shards = [], this.previousShardIndex = 0, t == null || (t instanceof Array || (t = [t]), t = t.map((s) => R(s) ? s.buffer : s), t.length === 0))
+    if (this.shards = [], this.previousShardIndex = 0, t == null || (t instanceof Array || (t = [t]), t = t.map((s) => $(s) ? s.buffer : s), t.length === 0))
       return;
     this.bufferUniformSize = t[0].byteLength;
     let e = 0;
@@ -1996,7 +2012,7 @@ class lt {
     const r = e - t, i = new ArrayBuffer(r), o = new Uint8Array(i);
     let a = 0;
     for (let c = s; c < this.shards.length; c++) {
-      const l = this.shards[c], h = t + a - l.start, f = a, y = Math.min(e, l.end) - l.start, d = new Uint8Array(l.buffer, h, y - h);
+      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)
         break;
     }
@@ -2015,11 +2031,11 @@ class lt {
     }
     if (e(this.shards[this.previousShardIndex]) === 0)
       return this.previousShardIndex;
-    const s = wn(this.shards, e);
+    const s = Sn(this.shards, e);
     return s === -1 ? -1 : (this.previousShardIndex = s, this.previousShardIndex);
   }
 }
-function wn(n, t) {
+function Sn(n, t) {
   let e = 0, s = n.length;
   for (; e <= s; ) {
     const r = Math.floor((s - e) / 2) + e, i = t(n[r]);
@@ -2045,34 +2061,34 @@ function wn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function Os() {
+function Xs() {
   return g;
 }
 function E(n, t) {
   return g.tidy(n, t);
 }
 function M(n) {
-  ue(n).forEach((e) => e.dispose());
+  he(n).forEach((e) => e.dispose());
 }
-function Sn(n) {
+function kn(n) {
   return g.keep(n);
 }
-const Ct = typeof dt < "u" && (typeof Blob > "u" || typeof atob > "u" || typeof btoa > "u");
-function qt(n) {
-  return Ct ? dt.byteLength(n, "utf8") : new Blob([n]).size;
+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;
 }
 function In(n) {
-  if (Ct)
-    return dt.from(n).toString("base64");
+  if (_t)
+    return gt.from(n).toString("base64");
   const t = new Uint8Array(n);
   let e = "";
   for (let s = 0, r = t.length; s < r; s++)
     e += String.fromCharCode(t[s]);
   return btoa(e);
 }
-function kn(n) {
-  if (Ct) {
-    const s = dt.from(n, "base64");
+function Tn(n) {
+  if (_t) {
+    const s = gt.from(n, "base64");
     return s.buffer.slice(s.byteOffset, s.byteOffset + s.byteLength);
   }
   const t = atob(n), e = new Uint8Array(t.length);
@@ -2080,14 +2096,14 @@ function kn(n) {
     e.set([t.charCodeAt(s)], s);
   return e.buffer;
 }
-function ge(n) {
+function me(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 : qt(JSON.stringify(n.modelTopology)),
-    weightSpecsBytes: n.weightSpecs == null ? 0 : qt(JSON.stringify(n.weightSpecs)),
+    modelTopologyBytes: n.modelTopology == null ? 0 : Ht(JSON.stringify(n.modelTopology)),
+    weightSpecsBytes: n.weightSpecs == null ? 0 : Ht(JSON.stringify(n.weightSpecs)),
     weightDataBytes: n.weightData == null ? 0 : new lt(n.weightData).byteLength
   };
 }
@@ -2107,12 +2123,12 @@ function ge(n) {
  * limitations under the License.
  * =============================================================================
  */
-class B {
+class A {
   constructor() {
     this.saveRouters = [], this.loadRouters = [];
   }
   static getInstance() {
-    return B.instance == null && (B.instance = new B()), B.instance;
+    return A.instance == null && (A.instance = new A()), A.instance;
   }
   /**
    * Register a save-handler router.
@@ -2121,7 +2137,7 @@ class B {
    * of `IOHandler` with the `save` method defined or `null`.
    */
   static registerSaveRouter(t) {
-    B.getInstance().saveRouters.push(t);
+    A.getInstance().saveRouters.push(t);
   }
   /**
    * Register a load-handler router.
@@ -2130,7 +2146,7 @@ class B {
    * of `IOHandler` with the `load` method defined or `null`.
    */
   static registerLoadRouter(t) {
-    B.getInstance().loadRouters.push(t);
+    A.getInstance().loadRouters.push(t);
   }
   /**
    * Look up IOHandler for saving, given a URL-like string.
@@ -2141,7 +2157,7 @@ class B {
    * @throws Error, if more than one match is found.
    */
   static getSaveHandlers(t) {
-    return B.getHandlers(t, "save");
+    return A.getHandlers(t, "save");
   }
   /**
    * Look up IOHandler for loading, given a URL-like string.
@@ -2152,11 +2168,11 @@ class B {
    *   handler routers.
    */
   static getLoadHandlers(t, e) {
-    return B.getHandlers(t, "load", e);
+    return A.getHandlers(t, "load", e);
   }
   static getHandlers(t, e, s) {
     const r = [];
-    return (e === "load" ? B.getInstance().loadRouters : B.getInstance().saveRouters).forEach((o) => {
+    return (e === "load" ? A.getInstance().loadRouters : A.getInstance().saveRouters).forEach((o) => {
       const a = o(t, s);
       a !== null && r.push(a);
     }), r;
@@ -2178,8 +2194,8 @@ class B {
  * limitations under the License.
  * =============================================================================
  */
-const Bt = "tensorflowjs", At = 1, L = "models_store", P = "model_info_store";
-function me() {
+const Bt = "tensorflowjs", vt = 1, L = "models_store", P = "model_info_store";
+function pe() {
   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;
@@ -2187,13 +2203,13 @@ function me() {
     throw new Error("The current browser does not appear to support IndexedDB.");
   return t;
 }
-function vt(n) {
+function Mt(n) {
   const t = n.result;
   t.createObjectStore(L, { keyPath: "modelPath" }), t.createObjectStore(P, { keyPath: "modelPath" });
 }
 class z {
   constructor(t) {
-    if (this.indexedDB = me(), t == null || !t)
+    if (this.indexedDB = pe(), t == null || !t)
       throw new Error("For IndexedDB, modelPath must not be null, undefined or empty.");
     this.modelPath = t;
   }
@@ -2221,8 +2237,8 @@ class z {
    */
   databaseAction(t, e) {
     return new Promise((s, r) => {
-      const i = this.indexedDB.open(Bt, At);
-      i.onupgradeneeded = () => vt(i), i.onsuccess = () => {
+      const i = this.indexedDB.open(Bt, vt);
+      i.onupgradeneeded = () => Mt(i), i.onsuccess = () => {
         const o = i.result;
         if (e == null) {
           const a = o.transaction(L, "readonly"), l = a.objectStore(L).get(this.modelPath);
@@ -2233,7 +2249,7 @@ class z {
           }, l.onerror = (u) => (o.close(), r(l.error)), a.oncomplete = () => o.close();
         } else {
           e.weightData = lt.join(e.weightData);
-          const a = ge(e), c = o.transaction(P, "readwrite");
+          const a = me(e), c = o.transaction(P, "readwrite");
           let l = c.objectStore(P), u;
           try {
             u = l.put({ modelPath: this.modelPath, modelArtifactsInfo: a });
@@ -2251,13 +2267,13 @@ class z {
                 modelArtifacts: e,
                 modelArtifactsInfo: a
               });
-            } catch (y) {
-              return r(y);
+            } catch (b) {
+              return r(b);
             }
-            m.onsuccess = () => s({ modelArtifactsInfo: a }), m.onerror = (y) => {
+            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 = (I) => (o.close(), r(m.error));
+              d.onsuccess = () => (o.close(), r(m.error)), d.onerror = (k) => (o.close(), r(m.error));
             };
           }, u.onerror = (f) => (o.close(), r(u.error)), c.oncomplete = () => {
             h == null ? o.close() : h.oncomplete = () => o.close();
@@ -2268,23 +2284,23 @@ class z {
   }
 }
 z.URL_SCHEME = "indexeddb://";
-const pe = (n) => S().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(z.URL_SCHEME) ? Tn(n.slice(z.URL_SCHEME.length)) : null;
-B.registerSaveRouter(pe);
-B.registerLoadRouter(pe);
-function Tn(n) {
+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);
+function En(n) {
   return new z(n);
 }
-function En(n) {
+function An(n) {
   return n.startsWith(z.URL_SCHEME) ? n.slice(z.URL_SCHEME.length) : n;
 }
 class Bn {
   constructor() {
-    this.indexedDB = me();
+    this.indexedDB = pe();
   }
   async listModels() {
     return new Promise((t, e) => {
-      const s = this.indexedDB.open(Bt, At);
-      s.onupgradeneeded = () => vt(s), s.onsuccess = () => {
+      const s = this.indexedDB.open(Bt, vt);
+      s.onupgradeneeded = () => Mt(s), s.onsuccess = () => {
         const r = s.result, i = r.transaction(P, "readonly"), a = i.objectStore(P).getAll();
         a.onsuccess = () => {
           const c = {};
@@ -2296,9 +2312,9 @@ class Bn {
     });
   }
   async removeModel(t) {
-    return t = En(t), new Promise((e, s) => {
-      const r = this.indexedDB.open(Bt, At);
-      r.onupgradeneeded = () => vt(r), r.onsuccess = () => {
+    return t = An(t), new Promise((e, s) => {
+      const r = this.indexedDB.open(Bt, vt);
+      r.onupgradeneeded = () => Mt(r), r.onsuccess = () => {
         const i = r.result, o = i.transaction(P, "readwrite"), a = o.objectStore(P), c = a.get(t);
         let l;
         c.onsuccess = () => {
@@ -2308,7 +2324,7 @@ class Bn {
             const u = a.delete(t), h = () => {
               l = i.transaction(L, "readwrite");
               const m = l.objectStore(L).delete(t);
-              m.onsuccess = () => e(c.result.modelArtifactsInfo), m.onerror = (y) => s(c.error);
+              m.onsuccess = () => e(c.result.modelArtifactsInfo), m.onerror = (b) => s(c.error);
             };
             u.onsuccess = h, u.onerror = (f) => (h(), i.close(), s(c.error));
           }
@@ -2335,17 +2351,17 @@ class Bn {
  * limitations under the License.
  * =============================================================================
  */
-const _ = "/", X = "tensorflowjs_models", ye = "info", An = "model_topology", vn = "weight_specs", Mn = "weight_data", Fn = "model_metadata";
-function be(n) {
+const _ = "/", Y = "tensorflowjs_models", be = "info", vn = "model_topology", Mn = "weight_specs", Fn = "weight_data", $n = "model_metadata";
+function we(n) {
   return {
-    info: [X, n, ye].join(_),
-    topology: [X, n, An].join(_),
-    weightSpecs: [X, n, vn].join(_),
-    weightData: [X, n, Mn].join(_),
-    modelMetadata: [X, n, Fn].join(_)
+    info: [Y, n, be].join(_),
+    topology: [Y, n, vn].join(_),
+    weightSpecs: [Y, n, Mn].join(_),
+    weightData: [Y, n, Fn].join(_),
+    modelMetadata: [Y, n, $n].join(_)
   };
 }
-function we(n) {
+function Se(n) {
   for (const t of Object.values(n))
     window.localStorage.removeItem(t);
 }
@@ -2364,7 +2380,7 @@ class W {
       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 = be(this.modelPath);
+    this.modelPath = t, this.keys = we(this.modelPath);
   }
   /**
    * Save model artifacts to browser local storage.
@@ -2379,7 +2395,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 = ge(t), i = lt.join(t.weightData);
+      const e = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = me(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 = {
@@ -2394,7 +2410,7 @@ class W {
         };
         return this.LS.setItem(this.keys.modelMetadata, JSON.stringify(o)), { modelArtifactsInfo: r };
       } catch {
-        throw we(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 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}.`);
       }
     }
   }
@@ -2428,22 +2444,22 @@ class W {
     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 = kn(o), e;
+    return e.weightData = Tn(o), e;
   }
 }
 W.URL_SCHEME = "localstorage://";
-const Se = (n) => S().getBool("IS_BROWSER") && !Array.isArray(n) && n.startsWith(W.URL_SCHEME) ? $n(n.slice(W.URL_SCHEME.length)) : null;
-B.registerSaveRouter(Se);
-B.registerLoadRouter(Se);
-function $n(n) {
+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);
+function Nn(n) {
   return new W(n);
 }
-class Nn {
+class Dn {
   constructor() {
-    b(S().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), b(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
+    y(S().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), y(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
   }
   async listModels() {
-    const t = {}, e = X + _, s = _ + ye;
+    const t = {}, e = Y + _, s = _ + be;
     for (let r = 0; r < this.LS.length; ++r) {
       const i = this.LS.key(r);
       if (i.startsWith(e) && i.endsWith(s)) {
@@ -2455,11 +2471,11 @@ class Nn {
   }
   async removeModel(t) {
     t = xn(t);
-    const e = be(t);
+    const e = we(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 we(e), s;
+    return Se(e), s;
   }
 }
 /**
@@ -2478,7 +2494,7 @@ class Nn {
  * limitations under the License.
  * =============================================================================
  */
-const Ht = "://";
+const Jt = "://";
 class N {
   constructor() {
     this.managers = {};
@@ -2493,9 +2509,9 @@ class N {
    * of `IOHandler` with the `save` method defined or `null`.
    */
   static registerManager(t, e) {
-    b(t != null, () => "scheme must not be undefined or null."), t.endsWith(Ht) && (t = t.slice(0, t.indexOf(Ht))), b(t.length > 0, () => "scheme must not be an empty string.");
+    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.");
     const s = N.getInstance();
-    b(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = e;
+    y(s.managers[t] == null, () => `A model store manager is already registered for scheme '${t}'.`), s.managers[t] = e;
   }
   static getManager(t) {
     const e = N.getInstance().managers[t];
@@ -2523,7 +2539,7 @@ class N {
  * limitations under the License.
  * =============================================================================
  */
-class Dn {
+class Cn {
   constructor() {
     this.messageName = "setTimeoutCustom", this.functionRefs = [], this.handledMessageCount = 0, this.hasEventListener = !1;
   }
@@ -2561,13 +2577,13 @@ class Dn {
     }, !0));
   }
   isTypedArray(t) {
-    return re(t);
+    return ie(t);
   }
 }
 if (S().get("IS_BROWSER")) {
-  S().setPlatform("browser", new Dn());
+  S().setPlatform("browser", new Cn());
   try {
-    N.registerManager(W.URL_SCHEME, new Nn());
+    N.registerManager(W.URL_SCHEME, new Dn());
   } catch {
   }
   try {
@@ -2575,20 +2591,20 @@ if (S().get("IS_BROWSER")) {
   } catch {
   }
 }
-const Cn = {
+const _n = {
   // tslint:disable-next-line:no-require-imports
   importFetch: () => require("node-fetch")
 };
-let bt;
-class _n {
+let wt;
+class Pn {
   constructor() {
     this.util = require("util"), this.textEncoder = new this.util.TextEncoder();
   }
   fetch(t, e) {
-    return S().global.fetch != null ? S().global.fetch(t, e) : (bt == null && (bt = Cn.importFetch()), bt(t, e));
+    return S().global.fetch != null ? S().global.fetch(t, e) : (wt == null && (wt = _n.importFetch()), wt(t, e));
   }
   now() {
-    const t = Y.hrtime();
+    const t = Q.hrtime();
     return t[0] * 1e3 + t[1] / 1e6;
   }
   encode(t, e) {
@@ -2603,7 +2619,7 @@ class _n {
     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 _n());
+S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new Pn());
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2620,8 +2636,8 @@ S().get("IS_NODE") && !S().get("IS_BROWSER") && S().setPlatform("node", new _n()
  * limitations under the License.
  * =============================================================================
  */
-function Pn(n, t = "float32", e) {
-  return t = t || "float32", $t(n), new an(n, t, e);
+function On(n, t = "float32", e) {
+  return t = t || "float32", Nt(n), new ln(n, t, e);
 }
 /**
  * @license
@@ -2639,16 +2655,16 @@ function Pn(n, t = "float32", e) {
  * limitations under the License.
  * =============================================================================
  */
-function On(n, t) {
-  const e = k(n, "x", "cast");
-  if (!ve(t))
+function Ln(n, t) {
+  const e = I(n, "x", "cast");
+  if (!Fe(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(ee, s, r);
+  return g.runKernel(ne, s, r);
 }
-const Mt = /* @__PURE__ */ F({ cast_: On });
+const Ft = /* @__PURE__ */ F({ cast_: Ln });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2665,11 +2681,11 @@ const Mt = /* @__PURE__ */ F({ cast_: On });
  * limitations under the License.
  * =============================================================================
  */
-function Ln(n) {
-  const e = { x: k(n, "x", "clone", "string_or_numeric") };
-  return g.runKernel(ne, e);
+function Un(n) {
+  const e = { x: I(n, "x", "clone", "string_or_numeric") };
+  return g.runKernel(se, e);
 }
-const Un = /* @__PURE__ */ F({ clone_: Ln });
+const Gn = /* @__PURE__ */ F({ clone_: Un });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -2686,7 +2702,7 @@ const Un = /* @__PURE__ */ F({ clone_: Ln });
  * limitations under the License.
  * =============================================================================
  */
-function Gn(n, t = !1) {
+function zn(n, t = !1) {
   console.log(n.toString(t));
 }
 /**
@@ -2705,14 +2721,14 @@ function Gn(n, t = !1) {
  * limitations under the License.
  * =============================================================================
  */
-fe();
-const zn = {
-  buffer: Pn,
-  cast: Mt,
-  clone: Un,
-  print: Gn
+de();
+const Wn = {
+  buffer: On,
+  cast: Ft,
+  clone: Gn,
+  print: zn
 };
-cn(zn);
+un(Wn);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2729,13 +2745,13 @@ cn(zn);
  * limitations under the License.
  * =============================================================================
  */
-function Wn(n, t) {
-  let e = k(n, "a", "add"), s = k(t, "b", "add");
+function jn(n, t) {
+  let e = I(n, "a", "add"), s = I(t, "b", "add");
   [e, s] = K(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(te, r);
+  return g.runKernel(ee, r);
 }
-const w = /* @__PURE__ */ F({ add_: Wn });
+const w = /* @__PURE__ */ F({ add_: jn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2752,13 +2768,13 @@ const w = /* @__PURE__ */ F({ add_: Wn });
  * limitations under the License.
  * =============================================================================
  */
-function jn(n, t) {
-  let e = k(n, "a", "floorDiv"), s = k(t, "b", "floorDiv");
+function Kn(n, t) {
+  let e = I(n, "a", "floorDiv"), s = I(t, "b", "floorDiv");
   [e, s] = K(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(ze, r);
+  return g.runKernel(je, r);
 }
-const Kn = /* @__PURE__ */ F({ floorDiv_: jn });
+const Vn = /* @__PURE__ */ F({ floorDiv_: Kn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2775,14 +2791,14 @@ const Kn = /* @__PURE__ */ F({ floorDiv_: jn });
  * limitations under the License.
  * =============================================================================
  */
-function Vn(n, t) {
-  let e = k(n, "a", "div"), s = k(t, "b", "div");
+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")
-    return Kn(e, s);
+    return Vn(e, s);
   const r = { a: e, b: s }, i = {};
-  return g.runKernel(Ue, r, i);
+  return g.runKernel(ze, r, i);
 }
-const D = /* @__PURE__ */ F({ div_: Vn });
+const D = /* @__PURE__ */ F({ div_: qn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2799,13 +2815,13 @@ const D = /* @__PURE__ */ F({ div_: Vn });
  * limitations under the License.
  * =============================================================================
  */
-function qn(n, t) {
-  let e = k(n, "a", "mul"), s = k(t, "b", "mul");
+function Hn(n, t) {
+  let e = I(n, "a", "mul"), s = I(t, "b", "mul");
   [e, s] = K(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(je, r);
+  return g.runKernel(Ve, r);
 }
-const p = /* @__PURE__ */ F({ mul_: qn });
+const p = /* @__PURE__ */ F({ mul_: Hn });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2822,17 +2838,17 @@ const p = /* @__PURE__ */ F({ mul_: qn });
  * limitations under the License.
  * =============================================================================
  */
-function Hn(n) {
-  const t = k(n, "x", "abs");
+function Jn(n) {
+  const t = I(n, "x", "abs");
   if (t.dtype === "complex64") {
     const e = { x: t };
-    return g.runKernel(Le, e);
+    return g.runKernel(Ge, e);
   } else {
     const e = { x: t };
-    return g.runKernel(Oe, e);
+    return g.runKernel(Ue, e);
   }
 }
-const Jn = /* @__PURE__ */ F({ abs_: Hn });
+const Xn = /* @__PURE__ */ F({ abs_: Jn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2849,10 +2865,10 @@ const Jn = /* @__PURE__ */ F({ abs_: Hn });
  * limitations under the License.
  * =============================================================================
  */
-function Xn(n, t, e) {
-  $t(n), e = e || gt(t);
+function Yn(n, t, e) {
+  Nt(n), e = e || mt(t);
   const s = { shape: n, value: t, dtype: e };
-  return g.runKernel(Ge, {}, s);
+  return g.runKernel(We, {}, s);
 }
 /**
  * @license
@@ -2870,7 +2886,7 @@ function Xn(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function Ls(n, t) {
+function Ys(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];
@@ -2878,7 +2894,7 @@ function Ls(n, t) {
   }
   return e;
 }
-function Yn(n, t) {
+function Qn(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];
@@ -2912,11 +2928,11 @@ function Yn(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function Qn(n) {
-  const e = { x: k(n, "x", "zerosLike") };
-  return g.runKernel(He, e);
+function Zn(n) {
+  const e = { x: I(n, "x", "zerosLike") };
+  return g.runKernel(Xe, e);
 }
-const C = /* @__PURE__ */ F({ zerosLike_: Qn });
+const C = /* @__PURE__ */ F({ zerosLike_: Zn });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2933,13 +2949,13 @@ const C = /* @__PURE__ */ F({ zerosLike_: Qn });
  * limitations under the License.
  * =============================================================================
  */
-function Zn(n, t) {
-  let e = k(n, "base", "pow"), s = k(t, "exp", "pow");
+function ts(n, t) {
+  let e = I(n, "base", "pow"), s = I(t, "exp", "pow");
   [e, s] = K(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(Ke, r);
+  return g.runKernel(qe, r);
 }
-const Jt = /* @__PURE__ */ F({ pow_: Zn });
+const Xt = /* @__PURE__ */ F({ pow_: ts });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -2957,11 +2973,11 @@ const Jt = /* @__PURE__ */ F({ pow_: Zn });
  * =============================================================================
  */
 function j(n, t) {
-  if ((R(n) && t !== "string" || Array.isArray(n)) && t !== "complex64")
+  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" && R(n) && !(n instanceof Uint8Array))
+  if (t === "string" && $(n) && !(n instanceof Uint8Array))
     throw new Error("When making a scalar from encoded string, the value must be `Uint8Array`.");
-  return bn(n, [], [], t);
+  return wn(n, [], [], t);
 }
 /**
  * @license
@@ -2979,11 +2995,11 @@ function j(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ts(n) {
-  const e = { x: k(n, "x", "sqrt", "float32") };
-  return g.runKernel(Ve, e);
+function es(n) {
+  const e = { x: I(n, "x", "sqrt", "float32") };
+  return g.runKernel(He, e);
 }
-const tt = /* @__PURE__ */ F({ sqrt_: ts });
+const et = /* @__PURE__ */ F({ sqrt_: es });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -3000,11 +3016,11 @@ const tt = /* @__PURE__ */ F({ sqrt_: ts });
  * limitations under the License.
  * =============================================================================
  */
-function es(n) {
-  const t = k(n, "x", "square"), e = {};
+function ns(n) {
+  const t = I(n, "x", "square"), e = {};
   return g.runKernel("Square", { x: t }, e);
 }
-const G = /* @__PURE__ */ F({ square_: es });
+const G = /* @__PURE__ */ F({ square_: ns });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3021,8 +3037,8 @@ const G = /* @__PURE__ */ F({ square_: es });
  * limitations under the License.
  * =============================================================================
  */
-function ns(n, t) {
-  b(St(n), () => "The f passed in variableGrads(f) must be a function"), b(t == null || Array.isArray(t) && t.every((l) => l instanceof ft), () => "The varList passed in variableGrads(f, varList) must be an array of variables");
+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");
   const e = t != null;
   if (!e) {
     t = [];
@@ -3030,15 +3046,15 @@ function ns(n, t) {
       t.push(g.registeredVariables[l]);
   }
   const s = e ? t.filter((l) => !l.trainable) : null, r = t.length;
-  t = t.filter((l) => l.trainable), b(t.length > 0, () => `variableGrads() expects at least one of the input variables to be trainable, but none of the ${r} variables is trainable.`);
+  t = t.filter((l) => l.trainable), 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);
-  b(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()."), b(o.rank === 0, () => `The f passed in variableGrads(f) must return a scalar, but it returned a rank-${o.rank} tensor`);
+  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 c = {};
   return t.forEach((l, u) => {
     a[u] != null && (c[l.name] = a[u]);
   }), s?.forEach((l) => c[l.name] = null), { value: o, grads: c };
 }
-function Us(n) {
+function Qs(n) {
   return g.customGrad(n);
 }
 /**
@@ -3057,13 +3073,13 @@ function Us(n) {
  * limitations under the License.
  * =============================================================================
  */
-function ss(n, t) {
-  let e = k(n, "a", "sub"), s = k(t, "b", "sub");
+function rs(n, t) {
+  let e = I(n, "a", "sub"), s = I(t, "b", "sub");
   [e, s] = K(e, s);
   const r = { a: e, b: s };
-  return g.runKernel(qe, r);
+  return g.runKernel(Je, r);
 }
-const Q = /* @__PURE__ */ F({ sub_: ss });
+const Z = /* @__PURE__ */ F({ sub_: rs });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3080,13 +3096,13 @@ const Q = /* @__PURE__ */ F({ sub_: ss });
  * limitations under the License.
  * =============================================================================
  */
-function rs(n, t) {
-  let e = k(n, "a", "maximum"), s = k(t, "b", "maximum");
-  [e, s] = K(e, s), e.dtype === "bool" && (e = Mt(e, "int32"), s = Mt(s, "int32")), Yn(e.shape, s.shape);
+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);
   const r = { a: e, b: s };
-  return g.runKernel(We, r);
+  return g.runKernel(Ke, r);
 }
-const is = /* @__PURE__ */ F({ maximum_: rs });
+const os = /* @__PURE__ */ F({ maximum_: is });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3103,8 +3119,8 @@ const is = /* @__PURE__ */ F({ maximum_: rs });
  * limitations under the License.
  * =============================================================================
  */
-const os = /* @__PURE__ */ new Map(), as = /* @__PURE__ */ new Map();
-class ls {
+const as = /* @__PURE__ */ new Map(), ls = /* @__PURE__ */ new Map();
+class cs {
   /**
    * Return the class name for this class to use in serialization contexts.
    *
@@ -3149,10 +3165,10 @@ class O {
     O.getMap().classNameMap[t.className] = [t, t.fromConfig];
   }
 }
-function cs(n, t, e) {
-  b(n.className != null, () => "Class being registered does not have the static className property defined."), b(typeof n.className == "string", () => "className is required to be a string, but got type " + typeof n.className), b(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);
+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), os.set(r, n), as.set(n, r), n;
+  return O.register(n), as.set(r, n), ls.set(n, r), n;
 }
 /**
  * @license
@@ -3170,7 +3186,7 @@ function cs(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-class V extends ls {
+class V 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
@@ -3217,7 +3233,7 @@ class V extends ls {
    * @doc {heading: 'Training', subheading: 'Optimizers'}
    */
   computeGradients(t, e) {
-    return ns(t, e);
+    return ss(t, e);
   }
   /**
    * Dispose the variables (if any) owned by this optimizer instance.
@@ -3268,7 +3284,7 @@ Object.defineProperty(V, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-class us extends V {
+class hs extends V {
   /** @nocollapse */
   static get className() {
     return "Adadelta";
@@ -3291,7 +3307,7 @@ class us 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(tt(w(l, this.epsilon)), tt(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(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));
         c.assign(u), l.assign(f);
         const m = w(p(h, -this.learningRate), i);
         i.assign(m);
@@ -3344,7 +3360,7 @@ class us extends V {
  * limitations under the License.
  * =============================================================================
  */
-class hs extends V {
+class fs extends V {
   /** @nocollapse */
   static get className() {
     return "Adagrad";
@@ -3357,7 +3373,7 @@ class hs extends V {
       const i = g.registeredVariables[s];
       this.accumulatedGrads[r] == null && (this.accumulatedGrads[r] = {
         originalName: `${s}/accumulator`,
-        variable: E(() => Xn(i.shape, this.initialAccumulatorValue).variable(!1))
+        variable: E(() => Yn(i.shape, this.initialAccumulatorValue).variable(!1))
       });
       const o = Array.isArray(t) ? t[r].tensor : t[s];
       if (o == null)
@@ -3366,7 +3382,7 @@ class hs extends V {
       E(() => {
         const c = w(a, G(o));
         a.assign(c);
-        const l = w(p(D(o, tt(w(c, g.backend.epsilon()))), -this.learningRate), i);
+        const l = w(p(D(o, et(w(c, g.backend.epsilon()))), -this.learningRate), i);
         i.assign(l);
       });
     }), this.incrementIterations();
@@ -3409,7 +3425,7 @@ class hs extends V {
  * limitations under the License.
  * =============================================================================
  */
-class fs extends V {
+class ds extends V {
   /** @nocollapse */
   static get className() {
     return "Adam";
@@ -3422,7 +3438,7 @@ class fs extends V {
   applyGradients(t) {
     const e = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
-      const s = Q(1, this.accBeta1), r = Q(1, this.accBeta2);
+      const s = Z(1, this.accBeta1), r = Z(1, this.accBeta2);
       e.forEach((i, o) => {
         const a = g.registeredVariables[i], c = !1;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
@@ -3435,10 +3451,10 @@ class fs 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)), y = 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(G(l), 1 - this.beta2)), b = D(f, s), d = D(m, r);
         u.assign(f), h.assign(m);
-        const I = w(p(D(y, w(tt(d), this.epsilon)), -this.learningRate), a);
-        a.assign(I);
+        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));
     }), this.incrementIterations();
   }
@@ -3451,7 +3467,7 @@ class fs extends V {
   }
   async setWeights(t) {
     t = await this.extractIterations(t), E(() => {
-      this.accBeta1.assign(Jt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Jt(this.beta2, this.iterations_ + 1));
+      this.accBeta1.assign(Xt(this.beta1, this.iterations_ + 1)), this.accBeta2.assign(Xt(this.beta2, this.iterations_ + 1));
     });
     const e = t.length / 2, s = !1;
     this.accumulatedFirstMoment = t.slice(0, e).map((r) => ({
@@ -3491,7 +3507,7 @@ class fs extends V {
  * limitations under the License.
  * =============================================================================
  */
-class ds extends V {
+class gs extends V {
   /** @nocollapse */
   static get className() {
     return "Adamax";
@@ -3504,7 +3520,7 @@ class ds extends V {
   applyGradients(t) {
     const e = Array.isArray(t) ? t.map((s) => s.name) : Object.keys(t);
     E(() => {
-      const s = Q(1, this.accBeta1), r = D(-this.learningRate, w(p(this.iteration, this.decay), 1));
+      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;
         this.accumulatedFirstMoment[o] == null && (this.accumulatedFirstMoment[o] = {
@@ -3517,10 +3533,10 @@ 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.accumulatedWeightedInfNorm[o].variable, f = w(p(u, this.beta1), p(l, 1 - this.beta1)), m = p(h, this.beta2), y = Jn(l), d = is(m, y);
+        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 I = w(p(D(r, s), D(f, w(d, this.epsilon))), a);
-        a.assign(I);
+        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));
     }), this.incrementIterations();
   }
@@ -3587,7 +3603,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 = Sn(j(-t));
+    this.learningRate = t, this.c != null && this.c.dispose(), this.c = kn(j(-t));
   }
   dispose() {
     this.c.dispose();
@@ -3623,7 +3639,7 @@ class Ie extends V {
  * limitations under the License.
  * =============================================================================
  */
-class gs extends Ie {
+class ms extends Ie {
   /** @nocollapse */
   // Name matters for Python compatibility.
   static get className() {
@@ -3694,7 +3710,7 @@ class gs extends Ie {
  * limitations under the License.
  * =============================================================================
  */
-class ms extends V {
+class ps extends V {
   /** @nocollapse */
   static get className() {
     return "RMSProp";
@@ -3723,14 +3739,14 @@ class ms extends V {
       E(() => {
         const u = w(p(c, this.decay), p(G(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), tt(Q(u, w(G(f), this.epsilon)))), y = w(p(l, this.momentum), m);
-          c.assign(u), h.assign(f), l.assign(y);
-          const d = Q(i, y);
+          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);
+          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), tt(w(h, this.epsilon))));
+          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))));
           c.assign(h), l.assign(f);
-          const m = Q(i, f);
+          const m = Z(i, f);
           i.assign(m);
         }
       });
@@ -3787,18 +3803,18 @@ class ms extends V {
  * limitations under the License.
  * =============================================================================
  */
-const ps = [
-  us,
+const ys = [
   hs,
   fs,
   ds,
   gs,
   ms,
+  ps,
   Ie
 ];
-function ys() {
-  for (const n of ps)
-    cs(n);
+function bs() {
+  for (const n of ys)
+    us(n);
 }
 /**
  * @license
@@ -3816,40 +3832,55 @@ function ys() {
  * limitations under the License.
  * =============================================================================
  */
-ys();
+bs();
 export {
-  fs as A,
-  ks as B,
-  Ts as C,
+  ds as A,
+  Es as B,
+  As as C,
+  Bs as D,
   g as E,
-  Bs as I,
-  As as L,
-  vs as N,
-  Ms as P,
-  xs as R,
-  Ns as S,
-  Cs as T,
-  Ps as _,
-  Q as a,
+  $s as F,
+  Ms as G,
+  Cs as H,
+  Fs as I,
+  Ps as J,
+  Os as K,
+  Rs as L,
+  xs as M,
+  Ns as N,
+  Us as O,
+  Ds as P,
+  Vs as Q,
+  _s as R,
+  Ws as S,
+  Ks as T,
+  Ys as U,
+  Qn as V,
+  qs as _,
+  Z as a,
   Is as b,
-  k as c,
-  K as d,
-  Os as e,
-  Es as f,
-  Mt as g,
-  Ds as h,
-  Fs as i,
-  Rs as j,
-  $s as k,
-  _s as l,
+  I as c,
+  Js as d,
+  Xs as e,
+  y as f,
+  Ls as g,
+  Ft as h,
+  Nt as i,
+  Qt as j,
+  U as k,
+  Ne as l,
   p as m,
-  b as n,
+  Gs as n,
   F as o,
-  Ls as p,
-  w as q,
-  U as r,
+  vs as p,
+  Ts as q,
+  Hs as r,
   j as s,
-  E as t,
-  Yn as u,
-  Us as v
+  w as t,
+  js as u,
+  Qs as v,
+  E as w,
+  K as x,
+  zs as y,
+  C as z
 };