oidn-web 0.1.0 → 0.1.2

package/dist/oidn.mjs

@@ -132,57 +132,57 @@ class If {
 }
 class Fl {
   refCount(t) {
-    return Mt("refCount");
+    return Bt("refCount");
   }
   incRef(t) {
-    return Mt("incRef");
+    return Bt("incRef");
   }
   timerAvailable() {
     return !0;
   }
   time(t) {
-    return Mt("time");
+    return Bt("time");
   }
   read(t) {
-    return Mt("read");
+    return Bt("read");
   }
   readSync(t) {
-    return Mt("readSync");
+    return Bt("readSync");
   }
   readToGPU(t, e) {
-    return Mt("readToGPU");
+    return Bt("readToGPU");
   }
   numDataIds() {
-    return Mt("numDataIds");
+    return Bt("numDataIds");
   }
   disposeData(t, e) {
-    return Mt("disposeData");
+    return Bt("disposeData");
   }
   write(t, e, s) {
-    return Mt("write");
+    return Bt("write");
   }
   move(t, e, s, r, o) {
-    return Mt("move");
+    return Bt("move");
   }
   createTensorFromGPUData(t, e, s) {
-    return Mt("createTensorFromGPUData");
+    return Bt("createTensorFromGPUData");
   }
   memory() {
-    return Mt("memory");
+    return Bt("memory");
   }
   /** Returns the highest precision for floats in bits (e.g. 16 or 32) */
   floatPrecision() {
-    return Mt("floatPrecision");
+    return Bt("floatPrecision");
   }
   /** Returns the smallest representable number.  */
   epsilon() {
     return this.floatPrecision() === 32 ? $f : vf;
   }
   dispose() {
-    return Mt("dispose");
+    return Bt("dispose");
   }
 }
