@genai-fi/nanogpt 0.4.1 → 0.4.2

package/dist/ops/webgl/fusedSoftmax.js

@@ -1,9 +1,10 @@
-import { aW as Jt, n as y, aX as Qt, aY as ut, aj as It, aZ as K, a_ as nt, a$ as Ot, b0 as xt, b1 as gt, b2 as te, W as ot, ao as Z, b3 as W, b4 as ee, b5 as pt, j as zt, t as ne, b6 as mt, b7 as tt, Y as ht, b8 as oe, aI as se, ab as St, b9 as re, ba as ie, r as ae } from "../../index-XjBAhiFO.js";
-import { c as bt, g as Wt, a as kt, b as Ut, e as vt } from "../../axis_util-DeydwOoC.js";
-import { b as ue, i as le, c as ce } from "../../slice_util-CnVNPQI-.js";
-import { r as he } from "../../reshape-DFzh97Sc.js";
-import { g as fe } from "../../_commonjsHelpers-ByX85dGu.js";
-function de(t, e) {
+import { aZ as jt, n as O, al as Bt, a_ as K, a$ as nt, b0 as xt, b1 as mt, b2 as dt, b3 as Zt, W as ot, aa as Z, b4 as W, b5 as Ht, am as Kt, j as Lt, t as Xt, b6 as gt, ak as ht, b7 as tt, Y as lt, b8 as Yt, ab as Jt, b9 as Qt, af as te, ba as ee, r as ne } from "../../index-C4JCoBvj.js";
+import { f as Mt, a as oe, b as se, g as _t, c as re, d as ie } from "../../kernel_funcs_utils-CAd1h9X1.js";
+import { c as wt, g as At, a as Nt, b as Dt, e as It } from "../../axis_util-BgTGy5w8.js";
+import { b as ae, i as ue, c as le } from "../../slice_util-19zDNNSn.js";
+import { r as ce } from "../../reshape-Boe4DuIO.js";
+import { g as he } from "../../_commonjsHelpers-ByX85dGu.js";
+function fe(t, e) {
   for (var n = 0; n < e.length; n++) {
     const o = e[n];
     if (typeof o != "string" && !Array.isArray(o)) {
@@ -19,10 +20,10 @@ function de(t, e) {
   }
   return Object.freeze(Object.defineProperty(t, Symbol.toStringTag, { value: "Module" }));
 }
-var dt, yt;
-function ge() {
-  if (yt) return dt;
-  yt = 1, dt = e;
+var ft, St;
+function de() {
+  if (St) return ft;
+  St = 1, ft = e;
   var t = null;
   try {
     t = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
@@ -315,85 +316,85 @@ function ge() {
     ])), {}).exports;
   } catch {
   }
-  function e(x, l, v) {
-    this.low = x | 0, this.high = l | 0, this.unsigned = !!v;
+  function e(I, l, v) {
+    this.low = I | 0, this.high = l | 0, this.unsigned = !!v;
   }
   e.prototype.__isLong__, Object.defineProperty(e.prototype, "__isLong__", { value: !0 });
-  function n(x) {
-    return (x && x.__isLong__) === !0;
+  function n(I) {
+    return (I && I.__isLong__) === !0;
   }
   e.isLong = n;
   var o = {}, s = {};
-  function r(x, l) {
-    var v, O, V;
-    return l ? (x >>>= 0, (V = 0 <= x && x < 256) && (O = s[x], O) ? O : (v = a(x, (x | 0) < 0 ? -1 : 0, !0), V && (s[x] = v), v)) : (x |= 0, (V = -128 <= x && x < 128) && (O = o[x], O) ? O : (v = a(x, x < 0 ? -1 : 0, !1), V && (o[x] = v), v));
+  function r(I, l) {
+    var v, R, T;
+    return l ? (I >>>= 0, (T = 0 <= I && I < 256) && (R = s[I], R) ? R : (v = a(I, (I | 0) < 0 ? -1 : 0, !0), T && (s[I] = v), v)) : (I |= 0, (T = -128 <= I && I < 128) && (R = o[I], R) ? R : (v = a(I, I < 0 ? -1 : 0, !1), T && (o[I] = v), v));
   }
   e.fromInt = r;
-  function i(x, l) {
-    if (isNaN(x))
-      return l ? I : g;
+  function i(I, l) {
+    if (isNaN(I))
+      return l ? x : g;
     if (l) {
-      if (x < 0)
-        return I;
-      if (x >= m)
-        return A;
-    } else {
-      if (x <= -b)
-        return L;
-      if (x + 1 >= b)
+      if (I < 0)
+        return x;
+      if (I >= m)
         return M;
+    } else {
+      if (I <= -b)
+        return _;
+      if (I + 1 >= b)
+        return z;
     }
-    return x < 0 ? i(-x, l).neg() : a(x % p | 0, x / p | 0, l);
+    return I < 0 ? i(-I, l).neg() : a(I % p | 0, I / p | 0, l);
   }
   e.fromNumber = i;
-  function a(x, l, v) {
-    return new e(x, l, v);
+  function a(I, l, v) {
+    return new e(I, l, v);
   }
   e.fromBits = a;
   var u = Math.pow;
-  function c(x, l, v) {
-    if (x.length === 0)
+  function c(I, l, v) {
+    if (I.length === 0)
       throw Error("empty string");
-    if (x === "NaN" || x === "Infinity" || x === "+Infinity" || x === "-Infinity")
+    if (I === "NaN" || I === "Infinity" || I === "+Infinity" || I === "-Infinity")
       return g;
     if (typeof l == "number" ? (v = l, l = !1) : l = !!l, v = v || 10, v < 2 || 36 < v)
       throw RangeError("radix");
-    var O;
-    if ((O = x.indexOf("-")) > 0)
+    var R;
+    if ((R = I.indexOf("-")) > 0)
       throw Error("interior hyphen");
-    if (O === 0)
-      return c(x.substring(1), l, v).neg();
-    for (var V = i(u(v, 8)), T = g, N = 0; N < x.length; N += 8) {
-      var U = Math.min(8, x.length - N), B = parseInt(x.substring(N, N + U), v);
-      if (U < 8) {
-        var C = i(u(v, U));
-        T = T.mul(C).add(i(B));
+    if (R === 0)
+      return c(I.substring(1), l, v).neg();
+    for (var T = i(u(v, 8)), y = g, A = 0; A < I.length; A += 8) {
+      var q = Math.min(8, I.length - A), G = parseInt(I.substring(A, A + q), v);
+      if (q < 8) {
+        var P = i(u(v, q));
+        y = y.mul(P).add(i(G));
       } else
-        T = T.mul(V), T = T.add(i(B));
+        y = y.mul(T), y = y.add(i(G));
     }
-    return T.unsigned = l, T;
+    return y.unsigned = l, y;
   }
   e.fromString = c;
-  function h(x, l) {
-    return typeof x == "number" ? i(x, l) : typeof x == "string" ? c(x, l) : a(x.low, x.high, typeof l == "boolean" ? l : x.unsigned);
+  function h(I, l) {
+    return typeof I == "number" ? i(I, l) : typeof I == "string" ? c(I, l) : a(I.low, I.high, typeof l == "boolean" ? l : I.unsigned);
   }
   e.fromValue = h;
   var f = 65536, w = 1 << 24, p = f * f, m = p * p, b = m / 2, d = r(w), g = r(0);
   e.ZERO = g;
-  var I = r(0, !0);
-  e.UZERO = I;
+  var x = r(0, !0);
+  e.UZERO = x;
   var $ = r(1);
   e.ONE = $;
   var E = r(1, !0);
   e.UONE = E;
-  var F = r(-1);
-  e.NEG_ONE = F;
-  var M = a(-1, 2147483647, !1);
-  e.MAX_VALUE = M;
-  var A = a(-1, -1, !0);
-  e.MAX_UNSIGNED_VALUE = A;
-  var L = a(0, -2147483648, !1);
-  e.MIN_VALUE = L;
+  var V = r(-1);
+  e.NEG_ONE = V;
+  var z = a(-1, 2147483647, !1);
+  e.MAX_VALUE = z;
+  var M = a(-1, -1, !0);
+  e.MAX_UNSIGNED_VALUE = M;
+  var _ = a(0, -2147483648, !1);
+  e.MIN_VALUE = _;
   var S = e.prototype;
   return S.toInt = function() {
     return this.unsigned ? this.low >>> 0 : this.low;
@@ -405,18 +406,18 @@ function ge() {
     if (this.isZero())
       return "0";
     if (this.isNegative())
-      if (this.eq(L)) {
-        var v = i(l), O = this.div(v), V = O.mul(v).sub(this);
-        return O.toString(l) + V.toInt().toString(l);
+      if (this.eq(_)) {
+        var v = i(l), R = this.div(v), T = R.mul(v).sub(this);
+        return R.toString(l) + T.toInt().toString(l);
       } else
         return "-" + this.neg().toString(l);
-    for (var T = i(u(l, 6), this.unsigned), N = this, U = ""; ; ) {
-      var B = N.div(T), C = N.sub(B.mul(T)).toInt() >>> 0, _ = C.toString(l);
-      if (N = B, N.isZero())
-        return _ + U;
-      for (; _.length < 6; )
-        _ = "0" + _;
-      U = "" + _ + U;
+    for (var y = i(u(l, 6), this.unsigned), A = this, q = ""; ; ) {
+      var G = A.div(y), P = A.sub(G.mul(y)).toInt() >>> 0, L = P.toString(l);
+      if (A = G, A.isZero())
+        return L + q;
+      for (; L.length < 6; )
+        L = "0" + L;
+      q = "" + L + q;
     }
   }, S.getHighBits = function() {
     return this.high;
@@ -428,7 +429,7 @@ function ge() {
     return this.low >>> 0;
   }, S.getNumBitsAbs = function() {
     if (this.isNegative())
-      return this.eq(L) ? 64 : this.neg().getNumBitsAbs();
+      return this.eq(_) ? 64 : this.neg().getNumBitsAbs();
     for (var l = this.high != 0 ? this.high : this.low, v = 31; v > 0 && (l & 1 << v) == 0; v--)
       ;
     return this.high != 0 ? v + 33 : v + 1;
@@ -472,14 +473,14 @@ function ge() {
   }, S.gte = S.greaterThanOrEqual, S.ge = S.greaterThanOrEqual, S.compare = function(l) {
     if (n(l) || (l = h(l)), this.eq(l))
       return 0;
-    var v = this.isNegative(), O = l.isNegative();
-    return v && !O ? -1 : !v && O ? 1 : this.unsigned ? l.high >>> 0 > this.high >>> 0 || l.high === this.high && l.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(l).isNegative() ? -1 : 1;
+    var v = this.isNegative(), R = l.isNegative();
+    return v && !R ? -1 : !v && R ? 1 : this.unsigned ? l.high >>> 0 > this.high >>> 0 || l.high === this.high && l.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(l).isNegative() ? -1 : 1;
   }, S.comp = S.compare, S.negate = function() {
-    return !this.unsigned && this.eq(L) ? L : this.not().add($);
+    return !this.unsigned && this.eq(_) ? _ : this.not().add($);
   }, S.neg = S.negate, S.add = function(l) {
     n(l) || (l = h(l));
-    var v = this.high >>> 16, O = this.high & 65535, V = this.low >>> 16, T = this.low & 65535, N = l.high >>> 16, U = l.high & 65535, B = l.low >>> 16, C = l.low & 65535, _ = 0, G = 0, P = 0, q = 0;
-    return q += T + C, P += q >>> 16, q &= 65535, P += V + B, G += P >>> 16, P &= 65535, G += O + U, _ += G >>> 16, G &= 65535, _ += v + N, _ &= 65535, a(P << 16 | q, _ << 16 | G, this.unsigned);
+    var v = this.high >>> 16, R = this.high & 65535, T = this.low >>> 16, y = this.low & 65535, A = l.high >>> 16, q = l.high & 65535, G = l.low >>> 16, P = l.low & 65535, L = 0, j = 0, D = 0, U = 0;
+    return U += y + P, D += U >>> 16, U &= 65535, D += T + G, j += D >>> 16, D &= 65535, j += R + q, L += j >>> 16, j &= 65535, L += v + A, L &= 65535, a(D << 16 | U, L << 16 | j, this.unsigned);
   }, S.subtract = function(l) {
     return n(l) || (l = h(l)), this.add(l.neg());
   }, S.sub = S.subtract, S.multiply = function(l) {
@@ -496,18 +497,18 @@ function ge() {
     }
     if (l.isZero())
       return g;
-    if (this.eq(L))
-      return l.isOdd() ? L : g;
-    if (l.eq(L))
-      return this.isOdd() ? L : g;
+    if (this.eq(_))
+      return l.isOdd() ? _ : g;
+    if (l.eq(_))
+      return this.isOdd() ? _ : g;
     if (this.isNegative())
       return l.isNegative() ? this.neg().mul(l.neg()) : this.neg().mul(l).neg();
     if (l.isNegative())
       return this.mul(l.neg()).neg();
     if (this.lt(d) && l.lt(d))
       return i(this.toNumber() * l.toNumber(), this.unsigned);
-    var O = this.high >>> 16, V = this.high & 65535, T = this.low >>> 16, N = this.low & 65535, U = l.high >>> 16, B = l.high & 65535, C = l.low >>> 16, _ = l.low & 65535, G = 0, P = 0, q = 0, rt = 0;
-    return rt += N * _, q += rt >>> 16, rt &= 65535, q += T * _, P += q >>> 16, q &= 65535, q += N * C, P += q >>> 16, q &= 65535, P += V * _, G += P >>> 16, P &= 65535, P += T * C, G += P >>> 16, P &= 65535, P += N * B, G += P >>> 16, P &= 65535, G += O * _ + V * C + T * B + N * U, G &= 65535, a(q << 16 | rt, G << 16 | P, this.unsigned);
+    var R = this.high >>> 16, T = this.high & 65535, y = this.low >>> 16, A = this.low & 65535, q = l.high >>> 16, G = l.high & 65535, P = l.low >>> 16, L = l.low & 65535, j = 0, D = 0, U = 0, rt = 0;
+    return rt += A * L, U += rt >>> 16, rt &= 65535, U += y * L, D += U >>> 16, U &= 65535, U += A * P, D += U >>> 16, U &= 65535, D += T * L, j += D >>> 16, D &= 65535, D += y * P, j += D >>> 16, D &= 65535, D += A * G, j += D >>> 16, D &= 65535, j += R * L + T * P + y * G + A * q, j &= 65535, a(U << 16 | rt, j << 16 | D, this.unsigned);
   }, S.mul = S.multiply, S.divide = function(l) {
     if (n(l) || (l = h(l)), l.isZero())
       throw Error("division by zero");
@@ -523,37 +524,37 @@ function ge() {
       return a(v, t.get_high(), this.unsigned);
     }
     if (this.isZero())
-      return this.unsigned ? I : g;
-    var O, V, T;
+      return this.unsigned ? x : g;
+    var R, T, y;
     if (this.unsigned) {
       if (l.unsigned || (l = l.toUnsigned()), l.gt(this))
-        return I;
+        return x;
       if (l.gt(this.shru(1)))
         return E;
-      T = I;
+      y = x;
     } else {
-      if (this.eq(L)) {
-        if (l.eq($) || l.eq(F))
-          return L;
-        if (l.eq(L))
+      if (this.eq(_)) {
+        if (l.eq($) || l.eq(V))
+          return _;
+        if (l.eq(_))
           return $;
-        var N = this.shr(1);
-        return O = N.div(l).shl(1), O.eq(g) ? l.isNegative() ? $ : F : (V = this.sub(l.mul(O)), T = O.add(V.div(l)), T);
-      } else if (l.eq(L))
-        return this.unsigned ? I : g;
+        var A = this.shr(1);
+        return R = A.div(l).shl(1), R.eq(g) ? l.isNegative() ? $ : V : (T = this.sub(l.mul(R)), y = R.add(T.div(l)), y);
+      } else if (l.eq(_))
+        return this.unsigned ? x : g;
       if (this.isNegative())
         return l.isNegative() ? this.neg().div(l.neg()) : this.neg().div(l).neg();
       if (l.isNegative())
         return this.div(l.neg()).neg();
-      T = g;
+      y = g;
     }
-    for (V = this; V.gte(l); ) {
-      O = Math.max(1, Math.floor(V.toNumber() / l.toNumber()));
-      for (var U = Math.ceil(Math.log(O) / Math.LN2), B = U <= 48 ? 1 : u(2, U - 48), C = i(O), _ = C.mul(l); _.isNegative() || _.gt(V); )
-        O -= B, C = i(O, this.unsigned), _ = C.mul(l);
-      C.isZero() && (C = $), T = T.add(C), V = V.sub(_);
+    for (T = this; T.gte(l); ) {
+      R = Math.max(1, Math.floor(T.toNumber() / l.toNumber()));
+      for (var q = Math.ceil(Math.log(R) / Math.LN2), G = q <= 48 ? 1 : u(2, q - 48), P = i(R), L = P.mul(l); L.isNegative() || L.gt(T); )
+        R -= G, P = i(R, this.unsigned), L = P.mul(l);
+      P.isZero() && (P = $), y = y.add(P), T = T.sub(L);
     }
-    return T;
+    return y;
   }, S.div = S.divide, S.modulo = function(l) {
     if (n(l) || (l = h(l)), t) {
       var v = (this.unsigned ? t.rem_u : t.rem_s)(
@@ -582,8 +583,8 @@ function ge() {
       return this;
     var v = this.high;
     if (l < 32) {
-      var O = this.low;
-      return a(O >>> l | v << 32 - l, v >>> l, this.unsigned);
+      var R = this.low;
+      return a(R >>> l | v << 32 - l, v >>> l, this.unsigned);
     } else return l === 32 ? a(v, 0, this.unsigned) : a(v >>> l - 32, 0, this.unsigned);
   }, S.shru = S.shiftRightUnsigned, S.shr_u = S.shiftRightUnsigned, S.toSigned = function() {
     return this.unsigned ? a(this.low, this.high, !1) : this;
@@ -615,8 +616,8 @@ function ge() {
       v >>> 8 & 255,
       v & 255
     ];
-  }, e.fromBytes = function(l, v, O) {
-    return O ? e.fromBytesLE(l, v) : e.fromBytesBE(l, v);
+  }, e.fromBytes = function(l, v, R) {
+    return R ? e.fromBytesLE(l, v) : e.fromBytesBE(l, v);
   }, e.fromBytesLE = function(l, v) {
     return new e(
       l[0] | l[1] << 8 | l[2] << 16 | l[3] << 24,
@@ -629,13 +630,13 @@ function ge() {
       l[0] << 24 | l[1] << 16 | l[2] << 8 | l[3],
       v
     );
-  }, dt;
+  }, ft;
 }
-var qt = ge();
-const Bt = /* @__PURE__ */ fe(qt), pe = /* @__PURE__ */ de({
+var zt = de();
+const Pt = /* @__PURE__ */ he(zt), ge = /* @__PURE__ */ fe({
   __proto__: null,
-  default: Bt
-}, [qt]);
+  default: Pt
+}, [zt]);
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -654,80 +655,80 @@ const Bt = /* @__PURE__ */ fe(qt), pe = /* @__PURE__ */ de({
  */
 const Q = (
   // tslint:disable-next-line
-  Bt || pe
+  Pt || ge
 );
-function ft(t) {
+function ct(t) {
   return Q.fromString(t, !0, 16);
 }
-const Gt = ft("c3a5c85c97cb3127"), J = ft("b492b66fbe98f273"), z = ft("9ae16a3b2f90404f");
-function wt(t) {
+const Ct = ct("c3a5c85c97cb3127"), J = ct("b492b66fbe98f273"), C = ct("9ae16a3b2f90404f");
+function pt(t) {
   return t.xor(t.shru(47));
 }
-function jt(t, e, n) {
+function Wt(t, e, n) {
   const o = t.slice(e, e + n);
   return Q.fromBytes(Array.from(o), !0, !0);
 }
-function R(t, e) {
-  return jt(t, e, 8);
+function F(t, e) {
+  return Wt(t, e, 8);
 }
-function Rt(t, e) {
-  return jt(t, e, 4);
+function vt(t, e) {
+  return Wt(t, e, 4);
 }
-function D(t, e) {
+function N(t, e) {
   return e === 0 ? t : t.shru(e).or(t.shl(64 - e));
 }
-function Y(t, e, n = ft("9ddfea08eb382d69")) {
+function Y(t, e, n = ct("9ddfea08eb382d69")) {
   let o = t.xor(e).mul(n);
   o = o.xor(o.shru(47));
   let s = e.xor(o).mul(n);
   return s = s.xor(s.shru(47)), s = s.mul(n), s;
 }
-function me(t, e, n, o, s, r) {
-  s = s.add(t), r = D(r.add(s).add(o), 21);
+function pe(t, e, n, o, s, r) {
+  s = s.add(t), r = N(r.add(s).add(o), 21);
   const i = s;
-  return s = s.add(e), s = s.add(n), r = r.add(D(s, 44)), [s.add(o), r.add(i)];
+  return s = s.add(e), s = s.add(n), r = r.add(N(s, 44)), [s.add(o), r.add(i)];
 }
 function it(t, e, n, o) {
-  return me(R(t, e), R(t, e + 8), R(t, e + 16), R(t, e + 24), n, o);
+  return pe(F(t, e), F(t, e + 8), F(t, e + 16), F(t, e + 24), n, o);
 }
-function we(t, e = t.length) {
+function me(t, e = t.length) {
   if (e >= 8) {
-    const n = z.add(e * 2), o = R(t, 0).add(z), s = R(t, e - 8), r = D(s, 37).mul(n).add(o), i = D(o, 25).add(s).mul(n);
+    const n = C.add(e * 2), o = F(t, 0).add(C), s = F(t, e - 8), r = N(s, 37).mul(n).add(o), i = N(o, 25).add(s).mul(n);
     return Y(r, i, n);
   }
   if (e >= 4) {
-    const n = z.add(e * 2), o = Rt(t, 0);
-    return Y(o.shl(3).add(e), Rt(t, e - 4), n);
+    const n = C.add(e * 2), o = vt(t, 0);
+    return Y(o.shl(3).add(e), vt(t, e - 4), n);
   }
   if (e > 0) {
     const n = t[0], o = t[e >> 1], s = t[e - 1], r = n + (o << 8), i = e + (s << 2);
-    return wt(z.mul(r).xor(Gt.mul(i))).mul(z);
+    return pt(C.mul(r).xor(Ct.mul(i))).mul(C);
   }
-  return z;
+  return C;
+}
+function we(t, e = t.length) {
+  const n = C.add(e * 2), o = F(t, 0).mul(J), s = F(t, 8), r = F(t, e - 8).mul(n), i = F(t, e - 16).mul(C);
+  return Y(N(o.add(s), 43).add(N(r, 30)).add(i), o.add(N(s.add(C), 18)).add(r), n);
 }
 function Ie(t, e = t.length) {
-  const n = z.add(e * 2), o = R(t, 0).mul(J), s = R(t, 8), r = R(t, e - 8).mul(n), i = R(t, e - 16).mul(z);
-  return Y(D(o.add(s), 43).add(D(r, 30)).add(i), o.add(D(s.add(z), 18)).add(r), n);
+  const n = C.add(e * 2), o = F(t, 0).mul(C), s = F(t, 8), r = F(t, e - 8).mul(n), i = F(t, e - 16).mul(C), a = N(o.add(s), 43).add(N(r, 30)).add(i), u = Y(a, o.add(N(s.add(C), 18)).add(r), n), c = F(t, 16).mul(n), h = F(t, 24), f = a.add(F(t, e - 32)).mul(n), w = u.add(F(t, e - 24)).mul(n);
+  return Y(N(c.add(h), 43).add(N(f, 30)).add(w), c.add(N(h.add(o), 18)).add(f), n);
 }
 function xe(t, e = t.length) {
-  const n = z.add(e * 2), o = R(t, 0).mul(z), s = R(t, 8), r = R(t, e - 8).mul(n), i = R(t, e - 16).mul(z), a = D(o.add(s), 43).add(D(r, 30)).add(i), u = Y(a, o.add(D(s.add(z), 18)).add(r), n), c = R(t, 16).mul(n), h = R(t, 24), f = a.add(R(t, e - 32)).mul(n), w = u.add(R(t, e - 24)).mul(n);
-  return Y(D(c.add(h), 43).add(D(f, 30)).add(w), c.add(D(h.add(o), 18)).add(f), n);
-}
-function Se(t, e = t.length) {
   const n = Q.fromNumber(81, !0);
   if (e <= 32)
-    return e <= 16 ? we(t, e) : Ie(t, e);
+    return e <= 16 ? me(t, e) : we(t, e);
   if (e <= 64)
-    return xe(t, e);
-  let o = n, s = n.mul(J).add(113), r = wt(s.mul(z).add(113)).mul(z), i = [Q.UZERO, Q.UZERO], a = [Q.UZERO, Q.UZERO];
-  o = o.mul(z).add(R(t, 0));
+    return Ie(t, e);
+  let o = n, s = n.mul(J).add(113), r = pt(s.mul(C).add(113)).mul(C), i = [Q.UZERO, Q.UZERO], a = [Q.UZERO, Q.UZERO];
+  o = o.mul(C).add(F(t, 0));
   let u = 0;
   const c = (e - 1 >> 6) * 64, h = c + (e - 1 & 63) - 63;
   do
-    o = D(o.add(s).add(i[0]).add(R(t, u + 8)), 37).mul(J), s = D(s.add(i[1]).add(R(t, u + 48)), 42).mul(J), o = o.xor(a[1]), s = s.add(i[0]).add(R(t, u + 40)), r = D(r.add(a[0]), 33).mul(J), i = it(t, u, i[1].mul(J), o.add(a[0])), a = it(t, u + 32, r.add(a[1]), s.add(R(t, u + 16))), [r, o] = [o, r], u += 64;
+    o = N(o.add(s).add(i[0]).add(F(t, u + 8)), 37).mul(J), s = N(s.add(i[1]).add(F(t, u + 48)), 42).mul(J), o = o.xor(a[1]), s = s.add(i[0]).add(F(t, u + 40)), r = N(r.add(a[0]), 33).mul(J), i = it(t, u, i[1].mul(J), o.add(a[0])), a = it(t, u + 32, r.add(a[1]), s.add(F(t, u + 16))), [r, o] = [o, r], u += 64;
   while (u !== c);
   const f = J.add(r.and(255).shl(1));
-  return u = h, a[0] = a[0].add(e - 1 & 63), i[0] = i[0].add(a[0]), a[0] = a[0].add(i[0]), o = D(o.add(s).add(i[0]).add(R(t, u + 8)), 37).mul(f), s = D(s.add(i[1]).add(R(t, u + 48)), 42).mul(f), o = o.xor(a[1].mul(9)), s = s.add(i[0].mul(9).add(R(t, u + 40))), r = D(r.add(a[0]), 33).mul(f), i = it(t, u, i[1].mul(f), o.add(a[0])), a = it(t, u + 32, r.add(a[1]), s.add(R(t, u + 16))), [r, o] = [o, r], Y(Y(i[0], a[0], f).add(wt(s).mul(Gt)).add(r), Y(i[1], a[1], f).add(o), f);
+  return u = h, a[0] = a[0].add(e - 1 & 63), i[0] = i[0].add(a[0]), a[0] = a[0].add(i[0]), o = N(o.add(s).add(i[0]).add(F(t, u + 8)), 37).mul(f), s = N(s.add(i[1]).add(F(t, u + 48)), 42).mul(f), o = o.xor(a[1].mul(9)), s = s.add(i[0].mul(9).add(F(t, u + 40))), r = N(r.add(a[0]), 33).mul(f), i = it(t, u, i[1].mul(f), o.add(a[0])), a = it(t, u + 32, r.add(a[1]), s.add(F(t, u + 16))), [r, o] = [o, r], Y(Y(i[0], a[0], f).add(pt(s).mul(Ct)).add(r), Y(i[1], a[1], f).add(o), f);
 }
 /**
  * @license
@@ -749,7 +750,7 @@ var H;
 (function(t) {
   t[t.FIRST_DIM_SIZE = 0] = "FIRST_DIM_SIZE", t[t.VALUE_ROWIDS = 1] = "VALUE_ROWIDS", t[t.ROW_LENGTHS = 2] = "ROW_LENGTHS", t[t.ROW_SPLITS = 3] = "ROW_SPLITS", t[t.ROW_LIMITS = 4] = "ROW_LIMITS", t[t.ROW_STARTS = 5] = "ROW_STARTS";
 })(H || (H = {}));
-function be(t, e, n) {
+function Se(t, e, n) {
   let o = new Array();
   if (n == null && e == null)
     return o;
@@ -789,10 +790,10 @@ function ve(t) {
       break;
   return n;
 }
-function Ee(t) {
+function be(t) {
   return t.length === 0 ? 0 : t[0] === H.FIRST_DIM_SIZE ? t.length - 1 : t.length;
 }
-function $e(t, e) {
+function Ee(t, e) {
   if (t == null || e == null)
     return;
   const n = t.length, o = e.length;
@@ -820,9 +821,9 @@ function $e(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-const Oe = 30;
-function ye(t) {
-  return t <= Oe ? t : Jt(t, Math.floor(Math.sqrt(t)));
+const $e = 30;
+function Re(t) {
+  return t <= $e ? t : jt(t, Math.floor(Math.sqrt(t)));
 }
 /**
  * @license
@@ -840,14 +841,14 @@ function ye(t) {
  * limitations under the License.
  * =============================================================================
  */
-function Re(t) {
+function Fe(t) {
   return `Received SparseTensor with denseShape[0] = 0 but
   indices.shape[0] = ${t}`;
 }
-function Fe(t, e) {
+function Oe(t, e) {
   return `indices(${t}, 0) is invalid: ${e} < 0`;
 }
-function Te(t, e, n) {
+function ye(t, e, n) {
   return `indices(${t}, 0) is invalid: ${e} >= ${n}`;
 }
 /**
@@ -866,22 +867,22 @@ function Te(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-function Ve(t, e) {
+function Te(t, e) {
   return `only one output dimension may be -1, not both ${t} and ${e}`;
 }
-function Ae(t, e) {
+function Ve(t, e) {
   return `size ${t} must be non-negative, not ${e}`;
 }
 function Le() {
   return "reshape cannot infer the missing input size for an empty tensor unless all specified input sizes are non-zero";
 }
-function _e(t, e) {
-  const n = y(t), o = y(e);
+function Me(t, e) {
+  const n = O(t), o = O(e);
   return `Input to reshape is a SparseTensor with ${n}
   dense values, but the requested shape requires a multiple of ${o}. inputShape=${t} outputShape= ${e}`;
 }
-function Me(t, e) {
-  const n = y(t), o = y(e);
+function _e(t, e) {
+  const n = O(t), o = O(e);
   return `Input to reshape is a tensor with ${n} dense values, but the requested shape has ${o}. inputShape=${t} outputShape=${e}`;
 }
 /**
@@ -900,44 +901,18 @@ function Me(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function Ft() {
+function bt() {
   return "segment ids must be >= 0";
 }
-function Ne() {
+function Ae() {
   return "segment ids are not increasing";
 }
-function De(t, e) {
+function Ne(t, e) {
   return `Segment id ${t} out of range [0, ${e}), possibly because segmentIds input is not sorted.`;
 }
-function Pe(t, e, n) {
+function De(t, e, n) {
   return `Bad: indices[${t}] == ${e} out of range [0, ${n})`;
 }
-/**
- * @license
- * Copyright 2018 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function lt(t) {
-  try {
-    return t.map((e) => Qt(e));
-  } catch (e) {
-    throw new Error(`Failed to decode encoded string bytes into utf-8, error: ${e}`);
-  }
-}
-function Ce(t) {
-  return t.map((e) => ut(e));
-}
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -978,18 +953,18 @@ function ze(t) {
  */
 function k(t) {
   return (e, n, o, s, r) => {
-    const i = It(e, n), a = i.length, u = K(i), c = y(i), h = nt(r, c), f = e.length, w = n.length, p = K(e), m = K(n), b = Ot(e, i), d = Ot(n, i);
+    const i = Bt(e, n), a = i.length, u = K(i), c = O(i), h = nt(r, c), f = e.length, w = n.length, p = K(e), m = K(n), b = xt(e, i), d = xt(n, i);
     if (b.length + d.length === 0)
       for (let g = 0; g < h.length; ++g)
         h[g] = t(o[g % o.length], s[g % s.length]);
     else
       for (let g = 0; g < h.length; ++g) {
-        const I = xt(g, a, u), $ = I.slice(-f);
-        b.forEach((A) => $[A] = 0);
-        const E = gt($, f, p), F = I.slice(-w);
-        d.forEach((A) => F[A] = 0);
-        const M = gt(F, w, m);
-        h[g] = t(o[E], s[M]);
+        const x = mt(g, a, u), $ = x.slice(-f);
+        b.forEach((M) => $[M] = 0);
+        const E = dt($, f, p), V = x.slice(-w);
+        d.forEach((M) => V[M] = 0);
+        const z = dt(V, w, m);
+        h[g] = t(o[E], s[z]);
       }
     return [h, i];
   };
@@ -1010,13 +985,13 @@ function k(t) {
  * limitations under the License.
  * =============================================================================
  */
-function We(t, e, n, o) {
+function Pe(t, e, n, o) {
   if (o === "int32") {
     const s = Int32Array.from(t);
     return [e, "int32", s];
   }
   if (o === "bool") {
-    const s = te([0], n), [r, i] = k((a, u) => a !== u ? 1 : 0)(e, [], t, s, "bool");
+    const s = Zt([0], n), [r, i] = k((a, u) => a !== u ? 1 : 0)(e, [], t, s, "bool");
     return [i, "bool", r];
   }
   throw new Error(`Error in Cast: failed to cast ${n} to ${o}`);
@@ -1037,7 +1012,7 @@ function We(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const ke = k((t, e) => t + e);
+const Ce = k((t, e) => t + e);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1054,8 +1029,8 @@ const ke = k((t, e) => t + e);
  * limitations under the License.
  * =============================================================================
  */
-function Ue(t, e, n, o, s) {
-  const r = y(o), i = ot(s, n);
+function We(t, e, n, o, s) {
+  const r = O(o), i = ot(s, n);
   for (let a = 0; a < t.length; a++) {
     const u = t[a];
     if (u < 0)
@@ -1064,7 +1039,7 @@ function Ue(t, e, n, o, s) {
   }
   return i;
 }
-function qe(t, e, n, o = !1) {
+function ke(t, e, n, o = !1) {
   const s = t.shape[0], r = t.shape[1], i = Z([s, n], e.dtype);
   for (let a = 0; a < s; a++)
     for (let u = 0; u < r; u++) {
@@ -1091,7 +1066,7 @@ function qe(t, e, n, o = !1) {
  * limitations under the License.
  * =============================================================================
  */
-const Be = k((t, e) => t & e);
+const qe = k((t, e) => t & e);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1132,7 +1107,7 @@ function X(t) {
  * limitations under the License.
  * =============================================================================
  */
-const Ge = X((t) => Math.ceil(t));
+const Ue = X((t) => Math.ceil(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1149,18 +1124,18 @@ const Ge = X((t) => Math.ceil(t));
  * limitations under the License.
  * =============================================================================
  */
-function je(t, e, n, o) {
-  const s = W(n, y(e));
+function Ge(t, e, n, o) {
+  const s = W(n, O(e));
   if (o && n !== "string") {
     let r = 0;
     t.forEach((i) => {
-      const a = y(i.shape);
+      const a = O(i.shape);
       s.set(i.vals, r), r += a;
     });
   } else {
     let r = 0;
     t.forEach((i) => {
-      const a = n === "string" ? lt(i.vals) : i.vals;
+      const a = n === "string" ? Mt(i.vals) : i.vals;
       let u = 0;
       for (let c = 0; c < i.shape[0]; ++c) {
         const h = c * e[1] + r;
@@ -1188,7 +1163,7 @@ function je(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const Ze = k((t, e) => t === e ? 1 : 0);
+const je = k((t, e) => t === e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1205,7 +1180,7 @@ const Ze = k((t, e) => t === e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const He = X((t) => Math.exp(t));
+const Be = X((t) => Math.exp(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1222,7 +1197,7 @@ const He = X((t) => Math.exp(t));
  * limitations under the License.
  * =============================================================================
  */
-const Ke = X((t) => Math.expm1(t));
+const Ze = X((t) => Math.expm1(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1239,7 +1214,7 @@ const Ke = X((t) => Math.expm1(t));
  * limitations under the License.
  * =============================================================================
  */
-const Xe = X((t) => Math.floor(t));
+const He = X((t) => Math.floor(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1256,7 +1231,7 @@ const Xe = X((t) => Math.floor(t));
  * limitations under the License.
  * =============================================================================
  */
-const Ye = k((t, e) => Math.floor(t / e));
+const Ke = k((t, e) => Math.floor(t / e));
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -1273,7 +1248,7 @@ const Ye = k((t, e) => Math.floor(t / e));
  * limitations under the License.
  * =============================================================================
  */
-function Je(t, e, n, o, s, r, i, a, u) {
+function Xe(t, e, n, o, s, r, i, a, u) {
   const c = Z([o, r], n);
   for (let h = 0; h < o; h++) {
     const f = [];
@@ -1305,7 +1280,7 @@ function Je(t, e, n, o, s, r, i, a, u) {
  * limitations under the License.
  * =============================================================================
  */
-function Qe(t, e, n) {
+function Ye(t, e, n) {
   const o = Z(n, t.dtype);
   for (let s = 0; s < o.size; ++s) {
     const i = o.indexToLoc(s).slice(), a = i[0], u = i[2], c = e.locToIndex([a, u]);
@@ -1331,7 +1306,7 @@ function Qe(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-const tn = k((t, e) => t > e ? 1 : 0);
+const Je = k((t, e) => t > e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1348,7 +1323,7 @@ const tn = k((t, e) => t > e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const en = k((t, e) => t >= e ? 1 : 0);
+const Qe = k((t, e) => t >= e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1365,7 +1340,7 @@ const en = k((t, e) => t >= e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const nn = k((t, e) => t < e ? 1 : 0);
+const tn = k((t, e) => t < e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1382,7 +1357,7 @@ const nn = k((t, e) => t < e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const on = k((t, e) => t <= e ? 1 : 0);
+const en = k((t, e) => t <= e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1399,7 +1374,7 @@ const on = k((t, e) => t <= e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-function sn(t, e, n) {
+function nn(t, e, n) {
   const o = (e - t) / (n - 1), s = ot(n, "float32");
   s[0] = t;
   for (let r = 1; r < s.length; r++)
@@ -1422,7 +1397,7 @@ function sn(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-const rn = X((t) => Math.log(t));
+const on = X((t) => Math.log(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1439,8 +1414,8 @@ const rn = X((t) => Math.log(t));
  * limitations under the License.
  * =============================================================================
  */
-function an(t, e, n, o) {
-  const s = nt(o, y(n));
+function sn(t, e, n, o) {
+  const s = nt(o, O(n));
   for (let r = 0; r < s.length; ++r) {
     const i = r * e;
     let a = t[i];
@@ -1468,7 +1443,7 @@ function an(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const un = k((t, e) => Math.max(t, e));
+const rn = k((t, e) => Math.max(t, e));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1485,7 +1460,7 @@ const un = k((t, e) => Math.max(t, e));
  * limitations under the License.
  * =============================================================================
  */
-const ln = k((t, e) => Math.min(t, e));
+const an = k((t, e) => Math.min(t, e));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1502,7 +1477,7 @@ const ln = k((t, e) => Math.min(t, e));
  * limitations under the License.
  * =============================================================================
  */
-const Zt = k((t, e) => t * e);
+const kt = k((t, e) => t * e);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1519,9 +1494,9 @@ const Zt = k((t, e) => t * e);
  * limitations under the License.
  * =============================================================================
  */
-function cn(t, e, n) {
-  const o = ee(-1, n);
-  return Zt([], e, o, t, n);
+function un(t, e, n) {
+  const o = Ht(-1, n);
+  return kt([], e, o, t, n);
 }
 /**
  * @license
@@ -1539,7 +1514,7 @@ function cn(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-const hn = k((t, e) => t !== e ? 1 : 0);
+const ln = k((t, e) => t !== e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1556,13 +1531,13 @@ const hn = k((t, e) => t !== e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-function fn(t, e, n, o, s) {
-  const r = e.length, i = y(e), a = K(e), u = K(s), c = nt(n, y(s));
+function cn(t, e, n, o, s) {
+  const r = e.length, i = O(e), a = K(e), u = K(s), c = nt(n, O(s));
   for (let h = 0; h < i; ++h) {
-    const f = xt(h, r, a), w = new Array(f.length);
+    const f = mt(h, r, a), w = new Array(f.length);
     for (let m = 0; m < w.length; m++)
       w[m] = f[o[m]];
-    const p = gt(w, r, u);
+    const p = dt(w, r, u);
     c[p] = t[h];
   }
   return c;
@@ -1583,8 +1558,8 @@ function fn(t, e, n, o, s) {
  * limitations under the License.
  * =============================================================================
  */
-function dn(t, e, n, o) {
-  const [s, r] = bt(t, o), i = pt(e, "int32"), a = ot(y(s), i), u = y(r);
+function hn(t, e, n, o) {
+  const [s, r] = wt(t, o), i = Kt(e, "int32"), a = ot(O(s), i), u = O(r);
   for (let c = 0; c < a.length; ++c) {
     const h = c * u;
     let f = 1;
@@ -1610,15 +1585,15 @@ function dn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-function gn(t, e, n) {
+function fn(t, e, n) {
   t.forEach((o, s) => {
     if (o < 0 || o >= n) {
-      const r = xt(s, e.length, K(e)).join(",");
+      const r = mt(s, e.length, K(e)).join(",");
       throw new Error(`indices[${r}] = ${o} is not in [0, ${n})`);
     }
   });
 }
-function pn(t, e) {
+function dn(t, e) {
   for (let n = 0; n < t.length; ++n) {
     const o = t[n], s = n === t.length - 1 ? e : t[n + 1].length;
     if (o.length === 0)
@@ -1632,11 +1607,11 @@ function pn(t, e) {
         throw new Error("Ragged splits must be sorted in ascending order");
   }
 }
-function mn(t, e, n, o) {
+function gn(t, e, n, o) {
   const s = [];
   let r = 0;
   const i = e.length - 1 + n.length, a = new Array(i).fill(null).map(() => [0]);
-  pn(n, o);
+  dn(n, o);
   let u = 1;
   for (let c = 0; c < e.length - 1; ++c) {
     u *= e[c];
@@ -1659,7 +1634,7 @@ function mn(t, e, n, o) {
   }
   return { outSplits: a, valueSlices: s, numValues: r };
 }
-function wn(t) {
+function pn(t) {
   const e = [];
   for (let n = 0; n < t.length; ++n) {
     const o = t[n].length, s = W("int32", o);
@@ -1667,7 +1642,7 @@ function wn(t) {
   }
   return e;
 }
-function Tt(t, e) {
+function Et(t, e) {
   const n = t.slice(0, e);
   for (; n.length < e; )
     n.push(1);
@@ -1675,8 +1650,8 @@ function Tt(t, e) {
     n[e - 1] *= t[o];
   return n;
 }
-function In(t, e, n, o, s, r) {
-  const i = Tt(e, 2)[1], a = Tt(r, 2)[1];
+function mn(t, e, n, o, s, r) {
+  const i = Et(e, 2)[1], a = Et(r, 2)[1];
   let u = 0;
   for (const c of n)
     for (let h = c[0]; h < c[1]; ++h) {
@@ -1685,21 +1660,21 @@ function In(t, e, n, o, s, r) {
       ++u;
     }
 }
-function xn(t, e, n, o, s) {
+function wn(t, e, n, o, s) {
   const r = e.slice();
   r[0] = s;
-  const i = W(n, y(r)), a = t.length, u = a === 0 ? 0 : a / e[0];
-  return In(t, e, o, u, i, r), [i, r];
+  const i = W(n, O(r)), a = t.length, u = a === 0 ? 0 : a / e[0];
+  return mn(t, e, o, u, i, r), [i, r];
 }
-function Sn(t, e, n, o, s, r, i, a) {
+function In(t, e, n, o, s, r, i, a) {
   if (t.length === 0)
     throw new Error("paramsNestedSplits must be non empty");
   if (e[0].length === 0)
     throw new Error("Split tensors must not be scalars");
   const u = e[0][0] - 1;
-  if (gn(r, i, u), o.length === 0)
+  if (fn(r, i, u), o.length === 0)
     throw new Error("params.rank must be nonzero");
-  const c = o[0], { outSplits: h, valueSlices: f, numValues: w } = mn(r, i, t, c), p = wn(h), m = xn(n, o, s, f, w);
+  const c = o[0], { outSplits: h, valueSlices: f, numValues: w } = gn(r, i, t, c), p = pn(h), m = wn(n, o, s, f, w);
   return [p, m[0], m[1]];
 }
 /**
@@ -1718,8 +1693,8 @@ function Sn(t, e, n, o, s, r, i, a) {
  * limitations under the License.
  * =============================================================================
  */
-const Vt = 2147483647;
-function bn(t, e, n, o, s, r, i) {
+const $t = 2147483647;
+function xn(t, e, n, o, s, r, i) {
   if (e.length > 1)
     throw new Error("starts must be a scalar or vector");
   if (s.length > 1)
@@ -1734,24 +1709,24 @@ function bn(t, e, n, o, s, r, i) {
   const f = h.length === 0 ? 1 : h[0], w = W("int32", f + 1);
   w[0] = 0;
   for (let d = 0; d < f; ++d) {
-    const g = a ? t[0] : t[d], I = u ? o[0] : o[d], $ = c ? r[0] : r[d];
+    const g = a ? t[0] : t[d], x = u ? o[0] : o[d], $ = c ? r[0] : r[d];
     if ($ === 0)
       throw new Error("Requires delta != 0");
     let E;
-    if ($ > 0 && I < g || $ < 0 && I > g)
+    if ($ > 0 && x < g || $ < 0 && x > g)
       E = 0;
-    else if (E = Math.ceil(Math.abs((I - g) / $)), E > Vt)
-      throw new Error(`Requires ((limit - start) / delta) <= ${Vt}`);
+    else if (E = Math.ceil(Math.abs((x - g) / $)), E > $t)
+      throw new Error(`Requires ((limit - start) / delta) <= ${$t}`);
     w[d + 1] = w[d] + E;
   }
   const p = w[f], m = W(n, p);
   let b = 0;
   for (let d = 0; d < f; ++d) {
     const g = w[d + 1] - w[d];
-    let I = a ? t[0] : t[d];
+    let x = a ? t[0] : t[d];
     const $ = c ? r[0] : r[d];
     for (let E = 0; E < g; ++E)
-      m[b++] = I, I += $;
+      m[b++] = x, x += $;
   }
   return [w, m];
 }
@@ -1771,27 +1746,27 @@ function bn(t, e, n, o, s, r, i) {
  * limitations under the License.
  * =============================================================================
  */
-var j = H;
-class ct {
+var B = H;
+class ut {
   constructor(e, n, o, s, r, i, a, u, c, h) {
-    this.shape = e, this.shapeShape = n, this.values = o, this.valuesShape = s, this.valuesDType = r, this.defaultValue = i, this.defaultValueShape = a, this.rowPartitionValues = u, this.rowPartitionValuesShapes = c, this.rowPartitionTypes = ve(h), this.raggedRank = Ee(this.rowPartitionTypes);
+    this.shape = e, this.shapeShape = n, this.values = o, this.valuesShape = s, this.valuesDType = r, this.defaultValue = i, this.defaultValueShape = a, this.rowPartitionValues = u, this.rowPartitionValuesShapes = c, this.rowPartitionTypes = ve(h), this.raggedRank = be(this.rowPartitionTypes);
   }
   getRowPartitionTypeByDimension(e) {
-    return this.rowPartitionTypes[0] === j.FIRST_DIM_SIZE ? this.rowPartitionTypes[e + 1] : this.rowPartitionTypes[e];
+    return this.rowPartitionTypes[0] === B.FIRST_DIM_SIZE ? this.rowPartitionTypes[e + 1] : this.rowPartitionTypes[e];
   }
   // Returns the relationship between dimension and dimension + 1.
   getRowPartitionTensor(e) {
-    return this.rowPartitionTypes[0] === j.FIRST_DIM_SIZE ? this.rowPartitionValues[e + 1] : this.rowPartitionValues[e];
+    return this.rowPartitionTypes[0] === B.FIRST_DIM_SIZE ? this.rowPartitionValues[e + 1] : this.rowPartitionValues[e];
   }
   getMaxWidth(e) {
     const n = this.getRowPartitionTensor(e - 1);
     switch (this.getRowPartitionTypeByDimension(e - 1)) {
-      case j.VALUE_ROWIDS:
-        return ct.getMaxWidthValueRowID(n);
-      case j.ROW_SPLITS:
-        return ct.getMaxWidthRowSplit(n);
+      case B.VALUE_ROWIDS:
+        return ut.getMaxWidthValueRowID(n);
+      case B.ROW_SPLITS:
+        return ut.getMaxWidthRowSplit(n);
       default:
-        throw new Error(`Cannot handle partition type ${j[this.getRowPartitionTypeByDimension(e - 1)]}`);
+        throw new Error(`Cannot handle partition type ${B[this.getRowPartitionTypeByDimension(e - 1)]}`);
     }
   }
   static getMaxWidthRowSplit(e) {
@@ -1822,12 +1797,12 @@ class ct {
         return [];
       throw new Error("The only valid scalar shape tensor is the fully unknown shape specified as -1.");
     }
-    return Lt(e, o);
+    return Ft(e, o);
   }
   calculateOutputSize(e) {
     const n = this.valuesShape, o = this.defaultValueShape;
-    $e(o, n);
-    const s = this.tensorShapeFromTensor(this.shape, this.shapeShape), i = be(this.raggedRank, s, n);
+    Ee(o, n);
+    const s = this.tensorShapeFromTensor(this.shape, this.shapeShape), i = Se(this.raggedRank, s, n);
     i[0] < 0 && (i[0] = e);
     for (let a = 1; a <= this.raggedRank; ++a)
       i[a] < 0 && (i[a] = this.getMaxWidth(a));
@@ -1850,7 +1825,7 @@ class ct {
       r.push(i);
     for (let a = s; a < e; ++a)
       r.push(-1);
-    return zt(r.length === e, () => "Final length of result must be equal to firstDimension."), r;
+    return Lt(r.length === e, () => "Final length of result must be equal to firstDimension."), r;
   }
   calculateOutputIndexRowSplit(e, n, o, s) {
     const r = e.length, i = [];
@@ -1915,14 +1890,14 @@ class ct {
   calculateOutputIndex(e, n, o, s) {
     const r = this.getRowPartitionTensor(e), i = this.getRowPartitionTypeByDimension(e);
     switch (i) {
-      case j.VALUE_ROWIDS:
+      case B.VALUE_ROWIDS:
         return this.calculateOutputIndexValueRowID(r, n, o, s);
-      case j.ROW_SPLITS:
+      case B.ROW_SPLITS:
         if (r.length - 1 > n.length)
           throw new Error(`Row partition size is greater than output size: ${r.length - 1} > ${n.length}`);
         return this.calculateOutputIndexRowSplit(r, n, o, s);
       default:
-        throw new Error(`Unsupported partition type: ${j[i]}`);
+        throw new Error(`Unsupported partition type: ${B[i]}`);
     }
   }
   getFirstDimensionSize() {
@@ -1931,14 +1906,14 @@ class ct {
       throw new Error("No row_partition_types given.");
     const n = this.rowPartitionTypes[0];
     switch (n) {
-      case j.FIRST_DIM_SIZE:
+      case B.FIRST_DIM_SIZE:
         return e[0];
-      case j.VALUE_ROWIDS:
+      case B.VALUE_ROWIDS:
         throw new Error("Cannot handle VALUE_ROWIDS in first dimension.");
-      case j.ROW_SPLITS:
+      case B.ROW_SPLITS:
         return this.rowPartitionValuesShapes[0][0] - 1;
       default:
-        throw new Error(`Cannot handle type ${j[n]}`);
+        throw new Error(`Cannot handle type ${B[n]}`);
     }
   }
   compute() {
@@ -1948,7 +1923,7 @@ class ct {
     s[s.length - 1] = 1;
     for (let u = s.length - 2; u >= 0; --u)
       s[u] = s[u + 1] * o[u + 1];
-    const r = Lt(o, !1), i = W(this.valuesDType, y(r));
+    const r = Ft(o, !1), i = W(this.valuesDType, O(r));
     if (s[0] * o[0] > 0) {
       let u = this.calculateFirstParentOutputIndex(n, s[0], o[0]);
       for (let c = 1; c <= this.raggedRank; ++c)
@@ -1963,13 +1938,13 @@ class ct {
     const r = this.values, i = o;
     let a = s.slice();
     a = a.slice(e + 1);
-    const u = y(a), c = n.length;
+    const u = O(a), c = n.length;
     let h = this.defaultValue;
     if (h.length !== u && h.length !== 1) {
       const m = this.defaultValueShape;
-      ne(() => {
-        const b = he(h, m);
-        h = ue(b, a).dataSync();
+      Xt(() => {
+        const b = ce(h, m);
+        h = ae(b, a).dataSync();
       });
     }
     let f = 0, w = 0, p = 0;
@@ -1980,8 +1955,8 @@ class ct {
         continue;
       }
       if (w < p) {
-        const d = r.subarray(f * u), g = i.subarray(w * u), I = (p - w) * u;
-        At(g, d, I);
+        const d = r.subarray(f * u), g = i.subarray(w * u), x = (p - w) * u;
+        Rt(g, d, x);
       }
       if (m >= c) {
         const d = o.length;
@@ -1993,17 +1968,17 @@ class ct {
         else
           for (; b > p; ) {
             const d = i.slice(p * u);
-            At(d, h, u), ++p;
+            Rt(d, h, u), ++p;
           }
       b < 0 ? (f = m + 1, w = p) : (f = m, w = p, p = w + 1);
     }
   }
 }
-function At(t, e, n) {
+function Rt(t, e, n) {
   for (let o = 0; o < n; o++)
     t[o] = e[o];
 }
-function Lt(t, e) {
+function Ft(t, e) {
   const n = [];
   for (let o of t) {
     if (o < 0) {
@@ -2017,8 +1992,8 @@ function Lt(t, e) {
   }
   return n;
 }
-function vn(t, e, n, o, s, r, i, a, u, c) {
-  return new ct(t, e, n, o, s, r, i, a, u, c).compute();
+function Sn(t, e, n, o, s, r, i, a, u, c) {
+  return new ut(t, e, n, o, s, r, i, a, u, c).compute();
 }
 /**
  * @license
@@ -2036,7 +2011,7 @@ function vn(t, e, n, o, s, r, i, a, u, c) {
  * limitations under the License.
  * =============================================================================
  */
-function En(t, e, n, o) {
+function vn(t, e, n, o) {
   const s = t === e, r = t < e && n < 0, i = e < t && n > 1;
   if (s || r || i)
     return ot(0, o);
@@ -2062,7 +2037,7 @@ function En(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const $n = X((t) => 1 / Math.sqrt(t));
+const bn = X((t) => 1 / Math.sqrt(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2079,18 +2054,18 @@ const $n = X((t) => 1 / Math.sqrt(t));
  * limitations under the License.
  * =============================================================================
  */
-function On(t, e, n, o, s, r, i, a, u, c) {
+function En(t, e, n, o, s, r, i, a, u, c) {
   const h = [o / s, s], f = t.values, w = e.values;
   if (o === 0)
     return Z(n, e.dtype);
-  const p = u instanceof mt ? u : Z(h, e.dtype);
+  const p = u instanceof gt ? u : Z(h, e.dtype);
   typeof u == "string" || typeof u == "number" ? p.values.fill(u) : typeof u == "boolean" && p.values.fill(+u);
   for (let m = 0; m < r; m++) {
     const b = [];
     let d = 0;
     for (let g = 0; g < i; g++) {
-      const I = f[m * i + g];
-      b.push(I), d += I * a[g];
+      const x = f[m * i + g];
+      b.push(x), d += x * a[g];
     }
     if (d < 0 || d >= o / s)
       throw new Error(`Invalid indices: ${b} does not index into ${n}`);
@@ -2115,7 +2090,7 @@ function On(t, e, n, o, s, r, i, a, u, c) {
  * limitations under the License.
  * =============================================================================
  */
-const yn = X((t) => 1 / (1 + Math.exp(-t)));
+const $n = X((t) => 1 / (1 + Math.exp(-t)));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2133,17 +2108,17 @@ const yn = X((t) => 1 / (1 + Math.exp(-t)));
  * =============================================================================
  */
 function Rn(t, e, n, o, s) {
-  const r = le(o, e, n), i = y(n), a = K(o);
+  const r = ue(o, e, n), i = O(n), a = K(o);
   if (r) {
-    const f = ce(e, a);
+    const f = le(e, a);
     return s === "string" ? t.slice(f, f + i) : t.subarray(f, f + i);
   }
-  const u = s === "string" ? lt(t) : t, c = Z(o, s, u), h = Z(n, s);
+  const u = s === "string" ? Mt(t) : t, c = Z(o, s, u), h = Z(n, s);
   for (let f = 0; f < h.size; ++f) {
     const w = h.indexToLoc(f), p = w.map((m, b) => m + e[b]);
     h.set(c.get(...p), ...w);
   }
-  return s === "string" ? Ce(h.values) : h.values;
+  return s === "string" ? oe(h.values) : h.values;
 }
 /**
  * @license
@@ -2165,7 +2140,7 @@ function Fn(t, e, n, o, s, r, i) {
   const a = e[0], u = r[0], c = new Array(u), h = new Array(a), f = e[1];
   if (u === 0) {
     if (a !== 0)
-      throw new Error(Re(a));
+      throw new Error(Fe(a));
     const d = W(n, 0), g = W(s, 0);
     return [
       d,
@@ -2180,9 +2155,9 @@ function Fn(t, e, n, o, s, r, i) {
   for (let d = 0; d < a; ++d) {
     const g = t[d * f];
     if (g < 0)
-      throw new Error(Fe(d, g));
+      throw new Error(Oe(d, g));
     if (g >= u)
-      throw new Error(Te(d, g, u));
+      throw new Error(ye(d, g, u));
     ++m[g], w = w && g >= p, p = g;
   }
   let b = !0;
@@ -2192,8 +2167,8 @@ function Fn(t, e, n, o, s, r, i) {
   }
   if (b && w) {
     const d = t, g = o;
-    for (let I = 0; I < a; ++I)
-      h[I] = I;
+    for (let x = 0; x < a; ++x)
+      h[x] = x;
     return [
       d,
       [a, f],
@@ -2202,26 +2177,26 @@ function Fn(t, e, n, o, s, r, i) {
       h
     ];
   } else {
-    const d = m[u - 1], g = W(n, d * f), I = W(s, d), $ = new Array(u).fill(0);
+    const d = m[u - 1], g = W(n, d * f), x = W(s, d), $ = new Array(u).fill(0);
     for (let E = 0; E < a; ++E) {
-      const F = t[E * f], M = $[F], A = (F === 0 ? 0 : m[F - 1]) + M;
-      $[F]++;
-      for (let L = 0; L < f; ++L)
-        g[A * f + L] = t[E * f + L];
-      I[A] = o[E], h[E] = A;
+      const V = t[E * f], z = $[V], M = (V === 0 ? 0 : m[V - 1]) + z;
+      $[V]++;
+      for (let _ = 0; _ < f; ++_)
+        g[M * f + _] = t[E * f + _];
+      x[M] = o[E], h[E] = M;
     }
     for (let E = 0; E < u; ++E)
       if ($[E] === 0) {
-        const M = E === 0 ? 0 : m[E - 1];
-        g[M * f + 0] = E;
-        for (let A = 1; A < f; ++A)
-          g[M * f + A] = 0;
-        I[M] = i;
+        const z = E === 0 ? 0 : m[E - 1];
+        g[z * f + 0] = E;
+        for (let M = 1; M < f; ++M)
+          g[z * f + M] = 0;
+        x[z] = i;
       }
     return [
       g,
       [d, f],
-      I,
+      x,
       c,
       h
     ];
@@ -2243,18 +2218,18 @@ function Fn(t, e, n, o, s, r, i) {
  * limitations under the License.
  * =============================================================================
  */
-function Tn(t, e, n, o, s) {
-  const r = y(o), i = e[0], a = s.length, u = [];
+function On(t, e, n, o, s) {
+  const r = O(o), i = e[0], a = s.length, u = [];
   let c = 1, h = -1;
   for (let d = 0; d < a; ++d) {
     const g = s[d];
     if (g === -1) {
       if (h !== -1)
-        throw new Error(Ve(h, d));
+        throw new Error(Te(h, d));
       h = d, u.push(1);
     } else {
       if (g < 0)
-        throw new Error(Ae(d, g));
+        throw new Error(Ve(d, g));
       c *= g, u.push(g);
     }
   }
@@ -2263,11 +2238,11 @@ function Tn(t, e, n, o, s) {
       throw new Error(Le());
     const d = Math.trunc(r / c);
     if (c * d !== r)
-      throw new Error(_e(o, u));
+      throw new Error(Me(o, u));
     u[h] = d;
   }
-  if (y(u) !== r)
-    throw new Error(Me(o, u));
+  if (O(u) !== r)
+    throw new Error(_e(o, u));
   const w = o.length, p = [];
   if (w > 0) {
     p[w - 1] = 1;
@@ -2283,10 +2258,10 @@ function Tn(t, e, n, o, s) {
   const b = W(n, i * a);
   for (let d = 0; d < i; ++d) {
     let g = 0;
-    for (let I = 0; I < w; ++I)
-      g += t[d * w + I] * p[I];
-    for (let I = 0; I < a; ++I)
-      b[d * a + I] = Math.trunc(g / m[I]), g %= m[I];
+    for (let x = 0; x < w; ++x)
+      g += t[d * w + x] * p[x];
+    for (let x = 0; x < a; ++x)
+      b[d * a + x] = Math.trunc(g / m[x]), g %= m[x];
   }
   return [b, [i, a], u];
 }
@@ -2306,42 +2281,42 @@ function Tn(t, e, n, o, s) {
  * limitations under the License.
  * =============================================================================
  */
-function Vn(t, e, n, o, s, r = !1, i = 0) {
+function yn(t, e, n, o, s, r = !1, i = 0) {
   const a = o.length, u = [e[0], t.length / e[0]], c = u[1], f = a > 0 ? s[a - 1] + 1 : 0;
   if (f < 0)
-    throw new Error(Ft());
+    throw new Error(bt());
   const w = e.slice();
   w[0] = f;
   const p = w.reduce(($, E) => $ * E, 1), m = W(n, p);
   if (a === 0)
     return f > 0 && m.fill(i), [m, w];
   if (f <= 0)
-    throw new Error(Ft());
-  let b = 0, d = 1, g = 0, I = s[b];
+    throw new Error(bt());
+  let b = 0, d = 1, g = 0, x = s[b];
   for (; ; ) {
     let $ = 0;
     if (d < a) {
-      if ($ = s[d], I === $) {
+      if ($ = s[d], x === $) {
         ++d;
         continue;
       }
-      if (I >= $)
-        throw new Error(Ne());
+      if (x >= $)
+        throw new Error(Ae());
     }
-    if (I < 0 || I >= f)
-      throw new Error(De(I, f));
-    I > g && m.fill(i, g * c, I * c);
+    if (x < 0 || x >= f)
+      throw new Error(Ne(x, f));
+    x > g && m.fill(i, g * c, x * c);
     for (let E = b; E < d; ++E) {
-      const F = o[E];
-      if (F < 0 || F >= u[0])
-        throw new Error(Pe(E, o[E], u[0]));
-      for (let M = 0; M < c; M++)
-        m[I * c + M] += t[F * c + M];
+      const V = o[E];
+      if (V < 0 || V >= u[0])
+        throw new Error(De(E, o[E], u[0]));
+      for (let z = 0; z < c; z++)
+        m[x * c + z] += t[V * c + z];
     }
     if (r)
       for (let E = 0; E < c; E++)
-        m[I * c + E] /= d - b;
-    if (b = d, ++d, g = I + 1, I = $, d > a)
+        m[x * c + E] /= d - b;
+    if (b = d, ++d, g = x + 1, x = $, d > a)
       break;
   }
   return g < f && m.fill(i, g * c, f * c), [m, w];
@@ -2362,7 +2337,7 @@ function Vn(t, e, n, o, s, r = !1, i = 0) {
  * limitations under the License.
  * =============================================================================
  */
-const An = X((t) => Math.sqrt(t));
+const Tn = X((t) => Math.sqrt(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2379,7 +2354,7 @@ const An = X((t) => Math.sqrt(t));
  * limitations under the License.
  * =============================================================================
  */
-const Ln = k((t, e) => {
+const Vn = k((t, e) => {
   const n = t - e;
   return n * n;
 });
@@ -2399,7 +2374,7 @@ const Ln = k((t, e) => {
  * limitations under the License.
  * =============================================================================
  */
-const _n = X((t, e) => {
+const Ln = X((t, e) => {
   const { pattern: n, replaceGlobal: o, rewrite: s } = e;
   return t.replace(new RegExp(n, o ? "g" : ""), s);
 });
@@ -2445,9 +2420,9 @@ function Mn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-class Nn {
+class _n {
   constructor(e, n, o, s, r, i) {
-    this.separator = ut(e), this.nGramWidths = n, this.leftPad = ut(o), this.rightPad = ut(s), this.padWidth = r, this.preserveShort = i;
+    this.separator = ht(e), this.nGramWidths = n, this.leftPad = ht(o), this.rightPad = ht(s), this.padWidth = r, this.preserveShort = i;
   }
   getPadWidth(e) {
     return Math.min(this.padWidth < 0 ? e - 1 : this.padWidth, e - 1);
@@ -2461,24 +2436,24 @@ class Nn {
       const u = this.getPadWidth(i), c = Math.max(0, u - a), h = Math.max(0, u - (r - (a + 1))), f = i - (c + h), w = n + (c > 0 ? 0 : a - u);
       let p = 0;
       p += c * this.leftPad.length;
-      for (let I = 0; I < f; ++I)
-        p += e[w + I].length;
+      for (let x = 0; x < f; ++x)
+        p += e[w + x].length;
       p += h * this.rightPad.length;
       const m = c + h + f - 1;
       p += m * this.separator.length, o[s + a] = new Uint8Array(p);
       const b = o[s + a];
       let d = 0;
-      const g = (I) => I.forEach(($) => b[d++] = $);
-      for (let I = 0; I < c; ++I)
+      const g = (x) => x.forEach(($) => b[d++] = $);
+      for (let x = 0; x < c; ++x)
         g(this.leftPad), g(this.separator);
-      for (let I = 0; I < f - 1; ++I)
-        g(e[w + I]), g(this.separator);
+      for (let x = 0; x < f - 1; ++x)
+        g(e[w + x]), g(this.separator);
       if (f > 0) {
         g(e[w + f - 1]);
-        for (let I = 0; I < h; ++I)
+        for (let x = 0; x < h; ++x)
           g(this.separator), g(this.rightPad);
       } else {
-        for (let I = 0; I < h - 1; ++I)
+        for (let x = 0; x < h - 1; ++x)
           g(this.rightPad), g(this.separator);
         g(this.rightPad);
       }
@@ -2535,8 +2510,8 @@ class Nn {
     return [a, i];
   }
 }
-function Dn(t, e, n, o, s, r, i, a) {
-  return new Nn(n, o, s, r, i, a).compute(t, e);
+function An(t, e, n, o, s, r, i, a) {
+  return new _n(n, o, s, r, i, a).compute(t, e);
 }
 /**
  * @license
@@ -2554,7 +2529,7 @@ function Dn(t, e, n, o, s, r, i, a) {
  * limitations under the License.
  * =============================================================================
  */
-function Pn(t, e, n, o) {
+function Nn(t, e, n, o) {
   if (!t.length)
     return;
   if (e.length === 0) {
@@ -2579,13 +2554,13 @@ function Pn(t, e, n, o) {
       (!n || i.length !== 0) && o.push(i), s = r + 1;
     }
 }
-function Cn(t, e, n) {
+function Dn(t, e, n) {
   const o = t.length, s = [];
   let r = 0, i = 0;
   const a = new Array(o);
   for (let w = 0; w < o; ++w) {
     const p = s.length;
-    Pn(t[w], e, n, s);
+    Nn(t[w], e, n, s);
     const m = s.length - p;
     a[w] = m, r += m, i = Math.max(i, m);
   }
@@ -2615,7 +2590,7 @@ function Cn(t, e, n) {
 function zn(t, e) {
   const n = W("int32", t.length);
   for (let o = 0; o < t.length; ++o)
-    n[o] = Se(t[o]).modulo(e).getLowBitsUnsigned();
+    n[o] = xe(t[o]).modulo(e).getLowBitsUnsigned();
   return n;
 }
 /**
@@ -2634,7 +2609,7 @@ function zn(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-const Wn = k((t, e) => t - e);
+const Pn = k((t, e) => t - e);
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -2651,7 +2626,7 @@ const Wn = k((t, e) => t - e);
  * limitations under the License.
  * =============================================================================
  */
-function kn(t, e) {
+function Cn(t, e) {
   const n = new Array(t.rank);
   for (let s = 0; s < n.length; s++)
     n[s] = t.shape[s] * e[s];
@@ -2685,11 +2660,11 @@ const et = (t, e) => {
   const n = e.value - t.value;
   return n === 0 ? t.index - e.index : n;
 };
-function Ht(t, e, n = 0, o = t.length - 1) {
+function qt(t, e, n = 0, o = t.length - 1) {
   for (; o > n; ) {
     if (o - n > 600) {
       const a = o - n + 1, u = e - n + 1, c = Math.log(a), h = 0.5 * Math.exp(2 * c / 3), f = 0.5 * Math.sqrt(c * h * (a - h) / a) * Math.sign(u - a / 2), w = Math.max(n, Math.floor(e - u * h / a + f)), p = Math.min(o, Math.floor(e + (a - u) * h / a + f));
-      Ht(t, e, w, p);
+      qt(t, e, w, p);
     }
     const s = t[e];
     let r = n, i = o;
@@ -2702,15 +2677,15 @@ function Ht(t, e, n = 0, o = t.length - 1) {
     et(t[n], s) === 0 ? tt(t, n, i) : (i = i + 1, tt(t, i, o)), i <= e && (n = i + 1), e <= i && (o = i - 1);
   }
 }
-function Un(t, e, n, o, s) {
+function Wn(t, e, n, o, s) {
   const r = e[e.length - 1], [i, a] = [t.length / r, r], u = nt(n, i * o), c = nt("int32", i * o);
   for (let f = 0; f < i; f++) {
     const w = f * a, p = t.subarray(w, w + a);
     let m = new Array(p.length);
-    p.forEach((I, $) => m[$] = { value: I, index: $ }), o < m.length && (Ht(m, o), m = m.slice(0, o)), s && m.sort(et);
+    p.forEach((x, $) => m[$] = { value: x, index: $ }), o < m.length && (qt(m, o), m = m.slice(0, o)), s && m.sort(et);
     const b = f * o, d = u.subarray(b, b + o), g = c.subarray(b, b + o);
-    for (let I = 0; I < o; I++)
-      d[I] = m[I].value, g[I] = m[I].index;
+    for (let x = 0; x < o; x++)
+      d[x] = m[x].value, g[x] = m[x].index;
   }
   const h = e.slice();
   return h[h.length - 1] = o, [
@@ -2734,23 +2709,23 @@ function Un(t, e, n, o, s) {
  * limitations under the License.
  * =============================================================================
  */
-function qn(t, e, n, o) {
-  const s = ht(e, n)[0], r = [1, n[0], 1];
+function kn(t, e, n, o) {
+  const s = lt(e, n)[0], r = [1, n[0], 1];
   for (let m = 0; m < s; m++)
     r[0] *= n[m];
   r[1] = n[s];
   for (let m = s + 1; m < n.length; m++)
     r[2] *= n[m];
-  const i = /* @__PURE__ */ new Map(), a = new Int32Array(n[s]), u = new mt(r, o, t), c = [], h = r[0] === 1 && r[2] === 1;
+  const i = /* @__PURE__ */ new Map(), a = new Int32Array(n[s]), u = new gt(r, o, t), c = [], h = r[0] === 1 && r[2] === 1;
   for (let m = 0; m < n[s]; m++) {
     let b;
     if (h)
       b = t[m].toString();
     else {
       const g = [];
-      for (let I = 0; I < r[0]; I++)
+      for (let x = 0; x < r[0]; x++)
         for (let $ = 0; $ < r[2]; $++)
-          g.push(u.get(I, m, $));
+          g.push(u.get(x, m, $));
       b = g.join(",");
     }
     const d = i.get(b);
@@ -2763,7 +2738,7 @@ function qn(t, e, n, o) {
   }
   const f = r.slice();
   f[1] = i.size;
-  const w = new mt(f, o);
+  const w = new gt(f, o);
   c.forEach((m, b) => {
     for (let d = 0; d < r[0]; d++)
       for (let g = 0; g < r[2]; g++)
@@ -2792,59 +2767,59 @@ function qn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const Bn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const qn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  addImpl: ke,
-  bincountImpl: Ue,
-  bincountReduceImpl: qe,
-  bitwiseAndImpl: Be,
-  castImpl: We,
-  ceilImpl: Ge,
-  concatImpl: je,
-  equalImpl: Ze,
-  expImpl: He,
-  expm1Impl: Ke,
-  floorDivImpl: Ye,
-  floorImpl: Xe,
-  gatherNdImpl: Je,
-  gatherV2Impl: Qe,
-  greaterEqualImpl: en,
-  greaterImpl: tn,
-  lessEqualImpl: on,
-  lessImpl: nn,
-  linSpaceImpl: sn,
-  logImpl: rn,
-  maxImpl: an,
-  maximumImpl: un,
-  minimumImpl: ln,
-  multiplyImpl: Zt,
-  negImpl: cn,
-  notEqualImpl: hn,
-  prodImpl: dn,
-  raggedGatherImpl: Sn,
-  raggedRangeImpl: bn,
-  raggedTensorToTensorImpl: vn,
-  rangeImpl: En,
-  rsqrtImpl: $n,
-  scatterImpl: On,
-  sigmoidImpl: yn,
+  addImpl: Ce,
+  bincountImpl: We,
+  bincountReduceImpl: ke,
+  bitwiseAndImpl: qe,
+  castImpl: Pe,
+  ceilImpl: Ue,
+  concatImpl: Ge,
+  equalImpl: je,
+  expImpl: Be,
+  expm1Impl: Ze,
+  floorDivImpl: Ke,
+  floorImpl: He,
+  gatherNdImpl: Xe,
+  gatherV2Impl: Ye,
+  greaterEqualImpl: Qe,
+  greaterImpl: Je,
+  lessEqualImpl: en,
+  lessImpl: tn,
+  linSpaceImpl: nn,
+  logImpl: on,
+  maxImpl: sn,
+  maximumImpl: rn,
+  minimumImpl: an,
+  multiplyImpl: kt,
+  negImpl: un,
+  notEqualImpl: ln,
+  prodImpl: hn,
+  raggedGatherImpl: In,
+  raggedRangeImpl: xn,
+  raggedTensorToTensorImpl: Sn,
+  rangeImpl: vn,
+  rsqrtImpl: bn,
+  scatterImpl: En,
+  sigmoidImpl: $n,
   simpleAbsImpl: ze,
   sliceImpl: Rn,
   sparseFillEmptyRowsImpl: Fn,
-  sparseReshapeImpl: Tn,
-  sparseSegmentReductionImpl: Vn,
-  sqrtImpl: An,
-  squaredDifferenceImpl: Ln,
-  staticRegexReplaceImpl: _n,
+  sparseReshapeImpl: On,
+  sparseSegmentReductionImpl: yn,
+  sqrtImpl: Tn,
+  squaredDifferenceImpl: Vn,
+  staticRegexReplaceImpl: Ln,
   stridedSliceImpl: Mn,
-  stringNGramsImpl: Dn,
-  stringSplitImpl: Cn,
+  stringNGramsImpl: An,
+  stringSplitImpl: Dn,
   stringToHashBucketFastImpl: zn,
-  subImpl: Wn,
-  tileImpl: kn,
-  topKImpl: Un,
-  transposeImpl: fn,
-  uniqueImpl: qn
+  subImpl: Pn,
+  tileImpl: Cn,
+  topKImpl: Wn,
+  transposeImpl: cn,
+  uniqueImpl: kn
 }, Symbol.toStringTag, { value: "Module" }));
 /**
  * @license
@@ -2862,7 +2837,7 @@ const Bn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
  * limitations under the License.
  * =============================================================================
  */
-const { maxImpl: Gn, transposeImpl: jn } = Bn;
+const { maxImpl: Un, transposeImpl: Gn } = qn;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2879,7 +2854,7 @@ const { maxImpl: Gn, transposeImpl: jn } = Bn;
  * limitations under the License.
  * =============================================================================
  */
-class _t {
+class Ot {
   constructor(e, n) {
     this.variableNames = ["x"];
     const { windowSize: o, batchSize: s, inSize: r, outSize: i } = e;
@@ -2888,7 +2863,7 @@ class _t {
     let c = "sumValue += dot(values, ones);";
     if (n != null) {
       const f = 1 / n;
-      c = `sumValue += dot(values * ${oe(f) ? f.toPrecision(2) : f}, ones);`;
+      c = `sumValue += dot(values * ${Yt(f) ? f.toPrecision(2) : f}, ones);`;
     }
     let h = "";
     r % o > 0 && (h = `
@@ -2963,7 +2938,7 @@ class _t {
  * limitations under the License.
  * =============================================================================
  */
-class Zn {
+class jn {
   constructor(e, n) {
     this.variableNames = ["x"];
     const { windowSize: o, batchSize: s, inSize: r, outSize: i } = e;
@@ -3087,10 +3062,10 @@ class Zn {
  * limitations under the License.
  * =============================================================================
  */
-function Hn(t) {
+function Bn(t) {
   const e = [];
   for (; e.length === 0 || e[e.length - 1].outSize !== 1; ) {
-    const n = e.length ? e[e.length - 1].outSize : t[1], o = ye(n);
+    const n = e.length ? e[e.length - 1].outSize : t[1], o = Re(n);
     e.push({
       inSize: n,
       windowSize: o,
@@ -3099,13 +3074,13 @@ function Hn(t) {
   }
   return e;
 }
-function Kt(t, e, n, o) {
-  const s = Hn(t.shape);
+function Ut(t, e, n, o) {
+  const s = Bn(t.shape);
   let r = t;
   for (let i = 0; i < s.length; i++) {
     const { inSize: a, windowSize: u, outSize: c } = s[i];
     let h, f;
-    n === "mean" ? h = i === 0 ? new _t({ windowSize: u, inSize: a, batchSize: t.shape[0], outSize: c }, a) : new _t({ windowSize: u, inSize: a, batchSize: t.shape[0], outSize: c }) : h = new Zn({ windowSize: u, inSize: a, batchSize: t.shape[0], outSize: c }, n), f = r, r = o.runWebGLProgram(h, [r], e), f.dataId !== t.dataId && o.disposeIntermediateTensorInfo(f);
+    n === "mean" ? h = i === 0 ? new Ot({ windowSize: u, inSize: a, batchSize: t.shape[0], outSize: c }, a) : new Ot({ windowSize: u, inSize: a, batchSize: t.shape[0], outSize: c }) : h = new jn({ windowSize: u, inSize: a, batchSize: t.shape[0], outSize: c }, n), f = r, r = o.runWebGLProgram(h, [r], e), f.dataId !== t.dataId && o.disposeIntermediateTensorInfo(f);
   }
   return r;
 }
@@ -3125,28 +3100,28 @@ function Kt(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-function Kn(t, e, n = "index") {
+function Zn(t, e, n = "index") {
   const o = K(e);
   return o.map((s, r) => {
     const i = `int ${t[r]} = ${n} / ${s}`, a = r === o.length - 1 ? `int ${t[r + 1]} = ${n} - ${t[r]} * ${s}` : `index -= ${t[r]} * ${s}`;
     return `${i}; ${a};`;
   }).join("");
 }
-function Xn(t, e) {
+function Hn(t, e) {
   const n = t.length, o = t.map((r) => `${e}[${r}]`), s = new Array(n - 1);
   s[n - 2] = o[n - 1];
   for (let r = n - 3; r >= 0; --r)
     s[r] = `(${s[r + 1]} * ${o[r + 1]})`;
   return s;
 }
-function Yn(t, e, n = "index") {
-  const o = t.map((r, i) => i), s = Xn(o, e);
+function Kn(t, e, n = "index") {
+  const o = t.map((r, i) => i), s = Hn(o, e);
   return s.map((r, i) => {
     const a = `int ${t[i]} = ${n} / ${s[i]}`, u = i === s.length - 1 ? `int ${t[i + 1]} = ${n} - ${t[i]} * ${s[i]}` : `index -= ${t[i]} * ${s[i]}`;
     return `${a}; ${u};`;
   }).join("");
 }
-function Jn(t) {
+function Xn(t) {
   const e = K(t).map((n) => n.toString());
   return `
   int getFlatIndex(ivec3 coords) {
@@ -3154,7 +3129,7 @@ function Jn(t) {
   }
 `;
 }
-function Qn() {
+function Yn() {
   return `
   int getFlatIndex(ivec3 coords) {
     return coords.x * outShapeStrides[0] + coords.y * outShapeStrides[1] + coords.z;
@@ -3177,41 +3152,10 @@ function Qn() {
  * limitations under the License.
  * =============================================================================
  */
-function Et(t) {
-  if (t <= 1)
-    return "int";
-  if (t === 2)
-    return "ivec2";
-  if (t === 3)
-    return "ivec3";
-  if (t === 4)
-    return "ivec4";
-  if (t === 5)
-    return "ivec5";
-  if (t === 6)
-    return "ivec6";
-  throw Error(`GPU for rank ${t} is not yet supported`);
+function yt(t, e = 2) {
+  return O(t.slice(0, t.length - e));
 }
-/**
- * @license
- * Copyright 2017 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function Mt(t, e = 2) {
-  return y(t.slice(0, t.length - e));
-}
-function Nt(t) {
+function Tt(t) {
   if (t.length === 0)
     throw Error("Cannot get rows and columns of an empty shape array.");
   return [
@@ -3222,8 +3166,8 @@ function Nt(t) {
 function at(t) {
   return t % 2 === 0;
 }
-function Dt(t, e) {
-  if (t = t.slice(-2), e = e.slice(-2), se(t, e) || !t.length || !e.length || t[0] === 0 || t[1] === 0 || e[0] === 0 || e[1] === 0)
+function Vt(t, e) {
+  if (t = t.slice(-2), e = e.slice(-2), Jt(t, e) || !t.length || !e.length || t[0] === 0 || t[1] === 0 || e[0] === 0 || e[1] === 0)
     return !0;
   if (t.length !== e.length) {
     const n = t[t.length - 1], o = e[e.length - 1];
@@ -3232,25 +3176,6 @@ function Dt(t, e) {
   }
   return t[1] === e[1] && at(t[0]) && at(e[0]);
 }
-/**
- * @license
- * Copyright 2017 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function $t(t) {
-  return St().getBool("WEBGL_USE_SHAPES_UNIFORMS") && t <= 4;
-}
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -3267,9 +3192,9 @@ function $t(t) {
  * limitations under the License.
  * =============================================================================
  */
-class to {
+class Jn {
   constructor(e, n) {
-    this.variableNames = ["A"], this.packedInputs = !0, this.packedOutput = !0, this.customUniforms = [{ name: "inputShape", type: "ivec3" }], this.outputShape = e, this.enableShapeUniforms = $t(this.outputShape.length);
+    this.variableNames = ["A"], this.packedInputs = !0, this.packedOutput = !0, this.customUniforms = [{ name: "inputShape", type: "ivec3" }], this.outputShape = e, this.enableShapeUniforms = se(this.outputShape.length);
     let o = "";
     for (let s = 0; s < 4; s++) {
       let r = "thisRC = rc;";
@@ -3287,8 +3212,8 @@ class to {
       `;
     }
     this.userCode = `
-      ${eo(n, this.enableShapeUniforms)}
-      ${this.enableShapeUniforms ? Qn() : Jn(e)}
+      ${Qn(n, this.enableShapeUniforms)}
+      ${this.enableShapeUniforms ? Yn() : Xn(e)}
 
       void main() {
         ivec3 rc = getOutputCoords();
@@ -3306,10 +3231,10 @@ class to {
     `;
   }
 }
-function eo(t, e) {
+function Qn(t, e) {
   return `
     ivec3 inputCoordsFromReshapedOutCoords(int index) {
-      ${e ? Yn(["r", "c", "d"], "inputShape") : Kn(["r", "c", "d"], t)}
+      ${e ? Kn(["r", "c", "d"], "inputShape") : Zn(["r", "c", "d"], t)}
       return ivec3(r, c, d);
     }
   `;
@@ -3330,18 +3255,18 @@ function eo(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function no(t, e, n) {
+function to(t, e, n) {
   const o = [
-    Mt(t.shape),
-    ...Nt(t.shape)
+    yt(t.shape),
+    ...Tt(t.shape)
   ], s = {
     dtype: t.dtype,
     shape: o,
     dataId: t.dataId
   }, r = [
-    Mt(e),
-    ...Nt(e)
-  ], i = new to(r, o), a = !0, u = [o], c = n.runWebGLProgram(i, [s], t.dtype, u, a);
+    yt(e),
+    ...Tt(e)
+  ], i = new Jn(r, o), a = !0, u = [o], c = n.runWebGLProgram(i, [s], t.dtype, u, a);
   return { dataId: c.dataId, shape: e, dtype: c.dtype };
 }
 /**
@@ -3361,10 +3286,10 @@ function no(t, e, n) {
  * =============================================================================
  */
 function st(t) {
-  const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { shape: r } = o, i = n, a = y(s.shape), u = re(r, a), c = y(u);
-  zt(a === c, () => `The new shape (${u}) has ${c} elements and the old shape (${s.shape}) has ${a} elements. The new shape and old shape must have the same number of elements.`);
+  const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { shape: r } = o, i = n, a = O(s.shape), u = Qt(r, a), c = O(u);
+  Lt(a === c, () => `The new shape (${u}) has ${c} elements and the old shape (${s.shape}) has ${a} elements. The new shape and old shape must have the same number of elements.`);
   const h = i.texData.get(s.dataId);
-  return h.isPacked && !Dt(s.shape, u) && !(h.texture !== null && Dt(h.shape, u)) ? no(s, u, i) : (i.incRef(s.dataId), { dataId: s.dataId, shape: u, dtype: s.dtype });
+  return h.isPacked && !Vt(s.shape, u) && !(h.texture !== null && Vt(h.shape, u)) ? to(s, u, i) : (i.incRef(s.dataId), { dataId: s.dataId, shape: u, dtype: s.dtype });
 }
 /**
  * @license
@@ -3382,8 +3307,8 @@ function st(t) {
  * limitations under the License.
  * =============================================================================
  */
-function oo(t, e, n, o) {
-  const s = y(e), i = y(t.shape) / s, a = st({ inputs: { x: t }, attrs: { shape: [i, s] }, backend: o }), u = Kt(a, t.dtype, "max", o), c = st({ inputs: { x: u }, attrs: { shape: n }, backend: o });
+function eo(t, e, n, o) {
+  const s = O(e), i = O(t.shape) / s, a = st({ inputs: { x: t }, attrs: { shape: [i, s] }, backend: o }), u = Ut(a, t.dtype, "max", o), c = st({ inputs: { x: u }, attrs: { shape: n }, backend: o });
   return o.disposeIntermediateTensorInfo(a), o.disposeIntermediateTensorInfo(u), c;
 }
 /**
@@ -3402,14 +3327,14 @@ function oo(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-class so {
+class no {
   constructor(e, n) {
     this.variableNames = ["A"];
     const o = new Array(e.length);
     for (let i = 0; i < o.length; i++)
       o[i] = e[n[i]];
     this.outputShape = o, this.rank = o.length;
-    const s = Et(this.rank), r = ro(n);
+    const s = _t(this.rank), r = oo(n);
     this.userCode = `
     void main() {
       ${s} resRC = getOutputCoords();
@@ -3418,7 +3343,7 @@ class so {
     `;
   }
 }
-function ro(t) {
+function oo(t) {
   const e = t.length;
   if (e > 6)
     throw Error(`Transpose for rank ${e} is not yet supported`);
@@ -3427,28 +3352,6 @@ function ro(t) {
     o[t[s]] = n[s];
   return o.join();
 }
-/**
- * @license
- * Copyright 2018 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function Xt(t, e) {
-  return ["x", "y", "z", "w", "u", "v"].slice(0, e).map((n) => `${t}.${n}`);
-}
-function io(t, e) {
-  return e === 1 ? [t] : Xt(t, e);
-}
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -3465,7 +3368,7 @@ function io(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-class ao {
+class so {
   constructor(e, n) {
     this.variableNames = ["A"], this.packedInputs = !0, this.packedOutput = !0;
     const o = new Array(e.length);
@@ -3473,7 +3376,7 @@ class ao {
       o[h] = e[n[h]];
     if (this.outputShape = o, this.rank = o.length, this.rank > 6)
       throw Error(`Packed transpose for rank ${this.rank} is not yet supported.`);
-    const s = Et(this.rank), r = Xt("rc", this.rank), i = new Array(this.rank);
+    const s = _t(this.rank), r = re("rc", this.rank), i = new Array(this.rank);
     for (let h = 0; h < n.length; h++)
       i[n[h]] = r[h];
     const a = `vec2(${i.slice(-2).join()})`, u = `++${r[this.rank - 1]} < ${o[this.rank - 1]}`, c = `getChannel(getA(${i.join()}), ${a})`;
@@ -3513,8 +3416,8 @@ class ao {
  * limitations under the License.
  * =============================================================================
  */
-function Yt(t, e, n) {
-  const o = St().getBool("WEBGL_PACK_ARRAY_OPERATIONS") ? new ao(t.shape, e) : new so(t.shape, e);
+function Gt(t, e, n) {
+  const o = te().getBool("WEBGL_PACK_ARRAY_OPERATIONS") ? new so(t.shape, e) : new no(t.shape, e);
   return n.runWebGLProgram(o, [t], t.dtype);
 }
 /**
@@ -3533,36 +3436,36 @@ function Yt(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-function uo(t) {
-  const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { reductionIndices: r, keepDims: i } = o, a = s.shape.length, u = ht(r, s.shape);
+function ro(t) {
+  const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { reductionIndices: r, keepDims: i } = o, a = s.shape.length, u = lt(r, s.shape);
   let c = u;
-  const h = Wt(c, a), f = h != null, w = n.shouldExecuteOnCPU([s]);
+  const h = At(c, a), f = h != null, w = n.shouldExecuteOnCPU([s]);
   let p = s;
   if (f) {
     if (w) {
       const $ = n.texData.get(p.dataId).values, E = new Array(a);
-      for (let A = 0; A < E.length; A++)
-        E[A] = s.shape[h[A]];
-      const F = jn($, s.shape, s.dtype, h, E);
+      for (let M = 0; M < E.length; M++)
+        E[M] = s.shape[h[M]];
+      const V = Gn($, s.shape, s.dtype, h, E);
       p = n.makeTensorInfo(E, s.dtype);
-      const M = n.texData.get(p.dataId);
-      M.values = F;
+      const z = n.texData.get(p.dataId);
+      z.values = V;
     } else
-      p = Yt(s, h, n);
-    c = kt(c.length, a);
+      p = Gt(s, h, n);
+    c = Nt(c.length, a);
   }
-  Ut("max", c, a);
-  const [m, b] = bt(p.shape, c);
+  Dt("max", c, a);
+  const [m, b] = wt(p.shape, c);
   let d = m;
-  i && (d = vt(m, u));
+  i && (d = It(m, u));
   let g;
   if (w) {
-    const $ = n.texData.get(p.dataId).values, E = Gn($, y(b), d, s.dtype);
+    const $ = n.texData.get(p.dataId).values, E = Un($, O(b), d, s.dtype);
     g = n.makeTensorInfo(d, s.dtype);
-    const F = n.texData.get(g.dataId);
-    F.values = E;
+    const V = n.texData.get(g.dataId);
+    V.values = E;
   } else
-    g = oo(p, b, d, n);
+    g = eo(p, b, d, n);
   return f && n.disposeIntermediateTensorInfo(p), g;
 }
 /**
@@ -3581,16 +3484,16 @@ function uo(t) {
  * limitations under the License.
  * =============================================================================
  */
-function lo(t, e, n, o) {
-  const s = e, r = t.shape.length, i = ht(s, t.shape);
+function io(t, e, n, o) {
+  const s = e, r = t.shape.length, i = lt(s, t.shape);
   let a = i;
-  const u = Wt(a, r), c = u != null;
+  const u = At(a, r), c = u != null;
   let h = t;
-  c && (h = Yt(t, u, o), a = kt(a.length, r)), Ut("sum", a, r);
-  const [f, w] = bt(h.shape, a);
+  c && (h = Gt(t, u, o), a = Nt(a.length, r)), Dt("sum", a, r);
+  const [f, w] = wt(h.shape, a);
   let p = f;
-  n && (p = vt(f, i));
-  const m = y(w), d = y(t.shape) / m, g = st({ inputs: { x: h }, attrs: { shape: [d, m] }, backend: o }), I = ie(t.dtype), $ = Kt(g, I, "sum", o), E = st({ inputs: { x: $ }, attrs: { shape: p }, backend: o });
+  n && (p = It(f, i));
+  const m = O(w), d = O(t.shape) / m, g = st({ inputs: { x: h }, attrs: { shape: [d, m] }, backend: o }), x = ee(t.dtype), $ = Ut(g, x, "sum", o), E = st({ inputs: { x: $ }, attrs: { shape: p }, backend: o });
   return o.disposeIntermediateTensorInfo(g), o.disposeIntermediateTensorInfo($), c && o.disposeIntermediateTensorInfo(h), E;
 }
 /**
@@ -3609,158 +3512,9 @@ function lo(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-function co(t) {
+function ao(t) {
   const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { axis: r, keepDims: i } = o;
-  return lo(s, r, i, n);
-}
-/**
- * @license
- * Copyright 2017 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-class Pt {
-  constructor(e, n, o) {
-    this.variableNames = ["A", "B"], this.outputShape = It(n, o), this.enableShapeUniforms = $t(this.outputShape.length), this.userCode = `
-      float binaryOperation(float a, float b) {
-        ${e}
-      }
-
-      void main() {
-        float a = getAAtOutCoords();
-        float b = getBAtOutCoords();
-        setOutput(binaryOperation(a, b));
-      }
-    `;
-  }
-}
-/**
- * @license
- * Copyright 2018 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-class ho {
-  constructor(e, n, o, s = !1) {
-    this.variableNames = ["A", "B"], this.supportsBroadcasting = !0, this.packedInputs = !0, this.packedOutput = !0, this.outputShape = It(n, o);
-    const r = this.outputShape.length;
-    this.enableShapeUniforms = $t(r);
-    let i = "";
-    if (s)
-      if (r === 0 || y(this.outputShape) === 1)
-        i = `
-          result.y = 0.;
-          result.z = 0.;
-          result.w = 0.;
-        `;
-      else if (i = `
-          ${Et(r)} coords = getOutputCoords();
-        `, r === 1)
-        this.enableShapeUniforms ? i += `
-            result.y = (coords + 1) >= outShape ? 0. : result.y;
-            result.z = 0.;
-            result.w = 0.;
-          ` : i += `
-            result.y = (coords + 1) >= ${this.outputShape[0]} ? 0. : result.y;
-            result.z = 0.;
-            result.w = 0.;
-          `;
-      else {
-        const u = io("coords", r);
-        this.enableShapeUniforms ? i += `
-            bool nextRowOutOfBounds =
-              (${u[r - 2]} + 1) >= outShape[${r} - 2];
-            bool nextColOutOfBounds =
-              (${u[r - 1]} + 1) >= outShape[${r} - 1];
-            result.y = nextColOutOfBounds ? 0. : result.y;
-            result.z = nextRowOutOfBounds ? 0. : result.z;
-            result.w = nextColOutOfBounds || nextRowOutOfBounds ? 0. : result.w;
-          ` : i += `
-            bool nextRowOutOfBounds =
-              (${u[r - 2]} + 1) >= ${this.outputShape[r - 2]};
-            bool nextColOutOfBounds =
-              (${u[r - 1]} + 1) >= ${this.outputShape[r - 1]};
-            result.y = nextColOutOfBounds ? 0. : result.y;
-            result.z = nextRowOutOfBounds ? 0. : result.z;
-            result.w = nextColOutOfBounds || nextRowOutOfBounds ? 0. : result.w;
-          `;
-      }
-    this.userCode = `
-      vec4 binaryOperation(vec4 a, vec4 b) {
-        ${e}
-      }
-
-      void main() {
-        vec4 a = getAAtOutCoords();
-        vec4 b = getBAtOutCoords();
-
-        vec4 result = binaryOperation(a, b);
-        ${i}
-
-        setOutput(result);
-      }
-    `;
-  }
-}
-/**
- * @license
- * Copyright 2020 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function Ct(t) {
-  const { inputs: e, backend: n } = t, { x: o } = e;
-  return n.incRef(o.dataId), { dataId: o.dataId, shape: o.shape, dtype: o.dtype };
-}
-/**
- * @license
- * Copyright 2020 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function fo(t) {
-  const { inputs: e, backend: n } = t, { real: o, imag: s } = e, r = n.makeTensorInfo(o.shape, "complex64"), i = n.texData.get(r.dataId), a = Ct({ inputs: { x: o }, backend: n }), u = Ct({ inputs: { x: s }, backend: n });
-  return i.complexTensorInfos = { real: a, imag: u }, r;
+  return io(s, r, i, n);
 }
 /**
  * @license
@@ -3778,64 +3532,11 @@ function fo(t) {
  * limitations under the License.
  * =============================================================================
  */
-function go({ opSnippet: t, packedOpSnippet: e, checkOutOfBounds: n = !1, supportsComplex: o = !1, cpuKernelImpl: s, dtype: r }) {
-  return ({ inputs: i, backend: a }) => {
-    const { a: u, b: c } = i, h = a;
-    if (o && u.dtype === "complex64") {
-      const m = h.texData.get(u.dataId), b = h.texData.get(c.dataId), [d, g] = [
-        [m.complexTensorInfos.real, b.complexTensorInfos.real],
-        [m.complexTensorInfos.imag, b.complexTensorInfos.imag]
-      ].map(($) => {
-        const [E, F] = $, M = {
-          dataId: E.dataId,
-          dtype: E.dtype,
-          shape: u.shape
-        }, A = {
-          dataId: F.dataId,
-          dtype: F.dtype,
-          shape: c.shape
-        }, L = new Pt(t, u.shape, c.shape);
-        return h.runWebGLProgram(L, [M, A], pt(E.dtype, F.dtype));
-      }), I = fo({ inputs: { real: d, imag: g }, backend: h });
-      return h.disposeIntermediateTensorInfo(d), h.disposeIntermediateTensorInfo(g), I;
-    }
-    const f = r || pt(u.dtype, c.dtype);
-    if ((u.dtype === "string" || c.dtype === "string" || h.shouldExecuteOnCPU([u, c])) && s != null) {
-      const m = h.texData.get(u.dataId).values, b = h.texData.get(c.dataId).values, d = u.dtype === "string" ? (
-        // tslint:disable-next-line: no-any
-        lt(m)
-      ) : m, g = u.dtype === "string" ? (
-        // tslint:disable-next-line: no-any
-        lt(b)
-      ) : b, [I, $] = s(u.shape, c.shape, d, g, f), E = h.makeTensorInfo($, f), F = h.texData.get(E.dataId);
-      return F.values = I, E;
-    }
-    const w = St().getBool("WEBGL_PACK_BINARY_OPERATIONS") && e != null;
-    let p;
-    return w ? p = new ho(e, u.shape, c.shape, n) : p = new Pt(t, u.shape, c.shape), h.runWebGLProgram(p, [u, c], f);
-  };
-}
-/**
- * @license
- * Copyright 2020 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-const po = `
+const uo = `
 if (a == b) {
   return 1.0;
 };
-return a / b;`, mo = `
+return a / b;`, lo = `
   // vec4 one = vec4(equal(a, b));
   // return one + (vec4(1.0) - one) * a / b;
   vec4 result = a / b;
@@ -3853,8 +3554,8 @@ return a / b;`, mo = `
   }
 
   return result;
-`, wo = go({ opSnippet: po, packedOpSnippet: mo, checkOutOfBounds: !0 });
-class Io {
+`, co = ie({ opSnippet: uo, packedOpSnippet: lo, checkOutOfBounds: !0 });
+class ho {
   variableNames = ["logits", "maxLogits"];
   outputShape;
   userCode;
@@ -3873,7 +3574,7 @@ class Io {
         `;
   }
 }
-class xo {
+class fo {
   variableNames = ["exp", "sum"];
   outputShape;
   userCode;
@@ -3900,31 +3601,31 @@ class xo {
         `;
   }
 }
-function So(t) {
+function go(t) {
   const { inputs: e, attrs: n } = t, { logits: o } = e, { dim: s, dropoutRate: r, seed: i } = n, a = t.backend;
   if (!o)
     throw new Error("Error in softmax: input logits is null");
-  const u = ht([s], o.shape), c = uo({
+  const u = lt([s], o.shape), c = ro({
     inputs: { x: o },
     backend: a,
     attrs: { reductionIndices: u, keepDims: !1 }
-  }), h = vt(c.shape, u), f = new Io(o.shape), w = a.runWebGLProgram(f, [o, c], "float32"), p = co({ inputs: { x: w }, backend: a, attrs: { axis: u, keepDims: !1 } }), m = st({ inputs: { x: p }, backend: a, attrs: { shape: h } });
+  }), h = It(c.shape, u), f = new ho(o.shape), w = a.runWebGLProgram(f, [o, c], "float32"), p = ao({ inputs: { x: w }, backend: a, attrs: { axis: u, keepDims: !1 } }), m = st({ inputs: { x: p }, backend: a, attrs: { shape: h } });
   if (r !== void 0 && r > 0) {
-    const d = new xo(o.shape), g = a.runWebGLProgram(d, [w, m], "float32", [
+    const d = new fo(o.shape), g = a.runWebGLProgram(d, [w, m], "float32", [
       [r],
       [i ?? Math.random() * 1e4]
     ]);
     return a.disposeIntermediateTensorInfo(c), a.disposeIntermediateTensorInfo(w), a.disposeIntermediateTensorInfo(p), a.disposeIntermediateTensorInfo(m), g;
   }
-  const b = wo({ inputs: { a: w, b: m }, backend: a });
+  const b = co({ inputs: { a: w, b: m }, backend: a });
   return a.disposeIntermediateTensorInfo(c), a.disposeIntermediateTensorInfo(w), a.disposeIntermediateTensorInfo(p), a.disposeIntermediateTensorInfo(m), b;
 }
-const bo = {
+const po = {
   kernelName: "FusedSoftmax",
   backendName: "webgl",
-  kernelFunc: So
+  kernelFunc: go
 };
-ae(bo);
+ne(po);
 export {
-  So as softmax
+  go as softmax
 };