@genai-fi/nanogpt 0.4.3 → 0.4.4

package/dist/ops/webgl/fusedSoftmax.js

@@ -1,10 +1,11 @@
-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) {
+import { a$ as qt, n as y, O as Ct, ac as J, b0 as nt, b1 as It, b2 as pt, b3 as ft, b4 as kt, Z as ot, ag as B, b5 as q, b6 as Ut, Q as Gt, j as jt, t as Zt, b7 as dt, ao as ct, b8 as tt, $ as ut, b9 as Bt, L as Ht, ba as Kt, r as Xt } from "../../index--6vO-cOz.js";
+import { f as $t, a as Qt, g as yt, b as Yt, c as Jt } from "../../kernel_funcs_utils-C6YBCuOt.js";
+import { c as mt, g as Tt, a as Vt, b as Mt, e as wt } from "../../axis_util-QP0LdI1v.js";
+import { b as te, i as ee, c as ne } from "../../slice_util-BdhYwFY_.js";
+import { r as oe } from "../../reshape-z51Eu-re.js";
+import { g as se } from "../../_commonjsHelpers-ByX85dGu.js";
+import { r as st } from "../../Reshape-CiAY8ltP.js";
+function re(t, e) {
   for (var n = 0; n < e.length; n++) {
     const o = e[n];
     if (typeof o != "string" && !Array.isArray(o)) {
@@ -20,10 +21,10 @@ function fe(t, e) {
   }
   return Object.freeze(Object.defineProperty(t, Symbol.toStringTag, { value: "Module" }));
 }
-var ft, St;
-function de() {
-  if (St) return ft;
-  St = 1, ft = e;
+var ht, xt;
+function ie() {
+  if (xt) return ht;
+  xt = 1, ht = e;
   var t = null;
   try {
     t = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
@@ -316,8 +317,8 @@ function de() {
     ])), {}).exports;
   } catch {
   }
-  function e(I, l, v) {
-    this.low = I | 0, this.high = l | 0, this.unsigned = !!v;
+  function e(I, l, E) {
+    this.low = I | 0, this.high = l | 0, this.unsigned = !!E;
   }
   e.prototype.__isLong__, Object.defineProperty(e.prototype, "__isLong__", { value: !0 });
   function n(I) {
@@ -326,74 +327,74 @@ function de() {
   e.isLong = n;
   var o = {}, s = {};
   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));
+    var E, F, T;
+    return l ? (I >>>= 0, (T = 0 <= I && I < 256) && (F = s[I], F) ? F : (E = i(I, (I | 0) < 0 ? -1 : 0, !0), T && (s[I] = E), E)) : (I |= 0, (T = -128 <= I && I < 128) && (F = o[I], F) ? F : (E = i(I, I < 0 ? -1 : 0, !1), T && (o[I] = E), E));
   }
   e.fromInt = r;
-  function i(I, l) {
+  function a(I, l) {
     if (isNaN(I))
       return l ? x : g;
     if (l) {
       if (I < 0)
         return x;
       if (I >= m)
-        return M;
+        return L;
     } else {
       if (I <= -b)
         return _;
       if (I + 1 >= b)
-        return z;
+        return D;
     }
-    return I < 0 ? i(-I, l).neg() : a(I % p | 0, I / p | 0, l);
+    return I < 0 ? a(-I, l).neg() : i(I % p | 0, I / p | 0, l);
   }
-  e.fromNumber = i;
-  function a(I, l, v) {
-    return new e(I, l, v);
+  e.fromNumber = a;
+  function i(I, l, E) {
+    return new e(I, l, E);
   }
-  e.fromBits = a;
+  e.fromBits = i;
   var u = Math.pow;
-  function c(I, l, v) {
+  function c(I, l, E) {
     if (I.length === 0)
       throw Error("empty string");
     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)
+    if (typeof l == "number" ? (E = l, l = !1) : l = !!l, E = E || 10, E < 2 || 36 < E)
       throw RangeError("radix");
-    var R;
-    if ((R = I.indexOf("-")) > 0)
+    var F;
+    if ((F = I.indexOf("-")) > 0)
       throw Error("interior hyphen");
-    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));
+    if (F === 0)
+      return c(I.substring(1), l, E).neg();
+    for (var T = a(u(E, 8)), $ = g, N = 0; N < I.length; N += 8) {
+      var k = Math.min(8, I.length - N), G = parseInt(I.substring(N, N + k), E);
+      if (k < 8) {
+        var z = a(u(E, k));
+        $ = $.mul(z).add(a(G));
       } else
-        y = y.mul(T), y = y.add(i(G));
+        $ = $.mul(T), $ = $.add(a(G));
     }
-    return y.unsigned = l, y;
+    return $.unsigned = l, $;
   }
   e.fromString = c;
   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);
+    return typeof I == "number" ? a(I, l) : typeof I == "string" ? c(I, l) : i(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 x = r(0, !0);
   e.UZERO = x;
-  var $ = r(1);
-  e.ONE = $;
-  var E = r(1, !0);
-  e.UONE = E;
+  var O = r(1);
+  e.ONE = O;
+  var v = r(1, !0);
+  e.UONE = v;
   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);
+  var D = i(-1, 2147483647, !1);
+  e.MAX_VALUE = D;
+  var L = i(-1, -1, !0);
+  e.MAX_UNSIGNED_VALUE = L;
+  var _ = i(0, -2147483648, !1);
   e.MIN_VALUE = _;
   var S = e.prototype;
   return S.toInt = function() {
@@ -407,17 +408,17 @@ function de() {
       return "0";
     if (this.isNegative())
       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);
+        var E = a(l), F = this.div(E), T = F.mul(E).sub(this);
+        return F.toString(l) + T.toInt().toString(l);
       } else
         return "-" + this.neg().toString(l);
-    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;
+    for (var $ = a(u(l, 6), this.unsigned), N = this, k = ""; ; ) {
+      var G = N.div($), z = N.sub(G.mul($)).toInt() >>> 0, M = z.toString(l);
+      if (N = G, N.isZero())
+        return M + k;
+      for (; M.length < 6; )
+        M = "0" + M;
+      k = "" + M + k;
     }
   }, S.getHighBits = function() {
     return this.high;
@@ -430,9 +431,9 @@ function de() {
   }, S.getNumBitsAbs = function() {
     if (this.isNegative())
       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--)
+    for (var l = this.high != 0 ? this.high : this.low, E = 31; E > 0 && (l & 1 << E) == 0; E--)
       ;
-    return this.high != 0 ? v + 33 : v + 1;
+    return this.high != 0 ? E + 33 : E + 1;
   }, S.isZero = function() {
     return this.high === 0 && this.low === 0;
   }, S.eqz = S.isZero, S.isNegative = function() {
@@ -473,27 +474,27 @@ function de() {
   }, 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(), 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;
+    var E = this.isNegative(), F = l.isNegative();
+    return E && !F ? -1 : !E && F ? 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(_) ? _ : this.not().add($);
+    return !this.unsigned && this.eq(_) ? _ : this.not().add(O);
   }, S.neg = S.negate, S.add = function(l) {
     n(l) || (l = h(l));
-    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);
+    var E = this.high >>> 16, F = this.high & 65535, T = this.low >>> 16, $ = this.low & 65535, N = l.high >>> 16, k = l.high & 65535, G = l.low >>> 16, z = l.low & 65535, M = 0, j = 0, P = 0, U = 0;
+    return U += $ + z, P += U >>> 16, U &= 65535, P += T + G, j += P >>> 16, P &= 65535, j += F + k, M += j >>> 16, j &= 65535, M += E + N, M &= 65535, i(P << 16 | U, M << 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) {
     if (this.isZero())
       return g;
     if (n(l) || (l = h(l)), t) {
-      var v = t.mul(
+      var E = t.mul(
         this.low,
         this.high,
         l.low,
         l.high
       );
-      return a(v, t.get_high(), this.unsigned);
+      return i(E, t.get_high(), this.unsigned);
     }
     if (l.isZero())
       return g;
@@ -506,137 +507,137 @@ function de() {
     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 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);
+      return a(this.toNumber() * l.toNumber(), this.unsigned);
+    var F = this.high >>> 16, T = this.high & 65535, $ = this.low >>> 16, N = this.low & 65535, k = l.high >>> 16, G = l.high & 65535, z = l.low >>> 16, M = l.low & 65535, j = 0, P = 0, U = 0, rt = 0;
+    return rt += N * M, U += rt >>> 16, rt &= 65535, U += $ * M, P += U >>> 16, U &= 65535, U += N * z, P += U >>> 16, U &= 65535, P += T * M, j += P >>> 16, P &= 65535, P += $ * z, j += P >>> 16, P &= 65535, P += N * G, j += P >>> 16, P &= 65535, j += F * M + T * z + $ * G + N * k, j &= 65535, i(U << 16 | rt, j << 16 | P, this.unsigned);
   }, S.mul = S.multiply, S.divide = function(l) {
     if (n(l) || (l = h(l)), l.isZero())
       throw Error("division by zero");
     if (t) {
       if (!this.unsigned && this.high === -2147483648 && l.low === -1 && l.high === -1)
         return this;
-      var v = (this.unsigned ? t.div_u : t.div_s)(
+      var E = (this.unsigned ? t.div_u : t.div_s)(
         this.low,
         this.high,
         l.low,
         l.high
       );
-      return a(v, t.get_high(), this.unsigned);
+      return i(E, t.get_high(), this.unsigned);
     }
     if (this.isZero())
       return this.unsigned ? x : g;
-    var R, T, y;
+    var F, T, $;
     if (this.unsigned) {
       if (l.unsigned || (l = l.toUnsigned()), l.gt(this))
         return x;
       if (l.gt(this.shru(1)))
-        return E;
-      y = x;
+        return v;
+      $ = x;
     } else {
       if (this.eq(_)) {
-        if (l.eq($) || l.eq(V))
+        if (l.eq(O) || l.eq(V))
           return _;
         if (l.eq(_))
-          return $;
-        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);
+          return O;
+        var N = this.shr(1);
+        return F = N.div(l).shl(1), F.eq(g) ? l.isNegative() ? O : V : (T = this.sub(l.mul(F)), $ = F.add(T.div(l)), $);
       } 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();
-      y = g;
+      $ = g;
     }
     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);
+      F = Math.max(1, Math.floor(T.toNumber() / l.toNumber()));
+      for (var k = Math.ceil(Math.log(F) / Math.LN2), G = k <= 48 ? 1 : u(2, k - 48), z = a(F), M = z.mul(l); M.isNegative() || M.gt(T); )
+        F -= G, z = a(F, this.unsigned), M = z.mul(l);
+      z.isZero() && (z = O), $ = $.add(z), T = T.sub(M);
     }