-function Mt(n) {
+function Bt(n) {
   throw new Error(`'${n}' not yet implemented or not found in the registry. This kernel may not be supported by the tfjs backend you have chosen`);
 }
 /**
@@ -204,9 +204,9 @@ function Mt(n) {
 function Af(n) {
   let t = n.length, e = 0;
   for (; t > 0; )
-    e = Math.random() * t | 0, t--, En(n, t, e);
+    e = Math.random() * t | 0, t--, Cn(n, t, e);
 }
-function En(n, t, e) {
+function Cn(n, t, e) {
   const s = n[t];
   n[t] = n[e], n[e] = s;
 }
@@ -273,12 +273,12 @@ function kf(n, t) {
   const r = n.slice();
   return r[s] = t / e, r;
 }
-function As(n, t) {
+function Es(n, t) {
   const e = t.length;
   return n = n == null ? t.map((s, r) => r) : [].concat(n), w(n.every((s) => s >= -e && s < e), () => `All values in axis param must be in range [-${e}, ${e}) but got axis ${n}`), w(n.every((s) => Io(s)), () => `All values in axis param must be integers but got axis ${n}`), n.map((s) => s < 0 ? e + s : s);
 }
 function _f(n, t) {
-  const e = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, o = t == null || r ? null : As(t, n).sort();
+  const e = [], s = [], r = t != null && Array.isArray(t) && t.length === 0, o = t == null || r ? null : Es(t, n).sort();
   let i = 0;
   for (let a = 0; a < n.length; ++a) {
     if (o != null) {
@@ -290,7 +290,7 @@ function _f(n, t) {
   }
   return { newShape: e, keptDims: s };
 }
-function Pn(n, t) {
+function Ln(n, t) {
   return yt(n, t);
 }
 function yt(n, t) {
@@ -341,8 +341,8 @@ function Rf(n) {
 function Eo(n) {
   return typeof n == "number";
 }
-function Es(n) {
-  return Array.isArray(n) ? Es(n[0]) : n instanceof Float32Array ? "float32" : n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray ? "int32" : Eo(n) ? "float32" : Or(n) ? "string" : Rf(n) ? "bool" : "float32";
+function Cs(n) {
+  return Array.isArray(n) ? Cs(n[0]) : n instanceof Float32Array ? "float32" : n instanceof Int32Array || n instanceof Uint8Array || n instanceof Uint8ClampedArray ? "int32" : Eo(n) ? "float32" : Or(n) ? "string" : Rf(n) ? "bool" : "float32";
 }
 function Co(n) {
   return !!(n && n.constructor && n.call && n.apply);
@@ -392,12 +392,12 @@ function no(n, t) {
   throw new Error(`Unknown dtype ${t}`);
 }
 function Wl(n, t) {
-  const e = qe(n, t);
+  const e = je(n, t);
   for (let s = 0; s < e.length; s++)
     e[s] = 1;
   return e;
 }
-function qe(n, t) {
+function je(n, t) {
   if (t == null || t === "float32" || t === "complex64")
     return new Float32Array(n);
   if (t === "int32")
@@ -600,7 +600,7 @@ const zf = "Abs", ql = "Add", Uf = "All", Wf = "ArgMax", Gf = "AvgPool", Vf = "A
  * limitations under the License.
  * =============================================================================
  */
-function Cn(...n) {
+function kn(...n) {
   W().getBool("IS_TEST") || W().getBool("PROD") || console.warn(...n);
 }
 /**
@@ -640,7 +640,7 @@ function ya(n) {
 }
 function up(n) {
   const { kernelName: t, backendName: e } = n, s = tu(t, e);
-  rr.has(s) && Cn(`The kernel '${t}' for backend '${e}' is already registered`), rr.set(s, n);
+  rr.has(s) && kn(`The kernel '${t}' for backend '${e}' is already registered`), rr.set(s, n);
 }
 function tu(n, t) {
   return `${t}_${n}`;
@@ -986,10 +986,10 @@ function at(n, t, e) {
 }
 at.prototype.__isLong__;
 Object.defineProperty(at.prototype, "__isLong__", { value: !0 });
-function Gt(n) {
+function qt(n) {
   return (n && n.__isLong__) === !0;
 }
-at.isLong = Gt;
+at.isLong = qt;
 var wa = {}, xa = {};
 function xn(n, t) {
   var e, s, r;
@@ -1006,11 +1006,11 @@ function ee(n, t) {
       return iu;
   } else {
     if (n <= -$a)
-      return Ft;
+      return Ut;
     if (n + 1 >= $a)
       return ou;
   }
-  return n < 0 ? ee(-n, t).neg() : lt(n % Ln | 0, n / Ln | 0, t);
+  return n < 0 ? ee(-n, t).neg() : lt(n % Mn | 0, n / Mn | 0, t);
 }
 at.fromNumber = ee;
 function lt(n, t, e) {
@@ -1045,12 +1045,12 @@ function me(n, t) {
   return typeof n == "number" ? ee(n, t) : typeof n == "string" ? ui(n, t) : lt(n.low, n.high, typeof t == "boolean" ? t : n.unsigned);
 }
 at.fromValue = me;
-var Sa = 65536, fp = 1 << 24, Ln = Sa * Sa, su = Ln * Ln, $a = su / 2, va = xn(fp), ne = xn(0);
+var Sa = 65536, fp = 1 << 24, Mn = Sa * Sa, su = Mn * Mn, $a = su / 2, va = xn(fp), ne = xn(0);
 at.ZERO = ne;
 var tn = xn(0, !0);
 at.UZERO = tn;
-var Nn = xn(1);
-at.ONE = Nn;
+var Dn = xn(1);
+at.ONE = Dn;
 var ru = xn(1, !0);
 at.UONE = ru;
 var To = xn(-1);
@@ -1059,14 +1059,14 @@ var ou = lt(-1, 2147483647, !1);
 at.MAX_VALUE = ou;
 var iu = lt(-1, -1, !0);
 at.MAX_UNSIGNED_VALUE = iu;
-var Ft = lt(0, -2147483648, !1);
-at.MIN_VALUE = Ft;
+var Ut = lt(0, -2147483648, !1);
+at.MIN_VALUE = Ut;
 var R = at.prototype;
 R.toInt = function() {
   return this.unsigned ? this.low >>> 0 : this.low;
 };
 R.toNumber = function() {
-  return this.unsigned ? (this.high >>> 0) * Ln + (this.low >>> 0) : this.high * Ln + (this.low >>> 0);
+  return this.unsigned ? (this.high >>> 0) * Mn + (this.low >>> 0) : this.high * Mn + (this.low >>> 0);
 };
 R.toString = function(t) {
   if (t = t || 10, t < 2 || 36 < t)
@@ -1074,7 +1074,7 @@ R.toString = function(t) {
   if (this.isZero())
     return "0";
   if (this.isNegative())
-    if (this.eq(Ft)) {
+    if (this.eq(Ut)) {
       var e = ee(t), s = this.div(e), r = s.mul(e).sub(this);
       return s.toString(t) + r.toInt().toString(t);
     } else
@@ -1102,7 +1102,7 @@ R.getLowBitsUnsigned = function() {
 };
 R.getNumBitsAbs = function() {
   if (this.isNegative())
-    return this.eq(Ft) ? 64 : this.neg().getNumBitsAbs();
+    return this.eq(Ut) ? 64 : this.neg().getNumBitsAbs();
   for (var t = this.high != 0 ? this.high : this.low, e = 31; e > 0 && !(t & 1 << e); e--)
     ;
   return this.high != 0 ? e + 33 : e + 1;
@@ -1124,7 +1124,7 @@ R.isEven = function() {
   return (this.low & 1) === 0;
 };
 R.equals = function(t) {
-  return Gt(t) || (t = me(t)), this.unsigned !== t.unsigned && this.high >>> 31 === 1 && t.high >>> 31 === 1 ? !1 : this.high === t.high && this.low === t.low;
+  return qt(t) || (t = me(t)), this.unsigned !== t.unsigned && this.high >>> 31 === 1 && t.high >>> 31 === 1 ? !1 : this.high === t.high && this.low === t.low;
 };
 R.eq = R.equals;
 R.notEquals = function(t) {
@@ -1166,29 +1166,29 @@ R.greaterThanOrEqual = function(t) {
 R.gte = R.greaterThanOrEqual;
 R.ge = R.greaterThanOrEqual;
 R.compare = function(t) {
-  if (Gt(t) || (t = me(t)), this.eq(t))
+  if (qt(t) || (t = me(t)), this.eq(t))
     return 0;
   var e = this.isNegative(), s = t.isNegative();
   return e && !s ? -1 : !e && s ? 1 : this.unsigned ? t.high >>> 0 > this.high >>> 0 || t.high === this.high && t.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(t).isNegative() ? -1 : 1;
 };
 R.comp = R.compare;
 R.negate = function() {
-  return !this.unsigned && this.eq(Ft) ? Ft : this.not().add(Nn);
+  return !this.unsigned && this.eq(Ut) ? Ut : this.not().add(Dn);
 };
 R.neg = R.negate;
 R.add = function(t) {
-  Gt(t) || (t = me(t));
+  qt(t) || (t = me(t));
   var e = this.high >>> 16, s = this.high & 65535, r = this.low >>> 16, o = this.low & 65535, i = t.high >>> 16, a = t.high & 65535, l = t.low >>> 16, u = t.low & 65535, c = 0, h = 0, f = 0, d = 0;
   return d += o + u, f += d >>> 16, d &= 65535, f += r + l, h += f >>> 16, f &= 65535, h += s + a, c += h >>> 16, h &= 65535, c += e + i, c &= 65535, lt(f << 16 | d, c << 16 | h, this.unsigned);
 };
 R.subtract = function(t) {
-  return Gt(t) || (t = me(t)), this.add(t.neg());
+  return qt(t) || (t = me(t)), this.add(t.neg());
 };
 R.sub = R.subtract;
 R.multiply = function(t) {
   if (this.isZero())
     return ne;
-  if (Gt(t) || (t = me(t)), te) {
+  if (qt(t) || (t = me(t)), te) {
     var e = te.mul(
       this.low,
       this.high,
@@ -1199,10 +1199,10 @@ R.multiply = function(t) {
   }
   if (t.isZero())
     return ne;
-  if (this.eq(Ft))
-    return t.isOdd() ? Ft : ne;
-  if (t.eq(Ft))
-    return this.isOdd() ? Ft : ne;
+  if (this.eq(Ut))
+    return t.isOdd() ? Ut : ne;
+  if (t.eq(Ut))
+    return this.isOdd() ? Ut : ne;
   if (this.isNegative())
     return t.isNegative() ? this.neg().mul(t.neg()) : this.neg().mul(t).neg();
   if (t.isNegative())
@@ -1214,7 +1214,7 @@ R.multiply = function(t) {
 };
 R.mul = R.multiply;
 R.divide = function(t) {
-  if (Gt(t) || (t = me(t)), t.isZero())
+  if (qt(t) || (t = me(t)), t.isZero())
     throw Error("division by zero");
   if (te) {
     if (!this.unsigned && this.high === -2147483648 && t.low === -1 && t.high === -1)
@@ -1237,14 +1237,14 @@ R.divide = function(t) {
       return ru;
     o = tn;
   } else {
-    if (this.eq(Ft)) {
-      if (t.eq(Nn) || t.eq(To))
-        return Ft;
-      if (t.eq(Ft))
-        return Nn;
+    if (this.eq(Ut)) {
+      if (t.eq(Dn) || t.eq(To))
+        return Ut;
+      if (t.eq(Ut))
+        return Dn;
       var i = this.shr(1);
-      return s = i.div(t).shl(1), s.eq(ne) ? t.isNegative() ? Nn : To : (r = this.sub(t.mul(s)), o = s.add(r.div(t)), o);
-    } else if (t.eq(Ft))
+      return s = i.div(t).shl(1), s.eq(ne) ? t.isNegative() ? Dn : To : (r = this.sub(t.mul(s)), o = s.add(r.div(t)), o);
+    } else if (t.eq(Ut))
       return this.unsigned ? tn : ne;
     if (this.isNegative())
       return t.isNegative() ? this.neg().div(t.neg()) : this.neg().div(t).neg();
@@ -1256,13 +1256,13 @@ R.divide = function(t) {
     s = Math.max(1, Math.floor(r.toNumber() / t.toNumber()));
     for (var a = Math.ceil(Math.log(s) / Math.LN2), l = a <= 48 ? 1 : or(2, a - 48), u = ee(s), c = u.mul(t); c.isNegative() || c.gt(r); )
       s -= l, u = ee(s, this.unsigned), c = u.mul(t);
-    u.isZero() && (u = Nn), o = o.add(u), r = r.sub(c);
+    u.isZero() && (u = Dn), o = o.add(u), r = r.sub(c);
   }
   return o;
 };
 R.div = R.divide;
 R.modulo = function(t) {
-  if (Gt(t) || (t = me(t)), te) {
+  if (qt(t) || (t = me(t)), te) {
     var e = (this.unsigned ? te.rem_u : te.rem_s)(
       this.low,
       this.high,
@@ -1279,24 +1279,24 @@ R.not = function() {
   return lt(~this.low, ~this.high, this.unsigned);
 };
 R.and = function(t) {
-  return Gt(t) || (t = me(t)), lt(this.low & t.low, this.high & t.high, this.unsigned);
+  return qt(t) || (t = me(t)), lt(this.low & t.low, this.high & t.high, this.unsigned);
 };
 R.or = function(t) {
-  return Gt(t) || (t = me(t)), lt(this.low | t.low, this.high | t.high, this.unsigned);
+  return qt(t) || (t = me(t)), lt(this.low | t.low, this.high | t.high, this.unsigned);
 };
 R.xor = function(t) {
-  return Gt(t) || (t = me(t)), lt(this.low ^ t.low, this.high ^ t.high, this.unsigned);
+  return qt(t) || (t = me(t)), lt(this.low ^ t.low, this.high ^ t.high, this.unsigned);
 };
 R.shiftLeft = function(t) {
-  return Gt(t) && (t = t.toInt()), (t &= 63) === 0 ? this : t < 32 ? lt(this.low << t, this.high << t | this.low >>> 32 - t, this.unsigned) : lt(0, this.low << t - 32, this.unsigned);
+  return qt(t) && (t = t.toInt()), (t &= 63) === 0 ? this : t < 32 ? lt(this.low << t, this.high << t | this.low >>> 32 - t, this.unsigned) : lt(0, this.low << t - 32, this.unsigned);
 };
 R.shl = R.shiftLeft;
 R.shiftRight = function(t) {
-  return Gt(t) && (t = t.toInt()), (t &= 63) === 0 ? this : t < 32 ? lt(this.low >>> t | this.high << 32 - t, this.high >> t, this.unsigned) : lt(this.high >> t - 32, this.high >= 0 ? 0 : -1, this.unsigned);
+  return qt(t) && (t = t.toInt()), (t &= 63) === 0 ? this : t < 32 ? lt(this.low >>> t | this.high << 32 - t, this.high >> t, this.unsigned) : lt(this.high >> t - 32, this.high >= 0 ? 0 : -1, this.unsigned);
 };
 R.shr = R.shiftRight;
 R.shiftRightUnsigned = function(t) {
-  if (Gt(t) && (t = t.toInt()), t &= 63, t === 0)
+  if (qt(t) && (t = t.toInt()), t &= 63, t === 0)
     return this;
   var e = this.high;
   if (t < 32) {
@@ -1403,7 +1403,7 @@ function Ia(n, t) {
 function bt(n, t) {
   return t === 0 ? n : n.shru(t).or(n.shl(64 - t));
 }
-function Ue(n, t, e = Br("9ddfea08eb382d69")) {
+function We(n, t, e = Br("9ddfea08eb382d69")) {
   let s = n.xor(t).mul(e);
   s = s.xor(s.shru(47));
   let r = t.xor(s).mul(e);
@@ -1420,11 +1420,11 @@ function Fs(n, t, e, s) {
 function mp(n, t = n.length) {
   if (t >= 8) {
     const e = _t.add(t * 2), s = rt(n, 0).add(_t), r = rt(n, t - 8), o = bt(r, 37).mul(e).add(s), i = bt(s, 25).add(r).mul(e);
-    return Ue(o, i, e);
+    return We(o, i, e);
   }
   if (t >= 4) {
     const e = _t.add(t * 2), s = Ia(n, 0);
-    return Ue(s.shl(3).add(t), Ia(n, t - 4), e);
+    return We(s.shl(3).add(t), Ia(n, t - 4), e);
   }
   if (t > 0) {
     const e = n[0], s = n[t >> 1], r = n[t - 1], o = e + (s << 8), i = t + (r << 2);
@@ -1434,11 +1434,11 @@ function mp(n, t = n.length) {
 }
 function gp(n, t = n.length) {
   const e = _t.add(t * 2), s = rt(n, 0).mul(Je), r = rt(n, 8), o = rt(n, t - 8).mul(e), i = rt(n, t - 16).mul(_t);
-  return Ue(bt(s.add(r), 43).add(bt(o, 30)).add(i), s.add(bt(r.add(_t), 18)).add(o), e);
+  return We(bt(s.add(r), 43).add(bt(o, 30)).add(i), s.add(bt(r.add(_t), 18)).add(o), e);
 }
 function bp(n, t = n.length) {
-  const e = _t.add(t * 2), s = rt(n, 0).mul(_t), r = rt(n, 8), o = rt(n, t - 8).mul(e), i = rt(n, t - 16).mul(_t), a = bt(s.add(r), 43).add(bt(o, 30)).add(i), l = Ue(a, s.add(bt(r.add(_t), 18)).add(o), e), u = rt(n, 16).mul(e), c = rt(n, 24), h = a.add(rt(n, t - 32)).mul(e), f = l.add(rt(n, t - 24)).mul(e);
-  return Ue(bt(u.add(c), 43).add(bt(h, 30)).add(f), u.add(bt(c.add(s), 18)).add(h), e);
+  const e = _t.add(t * 2), s = rt(n, 0).mul(_t), r = rt(n, 8), o = rt(n, t - 8).mul(e), i = rt(n, t - 16).mul(_t), a = bt(s.add(r), 43).add(bt(o, 30)).add(i), l = We(a, s.add(bt(r.add(_t), 18)).add(o), e), u = rt(n, 16).mul(e), c = rt(n, 24), h = a.add(rt(n, t - 32)).mul(e), f = l.add(rt(n, t - 24)).mul(e);
+  return We(bt(u.add(c), 43).add(bt(h, 30)).add(f), u.add(bt(c.add(s), 18)).add(h), e);
 }
 function yp(n, t = n.length) {
   const e = Ze.fromNumber(81, !0);
@@ -1454,7 +1454,7 @@ function yp(n, t = n.length) {
     s = bt(s.add(r).add(i[0]).add(rt(n, l + 8)), 37).mul(Je), r = bt(r.add(i[1]).add(rt(n, l + 48)), 42).mul(Je), s = s.xor(a[1]), r = r.add(i[0]).add(rt(n, l + 40)), o = bt(o.add(a[0]), 33).mul(Je), i = Fs(n, l, i[1].mul(Je), s.add(a[0])), a = Fs(n, l + 32, o.add(a[1]), r.add(rt(n, l + 16))), [o, s] = [s, o], l += 64;
   while (l !== u);
   const h = Je.add(o.and(255).shl(1));
-  return l = c, a[0] = a[0].add(t - 1 & 63), i[0] = i[0].add(a[0]), a[0] = a[0].add(i[0]), s = bt(s.add(r).add(i[0]).add(rt(n, l + 8)), 37).mul(h), r = bt(r.add(i[1]).add(rt(n, l + 48)), 42).mul(h), s = s.xor(a[1].mul(9)), r = r.add(i[0].mul(9).add(rt(n, l + 40))), o = bt(o.add(a[0]), 33).mul(h), i = Fs(n, l, i[1].mul(h), s.add(a[0])), a = Fs(n, l + 32, o.add(a[1]), r.add(rt(n, l + 16))), [o, s] = [s, o], Ue(Ue(i[0], a[0], h).add(No(r).mul(lu)).add(o), Ue(i[1], a[1], h).add(s), h);
+  return l = c, a[0] = a[0].add(t - 1 & 63), i[0] = i[0].add(a[0]), a[0] = a[0].add(i[0]), s = bt(s.add(r).add(i[0]).add(rt(n, l + 8)), 37).mul(h), r = bt(r.add(i[1]).add(rt(n, l + 48)), 42).mul(h), s = s.xor(a[1].mul(9)), r = r.add(i[0].mul(9).add(rt(n, l + 40))), o = bt(o.add(a[0]), 33).mul(h), i = Fs(n, l, i[1].mul(h), s.add(a[0])), a = Fs(n, l + 32, o.add(a[1]), r.add(rt(n, l + 16))), [o, s] = [s, o], We(We(i[0], a[0], h).add(No(r).mul(lu)).add(o), We(i[1], a[1], h).add(s), h);
 }
 /**
  * @license
@@ -1495,7 +1495,7 @@ function Fr(n, t) {
   } else
     throw new Error(`Unknown data type ${t}`);
 }
-function Mn() {
+function On() {
   return W().platform.now();
 }
 function nn(n, t = "utf-8") {
@@ -1548,14 +1548,14 @@ class Sp {
       r = s();
     };
     let i;
-    const a = Mn();
+    const a = On();
     if (this.backendTimer.timerAvailable())
       i = this.backendTimer.time(o);
     else {
       o();
       for (const u of r)
         u.dataSync();
-      i = Promise.resolve({ kernelMs: Mn() - a });
+      i = Promise.resolve({ kernelMs: On() - a });
     }
     if (W().getBool("CHECK_COMPUTATION_FOR_ERRORS"))
       for (let u = 0; u < r.length; u++) {
@@ -1709,7 +1709,7 @@ function Ap(n, t, e, s) {
  * limitations under the License.
  * =============================================================================
  */
-const Aa = 20, ns = 3, oo = 7;
+const Aa = 20, ss = 3, oo = 7;
 function Ep(n, t, e, s) {
   const r = Ht(t), o = Cp(n, t, e, r), i = t.length, a = Qs(n, t, e, r, o), l = ["Tensor"];
   return s && (l.push(`  dtype: ${e}`), l.push(`  rank: ${i}`), l.push(`  shape: [${t}]`), l.push("  values:")), l.push(a.map((u) => "    " + u).join(`
@@ -1717,16 +1717,16 @@ function Ep(n, t, e, s) {
 `);
 }
 function Cp(n, t, e, s) {
-  const r = U(t), o = s[s.length - 1], i = new Array(o).fill(0), a = t.length, l = e === "complex64" ? ls(n) : n;
+  const r = U(t), o = s[s.length - 1], i = new Array(o).fill(0), a = t.length, l = e === "complex64" ? us(n) : n;
   if (a > 1)
     for (let u = 0; u < r / o; u++) {
       const c = u * o;
       for (let h = 0; h < o; h++)
-        i[h] = Math.max(i[h], as(l[c + h], 0, e).length);
+        i[h] = Math.max(i[h], ls(l[c + h], 0, e).length);
     }
   return i;
 }
-function as(n, t, e) {
+function ls(n, t, e) {
   let s;
   return Array.isArray(n) ? s = `${parseFloat(n[0].toFixed(oo))} + ${parseFloat(n[1].toFixed(oo))}j` : Or(n) ? s = `'${n}'` : e === "bool" ? s = cu(n) : s = parseFloat(n.toFixed(oo)).toString(), Zs(s, t);
 }
@@ -1737,26 +1737,26 @@ function Qs(n, t, e, s, r, o = !0) {
   const i = e === "complex64" ? 2 : 1, a = t[0], l = t.length;
   if (l === 0) {
     if (e === "complex64") {
-      const g = ls(n);
-      return [as(g[0], 0, e)];
+      const g = us(n);
+      return [ls(g[0], 0, e)];
     }
     return e === "bool" ? [cu(n[0])] : [n[0].toString()];
   }
   if (l === 1) {
     if (a > Aa) {
-      const m = ns * i;
-      let b = Array.from(n.slice(0, m)), y = Array.from(n.slice((a - ns) * i, a * i));
-      return e === "complex64" && (b = ls(b), y = ls(y)), [
-        "[" + b.map((S, x) => as(S, r[x], e)).join(", ") + ", ..., " + y.map((S, x) => as(S, r[a - ns + x], e)).join(", ") + "]"
+      const m = ss * i;
+      let b = Array.from(n.slice(0, m)), y = Array.from(n.slice((a - ss) * i, a * i));
+      return e === "complex64" && (b = us(b), y = us(y)), [
+        "[" + b.map((S, x) => ls(S, r[x], e)).join(", ") + ", ..., " + y.map((S, x) => ls(S, r[a - ss + x], e)).join(", ") + "]"
       ];
     }
     return [
-      "[" + (e === "complex64" ? ls(n) : Array.from(n)).map((m, b) => as(m, r[b], e)).join(", ") + "]"
+      "[" + (e === "complex64" ? us(n) : Array.from(n)).map((m, b) => ls(m, r[b], e)).join(", ") + "]"
     ];
   }
   const u = t.slice(1), c = s.slice(1), h = s[0] * i, f = [];
   if (a > Aa) {
-    for (let g = 0; g < ns; g++) {
+    for (let g = 0; g < ss; g++) {
       const m = g * h, b = m + h;
       f.push(...Qs(
         n.slice(m, b),
@@ -1769,7 +1769,7 @@ function Qs(n, t, e, s, r, o = !0) {
       ));
     }
     f.push("...");
-    for (let g = a - ns; g < a; g++) {
+    for (let g = a - ss; g < a; g++) {
       const m = g * h, b = m + h;
       f.push(...Qs(
         n.slice(m, b),
@@ -1805,7 +1805,7 @@ function Qs(n, t, e, s, r, o = !0) {
 `;
   return f[f.length - 1] = " " + f[f.length - 1] + "]" + (o ? "" : p), f;
 }
-function ls(n) {
+function us(n) {
   const t = [];
   for (let e = 0; e < n.length; e += 2)
     t.push([n[e], n[e + 1]]);
@@ -1904,12 +1904,12 @@ class ar {
     return he().makeTensor(this.values, this.shape, this.dtype);
   }
 }
-let he = null, kn = null;
+let he = null, _n = null;
 function kp(n) {
   he = n;
 }
 function _p(n) {
-  kn = n;
+  _n = n;
 }
 class Et {
   constructor(t, e, s, r) {
@@ -1925,14 +1925,14 @@ class Et {
    */
   async buffer() {
     const t = await this.data();
-    return kn.buffer(this.shape, this.dtype, t);
+    return _n.buffer(this.shape, this.dtype, t);
   }
   /**
    * Returns a `tf.TensorBuffer` that holds the underlying data.
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   bufferSync() {
-    return kn.buffer(this.shape, this.dtype, this.dataSync());
+    return _n.buffer(this.shape, this.dtype, this.dataSync());
   }
   /**
    * Returns the tensor data as a nested array. The transfer of data is done
@@ -2056,14 +2056,14 @@ class Et {
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   print(t = !1) {
-    return kn.print(this, t);
+    return _n.print(this, t);
   }
   /**
    * Returns a copy of the tensor. See `tf.clone` for details.
    * @doc {heading: 'Tensors', subheading: 'Classes'}
    */
   clone() {
-    return this.throwIfDisposed(), kn.clone(this);
+    return this.throwIfDisposed(), _n.clone(this);
   }
   /**
    * Returns a human-readable description of the tensor. Useful for logging.
@@ -2075,7 +2075,7 @@ class Et {
     return Ep(e, this.shape, this.dtype, t);
   }
   cast(t) {
-    return this.throwIfDisposed(), kn.cast(this, t);
+    return this.throwIfDisposed(), _n.cast(this, t);
   }
   variable(t = !0, e, s) {
     return this.throwIfDisposed(), he().makeVariable(this, t, e, s);
@@ -2258,7 +2258,7 @@ class Ca {
       this.registeredVariables[t].dispose();
   }
 }
-class On {
+class Bn {
   constructor(t) {
     this.ENV = t, this.registry = {}, this.registryFactory = {}, this.pendingBackendInitId = 0, this.state = new Ca();
   }
@@ -2306,7 +2306,7 @@ class On {
     return t in this.registryFactory ? this.registryFactory[t].factory : null;
   }
   registerBackend(t, e, s = 1) {
-    return t in this.registryFactory ? (Cn(`${t} backend was already registered. Reusing existing backend factory.`), !1) : (this.registryFactory[t] = { factory: e, priority: s }, !0);
+    return t in this.registryFactory ? (kn(`${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)
@@ -2342,12 +2342,12 @@ class On {
     try {
       const s = e.factory();
       if (s && !(s instanceof Fl) && typeof s.then == "function") {
-        const r = ++this.pendingBackendInitId, o = s.then((i) => r < this.pendingBackendInitId ? !1 : (this.registry[t] = i, this.pendingBackendInit = null, !0)).catch((i) => (r < this.pendingBackendInitId || (this.pendingBackendInit = null, Cn(`Initialization of backend ${t} failed`), Cn(i.stack || i.message)), !1));
+        const r = ++this.pendingBackendInitId, o = s.then((i) => r < this.pendingBackendInitId ? !1 : (this.registry[t] = i, this.pendingBackendInit = null, !0)).catch((i) => (r < this.pendingBackendInitId || (this.pendingBackendInit = null, kn(`Initialization of backend ${t} failed`), kn(i.stack || i.message)), !1));
         return this.pendingBackendInit = o, { success: o, asyncInit: !0 };
       } else
         return this.registry[t] = s, { success: !0, asyncInit: !1 };
     } catch (s) {
-      return Cn(`Initialization of backend ${t} failed`), Cn(s.stack || s.message), { success: !1, asyncInit: !1 };
+      return kn(`Initialization of backend ${t} failed`), kn(s.stack || s.message), { success: !1, asyncInit: !1 };
     }
   }
   removeBackend(t) {
@@ -2399,10 +2399,10 @@ class On {
     }
   }
   nextTensorId() {
-    return On.nextTensorId++;
+    return Bn.nextTensorId++;
   }
   nextVariableId() {
-    return On.nextVariableId++;
+    return Bn.nextVariableId++;
   }
   /**
    * This method is called instead of the public-facing tensor.clone() when
@@ -2646,7 +2646,7 @@ class On {
     const a = { id: this.state.nextTapeNodeId++, kernelName: t, inputs: e, outputs: s, saved: o }, l = ba(t);
     l != null && (r = l.gradFunc), r != null && (a.gradient = (u) => (u = u.map((c, h) => {
       if (c == null) {
-        const f = s[h], d = qe(f.size, f.dtype);
+        const f = s[h], d = je(f.size, f.dtype);
         return this.makeTensor(d, f.shape, f.dtype);
       }
       return c;
@@ -2752,8 +2752,8 @@ class On {
     return this.state.tensorInfo.get(t).backend.readToGPU(t, e);
   }
   async time(t) {
-    const e = Mn(), s = await this.backend.time(t);
-    return s.wallMs = Mn() - e, s;
+    const e = On(), s = await this.backend.time(t);
+    return s.wallMs = On() - e, s;
   }
   /**
    * Tracks a Tensor in the current scope to be automatically cleaned up
@@ -2778,8 +2778,8 @@ class On {
     this.backendName = null, this.backendInstance = null, this.pendingBackendInit = null;
   }
 }
-On.nextTensorId = 0;
-On.nextVariableId = 0;
+Bn.nextTensorId = 0;
+Bn.nextVariableId = 0;
 function Rp(n) {
   const t = Wl(U(n), "float32");
   return A.makeTensor(t, n, "float32");
@@ -2788,7 +2788,7 @@ function gu() {
   const n = Vl();
   if (n._tfengine == null) {
     const t = new Pf(n);
-    n._tfengine = new On(t);
+    n._tfengine = new Bn(t);
   }
   return Bf(n._tfengine.ENV), kp(() => n._tfengine), n._tfengine;
 }
@@ -2850,7 +2850,7 @@ function ka(n, t, e, s) {
 function v(n, t, e, s = "numeric") {
   if (n instanceof hu())
     return ka(s, n.dtype, t, e), n;
-  let r = Es(n);
+  let r = Cs(n);
   if (r !== "string" && ["bool", "int32", "float32"].indexOf(s) >= 0 && (r = s), ka(s, r, t, e), n == null || !se(n) && !Array.isArray(n) && typeof n != "number" && typeof n != "boolean" && typeof n != "string") {
     const l = n == null ? "null" : n.constructor.name;
     throw new Error(`Argument '${t}' passed to '${e}' must be a Tensor or TensorLike, but got '${l}'`);
@@ -2883,7 +2883,7 @@ function yu(n, t, e, s = "numeric") {
  */
 function Ur(n, t, e, s) {
   if (s == null)
-    s = Es(n);
+    s = Cs(n);
   else if (s === "complex64")
     throw new Error("Cannot construct a complex64 tensor directly. Please use tf.complex(real, imag).");
   if (du(n) || fu(n)) {
@@ -3083,7 +3083,7 @@ function Gp(n, t, e) {
   const s = v(n, "x", "slice4d");
   return w(s.rank === 4, () => `slice4d expects a rank-4 tensor, but got a rank-${s.rank} tensor`), At(s, t, e);
 }
-const bs = /* @__PURE__ */ k({ slice4d_: Gp });
+const ys = /* @__PURE__ */ k({ slice4d_: Gp });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3213,7 +3213,7 @@ function Yp(n, t) {
   return A.runKernel(Kf, r);
 }
 const hi = /* @__PURE__ */ k({ complex_: Yp });
-class Gn {
+class Vn {
   /**
    * Concatenate a number of ArrayBuffers into one.
    *
@@ -3222,7 +3222,7 @@ class Gn {
    * @returns Result of concatenating `buffers` in order.
    */
   static join(t) {
-    return new Gn(t).slice();
+    return new Vn(t).slice();
   }
   constructor(t) {
     if (this.shards = [], this.previousShardIndex = 0, t == null || (t instanceof Array || (t = [t]), t = t.map((s) => se(s) ? s.buffer : s), t.length === 0))
@@ -3309,7 +3309,7 @@ function C(n, t) {
 function ut(n) {
   pu(n).forEach((e) => e.dispose());
 }
-function Rn(n) {
+function Pn(n) {
   return A.keep(n);
 }
 function Jp(n, t, e = 1) {
@@ -3399,7 +3399,7 @@ function em(n) {
   return e.buffer;
 }
 function nm(n) {
-  return Gn.join(n);
+  return Vn.join(n);
 }
 function wu(n) {
   if (n.modelTopology instanceof ArrayBuffer)
@@ -3409,7 +3409,7 @@ function wu(n) {
     modelTopologyType: "JSON",
     modelTopologyBytes: n.modelTopology == null ? 0 : Da(JSON.stringify(n.modelTopology)),
     weightSpecsBytes: n.weightSpecs == null ? 0 : Da(JSON.stringify(n.weightSpecs)),
-    weightDataBytes: n.weightData == null ? 0 : new Gn(n.weightData).byteLength
+    weightDataBytes: n.weightData == null ? 0 : new Vn(n.weightData).byteLength
   };
 }
 /**
@@ -3500,7 +3500,7 @@ const sm = (n) => kt.getSaveHandlers(n);
  * limitations under the License.
  * =============================================================================
  */
-const Mo = "tensorflowjs", Oo = 1, en = "models_store", Fe = "model_info_store";
+const Mo = "tensorflowjs", Oo = 1, en = "models_store", ze = "model_info_store";
 function xu() {
   if (!W().getBool("IS_BROWSER"))
     throw new Error("Failed to obtain IndexedDB factory because the current environmentis not a web browser.");
@@ -3511,7 +3511,7 @@ function xu() {
 }
 function Bo(n) {
   const t = n.result;
-  t.createObjectStore(en, { keyPath: "modelPath" }), t.createObjectStore(Fe, { keyPath: "modelPath" });
+  t.createObjectStore(en, { keyPath: "modelPath" }), t.createObjectStore(ze, { keyPath: "modelPath" });
 }
 class dn {
   constructor(t) {
@@ -3554,9 +3554,9 @@ class dn {
             s(u.result.modelArtifacts);
           }, u.onerror = (c) => (i.close(), r(u.error)), a.oncomplete = () => i.close();
         } else {
-          e.weightData = Gn.join(e.weightData);
-          const a = wu(e), l = i.transaction(Fe, "readwrite");
-          let u = l.objectStore(Fe), c;
+          e.weightData = Vn.join(e.weightData);
+          const a = wu(e), l = i.transaction(ze, "readwrite");
+          let u = l.objectStore(ze), c;
           try {
             c = u.put({ modelPath: this.modelPath, modelArtifactsInfo: a });
           } catch (f) {
@@ -3577,7 +3577,7 @@ class dn {
               return r(p);
             }
             d.onsuccess = () => s({ modelArtifactsInfo: a }), d.onerror = (p) => {
-              u = l.objectStore(Fe);
+              u = l.objectStore(ze);
               const g = u.delete(this.modelPath);
               g.onsuccess = () => (i.close(), r(d.error)), g.onerror = (m) => (i.close(), r(d.error));
             };
@@ -3607,7 +3607,7 @@ class im {
     return new Promise((t, e) => {
       const s = this.indexedDB.open(Mo, Oo);
       s.onupgradeneeded = () => Bo(s), s.onsuccess = () => {
-        const r = s.result, o = r.transaction(Fe, "readonly"), a = o.objectStore(Fe).getAll();
+        const r = s.result, o = r.transaction(ze, "readonly"), a = o.objectStore(ze).getAll();
         a.onsuccess = () => {
           const l = {};
           for (const u of a.result)
@@ -3621,7 +3621,7 @@ class im {
     return t = om(t), new Promise((e, s) => {
       const r = this.indexedDB.open(Mo, Oo);
       r.onupgradeneeded = () => Bo(r), r.onsuccess = () => {
-        const o = r.result, i = o.transaction(Fe, "readwrite"), a = i.objectStore(Fe), l = a.get(t);
+        const o = r.result, i = o.transaction(ze, "readwrite"), a = i.objectStore(ze), l = a.get(t);
         let u;
         l.onsuccess = () => {
           if (l.result == null)
@@ -3657,14 +3657,14 @@ class im {
  * limitations under the License.
  * =============================================================================
  */
-const Re = "/", _n = "tensorflowjs_models", $u = "info", am = "model_topology", lm = "weight_specs", um = "weight_data", cm = "model_metadata";
+const Re = "/", Tn = "tensorflowjs_models", $u = "info", am = "model_topology", lm = "weight_specs", um = "weight_data", cm = "model_metadata";
 function vu(n) {
   return {
-    info: [_n, n, $u].join(Re),
-    topology: [_n, n, am].join(Re),
-    weightSpecs: [_n, n, lm].join(Re),
-    weightData: [_n, n, um].join(Re),
-    modelMetadata: [_n, n, cm].join(Re)
+    info: [Tn, n, $u].join(Re),
+    topology: [Tn, n, am].join(Re),
+    weightSpecs: [Tn, n, lm].join(Re),
+    weightData: [Tn, n, um].join(Re),
+    modelMetadata: [Tn, n, cm].join(Re)
   };
 }
 function Iu(n) {
@@ -3701,7 +3701,7 @@ class pn {
     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 = wu(t), o = Gn.join(t.weightData);
+      const e = JSON.stringify(t.modelTopology), s = JSON.stringify(t.weightSpecs), r = wu(t), o = Vn.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, tm(o));
         const i = {
@@ -3765,7 +3765,7 @@ class pm {
     w(W().getBool("IS_BROWSER"), () => "Current environment is not a web browser"), w(typeof window > "u" || typeof window.localStorage < "u", () => "Current browser does not appear to support localStorage"), this.LS = window.localStorage;
   }
   async listModels() {
-    const t = {}, e = _n + Re, s = Re + $u;
+    const t = {}, e = Tn + Re, s = Re + $u;
     for (let r = 0; r < this.LS.length; ++r) {
       const o = this.LS.key(r);
       if (o.startsWith(e) && o.endsWith(s)) {
@@ -4209,7 +4209,7 @@ const ur = /* @__PURE__ */ k({ argMax_: _m });
  * =============================================================================
  */
 function Tm(n, t, e, s, r, o, i = "channelsLast") {
-  const [a, l] = ys(t);
+  const [a, l] = ws(t);
   let u;
   if (i === "channelsLast")
     u = [a, l, n[3], n[3]];
@@ -4227,7 +4227,7 @@ function di(n, t, e, s, r, o, i = !1, a = "channelsLast") {
     [l, h, u, c] = n;
   else
     throw new Error(`Unknown dataFormat ${a}`);
-  const [f, d, , p] = t, [g, m] = ys(e), [b, y] = ys(s), S = Fo(f, b), x = Fo(d, y), { padInfo: $, outHeight: E, outWidth: D } = Rm(r, u, c, g, m, S, x, o, a), _ = i ? p * h : p;
+  const [f, d, , p] = t, [g, m] = ws(e), [b, y] = ws(s), S = Fo(f, b), x = Fo(d, y), { padInfo: $, outHeight: E, outWidth: D } = Rm(r, u, c, g, m, S, x, o, a), _ = i ? p * h : p;
   let T;
   return a === "channelsFirst" ? T = [l, _, E, D] : a === "channelsLast" && (T = [l, E, D, _]), {
     batchSize: l,
@@ -4261,7 +4261,7 @@ function Dm(n, t, e, s = 1) {
   const r = Fo(t, s);
   return Math.floor((n[0] * (e - 1) - e + r) / 2);
 }
-function ys(n) {
+function ws(n) {
   return typeof n == "number" ? [n, n, n] : n.length === 2 ? [n[0], n[1], 1] : n;
 }
 function Fo(n, t) {
@@ -4301,14 +4301,14 @@ function cr(n, t) {
   }
 }
 function zo(n) {
-  const [t, e, s] = ys(n);
+  const [t, e, s] = ws(n);
   return t === 1 && e === 1 && s === 1;
 }
-function Vn(n, t) {
+function qn(n, t) {
   return zo(n) || zo(t);
 }
-function Bn(n) {
-  return ys(n).every((t) => t > 0);
+function Fn(n) {
+  return ws(n).every((t) => t > 0);
 }
 function Pm(n) {
   if (n === "NHWC")
@@ -4372,7 +4372,7 @@ const L = /* @__PURE__ */ k({ reshape_: Lm });
  */
 function Mm(n, t, e, s, r) {
   const o = v(n, "x", "avgPool", "float32"), i = 1;
-  w(Vn(e, i), () => `Error in avgPool: Either strides or dilations must be 1. Got strides ${e} and dilations '${i}'`);
+  w(qn(e, i), () => `Error in avgPool: Either strides or dilations must be 1. Got strides ${e} and dilations '${i}'`);
   let a = o, l = !1;
   o.rank === 3 && (l = !0, a = L(o, [1, o.shape[0], o.shape[1], o.shape[2]])), w(a.rank === 4, () => `Error in avgPool: x must be rank 4 but got rank ${a.rank}.`), _e("avgPool", s, r);
   const u = { x: a }, c = { filterSize: t, strides: e, pad: s, dimRoundingMode: r };
@@ -4549,7 +4549,7 @@ const er = /* @__PURE__ */ k({ broadcastTo_: qm });
  * =============================================================================
  */
 function Wr(n, t, e) {
-  Me(n), e = e || Es(t);
+  Me(n), e = e || Cs(t);
   const s = { shape: n, value: t, dtype: e };
   return A.runKernel(cd, {}, s);
 }
@@ -4598,7 +4598,7 @@ function Hm(n, t, e, s, r = "NHWC", o = [1, 1], i) {
   let u = a, c = !1;
   a.rank === 3 && (c = !0, u = L(a, [1, a.shape[0], a.shape[1], a.shape[2]])), w(u.rank === 4, () => `Error in conv2d: input must be rank 4, but got rank ${u.rank}.`), w(l.rank === 4, () => `Error in conv2d: filter must be rank 4, but got rank ${l.rank}.`), _e("conv2d", s, i);
   const h = r === "NHWC" ? u.shape[3] : u.shape[1];
-  w(h === l.shape[2], () => `Error in conv2d: depth of input (${h}) must match input depth for filter ${l.shape[2]}.`), w(Vn(e, o), () => `Error in conv2D: Either strides or dilations must be 1. Got strides ${e} and dilations '${o}'`), w(Bn(o), () => "Error in conv2D: Dilated rates should be larger than 0."), w(Bn(e), () => "Error in conv2D: Strides should be larger than 0.");
+  w(h === l.shape[2], () => `Error in conv2d: depth of input (${h}) must match input depth for filter ${l.shape[2]}.`), w(qn(e, o), () => `Error in conv2D: Either strides or dilations must be 1. Got strides ${e} and dilations '${o}'`), w(Fn(o), () => "Error in conv2D: Dilated rates should be larger than 0."), w(Fn(e), () => "Error in conv2D: Strides should be larger than 0.");
   const f = { x: u, filter: l }, d = { strides: e, pad: s, dataFormat: r, dilations: o, dimRoundingMode: i }, p = A.runKernel(Xf, f, d);
   return c ? L(p, [p.shape[1], p.shape[2], p.shape[3]]) : p;
 }
@@ -4606,7 +4606,7 @@ const gi = /* @__PURE__ */ k({ conv2d_: Hm });
 function Km(n, t, e, s, r = "NWC", o = 1, i) {
   const a = v(n, "x", "conv1d"), l = v(t, "filter", "conv1d");
   let u = a, c = !1;
-  a.rank === 2 && (c = !0, u = L(a, [1, a.shape[0], a.shape[1]])), w(u.rank === 3, () => `Error in conv1d: input must be rank 3, but got rank ${u.rank}.`), w(l.rank === 3, () => `Error in conv1d: filter must be rank 3, but got rank ${l.rank}.`), _e("conv1d", s, i), w(u.shape[2] === l.shape[1], () => `Error in conv1d: depth of input (${u.shape[2]}) must match input depth for filter ${l.shape[1]}.`), w(Vn(e, o), () => `Error in conv1D: Either stride or dilation must be 1. Got stride ${e} and dilation '${o}'`), w(Bn(o), () => "Error in conv1D: Dilated rates should be larger than 0."), w(Bn(e), () => "Error in conv1D: Stride should be larger than 0."), w(r === "NWC", () => `Error in conv1d: got dataFormat of ${r} but only NWC is currently supported.`);
+  a.rank === 2 && (c = !0, u = L(a, [1, a.shape[0], a.shape[1]])), w(u.rank === 3, () => `Error in conv1d: input must be rank 3, but got rank ${u.rank}.`), w(l.rank === 3, () => `Error in conv1d: filter must be rank 3, but got rank ${l.rank}.`), _e("conv1d", s, i), w(u.shape[2] === l.shape[1], () => `Error in conv1d: depth of input (${u.shape[2]}) must match input depth for filter ${l.shape[1]}.`), w(qn(e, o), () => `Error in conv1D: Either stride or dilation must be 1. Got stride ${e} and dilation '${o}'`), w(Fn(o), () => "Error in conv1D: Dilated rates should be larger than 0."), w(Fn(e), () => "Error in conv1D: Stride should be larger than 0."), w(r === "NWC", () => `Error in conv1d: got dataFormat of ${r} but only NWC is currently supported.`);
   const h = L(l, [1, l.shape[0], l.shape[1], l.shape[2]]), f = L(u, [u.shape[0], 1, u.shape[1], u.shape[2]]), m = gi(f, h, [1, e], s, "NHWC", [1, o], i);
   return c ? L(m, [m.shape[2], m.shape[3]]) : L(m, [m.shape[0], m.shape[2], m.shape[3]]);
 }
@@ -4661,7 +4661,7 @@ const Zm = /* @__PURE__ */ k({ conv2dTranspose_: Jm });
 function Qm(n, t, e, s, r = "NDHWC", o = [1, 1, 1]) {
   const i = v(n, "x", "conv3d"), a = v(t, "filter", "conv3d");
   let l = i, u = !1;
-  i.rank === 4 && (u = !0, l = L(i, [1, i.shape[0], i.shape[1], i.shape[2], i.shape[3]])), w(l.rank === 5, () => `Error in conv3d: input must be rank 5, but got rank ${l.rank}.`), w(a.rank === 5, () => `Error in conv3d: filter must be rank 5, but got rank ${a.rank}.`), w(l.shape[4] === a.shape[3], () => `Error in conv3d: depth of input (${l.shape[4]}) must match input depth for filter ${a.shape[3]}.`), w(Vn(e, o), () => `Error in conv3D: Either strides or dilations must be 1. Got strides ${e} and dilations '${o}'`), w(r === "NDHWC", () => `Error in conv3d: got dataFormat of ${r} but only NDHWC is currently supported.`), w(Bn(o), () => "Error in conv3D: Dilated rates should be larger than 0."), w(Bn(e), () => "Error in conv3D: Strides should be larger than 0.");
+  i.rank === 4 && (u = !0, l = L(i, [1, i.shape[0], i.shape[1], i.shape[2], i.shape[3]])), w(l.rank === 5, () => `Error in conv3d: input must be rank 5, but got rank ${l.rank}.`), w(a.rank === 5, () => `Error in conv3d: filter must be rank 5, but got rank ${a.rank}.`), w(l.shape[4] === a.shape[3], () => `Error in conv3d: depth of input (${l.shape[4]}) must match input depth for filter ${a.shape[3]}.`), w(qn(e, o), () => `Error in conv3D: Either strides or dilations must be 1. Got strides ${e} and dilations '${o}'`), w(r === "NDHWC", () => `Error in conv3d: got dataFormat of ${r} but only NDHWC is currently supported.`), w(Fn(o), () => "Error in conv3D: Dilated rates should be larger than 0."), w(Fn(e), () => "Error in conv3D: Strides should be larger than 0.");
   const c = { x: l, filter: a }, h = { strides: e, pad: s, dataFormat: r, dilations: o }, f = A.runKernel(Qf, c, h);
   return u ? L(f, [f.shape[1], f.shape[2], f.shape[3], f.shape[4]]) : f;
 }
@@ -4755,7 +4755,7 @@ function ag(n, t) {
   }
   return e;
 }
-function zt(n, t) {
+function Wt(n, t) {
   const e = Math.max(n.length, t.length), s = new Array(e);
   for (let r = 0; r < e; r++) {
     let o = n[n.length - r - 1];
@@ -4791,7 +4791,7 @@ function zt(n, t) {
  */
 function lg(n, t) {
   let e = v(n, "a", "equal", "string_or_numeric"), s = v(t, "b", "equal", "string_or_numeric");
-  [e, s] = Pt(e, s), zt(e.shape, s.shape);
+  [e, s] = Pt(e, s), Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(ad, r);
 }
@@ -4813,7 +4813,7 @@ const mn = /* @__PURE__ */ k({ equal_: lg });
  * =============================================================================
  */
 function ug(n, t, e) {
-  const s = v(t, "a", "where"), r = v(e, "b", "where"), o = v(n, "condition", "where", "bool"), i = zt(zt(o.shape, s.shape), r.shape), a = er(o, i), l = er(s, i), u = er(r, i), c = {
+  const s = v(t, "a", "where"), r = v(e, "b", "where"), o = v(n, "condition", "where", "bool"), i = Wt(Wt(o.shape, s.shape), r.shape), a = er(o, i), l = er(s, i), u = er(r, i), c = {
     condition: a,
     t: l,
     e: u
@@ -4862,7 +4862,7 @@ function hg(n, ...t) {
   const e = t.map((r, o) => v(r, `tensors${o}`, "einsum")), s = { equation: n };
   return A.runKernel(rd, e, s);
 }
-const ss = /* @__PURE__ */ k({ einsum_: hg });
+const rs = /* @__PURE__ */ k({ einsum_: hg });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -4984,7 +4984,7 @@ function wg(n, t = null, e = !1) {
   const r = { x: v(n, "x", "max") }, o = { reductionIndices: t, keepDims: e };
   return A.runKernel(Id, r, o);
 }
-const We = /* @__PURE__ */ k({ max_: wg });
+const Ge = /* @__PURE__ */ k({ max_: wg });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -5093,7 +5093,7 @@ function vg(n) {
   const t = v(n, "x", "square"), e = {};
   return A.runKernel("Square", { x: t }, e);
 }
-const Ge = /* @__PURE__ */ k({ square_: vg });
+const Ve = /* @__PURE__ */ k({ square_: vg });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -5138,7 +5138,7 @@ function Ag(n, t = "euclidean", e = null, s = !1) {
   const r = Tu(n, t, e);
   let o = r.shape;
   if (s) {
-    const i = As(e, n.shape);
+    const i = Es(e, n.shape);
     o = _u(r.shape, i);
   }
   return L(r, o);
@@ -5152,7 +5152,7 @@ function Tu(n, t, e = null) {
     if (t === 1)
       return et(Nt(n), e);
     if (t === 1 / 0)
-      return We(Nt(n), e);
+      return Ge(Nt(n), e);
     if (t === -1 / 0)
       return Pa(Nt(n), e);
     if (t === "euclidean" || t === 2)
@@ -5161,13 +5161,13 @@ function Tu(n, t, e = null) {
   }
   if (Array.isArray(e) && e.length === 2) {
     if (t === 1)
-      return We(et(Nt(n), e[0]), e[1] - 1);
+      return Ge(et(Nt(n), e[0]), e[1] - 1);
     if (t === 1 / 0)
-      return We(et(Nt(n), e[1]), e[0]);
+      return Ge(et(Nt(n), e[1]), e[0]);
     if (t === -1 / 0)
       return Pa(et(Nt(n), e[1]), e[0]);
     if (t === "fro" || t === "euclidean")
-      return de(et(Ge(n), e));
+      return de(et(Ve(n), e));
     throw new Error(`Error in norm: invalid ord value: ${t}`);
   }
   throw new Error(`Error in norm: invalid axis: ${e}`);
@@ -5339,11 +5339,11 @@ const Rg = /* @__PURE__ */ k({ gather_: Dg });
  */
 function Pg(n, t) {
   let e = v(n, "a", "greater", "string_or_numeric"), s = v(t, "b", "greater", "string_or_numeric");
-  [e, s] = Pt(e, s), zt(e.shape, s.shape);
+  [e, s] = Pt(e, s), Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(md, r);
 }
-const Cs = /* @__PURE__ */ k({ greater_: Pg });
+const ks = /* @__PURE__ */ k({ greater_: Pg });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -5362,7 +5362,7 @@ const Cs = /* @__PURE__ */ k({ greater_: Pg });
  */
 function Lg(n, t) {
   let e = v(n, "a", "greaterEqual", "string_or_numeric"), s = v(t, "b", "greaterEqual", "string_or_numeric");
-  [e, s] = Pt(e, s), zt(e.shape, s.shape);
+  [e, s] = Pt(e, s), Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(gd, r);
 }
@@ -5427,7 +5427,7 @@ const zg = /* @__PURE__ */ k({ leakyRelu_: Fg });
  */
 function Ug(n, t) {
   let e = v(n, "a", "less", "string_or_numeric"), s = v(t, "b", "less", "string_or_numeric");
-  [e, s] = Pt(e, s), zt(e.shape, s.shape);
+  [e, s] = Pt(e, s), Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(wd, r);
 }
@@ -5450,7 +5450,7 @@ const La = /* @__PURE__ */ k({ less_: Ug });
  */
 function Wg(n, t) {
   let e = v(n, "a", "lessEqual", "string_or_numeric"), s = v(t, "b", "lessEqual", "string_or_numeric");
-  [e, s] = Pt(e, s), zt(e.shape, s.shape);
+  [e, s] = Pt(e, s), Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(xd, r);
 }
@@ -5553,7 +5553,7 @@ function Hg(n) {
   const e = { x: v(n, "x", "neg") };
   return A.runKernel(Nd, e);
 }
-const qn = /* @__PURE__ */ k({ neg_: Hg });
+const jn = /* @__PURE__ */ k({ neg_: Hg });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -5619,7 +5619,7 @@ function Xg(n, t = -1) {
   if (t === -1 && (t = e.rank - 1), t !== e.rank - 1)
     throw Error(`Log Softmax along a non-last dimension is not yet supported. Logits was rank ${e.rank} and axis was ${t}`);
   return Wo((r, o) => {
-    const a = We(r, t, !0), l = Z(r, a), u = Z(ot(l, "float32"), gn(et(Uo(l), t, !0)));
+    const a = Ge(r, t, !0), l = Z(r, a), u = Z(ot(l, "float32"), gn(et(Uo(l), t, !0)));
     return o([u]), { value: u, gradFunc: (h, f) => {
       const [d] = f, p = !0, g = Uo(d);
       return Z(h, N(et(h, t, p), g));
@@ -5645,7 +5645,7 @@ const Jg = /* @__PURE__ */ k({ logSoftmax_: Xg });
  */
 function Zg(n, t) {
   const e = v(n, "a", "logicalAnd", "bool"), s = v(t, "b", "logicalAnd", "bool");
-  zt(e.shape, s.shape);
+  Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(vd, r);
 }
@@ -5669,7 +5669,7 @@ const Gr = /* @__PURE__ */ k({ logicalAnd_: Zg });
 function Qg(n, t, e, s, r) {
   const o = v(n, "x", "maxPool"), i = 1;
   let a = o, l = !1;
-  o.rank === 3 && (l = !0, a = L(o, [1, o.shape[0], o.shape[1], o.shape[2]])), w(a.rank === 4, () => `Error in maxPool: input must be rank 4 but got rank ${a.rank}.`), w(Vn(e, i), () => `Error in maxPool: Either strides or dilations must be 1. Got strides ${e} and dilations '${i}'`), _e("maxPool", s, r);
+  o.rank === 3 && (l = !0, a = L(o, [1, o.shape[0], o.shape[1], o.shape[2]])), w(a.rank === 4, () => `Error in maxPool: input must be rank 4 but got rank ${a.rank}.`), w(qn(e, i), () => `Error in maxPool: Either strides or dilations must be 1. Got strides ${e} and dilations '${i}'`), _e("maxPool", s, r);
   const u = { x: a }, c = { filterSize: t, strides: e, pad: s, dimRoundingMode: r }, h = A.runKernel(Kl, u, c);
   return l ? L(h, [h.shape[1], h.shape[2], h.shape[3]]) : h;
 }
@@ -5716,11 +5716,11 @@ const n0 = /* @__PURE__ */ k({ maxPool3d_: e0 });
  */
 function s0(n, t) {
   let e = v(n, "a", "maximum"), s = v(t, "b", "maximum");
-  [e, s] = Pt(e, s), e.dtype === "bool" && (e = ot(e, "int32"), s = ot(s, "int32")), zt(e.shape, s.shape);
+  [e, s] = Pt(e, s), e.dtype === "bool" && (e = ot(e, "int32"), s = ot(s, "int32")), Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(Ad, r);
 }
-const jn = /* @__PURE__ */ k({ maximum_: s0 });
+const Hn = /* @__PURE__ */ k({ maximum_: s0 });
 /**
  * @license
  * Copyright 2020 Google Inc. All Rights Reserved.
@@ -5758,12 +5758,12 @@ const St = /* @__PURE__ */ k({ mean_: r0 });
  * limitations under the License.
  * =============================================================================
  */
-function Fn(n, t = "float32") {
+function zn(n, t = "float32") {
   if (Me(n), t === "complex64") {
-    const s = Fn(n, "float32"), r = Fn(n, "float32");
+    const s = zn(n, "float32"), r = zn(n, "float32");
     return hi(s, r);
   }
-  const e = qe(U(n), t);
+  const e = je(U(n), t);
   return A.makeTensor(e, n, t);
 }
 /**
@@ -5784,7 +5784,7 @@ function Fn(n, t = "float32") {
  */
 function wi(n, t = "float32") {
   if (Me(n), t === "complex64") {
-    const s = wi(n, "float32"), r = Fn(n, "float32");
+    const s = wi(n, "float32"), r = zn(n, "float32");
     return hi(s, r);
   }
   const e = Wl(U(n), t);
@@ -5808,7 +5808,7 @@ function wi(n, t = "float32") {
  */
 function o0(n, t) {
   let e = v(n, "a", "minimum"), s = v(t, "b", "minimum");
-  [e, s] = Pt(e, s), e.dtype === "bool" && (e = ot(e, "int32"), s = ot(s, "int32")), zt(e.shape, s.shape);
+  [e, s] = Pt(e, s), e.dtype === "bool" && (e = ot(e, "int32"), s = ot(s, "int32")), Wt(e.shape, s.shape);
   const r = { a: e, b: s };
   return A.runKernel(_d, r);
 }
@@ -6395,7 +6395,7 @@ function R0(n) {
   const e = { x: v(n, "x", "relu") };
   return A.runKernel(Wd, e);
 }
-const ks = /* @__PURE__ */ k({ relu_: R0 });
+const _s = /* @__PURE__ */ k({ relu_: R0 });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -6762,7 +6762,7 @@ function tb(n, t, e) {
   const r = { x: s }, o = { perm: t };
   return s.dtype === "complex64" ? C(() => {
     let i = D0(s), a = Bg(s);
-    return i = A.runKernel(ro, { x: i }, o), a = A.runKernel(ro, { x: a }, o), e && (a = qn(a)), hi(i, a);
+    return i = A.runKernel(ro, { x: i }, o), a = A.runKernel(ro, { x: a }, o), e && (a = jn(a)), hi(i, a);
   }) : A.runKernel(ro, r, o);
 }
 const pt = /* @__PURE__ */ k({ transpose_: tb });
@@ -6825,7 +6825,7 @@ function ob(n, t, e, s) {
   if (t === "linear")
     return n;
   if (t === "relu")
-    return ks(n);
+    return _s(n);
   if (t === "elu")
     return Cu(n);
   if (t === "relu6")
@@ -6865,10 +6865,10 @@ function ab({ x: n, filter: t, strides: e, pad: s, dataFormat: r = "NHWC", dilat
   let d = h, p = !1;
   h.rank === 3 && (p = !0, d = L(h, [1, h.shape[0], h.shape[1], h.shape[2]])), w(d.rank === 4, () => `Error in fused conv2d: input must be rank 4, but got rank ${d.rank}.`), w(f.rank === 4, () => `Error in fused conv2d: filter must be rank 4, but got rank ${f.rank}.`), _e("fused conv2d", s, i);
   const g = r === "NHWC" ? d.shape[3] : d.shape[1];
-  w(f.shape[2] === g, () => `Error in conv2d: depth of input (${g}) must match input depth for filter ${f.shape[2]}.`), w(Vn(e, o), () => `Error in conv2D: Either strides or dilations must be 1. Got strides ${e} and dilations '${o}'`);
+  w(f.shape[2] === g, () => `Error in conv2d: depth of input (${g}) must match input depth for filter ${f.shape[2]}.`), w(qn(e, o), () => `Error in conv2D: Either strides or dilations must be 1. Got strides ${e} and dilations '${o}'`);
   const m = di(d.shape, f.shape, e, o, s, i);
   let b;
-  a != null && (b = v(a, "bias", "fused conv2d"), [b] = Pt(b, h), r === "NHWC" ? zt(m.outShape, b.shape) : (w(b.shape.length <= 1, () => `Error in fused conv2d: only supports scalar or 1-D Tensor bias for NCHW format but got the bias of rank-${b.shape.length}.`), w(b.shape.length === 0 || b.shape[0] === m.outChannels || b.shape[0] === 1, () => `Error in fused conv2d: bias shape (${b.shape}) is not compatible with the number of output channels (${m.outChannels})`)));
+  a != null && (b = v(a, "bias", "fused conv2d"), [b] = Pt(b, h), r === "NHWC" ? Wt(m.outShape, b.shape) : (w(b.shape.length <= 1, () => `Error in fused conv2d: only supports scalar or 1-D Tensor bias for NCHW format but got the bias of rank-${b.shape.length}.`), w(b.shape.length === 0 || b.shape[0] === m.outChannels || b.shape[0] === 1, () => `Error in fused conv2d: bias shape (${b.shape}) is not compatible with the number of output channels (${m.outChannels})`)));
   let y;
   if (u != null) {
     const E = u.shape;
@@ -6876,7 +6876,7 @@ function ab({ x: n, filter: t, strides: e, pad: s, dataFormat: r = "NHWC", dilat
       w(E[0] === 1 || E[0] === m.outChannels, () => `Error in fused conv2d: PReLU activation weights (${E}) is not compatible with the number of output channels (${m.outChannels}).`);
     else if (E.length === 3)
       try {
-        zt(E, m.outShape);
+        Wt(E, m.outShape);
       } catch {
         const _ = `Error in fused conv2d: PReLU activation weights (${E}) is not compatible with the output shape of the conv2d (${m.outShape}).`;
         throw Error(_);
@@ -7011,19 +7011,19 @@ function mb(n) {
   let a;
   switch (t.rank) {
     case 2:
-      a = ss("ij,j->i", o, i);
+      a = rs("ij,j->i", o, i);
       break;
     case 3:
-      a = ss("ijk,k->ij", o, i);
+      a = rs("ijk,k->ij", o, i);
       break;
     case 4:
-      a = ss("ijkl,l->ijk", o, i);
+      a = rs("ijkl,l->ijk", o, i);
       break;
     case 5:
-      a = ss("ijklm,m->ijkl", o, i);
+      a = rs("ijklm,m->ijkl", o, i);
       break;
     case 6:
-      a = ss("ijklmn,n->ijklm", o, i);
+      a = rs("ijklmn,n->ijklm", o, i);
       break;
     default:
       throw new Error("Not a valid tensor rank.");
@@ -7070,7 +7070,7 @@ const yb = /* @__PURE__ */ k({ rotateWithOffset_: bb });
  * limitations under the License.
  * =============================================================================
  */
-function Hn(n, t, e, s, r, o) {
+function Kn(n, t, e, s, r, o) {
   s == null && (s = 0.5), r == null && (r = Number.NEGATIVE_INFINITY), o == null && (o = 0);
   const i = n.shape[0];
   return e = Math.min(e, i), w(0 <= s && s <= 1, () => `iouThreshold must be in [0, 1], but was '${s}'`), w(n.rank === 2, () => `boxes must be a 2D tensor, but was of rank '${n.rank}'`), w(n.shape[1] === 4, () => `boxes must have 4 columns, but 2nd dimension was ${n.shape[1]}`), w(t.rank === 1, () => "scores must be a 1D tensor"), w(t.shape[0] === i, () => `scores has incompatible shape with boxes. Expected ${i}, but was ${t.shape[0]}`), w(0 <= o && o <= 1, () => `softNmsSigma must be in [0, 1], but was '${o}'`), { maxOutputSize: e, iouThreshold: s, scoreThreshold: r, softNmsSigma: o };
@@ -7092,7 +7092,7 @@ function Hn(n, t, e, s, r, o) {
  * =============================================================================
  */
 function wb(n, t, e, s = 0.5, r = Number.NEGATIVE_INFINITY) {
-  const o = v(n, "boxes", "nonMaxSuppression", "float32"), i = v(t, "scores", "nonMaxSuppression", "float32"), a = Hn(o, i, e, s, r);
+  const o = v(n, "boxes", "nonMaxSuppression", "float32"), i = v(t, "scores", "nonMaxSuppression", "float32"), a = Kn(o, i, e, s, r);
   e = a.maxOutputSize, s = a.iouThreshold, r = a.scoreThreshold;
   const l = { maxOutputSize: e, iouThreshold: s, scoreThreshold: r };
   return A.runKernel(Dd, { boxes: o, scores: i }, l);
@@ -7244,7 +7244,7 @@ function Ma(n, t) {
  * =============================================================================
  */
 async function Tb(n, t, e, s = 0.5, r = Number.NEGATIVE_INFINITY) {
-  const o = v(n, "boxes", "nonMaxSuppressionAsync"), i = v(t, "scores", "nonMaxSuppressionAsync"), a = Hn(o, i, e, s, r);
+  const o = v(n, "boxes", "nonMaxSuppressionAsync"), i = v(t, "scores", "nonMaxSuppressionAsync"), a = Kn(o, i, e, s, r);
   e = a.maxOutputSize, s = a.iouThreshold, r = a.scoreThreshold;
   const l = await Promise.all([o.data(), i.data()]), u = l[0], c = l[1], { selectedIndices: h } = Ab(u, c, e, s, r);
   return o !== n && o.dispose(), i !== t && i.dispose(), Dt(h, "int32");
@@ -7267,7 +7267,7 @@ const Nb = Tb;
  * =============================================================================
  */
 function Db(n, t, e, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
-  const i = v(n, "boxes", "nonMaxSuppression"), a = v(t, "scores", "nonMaxSuppression"), l = Hn(i, a, e, s, r, o);
+  const i = v(n, "boxes", "nonMaxSuppression"), a = v(t, "scores", "nonMaxSuppression"), l = Kn(i, a, e, s, r, o);
   e = l.maxOutputSize, s = l.iouThreshold, r = l.scoreThreshold, o = l.softNmsSigma;
   const u = { boxes: i, scores: a }, c = { maxOutputSize: e, iouThreshold: s, scoreThreshold: r, softNmsSigma: o }, h = A.runKernel(Pd, u, c);
   return { selectedIndices: h[0], selectedScores: h[1] };
@@ -7290,7 +7290,7 @@ const Rb = /* @__PURE__ */ k({ nonMaxSuppressionWithScore_: Db });
  * =============================================================================
  */
 async function Pb(n, t, e, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
-  const i = v(n, "boxes", "nonMaxSuppressionAsync"), a = v(t, "scores", "nonMaxSuppressionAsync"), l = Hn(i, a, e, s, r, o);
+  const i = v(n, "boxes", "nonMaxSuppressionAsync"), a = v(t, "scores", "nonMaxSuppressionAsync"), l = Kn(i, a, e, s, r, o);
   e = l.maxOutputSize, s = l.iouThreshold, r = l.scoreThreshold, o = l.softNmsSigma;
   const u = await Promise.all([i.data(), a.data()]), c = u[0], h = u[1], { selectedIndices: f, selectedScores: d } = Cb(c, h, e, s, r, o);
   return i !== n && i.dispose(), a !== t && a.dispose(), {
@@ -7316,7 +7316,7 @@ const Lb = Pb;
  * =============================================================================
  */
 function Mb(n, t, e, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
-  const i = v(n, "boxes", "nonMaxSuppression"), a = v(t, "scores", "nonMaxSuppression"), l = Hn(
+  const i = v(n, "boxes", "nonMaxSuppression"), a = v(t, "scores", "nonMaxSuppression"), l = Kn(
     i,
     a,
     e,
@@ -7350,7 +7350,7 @@ const Ob = /* @__PURE__ */ k({ nonMaxSuppressionPadded_: Mb });
  * =============================================================================
  */
 async function Bb(n, t, e, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
-  const i = v(n, "boxes", "nonMaxSuppressionAsync"), a = v(t, "scores", "nonMaxSuppressionAsync"), l = Hn(
+  const i = v(n, "boxes", "nonMaxSuppressionAsync"), a = v(t, "scores", "nonMaxSuppressionAsync"), l = Kn(
     i,
     a,
     e,
@@ -7444,7 +7444,7 @@ function Vb(n, t = "binary", e = !1, s = 0.5) {
     const m = Vm(ot(O0(d), "int32"), tr([]), 256);
     u = qb(m, l);
   }
-  const p = e ? Ru(d, u) : Cs(d, u);
+  const p = e ? Ru(d, u) : ks(d, u);
   return ot(N(p, 255), "int32");
 }
 function qb(n, t) {
@@ -7457,7 +7457,7 @@ function qb(n, t) {
     l = X(et(g), et(i));
     const m = Z(a, l), b = Z(a, l), y = N(u, c);
     r = N(N(y, m), b);
-    const S = Cs(r, s);
+    const S = ks(r, s);
     s = on(S, r, s), e = on(S, Dt([h]), e);
   }
   return e;
@@ -7508,7 +7508,7 @@ function Yb(n, t, e) {
   const r = s.shape, [o, i] = s.shape.slice(-2);
   let a, l;
   typeof t == "number" ? (w(t % 1 === 0, () => `bandPart(): numLower must be an integer, got ${t}.`), w(t <= o, () => `bandPart(): numLower (${t}) must not be greater than the number of rows (${o}).`), a = v(t < 0 ? o : t, "numLower", "bandPart")) : (w(t.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), a = on(La(t, 0), o, dr(t, o))), typeof e == "number" ? (w(e % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${e}.`), w(e <= i, () => `bandPart(): numUpper (${e}) must not be greater than the number of columns (${i}).`), l = v(e < 0 ? i : e, "numUpper", "bandPart")) : (w(e.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), l = on(La(e, 0), i, dr(e, i)));
-  const u = L(pr(0, o, 1, "int32"), [-1, 1]), c = pr(0, i, 1, "int32"), h = Z(u, c), f = Gr(Ru(h, a), Mg(h, qn(l))), d = Fn([o, i], s.dtype);
+  const u = L(pr(0, o, 1, "int32"), [-1, 1]), c = pr(0, i, 1, "int32"), h = Z(u, c), f = Gr(Ru(h, a), Mg(h, jn(l))), d = zn([o, i], s.dtype);
   return L(mr(Gu(L(s, [-1, o, i])).map((p) => on(f, p, d))), r);
 }
 const Xb = /* @__PURE__ */ k({ bandPart_: Yb });
@@ -7596,12 +7596,12 @@ function Oa(n, t = !1) {
     for (let u = 0; u < l; ++u) {
       const c = o, h = a, f = r;
       [a, o, r] = A.tidy(() => {
-        const d = At(o, [u, u], [e - u, 1]), p = Nu(d), g = At(o, [u, u], [1, 1]), m = on(Cs(g, 0), uo([[-1]]), uo([[1]])), b = Z(g, N(m, p)), y = X(d, b);
+        const d = At(o, [u, u], [e - u, 1]), p = Nu(d), g = At(o, [u, u], [1, 1]), m = on(ks(g, 0), uo([[-1]]), uo([[1]])), b = Z(g, N(m, p)), y = X(d, b);
         y.shape[0] === 1 ? a = sn(i) : a = rn([
           i,
           At(y, [1, 0], [y.shape[0] - 1, y.shape[1]])
         ], 0);
-        const S = qn(X(ye(m, b), p)), x = At(o, [u, 0], [e - u, s]), $ = N(S, a), E = pt(a);
+        const S = jn(X(ye(m, b), p)), x = At(o, [u, 0], [e - u, s]), $ = N(S, a), E = pt(a);
         if (u === 0)
           o = Z(x, ye($, ye(E, x)));
         else {
@@ -7676,7 +7676,7 @@ const zs = {
  * =============================================================================
  */
 const ny = /* @__PURE__ */ new Map(), sy = /* @__PURE__ */ new Map();
-class Kn {
+class Yn {
   /**
    * Return the class name for this class to use in serialization contexts.
    *
@@ -7742,7 +7742,7 @@ function M(n, t, e) {
  * limitations under the License.
  * =============================================================================
  */
-class He extends Kn {
+class Ke extends Yn {
   /**
    * Executes `f()` and minimizes the scalar output of `f()` by computing
    * gradients of y with respect to the list of trainable variables provided by
@@ -7821,7 +7821,7 @@ class He extends Kn {
     return this.iterations_ = (await t[0].tensor.data())[0], t.slice(1);
   }
 }
-Object.defineProperty(He, Symbol.hasInstance, {
+Object.defineProperty(Ke, Symbol.hasInstance, {
   value: (n) => n.minimize != null && n.computeGradients != null && n.applyGradients != null
 });
 /**
@@ -7840,7 +7840,7 @@ Object.defineProperty(He, Symbol.hasInstance, {
  * limitations under the License.
  * =============================================================================
  */
-class Vu extends He {
+class Vu extends Ke {
   /** @nocollapse */
   static get className() {
     return "Adadelta";
@@ -7863,7 +7863,7 @@ class Vu extends He {
         return;
       const l = this.accumulatedGrads[r].variable, u = this.accumulatedUpdates[r].variable;
       C(() => {
-        const c = O(N(l, this.rho), N(Ge(a), 1 - this.rho)), h = N(X(de(O(u, this.epsilon)), de(O(l, this.epsilon))), a), f = O(N(u, this.rho), N(Ge(h), 1 - this.rho));
+        const c = O(N(l, this.rho), N(Ve(a), 1 - this.rho)), h = N(X(de(O(u, this.epsilon)), de(O(l, this.epsilon))), a), f = O(N(u, this.rho), N(Ve(h), 1 - this.rho));
         l.assign(c), u.assign(f);
         const d = O(N(h, -this.learningRate), o);
         o.assign(d);
@@ -7916,7 +7916,7 @@ class Vu extends He {
  * limitations under the License.
  * =============================================================================
  */
-class qu extends He {
+class qu extends Ke {
   /** @nocollapse */
   static get className() {
     return "Adagrad";
@@ -7936,7 +7936,7 @@ class qu extends He {
         return;
       const a = this.accumulatedGrads[r].variable;
       C(() => {
-        const l = O(a, Ge(i));
+        const l = O(a, Ve(i));
         a.assign(l);
         const u = O(N(X(i, de(O(l, A.backend.epsilon()))), -this.learningRate), o);
         o.assign(u);
@@ -7981,7 +7981,7 @@ class qu extends He {
  * limitations under the License.
  * =============================================================================
  */
-class ju extends He {
+class ju extends Ke {
   /** @nocollapse */
   static get className() {
     return "Adam";
@@ -8007,7 +8007,7 @@ class ju extends He {
         const u = Array.isArray(t) ? t[i].tensor : t[o];
         if (u == null)
           return;
-        const c = this.accumulatedFirstMoment[i].variable, h = this.accumulatedSecondMoment[i].variable, f = O(N(c, this.beta1), N(u, 1 - this.beta1)), d = O(N(h, this.beta2), N(Ge(u), 1 - this.beta2)), p = X(f, s), g = X(d, r);
+        const c = this.accumulatedFirstMoment[i].variable, h = this.accumulatedSecondMoment[i].variable, f = O(N(c, this.beta1), N(u, 1 - this.beta1)), d = O(N(h, this.beta2), N(Ve(u), 1 - this.beta2)), p = X(f, s), g = X(d, r);
         c.assign(f), h.assign(d);
         const m = O(N(X(p, O(de(g), this.epsilon)), -this.learningRate), a);
         a.assign(m);
@@ -8063,7 +8063,7 @@ class ju extends He {
  * limitations under the License.
  * =============================================================================
  */
-class Hu extends He {
+class Hu extends Ke {
   /** @nocollapse */
   static get className() {
     return "Adamax";
@@ -8089,7 +8089,7 @@ class Hu extends He {
         const u = Array.isArray(t) ? t[i].tensor : t[o];
         if (u == null)
           return;
-        const c = this.accumulatedFirstMoment[i].variable, h = this.accumulatedWeightedInfNorm[i].variable, f = O(N(c, this.beta1), N(u, 1 - this.beta1)), d = N(h, this.beta2), p = Nt(u), g = jn(d, p);
+        const c = this.accumulatedFirstMoment[i].variable, h = this.accumulatedWeightedInfNorm[i].variable, f = O(N(c, this.beta1), N(u, 1 - this.beta1)), d = N(h, this.beta2), p = Nt(u), g = Hn(d, p);
         c.assign(f), h.assign(g);
         const m = O(N(X(r, s), X(f, O(g, this.epsilon))), a);
         a.assign(m);
@@ -8135,7 +8135,7 @@ class Hu extends He {
  * limitations under the License.
  * =============================================================================
  */
-class _i extends He {
+class _i extends Ke {
   /** @nocollapse */
   static get className() {
     return "SGD";
@@ -8159,7 +8159,7 @@ class _i extends He {
    * Sets the learning rate of the optimizer.
    */
   setLearningRate(t) {
-    this.learningRate = t, this.c != null && this.c.dispose(), this.c = Rn(Kt(-t));
+    this.learningRate = t, this.c != null && this.c.dispose(), this.c = Pn(Kt(-t));
   }
   dispose() {
     this.c.dispose();
@@ -8266,7 +8266,7 @@ class Ku extends _i {
  * limitations under the License.
  * =============================================================================
  */
-class Yu extends He {
+class Yu extends Ke {
   /** @nocollapse */
   static get className() {
     return "RMSProp";
@@ -8293,14 +8293,14 @@ class Yu extends He {
         return;
       const l = this.accumulatedMeanSquares[r].variable, u = this.accumulatedMoments[r].variable;
       C(() => {
-        const c = O(N(l, this.decay), N(Ge(a), 1 - this.decay));
+        const c = O(N(l, this.decay), N(Ve(a), 1 - this.decay));
         if (this.centered) {
-          const h = this.accumulatedMeanGrads[r].variable, f = O(N(h, this.decay), N(a, 1 - this.decay)), d = X(N(a, this.learningRate), de(Z(c, O(Ge(f), this.epsilon)))), p = O(N(u, this.momentum), d);
+          const h = this.accumulatedMeanGrads[r].variable, f = O(N(h, this.decay), N(a, 1 - this.decay)), d = X(N(a, this.learningRate), de(Z(c, O(Ve(f), this.epsilon)))), p = O(N(u, this.momentum), d);
           l.assign(c), h.assign(f), u.assign(p);
           const g = Z(o, p);
           o.assign(g);
         } else {
-          const h = O(N(l, this.decay), N(Ge(a), 1 - this.decay)), f = O(N(u, this.momentum), X(N(a, this.learningRate), de(O(h, this.epsilon))));
+          const h = O(N(l, this.decay), N(Ve(a), 1 - this.decay)), f = O(N(u, this.momentum), X(N(a, this.learningRate), de(O(h, this.epsilon))));
           l.assign(h), u.assign(f);
           const d = Z(o, f);
           o.assign(d);
@@ -8601,7 +8601,7 @@ class cy {
  * limitations under the License.
  * =============================================================================
  */
-const vn = cy;
+const In = cy;
 /**
  * @license
  * Copyright 2017 Google LLC. All Rights Reserved.
@@ -8649,7 +8649,7 @@ function dy(n, t) {
       w(i === t || r[i] === s[i], () => `Error in concat${e}D: Shape of tensors[${o}] (${r}) does not match the shape of the rest (${s}) along the non-concatenated axis ${o}.`);
   });
 }
-function ws(n, t) {
+function xs(n, t) {
   const e = n[0].slice();
   for (let s = 1; s < n.length; s++)
     e[t] += n[s][t];
@@ -8938,14 +8938,14 @@ const By = ["channelsFirst", "channelsLast"], Fy = ["nearest", "bilinear"], zy =
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-class Be extends Error {
+class Fe extends Error {
   constructor(t) {
-    super(t), Object.setPrototypeOf(this, Be.prototype);
+    super(t), Object.setPrototypeOf(this, Fe.prototype);
   }
 }
-class Ve extends Error {
+class qe extends Error {
   constructor(t) {
-    super(t), Object.setPrototypeOf(this, Ve.prototype);
+    super(t), Object.setPrototypeOf(this, qe.prototype);
   }
 }
 class I extends Error {
@@ -8993,7 +8993,7 @@ function za(n, t) {
     s === t && e++;
   return e;
 }
-function Bt(n) {
+function zt(n) {
   return n.length === 1 ? n[0] : n;
 }
 function st(n) {
@@ -9025,7 +9025,7 @@ function Go(n) {
       }
     }
 }
-function _s(n, t = {}, e = {}, s = "object", r = !1) {
+function Ts(n, t = {}, e = {}, s = "object", r = !1) {
   if (typeof n == "string") {
     const o = n;
     let i;
@@ -9094,7 +9094,7 @@ function Gy(n) {
       return !1;
   return !0;
 }
-function Yn(n, t, e) {
+function Xn(n, t, e) {
   if (e != null && n.indexOf(e) < 0)
     throw new I(`${e} is not a valid ${t}.  Valid values are ${n} or null/undefined.`);
 }
@@ -9108,9 +9108,9 @@ function Ju(n) {
   return n === null ? "null" : Array.isArray(n) ? "[" + n.map((t) => Ju(t)).join(",") + "]" : typeof n == "string" ? `"${n}"` : `${n}`;
 }
 function Vy(n, t, e) {
-  let s = e != null ? e() : Mn(), r;
+  let s = e != null ? e() : On(), r;
   return (...i) => {
-    const a = e != null ? e() : Mn();
+    const a = e != null ? e() : On();
     return a - s < t || (s = a, r = n(...i)), r;
   };
 }
@@ -9126,31 +9126,31 @@ function qy(n) {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-const In = /* @__PURE__ */ new Map();
+const An = /* @__PURE__ */ new Map();
 function gt(n) {
-  Yn(By, "DataFormat", n);
+  Xn(By, "DataFormat", n);
 }
 function jy(n) {
-  Yn(Fy, "InterpolationFormat", n);
+  Xn(Fy, "InterpolationFormat", n);
 }
 function oe(n) {
-  Yn(zy, "PaddingMode", n);
+  Xn(zy, "PaddingMode", n);
 }
 function Zu(n) {
-  Yn(Uy, "PoolMode", n);
+  Xn(Uy, "PoolMode", n);
 }
-const ds = [], Ua = "/";
+const ps = [], Ua = "/";
 function sr(n, t) {
-  ds.push(n);
+  ps.push(n);
   try {
     const e = t();
-    return ds.pop(), e;
+    return ps.pop(), e;
   } catch (e) {
-    throw ds.pop(), e;
+    throw ps.pop(), e;
   }
 }
 function Hy() {
-  return ds.length === 0 ? "" : ds.join(Ua) + Ua;
+  return ps.length === 0 ? "" : ps.join(Ua) + Ua;
 }
 function Qu(n) {
   if (!ec(n))
@@ -9160,11 +9160,11 @@ function Qu(n) {
 function tc(n) {
   if (!ec(n))
     throw new Error("Not a valid tensor name: '" + n + "'");
-  In.has(n) || In.set(n, 0);
-  const t = In.get(n);
-  if (In.set(n, In.get(n) + 1), t > 0) {
+  An.has(n) || An.set(n, 0);
+  const t = An.get(n);
+  if (An.set(n, An.get(n) + 1), t > 0) {
     const e = `${n}_${t}`;
-    return In.set(e, 1), e;
+    return An.set(e, 1), e;
   } else
     return n;
 }
@@ -9184,7 +9184,7 @@ function ec(n) {
 function Yy(n) {
   return n === parseInt(n.toString(), 10);
 }
-function ps(n, t, e) {
+function ms(n, t, e) {
   t == null && (t = 0), e == null && (e = n.length);
   let s = 1;
   for (let r = t; r < e; ++r)
@@ -9222,7 +9222,7 @@ let co;
 function mt() {
   return co == null && (co = Zp().epsilon()), co;
 }
-function Xn() {
+function Jn() {
   return "channelsLast";
 }
 /**
@@ -9242,7 +9242,7 @@ function Ri(n, t = -1) {
   return t < 0 && (t = e.length + t + 1), e.splice(t, 0, 1), L(n, e);
 }
 function Xy(n) {
-  const t = [ps(n.shape)];
+  const t = [ms(n.shape)];
   return L(n, t);
 }
 function ln(n, t, e) {
@@ -9255,7 +9255,7 @@ function ln(n, t, e) {
       case 3:
         return Ci(n, [t, 0, 0], [e, n.shape[1], n.shape[2]]);
       case 4:
-        return bs(n, [t, 0, 0, 0], [e, n.shape[1], n.shape[2], n.shape[3]]);
+        return ys(n, [t, 0, 0, 0], [e, n.shape[1], n.shape[2], n.shape[3]]);
       case 5:
         return At(n, [t, 0, 0, 0, 0], [
           e,
@@ -9288,7 +9288,7 @@ function ho(n, t, e) {
       case 3:
         return Ci(n, [0, 0, t], [n.shape[0], n.shape[1], e]);
       case 4:
-        return bs(n, [0, 0, 0, t], [n.shape[0], n.shape[1], n.shape[2], e]);
+        return ys(n, [0, 0, 0, t], [n.shape[0], n.shape[1], n.shape[2], e]);
       default:
         throw new I(`sliceAlongLastAxis() received an unsupported tensor rank: ${n.rank}`);
     }
@@ -9324,9 +9324,9 @@ function Ws(n, t, e, s) {
           case 1:
             return ln(n, t, e);
           case 2:
-            return bs(n, [0, t, 0, 0], [n.shape[0], e, n.shape[2], n.shape[3]]);
+            return ys(n, [0, t, 0, 0], [n.shape[0], e, n.shape[2], n.shape[3]]);
           case 3:
-            return bs(n, [0, 0, t, 0], [n.shape[0], n.shape[1], e, n.shape[3]]);
+            return ys(n, [0, 0, t, 0], [n.shape[0], n.shape[1], e, n.shape[3]]);
           case 4:
             return ho(n, t, e);
           default:
@@ -9347,7 +9347,7 @@ function rc(n, t = 0, e = 1, s, r) {
 function Zy(n, t, e) {
   return C(() => (Array.isArray(t) ? t = Dt(t, "int32") : t = ot(t, "int32"), Rg(n, t, e)));
 }
-function Ts(n) {
+function Ns(n) {
   return N(n, n);
 }
 function Qy(n, t, e) {
@@ -9373,8 +9373,8 @@ function Qy(n, t, e) {
     return t;
   throw new I(`Unsupported input rank by biasAdd: ${t.rank}`);
 }
-function Ns(n, t, e) {
-  return C(() => (e == null && (e = Xn()), gt(e), O(n, Qy(n.rank, t, e))));
+function Ds(n, t, e) {
+  return C(() => (e == null && (e = Jn()), gt(e), O(n, Qy(n.rank, t, e))));
 }
 function tw(n, t = 1) {
   if (t !== 1)
@@ -9399,7 +9399,7 @@ function nw(n) {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-class Ct extends Kn {
+class Ct extends Yn {
   getConfig() {
     return {};
   }
@@ -9427,14 +9427,14 @@ ic.className = "selu";
 M(ic);
 class ac extends Ct {
   apply(t) {
-    return ks(t);
+    return _s(t);
   }
 }
 ac.className = "relu";
 M(ac);
 class lc extends Ct {
   apply(t) {
-    return C(() => dr(6, ks(t)));
+    return C(() => dr(6, _s(t)));
   }
 }
 lc.className = "relu6";
@@ -9580,7 +9580,7 @@ function sw(n) {
   return n.getClassName();
 }
 function fo(n, t = {}) {
-  return _s(n, Qt.getMap().classNameMap, t, "activation");
+  return Ts(n, Qt.getMap().classNameMap, t, "activation");
 }
 function rw(n) {
   if (n == null) {
@@ -9605,12 +9605,12 @@ function rw(n) {
 function Pi(n, t) {
   return C(() => de(et(N(n, n), t, !0)));
 }
-class Ds extends Kn {
+class Rs extends Yn {
   getConfig() {
     return {};
   }
 }
-class Sc extends Ds {
+class Sc extends Rs {
   constructor(t) {
     super(), this.defaultMaxValue = 2, this.defaultAxis = 0, this.maxValue = t.maxValue != null ? t.maxValue : this.defaultMaxValue, this.axis = t.axis != null ? t.axis : this.defaultAxis;
   }
@@ -9626,7 +9626,7 @@ class Sc extends Ds {
 }
 Sc.className = "MaxNorm";
 M(Sc);
-class $c extends Ds {
+class $c extends Rs {
   constructor(t) {
     super(), this.defaultAxis = 0, this.axis = t.axis != null ? t.axis : this.defaultAxis;
   }
@@ -9639,14 +9639,14 @@ class $c extends Ds {
 }
 $c.className = "UnitNorm";
 M($c);
-class vc extends Ds {
+class vc extends Rs {
   apply(t) {
-    return ks(t);
+    return _s(t);
   }
 }
 vc.className = "NonNeg";
 M(vc);
-class Ic extends Ds {
+class Ic extends Rs {
   constructor(t) {
     super(), this.defaultMinValue = 0, this.defaultMaxValue = 1, this.defaultRate = 1, this.defaultAxis = 0, this.minValue = t.minValue != null ? t.minValue : this.defaultMinValue, this.maxValue = t.maxValue != null ? t.maxValue : this.defaultMaxValue, this.rate = t.rate != null ? t.rate : this.defaultRate, this.axis = t.axis != null ? t.axis : this.defaultAxis;
   }
@@ -9677,7 +9677,7 @@ function yr(n) {
   return Ni(n);
 }
 function Ga(n, t = {}) {
-  return _s(n, Qt.getMap().classNameMap, t, "constraint");
+  return Ts(n, Qt.getMap().classNameMap, t, "constraint");
 }
 function wr(n) {
   if (n == null)
@@ -9686,7 +9686,7 @@ function wr(n) {
     const e = { className: n in Wa ? Wa[n] : n, config: {} };
     return Ga(e);
   } else
-    return n instanceof Ds ? n : Ga(n);
+    return n instanceof Rs ? n : Ga(n);
 }
 /**
  * @license
@@ -9725,12 +9725,12 @@ const iw = ["fanIn", "fanOut", "fanAvg"], aw = ["normal", "uniform", "truncatedN
  * =============================================================================
  */
 function lw(n) {
-  Yn(iw, "FanMode", n);
+  Xn(iw, "FanMode", n);
 }
 function uw(n) {
-  Yn(aw, "Distribution", n);
+  Xn(aw, "Distribution", n);
 }
-class Te extends Kn {
+class Te extends Yn {
   fromConfigUsesCustomObjects() {
     return !1;
   }
@@ -9740,7 +9740,7 @@ class Te extends Kn {
 }
 class Ec extends Te {
   apply(t, e) {
-    return Fn(t, e);
+    return zn(t, e);
   }
 }
 Ec.className = "Zeros";
@@ -9837,19 +9837,19 @@ function cw(n, t = "channelsLast") {
     e = n[0], s = n[1];
   else if ([3, 4, 5].indexOf(n.length) !== -1) {
     if (t === "channelsFirst") {
-      const r = ps(n, 2);
+      const r = ms(n, 2);
       e = n[1] * r, s = n[0] * r;
     } else if (t === "channelsLast") {
-      const r = ps(n, 0, n.length - 2);
+      const r = ms(n, 0, n.length - 2);
       e = n[n.length - 2] * r, s = n[n.length - 1] * r;
     }
   } else {
-    const r = ps(n);
+    const r = ms(n);
     e = Math.sqrt(r), s = Math.sqrt(r);
   }
   return [e, s];
 }
-class Ut extends Te {
+class Gt extends Te {
   /**
    * Constructor of VarianceScaling.
    * @throws ValueError for invalid value in scale.
@@ -9881,9 +9881,9 @@ class Ut extends Te {
     };
   }
 }
-Ut.className = "VarianceScaling";
-M(Ut);
-class Mi extends Ut {
+Gt.className = "VarianceScaling";
+M(Gt);
+class Mi extends Gt {
   /**
    * Constructor of GlorotUniform
    * @param scale
@@ -9900,12 +9900,12 @@ class Mi extends Ut {
     });
   }
   getClassName() {
-    return Ut.className;
+    return Gt.className;
   }
 }
 Mi.className = "GlorotUniform";
 M(Mi);
-class Oi extends Ut {
+class Oi extends Gt {
   /**
    * Constructor of GlorotNormal.
    * @param scale
@@ -9922,12 +9922,12 @@ class Oi extends Ut {
     });
   }
   getClassName() {
-    return Ut.className;
+    return Gt.className;
   }
 }
 Oi.className = "GlorotNormal";
 M(Oi);
-class Bi extends Ut {
+class Bi extends Gt {
   constructor(t) {
     super({
       scale: 2,
@@ -9937,12 +9937,12 @@ class Bi extends Ut {
     });
   }
   getClassName() {
-    return Ut.className;
+    return Gt.className;
   }
 }
 Bi.className = "HeNormal";
 M(Bi);
-class Fi extends Ut {
+class Fi extends Gt {
   constructor(t) {
     super({
       scale: 2,
@@ -9952,12 +9952,12 @@ class Fi extends Ut {
     });
   }
   getClassName() {
-    return Ut.className;
+    return Gt.className;
   }
 }
 Fi.className = "HeUniform";
 M(Fi);
-class zi extends Ut {
+class zi extends Gt {
   constructor(t) {
     super({
       scale: 1,
@@ -9967,12 +9967,12 @@ class zi extends Ut {
     });
   }
   getClassName() {
-    return Ut.className;
+    return Gt.className;
   }
 }
 zi.className = "LeCunNormal";
 M(zi);
-class Ui extends Ut {
+class Ui extends Gt {
   constructor(t) {
     super({
       scale: 1,
@@ -9982,7 +9982,7 @@ class Ui extends Ut {
     });
   }
   getClassName() {
-    return Ut.className;
+    return Gt.className;
   }
 }
 Ui.className = "LeCunUniform";
@@ -10033,12 +10033,12 @@ const Va = {
   zeros: "Zeros"
 };
 function qa(n, t = {}) {
-  return _s(n, Qt.getMap().classNameMap, t, "initializer");
+  return Ts(n, Qt.getMap().classNameMap, t, "initializer");
 }
 function xr(n) {
   return Ni(n);
 }
-function xs(n) {
+function Ss(n) {
   if (typeof n == "string") {
     const t = n in Va ? Va[n] : n;
     if (t === "GlorotNormal")
@@ -10072,7 +10072,7 @@ function xs(n) {
 function Sr(n) {
   return n.length === 0 ? [] : Array.isArray(n[0]) ? n : [n];
 }
-function Wt(n) {
+function Vt(n) {
   let t;
   if (Array.isArray(n)) {
     if (n.length !== 1)
@@ -10235,7 +10235,7 @@ class Wi {
   }
 }
 let pw = 0;
-class ge extends Kn {
+class ge extends Yn {
   constructor(t = {}) {
     super(), this._callHook = null, this._addedWeightNames = [], this._stateful = !1, this.id = pw++, this.activityRegularizer = null, this.inputSpec = null, this.supportsMasking = !1, this._trainableWeights = [], this._nonTrainableWeights = [], this._losses = [], this._updates = [], this._built = !1, this.inboundNodes = [], this.outboundNodes = [];
     let e = t.name;
@@ -10278,7 +10278,7 @@ class ge extends Kn {
    */
   getNodeAtIndex(t, e) {
     if (this.inboundNodes.length === 0)
-      throw new Ve(`The layer has never been called and thus has no defined ${e}.`);
+      throw new qe(`The layer has never been called and thus has no defined ${e}.`);
     if (this.inboundNodes.length <= t)
       throw new I(`Asked to get ${e} at node ${t}, but the layer has only ${this.inboundNodes.length} inbound nodes.`);
     return this.inboundNodes[t];
@@ -10293,7 +10293,7 @@ class ge extends Kn {
    * @return A tensor (or list of tensors if the layer has multiple inputs).
    */
   getInputAt(t) {
-    return Bt(this.getNodeAtIndex(t, "input").inputTensors);
+    return zt(this.getNodeAtIndex(t, "input").inputTensors);
   }
   /**
    * Retrieves the output tensor(s) of a layer at a given node.
@@ -10305,7 +10305,7 @@ class ge extends Kn {
    * @return A tensor (or list of tensors if the layer has multiple outputs).
    */
   getOutputAt(t) {
-    return Bt(this.getNodeAtIndex(t, "output").outputTensors);
+    return zt(this.getNodeAtIndex(t, "output").outputTensors);
   }
   // Properties
   /**
@@ -10321,10 +10321,10 @@ class ge extends Kn {
    */
   get input() {
     if (this.inboundNodes.length > 1)
-      throw new Be(`Layer ${this.name} has multiple inbound nodes, hence the notion of "layer input" is ill-defined. Use \`getInputAt(nodeIndex)\` instead.`);
+      throw new Fe(`Layer ${this.name} has multiple inbound nodes, hence the notion of "layer input" is ill-defined. Use \`getInputAt(nodeIndex)\` instead.`);
     if (this.inboundNodes.length === 0)
-      throw new Be(`Layer ${this.name} is not connected, no input to return.`);
-    return Bt(this.getNodeAtIndex(0, "input").inputTensors);
+      throw new Fe(`Layer ${this.name} is not connected, no input to return.`);
+    return zt(this.getNodeAtIndex(0, "input").inputTensors);
   }
   /**
    * Retrieves the output tensor(s) of a layer.
@@ -10339,10 +10339,10 @@ class ge extends Kn {
    */
   get output() {
     if (this.inboundNodes.length === 0)
-      throw new Be(`Layer ${this.name} has no inbound nodes.`);
+      throw new Fe(`Layer ${this.name} has no inbound nodes.`);
     if (this.inboundNodes.length > 1)
-      throw new Be(`Layer ${this.name} has multiple inbound nodes, hence the notion of "layer output" is ill-defined. Use \`getOutputAt(nodeIndex)\` instead.`);
-    return Bt(this.getNodeAtIndex(0, "output").outputTensors);
+      throw new Fe(`Layer ${this.name} has multiple inbound nodes, hence the notion of "layer output" is ill-defined. Use \`getOutputAt(nodeIndex)\` instead.`);
+    return zt(this.getNodeAtIndex(0, "output").outputTensors);
   }
   get losses() {
     return this._losses;
@@ -10560,7 +10560,7 @@ class ge extends Kn {
         const i = [];
         for (const a of st(t))
           i.push(a.shape);
-        this.build(Bt(i)), this.built = !0, this.initialWeights && this.setWeights(this.initialWeights), this._refCount === null && o && (this._refCount = 1);
+        this.build(zt(i)), this.built = !0, this.initialWeights && this.setWeights(this.initialWeights), this._refCount === null && o && (this._refCount = 1);
       }
       if (this.assertInputCompatibility(t), o) {
         let i = this.call(t, e);
@@ -10568,7 +10568,7 @@ class ge extends Kn {
         const a = st(i), l = [];
         for (let u of a)
           s.indexOf(u) !== -1 && (u = u.clone()), l.push(u);
-        if (i = Bt(l), this.activityRegularizer != null)
+        if (i = zt(l), this.activityRegularizer != null)
           throw new J("Layer invocation in the presence of activity regularizer(s) is not supported yet.");
         return i;
       } else {
@@ -10613,7 +10613,7 @@ class ge extends Kn {
    */
   get outputShape() {
     if (this.inboundNodes == null || this.inboundNodes.length === 0)
-      throw new Be(`The layer ${this.name} has never been called and thus has no defined output shape.`);
+      throw new Fe(`The layer ${this.name} has never been called and thus has no defined output shape.`);
     const t = [];
     for (const e of this.inboundNodes) {
       const s = JSON.stringify(e.outputShapes);
@@ -10623,7 +10623,7 @@ class ge extends Kn {
       const e = this.inboundNodes[0].outputShapes;
       return Array.isArray(e) && Array.isArray(e[0]) && e.length === 1 ? e[0] : e;
     } else
-      throw new Be(`The layer ${this.name} has multiple inbound nodes with different output shapes. Hence the notion of "output shape" is ill-defined for the layer.`);
+      throw new Fe(`The layer ${this.name} has multiple inbound nodes with different output shapes. Hence the notion of "output shape" is ill-defined for the layer.`);
   }
   /**
    * Counts the total number of numbers (e.g., float32, int32) in the
@@ -10637,7 +10637,7 @@ class ge extends Kn {
    */
   countParams() {
     if (!this.built)
-      throw new Ve(`You tried to call countParams() on ${this.name}, but the layer is not built yet. Build it first by calling build(batchInputShape).`);
+      throw new qe(`You tried to call countParams() on ${this.name}, but the layer is not built yet. Build it first by calling build(batchInputShape).`);
     return $r(this.weights);
   }
   /**
@@ -10712,7 +10712,7 @@ class ge extends Kn {
   addWeight(t, e, s, r, o, i, a, l) {
     if (this._addedWeightNames.indexOf(t) !== -1)
       throw new I(`Duplicate weight name ${t} for layer ${this.name}`);
-    this._addedWeightNames.push(t), s == null && (s = "float32"), this.fastWeightInitDuringBuild && (r = l != null ? l() : xs("zeros"));
+    this._addedWeightNames.push(t), s == null && (s = "float32"), this.fastWeightInitDuringBuild && (r = l != null ? l() : Ss("zeros"));
     const u = r.apply(e, s), c = new hw(u, s, t, i, a);
     return u.dispose(), o != null && this.addLoss(() => o.apply(c.read())), i == null && (i = !0), i ? this._trainableWeights.push(c) : this._nonTrainableWeights.push(c), c;
   }
@@ -10901,7 +10901,7 @@ function mw(n) {
   const t = [];
   for (const e of n)
     t.push(e.shape);
-  return Bt(t);
+  return zt(t);
 }
 function gw(n) {
   return "float32";
@@ -10937,7 +10937,7 @@ function ww(n) {
   if (n != null && typeof n != "object")
     throw new Error(`Argument to L1L2 regularizer's constructor is expected to be an object, but received: ${n}`);
 }
-class Lc extends Kn {
+class Lc extends Yn {
 }
 class Mc extends Lc {
   constructor(t) {
@@ -10949,8 +10949,8 @@ class Mc extends Lc {
    */
   apply(t) {
     return C(() => {
-      let e = Fn([1]);
-      return this.hasL1 && (e = O(e, et(N(this.l1, Nt(t))))), this.hasL2 && (e = O(e, et(N(this.l2, Ts(t))))), L(e, []);
+      let e = zn([1]);
+      return this.hasL1 && (e = O(e, et(N(this.l1, Nt(t))))), this.hasL2 && (e = O(e, et(N(this.l2, Ns(t))))), L(e, []);
     });
   }
   getConfig() {
@@ -10966,13 +10966,13 @@ M(Mc);
 const Ka = {
   l1l2: "L1L2"
 };
-function Ss(n) {
+function $s(n) {
   return Ni(n);
 }
 function Ya(n, t = {}) {
-  return _s(n, Qt.getMap().classNameMap, t, "regularizer");
+  return Ts(n, Qt.getMap().classNameMap, t, "regularizer");
 }
-function $s(n) {
+function vs(n) {
   if (n == null)
     return null;
   if (typeof n == "string") {
@@ -11037,7 +11037,7 @@ function Bc(n, t) {
 }
 function xw(n, t, e, s = 1, r = "valid", o, i = 1) {
   return C(() => {
-    if (o == null && (o = Xn()), gt(o), n.shape.length !== 3)
+    if (o == null && (o = Jn()), gt(o), n.shape.length !== 3)
       throw new I(`The input of a conv1dWithBias operation should be 3, but is ${n.shape.length} instead.`);
     if (t.shape.length !== 3)
       throw new I(`The kernel for a conv1dWithBias operation should be 3, but is ${t.shape.length} instead`);
@@ -11046,12 +11046,12 @@ function xw(n, t, e, s = 1, r = "valid", o, i = 1) {
     if (o === "channelsFirst" && (n = pt(n, [0, 2, 1])), r === "causal")
       throw new J("The support for CAUSAL padding mode in conv1dWithBias is not implemented yet.");
     let a = Ym(n, t, s, r === "same" ? "same" : "valid", "NWC", i);
-    return e != null && (a = Ns(a, e)), a;
+    return e != null && (a = Ds(a, e)), a;
   });
 }
 function Xa(n, t, e, s = [1, 1], r = "valid", o, i, a = null) {
   return C(() => {
-    if (o == null && (o = Xn()), gt(o), n.rank !== 3 && n.rank !== 4)
+    if (o == null && (o = Jn()), gt(o), n.rank !== 3 && n.rank !== 4)
       throw new I(`conv2dWithBiasActivation expects input to be of rank 3 or 4, but received ${n.rank}.`);
     if (t.rank !== 3 && t.rank !== 4)
       throw new I(`conv2dWithBiasActivation expects kernel to be of rank 3 or 4, but received ${n.rank}.`);
@@ -11072,21 +11072,21 @@ function Xa(n, t, e, s = [1, 1], r = "valid", o, i, a = null) {
 }
 function Sw(n, t, e, s = [1, 1, 1], r = "valid", o, i) {
   return C(() => {
-    if (o == null && (o = Xn()), gt(o), n.rank !== 4 && n.rank !== 5)
+    if (o == null && (o = Jn()), gt(o), n.rank !== 4 && n.rank !== 5)
       throw new I(`conv3dWithBias expects input to be of rank 4 or 5, but received ${n.rank}.`);
     if (t.rank !== 4 && t.rank !== 5)
       throw new I(`conv3dWithBias expects kernel to be of rank 4 or 5, but received ${n.rank}.`);
     let a = Bc(n, o);
     if (r === "causal")
       throw new J("The support for CAUSAL padding mode in conv3dWithBias is not implemented yet.");
-    return a = tg(a, t, s, r === "same" ? "same" : "valid", "NDHWC", i), e != null && (a = Ns(a, e)), o === "channelsFirst" && (a = pt(a, [0, 4, 1, 2, 3])), a;
+    return a = tg(a, t, s, r === "same" ? "same" : "valid", "NDHWC", i), e != null && (a = Ds(a, e)), o === "channelsFirst" && (a = pt(a, [0, 4, 1, 2, 3])), a;
   });
 }
 class Gi extends ge {
   constructor(t, e) {
     if (super(e), this.bias = null, this.DEFAULT_KERNEL_INITIALIZER = "glorotNormal", this.DEFAULT_BIAS_INITIALIZER = "zeros", Gi.verifyArgs(e), this.rank = t, Le(this.rank, "rank"), this.rank !== 1 && this.rank !== 2 && this.rank !== 3)
       throw new J(`Convolution layer for rank other than 1, 2, or 3 (${this.rank}) is not implemented yet.`);
-    if (this.kernelSize = po(e.kernelSize, t, "kernelSize"), this.strides = po(e.strides == null ? 1 : e.strides, t, "strides"), this.padding = e.padding == null ? "valid" : e.padding, oe(this.padding), this.dataFormat = e.dataFormat == null ? "channelsLast" : e.dataFormat, gt(this.dataFormat), this.activation = rw(e.activation), this.useBias = e.useBias == null ? !0 : e.useBias, this.biasInitializer = xs(e.biasInitializer || this.DEFAULT_BIAS_INITIALIZER), this.biasConstraint = wr(e.biasConstraint), this.biasRegularizer = $s(e.biasRegularizer), this.activityRegularizer = $s(e.activityRegularizer), this.dilationRate = po(e.dilationRate == null ? 1 : e.dilationRate, t, "dilationRate"), this.rank === 1 && Array.isArray(this.dilationRate) && this.dilationRate.length !== 1)
+    if (this.kernelSize = po(e.kernelSize, t, "kernelSize"), this.strides = po(e.strides == null ? 1 : e.strides, t, "strides"), this.padding = e.padding == null ? "valid" : e.padding, oe(this.padding), this.dataFormat = e.dataFormat == null ? "channelsLast" : e.dataFormat, gt(this.dataFormat), this.activation = rw(e.activation), this.useBias = e.useBias == null ? !0 : e.useBias, this.biasInitializer = Ss(e.biasInitializer || this.DEFAULT_BIAS_INITIALIZER), this.biasConstraint = wr(e.biasConstraint), this.biasRegularizer = vs(e.biasRegularizer), this.activityRegularizer = vs(e.activityRegularizer), this.dilationRate = po(e.dilationRate == null ? 1 : e.dilationRate, t, "dilationRate"), this.rank === 1 && Array.isArray(this.dilationRate) && this.dilationRate.length !== 1)
       throw new I(`dilationRate must be a number or an array of a single number for 1D convolution, but received ${JSON.stringify(this.dilationRate)}`);
     if (this.rank === 2) {
       if (typeof this.dilationRate == "number")
@@ -11114,16 +11114,16 @@ class Gi extends ge {
       activation: sw(this.activation),
       useBias: this.useBias,
       biasInitializer: xr(this.biasInitializer),
-      biasRegularizer: Ss(this.biasRegularizer),
-      activityRegularizer: Ss(this.activityRegularizer),
+      biasRegularizer: $s(this.biasRegularizer),
+      activityRegularizer: $s(this.activityRegularizer),
       biasConstraint: yr(this.biasConstraint)
     }, e = super.getConfig();
     return Object.assign(t, e), t;
   }
 }
-class Jn extends Gi {
+class Zn extends Gi {
   constructor(t, e) {
-    super(t, e), this.kernel = null, Jn.verifyArgs(e), this.filters = e.filters, Le(this.filters, "filters"), this.kernelInitializer = xs(e.kernelInitializer || this.DEFAULT_KERNEL_INITIALIZER), this.kernelConstraint = wr(e.kernelConstraint), this.kernelRegularizer = $s(e.kernelRegularizer);
+    super(t, e), this.kernel = null, Zn.verifyArgs(e), this.filters = e.filters, Le(this.filters, "filters"), this.kernelInitializer = Ss(e.kernelInitializer || this.DEFAULT_KERNEL_INITIALIZER), this.kernelConstraint = wr(e.kernelConstraint), this.kernelRegularizer = vs(e.kernelRegularizer);
   }
   build(t) {
     t = pe(t);
@@ -11135,7 +11135,7 @@ class Jn extends Gi {
   }
   call(t, e) {
     return C(() => {
-      t = Wt(t);
+      t = Vt(t);
       let s;
       const r = this.bias == null ? null : this.bias.read(), o = qy(this.activation.getClassName());
       if (o != null && this.rank === 2)
@@ -11168,7 +11168,7 @@ class Jn extends Gi {
     const t = {
       filters: this.filters,
       kernelInitializer: xr(this.kernelInitializer),
-      kernelRegularizer: Ss(this.kernelRegularizer),
+      kernelRegularizer: $s(this.kernelRegularizer),
       kernelConstraint: yr(this.kernelConstraint)
     }, e = super.getConfig();
     return Object.assign(t, e), t;
@@ -11178,9 +11178,9 @@ class Jn extends Gi {
       throw new I(`Convolution layer expected config.filters to be a 'number' > 0 but got ${JSON.stringify(t.filters)}`);
   }
 }
-class Zn extends Jn {
+class Qn extends Zn {
   constructor(t) {
-    super(2, t), Zn.verifyArgs(t);
+    super(2, t), Qn.verifyArgs(t);
   }
   getConfig() {
     const t = super.getConfig();
@@ -11191,11 +11191,11 @@ class Zn extends Jn {
       throw new I(`Conv2D expects config.kernelSize to be number or number[] with length 1 or 2, but received ${JSON.stringify(t.kernelSize)}.`);
   }
 }
-Zn.className = "Conv2D";
-M(Zn);
-class Rs extends Jn {
+Qn.className = "Conv2D";
+M(Qn);
+class Ps extends Zn {
   constructor(t) {
-    super(3, t), Rs.verifyArgs(t);
+    super(3, t), Ps.verifyArgs(t);
   }
   getConfig() {
     const t = super.getConfig();
@@ -11206,9 +11206,9 @@ class Rs extends Jn {
       throw new I(`Conv3D expects config.kernelSize to be number or [number, number, number], but received ${JSON.stringify(t.kernelSize)}.`);
   }
 }
-Rs.className = "Conv3D";
-M(Rs);
-class Fc extends Zn {
+Ps.className = "Conv3D";
+M(Ps);
+class Fc extends Qn {
   constructor(t) {
     if (super(t), this.inputSpec = [new Ce({ ndim: 4 })], this.padding !== "same" && this.padding !== "valid")
       throw new I(`Conv2DTranspose currently supports only padding modes 'same' and 'valid', but received padding mode ${this.padding}`);
@@ -11224,7 +11224,7 @@ class Fc extends Zn {
   }
   call(t, e) {
     return C(() => {
-      let s = Wt(t);
+      let s = Vt(t);
       if (s.shape.length !== 4)
         throw new I(`Conv2DTranspose.call() expects input tensor to be rank-4, but received a tensor of rank-${s.shape.length}`);
       const r = s.shape, o = r[0];
@@ -11233,7 +11233,7 @@ class Fc extends Zn {
       const l = r[i], u = r[a], c = this.kernelSize[0], h = this.kernelSize[1], f = this.strides[0], d = this.strides[1], p = Ae(l, f, c, this.padding), g = Ae(u, d, h, this.padding), m = [o, p, g, this.filters];
       this.dataFormat !== "channelsLast" && (s = pt(s, [0, 2, 3, 1]));
       let b = Zm(s, this.kernel.read(), m, this.strides, this.padding);
-      return this.dataFormat !== "channelsLast" && (b = pt(b, [0, 3, 1, 2])), this.bias != null && (b = Ns(b, this.bias.read(), this.dataFormat)), this.activation != null && (b = this.activation.apply(b)), b;
+      return this.dataFormat !== "channelsLast" && (b = pt(b, [0, 3, 1, 2])), this.bias != null && (b = Ds(b, this.bias.read(), this.dataFormat)), this.activation != null && (b = this.activation.apply(b)), b;
     });
   }
   computeOutputShape(t) {
@@ -11251,7 +11251,7 @@ class Fc extends Zn {
 }
 Fc.className = "Conv2DTranspose";
 M(Fc);
-class zc extends Rs {
+class zc extends Ps {
   constructor(t) {
     if (super(t), this.inputSpec = [new Ce({ ndim: 5 })], this.padding !== "same" && this.padding !== "valid")
       throw new I(`Conv3DTranspose currently supports only padding modes 'same' and 'valid', but received padding mode ${this.padding}`);
@@ -11267,7 +11267,7 @@ class zc extends Rs {
   }
   call(t, e) {
     return C(() => {
-      let s = Wt(t);
+      let s = Vt(t);
       if (s.shape.length !== 5)
         throw new I(`Conv3DTranspose.call() expects input tensor to be rank-4, but received a tensor of rank-${s.shape.length}`);
       const r = s.shape, o = r[0];
@@ -11276,7 +11276,7 @@ class zc extends Rs {
       const u = r[l], c = r[i], h = r[a], f = this.kernelSize[0], d = this.kernelSize[1], p = this.kernelSize[2], g = this.strides[0], m = this.strides[1], b = this.strides[2], y = Ae(u, g, f, this.padding), S = Ae(c, m, d, this.padding), x = Ae(h, b, p, this.padding), $ = [o, y, S, x, this.filters];
       this.dataFormat !== "channelsLast" && (s = pt(s, [0, 2, 3, 4, 1]));
       let E = rg(s, this.kernel.read(), $, this.strides, this.padding);
-      return this.dataFormat !== "channelsLast" && (E = pt(E, [0, 4, 1, 2, 3])), this.bias !== null && (E = Ns(E, this.bias.read(), this.dataFormat)), this.activation !== null && (E = this.activation.apply(E)), E;
+      return this.dataFormat !== "channelsLast" && (E = pt(E, [0, 4, 1, 2, 3])), this.bias !== null && (E = Ds(E, this.bias.read(), this.dataFormat)), this.activation !== null && (E = this.activation.apply(E)), E;
     });
   }
   computeOutputShape(t) {
@@ -11294,7 +11294,7 @@ class zc extends Rs {
 }
 zc.className = "Conv3DTranspose";
 M(zc);
-class Uc extends Jn {
+class Uc extends Zn {
   constructor(t, e) {
     if (super(t, e), this.DEFAULT_DEPTHWISE_INITIALIZER = "glorotUniform", this.DEFAULT_POINTWISE_INITIALIZER = "glorotUniform", this.depthwiseKernel = null, this.pointwiseKernel = null, e.filters == null)
       throw new I("The `filters` configuration field is required by SeparableConv, but is unspecified.");
@@ -11302,7 +11302,7 @@ class Uc extends Jn {
       throw new I("Fields kernelInitializer, kernelRegularizer and kernelConstraint are invalid for SeparableConv2D. Use depthwiseInitializer, depthwiseRegularizer, depthwiseConstraint, pointwiseInitializer, pointwiseRegularizer and pointwiseConstraint instead.");
     if (e.padding != null && e.padding !== "same" && e.padding !== "valid")
       throw new I(`SeparableConv${this.rank}D supports only padding modes: 'same' and 'valid', but received ${JSON.stringify(e.padding)}`);
-    this.depthMultiplier = e.depthMultiplier == null ? 1 : e.depthMultiplier, this.depthwiseInitializer = xs(e.depthwiseInitializer || this.DEFAULT_DEPTHWISE_INITIALIZER), this.depthwiseRegularizer = $s(e.depthwiseRegularizer), this.depthwiseConstraint = wr(e.depthwiseConstraint), this.pointwiseInitializer = xs(e.depthwiseInitializer || this.DEFAULT_POINTWISE_INITIALIZER), this.pointwiseRegularizer = $s(e.pointwiseRegularizer), this.pointwiseConstraint = wr(e.pointwiseConstraint);
+    this.depthMultiplier = e.depthMultiplier == null ? 1 : e.depthMultiplier, this.depthwiseInitializer = Ss(e.depthwiseInitializer || this.DEFAULT_DEPTHWISE_INITIALIZER), this.depthwiseRegularizer = vs(e.depthwiseRegularizer), this.depthwiseConstraint = wr(e.depthwiseConstraint), this.pointwiseInitializer = Ss(e.depthwiseInitializer || this.DEFAULT_POINTWISE_INITIALIZER), this.pointwiseRegularizer = vs(e.pointwiseRegularizer), this.pointwiseConstraint = wr(e.pointwiseConstraint);
   }
   build(t) {
     if (t = pe(t), t.length < this.rank + 2)
@@ -11319,16 +11319,16 @@ class Uc extends Jn {
   }
   call(t, e) {
     return C(() => {
-      t = Wt(t);
+      t = Vt(t);
       let s;
       if (this.rank === 1)
         throw new J("1D separable convolution is not implemented yet.");
-      return this.rank === 2 && (this.dataFormat === "channelsFirst" && (t = pt(t, [0, 2, 3, 1])), s = U0(t, this.depthwiseKernel.read(), this.pointwiseKernel.read(), this.strides, this.padding, this.dilationRate, "NHWC")), this.useBias && (s = Ns(s, this.bias.read(), this.dataFormat)), this.activation != null && (s = this.activation.apply(s)), this.dataFormat === "channelsFirst" && (s = pt(s, [0, 3, 1, 2])), s;
+      return this.rank === 2 && (this.dataFormat === "channelsFirst" && (t = pt(t, [0, 2, 3, 1])), s = U0(t, this.depthwiseKernel.read(), this.pointwiseKernel.read(), this.strides, this.padding, this.dilationRate, "NHWC")), this.useBias && (s = Ds(s, this.bias.read(), this.dataFormat)), this.activation != null && (s = this.activation.apply(s)), this.dataFormat === "channelsFirst" && (s = pt(s, [0, 3, 1, 2])), s;
     });
   }
   getConfig() {
     const t = super.getConfig();
-    return delete t.rank, delete t.kernelInitializer, delete t.kernelRegularizer, delete t.kernelConstraint, t.depthwiseInitializer = xr(this.depthwiseInitializer), t.pointwiseInitializer = xr(this.pointwiseInitializer), t.depthwiseRegularizer = Ss(this.depthwiseRegularizer), t.pointwiseRegularizer = Ss(this.pointwiseRegularizer), t.depthwiseConstraint = yr(this.depthwiseConstraint), t.pointwiseConstraint = yr(this.pointwiseConstraint), t;
+    return delete t.rank, delete t.kernelInitializer, delete t.kernelRegularizer, delete t.kernelConstraint, t.depthwiseInitializer = xr(this.depthwiseInitializer), t.pointwiseInitializer = xr(this.pointwiseInitializer), t.depthwiseRegularizer = $s(this.depthwiseRegularizer), t.pointwiseRegularizer = $s(this.pointwiseRegularizer), t.depthwiseConstraint = yr(this.depthwiseConstraint), t.pointwiseConstraint = yr(this.pointwiseConstraint), t;
   }
 }
 Uc.className = "SeparableConv";
@@ -11339,7 +11339,7 @@ class Wc extends Uc {
 }
 Wc.className = "SeparableConv2D";
 M(Wc);
-class qr extends Jn {
+class qr extends Zn {
   constructor(t) {
     super(1, t), qr.verifyArgs(t), this.inputSpec = [{ ndim: 3 }];
   }
@@ -11376,7 +11376,7 @@ class Gc extends ge {
   }
   call(t, e) {
     return C(() => {
-      if (t = Wt(t), this.dataFormat === "channelsLast") {
+      if (t = Vt(t), this.dataFormat === "channelsLast") {
         const s = Ws(t, this.cropping[0][0], t.shape[1] - this.cropping[0][0] - this.cropping[0][1], 2);
         return Ws(s, this.cropping[1][0], t.shape[2] - this.cropping[1][1] - this.cropping[1][0], 3);
       } else {
@@ -11407,7 +11407,7 @@ class Vi extends ge {
   }
   call(t, e) {
     return C(() => {
-      let s = Wt(t);
+      let s = Vt(t);
       const r = s.shape;
       if (this.dataFormat === "channelsFirst") {
         s = pt(s, [0, 2, 3, 1]);
@@ -11441,7 +11441,7 @@ M(Vi);
  */
 function jr(n, t, e, s, r, o) {
   return C(() => {
-    gt(r), Zu(o), oe(s), e == null && (e = [1, 1]), s == null && (s = "valid"), r == null && (r = Xn()), o == null && (o = "max"), n = Oc(n, r);
+    gt(r), Zu(o), oe(s), e == null && (e = [1, 1]), s == null && (s = "valid"), r == null && (r = Jn()), o == null && (o = "max"), n = Oc(n, r);
     let i;
     const a = s === "same" ? "same" : "valid";
     return o === "max" ? i = t0(n, t, e, a) : i = Om(
@@ -11455,7 +11455,7 @@ function jr(n, t, e, s, r, o) {
 }
 function Vc(n, t, e, s, r, o) {
   return C(() => {
-    gt(r), Zu(o), oe(s), e == null && (e = [1, 1, 1]), s == null && (s = "valid"), r == null && (r = Xn()), o == null && (o = "max"), n = Bc(n, r);
+    gt(r), Zu(o), oe(s), e == null && (e = [1, 1, 1]), s == null && (s = "valid"), r == null && (r = Jn()), o == null && (o = "max"), n = Bc(n, r);
     let i;
     const a = s === "same" ? "same" : "valid";
     return o === "max" ? i = n0(n, t, e, a) : i = Fm(n, t, e, a), r === "channelsFirst" && (i = pt(i, [0, 4, 1, 2, 3])), i;
@@ -11492,8 +11492,8 @@ class qc extends ge {
   }
   call(t, e) {
     return C(() => {
-      this.invokeCallHook(t, e), t = Ri(Wt(t), 2);
-      const s = this.poolingFunction(Wt(t), [this.poolSize[0], 1], [this.strides[0], 1], this.padding, "channelsLast");
+      this.invokeCallHook(t, e), t = Ri(Vt(t), 2);
+      const s = this.poolingFunction(Vt(t), [this.poolSize[0], 1], [this.strides[0], 1], this.padding, "channelsLast");
       return Vr(s, [2]);
     });
   }
@@ -11544,7 +11544,7 @@ class Kc extends ge {
     return e = un(e, this.poolSize[0], this.padding, this.strides[0]), s = un(s, this.poolSize[1], this.padding, this.strides[1]), this.dataFormat === "channelsFirst" ? [t[0], t[1], e, s] : [t[0], e, s, t[3]];
   }
   call(t, e) {
-    return C(() => (this.invokeCallHook(t, e), this.poolingFunction(Wt(t), this.poolSize, this.strides, this.padding, this.dataFormat)));
+    return C(() => (this.invokeCallHook(t, e), this.poolingFunction(Vt(t), this.poolSize, this.strides, this.padding, this.dataFormat)));
   }
   getConfig() {
     const t = {
@@ -11594,7 +11594,7 @@ class Xc extends ge {
     return e = un(e, this.poolSize[0], this.padding, this.strides[0]), s = un(s, this.poolSize[1], this.padding, this.strides[1]), r = un(r, this.poolSize[2], this.padding, this.strides[2]), this.dataFormat === "channelsFirst" ? [t[0], t[1], e, s, r] : [t[0], e, s, r, t[4]];
   }
   call(t, e) {
-    return C(() => (this.invokeCallHook(t, e), this.poolingFunction(Wt(t), this.poolSize, this.strides, this.padding, this.dataFormat)));
+    return C(() => (this.invokeCallHook(t, e), this.poolingFunction(Vt(t), this.poolSize, this.strides, this.padding, this.dataFormat)));
   }
   getConfig() {
     const t = {
@@ -11643,7 +11643,7 @@ class th extends Qc {
   }
   call(t, e) {
     return C(() => {
-      const s = Wt(t);
+      const s = Vt(t);
       return St(s, 1);
     });
   }
@@ -11656,8 +11656,8 @@ class eh extends Qc {
   }
   call(t, e) {
     return C(() => {
-      const s = Wt(t);
-      return We(s, 1);
+      const s = Vt(t);
+      return Ge(s, 1);
     });
   }
 }
@@ -11681,7 +11681,7 @@ class nh extends ge {
 class sh extends nh {
   call(t, e) {
     return C(() => {
-      const s = Wt(t);
+      const s = Vt(t);
       return this.dataFormat === "channelsLast" ? St(s, [1, 2]) : St(s, [2, 3]);
     });
   }
@@ -11691,8 +11691,8 @@ M(sh);
 class rh extends nh {
   call(t, e) {
     return C(() => {
-      const s = Wt(t);
-      return this.dataFormat === "channelsLast" ? We(s, [1, 2]) : We(s, [2, 3]);
+      const s = Vt(t);
+      return this.dataFormat === "channelsLast" ? Ge(s, [1, 2]) : Ge(s, [2, 3]);
     });
   }
 }
@@ -11710,12 +11710,12 @@ M(rh);
 function vr(n, t) {
   return C(() => {
     n.dtype !== "float32" && (n = ot(n, "float32"));
-    const e = et(Ts(n), t, !0), s = Wr(e.shape, mt()), r = de(jn(e, s));
+    const e = et(Ns(n), t, !0), s = Wr(e.shape, mt()), r = de(Hn(e, s));
     return X(n, r);
   });
 }
 function Hr(n, t) {
-  return C(() => St(Ts(Z(t, n)), -1));
+  return C(() => St(Ns(Z(t, n)), -1));
 }
 function ji(n, t) {
   return C(() => St(Nt(Z(t, n)), -1));
@@ -11729,25 +11729,25 @@ function Hi(n, t) {
 function $w(n, t) {
   return C(() => {
     const e = fe(t, mt(), Number.MAX_VALUE), s = gn(O(1, e)), r = fe(n, mt(), Number.MAX_VALUE), o = gn(O(1, r));
-    return St(Ts(Z(s, o)), -1);
+    return St(Ns(Z(s, o)), -1);
   });
 }
 function vw(n, t) {
   return C(() => {
-    const e = jn(0, Z(1, N(n, t)));
-    return St(Ts(e), -1);
+    const e = Hn(0, Z(1, N(n, t)));
+    return St(Ns(e), -1);
   });
 }
 function Iw(n, t) {
   return C(() => {
-    const e = jn(0, Z(1, N(n, t)));
+    const e = Hn(0, Z(1, N(n, t)));
     return St(e, -1);
   });
 }
 function Aw(n, t) {
   return C(() => {
-    const e = et(N(n, t), -1), s = We(N(Z(1, n), t), -1);
-    return jn(0, O(1, Z(s, e)));
+    const e = et(N(n, t), -1), s = Ge(N(Z(1, n), t), -1);
+    return Hn(0, O(1, Z(s, e)));
   });
 }
 function Ew(n, t) {
@@ -11756,7 +11756,7 @@ function Ew(n, t) {
     return St(r, -1);
   });
 }
-function vs(n, t, e = !1) {
+function Is(n, t, e = !1) {
   return C(() => {
     if (e)
       t = zu(t);
@@ -11764,7 +11764,7 @@ function vs(n, t, e = !1) {
       const s = et(t, t.shape.length - 1, !0);
       t = X(t, s);
     }
-    return t = fe(t, mt(), 1 - mt()), qn(et(N(ot(n, "float32"), gn(t)), t.shape.length - 1));
+    return t = fe(t, mt(), 1 - mt()), jn(et(N(ot(n, "float32"), gn(t)), t.shape.length - 1));
   });
 }
 function Ir(n, t, e = !1) {
@@ -11772,14 +11772,14 @@ function Ir(n, t, e = !1) {
     const s = ot(Ng(Xy(n)), "int32");
     t = fe(t, mt(), 1 - mt());
     const r = t.shape, o = L(a0(s, r[r.length - 1]), r);
-    return vs(o, t, e);
+    return Is(o, t, e);
   });
 }
 function Cw(n, t) {
   if (!re(n.shape, t.shape))
     throw new I(`logits and labels must have the same shape, but got shapes ${JSON.stringify(n.shape)} and ${JSON.stringify(t.shape)}`);
   return C(() => {
-    const e = ks(t), s = qn(Nt(t));
+    const e = _s(t), s = jn(Nt(t));
     return O(Z(e, N(t, n)), qg(Uo(s)));
   });
 }
@@ -11804,7 +11804,7 @@ function _w(n, t) {
 function oh(n, t) {
   return C(() => {
     const e = vr(n, -1), s = vr(t, -1), r = N(e, s);
-    return qn(et(r, -1));
+    return jn(et(r, -1));
   });
 }
 const Ar = {
@@ -11816,7 +11816,7 @@ const Ar = {
   hinge: Iw,
   categoricalHinge: Aw,
   logcosh: Ew,
-  categoricalCrossentropy: vs,
+  categoricalCrossentropy: Is,
   sparseCategoricalCrossentropy: Ir,
   binaryCrossentropy: Kr,
   kullbackLeiblerDivergence: kw,
@@ -11921,7 +11921,7 @@ class $n extends ge {
             const u = l.rank;
             if (u == null) {
               const c = l.shape, h = c[0], f = c.slice(1).concat([h]);
-              let d = L(l, [h].concat(ps(c.slice(1))));
+              let d = L(l, [h].concat(ms(c.slice(1))));
               d = pt(d, [1, 0]), d = L(d, f), s.push(d), o = !0;
             } else if (u > 1) {
               const c = br(1, u).concat([0]);
@@ -12032,7 +12032,7 @@ class uh extends $n {
     return C(() => {
       let e = t[0];
       for (let s = 1; s < t.length; ++s)
-        e = jn(e, t[s]);
+        e = Hn(e, t[s]);
       return e;
     });
   }
@@ -12135,7 +12135,7 @@ class Ki extends $n {
 }
 Ki.className = "Concatenate";
 M(Ki);
-function rs(n, t) {
+function os(n, t) {
   for (; n < 0; )
     n += t;
   return n;
@@ -12199,16 +12199,16 @@ class hh extends $n {
     if (t.length !== 2)
       throw new I(`A \`Dot\` layer must be called on exactly 2 inputs, but received ${t.length} input(s).`);
     let e = t[0], s = t[1], r;
-    return Array.isArray(this.axes) ? r = this.axes.map((o, i) => rs(o, t[i].shape.length)) : r = [
-      rs(this.axes, e.shape.length),
-      rs(this.axes, s.shape.length)
+    return Array.isArray(this.axes) ? r = this.axes.map((o, i) => os(o, t[i].shape.length)) : r = [
+      os(this.axes, e.shape.length),
+      os(this.axes, s.shape.length)
     ], this.normalize && (e = vr(e, r[0]), s = vr(s, r[1])), Tw(e, s, r);
   }
   interpretAxes(t, e) {
     let s;
     return Array.isArray(this.axes) ? s = this.axes : s = [
-      rs(this.axes, t.length),
-      rs(this.axes, e.length)
+      os(this.axes, t.length),
+      os(this.axes, e.length)
     ], s;
   }
   computeOutputShape(t) {
@@ -12282,7 +12282,7 @@ var Ja;
   n[n.SILENT = 0] = "SILENT", n[n.VERBOSE = 1] = "VERBOSE";
 })(Ja || (Ja = {}));
 const Nw = 125;
-class Is {
+class As {
   constructor() {
     this.validationData = null;
   }
@@ -12396,7 +12396,7 @@ class Dw {
       await e.onTrainEnd(t);
   }
 }
-class Rw extends Is {
+class Rw extends As {
   constructor() {
     super();
   }
@@ -12424,11 +12424,11 @@ class Rw extends Is {
       for (const s of this.params.metrics)
         this.totals[s] != null && (typeof this.totals[s] == "number" ? e[s] = this.totals[s] / this.seen : C(() => {
           const r = N(X(1, this.seen), this.totals[s]);
-          e[s] = r, this.totals[s].dispose(), Rn(e[s]);
+          e[s] = r, this.totals[s].dispose(), Pn(e[s]);
         }));
   }
 }
-class Pw extends Is {
+class Pw extends As {
   async onTrainBegin(t) {
     this.epoch = [], this.history = {};
   }
@@ -12455,7 +12455,7 @@ class Pw extends Is {
       this.history[e[o]][s[o]].dispose(), this.history[e[o]][s[o]] = r[o][0];
   }
 }
-class Lw extends Is {
+class Lw extends As {
   constructor(t, e) {
     if (super(), this.currentEpoch = 0, this.nowFunc = t.nowFunc, this.nextFrameFunc = t.nextFrameFunc || fy, this.yieldEvery = e || "auto", this.yieldEvery === "auto" && (this.yieldEvery = Nw), this.yieldEvery === "never" && t.onYield != null)
       throw new Error("yieldEvery is `never` but you provided an `onYield` callback. Either change `yieldEvery` or remove the callback");
@@ -12487,7 +12487,7 @@ class Lw extends Is {
   }
 }
 function dh(n, t) {
-  return n == null && (n = {}), n instanceof Is ? [n] : Array.isArray(n) && n[0] instanceof Is ? n : st(n).map((s) => new Lw(s, t));
+  return n == null && (n = {}), n instanceof As ? [n] : Array.isArray(n) && n[0] instanceof As ? n : st(n).map((s) => new Lw(s, t));
 }
 class Zt {
   /**
@@ -12569,7 +12569,7 @@ function ph(n, t, e, s, r, o, i, a, l) {
  * =============================================================================
  */
 function mh(n, t = {}, e = !1) {
-  return _s(n, Qt.getMap().classNameMap, t, "layer", e);
+  return Ts(n, Qt.getMap().classNameMap, t, "layer", e);
 }
 /**
  * @license
@@ -12582,7 +12582,7 @@ function mh(n, t = {}, e = !1) {
  */
 function gh(n, t) {
   return C(() => {
-    const e = N(0.5, Pu(t)), s = sc(Cs(t, e), n.dtype);
+    const e = N(0.5, Pu(t)), s = sc(ks(t, e), n.dtype);
     return St(mn(n, s), -1);
   });
 }
@@ -12598,7 +12598,7 @@ function Ow(n, t) {
 function Bw(n, t) {
   return C(() => {
     const e = Mw(n, t), s = Ow(n, t), r = O(e, s);
-    return ot(on(Cs(r, 0), X(e, r), 0), "float32");
+    return ot(on(ks(r, 0), X(e, r), 0), "float32");
   });
 }
 function Fw(n, t) {
@@ -12607,7 +12607,7 @@ function Fw(n, t) {
 function zw(n, t) {
   return n.rank === t.rank && (n = Vr(n, [n.rank - 1])), t = ur(t, -1), t.dtype !== n.dtype && (t = ot(t, n.dtype)), ot(mn(n, t), "float32");
 }
-const Uw = Hr, Ww = Hr, Gw = ji, Vw = ji, qw = Hi, jw = Hi, yh = vs, Hw = oh, wh = Ir, Er = {
+const Uw = Hr, Ww = Hr, Gw = ji, Vw = ji, qw = Hi, jw = Hi, yh = Is, Hw = oh, wh = Ir, Er = {
   binaryAccuracy: gh,
   categoricalAccuracy: bh,
   precision: Bw,
@@ -12659,12 +12659,12 @@ function Vs(n) {
  */
 function Yw(n) {
   const t = {
-    Adagrad: () => vn.adagrad(0.01),
-    Adadelta: () => vn.adadelta(1, 0.95, mt()),
-    Adam: () => vn.adam(1e-3, 0.9, 0.999, mt()),
-    Adamax: () => vn.adamax(2e-3, 0.9, 0.999, mt(), 0),
-    RMSProp: () => vn.rmsprop(1e-3, 0.9, 0, mt()),
-    SGD: () => vn.sgd(0.01)
+    Adagrad: () => In.adagrad(0.01),
+    Adadelta: () => In.adadelta(1, 0.95, mt()),
+    Adam: () => In.adam(1e-3, 0.9, 0.999, mt()),
+    Adamax: () => In.adamax(2e-3, 0.9, 0.999, mt(), 0),
+    RMSProp: () => In.rmsprop(1e-3, 0.9, 0, mt()),
+    SGD: () => In.sgd(0.01)
   };
   if (t.adagrad = t.Adagrad, t.adadelta = t.Adadelta, t.adam = t.Adam, t.adamax = t.Adamax, t.rmsprop = t.RMSProp, t.sgd = t.SGD, n in t)
     return t[n]();
@@ -12951,7 +12951,7 @@ class $h {
  * https://opensource.org/licenses/MIT.
  * =============================================================================
  */
-class Ps extends ge {
+class Ls extends ge {
   constructor(t) {
     if (super({
       dtype: t.dtype,
@@ -12996,8 +12996,8 @@ class Ps extends ge {
     };
   }
 }
-Ps.className = "InputLayer";
-M(Ps);
+Ls.className = "InputLayer";
+M(Ls);
 function e1(n) {
   if (n.batchShape == null && n.shape == null)
     throw new Error("Please provide to Input either a `shape` or a `batchShape` argument. Note that `shape` does not include the batch dimension.");
@@ -13006,7 +13006,7 @@ function e1(n) {
   let t = n.batchShape;
   n.shape != null && t == null && (t = [null].concat(n.shape));
   let e = n.dtype;
-  return e == null && (e = "float32"), new Ps({
+  return e == null && (e = "float32"), new Ls({
     batchInputShape: t,
     name: n.name,
     dtype: e,
@@ -13031,14 +13031,14 @@ function n1(n, t) {
     throw new I(`The dtype of the feed (${t.dtype}) can not be cast to the dtype of the key '${n.name}' (${n.dtype}).`);
   }
 }
-class ze {
+class Ue {
   /**
    * Constructor, optionally does copy-construction.
    * @param feeds An Array of `Feed`s, or another `FeedDict`, in which case
    *   copy-construction will be performed.
    */
   constructor(t) {
-    if (this.id2Value = {}, this.id2Mask = {}, this.name2Id = {}, t instanceof ze)
+    if (this.id2Value = {}, this.id2Mask = {}, this.name2Id = {}, t instanceof Ue)
       for (const e in t.id2Value)
         this.id2Value[e] = t.id2Value[e], e in t.id2Mask && (this.id2Mask[e] = t.id2Mask[e]);
     else {
@@ -13130,7 +13130,7 @@ class ze {
   }
 }
 const tl = new $h(), el = new $h();
-function us(n, t, e, s) {
+function cs(n, t, e, s) {
   const r = e == null ? !1 : e.training, o = Array.isArray(n), i = o ? n : [n], a = i.map((p) => p.name), l = [], u = t.names();
   for (const p of a)
     u.indexOf(p) !== -1 ? l.push(t.getValue(p)) : l.push(null);
@@ -13141,10 +13141,10 @@ function us(n, t, e, s) {
     h = p.sorted, f = p.recipientCounts, tl.put(c, h), el.put(c, f);
   }
   f = {}, r || Object.assign(f, el.get(c));
-  const d = new ze(t);
+  const d = new Ue(t);
   for (let p = 0; p < h.length; ++p) {
     const g = h[p], m = g.sourceLayer;
-    if (m instanceof Ps)
+    if (m instanceof Ls)
       continue;
     const b = [], y = [], S = [];
     let x = !1;
@@ -13267,7 +13267,7 @@ class ce extends ge {
     this.inputNames = [], this.outputNames = [], this.feedInputShapes = [], this.feedInputNames = [], this.feedOutputNames = [];
     for (let y = 0; y < this.inputLayers.length; y++) {
       const S = this.inputLayers[y];
-      if (!(S instanceof Ps))
+      if (!(S instanceof Ls))
         throw new TypeError(`Input layers to a LayersModel must be InputLayer objects. Received inputs: ${t.inputs}. Input ${y} (0-based) originates from layer type ${S.getClassName()}.`);
       this.inputNames.push(S.name), this.feedInputShapes.push(S.batchInputShape), this.feedInputNames.push(S.name);
     }
@@ -13278,7 +13278,7 @@ class ce extends ge {
       ($ == null || E == null || D == null) && ($ = y.sourceLayer, E = y.nodeIndex, D = y.tensorIndex);
       const _ = $.inboundNodes[E];
       if (x.indexOf(_) !== -1)
-        throw new Ve(`The tensor ${y.name} at layer "${$.name}" is part of a cycle.`);
+        throw new qe(`The tensor ${y.name} at layer "${$.name}" is part of a cycle.`);
       if (S.indexOf(_) !== -1)
         return;
       this.containerNodes.add(ce.nodeKey($, E)), $.id in i || (i[$.id] = Object.keys(i).length), x.indexOf(_) === -1 && x.push(_);
@@ -13333,7 +13333,7 @@ class ce extends ge {
         if (x != null) {
           for (const $ of S.inputTensors)
             if (g.indexOf($) === -1)
-              throw new Ve(`Graph disconnected: cannot obtain value for tensor ${$} at layer "${x.name}". The following previous layers were accessed without issue: ${m}`);
+              throw new qe(`Graph disconnected: cannot obtain value for tensor ${$} at layer "${x.name}". The following previous layers were accessed without issue: ${m}`);
           for (const $ of S.outputTensors)
             g.push($);
           m.push(x.name);
@@ -13344,7 +13344,7 @@ class ce extends ge {
     for (const y of b) {
       const S = b.filter((x) => x === y).length;
       if (S !== 1)
-        throw new Ve(`The name "${y}" is used ${S} times in the model. All layer names should be unique. Layer names: ` + JSON.stringify(b));
+        throw new qe(`The name "${y}" is used ${S} times in the model. All layer names should be unique. Layer names: ` + JSON.stringify(b));
     }
     this.outboundNodes = [], this.inboundNodes = [], new Wi({
       outboundLayer: this,
@@ -13528,10 +13528,10 @@ class ce extends ge {
   call(t, e) {
     return C(() => {
       t = st(t);
-      const s = new ze();
+      const s = new Ue();
       for (let r = 0; r < this.inputs.length; ++r)
         s.add(this.inputs[r], t[r]);
-      return us(this.outputs, s, e);
+      return cs(this.outputs, s, e);
     });
   }
   /**
@@ -13581,7 +13581,7 @@ class ce extends ge {
             const m = u.inboundLayers[g], b = u.nodeIndices[g], y = u.tensorIndices[g], S = `${m.name}_${b}_${y}`, x = s[S];
             h.push(x);
           }
-          const f = c.computeOutputShape(Bt(h)), d = Sr(f), p = c.inboundNodes.indexOf(u);
+          const f = c.computeOutputShape(zt(h)), d = Sr(f), p = c.inboundNodes.indexOf(u);
           for (let g = 0; g < d.length; g++) {
             const m = `${c.name}_${p}_${g}`;
             s[m] = d[g];
@@ -13597,7 +13597,7 @@ class ce extends ge {
       const l = i[a];
       Ie(l in s), o.push(s[l]);
     }
-    return Bt(o);
+    return zt(o);
   }
   /**
    * Computes output tensors for new inputs.
@@ -13787,7 +13787,7 @@ class ce extends ge {
         const T = _.inboundNodes[E];
         y.push(T.outputTensors[D]);
       }
-      y.length > 0 && m.apply(Bt(y), S);
+      y.length > 0 && m.apply(zt(y), S);
     }
     function u(m) {
       const b = m.name, y = mh(m, e.customObjects != null ? e.customObjects : {});
@@ -14012,7 +14012,7 @@ async function h1(n, t, e) {
           ut(_);
           for (let P = 0; P < l.length; ++P) {
             const B = l[P], Y = T[P];
-            E[B] = Y, Rn(Y);
+            E[B] = Y, Pn(Y);
           }
           await f.onBatchEnd(y, E), fh(E), y++, b++;
         }
@@ -14083,7 +14083,7 @@ async function p1(n, t, e) {
     const c = o[u];
     o[u] = X(o[u], a), ut(c);
   }
-  return Bt(o);
+  return zt(o);
 }
 /**
  * @license
@@ -14097,7 +14097,7 @@ async function p1(n, t, e) {
 function go(n) {
   w(n > 0 && Number.isInteger(n), () => `batchSize is required to be a positive integer, but got ${n}`);
 }
-function os(n, t, e) {
+function is(n, t, e) {
   return n == null ? [null] : Array.isArray(n) ? n.map((s) => ln(s, t, e - t)) : ln(n, t, e - t);
 }
 function Ho(n, t) {
@@ -14242,12 +14242,12 @@ function b1(n, t, e) {
   const s = [
     Hr,
     Kr,
-    vs
+    Is
   ];
   for (let r = 0; r < n.length; ++r) {
     const o = n[r], i = t[r], a = e[r];
     if (i != null) {
-      if (i === vs && o.shape[o.shape.length - 1] === 1)
+      if (i === Is && o.shape[o.shape.length - 1] === 1)
         throw new I(`You are passing a target array of shape ${o.shape} while using a loss 'categorical_crossentropy'. 'categorical_crossentropy'expects targets to be binary matrices (1s and 0s) of shape [samples, classes].`);
       if (s.indexOf(i) !== -1) {
         const l = o.shape.slice(1), u = a.slice(1);
@@ -14367,7 +14367,7 @@ class Yr extends ce {
     if (t.loss == null && (t.loss = []), this.loss = t.loss, typeof t.optimizer == "string")
       this.optimizer_ = Yw(t.optimizer), this.isOptimizerOwned = !0;
     else {
-      if (!(t.optimizer instanceof He))
+      if (!(t.optimizer instanceof Ke))
         throw new I("User-defined optimizer must be an instance of tf.Optimizer.");
       this.optimizer_ = t.optimizer, this.isOptimizerOwned = !1;
     }
@@ -14482,7 +14482,7 @@ class Yr extends ce {
       const a = i[0].concat(i[1]);
       this.makeTestFunction();
       const l = this.testFunction, u = this.testLoop(l, a, r, s.verbose, s.steps);
-      return Bt(u);
+      return zt(u);
     } finally {
       ae(i[0], t), ae(i[1], e);
     }
@@ -14543,7 +14543,7 @@ class Yr extends ce {
   execute(t, e) {
     if (Array.isArray(e) && e.length === 0)
       throw new I("`outputs` is an empty Array, which is not allowed.");
-    const s = Array.isArray(e), r = s ? e : [e], o = this.retrieveSymbolicTensors(r), i = new ze();
+    const s = Array.isArray(e), r = s ? e : [e], o = this.retrieveSymbolicTensors(r), i = new Ue();
     if (t instanceof Et && (t = [t]), Array.isArray(t)) {
       if (t.length !== this.inputs.length)
         throw new I(`The number of inputs provided (${t.length}) does not match the number of inputs of this model (${this.inputs.length}).`);
@@ -14556,7 +14556,7 @@ class Yr extends ce {
           throw new I(`No value is provided for the model's input ${l.name}`);
         i.add(l, u);
       }
-    const a = us(o, i);
+    const a = cs(o, i);
     return s ? a : a[0];
   }
   /**
@@ -14604,16 +14604,16 @@ class Yr extends ce {
       const o = bo(r, e), i = this.outputs.map((a) => []);
       for (let a = 0; a < o.length; ++a)
         C(() => {
-          const u = o[a][0], c = o[a][1], h = os(t, u, c), f = [];
+          const u = o[a][0], c = o[a][1], h = is(t, u, c), f = [];
           if (Array.isArray(h))
             for (let p = 0; p < h.length; ++p)
               f.push({ key: this.inputs[p], value: h[p] });
           else
             f.push({ key: this.inputs[0], value: h });
-          const d = new ze(f);
-          return us(this.outputs, d);
+          const d = new Ue(f);
+          return cs(this.outputs, d);
         }).forEach((u, c) => i[c].push(u));
-      return Bt(i.map((a) => rn(a, 0)));
+      return zt(i.map((a) => rn(a, 0)));
     });
   }
   /**
@@ -14675,7 +14675,7 @@ class Yr extends ce {
   }
   standardizeUserDataXY(t, e, s = !0, r) {
     if (this.optimizer_ == null)
-      throw new Ve("You must compile a model before training/testing. Use LayersModel.compile(modelCompileArgs).");
+      throw new qe("You must compile a model before training/testing. Use LayersModel.compile(modelCompileArgs).");
     const o = [];
     for (let i = 0; i < this.feedOutputShapes.length; ++i) {
       const a = this.feedOutputShapes[i];
@@ -14763,7 +14763,7 @@ class Yr extends ce {
         const h = [];
         for (let g = 0; g < this.inputs.length; ++g)
           h.push({ key: this.inputs[g], value: s[g] });
-        const f = new ze(h), d = us(this.outputs, f, { training: !0 });
+        const f = new Ue(h), d = cs(this.outputs, f, { training: !0 });
         let p;
         for (let g = 0; g < this.lossFunctions.length; ++g) {
           const m = this.lossFunctions[g];
@@ -14780,7 +14780,7 @@ class Yr extends ce {
             const b = this.metricsTensors[g][0], y = this.metricsTensors[g][1];
             m = St(b(r[y], d[y]));
           }
-          Rn(m), i.push(m);
+          Pn(m), i.push(m);
         }
         return p = St(p), this.calculateLosses().forEach((g) => {
           p = O(p, g);
@@ -14801,7 +14801,7 @@ class Yr extends ce {
       const r = t.slice(0, this.inputs.length), o = t.slice(this.inputs.length, this.inputs.length + this.outputs.length), i = [];
       for (let u = 0; u < this.inputs.length; ++u)
         i.push({ key: this.inputs[u], value: r[u] });
-      const a = new ze(i), l = us(this.outputs, a);
+      const a = new Ue(i), l = cs(this.outputs, a);
       for (let u = 0; u < this.lossFunctions.length; ++u) {
         const c = this.lossFunctions[u], h = St(c(o[u], l[u]));
         u === 0 ? s = h : s = O(s, h), e.push(s);
@@ -14876,7 +14876,7 @@ class Yr extends ce {
       } else if (s.validationSplit != null && s.validationSplit > 0 && s.validationSplit < 1) {
         m = !0;
         const T = Math.floor(r[0].shape[0] * (1 - s.validationSplit)), P = r[0].shape[0];
-        c = os(r, T, P), i = r, r = os(r, 0, T), h = os(o, T, P), a = o, o = os(o, 0, T), b = c.concat(h);
+        c = is(r, T, P), i = r, r = is(r, 0, T), h = is(o, T, P), a = o, o = is(o, 0, T), b = c.concat(h);
       } else
         s.validationSteps != null && (m = !0);
       const y = r.concat(o).concat(f);
@@ -14945,13 +14945,13 @@ class Yr extends ce {
             const j = Ho(e, Y), F = t(j);
             for (let G = 0; G < s.length; ++G) {
               const q = s[G], be = F[G];
-              T[q] = be, Rn(be);
+              T[q] = be, Pn(be);
             }
             if (_ === D.length - 1 && g) {
               const G = this.testLoop(l, u, r);
               for (let q = 0; q < s.length; ++q) {
-                const be = s[q], Vt = G[q];
-                Rn(Vt), $["val_" + be] = Vt;
+                const be = s[q], Mt = G[q];
+                Pn(Mt), $["val_" + be] = Mt;
               }
             }
           }), await y.onBatchEnd(_, T), fh(T), this.stopTraining_)
@@ -15019,7 +15019,7 @@ class Yr extends ce {
       const c = await u.data();
       l.push(c[0]);
     }
-    return ut(a), ae(s[0], t), ae(s[1], e), Bt(l);
+    return ut(a), ae(s[0], t), ae(s[1], e), zt(l);
   }
   /**
    * Extract weight values of the model.
@@ -15294,25 +15294,25 @@ class Ch extends Yr {
 }
 Ch.className = "Functional";
 M(Ch);
-const x1 = "This is not an object", S1 = "This is not a Float16Array object", ll = "This constructor is not a subclass of Float16Array", kh = "The constructor property value is not an object", $1 = "Species constructor didn't return TypedArray object", v1 = "Derived constructor created TypedArray object which was too small length", ms = "Attempting to access detached ArrayBuffer", Yo = "Cannot convert undefined or null to object", Xo = "Cannot mix BigInt and other types, use explicit conversions", ul = "@@iterator property is not callable", cl = "Reduce of empty array with no initial value", I1 = "The comparison function must be either a function or undefined", yo = "Offset is out of bounds";
+const x1 = "This is not an object", S1 = "This is not a Float16Array object", ll = "This constructor is not a subclass of Float16Array", kh = "The constructor property value is not an object", $1 = "Species constructor didn't return TypedArray object", v1 = "Derived constructor created TypedArray object which was too small length", gs = "Attempting to access detached ArrayBuffer", Yo = "Cannot convert undefined or null to object", Xo = "Cannot mix BigInt and other types, use explicit conversions", ul = "@@iterator property is not callable", cl = "Reduce of empty array with no initial value", I1 = "The comparison function must be either a function or undefined", yo = "Offset is out of bounds";
 function ct(n) {
-  return (t, ...e) => Ot(n, t, e);
+  return (t, ...e) => Ft(n, t, e);
 }
-function Qn(n, t) {
+function ts(n, t) {
   return ct(
-    zn(
+    Un(
       n,
       t
     ).get
   );
 }
 const {
-  apply: Ot,
-  construct: cs,
+  apply: Ft,
+  construct: hs,
   defineProperty: hl,
   get: wo,
-  getOwnPropertyDescriptor: zn,
-  getPrototypeOf: Ls,
+  getOwnPropertyDescriptor: Un,
+  getPrototypeOf: Ms,
   has: Jo,
   ownKeys: _h,
   set: fl,
@@ -15321,18 +15321,18 @@ const {
   EPSILON: E1,
   MAX_SAFE_INTEGER: dl,
   isFinite: Nh,
-  isNaN: Un
+  isNaN: Wn
 } = Number, {
   iterator: ke,
   species: C1,
   toStringTag: Yi,
   for: k1
-} = Symbol, Wn = Object, {
+} = Symbol, Gn = Object, {
   create: Xr,
-  defineProperty: Ms,
+  defineProperty: Os,
   freeze: _1,
   is: pl
-} = Wn, Zo = Wn.prototype, T1 = (
+} = Gn, Zo = Gn.prototype, T1 = (
   /** @type {any} */
   Zo.__lookupGetter__ ? ct(
     /** @type {any} */
@@ -15342,22 +15342,22 @@ const {
       throw ft(
         Yo
       );
-    let e = Wn(n);
+    let e = Gn(n);
     do {
-      const s = zn(e, t);
+      const s = Un(e, t);
       if (s !== void 0)
         return Pe(s, "get") ? s.get : void 0;
-    } while ((e = Ls(e)) !== null);
+    } while ((e = Ms(e)) !== null);
   }
 ), Pe = (
   /** @type {any} */
-  Wn.hasOwn || ct(Zo.hasOwnProperty)
+  Gn.hasOwn || ct(Zo.hasOwnProperty)
 ), Dh = Array, Rh = Dh.isArray, Jr = Dh.prototype, N1 = ct(Jr.join), D1 = ct(Jr.push), R1 = ct(
   Jr.toLocaleString
 ), Xi = Jr[ke], P1 = ct(Xi), {
   abs: L1,
   trunc: Ph
-} = Math, Zr = ArrayBuffer, M1 = Zr.isView, Lh = Zr.prototype, O1 = ct(Lh.slice), B1 = Qn(Lh, "byteLength"), Qo = typeof SharedArrayBuffer < "u" ? SharedArrayBuffer : null, F1 = Qo && Qn(Qo.prototype, "byteLength"), Ji = Ls(Uint8Array), z1 = Ji.from, vt = Ji.prototype, U1 = vt[ke], W1 = ct(vt.keys), G1 = ct(
+} = Math, Zr = ArrayBuffer, M1 = Zr.isView, Lh = Zr.prototype, O1 = ct(Lh.slice), B1 = ts(Lh, "byteLength"), Qo = typeof SharedArrayBuffer < "u" ? SharedArrayBuffer : null, F1 = Qo && ts(Qo.prototype, "byteLength"), Ji = Ms(Uint8Array), z1 = Ji.from, vt = Ji.prototype, U1 = vt[ke], W1 = ct(vt.keys), G1 = ct(
   vt.values
 ), V1 = ct(
   vt.entries
@@ -15365,22 +15365,22 @@ const {
   vt.reverse
 ), j1 = ct(vt.fill), H1 = ct(
   vt.copyWithin
-), gl = ct(vt.sort), is = ct(vt.slice), K1 = ct(
+), gl = ct(vt.sort), as = ct(vt.slice), K1 = ct(
   vt.subarray
-), xt = Qn(
+), xt = ts(
   vt,
   "buffer"
-), Xe = Qn(
+), Xe = ts(
   vt,
   "byteOffset"
-), tt = Qn(
+), tt = ts(
   vt,
   "length"
-), Mh = Qn(
+), Mh = ts(
   vt,
   Yi
-), Y1 = Uint8Array, jt = Uint16Array, bl = (...n) => Ot(z1, jt, n), Zi = Uint32Array, X1 = Float32Array, yn = Ls([][ke]()), Qr = ct(yn.next), J1 = ct(function* () {
-}().next), Z1 = Ls(yn), ft = TypeError, xo = RangeError, Oh = WeakSet, Bh = Oh.prototype, Q1 = ct(Bh.add), tx = ct(Bh.has), to = WeakMap, Qi = to.prototype, kr = ct(Qi.get), ex = ct(Qi.has), ta = ct(Qi.set), Fh = new to(), nx = Xr(null, {
+), Y1 = Uint8Array, jt = Uint16Array, bl = (...n) => Ft(z1, jt, n), Zi = Uint32Array, X1 = Float32Array, yn = Ms([][ke]()), Qr = ct(yn.next), J1 = ct(function* () {
+}().next), Z1 = Ms(yn), ft = TypeError, xo = RangeError, Oh = WeakSet, Bh = Oh.prototype, Q1 = ct(Bh.add), tx = ct(Bh.has), to = WeakMap, Qi = to.prototype, kr = ct(Qi.get), ex = ct(Qi.has), ta = ct(Qi.set), Fh = new to(), nx = Xr(null, {
   next: {
     value: function() {
       const t = kr(Fh, this);
@@ -15410,7 +15410,7 @@ const zh = new to(), Uh = Xr(Z1, {
   }
 });
 for (const n of _h(yn))
-  n !== "next" && Ms(Uh, n, zn(yn, n));
+  n !== "next" && Os(Uh, n, Un(yn, n));
 function yl(n) {
   const t = Xr(Uh);
   return ta(zh, t, n), t;
@@ -15469,7 +15469,7 @@ const Nr = k1("__Float16Array__");
 function ix(n) {
   if (!wl(n))
     return !1;
-  const t = Ls(n);
+  const t = Ms(n);
   if (!wl(t))
     return !1;
   const e = t.constructor;
@@ -15492,7 +15492,7 @@ function cx(n) {
   if (s < Gh)
     return e * ax(s / Sl) * Sl;
   const r = (1 + ux) * s, o = r - (r - s);
-  return o > lx || Un(o) ? e * (1 / 0) : e * o;
+  return o > lx || Wn(o) ? e * (1 / 0) : e * o;
 }
 const qh = new Zr(4), jh = new X1(qh), Hh = new Zi(qh), le = new jt(512), ue = new Y1(512);
 for (let n = 0; n < 256; ++n) {
@@ -15513,24 +15513,24 @@ for (let n = 1; n < 1024; ++n) {
 }
 for (let n = 1024; n < 2048; ++n)
   ea[n] = 939524096 + (n - 1024 << 13);
-const ts = new Zi(64);
+const es = new Zi(64);
 for (let n = 1; n < 31; ++n)
-  ts[n] = n << 23;
-ts[31] = 1199570944;
-ts[32] = 2147483648;
+  es[n] = n << 23;
+es[31] = 1199570944;
+es[32] = 2147483648;
 for (let n = 33; n < 63; ++n)
-  ts[n] = 2147483648 + (n - 32 << 23);
-ts[63] = 3347054592;
+  es[n] = 2147483648 + (n - 32 << 23);
+es[63] = 3347054592;
 const Kh = new jt(64);
 for (let n = 1; n < 64; ++n)
   n !== 32 && (Kh[n] = 1024);
 function nt(n) {
   const t = n >> 10;
-  return Hh[0] = ea[Kh[t] + (n & 1023)] + ts[t], jh[0];
+  return Hh[0] = ea[Kh[t] + (n & 1023)] + es[t], jh[0];
 }
 function Ne(n) {
   const t = +n;
-  return Un(t) || t === 0 ? 0 : Ph(t);
+  return Wn(t) || t === 0 ? 0 : Ph(t);
 }
 function So(n) {
   const t = Ne(n);
@@ -15547,7 +15547,7 @@ function Hs(n, t) {
   const s = e[C1];
   return s ?? t;
 }
-function gs(n) {
+function bs(n) {
   if (Wh(n))
     return !1;
   try {
@@ -15557,7 +15557,7 @@ function gs(n) {
   return !0;
 }
 function $l(n, t) {
-  const e = Un(n), s = Un(t);
+  const e = Wn(n), s = Wn(t);
   if (e && s)
     return 0;
   if (e)
@@ -15576,15 +15576,15 @@ function $l(n, t) {
   return 0;
 }
 const na = 2, Dr = new to();
-function Dn(n) {
+function Rn(n) {
   return ex(Dr, n) || !M1(n) && ix(n);
 }
 function Q(n) {
-  if (!Dn(n))
+  if (!Rn(n))
     throw ft(S1);
 }
 function Ks(n, t) {
-  const e = Dn(n), s = Tr(n);
+  const e = Rn(n), s = Tr(n);
   if (!e && !s)
     throw ft($1);
   if (typeof t == "number") {
@@ -15606,17 +15606,17 @@ function V(n) {
   const t = kr(Dr, n);
   if (t !== void 0) {
     const r = xt(t);
-    if (gs(r))
-      throw ft(ms);
+    if (bs(r))
+      throw ft(gs);
     return t;
   }
   const e = (
     /** @type {any} */
     n.buffer
   );
-  if (gs(e))
-    throw ft(ms);
-  const s = cs(ht, [
+  if (bs(e))
+    throw ft(gs);
+  const s = hs(ht, [
     e,
     /** @type {any} */
     n.byteOffset,
@@ -15635,7 +15635,7 @@ const Yh = new Oh();
 for (const n of _h(vt)) {
   if (n === Yi)
     continue;
-  const t = zn(vt, n);
+  const t = Un(vt, n);
   Pe(t, "get") && typeof t.get == "function" && Q1(Yh, t.get);
 }
 const hx = _1(
@@ -15649,10 +15649,10 @@ const hx = _1(
     },
     getOwnPropertyDescriptor(n, t) {
       if (js(t) && Pe(n, t)) {
-        const e = zn(n, t);
+        const e = Un(n, t);
         return e.value = nt(e.value), e;
       }
-      return zn(n, t);
+      return Un(n, t);
     },
     defineProperty(n, t, e) {
       return js(t) && Pe(n, t) && Pe(e, "value") && (e.value = we(e.value)), hl(n, t, e);
@@ -15663,33 +15663,33 @@ class ht {
   /** @see https://tc39.es/ecma262/#sec-typedarray */
   constructor(t, e, s) {
     let r;
-    if (Dn(t))
-      r = cs(jt, [V(t)], new.target);
+    if (Rn(t))
+      r = hs(jt, [V(t)], new.target);
     else if (_r(t) && !rx(t)) {
       let i, a;
       if (Tr(t)) {
         i = t, a = tt(t);
         const l = xt(t);
-        if (gs(l))
-          throw ft(ms);
+        if (bs(l))
+          throw ft(gs);
         if (ti(t))
           throw ft(Xo);
         const u = new Zr(
           a * na
         );
-        r = cs(jt, [u], new.target);
+        r = hs(jt, [u], new.target);
       } else {
         const l = t[ke];
         if (l != null && typeof l != "function")
           throw ft(ul);
         l != null ? xl(t) ? (i = t, a = t.length) : (i = [.../** @type {Iterable<unknown>} */
         t], a = i.length) : (i = /** @type {ArrayLike<unknown>} */
-        t, a = So(i.length)), r = cs(jt, [a], new.target);
+        t, a = So(i.length)), r = hs(jt, [a], new.target);
       }
       for (let l = 0; l < a; ++l)
         r[l] = we(i[l]);
     } else
-      r = cs(jt, arguments, new.target);
+      r = hs(jt, arguments, new.target);
     const o = (
       /** @type {any} */
       new A1(r, hx)
@@ -15707,14 +15707,14 @@ class ht {
         ll
       );
     if (s === ht) {
-      if (Dn(t) && e.length === 0) {
+      if (Rn(t) && e.length === 0) {
         const c = V(t), h = new jt(
           xt(c),
           Xe(c),
           tt(c)
         );
         return new ht(
-          xt(is(h))
+          xt(as(h))
         );
       }
       if (e.length === 0)
@@ -15728,7 +15728,7 @@ class ht {
         xt(
           bl(t, function(c, ...h) {
             return we(
-              Ot(l, this, [c, ...qs(h)])
+              Ft(l, this, [c, ...qs(h)])
             );
           }, u)
         )
@@ -15745,7 +15745,7 @@ class ht {
         throw ft(
           Yo
         );
-      r = Wn(t), o = So(r.length);
+      r = Gn(t), o = So(r.length);
     }
     const a = new s(o);
     if (e.length === 0)
@@ -15755,7 +15755,7 @@ class ht {
     else {
       const l = e[0], u = e[1];
       for (let c = 0; c < o; ++c)
-        a[c] = Ot(l, u, [r[c], c]);
+        a[c] = Ft(l, u, [r[c], c]);
     }
     return a;
   }
@@ -15833,7 +15833,7 @@ class ht {
       tt(s)
     ), u = new ht(
       xt(
-        is(l)
+        as(l)
       )
     ), c = V(u);
     return c[i] = we(a), u;
@@ -15847,7 +15847,7 @@ class ht {
       for (let c = 0; c < r; ++c) {
         const h = nt(s[c]);
         u[c] = we(
-          Ot(t, o, [h, c, this])
+          Ft(t, o, [h, c, this])
         );
       }
       return l;
@@ -15856,7 +15856,7 @@ class ht {
     Ks(a, r);
     for (let l = 0; l < r; ++l) {
       const u = nt(s[l]);
-      a[l] = Ot(t, o, [u, l, this]);
+      a[l] = Ft(t, o, [u, l, this]);
     }
     return (
       /** @type {any} */
@@ -15869,7 +15869,7 @@ class ht {
     const s = V(this), r = tt(s), o = e[0], i = [];
     for (let u = 0; u < r; ++u) {
       const c = nt(s[u]);
-      Ot(t, o, [c, u, this]) && D1(i, c);
+      Ft(t, o, [c, u, this]) && D1(i, c);
     }
     const a = Hs(s, ht), l = new a(i);
     return Ks(l), /** @type {any} */
@@ -15914,7 +15914,7 @@ class ht {
     Q(this);
     const s = V(this), r = tt(s), o = e[0];
     for (let i = 0; i < r; ++i)
-      Ot(t, o, [
+      Ft(t, o, [
         nt(s[i]),
         i,
         this
@@ -15926,7 +15926,7 @@ class ht {
     const s = V(this), r = tt(s), o = e[0];
     for (let i = 0; i < r; ++i) {
       const a = nt(s[i]);
-      if (Ot(t, o, [a, i, this]))
+      if (Ft(t, o, [a, i, this]))
         return a;
     }
   }
@@ -15936,7 +15936,7 @@ class ht {
     const s = V(this), r = tt(s), o = e[0];
     for (let i = 0; i < r; ++i) {
       const a = nt(s[i]);
-      if (Ot(t, o, [a, i, this]))
+      if (Ft(t, o, [a, i, this]))
         return i;
     }
     return -1;
@@ -15947,7 +15947,7 @@ class ht {
     const s = V(this), r = tt(s), o = e[0];
     for (let i = r - 1; i >= 0; --i) {
       const a = nt(s[i]);
-      if (Ot(t, o, [a, i, this]))
+      if (Ft(t, o, [a, i, this]))
         return a;
     }
   }
@@ -15957,7 +15957,7 @@ class ht {
     const s = V(this), r = tt(s), o = e[0];
     for (let i = r - 1; i >= 0; --i) {
       const a = nt(s[i]);
-      if (Ot(t, o, [a, i, this]))
+      if (Ft(t, o, [a, i, this]))
         return i;
     }
     return -1;
@@ -15967,7 +15967,7 @@ class ht {
     Q(this);
     const s = V(this), r = tt(s), o = e[0];
     for (let i = 0; i < r; ++i)
-      if (!Ot(t, o, [
+      if (!Ft(t, o, [
         nt(s[i]),
         i,
         this
@@ -15980,7 +15980,7 @@ class ht {
     Q(this);
     const s = V(this), r = tt(s), o = e[0];
     for (let i = 0; i < r; ++i)
-      if (Ot(t, o, [
+      if (Ft(t, o, [
         nt(s[i]),
         i,
         this
@@ -16002,7 +16002,7 @@ class ht {
       throw ft(
         Xo
       );
-    if (Dn(t))
+    if (Rn(t))
       return q1(
         V(this),
         V(t),
@@ -16010,10 +16010,10 @@ class ht {
       );
     if (Tr(t)) {
       const l = xt(t);
-      if (gs(l))
-        throw ft(ms);
+      if (bs(l))
+        throw ft(gs);
     }
-    const o = tt(s), i = Wn(t), a = So(i.length);
+    const o = tt(s), i = Gn(t), a = So(i.length);
     if (r === 1 / 0 || a + r > o)
       throw xo(yo);
     for (let l = 0; l < a; ++l)
@@ -16034,7 +16034,7 @@ class ht {
       tt(t)
     ), s = new ht(
       xt(
-        is(e)
+        as(e)
       )
     ), r = V(s);
     return ml(r), s;
@@ -16073,7 +16073,7 @@ class ht {
       tt(e)
     ), o = new ht(
       xt(
-        is(r)
+        as(r)
       )
     ), i = V(o);
     return gl(i, (a, l) => s(nt(a), nt(l))), o;
@@ -16090,7 +16090,7 @@ class ht {
       );
       return new ht(
         xt(
-          is(p, t, e)
+          as(p, t, e)
         )
       );
     }
@@ -16103,8 +16103,8 @@ class ht {
     if (Ks(h, c), c === 0)
       return h;
     const f = xt(s);
-    if (gs(f))
-      throw ft(ms);
+    if (bs(f))
+      throw ft(gs);
     let d = 0;
     for (; l < u; )
       h[d] = nt(s[l]), ++l, ++d;
@@ -16162,10 +16162,10 @@ class ht {
     if (o === 1 / 0)
       return !1;
     o < 0 && (o += r, o < 0 && (o = 0));
-    const i = Un(t);
+    const i = Wn(t);
     for (let a = o; a < r; ++a) {
       const l = nt(s[a]);
-      if (i && Un(l) || l === t)
+      if (i && Wn(l) || l === t)
         return !0;
     }
     return !1;
@@ -16184,23 +16184,23 @@ class ht {
   }
   /** @see https://tc39.es/ecma262/#sec-get-%typedarray%.prototype-@@tostringtag */
   get [Yi]() {
-    if (Dn(this))
+    if (Rn(this))
       return (
         /** @type {any} */
         "Float16Array"
       );
   }
 }
-Ms(ht, "BYTES_PER_ELEMENT", {
+Os(ht, "BYTES_PER_ELEMENT", {
   value: na
 });
-Ms(ht, Nr, {});
+Os(ht, Nr, {});
 Th(ht, Ji);
 const Rr = ht.prototype;
-Ms(Rr, "BYTES_PER_ELEMENT", {
+Os(Rr, "BYTES_PER_ELEMENT", {
   value: na
 });
-Ms(Rr, ke, {
+Os(Rr, ke, {
   value: Rr.values,
   writable: !0,
   configurable: !0
@@ -16701,7 +16701,7 @@ class Sx {
       El(o.data, o.desc.dataType),
       "float32"
     );
-    return new Zn({
+    return new Qn({
       name: t,
       filters: r.desc.dims[0],
       kernelSize: r.desc.dims.slice(2, 4),
@@ -16852,18 +16852,15 @@ class Sx {
         t.color,
         t.albedo,
         t.normal
-      ), be = [1, S, y, 4];
-      E = Hp(
-        [F, G, q].map((Vt) => {
-          const qt = tr({ buffer: Vt, zeroCopy: !0 }, be), Ke = bs(
-            qt,
-            [0, 0, 0, 0],
-            [1, S, y, 3]
-          );
-          return qt.dispose(), Ke;
-        }),
-        3
-      );
+      ), be = [1, S, y, 4], Mt = [F, G, q].map((Ot) => {
+        const Be = tr({ buffer: Ot, zeroCopy: !0 }, be), vn = ys(
+          Be,
+          [0, 0, 0, 0],
+          [1, S, y, 3]
+        );
+        return Be.dispose(), vn;
+      });
+      E = Hp(Mt, 3), Mt.forEach((Ot) => Ot.dispose());
     }
     if (x) {
       const F = E;
@@ -16897,9 +16894,9 @@ class Sx {
       );
       for (let G = 0; G < Y; G++)
         for (let q = 0; q < B; q++) {
-          const be = (G * B + q) * 4, Vt = ((G + j.y) * i + (q + j.x)) * 4;
-          for (let qt = 0; qt < 4; qt++)
-            e.data[be + qt] = s.data[Vt + qt];
+          const be = (G * B + q) * 4, Mt = ((G + j.y) * i + (q + j.x)) * 4;
+          for (let Ot = 0; Ot < 4; Ot++)
+            e.data[be + Ot] = s.data[Mt + Ot];
         }
       P.dispose();
     } else {
@@ -17358,7 +17355,7 @@ function _x(n, t, e) {
         `}
       }
     `), e.pixelsOpType != null) {
-    const p = e.pixelsOpType === Pr.FROM_PIXELS ? `@group(0) @binding(0) var<storage, read_write> result: array<${Tn(t.dtype, e.outputComponent)}>;` : `@group(0) @binding(1) var<storage, read> inBuf : array<${Tn(n[0].dtype, e.outputComponent)}>;`, g = t.shape.length === 3 ? "vec2<i32>" : "i32";
+    const p = e.pixelsOpType === Pr.FROM_PIXELS ? `@group(0) @binding(0) var<storage, read_write> result: array<${Nn(t.dtype, e.outputComponent)}>;` : `@group(0) @binding(1) var<storage, read> inBuf : array<${Nn(n[0].dtype, e.outputComponent)}>;`, g = t.shape.length === 3 ? "vec2<i32>" : "i32";
     s.push(`
         struct Uniform {
           outShapeStrides : ${g},
@@ -17391,10 +17388,10 @@ function _x(n, t, e) {
          outShapeStrides: ${i}, `, e.size && (a += "size : i32, "), e.uniforms && (a += e.uniforms), a += "};", a = Bx(a), s.push(a), e.atomic ? s.push(`
       @group(0) @binding(0) var<storage, read_write> result: array<atomic<i32>>;
     `) : s.push(`
-      @group(0) @binding(0) var<storage, read_write> result: array<${Tn(t.dtype, e.outputComponent)}>;
+      @group(0) @binding(0) var<storage, read_write> result: array<${Nn(t.dtype, e.outputComponent)}>;
     `), e.variableNames.forEach((p, g) => {
     s.push(`
-      @group(0) @binding(${1 + g}) var<storage, read> ${p}: array<${e.variableComponents ? Tn(n[g].dtype, e.variableComponents[g]) : Tn(n[g].dtype, e.outputComponent)}>;
+      @group(0) @binding(${1 + g}) var<storage, read> ${p}: array<${e.variableComponents ? Nn(n[g].dtype, e.variableComponents[g]) : Nn(n[g].dtype, e.outputComponent)}>;
         `);
   }), a !== "" && s.push(`
       @group(0) @binding(${1 + e.variableNames.length}) var<uniform> uniforms: Uniforms;
@@ -17674,7 +17671,7 @@ function Mx(n) {
 function rf(n) {
   return n.dispatch[1] === 1 && n.dispatch[2] === 1;
 }
-function Tn(n, t = 1) {
+function Nn(n, t = 1) {
   if (n === "float32")
     return K(t, "f32");
   if (n === "int32" || n === "bool")
@@ -17682,7 +17679,7 @@ function Tn(n, t = 1) {
   throw new Error(`type ${n} is not supported.`);
 }
 function Ox(n, t, e) {
-  const s = n.length, r = Tn(t, e);
+  const s = n.length, r = Nn(t, e);
   let o = `fn setOutputAtIndex(flatIndex : i32, value : ${K(e)}) {
       result[flatIndex] = ${r}(value);
     }
@@ -17802,9 +17799,9 @@ const Wx = W().getNumber("WEBGPU_CPU_HANDOFF_SIZE_THRESHOLD"), Gx = (n, t) => {
   let o = Math.ceil(Math.sqrt(r[0]));
   return o > e ? (o = Math.ceil(Math.cbrt(r[0])), w(o <= e, () => "Total dispatch size exceeds WebGPU maximum."), [o, o, o]) : [o, o, 1];
 };
-class Os extends Fl {
+class Bs extends Fl {
   nextDataId() {
-    return Os.nextDataId++;
+    return Bs.nextDataId++;
   }
   constructor(t, e) {
     if (super(), this.commandQueueOwnedIds = /* @__PURE__ */ new WeakSet(), this.dispatchCountInPass = 0, this.disposed = !1, this.downloadWaitMs = 0, this.tensorDataPendingDisposal = [], this.queryResolveBuffer = null, this.querySet = null, this.querySetCount = 2, this.stagingPendingDisposal = [], this.uniformPendingDisposal = [], this.uploadWaitMs = 0, this.hasReadSyncWarned = !1, this.hasTimestampQueryWarned = !1, !of())
@@ -18121,7 +18118,7 @@ class Os extends Fl {
   }
   runWebGPUProgram(t, e, s, r, o) {
     if (o || (o = this.makeTensorInfo(t.outputShape, s)), U(o.shape) === 0)
-      return this.tensorMap.get(o.dataId).values = Pn(o.dtype, 0), o;
+      return this.tensorMap.get(o.dataId).values = Ln(o.dtype, 0), o;
     this.uploadToGPU(o.dataId), t.dispatch = Gx(this.device, t);
     const i = e.map((l, u) => {
       if (l.dtype === "complex64")
@@ -18205,7 +18202,7 @@ class Os extends Fl {
     this.disposed || (this.querySet != null && this.querySet.destroy(), this.bufferManager.dispose(), this.textureManager.dispose(), this.disposed = !0);
   }
 }
-Os.nextDataId = 0;
+Bs.nextDataId = 0;
 /**
  * @license
  * Copyright 2022 Google Inc. All Rights Reserved.
@@ -18239,7 +18236,7 @@ of() && Jp(
       maxComputeInvocationsPerWorkgroup: r.maxComputeInvocationsPerWorkgroup
     };
     const o = await t.requestDevice(e), i = await t.requestAdapterInfo();
-    return new Os(o, i);
+    return new Bs(o, i);
   },
   3
   /*priority*/
@@ -18331,14 +18328,14 @@ const qx = {
  * limitations under the License.
  * =============================================================================
  */
-function je(n) {
+function He(n) {
   const { inputs: t } = n, { x: e } = t;
   return n.backend.incRef(e.dataId), { dataId: e.dataId, shape: e.shape, dtype: e.dtype };
 }
 const jx = {
   kernelName: li,
   backendName: "webgpu",
-  kernelFunc: je
+  kernelFunc: He
 };
 /**
  * @license
@@ -18438,7 +18435,7 @@ class Yx {
 function af(n) {
   const { backend: t, attrs: e } = n, { shape: s, value: r } = e;
   let { dtype: o } = e;
-  if (o = o || Es(r), o === "string") {
+  if (o = o || Cs(r), o === "string") {
     const i = yt(o, U(s));
     return i.fill(r), t.makeTensorInfo(s, o, i);
   } else {
@@ -18465,7 +18462,7 @@ function af(n) {
 const Xx = (n) => {
   const { inputs: t, backend: e, attrs: s } = n, { x: r } = t, { paddings: o, constantValue: i } = s;
   if (o.every((u) => re(u, [0, 0])))
-    return je({ inputs: { x: r }, backend: e });
+    return He({ inputs: { x: r }, backend: e });
   if (U(r.shape) === 0) {
     const u = o.map(
       (c, h) => c[0] + r.shape[h] + c[1]
@@ -18525,7 +18522,7 @@ function Zx(n) {
  */
 function Lt(n) {
   return (t, e, s, r, o) => {
-    const i = zt(t, e), a = i.length, l = Ht(i), u = U(i), c = Pn(o, u), h = t.length, f = e.length, d = Ht(t), p = Ht(e), g = hr(t, i), m = hr(e, i);
+    const i = Wt(t, e), a = i.length, l = Ht(i), u = U(i), c = Ln(o, u), h = t.length, f = e.length, d = Ht(t), p = Ht(e), g = hr(t, i), m = hr(e, i);
     if (g.length + m.length === 0)
       for (let b = 0; b < c.length; ++b)
         c[b] = n(s[b % s.length], r[b % r.length]);
@@ -18602,7 +18599,7 @@ const tS = Lt((n, t) => n + t);
  * =============================================================================
  */
 function eS(n, t, e, s, r) {
-  const o = U(s), i = qe(r, e);
+  const o = U(s), i = je(r, e);
   for (let a = 0; a < n.length; a++) {
     const l = n[a];
     if (l < 0)
@@ -18947,7 +18944,7 @@ const gS = Lt((n, t) => n <= t ? 1 : 0);
  * =============================================================================
  */
 function bS(n, t, e) {
-  const s = (t - n) / (e - 1), r = qe(e, "float32");
+  const s = (t - n) / (e - 1), r = je(e, "float32");
   r[0] = n;
   for (let o = 1; o < r.length; o++)
     r[o] = r[o - 1] + s;
@@ -18987,7 +18984,7 @@ const yS = Oe((n) => Math.log(n));
  * =============================================================================
  */
 function wS(n, t, e, s) {
-  const r = Pn(s, U(e));
+  const r = Ln(s, U(e));
   for (let o = 0; o < r.length; ++o) {
     const i = o * t;
     let a = n[i];
@@ -19104,7 +19101,7 @@ const vS = Lt((n, t) => n !== t ? 1 : 0);
  * =============================================================================
  */
 function IS(n, t, e, s, r) {
-  const o = t.length, i = U(t), a = Ht(t), l = Ht(r), u = Pn(e, U(r));
+  const o = t.length, i = U(t), a = Ht(t), l = Ht(r), u = Ln(e, U(r));
   for (let c = 0; c < i; ++c) {
     const h = oi(c, o, a), f = new Array(h.length);
     for (let p = 0; p < f.length; p++)
@@ -19131,7 +19128,7 @@ function IS(n, t, e, s, r) {
  * =============================================================================
  */
 function AS(n, t, e, s) {
-  const [r, o] = bi(n, s), i = ci(t, "int32"), a = qe(U(r), i), l = U(o);
+  const [r, o] = bi(n, s), i = ci(t, "int32"), a = je(U(r), i), l = U(o);
   for (let u = 0; u < a.length; ++u) {
     const c = u * l;
     let h = 1;
@@ -19586,8 +19583,8 @@ function PS(n, t, e, s, r, o, i, a, l, u) {
 function LS(n, t, e, s) {
   const r = n === t, o = n < t && e < 0, i = t < n && e > 1;
   if (r || o || i)
-    return qe(0, s);
-  const a = Math.abs(Math.ceil((t - n) / e)), l = qe(a, s);
+    return je(0, s);
+  const a = Math.abs(Math.ceil((t - n) / e)), l = je(a, s);
   t < n && e === 1 && (e = -1), l[0] = n;
   for (let u = 1; u < l.length; u++)
     l[u] = l[u - 1] + e;
@@ -20228,7 +20225,7 @@ function QS(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-const hs = (n, t) => {
+const fs = (n, t) => {
   const e = t.value - n.value;
   return e === 0 ? n.index - t.index : e;
 };
@@ -20240,21 +20237,21 @@ function uf(n, t, e = 0, s = n.length - 1) {
     }
     const r = n[t];
     let o = e, i = s;
-    for (En(n, e, t), hs(n[s], r) > 0 && En(n, e, s); o < i; ) {
-      for (En(n, o, i), o++, i--; hs(n[o], r) < 0; )
+    for (Cn(n, e, t), fs(n[s], r) > 0 && Cn(n, e, s); o < i; ) {
+      for (Cn(n, o, i), o++, i--; fs(n[o], r) < 0; )
         o = o + 1;
-      for (; hs(n[i], r) > 0; )
+      for (; fs(n[i], r) > 0; )
         i = i - 1;
     }
-    hs(n[e], r) === 0 ? En(n, e, i) : (i = i + 1, En(n, i, s)), i <= t && (e = i + 1), t <= i && (s = i - 1);
+    fs(n[e], r) === 0 ? Cn(n, e, i) : (i = i + 1, Cn(n, i, s)), i <= t && (e = i + 1), t <= i && (s = i - 1);
   }
 }
 function t2(n, t, e, s, r) {
-  const o = t[t.length - 1], [i, a] = [n.length / o, o], l = Pn(e, i * s), u = Pn("int32", i * s);
+  const o = t[t.length - 1], [i, a] = [n.length / o, o], l = Ln(e, i * s), u = Ln("int32", i * s);
   for (let h = 0; h < i; h++) {
     const f = h * a, d = n.subarray(f, f + a);
     let p = new Array(d.length);
-    d.forEach((y, S) => p[S] = { value: y, index: S }), s < p.length && (uf(p, s), p = p.slice(0, s)), r && p.sort(hs);
+    d.forEach((y, S) => p[S] = { value: y, index: S }), s < p.length && (uf(p, s), p = p.slice(0, s)), r && p.sort(fs);
     const g = h * s, m = l.subarray(g, g + s), b = u.subarray(g, g + s);
     for (let y = 0; y < s; y++)
       m[y] = p[y].value, b[y] = p[y].index;
@@ -20282,7 +20279,7 @@ function t2(n, t, e, s, r) {
  * =============================================================================
  */
 function e2(n, t, e, s) {
-  const r = As(t, e)[0], o = [1, e[0], 1];
+  const r = Es(t, e)[0], o = [1, e[0], 1];
   for (let p = 0; p < r; p++)
     o[0] *= e[p];
   o[1] = e[r];
@@ -20817,7 +20814,7 @@ const W2 = "return abs(a);", G2 = `
   let e2x = exp(-2.0 * abs(a));
   return sign(a) * (1.0 - e2x) / (1.0 + e2x);
 `, D$ = "return f32(i32((a)));";
-function An(n, t) {
+function En(n, t) {
   switch (n) {
     case z.ABS:
       return W2;
@@ -20921,24 +20918,24 @@ function An(n, t) {
  * limitations under the License.
  * =============================================================================
  */
-function es(n, t = !1, e = !1, s = 3) {
+function ns(n, t = !1, e = !1, s = 3) {
   if (n === null)
     return "";
   let r = "";
   if (n === "linear")
-    r = An(z.LINEAR);
+    r = En(z.LINEAR);
   else if (n === "relu")
-    r = An(z.RELU, e);
+    r = En(z.RELU, e);
   else if (n === "elu")
-    r = An(z.ELU, e);
+    r = En(z.ELU, e);
   else if (n === "relu6")
-    r = An(z.RELU6, e);
+    r = En(z.RELU6, e);
   else if (n === "prelu")
     r = U2(it.PRELU, e);
   else if (n === "sigmoid")
-    r = An(z.SIGMOID, e);
+    r = En(z.SIGMOID, e);
   else if (n === "leakyrelu")
-    r = An(z.LEAKYRELU, e);
+    r = En(z.LEAKYRELU, e);
   else
     throw new Error(`Activation ${n} has not been implemented for the WebGPU backend.`);
   const i = K(e ? 4 : 1);
@@ -21320,7 +21317,7 @@ class B$ {
   }
   getUserCode() {
     return `
-      ${es(this.activation, this.hasPreluActivationWeights, this.isVec4)}
+      ${ns(this.activation, this.hasPreluActivationWeights, this.isVec4)}
       ${ca(this.addBias, this.activation, !1, this.transposeB, this.fitAOuter, this.fitBOuter, this.fitInner, this.isVec4 ? 4 : 1)}
       ${this.isVec4 ? ha(this.elementsPerThread, this.workgroupSize, this.transposeA, this.tileInner, !1, null, !0) : this.isVectorA ? O$(this.workgroupSize, this.transposeA) : fa(this.elementsPerThread, this.workgroupSize, this.transposeA, this.tileInner, !1, null, this.sequentialAccessByThreads, !0)}
     `;
@@ -21410,7 +21407,7 @@ function F$(n, t, e, s, r = !1, o = null, i = !1, a = 4, l = 4, u = 4) {
       }
       return ${K(a)}(0.0);`, x = `${h(l)}`, $ = K(u), E = K(n ? a : l), D = K(n ? l : a);
   return `
-      ${es(o, i, u === 4, 4)}
+      ${ns(o, i, u === 4, 4)}
       fn mm_readA(batch: i32, row : i32, col : i32) -> ${E} {
         ${n ? S : x}
       }
@@ -21464,7 +21461,7 @@ class U$ {
   }
   getUserCode() {
     return `
-       ${es(this.activation, this.hasPreluActivationWeights, !1, 4)}
+       ${ns(this.activation, this.hasPreluActivationWeights, !1, 4)}
        fn readInp(batch : i32, row : i32, col : i32, chan : i32) -> f32{
          let coords = vec4<i32>(batch, row, col, chan);
          if (coordsInBounds4D(coords, uniforms.xShape)) {
@@ -21621,7 +21618,7 @@ class V$ {
   }
   getUserCode() {
     return `
-      ${es(this.activation, this.hasPreluActivationWeights)}
+      ${ns(this.activation, this.hasPreluActivationWeights)}
       ${ca(this.addBias, this.activation, this.transposeA, this.transposeB)}
       ${G$(this.workgroupSize[0])}
     `;
@@ -21713,7 +21710,7 @@ class j$ {
   }
   getUserCode() {
     return `
-      ${es(this.activation, this.hasPreluActivationWeights)}
+      ${ns(this.activation, this.hasPreluActivationWeights)}
       ${ca(this.addBias, this.activation, this.transposeA, this.transposeB)}
       ${q$(this.workgroupSize)}
     `;
@@ -21771,7 +21768,7 @@ class K$ {
   }
   getUserCode() {
     return `
-    ${es(this.activation, this.hasPreluActivationWeights)}
+    ${ns(this.activation, this.hasPreluActivationWeights)}
     ${wt("index")} {
       if (index < uniforms.size) {
         let coords = getCoordsFromIndex(index);
@@ -21820,7 +21817,7 @@ function dt(n) {
  * =============================================================================
  */
 function hf({ a: n, b: t, transposeA: e, transposeB: s, backend: r, bias: o = null, preluActivationWeights: i = null, leakyreluAlpha: a = 0, activation: l = null }) {
-  const u = n.shape.length, c = t.shape.length, h = e ? n.shape[u - 2] : n.shape[u - 1], f = s ? t.shape[c - 1] : t.shape[c - 2], d = e ? n.shape[u - 1] : n.shape[u - 2], p = s ? t.shape[c - 2] : t.shape[c - 1], g = n.shape.slice(0, -2), m = t.shape.slice(0, -2), b = U(g), y = U(m), x = zt(n.shape.slice(0, -2), t.shape.slice(0, -2)).concat([d, p]);
+  const u = n.shape.length, c = t.shape.length, h = e ? n.shape[u - 2] : n.shape[u - 1], f = s ? t.shape[c - 1] : t.shape[c - 2], d = e ? n.shape[u - 1] : n.shape[u - 2], p = s ? t.shape[c - 2] : t.shape[c - 1], g = n.shape.slice(0, -2), m = t.shape.slice(0, -2), b = U(g), y = U(m), x = Wt(n.shape.slice(0, -2), t.shape.slice(0, -2)).concat([d, p]);
   w(h === f, () => `Error in matMul: inner shapes (${h}) and (${f}) of Tensors with shapes ${n.shape} and ${t.shape} and transposeA=${e} and transposeB=${s} must match.`);
   const $ = e ? [b, h, d] : [b, d, h], E = s ? [y, p, f] : [y, f, p], D = dt({ inputs: { x: n }, backend: r, attrs: { shape: $ } }), _ = dt({ inputs: { x: t }, backend: r, attrs: { shape: E } }), T = [D, _], P = Math.max(b, y), B = [D, _], Y = [
     { type: "int32", data: [d] },
@@ -21831,8 +21828,8 @@ function hf({ a: n, b: t, transposeA: e, transposeB: s, backend: r, bias: o = nu
   const G = [P, d, p];
   let q = W().get("WEBGPU_MATMUL_PROGRAM_TYPE");
   if (q < 0) {
-    const Vt = W().getNumber("WEBGPU_THRESHOLD_TO_INCREASE_WORKGROUPS_FOR_MATMUL"), qt = Vt > 0 ? Vt : r.thresholdToIncreaseWorkgroups, Ke = P * Math.ceil(d / 32) * Math.ceil(p / 32);
-    Ke <= qt || d <= 8 && Ke <= qt * 2 ? P * d * p <= 128 ? q = xe.MatMulReduceProgram : P === 1 && f >= 2e3 ? q = xe.MatMulSplitKProgram : q = xe.MatMulSmallOutputSizeProgram : q = xe.MatMulPackedProgram;
+    const Mt = W().getNumber("WEBGPU_THRESHOLD_TO_INCREASE_WORKGROUPS_FOR_MATMUL"), Ot = Mt > 0 ? Mt : r.thresholdToIncreaseWorkgroups, Be = P * Math.ceil(d / 32) * Math.ceil(p / 32);
+    Be <= Ot || d <= 8 && Be <= Ot * 2 ? P * d * p <= 128 ? q = xe.MatMulReduceProgram : P === 1 && f >= 2e3 ? q = xe.MatMulSplitKProgram : q = xe.MatMulSmallOutputSizeProgram : q = xe.MatMulPackedProgram;
   }
   switch (q) {
     case xe.MatMulReduceProgram:
@@ -21841,11 +21838,11 @@ function hf({ a: n, b: t, transposeA: e, transposeB: s, backend: r, bias: o = nu
     case xe.MatMulSplitKProgram: {
       if (F = af({ backend: r, attrs: { shape: G, value: 0, dtype: n.dtype } }), j = new H$(G, f, e, s), o || l) {
         F = r.runWebGPUProgram(j, B, n.dtype, Y, F);
-        const qt = new K$(F.shape, o, l, i);
-        let Ke = null;
-        const Bs = [F];
-        o && Bs.push(o), i && Bs.push(i), l === "leakyrelu" && (Ke = [{ type: "float32", data: [a] }], qt.uniforms += " alpha : f32,");
-        const da = r.runWebGPUProgram(qt, Bs, F.dtype, Ke);
+        const Ot = new K$(F.shape, o, l, i);
+        let Be = null;
+        const vn = [F];
+        o && vn.push(o), i && vn.push(i), l === "leakyrelu" && (Be = [{ type: "float32", data: [a] }], Ot.uniforms += " alpha : f32,");
+        const da = r.runWebGPUProgram(Ot, vn, F.dtype, Be);
         T.push(F);
         const df = dt({ inputs: { x: da }, backend: r, attrs: { shape: x } });
         T.push(da);
@@ -21859,8 +21856,8 @@ function hf({ a: n, b: t, transposeA: e, transposeB: s, backend: r, bias: o = nu
       j = new j$($, E, G, e, s, o, l, i);
       break;
     case xe.MatMulPackedProgram:
-      const Vt = r.adapterInfo.isIntel();
-      j = new B$($, G, e, s, o, l, i, Vt);
+      const Mt = r.adapterInfo.isIntel();
+      j = new B$($, G, e, s, o, l, i, Mt);
       break;
     default:
       throw new Error(`Unsupported MatMulProgramType ${q}.`);
@@ -21868,8 +21865,8 @@ function hf({ a: n, b: t, transposeA: e, transposeB: s, backend: r, bias: o = nu
   o && B.push(o), i && B.push(i), l === "leakyrelu" && (Y.push({ type: "float32", data: [a] }), j.uniforms += " alpha : f32,"), F = r.runWebGPUProgram(j, B, n.dtype, Y, F);
   const be = dt({ inputs: { x: F }, backend: r, attrs: { shape: x } });
   T.push(F);
-  for (const Vt of T)
-    r.disposeData(Vt.dataId);
+  for (const Mt of T)
+    r.disposeData(Mt.dataId);
   return be;
 }
 /**
@@ -22429,7 +22426,7 @@ const av = {
   any: "bool"
 };
 function lv(n, t, e, s, r) {
-  const o = n.shape.length, i = [], a = As(t, n.shape);
+  const o = n.shape.length, i = [], a = Es(t, n.shape);
   let l = a;
   const u = bg(l, o);
   let c = n;
@@ -22498,7 +22495,7 @@ function uv(n) {
  */
 function cv(n, t, e, s) {
   if (t.filterWidth === 1 && t.filterHeight === 1 && re(t.inShape, t.outShape))
-    return je({ inputs: { x: n }, backend: s });
+    return He({ inputs: { x: n }, backend: s });
   if (t.filterWidth === t.inWidth && t.filterHeight === t.inHeight && t.batchSize === 1 && t.padInfo.type === "VALID") {
     const i = n.shape.length, a = dt({
       inputs: { x: n },
@@ -22657,7 +22654,7 @@ const mv = {
  */
 class gv {
   constructor(t) {
-    this.uniforms = "", this.workPerThread = 1, this.workgroupSize = [64, 1, 1], this.size = !0, this.outputShape = ws(
+    this.uniforms = "", this.workPerThread = 1, this.workgroupSize = [64, 1, 1], this.size = !0, this.outputShape = xs(
       t,
       1
       /* axis */
@@ -22710,7 +22707,7 @@ class gv {
  * =============================================================================
  */
 function bv(n) {
-  const { inputs: t, backend: e } = n, { real: s, imag: r } = t, o = e.makeTensorInfo(s.shape, "complex64"), i = e.tensorMap.get(o.dataId), a = je({ inputs: { x: s }, backend: e }), l = je({ inputs: { x: r }, backend: e });
+  const { inputs: t, backend: e } = n, { real: s, imag: r } = t, o = e.makeTensorInfo(s.shape, "complex64"), i = e.tensorMap.get(o.dataId), a = He({ inputs: { x: s }, backend: e }), l = He({ inputs: { x: r }, backend: e });
   return i.complexTensorInfos = { real: a, imag: l }, o;
 }
 /**
@@ -22731,7 +22728,7 @@ function bv(n) {
  */
 function yv(n) {
   const { inputs: t, backend: e } = n, { input: s } = t, r = e.tensorMap.get(s.dataId);
-  return je({ inputs: { x: r.complexTensorInfos.imag }, backend: e });
+  return He({ inputs: { x: r.complexTensorInfos.imag }, backend: e });
 }
 /**
  * @license
@@ -22751,7 +22748,7 @@ function yv(n) {
  */
 function wv(n) {
   const { inputs: t, backend: e } = n, { input: s } = t, r = e.tensorMap.get(s.dataId);
-  return je({ inputs: { x: r.complexTensorInfos.real }, backend: e });
+  return He({ inputs: { x: r.complexTensorInfos.real }, backend: e });
 }
 /**
  * @license
@@ -22769,10 +22766,10 @@ function wv(n) {
  * limitations under the License.
  * =============================================================================
  */
-function fs(n, t, e) {
+function ds(n, t, e) {
   const s = n[0].dtype;
   if (s === "complex64") {
-    const p = n.map((S) => wv({ inputs: { input: S }, backend: e })), g = n.map((S) => yv({ inputs: { input: S }, backend: e })), m = fs(p, t, e), b = fs(g, t, e), y = bv({ inputs: { real: m, imag: b }, backend: e });
+    const p = n.map((S) => wv({ inputs: { input: S }, backend: e })), g = n.map((S) => yv({ inputs: { input: S }, backend: e })), m = ds(p, t, e), b = ds(g, t, e), y = bv({ inputs: { real: m, imag: b }, backend: e });
     return p.forEach((S) => e.disposeData(S.dataId)), g.forEach((S) => e.disposeData(S.dataId)), e.disposeData(m.dataId), e.disposeData(b.dataId), y;
   }
   let r = e.shouldExecuteOnCPU(n);
@@ -22780,11 +22777,11 @@ function fs(n, t, e) {
     const p = n.map(($) => {
       const D = [-1, U($.shape.slice(t))];
       return dt({ inputs: { x: $ }, backend: e, attrs: { shape: D } });
-    }), g = p.map(($) => ({ vals: e.readSync($.dataId), shape: $.shape })), m = ws(
+    }), g = p.map(($) => ({ vals: e.readSync($.dataId), shape: $.shape })), m = xs(
       p.map(($) => $.shape),
       1
       /* axis */
-    ), b = p[0].shape[0] === 1, y = s2(g, m, s, b), S = ws(n.map(($) => $.shape), t), x = e.makeTensorInfo(S, s, y);
+    ), b = p[0].shape[0] === 1, y = s2(g, m, s, b), S = xs(n.map(($) => $.shape), t), x = e.makeTensorInfo(S, s, y);
     return p.forEach(($) => e.disposeData($.dataId)), x;
   }
   const o = e.device.limits.maxStorageBuffersPerShaderStage - 1;
@@ -22792,9 +22789,9 @@ function fs(n, t, e) {
     const p = [];
     for (let m = 0; m < n.length; m += o) {
       const b = n.slice(m, m + o);
-      p.push(fs(b, t, e));
+      p.push(ds(b, t, e));
     }
-    const g = fs(p, t, e);
+    const g = ds(p, t, e);
     for (const m of p)
       e.disposeData(m.dataId);
     return g;
@@ -22811,7 +22808,7 @@ function fs(n, t, e) {
   return e.disposeData(f.dataId), d;
 }
 function xv(n, t, e) {
-  const s = ws(n.map((o) => o.shape), t);
+  const s = xs(n.map((o) => o.shape), t);
   return { tensors2D: n.map((o) => dt({
     inputs: { x: o },
     backend: e,
@@ -22840,13 +22837,13 @@ function xv(n, t, e) {
  * =============================================================================
  */
 function Sv(n) {
-  const { inputs: t, backend: e, attrs: s } = n, { axis: r } = s, o = As(r, t[0].shape)[0], i = t.map((u) => u.shape);
+  const { inputs: t, backend: e, attrs: s } = n, { axis: r } = s, o = Es(r, t[0].shape)[0], i = t.map((u) => u.shape);
   dy(i, o);
-  const a = ws(t.map((u) => u.shape), o);
+  const a = xs(t.map((u) => u.shape), o);
   if (U(a) === 0)
     return e.makeTensorInfo(a, t[0].dtype, []);
   const l = t.filter((u) => U(u.shape) > 0);
-  return l.length === 1 ? je({ inputs: { x: l[0] }, backend: e }) : fs(l, o, e);
+  return l.length === 1 ? He({ inputs: { x: l[0] }, backend: e }) : ds(l, o, e);
 }
 const $v = {
   kernelName: Hl,
@@ -22888,7 +22885,7 @@ async function Iv() {
   }
 }
 async function ff(n, t) {
-  const e = new Os(n, t);
+  const e = new Bs(n, t);
   return A.registerBackend("webgpu-oidn", () => e), await A.setBackend("webgpu-oidn"), e;
 }
 async function Av(n, t, e) {