-    return y;
+    return $;
   }, 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)(
+      var E = (this.unsigned ? t.rem_u : t.rem_s)(
         this.low,
         this.high,
         l.low,
         l.high
       );
-      return a(v, t.get_high(), this.unsigned);
+      return i(E, t.get_high(), this.unsigned);
     }
     return this.sub(this.div(l).mul(l));
   }, S.mod = S.modulo, S.rem = S.modulo, S.not = function() {
-    return a(~this.low, ~this.high, this.unsigned);
+    return i(~this.low, ~this.high, this.unsigned);
   }, S.and = function(l) {
-    return n(l) || (l = h(l)), a(this.low & l.low, this.high & l.high, this.unsigned);
+    return n(l) || (l = h(l)), i(this.low & l.low, this.high & l.high, this.unsigned);
   }, S.or = function(l) {
-    return n(l) || (l = h(l)), a(this.low | l.low, this.high | l.high, this.unsigned);
+    return n(l) || (l = h(l)), i(this.low | l.low, this.high | l.high, this.unsigned);
   }, S.xor = function(l) {
-    return n(l) || (l = h(l)), a(this.low ^ l.low, this.high ^ l.high, this.unsigned);
+    return n(l) || (l = h(l)), i(this.low ^ l.low, this.high ^ l.high, this.unsigned);
   }, S.shiftLeft = function(l) {
-    return n(l) && (l = l.toInt()), (l &= 63) === 0 ? this : l < 32 ? a(this.low << l, this.high << l | this.low >>> 32 - l, this.unsigned) : a(0, this.low << l - 32, this.unsigned);
+    return n(l) && (l = l.toInt()), (l &= 63) === 0 ? this : l < 32 ? i(this.low << l, this.high << l | this.low >>> 32 - l, this.unsigned) : i(0, this.low << l - 32, this.unsigned);
   }, S.shl = S.shiftLeft, S.shiftRight = function(l) {
-    return n(l) && (l = l.toInt()), (l &= 63) === 0 ? this : l < 32 ? a(this.low >>> l | this.high << 32 - l, this.high >> l, this.unsigned) : a(this.high >> l - 32, this.high >= 0 ? 0 : -1, this.unsigned);
+    return n(l) && (l = l.toInt()), (l &= 63) === 0 ? this : l < 32 ? i(this.low >>> l | this.high << 32 - l, this.high >> l, this.unsigned) : i(this.high >> l - 32, this.high >= 0 ? 0 : -1, this.unsigned);
   }, S.shr = S.shiftRight, S.shiftRightUnsigned = function(l) {
     if (n(l) && (l = l.toInt()), l &= 63, l === 0)
       return this;
-    var v = this.high;
+    var E = this.high;
     if (l < 32) {
-      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);
+      var F = this.low;
+      return i(F >>> l | E << 32 - l, E >>> l, this.unsigned);
+    } else return l === 32 ? i(E, 0, this.unsigned) : i(E >>> 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;
+    return this.unsigned ? i(this.low, this.high, !1) : this;
   }, S.toUnsigned = function() {
-    return this.unsigned ? this : a(this.low, this.high, !0);
+    return this.unsigned ? this : i(this.low, this.high, !0);
   }, S.toBytes = function(l) {
     return l ? this.toBytesLE() : this.toBytesBE();
   }, S.toBytesLE = function() {
-    var l = this.high, v = this.low;
+    var l = this.high, E = this.low;
     return [
-      v & 255,
-      v >>> 8 & 255,
-      v >>> 16 & 255,
-      v >>> 24,
+      E & 255,
+      E >>> 8 & 255,
+      E >>> 16 & 255,
+      E >>> 24,
       l & 255,
       l >>> 8 & 255,
       l >>> 16 & 255,
       l >>> 24
     ];
   }, S.toBytesBE = function() {
-    var l = this.high, v = this.low;
+    var l = this.high, E = this.low;
     return [
       l >>> 24,
       l >>> 16 & 255,
       l >>> 8 & 255,
       l & 255,
-      v >>> 24,
-      v >>> 16 & 255,
-      v >>> 8 & 255,
-      v & 255
+      E >>> 24,
+      E >>> 16 & 255,
+      E >>> 8 & 255,
+      E & 255
     ];
-  }, e.fromBytes = function(l, v, R) {
-    return R ? e.fromBytesLE(l, v) : e.fromBytesBE(l, v);
-  }, e.fromBytesLE = function(l, v) {
+  }, e.fromBytes = function(l, E, F) {
+    return F ? e.fromBytesLE(l, E) : e.fromBytesBE(l, E);
+  }, e.fromBytesLE = function(l, E) {
     return new e(
       l[0] | l[1] << 8 | l[2] << 16 | l[3] << 24,
       l[4] | l[5] << 8 | l[6] << 16 | l[7] << 24,
-      v
+      E
     );
-  }, e.fromBytesBE = function(l, v) {
+  }, e.fromBytesBE = function(l, E) {
     return new e(
       l[4] << 24 | l[5] << 16 | l[6] << 8 | l[7],
       l[0] << 24 | l[1] << 16 | l[2] << 8 | l[3],
-      v
+      E
     );
-  }, ft;
+  }, ht;
 }
-var zt = de();
-const Pt = /* @__PURE__ */ he(zt), ge = /* @__PURE__ */ fe({
+var Lt = ie();
+const _t = /* @__PURE__ */ se(Lt), ae = /* @__PURE__ */ re({
   __proto__: null,
-  default: Pt
-}, [zt]);
+  default: _t
+}, [Lt]);
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -653,82 +654,82 @@ const Pt = /* @__PURE__ */ he(zt), ge = /* @__PURE__ */ fe({
  * limitations under the License.
  * =============================================================================
  */
-const Q = (
+const Y = (
   // tslint:disable-next-line
-  Pt || ge
+  _t || ae
 );
-function ct(t) {
-  return Q.fromString(t, !0, 16);
+function lt(t) {
+  return Y.fromString(t, !0, 16);
 }
-const Ct = ct("c3a5c85c97cb3127"), J = ct("b492b66fbe98f273"), C = ct("9ae16a3b2f90404f");
-function pt(t) {
+const Nt = lt("c3a5c85c97cb3127"), Q = lt("b492b66fbe98f273"), W = lt("9ae16a3b2f90404f");
+function gt(t) {
   return t.xor(t.shru(47));
 }
-function Wt(t, e, n) {
+function At(t, e, n) {
   const o = t.slice(e, e + n);
-  return Q.fromBytes(Array.from(o), !0, !0);
+  return Y.fromBytes(Array.from(o), !0, !0);
 }
-function F(t, e) {
-  return Wt(t, e, 8);
+function R(t, e) {
+  return At(t, e, 8);
 }
-function vt(t, e) {
-  return Wt(t, e, 4);
+function St(t, e) {
+  return At(t, e, 4);
 }
-function N(t, e) {
+function A(t, e) {
   return e === 0 ? t : t.shru(e).or(t.shl(64 - e));
 }
-function Y(t, e, n = ct("9ddfea08eb382d69")) {
+function X(t, e, n = lt("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 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(N(s, 44)), [s.add(o), r.add(i)];
+function ue(t, e, n, o, s, r) {
+  s = s.add(t), r = A(r.add(s).add(o), 21);
+  const a = s;
+  return s = s.add(e), s = s.add(n), r = r.add(A(s, 44)), [s.add(o), r.add(a)];
 }
 function it(t, e, n, o) {
-  return pe(F(t, e), F(t, e + 8), F(t, e + 16), F(t, e + 24), n, o);
+  return ue(R(t, e), R(t, e + 8), R(t, e + 16), R(t, e + 24), n, o);
 }
-function me(t, e = t.length) {
+function le(t, e = t.length) {
   if (e >= 8) {
-    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);
+    const n = W.add(e * 2), o = R(t, 0).add(W), s = R(t, e - 8), r = A(s, 37).mul(n).add(o), a = A(o, 25).add(s).mul(n);
+    return X(r, a, n);
   }
   if (e >= 4) {
-    const n = C.add(e * 2), o = vt(t, 0);
-    return Y(o.shl(3).add(e), vt(t, e - 4), n);
+    const n = W.add(e * 2), o = St(t, 0);
+    return X(o.shl(3).add(e), St(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 pt(C.mul(r).xor(Ct.mul(i))).mul(C);
+    const n = t[0], o = t[e >> 1], s = t[e - 1], r = n + (o << 8), a = e + (s << 2);
+    return gt(W.mul(r).xor(Nt.mul(a))).mul(W);
   }
-  return C;
+  return W;
 }
-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 ce(t, e = t.length) {
+  const n = W.add(e * 2), o = R(t, 0).mul(Q), s = R(t, 8), r = R(t, e - 8).mul(n), a = R(t, e - 16).mul(W);
+  return X(A(o.add(s), 43).add(A(r, 30)).add(a), o.add(A(s.add(W), 18)).add(r), n);
 }
-function Ie(t, e = t.length) {
-  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 he(t, e = t.length) {
+  const n = W.add(e * 2), o = R(t, 0).mul(W), s = R(t, 8), r = R(t, e - 8).mul(n), a = R(t, e - 16).mul(W), i = A(o.add(s), 43).add(A(r, 30)).add(a), u = X(i, o.add(A(s.add(W), 18)).add(r), n), c = R(t, 16).mul(n), h = R(t, 24), f = i.add(R(t, e - 32)).mul(n), w = u.add(R(t, e - 24)).mul(n);
+  return X(A(c.add(h), 43).add(A(f, 30)).add(w), c.add(A(h.add(o), 18)).add(f), n);
 }
-function xe(t, e = t.length) {
-  const n = Q.fromNumber(81, !0);
+function fe(t, e = t.length) {
+  const n = Y.fromNumber(81, !0);
   if (e <= 32)
-    return e <= 16 ? me(t, e) : we(t, e);
+    return e <= 16 ? le(t, e) : ce(t, e);
   if (e <= 64)
-    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));
+    return he(t, e);
+  let o = n, s = n.mul(Q).add(113), r = gt(s.mul(W).add(113)).mul(W), a = [Y.UZERO, Y.UZERO], i = [Y.UZERO, Y.UZERO];
+  o = o.mul(W).add(R(t, 0));
   let u = 0;
   const c = (e - 1 >> 6) * 64, h = c + (e - 1 & 63) - 63;
   do
-    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;
+    o = A(o.add(s).add(a[0]).add(R(t, u + 8)), 37).mul(Q), s = A(s.add(a[1]).add(R(t, u + 48)), 42).mul(Q), o = o.xor(i[1]), s = s.add(a[0]).add(R(t, u + 40)), r = A(r.add(i[0]), 33).mul(Q), a = it(t, u, a[1].mul(Q), o.add(i[0])), i = it(t, u + 32, r.add(i[1]), s.add(R(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 = 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);
+  const f = Q.add(r.and(255).shl(1));
+  return u = h, i[0] = i[0].add(e - 1 & 63), a[0] = a[0].add(i[0]), i[0] = i[0].add(a[0]), o = A(o.add(s).add(a[0]).add(R(t, u + 8)), 37).mul(f), s = A(s.add(a[1]).add(R(t, u + 48)), 42).mul(f), o = o.xor(i[1].mul(9)), s = s.add(a[0].mul(9).add(R(t, u + 40))), r = A(r.add(i[0]), 33).mul(f), a = it(t, u, a[1].mul(f), o.add(i[0])), i = it(t, u + 32, r.add(i[1]), s.add(R(t, u + 16))), [r, o] = [o, r], X(X(a[0], i[0], f).add(gt(s).mul(Nt)).add(r), X(a[1], i[1], f).add(o), f);
 }
 /**
  * @license
@@ -750,7 +751,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 Se(t, e, n) {
+function de(t, e, n) {
   let o = new Array();
   if (n == null && e == null)
     return o;
@@ -764,17 +765,17 @@ function Se(t, e, n) {
   if (t + n.length !== o.length)
     throw new Error(`rt input.shape and shape=${e} are incompatible: rt input.rank = ${t + n.length}, but shape.rank = ${o.length}`);
   for (let s = 1; s < n.length; ++s) {
-    const r = n[s], i = o[o.length - n.length + s], a = o[i];
+    const r = n[s], a = o[o.length - n.length + s], i = o[a];
     if (r >= 0)
-      if (a >= 0) {
-        if (a !== r)
-          throw new Error(`rt input.shape and shape=${e} are incompatible: rt input.shape[${s + t}] = ${r} but shape[${s + t}] = ${a}`);
+      if (i >= 0) {
+        if (i !== r)
+          throw new Error(`rt input.shape and shape=${e} are incompatible: rt input.shape[${s + t}] = ${r} but shape[${s + t}] = ${i}`);
       } else
-        o[i] = r;
+        o[a] = r;
   }
   return o;
 }
-function ve(t) {
+function ge(t) {
   const e = {
     FIRST_DIM_SIZE: H.FIRST_DIM_SIZE,
     VALUE_ROWIDS: H.VALUE_ROWIDS,
@@ -790,19 +791,19 @@ function ve(t) {
       break;
   return n;
 }
-function be(t) {
+function pe(t) {
   return t.length === 0 ? 0 : t[0] === H.FIRST_DIM_SIZE ? t.length - 1 : t.length;
 }
-function Ee(t, e) {
+function me(t, e) {
   if (t == null || e == null)
     return;
   const n = t.length, o = e.length;
   if (n >= o)
     throw new Error(`defaultValue.shape=${t} and ragged tensor flatValues.shape=${e}, are incompatible: defaultValue.rank = ${n} must be less than ragged tensor input flatValues.rank = ${o})`);
   for (let s = 0; s < Math.min(n, o - 1); ++s) {
-    const r = t[s], i = e[s + 1];
-    if (r >= 0 && i >= 0 && r !== 1 && r !== i)
-      throw new Error(`defaultValue.shape=${t}, and ragged tensor input flatValues.shape=${e} are incompatible: defaultValue.shape[${s - t.length}] = ${r} but ragged tensor input.flatValues.shape[${s - t.length}] = ${i}`);
+    const r = t[s], a = e[s + 1];
+    if (r >= 0 && a >= 0 && r !== 1 && r !== a)
+      throw new Error(`defaultValue.shape=${t}, and ragged tensor input flatValues.shape=${e} are incompatible: defaultValue.shape[${s - t.length}] = ${r} but ragged tensor input.flatValues.shape[${s - t.length}] = ${a}`);
   }
 }
 /**
@@ -821,9 +822,9 @@ function Ee(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-const $e = 30;
-function Re(t) {
-  return t <= $e ? t : jt(t, Math.floor(Math.sqrt(t)));
+const we = 30;
+function Ie(t) {
+  return t <= we ? t : qt(t, Math.floor(Math.sqrt(t)));
 }
 /**
  * @license
@@ -841,14 +842,14 @@ function Re(t) {
  * limitations under the License.
  * =============================================================================
  */
-function Fe(t) {
+function xe(t) {
   return `Received SparseTensor with denseShape[0] = 0 but
   indices.shape[0] = ${t}`;
 }
-function Oe(t, e) {
+function Se(t, e) {
   return `indices(${t}, 0) is invalid: ${e} < 0`;
 }
-function ye(t, e, n) {
+function Ee(t, e, n) {
   return `indices(${t}, 0) is invalid: ${e} >= ${n}`;
 }
 /**
@@ -867,22 +868,22 @@ function ye(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-function Te(t, e) {
+function be(t, e) {
   return `only one output dimension may be -1, not both ${t} and ${e}`;
 }
-function Ve(t, e) {
+function ve(t, e) {
   return `size ${t} must be non-negative, not ${e}`;
 }
-function Le() {
+function Oe() {
   return "reshape cannot infer the missing input size for an empty tensor unless all specified input sizes are non-zero";
 }
-function Me(t, e) {
-  const n = O(t), o = O(e);
+function Fe(t, e) {
+  const n = y(t), o = y(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 _e(t, e) {
-  const n = O(t), o = O(e);
+function Re(t, e) {
+  const n = y(t), o = y(e);
   return `Input to reshape is a tensor with ${n} dense values, but the requested shape has ${o}. inputShape=${t} outputShape=${e}`;
 }
 /**
@@ -901,16 +902,16 @@ function _e(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function bt() {
+function Et() {
   return "segment ids must be >= 0";
 }
-function Ae() {
+function $e() {
   return "segment ids are not increasing";
 }
-function Ne(t, e) {
+function ye(t, e) {
   return `Segment id ${t} out of range [0, ${e}), possibly because segmentIds input is not sorted.`;
 }
-function De(t, e, n) {
+function Te(t, e, n) {
   return `Bad: indices[${t}] == ${e} out of range [0, ${n})`;
 }
 /**
@@ -929,7 +930,7 @@ function De(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-function ze(t) {
+function Ve(t) {
   const e = new Float32Array(t.length);
   for (let n = 0; n < t.length; ++n)
     e[n] = Math.abs(t[n]);
@@ -951,22 +952,22 @@ function ze(t) {
  * limitations under the License.
  * =============================================================================
  */
-function k(t) {
+function C(t) {
   return (e, n, o, s, r) => {
-    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);
+    const a = Ct(e, n), i = a.length, u = J(a), c = y(a), h = nt(r, c), f = e.length, w = n.length, p = J(e), m = J(n), b = It(e, a), d = It(n, a);
     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 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]);
+        const x = pt(g, i, u), O = x.slice(-f);
+        b.forEach((L) => O[L] = 0);
+        const v = ft(O, f, p), V = x.slice(-w);
+        d.forEach((L) => V[L] = 0);
+        const D = ft(V, w, m);
+        h[g] = t(o[v], s[D]);
       }
-    return [h, i];
+    return [h, a];
   };
 }
 /**
@@ -985,14 +986,14 @@ function k(t) {
  * limitations under the License.
  * =============================================================================
  */
-function Pe(t, e, n, o) {
+function Me(t, e, n, o) {
   if (o === "int32") {
     const s = Int32Array.from(t);
     return [e, "int32", s];
   }
   if (o === "bool") {
-    const s = Zt([0], n), [r, i] = k((a, u) => a !== u ? 1 : 0)(e, [], t, s, "bool");
-    return [i, "bool", r];
+    const s = kt([0], n), [r, a] = C((i, u) => i !== u ? 1 : 0)(e, [], t, s, "bool");
+    return [a, "bool", r];
   }
   throw new Error(`Error in Cast: failed to cast ${n} to ${o}`);
 }
@@ -1012,7 +1013,7 @@ function Pe(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const Ce = k((t, e) => t + e);
+const Le = C((t, e) => t + e);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1029,26 +1030,26 @@ const Ce = k((t, e) => t + e);
  * limitations under the License.
  * =============================================================================
  */
-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];
+function _e(t, e, n, o, s) {
+  const r = y(o), a = ot(s, n);
+  for (let i = 0; i < t.length; i++) {
+    const u = t[i];
     if (u < 0)
       throw new Error("Input x must be non-negative!");
-    u >= s || (r > 0 ? i[u] += e[a] : i[u] += 1);
+    u >= s || (r > 0 ? a[u] += e[i] : a[u] += 1);
   }
-  return i;
+  return a;
 }
-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++)
+function Ne(t, e, n, o = !1) {
+  const s = t.shape[0], r = t.shape[1], a = B([s, n], e.dtype);
+  for (let i = 0; i < s; i++)
     for (let u = 0; u < r; u++) {
-      const c = t.get(a, u);
+      const c = t.get(i, u);
       if (c < 0)
         throw new Error("Input x must be non-negative!");
-      c >= n || (o ? i.set(1, a, c) : e.size > 0 ? i.set(i.get(a, c) + e.get(a, u), a, c) : i.set(i.get(a, c) + 1, a, c));
+      c >= n || (o ? a.set(1, i, c) : e.size > 0 ? a.set(a.get(i, c) + e.get(i, u), i, c) : a.set(a.get(i, c) + 1, i, c));
     }
-  return i;
+  return a;
 }
 /**
  * @license
@@ -1066,7 +1067,7 @@ function ke(t, e, n, o = !1) {
  * limitations under the License.
  * =============================================================================
  */
-const qe = k((t, e) => t & e);
+const Ae = C((t, e) => t & e);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1083,9 +1084,9 @@ const qe = k((t, e) => t & e);
  * limitations under the License.
  * =============================================================================
  */
-function X(t) {
+function K(t) {
   return (e, n, o) => {
-    const s = W(n, e.length);
+    const s = q(n, e.length);
     for (let r = 0; r < e.length; ++r)
       s[r] = t(e[r], o);
     return s;
@@ -1107,7 +1108,7 @@ function X(t) {
  * limitations under the License.
  * =============================================================================
  */
-const Ue = X((t) => Math.ceil(t));
+const Pe = K((t) => Math.ceil(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1124,25 +1125,25 @@ const Ue = X((t) => Math.ceil(t));
  * limitations under the License.
  * =============================================================================
  */
-function Ge(t, e, n, o) {
-  const s = W(n, O(e));
+function De(t, e, n, o) {
+  const s = q(n, y(e));
   if (o && n !== "string") {
     let r = 0;
-    t.forEach((i) => {
-      const a = O(i.shape);
-      s.set(i.vals, r), r += a;
+    t.forEach((a) => {
+      const i = y(a.shape);
+      s.set(a.vals, r), r += i;
     });
   } else {
     let r = 0;
-    t.forEach((i) => {
-      const a = n === "string" ? Mt(i.vals) : i.vals;
+    t.forEach((a) => {
+      const i = n === "string" ? $t(a.vals) : a.vals;
       let u = 0;
-      for (let c = 0; c < i.shape[0]; ++c) {
+      for (let c = 0; c < a.shape[0]; ++c) {
         const h = c * e[1] + r;
-        for (let f = 0; f < i.shape[1]; ++f)
-          s[h + f] = a[u++];
+        for (let f = 0; f < a.shape[1]; ++f)
+          s[h + f] = i[u++];
       }
-      r += i.shape[1];
+      r += a.shape[1];
     });
   }
   return s;
@@ -1163,7 +1164,7 @@ function Ge(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const je = k((t, e) => t === e ? 1 : 0);
+const ze = C((t, e) => t === e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1180,7 +1181,7 @@ const je = k((t, e) => t === e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const Be = X((t) => Math.exp(t));
+const We = K((t) => Math.exp(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1197,7 +1198,7 @@ const Be = X((t) => Math.exp(t));
  * limitations under the License.
  * =============================================================================
  */
-const Ze = X((t) => Math.expm1(t));
+const qe = K((t) => Math.expm1(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1214,7 +1215,7 @@ const Ze = X((t) => Math.expm1(t));
  * limitations under the License.
  * =============================================================================
  */
-const He = X((t) => Math.floor(t));
+const Ce = K((t) => Math.floor(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1231,7 +1232,7 @@ const He = X((t) => Math.floor(t));
  * limitations under the License.
  * =============================================================================
  */
-const Ke = k((t, e) => Math.floor(t / e));
+const ke = C((t, e) => Math.floor(t / e));
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -1248,17 +1249,17 @@ const Ke = k((t, e) => Math.floor(t / e));
  * limitations under the License.
  * =============================================================================
  */
-function Xe(t, e, n, o, s, r, i, a, u) {
-  const c = Z([o, r], n);
+function Ue(t, e, n, o, s, r, a, i, u) {
+  const c = B([o, r], n);
   for (let h = 0; h < o; h++) {
     const f = [];
     let w = 0;
     for (let p = 0; p < s; p++) {
       const m = t[h * s + p];
-      w += m * i[p], f.push(m);
+      w += m * a[p], f.push(m);
     }
     if (w < 0 || w >= u / r)
-      throw new Error(`Invalid indices: ${f} does not index into ${a}`);
+      throw new Error(`Invalid indices: ${f} does not index into ${i}`);
     for (let p = 0; p < r; p++)
       c.values[h * r + p] = e.get(...e.indexToLoc(w * r + p));
   }
@@ -1280,12 +1281,12 @@ function Xe(t, e, n, o, s, r, i, a, u) {
  * limitations under the License.
  * =============================================================================
  */
-function Ye(t, e, n) {
-  const o = Z(n, t.dtype);
+function Ge(t, e, n) {
+  const o = B(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]);
-    i[2] = e.values[c];
-    const h = t.locToIndex(i);
+    const a = o.indexToLoc(s).slice(), i = a[0], u = a[2], c = e.locToIndex([i, u]);
+    a[2] = e.values[c];
+    const h = t.locToIndex(a);
     0 <= h && h < t.values.length && (o.values[s] = t.values[h]);
   }
   return o;
@@ -1306,7 +1307,7 @@ function Ye(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-const Je = k((t, e) => t > e ? 1 : 0);
+const je = C((t, e) => t > e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1323,7 +1324,7 @@ const Je = k((t, e) => t > e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const Qe = k((t, e) => t >= e ? 1 : 0);
+const Ze = C((t, e) => t >= e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1340,7 +1341,7 @@ const Qe = k((t, e) => t >= e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const tn = k((t, e) => t < e ? 1 : 0);
+const Be = C((t, e) => t < e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1357,7 +1358,7 @@ const tn = k((t, e) => t < e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const en = k((t, e) => t <= e ? 1 : 0);
+const He = C((t, e) => t <= e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1374,7 +1375,7 @@ const en = k((t, e) => t <= e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-function nn(t, e, n) {
+function Ke(t, e, n) {
   const o = (e - t) / (n - 1), s = ot(n, "float32");
   s[0] = t;
   for (let r = 1; r < s.length; r++)
@@ -1397,7 +1398,7 @@ function nn(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-const on = X((t) => Math.log(t));
+const Xe = K((t) => Math.log(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1414,16 +1415,16 @@ const on = X((t) => Math.log(t));
  * limitations under the License.
  * =============================================================================
  */
-function sn(t, e, n, o) {
-  const s = nt(o, O(n));
+function Qe(t, e, n, o) {
+  const s = nt(o, y(n));
   for (let r = 0; r < s.length; ++r) {
-    const i = r * e;
-    let a = t[i];
+    const a = r * e;
+    let i = t[a];
     for (let u = 0; u < e; ++u) {
-      const c = t[i + u];
-      (Number.isNaN(c) || c > a) && (a = c);
+      const c = t[a + u];
+      (Number.isNaN(c) || c > i) && (i = c);
     }
-    s[r] = a;
+    s[r] = i;
   }
   return s;
 }
@@ -1443,7 +1444,7 @@ function sn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const rn = k((t, e) => Math.max(t, e));
+const Ye = C((t, e) => Math.max(t, e));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1460,7 +1461,7 @@ const rn = k((t, e) => Math.max(t, e));
  * limitations under the License.
  * =============================================================================
  */
-const an = k((t, e) => Math.min(t, e));
+const Je = C((t, e) => Math.min(t, e));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1477,7 +1478,7 @@ const an = k((t, e) => Math.min(t, e));
  * limitations under the License.
  * =============================================================================
  */
-const kt = k((t, e) => t * e);
+const Pt = C((t, e) => t * e);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1494,9 +1495,9 @@ const kt = k((t, e) => t * e);
  * limitations under the License.
  * =============================================================================
  */
-function un(t, e, n) {
-  const o = Ht(-1, n);
-  return kt([], e, o, t, n);
+function tn(t, e, n) {
+  const o = Ut(-1, n);
+  return Pt([], e, o, t, n);
 }
 /**
  * @license
@@ -1514,7 +1515,7 @@ function un(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-const ln = k((t, e) => t !== e ? 1 : 0);
+const en = C((t, e) => t !== e ? 1 : 0);
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1531,13 +1532,13 @@ const ln = k((t, e) => t !== e ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-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 = mt(h, r, a), w = new Array(f.length);
+function nn(t, e, n, o, s) {
+  const r = e.length, a = y(e), i = J(e), u = J(s), c = nt(n, y(s));
+  for (let h = 0; h < a; ++h) {
+    const f = pt(h, r, i), w = new Array(f.length);
     for (let m = 0; m < w.length; m++)
       w[m] = f[o[m]];
-    const p = dt(w, r, u);
+    const p = ft(w, r, u);
     c[p] = t[h];
   }
   return c;
@@ -1558,16 +1559,16 @@ function cn(t, e, n, o, s) {
  * limitations under the License.
  * =============================================================================
  */
-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) {
+function on(t, e, n, o) {
+  const [s, r] = mt(t, o), a = Gt(e, "int32"), i = ot(y(s), a), u = y(r);
+  for (let c = 0; c < i.length; ++c) {
     const h = c * u;
     let f = 1;
     for (let w = 0; w < u; ++w)
       f *= n[h + w];
-    a[c] = f;
+    i[c] = f;
   }
-  return { outVals: a, outShape: s, outDtype: i };
+  return { outVals: i, outShape: s, outDtype: a };
 }
 /**
  * @license
@@ -1585,15 +1586,15 @@ function hn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-function fn(t, e, n) {
+function sn(t, e, n) {
   t.forEach((o, s) => {
     if (o < 0 || o >= n) {
-      const r = mt(s, e.length, K(e)).join(",");
+      const r = pt(s, e.length, J(e)).join(",");
       throw new Error(`indices[${r}] = ${o} is not in [0, ${n})`);
     }
   });
 }
-function dn(t, e) {
+function rn(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)
@@ -1607,42 +1608,42 @@ function dn(t, e) {
         throw new Error("Ragged splits must be sorted in ascending order");
   }
 }
-function gn(t, e, n, o) {
+function an(t, e, n, o) {
   const s = [];
   let r = 0;
-  const i = e.length - 1 + n.length, a = new Array(i).fill(null).map(() => [0]);
-  dn(n, o);
+  const a = e.length - 1 + n.length, i = new Array(a).fill(null).map(() => [0]);
+  rn(n, o);
   let u = 1;
   for (let c = 0; c < e.length - 1; ++c) {
     u *= e[c];
     const h = e[c + 1];
     for (let f = 1; f < u + 1; ++f)
-      a[c].push(f * h);
+      i[c].push(f * h);
   }
   for (let c = 0; c < t.length; ++c) {
     let h = t[c], f = t[c] + 1;
     for (let w = 0; w < n.length; ++w) {
       const p = n[w], m = w + e.length - 1;
       if (m >= 0) {
-        const b = a[m], d = b[b.length - 1] - p[h];
+        const b = i[m], d = b[b.length - 1] - p[h];
         for (let g = h; g < f; ++g)
-          a[m].push(p[g + 1] + d);
+          i[m].push(p[g + 1] + d);
       }
       h = p[h], f = p[f];
     }
     f !== h && (s.push([h, f]), r += f - h);
   }
-  return { outSplits: a, valueSlices: s, numValues: r };
+  return { outSplits: i, valueSlices: s, numValues: r };
 }
-function pn(t) {
+function un(t) {
   const e = [];
   for (let n = 0; n < t.length; ++n) {
-    const o = t[n].length, s = W("int32", o);
-    e.push(s), t[n].forEach((r, i) => s[i] = r);
+    const o = t[n].length, s = q("int32", o);
+    e.push(s), t[n].forEach((r, a) => s[a] = r);
   }
   return e;
 }
-function Et(t, e) {
+function bt(t, e) {
   const n = t.slice(0, e);
   for (; n.length < e; )
     n.push(1);
@@ -1650,31 +1651,31 @@ function Et(t, e) {
     n[e - 1] *= t[o];
   return n;
 }
-function mn(t, e, n, o, s, r) {
-  const i = Et(e, 2)[1], a = Et(r, 2)[1];
+function ln(t, e, n, o, s, r) {
+  const a = bt(e, 2)[1], i = bt(r, 2)[1];
   let u = 0;
   for (const c of n)
     for (let h = c[0]; h < c[1]; ++h) {
       for (let f = 0; f < o; ++f)
-        s[u * a + f] = t[h * i + f];
+        s[u * i + f] = t[h * a + f];
       ++u;
     }
 }
-function wn(t, e, n, o, s) {
+function cn(t, e, n, o, s) {
   const r = e.slice();
   r[0] = s;
-  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];
+  const a = q(n, y(r)), i = t.length, u = i === 0 ? 0 : i / e[0];
+  return ln(t, e, o, u, a, r), [a, r];
 }
-function In(t, e, n, o, s, r, i, a) {
+function hn(t, e, n, o, s, r, a, i) {
   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 (fn(r, i, u), o.length === 0)
+  if (sn(r, a, u), o.length === 0)
     throw new Error("params.rank must be nonzero");
-  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);
+  const c = o[0], { outSplits: h, valueSlices: f, numValues: w } = an(r, a, t, c), p = un(h), m = cn(n, o, s, f, w);
   return [p, m[0], m[1]];
 }
 /**
@@ -1693,40 +1694,40 @@ function In(t, e, n, o, s, r, i, a) {
  * limitations under the License.
  * =============================================================================
  */
-const $t = 2147483647;
-function xn(t, e, n, o, s, r, i) {
+const vt = 2147483647;
+function fn(t, e, n, o, s, r, a) {
   if (e.length > 1)
     throw new Error("starts must be a scalar or vector");
   if (s.length > 1)
     throw new Error("limits must be a scalar or vector");
-  if (i.length > 1)
+  if (a.length > 1)
     throw new Error("deltas must be a scalar or vector");
-  const a = e.length === 0, u = s.length === 0, c = i.length === 0, h = [];
-  a || h.push(e[0]), u || h.push(s[0]), c || h.push(i[0]);
+  const i = e.length === 0, u = s.length === 0, c = a.length === 0, h = [];
+  i || h.push(e[0]), u || h.push(s[0]), c || h.push(a[0]);
   for (let d = 1; d < h.length; ++d)
     if (h[d] !== h[d - 1])
       throw new Error("starts, limits, and deltas must have the same shape");
-  const f = h.length === 0 ? 1 : h[0], w = W("int32", f + 1);
+  const f = h.length === 0 ? 1 : h[0], w = q("int32", f + 1);
   w[0] = 0;
   for (let d = 0; d < f; ++d) {
-    const g = a ? t[0] : t[d], x = u ? o[0] : o[d], $ = c ? r[0] : r[d];
-    if ($ === 0)
+    const g = i ? t[0] : t[d], x = u ? o[0] : o[d], O = c ? r[0] : r[d];
+    if (O === 0)
       throw new Error("Requires delta != 0");
-    let E;
-    if ($ > 0 && x < g || $ < 0 && x > g)
-      E = 0;
-    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 v;
+    if (O > 0 && x < g || O < 0 && x > g)
+      v = 0;
+    else if (v = Math.ceil(Math.abs((x - g) / O)), v > vt)
+      throw new Error(`Requires ((limit - start) / delta) <= ${vt}`);
+    w[d + 1] = w[d] + v;
+  }
+  const p = w[f], m = q(n, p);
   let b = 0;
   for (let d = 0; d < f; ++d) {
     const g = w[d + 1] - w[d];
-    let x = a ? t[0] : t[d];
-    const $ = c ? r[0] : r[d];
-    for (let E = 0; E < g; ++E)
-      m[b++] = x, x += $;
+    let x = i ? t[0] : t[d];
+    const O = c ? r[0] : r[d];
+    for (let v = 0; v < g; ++v)
+      m[b++] = x, x += O;
   }
   return [w, m];
 }
@@ -1746,27 +1747,27 @@ function xn(t, e, n, o, s, r, i) {
  * limitations under the License.
  * =============================================================================
  */
-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 = be(this.rowPartitionTypes);
+var Z = H;
+class at {
+  constructor(e, n, o, s, r, a, i, u, c, h) {
+    this.shape = e, this.shapeShape = n, this.values = o, this.valuesShape = s, this.valuesDType = r, this.defaultValue = a, this.defaultValueShape = i, this.rowPartitionValues = u, this.rowPartitionValuesShapes = c, this.rowPartitionTypes = ge(h), this.raggedRank = pe(this.rowPartitionTypes);
   }
   getRowPartitionTypeByDimension(e) {
-    return this.rowPartitionTypes[0] === B.FIRST_DIM_SIZE ? this.rowPartitionTypes[e + 1] : this.rowPartitionTypes[e];
+    return this.rowPartitionTypes[0] === Z.FIRST_DIM_SIZE ? this.rowPartitionTypes[e + 1] : this.rowPartitionTypes[e];
   }
   // Returns the relationship between dimension and dimension + 1.
   getRowPartitionTensor(e) {
-    return this.rowPartitionTypes[0] === B.FIRST_DIM_SIZE ? this.rowPartitionValues[e + 1] : this.rowPartitionValues[e];
+    return this.rowPartitionTypes[0] === Z.FIRST_DIM_SIZE ? this.rowPartitionValues[e + 1] : this.rowPartitionValues[e];
   }
   getMaxWidth(e) {
     const n = this.getRowPartitionTensor(e - 1);
     switch (this.getRowPartitionTypeByDimension(e - 1)) {
-      case B.VALUE_ROWIDS:
-        return ut.getMaxWidthValueRowID(n);
-      case B.ROW_SPLITS:
-        return ut.getMaxWidthRowSplit(n);
+      case Z.VALUE_ROWIDS:
+        return at.getMaxWidthValueRowID(n);
+      case Z.ROW_SPLITS:
+        return at.getMaxWidthRowSplit(n);
       default:
-        throw new Error(`Cannot handle partition type ${B[this.getRowPartitionTypeByDimension(e - 1)]}`);
+        throw new Error(`Cannot handle partition type ${Z[this.getRowPartitionTypeByDimension(e - 1)]}`);
     }
   }
   static getMaxWidthRowSplit(e) {
@@ -1785,9 +1786,9 @@ class ut {
     if (n === 0)
       return 0;
     let o = 0, s = e[0], r = 0;
-    for (let i = 1; i < n; ++i) {
-      const a = e[i];
-      a !== s && (s = a, r = Math.max(i - o, r), o = i);
+    for (let a = 1; a < n; ++a) {
+      const i = e[a];
+      i !== s && (s = i, r = Math.max(a - o, r), o = a);
     }
     return Math.max(n - o, r);
   }
@@ -1801,12 +1802,12 @@ class ut {
   }
   calculateOutputSize(e) {
     const n = this.valuesShape, o = this.defaultValueShape;
-    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));
-    return i;
+    me(o, n);
+    const s = this.tensorShapeFromTensor(this.shape, this.shapeShape), a = de(this.raggedRank, s, n);
+    a[0] < 0 && (a[0] = e);
+    for (let i = 1; i <= this.raggedRank; ++i)
+      a[i] < 0 && (a[i] = this.getMaxWidth(i));
+    return a;
   }
   /**
    * The outputIndex represents the index in the output tensor
@@ -1820,27 +1821,27 @@ class ut {
    */
   calculateFirstParentOutputIndex(e, n, o) {
     const s = Math.min(e, o), r = [];
-    let i = 0;
-    for (let a = 0; a < s; ++a, i += n)
-      r.push(i);
-    for (let a = s; a < e; ++a)
+    let a = 0;
+    for (let i = 0; i < s; ++i, a += n)
+      r.push(a);
+    for (let i = s; i < e; ++i)
       r.push(-1);
-    return Lt(r.length === e, () => "Final length of result must be equal to firstDimension."), r;
+    return jt(r.length === e, () => "Final length of result must be equal to firstDimension."), r;
   }
   calculateOutputIndexRowSplit(e, n, o, s) {
-    const r = e.length, i = [];
-    for (let a = 0; a < r - 1; ++a) {
-      const u = e[a + 1] - e[a];
-      let c = Math.min(s, u), h = n[a];
+    const r = e.length, a = [];
+    for (let i = 0; i < r - 1; ++i) {
+      const u = e[i + 1] - e[i];
+      let c = Math.min(s, u), h = n[i];
       h === -1 && (c = 0);
       for (let f = 0; f < c; ++f)
-        i.push(h), h += o;
+        a.push(h), h += o;
       for (let f = 0; f < u - c; ++f)
-        i.push(-1);
+        a.push(-1);
     }
-    if (r > 0 && i.length !== e[r - 1])
+    if (r > 0 && a.length !== e[r - 1])
       throw new Error("Invalid row split size.");
-    return i;
+    return a;
   }
   // Calculate the output index of the first element of a list.
   // The parentOutputIndex is the same computation for the previous list.
@@ -1864,40 +1865,40 @@ class ut {
   // result[7] = -1 because parentOutputIndex[valueRowIds[6]] == -1
   // result[8] = parentOutputIndex[valueRowIds[7]]
   calculateOutputIndexValueRowID(e, n, o, s) {
-    const r = e.length, i = [];
+    const r = e.length, a = [];
     if (r === 0)
       return [];
-    let a = 0, u = e[0];
+    let i = 0, u = e[0];
     if (u >= n.length)
       throw new Error(`Got currentValueRowId=${u}, which is not less than ${n.length}`);
     let c = n[u];
-    i.push(c);
+    a.push(c);
     for (let h = 1; h < r; ++h) {
       const f = e[h];
       if (f === u)
-        c >= 0 && (++a, a < s ? c += o : c = -1);
+        c >= 0 && (++i, i < s ? c += o : c = -1);
       else {
-        if (a = 0, u = f, f >= n.length)
+        if (i = 0, u = f, f >= n.length)
           throw new Error(`Got nextValueRowId=${f} which is not less than ${n.length}`);
         c = n[f];
       }
-      i.push(c);
+      a.push(c);
     }
-    if (i.length !== e.length)
+    if (a.length !== e.length)
       throw new Error("Invalid row ids.");
-    return i;
+    return a;
   }
   calculateOutputIndex(e, n, o, s) {
-    const r = this.getRowPartitionTensor(e), i = this.getRowPartitionTypeByDimension(e);
-    switch (i) {
-      case B.VALUE_ROWIDS:
+    const r = this.getRowPartitionTensor(e), a = this.getRowPartitionTypeByDimension(e);
+    switch (a) {
+      case Z.VALUE_ROWIDS:
         return this.calculateOutputIndexValueRowID(r, n, o, s);
-      case B.ROW_SPLITS:
+      case Z.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: ${B[i]}`);
+        throw new Error(`Unsupported partition type: ${Z[a]}`);
     }
   }
   getFirstDimensionSize() {
@@ -1906,14 +1907,14 @@ class ut {
       throw new Error("No row_partition_types given.");
     const n = this.rowPartitionTypes[0];
     switch (n) {
-      case B.FIRST_DIM_SIZE:
+      case Z.FIRST_DIM_SIZE:
         return e[0];
-      case B.VALUE_ROWIDS:
+      case Z.VALUE_ROWIDS:
         throw new Error("Cannot handle VALUE_ROWIDS in first dimension.");
-      case B.ROW_SPLITS:
+      case Z.ROW_SPLITS:
         return this.rowPartitionValuesShapes[0][0] - 1;
       default:
-        throw new Error(`Cannot handle type ${B[n]}`);
+        throw new Error(`Cannot handle type ${Z[n]}`);
     }
   }
   compute() {
@@ -1923,28 +1924,28 @@ class ut {
     s[s.length - 1] = 1;
     for (let u = s.length - 2; u >= 0; --u)
       s[u] = s[u + 1] * o[u + 1];
-    const r = Ft(o, !1), i = W(this.valuesDType, O(r));
+    const r = Ft(o, !1), a = q(this.valuesDType, y(r));
     if (s[0] * o[0] > 0) {
       let u = this.calculateFirstParentOutputIndex(n, s[0], o[0]);
       for (let c = 1; c <= this.raggedRank; ++c)
         u = this.calculateOutputIndex(c - 1, u, s[c], o[c]);
-      this.setOutput(this.raggedRank, u, i, r);
+      this.setOutput(this.raggedRank, u, a, r);
     }
-    return [r, i];
+    return [r, a];
   }
   setOutput(e, n, o, s) {
     if (o.length === 0)
       return;
-    const r = this.values, i = o;
-    let a = s.slice();
-    a = a.slice(e + 1);
-    const u = O(a), c = n.length;
+    const r = this.values, a = o;
+    let i = s.slice();
+    i = i.slice(e + 1);
+    const u = y(i), c = n.length;
     let h = this.defaultValue;
     if (h.length !== u && h.length !== 1) {
       const m = this.defaultValueShape;
-      Xt(() => {
-        const b = ce(h, m);
-        h = ae(b, a).dataSync();
+      Zt(() => {
+        const b = oe(h, m);
+        h = te(b, i).dataSync();
       });
     }
     let f = 0, w = 0, p = 0;
@@ -1955,8 +1956,8 @@ class ut {
         continue;
       }
       if (w < p) {
-        const d = r.subarray(f * u), g = i.subarray(w * u), x = (p - w) * u;
-        Rt(g, d, x);
+        const d = r.subarray(f * u), g = a.subarray(w * u), x = (p - w) * u;
+        Ot(g, d, x);
       }
       if (m >= c) {
         const d = o.length;
@@ -1964,17 +1965,17 @@ class ut {
       }
       if (b > p)
         if (this.defaultValue.length === 1)
-          i.subarray(p * u, b * u).fill(this.defaultValue[0]), p = b;
+          a.subarray(p * u, b * u).fill(this.defaultValue[0]), p = b;
         else
           for (; b > p; ) {
-            const d = i.slice(p * u);
-            Rt(d, h, u), ++p;
+            const d = a.slice(p * u);
+            Ot(d, h, u), ++p;
           }
       b < 0 ? (f = m + 1, w = p) : (f = m, w = p, p = w + 1);
     }
   }
 }
-function Rt(t, e, n) {
+function Ot(t, e, n) {
   for (let o = 0; o < n; o++)
     t[o] = e[o];
 }
@@ -1992,8 +1993,8 @@ function Ft(t, e) {
   }
   return n;
 }
-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();
+function dn(t, e, n, o, s, r, a, i, u, c) {
+  return new at(t, e, n, o, s, r, a, i, u, c).compute();
 }
 /**
  * @license
@@ -2011,11 +2012,11 @@ function Sn(t, e, n, o, s, r, i, a, u, c) {
  * limitations under the License.
  * =============================================================================
  */
-function vn(t, e, n, o) {
-  const s = t === e, r = t < e && n < 0, i = e < t && n > 1;
-  if (s || r || i)
+function gn(t, e, n, o) {
+  const s = t === e, r = t < e && n < 0, a = e < t && n > 1;
+  if (s || r || a)
     return ot(0, o);
-  const a = Math.abs(Math.ceil((e - t) / n)), u = ot(a, o);
+  const i = Math.abs(Math.ceil((e - t) / n)), u = ot(i, o);
   e < t && n === 1 && (n = -1), u[0] = t;
   for (let c = 1; c < u.length; c++)
     u[c] = u[c - 1] + n;
@@ -2037,7 +2038,7 @@ function vn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const bn = X((t) => 1 / Math.sqrt(t));
+const pn = K((t) => 1 / Math.sqrt(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2054,18 +2055,18 @@ const bn = X((t) => 1 / Math.sqrt(t));
  * limitations under the License.
  * =============================================================================
  */
-function En(t, e, n, o, s, r, i, a, u, c) {
+function mn(t, e, n, o, s, r, a, i, 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 gt ? u : Z(h, e.dtype);
+    return B(n, e.dtype);
+  const p = u instanceof dt ? u : B(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 x = f[m * i + g];
-      b.push(x), d += x * a[g];
+    for (let g = 0; g < a; g++) {
+      const x = f[m * a + g];
+      b.push(x), d += x * i[g];
     }
     if (d < 0 || d >= o / s)
       throw new Error(`Invalid indices: ${b} does not index into ${n}`);
@@ -2090,7 +2091,7 @@ function En(t, e, n, o, s, r, i, a, u, c) {
  * limitations under the License.
  * =============================================================================
  */
-const $n = X((t) => 1 / (1 + Math.exp(-t)));
+const wn = K((t) => 1 / (1 + Math.exp(-t)));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2107,18 +2108,18 @@ const $n = X((t) => 1 / (1 + Math.exp(-t)));
  * limitations under the License.
  * =============================================================================
  */
-function Rn(t, e, n, o, s) {
-  const r = ue(o, e, n), i = O(n), a = K(o);
+function In(t, e, n, o, s) {
+  const r = ee(o, e, n), a = y(n), i = J(o);
   if (r) {
-    const f = le(e, a);
-    return s === "string" ? t.slice(f, f + i) : t.subarray(f, f + i);
+    const f = ne(e, i);
+    return s === "string" ? t.slice(f, f + a) : t.subarray(f, f + a);
   }
-  const u = s === "string" ? Mt(t) : t, c = Z(o, s, u), h = Z(n, s);
+  const u = s === "string" ? $t(t) : t, c = B(o, s, u), h = B(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" ? oe(h.values) : h.values;
+  return s === "string" ? Qt(h.values) : h.values;
 }
 /**
  * @license
@@ -2136,12 +2137,12 @@ function Rn(t, e, n, o, s) {
  * limitations under the License.
  * =============================================================================
  */
-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];
+function xn(t, e, n, o, s, r, a) {
+  const i = e[0], u = r[0], c = new Array(u), h = new Array(i), f = e[1];
   if (u === 0) {
-    if (a !== 0)
-      throw new Error(Fe(a));
-    const d = W(n, 0), g = W(s, 0);
+    if (i !== 0)
+      throw new Error(xe(i));
+    const d = q(n, 0), g = q(s, 0);
     return [
       d,
       [0, f],
@@ -2152,12 +2153,12 @@ function Fn(t, e, n, o, s, r, i) {
   }
   let w = !0, p = 0;
   const m = new Array(u).fill(0);
-  for (let d = 0; d < a; ++d) {
+  for (let d = 0; d < i; ++d) {
     const g = t[d * f];
     if (g < 0)
-      throw new Error(Oe(d, g));
+      throw new Error(Se(d, g));
     if (g >= u)
-      throw new Error(ye(d, g, u));
+      throw new Error(Ee(d, g, u));
     ++m[g], w = w && g >= p, p = g;
   }
   let b = !0;
@@ -2167,31 +2168,31 @@ function Fn(t, e, n, o, s, r, i) {
   }
   if (b && w) {
     const d = t, g = o;
-    for (let x = 0; x < a; ++x)
+    for (let x = 0; x < i; ++x)
       h[x] = x;
     return [
       d,
-      [a, f],
+      [i, f],
       g,
       c,
       h
     ];
   } else {
-    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 V = t[E * f], z = $[V], M = (V === 0 ? 0 : m[V - 1]) + z;
-      $[V]++;
+    const d = m[u - 1], g = q(n, d * f), x = q(s, d), O = new Array(u).fill(0);
+    for (let v = 0; v < i; ++v) {
+      const V = t[v * f], D = O[V], L = (V === 0 ? 0 : m[V - 1]) + D;
+      O[V]++;
       for (let _ = 0; _ < f; ++_)
-        g[M * f + _] = t[E * f + _];
-      x[M] = o[E], h[E] = M;
+        g[L * f + _] = t[v * f + _];
+      x[L] = o[v], h[v] = L;
     }
-    for (let E = 0; E < u; ++E)
-      if ($[E] === 0) {
-        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;
+    for (let v = 0; v < u; ++v)
+      if (O[v] === 0) {
+        const D = v === 0 ? 0 : m[v - 1];
+        g[D * f + 0] = v;
+        for (let L = 1; L < f; ++L)
+          g[D * f + L] = 0;
+        x[D] = a;
       }
     return [
       g,
@@ -2218,31 +2219,31 @@ function Fn(t, e, n, o, s, r, i) {
  * limitations under the License.
  * =============================================================================
  */
-function On(t, e, n, o, s) {
-  const r = O(o), i = e[0], a = s.length, u = [];
+function Sn(t, e, n, o, s) {
+  const r = y(o), a = e[0], i = s.length, u = [];
   let c = 1, h = -1;
-  for (let d = 0; d < a; ++d) {
+  for (let d = 0; d < i; ++d) {
     const g = s[d];
     if (g === -1) {
       if (h !== -1)
-        throw new Error(Te(h, d));
+        throw new Error(be(h, d));
       h = d, u.push(1);
     } else {
       if (g < 0)
-        throw new Error(Ve(d, g));
+        throw new Error(ve(d, g));
       c *= g, u.push(g);
     }
   }
   if (h !== -1) {
     if (c <= 0)
-      throw new Error(Le());
+      throw new Error(Oe());
     const d = Math.trunc(r / c);
     if (c * d !== r)
-      throw new Error(Me(o, u));
+      throw new Error(Fe(o, u));
     u[h] = d;
   }
-  if (O(u) !== r)
-    throw new Error(_e(o, u));
+  if (y(u) !== r)
+    throw new Error(Re(o, u));
   const w = o.length, p = [];
   if (w > 0) {
     p[w - 1] = 1;
@@ -2250,20 +2251,20 @@ function On(t, e, n, o, s) {
       p[d] = p[d + 1] * o[d + 1];
   }
   const m = [];
-  if (a > 0) {
-    m[a - 1] = 1;
-    for (let d = a - 2; d >= 0; --d)
+  if (i > 0) {
+    m[i - 1] = 1;
+    for (let d = i - 2; d >= 0; --d)
       m[d] = m[d + 1] * u[d + 1];
   }
-  const b = W(n, i * a);
-  for (let d = 0; d < i; ++d) {
+  const b = q(n, a * i);
+  for (let d = 0; d < a; ++d) {
     let g = 0;
     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];
+    for (let x = 0; x < i; ++x)
+      b[d * i + x] = Math.trunc(g / m[x]), g %= m[x];
   }
-  return [b, [i, a], u];
+  return [b, [a, i], u];
 }
 /**
  * @license
@@ -2281,45 +2282,45 @@ function On(t, e, n, o, s) {
  * limitations under the License.
  * =============================================================================
  */
-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;
+function En(t, e, n, o, s, r = !1, a = 0) {
+  const i = o.length, u = [e[0], t.length / e[0]], c = u[1], f = i > 0 ? s[i - 1] + 1 : 0;
   if (f < 0)
-    throw new Error(bt());
+    throw new Error(Et());
   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];
+  const p = w.reduce((O, v) => O * v, 1), m = q(n, p);
+  if (i === 0)
+    return f > 0 && m.fill(a), [m, w];
   if (f <= 0)
-    throw new Error(bt());
+    throw new Error(Et());
   let b = 0, d = 1, g = 0, x = s[b];
   for (; ; ) {
-    let $ = 0;
-    if (d < a) {
-      if ($ = s[d], x === $) {
+    let O = 0;
+    if (d < i) {
+      if (O = s[d], x === O) {
         ++d;
         continue;
       }
-      if (x >= $)
-        throw new Error(Ae());
+      if (x >= O)
+        throw new Error($e());
     }
     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 V = o[E];
+      throw new Error(ye(x, f));
+    x > g && m.fill(a, g * c, x * c);
+    for (let v = b; v < d; ++v) {
+      const V = o[v];
       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];
+        throw new Error(Te(v, o[v], u[0]));
+      for (let D = 0; D < c; D++)
+        m[x * c + D] += t[V * c + D];
     }
     if (r)
-      for (let E = 0; E < c; E++)
-        m[x * c + E] /= d - b;
-    if (b = d, ++d, g = x + 1, x = $, d > a)
+      for (let v = 0; v < c; v++)
+        m[x * c + v] /= d - b;
+    if (b = d, ++d, g = x + 1, x = O, d > i)
       break;
   }
-  return g < f && m.fill(i, g * c, f * c), [m, w];
+  return g < f && m.fill(a, g * c, f * c), [m, w];
 }
 /**
  * @license
@@ -2337,7 +2338,7 @@ function yn(t, e, n, o, s, r = !1, i = 0) {
  * limitations under the License.
  * =============================================================================
  */
-const Tn = X((t) => Math.sqrt(t));
+const bn = K((t) => Math.sqrt(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2354,7 +2355,7 @@ const Tn = X((t) => Math.sqrt(t));
  * limitations under the License.
  * =============================================================================
  */
-const Vn = k((t, e) => {
+const vn = C((t, e) => {
   const n = t - e;
   return n * n;
 });
@@ -2374,7 +2375,7 @@ const Vn = k((t, e) => {
  * limitations under the License.
  * =============================================================================
  */
-const Ln = X((t, e) => {
+const On = K((t, e) => {
   const { pattern: n, replaceGlobal: o, rewrite: s } = e;
   return t.replace(new RegExp(n, o ? "g" : ""), s);
 });
@@ -2394,13 +2395,13 @@ const Ln = X((t, e) => {
  * limitations under the License.
  * =============================================================================
  */
-function Mn(t, e, n, o) {
-  const s = Z(t, e.dtype);
+function Fn(t, e, n, o) {
+  const s = B(t, e.dtype);
   for (let r = 0; r < s.size; r++) {
-    const i = s.indexToLoc(r), a = new Array(i.length);
-    for (let u = 0; u < a.length; u++)
-      a[u] = i[u] * n[u] + o[u];
-    s.set(e.get(...a), ...i);
+    const a = s.indexToLoc(r), i = new Array(a.length);
+    for (let u = 0; u < i.length; u++)
+      i[u] = a[u] * n[u] + o[u];
+    s.set(e.get(...i), ...a);
   }
   return s;
 }
@@ -2420,9 +2421,9 @@ function Mn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-class _n {
-  constructor(e, n, o, s, r, i) {
-    this.separator = ht(e), this.nGramWidths = n, this.leftPad = ht(o), this.rightPad = ht(s), this.padWidth = r, this.preserveShort = i;
+class Rn {
+  constructor(e, n, o, s, r, a) {
+    this.separator = ct(e), this.nGramWidths = n, this.leftPad = ct(o), this.rightPad = ct(s), this.padWidth = r, this.preserveShort = a;
   }
   getPadWidth(e) {
     return Math.min(this.padWidth < 0 ? e - 1 : this.padWidth, e - 1);
@@ -2431,19 +2432,19 @@ class _n {
     const o = this.getPadWidth(n);
     return Math.max(0, e + 2 * o - n + 1);
   }
-  createNGrams(e, n, o, s, r, i) {
-    for (let a = 0; a < r; ++a) {
-      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);
+  createNGrams(e, n, o, s, r, a) {
+    for (let i = 0; i < r; ++i) {
+      const u = this.getPadWidth(a), c = Math.max(0, u - i), h = Math.max(0, u - (r - (i + 1))), f = a - (c + h), w = n + (c > 0 ? 0 : i - u);
       let p = 0;
       p += c * this.leftPad.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];
+      p += m * this.separator.length, o[s + i] = new Uint8Array(p);
+      const b = o[s + i];
       let d = 0;
-      const g = (x) => x.forEach(($) => b[d++] = $);
+      const g = (x) => x.forEach((O) => b[d++] = O);
       for (let x = 0; x < c; ++x)
         g(this.leftPad), g(this.separator);
       for (let x = 0; x < f - 1; ++x)
@@ -2477,41 +2478,41 @@ class _n {
       if (u !== o)
         throw new Error(`Last split value must be data size. Expected ${o}, got ${u}`);
     }
-    const r = s - 1, i = W("int32", s);
+    const r = s - 1, a = q("int32", s);
     if (o === 0 || s === 0) {
       const u = new Array(o);
       for (let c = 0; c <= r; ++c)
-        i[c] = 0;
-      return [u, i];
+        a[c] = 0;
+      return [u, a];
     }
-    i[0] = 0;
+    a[0] = 0;
     for (let u = 1; u <= r; ++u) {
       const c = n[u] - n[u - 1];
       let h = 0;
       this.nGramWidths.forEach((f) => {
         h += this.getNumNGrams(c, f);
-      }), this.preserveShort && c > 0 && h === 0 && (h = 1), i[u] = i[u - 1] + h;
+      }), this.preserveShort && c > 0 && h === 0 && (h = 1), a[u] = a[u - 1] + h;
     }
-    const a = new Array(i[r]);
+    const i = new Array(a[r]);
     for (let u = 0; u < r; ++u) {
       const c = n[u];
-      let h = i[u];
+      let h = a[u];
       if (this.nGramWidths.forEach((f) => {
         const w = n[u + 1] - n[u], p = this.getNumNGrams(w, f);
-        this.createNGrams(e, c, a, h, p, f), h += p;
-      }), this.preserveShort && h === i[u]) {
+        this.createNGrams(e, c, i, h, p, f), h += p;
+      }), this.preserveShort && h === a[u]) {
         const f = n[u + 1] - n[u];
         if (f === 0)
           continue;
         const w = f + 2 * this.padWidth;
-        this.createNGrams(e, c, a, h, 1, w);
+        this.createNGrams(e, c, i, h, 1, w);
       }
     }
-    return [a, i];
+    return [i, a];
   }
 }
-function An(t, e, n, o, s, r, i, a) {
-  return new _n(n, o, s, r, i, a).compute(t, e);
+function $n(t, e, n, o, s, r, a, i) {
+  return new Rn(n, o, s, r, a, i).compute(t, e);
 }
 /**
  * @license
@@ -2529,7 +2530,7 @@ function An(t, e, n, o, s, r, i, a) {
  * limitations under the License.
  * =============================================================================
  */
-function Nn(t, e, n, o) {
+function yn(t, e, n, o) {
   if (!t.length)
     return;
   if (e.length === 0) {
@@ -2539,10 +2540,10 @@ function Nn(t, e, n, o) {
   }
   if (e.length === 1) {
     const r = e[0];
-    let i = t.indexOf(r);
-    for (; i !== -1; ) {
-      const a = t.subarray(0, i);
-      (!n || a.length !== 0) && o.push(a), t = t.subarray(i + 1), i = t.indexOf(r);
+    let a = t.indexOf(r);
+    for (; a !== -1; ) {
+      const i = t.subarray(0, a);
+      (!n || i.length !== 0) && o.push(i), t = t.subarray(a + 1), a = t.indexOf(r);
     }
     (!n || t.length !== 0) && o.push(t);
     return;
@@ -2550,24 +2551,24 @@ function Nn(t, e, n, o) {
   let s = 0;
   for (let r = 0; r < t.length + 1; r++)
     if (r === t.length || e.indexOf(t[r]) !== -1) {
-      const i = t.subarray(s, r);
-      (!n || i.length !== 0) && o.push(i), s = r + 1;
+      const a = t.subarray(s, r);
+      (!n || a.length !== 0) && o.push(a), s = r + 1;
     }
 }
-function Dn(t, e, n) {
+function Tn(t, e, n) {
   const o = t.length, s = [];
-  let r = 0, i = 0;
-  const a = new Array(o);
+  let r = 0, a = 0;
+  const i = new Array(o);
   for (let w = 0; w < o; ++w) {
     const p = s.length;
-    Nn(t[w], e, n, s);
+    yn(t[w], e, n, s);
     const m = s.length - p;
-    a[w] = m, r += m, i = Math.max(i, m);
+    i[w] = m, r += m, a = Math.max(a, m);
   }
-  const u = W("int32", r * 2), c = new Array(r), h = [o, i];
+  const u = q("int32", r * 2), c = new Array(r), h = [o, a];
   let f = 0;
   for (let w = 0; w < o; ++w)
-    for (let p = 0; p < a[w]; ++p)
+    for (let p = 0; p < i[w]; ++p)
       u[f * 2] = w, u[f * 2 + 1] = p, c[f] = s[f], ++f;
   return [u, c, h];
 }
@@ -2587,10 +2588,10 @@ function Dn(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-function zn(t, e) {
-  const n = W("int32", t.length);
+function Vn(t, e) {
+  const n = q("int32", t.length);
   for (let o = 0; o < t.length; ++o)
-    n[o] = xe(t[o]).modulo(e).getLowBitsUnsigned();
+    n[o] = fe(t[o]).modulo(e).getLowBitsUnsigned();
   return n;
 }
 /**
@@ -2609,7 +2610,7 @@ function zn(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-const Pn = k((t, e) => t - e);
+const Mn = C((t, e) => t - e);
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -2626,17 +2627,17 @@ const Pn = k((t, e) => t - e);
  * limitations under the License.
  * =============================================================================
  */
-function Cn(t, e) {
+function Ln(t, e) {
   const n = new Array(t.rank);
   for (let s = 0; s < n.length; s++)
     n[s] = t.shape[s] * e[s];
-  const o = Z(n, t.dtype);
+  const o = B(n, t.dtype);
   for (let s = 0; s < o.values.length; ++s) {
-    const r = o.indexToLoc(s), i = new Array(t.rank);
-    for (let u = 0; u < i.length; u++)
-      i[u] = r[u] % t.shape[u];
-    const a = t.locToIndex(i);
-    o.values[s] = t.values[a];
+    const r = o.indexToLoc(s), a = new Array(t.rank);
+    for (let u = 0; u < a.length; u++)
+      a[u] = r[u] % t.shape[u];
+    const i = t.locToIndex(a);
+    o.values[s] = t.values[i];
   }
   return o;
 }
@@ -2660,37 +2661,37 @@ const et = (t, e) => {
   const n = e.value - t.value;
   return n === 0 ? t.index - e.index : n;
 };
-function qt(t, e, n = 0, o = t.length - 1) {
+function Dt(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));
-      qt(t, e, w, p);
+      const i = o - n + 1, u = e - n + 1, c = Math.log(i), h = 0.5 * Math.exp(2 * c / 3), f = 0.5 * Math.sqrt(c * h * (i - h) / i) * Math.sign(u - i / 2), w = Math.max(n, Math.floor(e - u * h / i + f)), p = Math.min(o, Math.floor(e + (i - u) * h / i + f));
+      Dt(t, e, w, p);
     }
     const s = t[e];
-    let r = n, i = o;
-    for (tt(t, n, e), et(t[o], s) > 0 && tt(t, n, o); r < i; ) {
-      for (tt(t, r, i), r++, i--; et(t[r], s) < 0; )
+    let r = n, a = o;
+    for (tt(t, n, e), et(t[o], s) > 0 && tt(t, n, o); r < a; ) {
+      for (tt(t, r, a), r++, a--; et(t[r], s) < 0; )
         r = r + 1;
-      for (; et(t[i], s) > 0; )
-        i = i - 1;
+      for (; et(t[a], s) > 0; )
+        a = a - 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);
+    et(t[n], s) === 0 ? tt(t, n, a) : (a = a + 1, tt(t, a, o)), a <= e && (n = a + 1), e <= a && (o = a - 1);
   }
 }
-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);
+function _n(t, e, n, o, s) {
+  const r = e[e.length - 1], [a, i] = [t.length / r, r], u = nt(n, a * o), c = nt("int32", a * o);
+  for (let f = 0; f < a; f++) {
+    const w = f * i, p = t.subarray(w, w + i);
     let m = new Array(p.length);
-    p.forEach((x, $) => m[$] = { value: x, index: $ }), o < m.length && (qt(m, o), m = m.slice(0, o)), s && m.sort(et);
+    p.forEach((x, O) => m[O] = { value: x, index: O }), o < m.length && (Dt(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 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, [
-    Z(h, n, u),
-    Z(h, "int32", c)
+    B(h, n, u),
+    B(h, "int32", c)
   ];
 }
 /**
@@ -2709,14 +2710,14 @@ function Wn(t, e, n, o, s) {
  * limitations under the License.
  * =============================================================================
  */
-function kn(t, e, n, o) {
-  const s = lt(e, n)[0], r = [1, n[0], 1];
+function Nn(t, e, n, o) {
+  const s = ut(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 gt(r, o, t), c = [], h = r[0] === 1 && r[2] === 1;
+  const a = /* @__PURE__ */ new Map(), i = new Int32Array(n[s]), u = new dt(r, o, t), c = [], h = r[0] === 1 && r[2] === 1;
   for (let m = 0; m < n[s]; m++) {
     let b;
     if (h)
@@ -2724,21 +2725,21 @@ function kn(t, e, n, o) {
     else {
       const g = [];
       for (let x = 0; x < r[0]; x++)
-        for (let $ = 0; $ < r[2]; $++)
-          g.push(u.get(x, m, $));
+        for (let O = 0; O < r[2]; O++)
+          g.push(u.get(x, m, O));
       b = g.join(",");
     }
-    const d = i.get(b);
+    const d = a.get(b);
     if (d != null)
-      a[m] = d;
+      i[m] = d;
     else {
-      const g = i.size;
-      i.set(b, g), a[m] = g, c.push(m);
+      const g = a.size;
+      a.set(b, g), i[m] = g, c.push(m);
     }
   }
   const f = r.slice();
-  f[1] = i.size;
-  const w = new gt(f, o);
+  f[1] = a.size;
+  const w = new dt(f, o);
   c.forEach((m, b) => {
     for (let d = 0; d < r[0]; d++)
       for (let g = 0; g < r[2]; g++)
@@ -2748,7 +2749,7 @@ function kn(t, e, n, o) {
   return p[s] = f[1], {
     outputValues: w.values,
     outputShape: p,
-    indices: a
+    indices: i
   };
 }
 /**
@@ -2767,59 +2768,59 @@ function kn(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-const qn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const An = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  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: On,
-  sparseSegmentReductionImpl: yn,
-  sqrtImpl: Tn,
-  squaredDifferenceImpl: Vn,
-  staticRegexReplaceImpl: Ln,
-  stridedSliceImpl: Mn,
-  stringNGramsImpl: An,
-  stringSplitImpl: Dn,
-  stringToHashBucketFastImpl: zn,
-  subImpl: Pn,
-  tileImpl: Cn,
-  topKImpl: Wn,
-  transposeImpl: cn,
-  uniqueImpl: kn
+  addImpl: Le,
+  bincountImpl: _e,
+  bincountReduceImpl: Ne,
+  bitwiseAndImpl: Ae,
+  castImpl: Me,
+  ceilImpl: Pe,
+  concatImpl: De,
+  equalImpl: ze,
+  expImpl: We,
+  expm1Impl: qe,
+  floorDivImpl: ke,
+  floorImpl: Ce,
+  gatherNdImpl: Ue,
+  gatherV2Impl: Ge,
+  greaterEqualImpl: Ze,
+  greaterImpl: je,
+  lessEqualImpl: He,
+  lessImpl: Be,
+  linSpaceImpl: Ke,
+  logImpl: Xe,
+  maxImpl: Qe,
+  maximumImpl: Ye,
+  minimumImpl: Je,
+  multiplyImpl: Pt,
+  negImpl: tn,
+  notEqualImpl: en,
+  prodImpl: on,
+  raggedGatherImpl: hn,
+  raggedRangeImpl: fn,
+  raggedTensorToTensorImpl: dn,
+  rangeImpl: gn,
+  rsqrtImpl: pn,
+  scatterImpl: mn,
+  sigmoidImpl: wn,
+  simpleAbsImpl: Ve,
+  sliceImpl: In,
+  sparseFillEmptyRowsImpl: xn,
+  sparseReshapeImpl: Sn,
+  sparseSegmentReductionImpl: En,
+  sqrtImpl: bn,
+  squaredDifferenceImpl: vn,
+  staticRegexReplaceImpl: On,
+  stridedSliceImpl: Fn,
+  stringNGramsImpl: $n,
+  stringSplitImpl: Tn,
+  stringToHashBucketFastImpl: Vn,
+  subImpl: Mn,
+  tileImpl: Ln,
+  topKImpl: _n,
+  transposeImpl: nn,
+  uniqueImpl: Nn
 }, Symbol.toStringTag, { value: "Module" }));
 /**
  * @license
@@ -2837,7 +2838,7 @@ const qn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
  * limitations under the License.
  * =============================================================================
  */
-const { maxImpl: Un, transposeImpl: Gn } = qn;
+const { maxImpl: Pn, transposeImpl: Dn } = An;
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2854,16 +2855,16 @@ const { maxImpl: Un, transposeImpl: Gn } = qn;
  * limitations under the License.
  * =============================================================================
  */
-class Ot {
+class Rt {
   constructor(e, n) {
     this.variableNames = ["x"];
-    const { windowSize: o, batchSize: s, inSize: r, outSize: i } = e;
-    this.outputShape = [s, i];
-    const a = Math.floor(o / 4) * 4, u = o % 4;
+    const { windowSize: o, batchSize: s, inSize: r, outSize: a } = e;
+    this.outputShape = [s, a];
+    const i = Math.floor(o / 4) * 4, u = o % 4;
     let c = "sumValue += dot(values, ones);";
     if (n != null) {
       const f = 1 / n;
-      c = `sumValue += dot(values * ${Yt(f) ? f.toPrecision(2) : f}, ones);`;
+      c = `sumValue += dot(values * ${Bt(f) ? f.toPrecision(2) : f}, ones);`;
     }
     let h = "";
     r % o > 0 && (h = `
@@ -2886,7 +2887,7 @@ class Ot {
 
         float sumValue = 0.0;
 
-        for (int i = 0; i < ${a}; i += 4) {
+        for (int i = 0; i < ${i}; i += 4) {
           int inIdx = inOffset + i;
           vec4 values = vec4(
             getValue(batch, inIdx),
@@ -2898,7 +2899,7 @@ class Ot {
           ${c}
         }
 
-        int inIdx = inOffset + ${a};
+        int inIdx = inOffset + ${i};
         if (${u === 1}) {
           vec4 values = vec4(getValue(batch, inIdx), 0.0, 0.0, 0.0);
 
@@ -2938,13 +2939,13 @@ class Ot {
  * limitations under the License.
  * =============================================================================
  */
-class jn {
+class zn {
   constructor(e, n) {
     this.variableNames = ["x"];
-    const { windowSize: o, batchSize: s, inSize: r, outSize: i } = e;
-    this.outputShape = [s, i];
-    let a = "0.0", u = "";
-    n === "prod" ? a = "1.0" : n === "min" ? (a = "1.0 / 1e-20", u = "min") : n === "max" && (a = "-1.0 / 1e-20", u = "max");
+    const { windowSize: o, batchSize: s, inSize: r, outSize: a } = e;
+    this.outputShape = [s, a];
+    let i = "0.0", u = "";
+    n === "prod" ? i = "1.0" : n === "min" ? (i = "1.0 / 1e-20", u = "min") : n === "max" && (i = "-1.0 / 1e-20", u = "max");
     let c = `${n}(${n}(${n}(minMaxValue[0], minMaxValue[1]), minMaxValue[2]), minMaxValue[3])`;
     n === "sum" ? c = "sumValue" : n === "prod" ? c = "prodValue" : n === "all" ? c = "allValue" : n === "any" && (c = "anyValue");
     const h = Math.floor(o / 4) * 4, f = o % 4;
@@ -2965,11 +2966,11 @@ class jn {
         }
       }
     `, p = "vec4";
-    n === "all" ? (a = "1.0", w = `
+    n === "all" ? (i = "1.0", w = `
         bool reducedAllValue = all(values);
         float floatedReducedAllValue = float(reducedAllValue);
         allValue = float(allValue >= 1.0 && floatedReducedAllValue >= 1.0);
-      `, p = "bvec4") : n === "any" && (a = "0.0", w = `
+      `, p = "bvec4") : n === "any" && (i = "0.0", w = `
         bool reducedAnyValue = any(values);
         float floatedReducedAnyValue = float(reducedAnyValue);
         anyValue = float(anyValue >= 1.0 || floatedReducedAnyValue >= 1.0);
@@ -2980,7 +2981,7 @@ class jn {
           return initializationValue;
         }
       `), this.userCode = `
-      const float initializationValue = ${a};
+      const float initializationValue = ${i};
       const vec4 ones = vec4(1.0, 1.0, 1.0, 1.0);
 
       float getValue(int batch, int inIdx) {
@@ -2994,7 +2995,7 @@ class jn {
         int outIdx = coords[1];
         int inOffset = outIdx * ${o};
 
-        vec4 minMaxValue = vec4(${a});
+        vec4 minMaxValue = vec4(${i});
         float prodValue = 1.0;
         float sumValue = 0.0;
         float allValue = 1.0;
@@ -3062,10 +3063,10 @@ class jn {
  * limitations under the License.
  * =============================================================================
  */
-function Bn(t) {
+function Wn(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 = Re(n);
+    const n = e.length ? e[e.length - 1].outSize : t[1], o = Ie(n);
     e.push({
       inSize: n,
       windowSize: o,
@@ -3074,171 +3075,16 @@ function Bn(t) {
   }
   return e;
 }
-function Ut(t, e, n, o) {
-  const s = Bn(t.shape);
+function zt(t, e, n, o) {
+  const s = Wn(t.shape);
   let r = t;
-  for (let i = 0; i < s.length; i++) {
-    const { inSize: a, windowSize: u, outSize: c } = s[i];
+  for (let a = 0; a < s.length; a++) {
+    const { inSize: i, windowSize: u, outSize: c } = s[a];
     let h, 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);
+    n === "mean" ? h = a === 0 ? new Rt({ windowSize: u, inSize: i, batchSize: t.shape[0], outSize: c }, i) : new Rt({ windowSize: u, inSize: i, batchSize: t.shape[0], outSize: c }) : h = new zn({ windowSize: u, inSize: i, batchSize: t.shape[0], outSize: c }, n), f = r, r = o.runWebGLProgram(h, [r], e), f.dataId !== t.dataId && o.disposeIntermediateTensorInfo(f);
   }
   return r;
 }
-/**
- * @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 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 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 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 Xn(t) {
-  const e = K(t).map((n) => n.toString());
-  return `
-  int getFlatIndex(ivec3 coords) {
-    return coords.x * ${e[0]} + coords.y * ${e[1]} + coords.z;
-  }
-`;
-}
-function Yn() {
-  return `
-  int getFlatIndex(ivec3 coords) {
-    return coords.x * outShapeStrides[0] + coords.y * outShapeStrides[1] + coords.z;
-  }
-`;
-}
-/**
- * @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 yt(t, e = 2) {
-  return O(t.slice(0, t.length - e));
-}
-function Tt(t) {
-  if (t.length === 0)
-    throw Error("Cannot get rows and columns of an empty shape array.");
-  return [
-    t.length > 1 ? t[t.length - 2] : 1,
-    t[t.length - 1]
-  ];
-}
-function at(t) {
-  return t % 2 === 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];
-    if (n === o || at(n) && at(o) && (t[0] === 1 || e[0] === 1))
-      return !0;
-  }
-  return t[1] === e[1] && at(t[0]) && at(e[0]);
-}
-/**
- * @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 Jn {
-  constructor(e, n) {
-    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;";
-      s % 2 === 1 && (r += "thisRC.z += 1;"), s > 1 && (r += "thisRC.y += 1;"), o += `
-        ${r}
-        ${s > 0 ? "if(thisRC.y < rows && thisRC.z < cols){" : ""}
-          int flatIndex = getFlatIndex(thisRC);
-
-          ivec3 inputRC = inputCoordsFromReshapedOutCoords(flatIndex);
-          vec2 inputRCInnerDims = vec2(float(inputRC.y),float(inputRC.z));
-
-          result[${s}] =
-            getChannel(getA(inputRC.x, inputRC.y, inputRC.z), inputRCInnerDims);
-        ${s > 0 ? "}" : ""}
-      `;
-    }
-    this.userCode = `
-      ${Qn(n, this.enableShapeUniforms)}
-      ${this.enableShapeUniforms ? Yn() : Xn(e)}
-
-      void main() {
-        ivec3 rc = getOutputCoords();
-
-        vec4 result = vec4(0.);
-
-        ivec3 thisRC;
-        int rows = ${this.enableShapeUniforms ? "outShape[1]" : e[1]};
-        int cols = ${this.enableShapeUniforms ? "outShape[2]" : e[2]};
-
-        ${o}
-
-        setOutput(result);
-      }
-    `;
-  }
-}
-function Qn(t, e) {
-  return `
-    ivec3 inputCoordsFromReshapedOutCoords(int index) {
-      ${e ? Kn(["r", "c", "d"], "inputShape") : Zn(["r", "c", "d"], t)}
-      return ivec3(r, c, d);
-    }
-  `;
-}
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -3255,61 +3101,9 @@ function Qn(t, e) {
  * limitations under the License.
  * =============================================================================
  */
-function to(t, e, n) {
-  const o = [
-    yt(t.shape),
-    ...Tt(t.shape)
-  ], s = {
-    dtype: t.dtype,
-    shape: o,
-    dataId: t.dataId
-  }, r = [
-    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 };
-}
-/**
- * @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 st(t) {
-  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 && !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
- * 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 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;
+function qn(t, e, n, o) {
+  const s = y(e), a = y(t.shape) / s, i = st({ inputs: { x: t }, attrs: { shape: [a, s] }, backend: o }), u = zt(i, t.dtype, "max", o), c = st({ inputs: { x: u }, attrs: { shape: n }, backend: o });
+  return o.disposeIntermediateTensorInfo(i), o.disposeIntermediateTensorInfo(u), c;
 }
 /**
  * @license
@@ -3327,14 +3121,14 @@ function eo(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-class no {
+class Cn {
   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]];
+    for (let a = 0; a < o.length; a++)
+      o[a] = e[n[a]];
     this.outputShape = o, this.rank = o.length;
-    const s = _t(this.rank), r = oo(n);
+    const s = yt(this.rank), r = kn(n);
     this.userCode = `
     void main() {
       ${s} resRC = getOutputCoords();
@@ -3343,7 +3137,7 @@ class no {
     `;
   }
 }
-function oo(t) {
+function kn(t) {
   const e = t.length;
   if (e > 6)
     throw Error(`Transpose for rank ${e} is not yet supported`);
@@ -3368,7 +3162,7 @@ function oo(t) {
  * limitations under the License.
  * =============================================================================
  */
-class so {
+class Un {
   constructor(e, n) {
     this.variableNames = ["A"], this.packedInputs = !0, this.packedOutput = !0;
     const o = new Array(e.length);
@@ -3376,10 +3170,10 @@ class so {
       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 = _t(this.rank), r = re("rc", this.rank), i = new Array(this.rank);
+    const s = yt(this.rank), r = Yt("rc", this.rank), a = 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})`;
+      a[n[h]] = r[h];
+    const i = `vec2(${a.slice(-2).join()})`, u = `++${r[this.rank - 1]} < ${o[this.rank - 1]}`, c = `getChannel(getA(${a.join()}), ${i})`;
     this.userCode = `
     void main() {
       ${s} rc = getOutputCoords();
@@ -3416,8 +3210,8 @@ class so {
  * limitations under the License.
  * =============================================================================
  */
-function Gt(t, e, n) {
-  const o = te().getBool("WEBGL_PACK_ARRAY_OPERATIONS") ? new so(t.shape, e) : new no(t.shape, e);
+function Wt(t, e, n) {
+  const o = Ht().getBool("WEBGL_PACK_ARRAY_OPERATIONS") ? new Un(t.shape, e) : new Cn(t.shape, e);
   return n.runWebGLProgram(o, [t], t.dtype);
 }
 /**
@@ -3436,36 +3230,36 @@ function Gt(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-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);
+function Gn(t) {
+  const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { reductionIndices: r, keepDims: a } = o, i = s.shape.length, u = ut(r, s.shape);
   let c = u;
-  const h = At(c, a), f = h != null, w = n.shouldExecuteOnCPU([s]);
+  const h = Tt(c, i), 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 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 z = n.texData.get(p.dataId);
-      z.values = V;
+      const O = n.texData.get(p.dataId).values, v = new Array(i);
+      for (let L = 0; L < v.length; L++)
+        v[L] = s.shape[h[L]];
+      const V = Dn(O, s.shape, s.dtype, h, v);
+      p = n.makeTensorInfo(v, s.dtype);
+      const D = n.texData.get(p.dataId);
+      D.values = V;
     } else
-      p = Gt(s, h, n);
-    c = Nt(c.length, a);
+      p = Wt(s, h, n);
+    c = Vt(c.length, i);
   }
-  Dt("max", c, a);
-  const [m, b] = wt(p.shape, c);
+  Mt("max", c, i);
+  const [m, b] = mt(p.shape, c);
   let d = m;
-  i && (d = It(m, u));
+  a && (d = wt(m, u));
   let g;
   if (w) {
-    const $ = n.texData.get(p.dataId).values, E = Un($, O(b), d, s.dtype);
+    const O = n.texData.get(p.dataId).values, v = Pn(O, y(b), d, s.dtype);
     g = n.makeTensorInfo(d, s.dtype);
     const V = n.texData.get(g.dataId);
-    V.values = E;
+    V.values = v;
   } else
-    g = eo(p, b, d, n);
+    g = qn(p, b, d, n);
   return f && n.disposeIntermediateTensorInfo(p), g;
 }
 /**
@@ -3484,17 +3278,17 @@ function ro(t) {
  * limitations under the License.
  * =============================================================================
  */
-function io(t, e, n, o) {
-  const s = e, r = t.shape.length, i = lt(s, t.shape);
-  let a = i;
-  const u = At(a, r), c = u != null;
+function jn(t, e, n, o) {
+  const s = e, r = t.shape.length, a = ut(s, t.shape);
+  let i = a;
+  const u = Tt(i, r), c = u != null;
   let h = t;
-  c && (h = Gt(t, u, o), a = Nt(a.length, r)), Dt("sum", a, r);
-  const [f, w] = wt(h.shape, a);
+  c && (h = Wt(t, u, o), i = Vt(i.length, r)), Mt("sum", i, r);
+  const [f, w] = mt(h.shape, i);
   let p = f;
-  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;
+  n && (p = wt(f, a));
+  const m = y(w), d = y(t.shape) / m, g = st({ inputs: { x: h }, attrs: { shape: [d, m] }, backend: o }), x = Kt(t.dtype), O = zt(g, x, "sum", o), v = st({ inputs: { x: O }, attrs: { shape: p }, backend: o });
+  return o.disposeIntermediateTensorInfo(g), o.disposeIntermediateTensorInfo(O), c && o.disposeIntermediateTensorInfo(h), v;
 }
 /**
  * @license
@@ -3512,9 +3306,9 @@ function io(t, e, n, o) {
  * limitations under the License.
  * =============================================================================
  */
-function ao(t) {
-  const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { axis: r, keepDims: i } = o;
-  return io(s, r, i, n);
+function Zn(t) {
+  const { inputs: e, backend: n, attrs: o } = t, { x: s } = e, { axis: r, keepDims: a } = o;
+  return jn(s, r, a, n);
 }
 /**
  * @license
@@ -3532,11 +3326,11 @@ function ao(t) {
  * limitations under the License.
  * =============================================================================
  */
-const uo = `
+const Bn = `
 if (a == b) {
   return 1.0;
 };
-return a / b;`, lo = `
+return a / b;`, Hn = `
   // vec4 one = vec4(equal(a, b));
   // return one + (vec4(1.0) - one) * a / b;
   vec4 result = a / b;
@@ -3554,8 +3348,8 @@ return a / b;`, lo = `
   }
 
   return result;
-`, co = ie({ opSnippet: uo, packedOpSnippet: lo, checkOutOfBounds: !0 });
-class ho {
+`, Kn = Jt({ opSnippet: Bn, packedOpSnippet: Hn, checkOutOfBounds: !0 });
+class Xn {
   variableNames = ["logits", "maxLogits"];
   outputShape;
   userCode;
@@ -3574,7 +3368,7 @@ class ho {
         `;
   }
 }
-class fo {
+class Qn {
   variableNames = ["exp", "sum"];
   outputShape;
   userCode;
@@ -3601,31 +3395,31 @@ class fo {
         `;
   }
 }
-function go(t) {
-  const { inputs: e, attrs: n } = t, { logits: o } = e, { dim: s, dropoutRate: r, seed: i } = n, a = t.backend;
+function Yn(t) {
+  const { inputs: e, attrs: n } = t, { logits: o } = e, { dim: s, dropoutRate: r, seed: a } = n, i = t.backend;
   if (!o)
     throw new Error("Error in softmax: input logits is null");
-  const u = lt([s], o.shape), c = ro({
+  const u = ut([s], o.shape), c = Gn({
     inputs: { x: o },
-    backend: a,
+    backend: i,
     attrs: { reductionIndices: u, keepDims: !1 }
-  }), 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 } });
+  }), h = wt(c.shape, u), f = new Xn(o.shape), w = i.runWebGLProgram(f, [o, c], "float32"), p = Zn({ inputs: { x: w }, backend: i, attrs: { axis: u, keepDims: !1 } }), m = st({ inputs: { x: p }, backend: i, attrs: { shape: h } });
   if (r !== void 0 && r > 0) {
-    const d = new fo(o.shape), g = a.runWebGLProgram(d, [w, m], "float32", [
+    const d = new Qn(o.shape), g = i.runWebGLProgram(d, [w, m], "float32", [
       [r],
-      [i ?? Math.random() * 1e4]
+      [a ?? Math.random() * 1e4]
     ]);
-    return a.disposeIntermediateTensorInfo(c), a.disposeIntermediateTensorInfo(w), a.disposeIntermediateTensorInfo(p), a.disposeIntermediateTensorInfo(m), g;
+    return i.disposeIntermediateTensorInfo(c), i.disposeIntermediateTensorInfo(w), i.disposeIntermediateTensorInfo(p), i.disposeIntermediateTensorInfo(m), g;
   }
-  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 b = Kn({ inputs: { a: w, b: m }, backend: i });
+  return i.disposeIntermediateTensorInfo(c), i.disposeIntermediateTensorInfo(w), i.disposeIntermediateTensorInfo(p), i.disposeIntermediateTensorInfo(m), b;
 }
-const po = {
+const Jn = {
   kernelName: "FusedSoftmax",
   backendName: "webgl",
-  kernelFunc: go
+  kernelFunc: Yn
 };
-ne(po);
+Xt(Jn);
 export {
-  go as softmax
+  Yn as softmax
 };