@genai-fi/nanogpt 0.6.3 → 0.7.1

package/dist/{shared-Ca6iDobD.js → shared-Czipaeb6.js}

@@ -1,11 +1,11 @@
-import { i as qt, bc as _e, g as A, h as Ut, W as K, bd as et, aH as ht, be as gt, bf as at, _ as Ve, $ as st, ak as De, a$ as We, bg as $e, bh as ze, bi as Be, bj as Mt, ah as H, bk as Ot, bl as D, bm as Lt, bn as At, a8 as _t, bo as Vt, ag as Dt, bp as Wt, aT as $t, aU as zt, aW as Bt, aX as Gt, a9 as jt, bq as Zt, a_ as Ht, br as Kt, aY as Ge, am as je, bs as Xt, b2 as Ze, bt as He, p as Yt, u as Ke, t as Xe, bu as Jt, bv as wt, ap as Qt, aO as Ye, bw as te, bx as ee, by as ne, aG as pt, bz as se, bA as ot } from "./index-BAzbokzv.js";
-import { h as it, m as kt, k as Je, l as Qe, R as tn, v as en, n as nn, o as sn, p as on, q as rn, r as an, s as ln, t as cn, w as un, x as hn, y as fn, z as Nt, A as gn, B as dn, C as mn } from "./gpgpu_math-CNslybmD.js";
-import { g as pn, a as In, e as wn, c as bn } from "./axis_util-Bu4h7XWV.js";
-import { b as xn } from "./broadcast_to-DARN-DBD.js";
-import { r as En } from "./reshape-krWGKraP.js";
-import { p as Fn, q as yn, r as kn, u as Nn } from "./selu_util-sntGesxr.js";
-import { g as Sn } from "./_commonjsHelpers-ByX85dGu.js";
-function vn(e, t) {
+import { l as Lt, bf as Ce, j as V, k as Pt, a1 as H, bg as et, aa as ht, bh as dt, bi as at, a6 as De, a7 as st, am as We, b2 as $e, bj as Ue, bk as ze, bl as Be, bm as qt, al as K, bn as At, bo as W, bp as _t, bq as Vt, ae as Ct, br as Dt, ak as Wt, bs as $t, aW as Ut, aX as zt, aZ as Bt, a_ as jt, af as Gt, bt as Zt, b1 as Kt, bu as Ht, a$ as je, ao as Ge, bv as Xt, b5 as Ze, bw as Ke, p as Jt, u as He, t as Xe, bx as Qt, by as It, ar as Yt, W as Je, bz as te, bA as ee, bB as ne, aM as pt, bC as se, bD as ot } from "./index-UdZhlibC.js";
+import { f as it, m as kt, g as Qe, a as Ye, R as tn, v as en, d as nn, e as sn, h as on, i as rn, j as an, k as ln, l as cn, n as un, o as hn, p as fn, q as Nt, r as dn, s as gn, t as mn } from "./backend_util-C9Ut8n0Q.js";
+import { g as pn, a as wn, e as In, c as bn } from "./axis_util-5DTW2tFV.js";
+import { b as xn } from "./broadcast_to-Ba9h_8DO.js";
+import { r as En } from "./reshape-BR0eoLYN.js";
+import { p as Fn, q as yn, r as kn, u as Nn } from "./selu_util-Ce6pu9IM.js";
+import { g as vn } from "./_commonjsHelpers-ByX85dGu.js";
+function Sn(e, t) {
   for (var n = 0; n < t.length; n++) {
     const s = t[n];
     if (typeof s != "string" && !Array.isArray(s)) {
@@ -21,10 +21,10 @@ function vn(e, t) {
   }
   return Object.freeze(Object.defineProperty(e, Symbol.toStringTag, { value: "Module" }));
 }
-var It, St;
+var wt, vt;
 function Tn() {
-  if (St) return It;
-  St = 1, It = t;
+  if (vt) return wt;
+  vt = 1, wt = t;
   var e = null;
   try {
     e = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
@@ -317,108 +317,108 @@ function Tn() {
     ])), {}).exports;
   } catch {
   }
-  function t(w, c, E) {
-    this.low = w | 0, this.high = c | 0, this.unsigned = !!E;
+  function t(I, c, E) {
+    this.low = I | 0, this.high = c | 0, this.unsigned = !!E;
   }
   t.prototype.__isLong__, Object.defineProperty(t.prototype, "__isLong__", { value: !0 });
-  function n(w) {
-    return (w && w.__isLong__) === !0;
+  function n(I) {
+    return (I && I.__isLong__) === !0;
   }
   t.isLong = n;
   var s = {}, o = {};
-  function a(w, c) {
-    var E, N, q;
-    return c ? (w >>>= 0, (q = 0 <= w && w < 256) && (N = o[w], N) ? N : (E = i(w, (w | 0) < 0 ? -1 : 0, !0), q && (o[w] = E), E)) : (w |= 0, (q = -128 <= w && w < 128) && (N = s[w], N) ? N : (E = i(w, w < 0 ? -1 : 0, !1), q && (s[w] = E), E));
+  function a(I, c) {
+    var E, N, L;
+    return c ? (I >>>= 0, (L = 0 <= I && I < 256) && (N = o[I], N) ? N : (E = i(I, (I | 0) < 0 ? -1 : 0, !0), L && (o[I] = E), E)) : (I |= 0, (L = -128 <= I && I < 128) && (N = s[I], N) ? N : (E = i(I, I < 0 ? -1 : 0, !1), L && (s[I] = E), E));
   }
   t.fromInt = a;
-  function r(w, c) {
-    if (isNaN(w))
-      return c ? b : d;
+  function r(I, c) {
+    if (isNaN(I))
+      return c ? b : g;
     if (c) {
-      if (w < 0)
+      if (I < 0)
         return b;
-      if (w >= m)
-        return C;
+      if (I >= m)
+        return O;
     } else {
-      if (w <= -F)
-        return v;
-      if (w + 1 >= F)
-        return P;
+      if (I <= -F)
+        return S;
+      if (I + 1 >= F)
+        return M;
     }
-    return w < 0 ? r(-w, c).neg() : i(w % I | 0, w / I | 0, c);
+    return I < 0 ? r(-I, c).neg() : i(I % w | 0, I / w | 0, c);
   }
   t.fromNumber = r;
-  function i(w, c, E) {
-    return new t(w, c, E);
+  function i(I, c, E) {
+    return new t(I, c, E);
   }
   t.fromBits = i;
   var l = Math.pow;
-  function u(w, c, E) {
-    if (w.length === 0)
+  function u(I, c, E) {
+    if (I.length === 0)
       throw Error("empty string");
-    if (w === "NaN" || w === "Infinity" || w === "+Infinity" || w === "-Infinity")
-      return d;
+    if (I === "NaN" || I === "Infinity" || I === "+Infinity" || I === "-Infinity")
+      return g;
     if (typeof c == "number" ? (E = c, c = !1) : c = !!c, E = E || 10, E < 2 || 36 < E)
       throw RangeError("radix");
     var N;
-    if ((N = w.indexOf("-")) > 0)
+    if ((N = I.indexOf("-")) > 0)
       throw Error("interior hyphen");
     if (N === 0)
-      return u(w.substring(1), c, E).neg();
-    for (var q = r(l(E, 8)), R = d, M = 0; M < w.length; M += 8) {
-      var $ = Math.min(8, w.length - M), G = parseInt(w.substring(M, M + $), E);
-      if ($ < 8) {
-        var _ = r(l(E, $));
-        R = R.mul(_).add(r(G));
+      return u(I.substring(1), c, E).neg();
+    for (var L = r(l(E, 8)), R = g, q = 0; q < I.length; q += 8) {
+      var U = Math.min(8, I.length - q), j = parseInt(I.substring(q, q + U), E);
+      if (U < 8) {
+        var C = r(l(E, U));
+        R = R.mul(C).add(r(j));
       } else
-        R = R.mul(q), R = R.add(r(G));
+        R = R.mul(L), R = R.add(r(j));
     }
     return R.unsigned = c, R;
   }
   t.fromString = u;
-  function h(w, c) {
-    return typeof w == "number" ? r(w, c) : typeof w == "string" ? u(w, c) : i(w.low, w.high, typeof c == "boolean" ? c : w.unsigned);
+  function h(I, c) {
+    return typeof I == "number" ? r(I, c) : typeof I == "string" ? u(I, c) : i(I.low, I.high, typeof c == "boolean" ? c : I.unsigned);
   }
   t.fromValue = h;
-  var f = 65536, p = 1 << 24, I = f * f, m = I * I, F = m / 2, g = a(p), d = a(0);
-  t.ZERO = d;
+  var f = 65536, p = 1 << 24, w = f * f, m = w * w, F = m / 2, d = a(p), g = a(0);
+  t.ZERO = g;
   var b = a(0, !0);
   t.UZERO = b;
   var k = a(1);
   t.ONE = k;
   var y = a(1, !0);
   t.UONE = y;
-  var S = a(-1);
-  t.NEG_ONE = S;
-  var P = i(-1, 2147483647, !1);
-  t.MAX_VALUE = P;
-  var C = i(-1, -1, !0);
-  t.MAX_UNSIGNED_VALUE = C;
-  var v = i(0, -2147483648, !1);
-  t.MIN_VALUE = v;
+  var v = a(-1);
+  t.NEG_ONE = v;
+  var M = i(-1, 2147483647, !1);
+  t.MAX_VALUE = M;
+  var O = i(-1, -1, !0);
+  t.MAX_UNSIGNED_VALUE = O;
+  var S = i(0, -2147483648, !1);
+  t.MIN_VALUE = S;
   var x = t.prototype;
   return x.toInt = function() {
     return this.unsigned ? this.low >>> 0 : this.low;
   }, x.toNumber = function() {
-    return this.unsigned ? (this.high >>> 0) * I + (this.low >>> 0) : this.high * I + (this.low >>> 0);
+    return this.unsigned ? (this.high >>> 0) * w + (this.low >>> 0) : this.high * w + (this.low >>> 0);
   }, x.toString = function(c) {
     if (c = c || 10, c < 2 || 36 < c)
       throw RangeError("radix");
     if (this.isZero())
       return "0";
     if (this.isNegative())
-      if (this.eq(v)) {
-        var E = r(c), N = this.div(E), q = N.mul(E).sub(this);
-        return N.toString(c) + q.toInt().toString(c);
+      if (this.eq(S)) {
+        var E = r(c), N = this.div(E), L = N.mul(E).sub(this);
+        return N.toString(c) + L.toInt().toString(c);
       } else
         return "-" + this.neg().toString(c);
-    for (var R = r(l(c, 6), this.unsigned), M = this, $ = ""; ; ) {
-      var G = M.div(R), _ = M.sub(G.mul(R)).toInt() >>> 0, U = _.toString(c);
-      if (M = G, M.isZero())
-        return U + $;
-      for (; U.length < 6; )
-        U = "0" + U;
-      $ = "" + U + $;
+    for (var R = r(l(c, 6), this.unsigned), q = this, U = ""; ; ) {
+      var j = q.div(R), C = q.sub(j.mul(R)).toInt() >>> 0, P = C.toString(c);
+      if (q = j, q.isZero())
+        return P + U;
+      for (; P.length < 6; )
+        P = "0" + P;
+      U = "" + P + U;
     }
   }, x.getHighBits = function() {
     return this.high;
@@ -430,7 +430,7 @@ function Tn() {
     return this.low >>> 0;
   }, x.getNumBitsAbs = function() {
     if (this.isNegative())
-      return this.eq(v) ? 64 : this.neg().getNumBitsAbs();
+      return this.eq(S) ? 64 : this.neg().getNumBitsAbs();
     for (var c = this.high != 0 ? this.high : this.low, E = 31; E > 0 && (c & 1 << E) == 0; E--)
       ;
     return this.high != 0 ? E + 33 : E + 1;
@@ -477,16 +477,16 @@ function Tn() {
     var E = this.isNegative(), N = c.isNegative();
     return E && !N ? -1 : !E && N ? 1 : this.unsigned ? c.high >>> 0 > this.high >>> 0 || c.high === this.high && c.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(c).isNegative() ? -1 : 1;
   }, x.comp = x.compare, x.negate = function() {
-    return !this.unsigned && this.eq(v) ? v : this.not().add(k);
+    return !this.unsigned && this.eq(S) ? S : this.not().add(k);
   }, x.neg = x.negate, x.add = function(c) {
     n(c) || (c = h(c));
-    var E = this.high >>> 16, N = this.high & 65535, q = this.low >>> 16, R = this.low & 65535, M = c.high >>> 16, $ = c.high & 65535, G = c.low >>> 16, _ = c.low & 65535, U = 0, j = 0, L = 0, B = 0;
-    return B += R + _, L += B >>> 16, B &= 65535, L += q + G, j += L >>> 16, L &= 65535, j += N + $, U += j >>> 16, j &= 65535, U += E + M, U &= 65535, i(L << 16 | B, U << 16 | j, this.unsigned);
+    var E = this.high >>> 16, N = this.high & 65535, L = this.low >>> 16, R = this.low & 65535, q = c.high >>> 16, U = c.high & 65535, j = c.low >>> 16, C = c.low & 65535, P = 0, G = 0, _ = 0, B = 0;
+    return B += R + C, _ += B >>> 16, B &= 65535, _ += L + j, G += _ >>> 16, _ &= 65535, G += N + U, P += G >>> 16, G &= 65535, P += E + q, P &= 65535, i(_ << 16 | B, P << 16 | G, this.unsigned);
   }, x.subtract = function(c) {
     return n(c) || (c = h(c)), this.add(c.neg());
   }, x.sub = x.subtract, x.multiply = function(c) {
     if (this.isZero())
-      return d;
+      return g;
     if (n(c) || (c = h(c)), e) {
       var E = e.mul(
         this.low,
@@ -497,19 +497,19 @@ function Tn() {
       return i(E, e.get_high(), this.unsigned);
     }
     if (c.isZero())
-      return d;
-    if (this.eq(v))
-      return c.isOdd() ? v : d;
-    if (c.eq(v))
-      return this.isOdd() ? v : d;
+      return g;
+    if (this.eq(S))
+      return c.isOdd() ? S : g;
+    if (c.eq(S))
+      return this.isOdd() ? S : g;
     if (this.isNegative())
       return c.isNegative() ? this.neg().mul(c.neg()) : this.neg().mul(c).neg();
     if (c.isNegative())
       return this.mul(c.neg()).neg();
-    if (this.lt(g) && c.lt(g))
+    if (this.lt(d) && c.lt(d))
       return r(this.toNumber() * c.toNumber(), this.unsigned);
-    var N = this.high >>> 16, q = this.high & 65535, R = this.low >>> 16, M = this.low & 65535, $ = c.high >>> 16, G = c.high & 65535, _ = c.low >>> 16, U = c.low & 65535, j = 0, L = 0, B = 0, ct = 0;
-    return ct += M * U, B += ct >>> 16, ct &= 65535, B += R * U, L += B >>> 16, B &= 65535, B += M * _, L += B >>> 16, B &= 65535, L += q * U, j += L >>> 16, L &= 65535, L += R * _, j += L >>> 16, L &= 65535, L += M * G, j += L >>> 16, L &= 65535, j += N * U + q * _ + R * G + M * $, j &= 65535, i(B << 16 | ct, j << 16 | L, this.unsigned);
+    var N = this.high >>> 16, L = this.high & 65535, R = this.low >>> 16, q = this.low & 65535, U = c.high >>> 16, j = c.high & 65535, C = c.low >>> 16, P = c.low & 65535, G = 0, _ = 0, B = 0, ct = 0;
+    return ct += q * P, B += ct >>> 16, ct &= 65535, B += R * P, _ += B >>> 16, B &= 65535, B += q * C, _ += B >>> 16, B &= 65535, _ += L * P, G += _ >>> 16, _ &= 65535, _ += R * C, G += _ >>> 16, _ &= 65535, _ += q * j, G += _ >>> 16, _ &= 65535, G += N * P + L * C + R * j + q * U, G &= 65535, i(B << 16 | ct, G << 16 | _, this.unsigned);
   }, x.mul = x.multiply, x.divide = function(c) {
     if (n(c) || (c = h(c)), c.isZero())
       throw Error("division by zero");
@@ -525,8 +525,8 @@ function Tn() {
       return i(E, e.get_high(), this.unsigned);
     }
     if (this.isZero())
-      return this.unsigned ? b : d;
-    var N, q, R;
+      return this.unsigned ? b : g;
+    var N, L, R;
     if (this.unsigned) {
       if (c.unsigned || (c = c.toUnsigned()), c.gt(this))
         return b;
@@ -534,26 +534,26 @@ function Tn() {
         return y;
       R = b;
     } else {
-      if (this.eq(v)) {
-        if (c.eq(k) || c.eq(S))
-          return v;
-        if (c.eq(v))
+      if (this.eq(S)) {
+        if (c.eq(k) || c.eq(v))
+          return S;
+        if (c.eq(S))
           return k;
-        var M = this.shr(1);
-        return N = M.div(c).shl(1), N.eq(d) ? c.isNegative() ? k : S : (q = this.sub(c.mul(N)), R = N.add(q.div(c)), R);
-      } else if (c.eq(v))
-        return this.unsigned ? b : d;
+        var q = this.shr(1);
+        return N = q.div(c).shl(1), N.eq(g) ? c.isNegative() ? k : v : (L = this.sub(c.mul(N)), R = N.add(L.div(c)), R);
+      } else if (c.eq(S))
+        return this.unsigned ? b : g;
       if (this.isNegative())
         return c.isNegative() ? this.neg().div(c.neg()) : this.neg().div(c).neg();
       if (c.isNegative())
         return this.div(c.neg()).neg();
-      R = d;
+      R = g;
     }
-    for (q = this; q.gte(c); ) {
-      N = Math.max(1, Math.floor(q.toNumber() / c.toNumber()));
-      for (var $ = Math.ceil(Math.log(N) / Math.LN2), G = $ <= 48 ? 1 : l(2, $ - 48), _ = r(N), U = _.mul(c); U.isNegative() || U.gt(q); )
-        N -= G, _ = r(N, this.unsigned), U = _.mul(c);
-      _.isZero() && (_ = k), R = R.add(_), q = q.sub(U);
+    for (L = this; L.gte(c); ) {
+      N = Math.max(1, Math.floor(L.toNumber() / c.toNumber()));
+      for (var U = Math.ceil(Math.log(N) / Math.LN2), j = U <= 48 ? 1 : l(2, U - 48), C = r(N), P = C.mul(c); P.isNegative() || P.gt(L); )
+        N -= j, C = r(N, this.unsigned), P = C.mul(c);
+      C.isZero() && (C = k), R = R.add(C), L = L.sub(P);
     }
     return R;
   }, x.div = x.divide, x.modulo = function(c) {
@@ -631,10 +631,10 @@ function Tn() {
       c[0] << 24 | c[1] << 16 | c[2] << 8 | c[3],
       E
     );
-  }, It;
+  }, wt;
 }
 var oe = Tn();
-const re = /* @__PURE__ */ Sn(oe), Rn = /* @__PURE__ */ vn({
+const re = /* @__PURE__ */ vn(oe), Rn = /* @__PURE__ */ Sn({
   __proto__: null,
   default: re
 }, [oe]);
@@ -658,10 +658,10 @@ const tt = (
   // tslint:disable-next-line
   re || Rn
 );
-function dt(e) {
+function gt(e) {
   return tt.fromString(e, !0, 16);
 }
-const ae = dt("c3a5c85c97cb3127"), Q = dt("b492b66fbe98f273"), V = dt("9ae16a3b2f90404f");
+const ae = gt("c3a5c85c97cb3127"), Y = gt("b492b66fbe98f273"), D = gt("9ae16a3b2f90404f");
 function bt(e) {
   return e.xor(e.shru(47));
 }
@@ -672,64 +672,64 @@ function ie(e, t, n) {
 function T(e, t) {
   return ie(e, t, 8);
 }
-function vt(e, t) {
+function St(e, t) {
   return ie(e, t, 4);
 }
-function O(e, t) {
+function A(e, t) {
   return t === 0 ? e : e.shru(t).or(e.shl(64 - t));
 }
-function Y(e, t, n = dt("9ddfea08eb382d69")) {
+function J(e, t, n = gt("9ddfea08eb382d69")) {
   let s = e.xor(t).mul(n);
   s = s.xor(s.shru(47));
   let o = t.xor(s).mul(n);
   return o = o.xor(o.shru(47)), o = o.mul(n), o;
 }
-function Pn(e, t, n, s, o, a) {
-  o = o.add(e), a = O(a.add(o).add(s), 21);
+function Mn(e, t, n, s, o, a) {
+  o = o.add(e), a = A(a.add(o).add(s), 21);
   const r = o;
-  return o = o.add(t), o = o.add(n), a = a.add(O(o, 44)), [o.add(s), a.add(r)];
+  return o = o.add(t), o = o.add(n), a = a.add(A(o, 44)), [o.add(s), a.add(r)];
 }
 function ut(e, t, n, s) {
-  return Pn(T(e, t), T(e, t + 8), T(e, t + 16), T(e, t + 24), n, s);
+  return Mn(T(e, t), T(e, t + 8), T(e, t + 16), T(e, t + 24), n, s);
 }
-function Cn(e, t = e.length) {
+function On(e, t = e.length) {
   if (t >= 8) {
-    const n = V.add(t * 2), s = T(e, 0).add(V), o = T(e, t - 8), a = O(o, 37).mul(n).add(s), r = O(s, 25).add(o).mul(n);
-    return Y(a, r, n);
+    const n = D.add(t * 2), s = T(e, 0).add(D), o = T(e, t - 8), a = A(o, 37).mul(n).add(s), r = A(s, 25).add(o).mul(n);
+    return J(a, r, n);
   }
   if (t >= 4) {
-    const n = V.add(t * 2), s = vt(e, 0);
-    return Y(s.shl(3).add(t), vt(e, t - 4), n);
+    const n = D.add(t * 2), s = St(e, 0);
+    return J(s.shl(3).add(t), St(e, t - 4), n);
   }
   if (t > 0) {
     const n = e[0], s = e[t >> 1], o = e[t - 1], a = n + (s << 8), r = t + (o << 2);
-    return bt(V.mul(a).xor(ae.mul(r))).mul(V);
+    return bt(D.mul(a).xor(ae.mul(r))).mul(D);
   }
-  return V;
+  return D;
 }
-function qn(e, t = e.length) {
-  const n = V.add(t * 2), s = T(e, 0).mul(Q), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(V);
-  return Y(O(s.add(o), 43).add(O(a, 30)).add(r), s.add(O(o.add(V), 18)).add(a), n);
+function Ln(e, t = e.length) {
+  const n = D.add(t * 2), s = T(e, 0).mul(Y), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(D);
+  return J(A(s.add(o), 43).add(A(a, 30)).add(r), s.add(A(o.add(D), 18)).add(a), n);
 }
-function Un(e, t = e.length) {
-  const n = V.add(t * 2), s = T(e, 0).mul(V), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(V), i = O(s.add(o), 43).add(O(a, 30)).add(r), l = Y(i, s.add(O(o.add(V), 18)).add(a), n), u = T(e, 16).mul(n), h = T(e, 24), f = i.add(T(e, t - 32)).mul(n), p = l.add(T(e, t - 24)).mul(n);
-  return Y(O(u.add(h), 43).add(O(f, 30)).add(p), u.add(O(h.add(s), 18)).add(f), n);
+function Pn(e, t = e.length) {
+  const n = D.add(t * 2), s = T(e, 0).mul(D), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(D), i = A(s.add(o), 43).add(A(a, 30)).add(r), l = J(i, s.add(A(o.add(D), 18)).add(a), n), u = T(e, 16).mul(n), h = T(e, 24), f = i.add(T(e, t - 32)).mul(n), p = l.add(T(e, t - 24)).mul(n);
+  return J(A(u.add(h), 43).add(A(f, 30)).add(p), u.add(A(h.add(s), 18)).add(f), n);
 }
-function Mn(e, t = e.length) {
+function qn(e, t = e.length) {
   const n = tt.fromNumber(81, !0);
   if (t <= 32)
-    return t <= 16 ? Cn(e, t) : qn(e, t);
+    return t <= 16 ? On(e, t) : Ln(e, t);
   if (t <= 64)
-    return Un(e, t);
-  let s = n, o = n.mul(Q).add(113), a = bt(o.mul(V).add(113)).mul(V), r = [tt.UZERO, tt.UZERO], i = [tt.UZERO, tt.UZERO];
-  s = s.mul(V).add(T(e, 0));
+    return Pn(e, t);
+  let s = n, o = n.mul(Y).add(113), a = bt(o.mul(D).add(113)).mul(D), r = [tt.UZERO, tt.UZERO], i = [tt.UZERO, tt.UZERO];
+  s = s.mul(D).add(T(e, 0));
   let l = 0;
   const u = (t - 1 >> 6) * 64, h = u + (t - 1 & 63) - 63;
   do
-    s = O(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(Q), o = O(o.add(r[1]).add(T(e, l + 48)), 42).mul(Q), s = s.xor(i[1]), o = o.add(r[0]).add(T(e, l + 40)), a = O(a.add(i[0]), 33).mul(Q), r = ut(e, l, r[1].mul(Q), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], l += 64;
+    s = A(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(Y), o = A(o.add(r[1]).add(T(e, l + 48)), 42).mul(Y), s = s.xor(i[1]), o = o.add(r[0]).add(T(e, l + 40)), a = A(a.add(i[0]), 33).mul(Y), r = ut(e, l, r[1].mul(Y), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], l += 64;
   while (l !== u);
-  const f = Q.add(a.and(255).shl(1));
-  return l = h, i[0] = i[0].add(t - 1 & 63), r[0] = r[0].add(i[0]), i[0] = i[0].add(r[0]), s = O(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(f), o = O(o.add(r[1]).add(T(e, l + 48)), 42).mul(f), s = s.xor(i[1].mul(9)), o = o.add(r[0].mul(9).add(T(e, l + 40))), a = O(a.add(i[0]), 33).mul(f), r = ut(e, l, r[1].mul(f), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], Y(Y(r[0], i[0], f).add(bt(o).mul(ae)).add(a), Y(r[1], i[1], f).add(s), f);
+  const f = Y.add(a.and(255).shl(1));
+  return l = h, i[0] = i[0].add(t - 1 & 63), r[0] = r[0].add(i[0]), i[0] = i[0].add(r[0]), s = A(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(f), o = A(o.add(r[1]).add(T(e, l + 48)), 42).mul(f), s = s.xor(i[1].mul(9)), o = o.add(r[0].mul(9).add(T(e, l + 40))), a = A(a.add(i[0]), 33).mul(f), r = ut(e, l, r[1].mul(f), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], J(J(r[0], i[0], f).add(bt(o).mul(ae)).add(a), J(r[1], i[1], f).add(s), f);
 }
 /**
  * @license
@@ -749,7 +749,7 @@ function Mn(e, t = e.length) {
  */
 function nt(e, t) {
   Array.isArray(e) || (e = [e]), e.forEach((n) => {
-    n != null && qt(n.dtype !== "complex64", () => `${t} does not support complex64 tensors in the CPU backend.`);
+    n != null && Lt(n.dtype !== "complex64", () => `${t} does not support complex64 tensors in the CPU backend.`);
   });
 }
 /**
@@ -774,16 +774,16 @@ function le(e) {
     t[n] = Math.abs(e[n]);
   return t;
 }
-const On = (e) => {
+const An = (e) => {
   const { x: t } = e.inputs, n = e.backend;
   nt(t, "abs");
-  let s = new Float32Array(A(t.shape));
+  let s = new Float32Array(V(t.shape));
   const o = n.data.get(t.dataId).values;
   return s = le(o), n.makeOutput(s, t.shape, t.dtype);
-}, Ys = {
-  kernelName: _e,
+}, Xs = {
+  kernelName: Ce,
   backendName: "cpu",
-  kernelFunc: On
+  kernelFunc: An
 };
 /**
  * @license
@@ -801,20 +801,20 @@ const On = (e) => {
  * limitations under the License.
  * =============================================================================
  */
-function W(e) {
+function $(e) {
   return (t, n, s, o, a) => {
-    const r = Ut(t, n), i = r.length, l = K(r), u = A(r), h = et(a, u), f = t.length, p = n.length, I = K(t), m = K(n), F = ht(t, r), g = ht(n, r);
-    if (F.length + g.length === 0)
-      for (let d = 0; d < h.length; ++d)
-        h[d] = e(s[d % s.length], o[d % o.length]);
+    const r = Pt(t, n), i = r.length, l = H(r), u = V(r), h = et(a, u), f = t.length, p = n.length, w = H(t), m = H(n), F = ht(t, r), d = ht(n, r);
+    if (F.length + d.length === 0)
+      for (let g = 0; g < h.length; ++g)
+        h[g] = e(s[g % s.length], o[g % o.length]);
     else
-      for (let d = 0; d < h.length; ++d) {
-        const b = gt(d, i, l), k = b.slice(-f);
-        F.forEach((C) => k[C] = 0);
-        const y = at(k, f, I), S = b.slice(-p);
-        g.forEach((C) => S[C] = 0);
-        const P = at(S, p, m);
-        h[d] = e(s[y], o[P]);
+      for (let g = 0; g < h.length; ++g) {
+        const b = dt(g, i, l), k = b.slice(-f);
+        F.forEach((O) => k[O] = 0);
+        const y = at(k, f, w), v = b.slice(-p);
+        d.forEach((O) => v[O] = 0);
+        const M = at(v, p, m);
+        h[g] = e(s[y], o[M]);
       }
     return [h, r];
   };
@@ -843,7 +843,7 @@ function mt(e) {
   }, i;
 }
 const Js = {
-  kernelName: Ve,
+  kernelName: De,
   backendName: "cpu",
   kernelFunc: mt
 };
@@ -868,7 +868,7 @@ function xt(e, t, n = "float32") {
     const o = xt(e, t, "float32"), a = xt(e, t, "float32");
     return mt({ inputs: { real: o, imag: a }, backend: e });
   }
-  const s = st(A(t), n);
+  const s = st(V(t), n);
   return e.makeTensorInfo(t, n, s);
 }
 /**
@@ -892,7 +892,7 @@ function Et(e) {
   return n.incRef(s.dataId), { dataId: s.dataId, shape: s.shape, dtype: s.dtype };
 }
 const Qs = {
-  kernelName: De,
+  kernelName: We,
   backendName: "cpu",
   kernelFunc: Et
 };
@@ -916,8 +916,8 @@ function ce(e) {
   const { inputs: t, backend: n } = e, { input: s } = t, o = n.data.get(s.dataId).complexTensorInfos.real, a = n.data.get(o.dataId).values;
   return n.makeTensorInfo(o.shape, o.dtype, a);
 }
-const to = {
-  kernelName: We,
+const Ys = {
+  kernelName: $e,
   backendName: "cpu",
   kernelFunc: ce
 };
@@ -943,7 +943,7 @@ function ue(e, t, n, s) {
     return [t, "int32", o];
   }
   if (s === "bool") {
-    const o = Be([0], n), [a, r] = W((i, l) => i !== l ? 1 : 0)(t, [], e, o, "bool");
+    const o = Be([0], n), [a, r] = $((i, l) => i !== l ? 1 : 0)(t, [], e, o, "bool");
     return [r, "bool", a];
   }
   throw new Error(`Error in Cast: failed to cast ${n} to ${s}`);
@@ -967,8 +967,8 @@ function lt(e) {
   const r = n.data.get(o.dataId).values, [i, l, u] = ue(r, o.shape, o.dtype, a);
   return n.makeTensorInfo(i, l, u);
 }
-const eo = {
-  kernelName: $e,
+const to = {
+  kernelName: Ue,
   backendName: "cpu",
   kernelFunc: lt
 };
@@ -998,35 +998,35 @@ function z(e, t, n, s) {
     ) : u, p = r.dtype === "string" ? (
       // tslint:disable-next-line: no-any
       it(h)
-    ) : h, I = s || r.dtype, [m, F] = t(r.shape, i.shape, f, p, I);
-    return l.makeTensorInfo(F, I, m);
+    ) : h, w = s || r.dtype, [m, F] = t(r.shape, i.shape, f, p, w);
+    return l.makeTensorInfo(F, w, m);
   } : ({ inputs: o, backend: a }) => {
     const { a: r, b: i } = o, l = a;
     if (r.dtype === "complex64" || i.dtype === "complex64") {
-      const u = lt({ inputs: { x: r }, backend: l, attrs: { dtype: "complex64" } }), h = l.data.get(u.dataId), f = h.complexTensorInfos.real, p = h.complexTensorInfos.imag, I = l.data.get(f.dataId).values, m = l.data.get(p.dataId).values, F = lt({ inputs: { x: i }, backend: l, attrs: { dtype: "complex64" } }), g = l.data.get(F.dataId), d = g.complexTensorInfos.real, b = g.complexTensorInfos.imag, k = l.data.get(d.dataId).values, y = l.data.get(b.dataId).values, [S, P, C] = n(r.shape, i.shape, I, m, k, y), v = l.makeTensorInfo(C, "float32", S), x = l.makeTensorInfo(C, "float32", P), w = mt({ inputs: { real: v, imag: x }, backend: l });
-      return l.disposeIntermediateTensorInfo(u), l.disposeIntermediateTensorInfo(F), l.disposeIntermediateTensorInfo(v), l.disposeIntermediateTensorInfo(x), w;
+      const u = lt({ inputs: { x: r }, backend: l, attrs: { dtype: "complex64" } }), h = l.data.get(u.dataId), f = h.complexTensorInfos.real, p = h.complexTensorInfos.imag, w = l.data.get(f.dataId).values, m = l.data.get(p.dataId).values, F = lt({ inputs: { x: i }, backend: l, attrs: { dtype: "complex64" } }), d = l.data.get(F.dataId), g = d.complexTensorInfos.real, b = d.complexTensorInfos.imag, k = l.data.get(g.dataId).values, y = l.data.get(b.dataId).values, [v, M, O] = n(r.shape, i.shape, w, m, k, y), S = l.makeTensorInfo(O, "float32", v), x = l.makeTensorInfo(O, "float32", M), I = mt({ inputs: { real: S, imag: x }, backend: l });
+      return l.disposeIntermediateTensorInfo(u), l.disposeIntermediateTensorInfo(F), l.disposeIntermediateTensorInfo(S), l.disposeIntermediateTensorInfo(x), I;
     } else {
-      const u = l.data.get(r.dataId).values, h = l.data.get(i.dataId).values, f = s || r.dtype, [p, I] = t(r.shape, i.shape, u, h, f);
-      return l.makeTensorInfo(I, f, p);
+      const u = l.data.get(r.dataId).values, h = l.data.get(i.dataId).values, f = s || r.dtype, [p, w] = t(r.shape, i.shape, u, h, f);
+      return l.makeTensorInfo(w, f, p);
     }
   };
 }
 function Ft(e) {
   return (t, n, s, o, a, r) => {
-    const i = Ut(t, n), l = A(i), u = i.length, h = K(i), f = et("float32", l), p = et("float32", l), I = ht(t, i), m = ht(n, i), F = kt(s, o), g = kt(a, r), d = t.length, b = K(t), k = n.length, y = K(n);
-    if (I.length + m.length === 0)
-      for (let S = 0; S < f.length; S++) {
-        const P = S % F.length, C = S % g.length, v = e(F[P * 2], F[P * 2 + 1], g[C * 2], g[C * 2 + 1]);
-        f[S] = v.real, p[S] = v.imag;
+    const i = Pt(t, n), l = V(i), u = i.length, h = H(i), f = et("float32", l), p = et("float32", l), w = ht(t, i), m = ht(n, i), F = kt(s, o), d = kt(a, r), g = t.length, b = H(t), k = n.length, y = H(n);
+    if (w.length + m.length === 0)
+      for (let v = 0; v < f.length; v++) {
+        const M = v % F.length, O = v % d.length, S = e(F[M * 2], F[M * 2 + 1], d[O * 2], d[O * 2 + 1]);
+        f[v] = S.real, p[v] = S.imag;
       }
     else
-      for (let S = 0; S < f.length; S++) {
-        const P = gt(S, u, h), C = P.slice(-d);
-        I.forEach((E) => C[E] = 0);
-        const v = at(C, d, b), x = P.slice(-k);
+      for (let v = 0; v < f.length; v++) {
+        const M = dt(v, u, h), O = M.slice(-g);
+        w.forEach((E) => O[E] = 0);
+        const S = at(O, g, b), x = M.slice(-k);
         m.forEach((E) => x[E] = 0);
-        const w = at(x, k, y), c = e(F[v * 2], F[v * 2 + 1], g[w * 2], g[w * 2 + 1]);
-        f[S] = c.real, p[S] = c.imag;
+        const I = at(x, k, y), c = e(F[S * 2], F[S * 2 + 1], d[I * 2], d[I * 2 + 1]);
+        f[v] = c.real, p[v] = c.imag;
       }
     return [f, p, i];
   };
@@ -1047,10 +1047,10 @@ function Ft(e) {
  * limitations under the License.
  * =============================================================================
  */
-const he = W((e, t) => e + t), Ln = Ft((e, t, n, s) => ({ real: e + n, imag: t + s })), An = z(Mt, he, Ln), no = {
-  kernelName: Mt,
+const he = $((e, t) => e + t), _n = Ft((e, t, n, s) => ({ real: e + n, imag: t + s })), Vn = z(qt, he, _n), eo = {
+  kernelName: qt,
   backendName: "cpu",
-  kernelFunc: An
+  kernelFunc: Vn
 };
 /**
  * @license
@@ -1068,8 +1068,8 @@ const he = W((e, t) => e + t), Ln = Ft((e, t, n, s) => ({ real: e + n, imag: t +
  * limitations under the License.
  * =============================================================================
  */
-function _n(e, t, n, s, o) {
-  const a = A(s), r = st(o, n);
+function Cn(e, t, n, s, o) {
+  const a = V(s), r = st(o, n);
   for (let i = 0; i < e.length; i++) {
     const l = e[i];
     if (l < 0)
@@ -1078,8 +1078,8 @@ function _n(e, t, n, s, o) {
   }
   return r;
 }
-function Vn(e, t, n, s = !1) {
-  const o = e.shape[0], a = e.shape[1], r = H([o, n], t.dtype);
+function Dn(e, t, n, s = !1) {
+  const o = e.shape[0], a = e.shape[1], r = K([o, n], t.dtype);
   for (let i = 0; i < o; i++)
     for (let l = 0; l < a; l++) {
       const u = e.get(i, l);
@@ -1105,10 +1105,10 @@ function Vn(e, t, n, s = !1) {
  * limitations under the License.
  * =============================================================================
  */
-const fe = W((e, t) => e & t), Dn = z(Ot, fe), so = {
-  kernelName: Ot,
+const fe = $((e, t) => e & t), Wn = z(At, fe), no = {
+  kernelName: At,
   backendName: "cpu",
-  kernelFunc: Dn
+  kernelFunc: Wn
 };
 /**
  * @license
@@ -1128,7 +1128,7 @@ const fe = W((e, t) => e & t), Dn = z(Ot, fe), so = {
  */
 function X(e) {
   return (t, n, s) => {
-    const o = D(n, t.length);
+    const o = W(n, t.length);
     for (let a = 0; a < t.length; ++a)
       o[a] = e(t[a], s);
     return o;
@@ -1150,11 +1150,11 @@ function X(e) {
  * limitations under the License.
  * =============================================================================
  */
-function ge(e, t, n) {
+function de(e, t, n) {
   const s = X(t);
-  return J(e, s, n);
+  return Q(e, s, n);
 }
-function J(e, t, n) {
+function Q(e, t, n) {
   return ({ inputs: s, attrs: o, backend: a }) => {
     const { x: r } = s;
     nt(r, e);
@@ -1186,10 +1186,10 @@ function J(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const de = X((e) => Math.ceil(e)), Wn = J(Lt, de), oo = {
-  kernelName: Lt,
+const ge = X((e) => Math.ceil(e)), $n = Q(_t, ge), so = {
+  kernelName: _t,
   backendName: "cpu",
-  kernelFunc: Wn
+  kernelFunc: $n
 };
 /**
  * @license
@@ -1207,12 +1207,12 @@ const de = X((e) => Math.ceil(e)), Wn = J(Lt, de), oo = {
  * limitations under the License.
  * =============================================================================
  */
-function $n(e, t, n, s) {
-  const o = D(n, A(t));
+function Un(e, t, n, s) {
+  const o = W(n, V(t));
   if (s && n !== "string") {
     let a = 0;
     e.forEach((r) => {
-      const i = A(r.shape);
+      const i = V(r.shape);
       o.set(r.vals, a), a += i;
     });
   } else {
@@ -1246,8 +1246,8 @@ function $n(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-const me = W((e, t) => e === t ? 1 : 0), zn = z(At, me, null, "bool"), ro = {
-  kernelName: At,
+const me = $((e, t) => e === t ? 1 : 0), zn = z(Vt, me, null, "bool"), oo = {
+  kernelName: Vt,
   backendName: "cpu",
   kernelFunc: zn
 };
@@ -1267,8 +1267,8 @@ const me = W((e, t) => e === t ? 1 : 0), zn = z(At, me, null, "bool"), ro = {
  * limitations under the License.
  * =============================================================================
  */
-const pe = X((e) => Math.exp(e)), Bn = J(_t, pe, "float32"), ao = {
-  kernelName: _t,
+const pe = X((e) => Math.exp(e)), Bn = Q(Ct, pe, "float32"), ro = {
+  kernelName: Ct,
   backendName: "cpu",
   kernelFunc: Bn
 };
@@ -1288,10 +1288,10 @@ const pe = X((e) => Math.exp(e)), Bn = J(_t, pe, "float32"), ao = {
  * limitations under the License.
  * =============================================================================
  */
-const Ie = X((e) => Math.expm1(e)), Gn = J(Vt, Ie), io = {
-  kernelName: Vt,
+const we = X((e) => Math.expm1(e)), jn = Q(Dt, we), ao = {
+  kernelName: Dt,
   backendName: "cpu",
-  kernelFunc: Gn
+  kernelFunc: jn
 };
 /**
  * @license
@@ -1309,10 +1309,10 @@ const Ie = X((e) => Math.expm1(e)), Gn = J(Vt, Ie), io = {
  * limitations under the License.
  * =============================================================================
  */
-const we = X((e) => Math.floor(e)), jn = J(Dt, we), lo = {
-  kernelName: Dt,
+const Ie = X((e) => Math.floor(e)), Gn = Q(Wt, Ie), io = {
+  kernelName: Wt,
   backendName: "cpu",
-  kernelFunc: jn
+  kernelFunc: Gn
 };
 /**
  * @license
@@ -1330,8 +1330,8 @@ const we = X((e) => Math.floor(e)), jn = J(Dt, we), lo = {
  * limitations under the License.
  * =============================================================================
  */
-const be = W((e, t) => Math.floor(e / t)), Zn = z(Wt, be, null, "int32"), co = {
-  kernelName: Wt,
+const be = $((e, t) => Math.floor(e / t)), Zn = z($t, be, null, "int32"), lo = {
+  kernelName: $t,
   backendName: "cpu",
   kernelFunc: Zn
 };
@@ -1351,19 +1351,19 @@ const be = W((e, t) => Math.floor(e / t)), Zn = z(Wt, be, null, "int32"), co = {
  * limitations under the License.
  * =============================================================================
  */
-function Hn(e, t, n, s, o, a, r, i, l) {
-  const u = H([s, a], n);
+function Kn(e, t, n, s, o, a, r, i, l) {
+  const u = K([s, a], n);
   for (let h = 0; h < s; h++) {
     const f = [];
     let p = 0;
-    for (let I = 0; I < o; I++) {
-      const m = e[h * o + I];
-      p += m * r[I], f.push(m);
+    for (let w = 0; w < o; w++) {
+      const m = e[h * o + w];
+      p += m * r[w], f.push(m);
     }
     if (p < 0 || p >= l / a)
       throw new Error(`Invalid indices: ${f} does not index into ${i}`);
-    for (let I = 0; I < a; I++)
-      u.values[h * a + I] = t.get(...t.indexToLoc(p * a + I));
+    for (let w = 0; w < a; w++)
+      u.values[h * a + w] = t.get(...t.indexToLoc(p * a + w));
   }
   return u;
 }
@@ -1383,8 +1383,8 @@ function Hn(e, t, n, s, o, a, r, i, l) {
  * limitations under the License.
  * =============================================================================
  */
-function Kn(e, t, n) {
-  const s = H(n, e.dtype);
+function Hn(e, t, n) {
+  const s = K(n, e.dtype);
   for (let o = 0; o < s.size; ++o) {
     const r = s.indexToLoc(o).slice(), i = r[0], l = r[2], u = t.locToIndex([i, l]);
     r[2] = t.values[u];
@@ -1409,8 +1409,8 @@ function Kn(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const xe = W((e, t) => e > t ? 1 : 0), Xn = z($t, xe, null, "bool"), uo = {
-  kernelName: $t,
+const xe = $((e, t) => e > t ? 1 : 0), Xn = z(Ut, xe, null, "bool"), co = {
+  kernelName: Ut,
   backendName: "cpu",
   kernelFunc: Xn
 };
@@ -1430,10 +1430,10 @@ const xe = W((e, t) => e > t ? 1 : 0), Xn = z($t, xe, null, "bool"), uo = {
  * limitations under the License.
  * =============================================================================
  */
-const Ee = W((e, t) => e >= t ? 1 : 0), Yn = z(zt, Ee, null, "bool"), ho = {
+const Ee = $((e, t) => e >= t ? 1 : 0), Jn = z(zt, Ee, null, "bool"), uo = {
   kernelName: zt,
   backendName: "cpu",
-  kernelFunc: Yn
+  kernelFunc: Jn
 };
 /**
  * @license
@@ -1451,10 +1451,10 @@ const Ee = W((e, t) => e >= t ? 1 : 0), Yn = z(zt, Ee, null, "bool"), ho = {
  * limitations under the License.
  * =============================================================================
  */
-const Fe = W((e, t) => e < t ? 1 : 0), Jn = z(Bt, Fe, null, "bool"), fo = {
+const Fe = $((e, t) => e < t ? 1 : 0), Qn = z(Bt, Fe, null, "bool"), ho = {
   kernelName: Bt,
   backendName: "cpu",
-  kernelFunc: Jn
+  kernelFunc: Qn
 };
 /**
  * @license
@@ -1472,10 +1472,10 @@ const Fe = W((e, t) => e < t ? 1 : 0), Jn = z(Bt, Fe, null, "bool"), fo = {
  * limitations under the License.
  * =============================================================================
  */
-const ye = W((e, t) => e <= t ? 1 : 0), Qn = z(Gt, ye, null, "bool"), go = {
-  kernelName: Gt,
+const ye = $((e, t) => e <= t ? 1 : 0), Yn = z(jt, ye, null, "bool"), fo = {
+  kernelName: jt,
   backendName: "cpu",
-  kernelFunc: Qn
+  kernelFunc: Yn
 };
 /**
  * @license
@@ -1516,8 +1516,8 @@ function ts(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const ke = X((e) => Math.log(e)), es = J(jt, ke), mo = {
-  kernelName: jt,
+const ke = X((e) => Math.log(e)), es = Q(Gt, ke), go = {
+  kernelName: Gt,
   backendName: "cpu",
   kernelFunc: es
 };
@@ -1538,7 +1538,7 @@ const ke = X((e) => Math.log(e)), es = J(jt, ke), mo = {
  * =============================================================================
  */
 function ns(e, t, n, s) {
-  const o = et(s, A(n));
+  const o = et(s, V(n));
   for (let a = 0; a < o.length; ++a) {
     const r = a * t;
     let i = e[r];
@@ -1566,7 +1566,7 @@ function ns(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-const Ne = W((e, t) => Math.max(e, t)), ss = z(Zt, Ne), po = {
+const Ne = $((e, t) => Math.max(e, t)), ss = z(Zt, Ne), mo = {
   kernelName: Zt,
   backendName: "cpu",
   kernelFunc: ss
@@ -1587,8 +1587,8 @@ const Ne = W((e, t) => Math.max(e, t)), ss = z(Zt, Ne), po = {
  * limitations under the License.
  * =============================================================================
  */
-const Se = W((e, t) => Math.min(e, t)), os = z(Ht, Se), Io = {
-  kernelName: Ht,
+const ve = $((e, t) => Math.min(e, t)), os = z(Kt, ve), po = {
+  kernelName: Kt,
   backendName: "cpu",
   kernelFunc: os
 };
@@ -1608,11 +1608,11 @@ const Se = W((e, t) => Math.min(e, t)), os = z(Ht, Se), Io = {
  * limitations under the License.
  * =============================================================================
  */
-const yt = W((e, t) => e * t), rs = Ft((e, t, n, s) => ({
+const yt = $((e, t) => e * t), rs = Ft((e, t, n, s) => ({
   real: e * n - t * s,
   imag: e * s + t * n
-})), as = z(Kt, yt, rs), wo = {
-  kernelName: Kt,
+})), as = z(Ht, yt, rs), wo = {
+  kernelName: Ht,
   backendName: "cpu",
   kernelFunc: as
 };
@@ -1632,18 +1632,18 @@ const yt = W((e, t) => e * t), rs = Ft((e, t, n, s) => ({
  * limitations under the License.
  * =============================================================================
  */
-function ve(e, t, n) {
-  const s = je(-1, n);
+function Se(e, t, n) {
+  const s = Ge(-1, n);
   return yt([], t, s, e, n);
 }
 function is(e) {
   const { inputs: t, backend: n } = e, { x: s } = t;
   nt(s, "neg");
-  const o = n.data.get(s.dataId).values, [a, r] = ve(o, s.shape, s.dtype);
+  const o = n.data.get(s.dataId).values, [a, r] = Se(o, s.shape, s.dtype);
   return n.makeTensorInfo(r, s.dtype, a);
 }
-const bo = {
-  kernelName: Ge,
+const Io = {
+  kernelName: je,
   backendName: "cpu",
   kernelFunc: is
 };
@@ -1663,7 +1663,7 @@ const bo = {
  * limitations under the License.
  * =============================================================================
  */
-const Te = W((e, t) => e !== t ? 1 : 0), ls = z(Xt, Te, null, "bool"), xo = {
+const Te = $((e, t) => e !== t ? 1 : 0), ls = z(Xt, Te, null, "bool"), bo = {
   kernelName: Xt,
   backendName: "cpu",
   kernelFunc: ls
@@ -1685,13 +1685,13 @@ const Te = W((e, t) => e !== t ? 1 : 0), ls = z(Xt, Te, null, "bool"), xo = {
  * =============================================================================
  */
 function Re(e, t, n, s, o) {
-  const a = t.length, r = A(t), i = K(t), l = K(o), u = et(n, A(o));
+  const a = t.length, r = V(t), i = H(t), l = H(o), u = et(n, V(o));
   for (let h = 0; h < r; ++h) {
-    const f = gt(h, a, i), p = new Array(f.length);
+    const f = dt(h, a, i), p = new Array(f.length);
     for (let m = 0; m < p.length; m++)
       p[m] = f[s[m]];
-    const I = at(p, a, l);
-    u[I] = e[h];
+    const w = at(p, a, l);
+    u[w] = e[h];
   }
   return u;
 }
@@ -1711,7 +1711,7 @@ function Re(e, t, n, s, o) {
  * limitations under the License.
  * =============================================================================
  */
-function Pe(e) {
+function Me(e) {
   const { inputs: t, attrs: n, backend: s } = e, { x: o } = t, { perm: a } = n;
   nt(o, "transpose");
   const r = o.shape.length, i = new Array(r);
@@ -1720,10 +1720,10 @@ function Pe(e) {
   const l = s.data.get(o.dataId).values, u = Re(l, o.shape, o.dtype, a, i);
   return { dataId: s.write(u, i, o.dtype), shape: i, dtype: o.dtype };
 }
-const Eo = {
+const xo = {
   kernelName: Ze,
   backendName: "cpu",
-  kernelFunc: Pe
+  kernelFunc: Me
 };
 /**
  * @license
@@ -1741,8 +1741,8 @@ const Eo = {
  * limitations under the License.
  * =============================================================================
  */
-function Ce(e, t, n, s) {
-  const [o, a] = bn(e, s), r = Ke(t, "int32"), i = st(A(o), r), l = A(a);
+function Oe(e, t, n, s) {
+  const [o, a] = bn(e, s), r = He(t, "int32"), i = st(V(o), r), l = V(a);
   for (let u = 0; u < i.length; ++u) {
     const h = u * l;
     let f = 1;
@@ -1755,16 +1755,16 @@ function Ce(e, t, n, s) {
 function cs(e) {
   const { inputs: t, backend: n, attrs: s } = e, { x: o } = t, { axis: a, keepDims: r } = s;
   nt(o, "prod");
-  const i = o.shape.length, l = Yt(a, o.shape), u = pn(l, i);
+  const i = o.shape.length, l = Jt(a, o.shape), u = pn(l, i);
   let h = l, f = o;
   const p = [];
-  u != null && (f = Pe({ inputs: { x: o }, backend: n, attrs: { perm: u } }), p.push(f), h = In(h.length, i));
-  const I = n.data.get(f.dataId).values, { outVals: m, outShape: F, outDtype: g } = Ce(f.shape, f.dtype, I, h);
-  let d = F;
-  return r && (d = wn(F, l)), p.forEach((b) => n.disposeIntermediateTensorInfo(b)), n.makeTensorInfo(d, g, m);
+  u != null && (f = Me({ inputs: { x: o }, backend: n, attrs: { perm: u } }), p.push(f), h = wn(h.length, i));
+  const w = n.data.get(f.dataId).values, { outVals: m, outShape: F, outDtype: d } = Oe(f.shape, f.dtype, w, h);
+  let g = F;
+  return r && (g = In(F, l)), p.forEach((b) => n.disposeIntermediateTensorInfo(b)), n.makeTensorInfo(g, d, m);
 }
-const Fo = {
-  kernelName: He,
+const Eo = {
+  kernelName: Ke,
   backendName: "cpu",
   kernelFunc: cs
 };
@@ -1787,7 +1787,7 @@ const Fo = {
 function us(e, t, n) {
   e.forEach((s, o) => {
     if (s < 0 || s >= n) {
-      const a = gt(o, t.length, K(t)).join(",");
+      const a = dt(o, t.length, H(t)).join(",");
       throw new Error(`indices[${a}] = ${s} is not in [0, ${n})`);
     }
   });
@@ -1821,22 +1821,22 @@ function fs(e, t, n, s) {
   for (let u = 0; u < e.length; ++u) {
     let h = e[u], f = e[u] + 1;
     for (let p = 0; p < n.length; ++p) {
-      const I = n[p], m = p + t.length - 1;
+      const w = n[p], m = p + t.length - 1;
       if (m >= 0) {
-        const F = i[m], g = F[F.length - 1] - I[h];
-        for (let d = h; d < f; ++d)
-          i[m].push(I[d + 1] + g);
+        const F = i[m], d = F[F.length - 1] - w[h];
+        for (let g = h; g < f; ++g)
+          i[m].push(w[g + 1] + d);
       }
-      h = I[h], f = I[f];
+      h = w[h], f = w[f];
     }
     f !== h && (o.push([h, f]), a += f - h);
   }
   return { outSplits: i, valueSlices: o, numValues: a };
 }
-function gs(e) {
+function ds(e) {
   const t = [];
   for (let n = 0; n < e.length; ++n) {
-    const s = e[n].length, o = D("int32", s);
+    const s = e[n].length, o = W("int32", s);
     t.push(o), e[n].forEach((a, r) => o[r] = a);
   }
   return t;
@@ -1849,7 +1849,7 @@ function Tt(e, t) {
     n[t - 1] *= e[s];
   return n;
 }
-function ds(e, t, n, s, o, a) {
+function gs(e, t, n, s, o, a) {
   const r = Tt(t, 2)[1], i = Tt(a, 2)[1];
   let l = 0;
   for (const u of n)
@@ -1862,8 +1862,8 @@ function ds(e, t, n, s, o, a) {
 function ms(e, t, n, s, o) {
   const a = t.slice();
   a[0] = o;
-  const r = D(n, A(a)), i = e.length, l = i === 0 ? 0 : i / t[0];
-  return ds(e, t, s, l, r, a), [r, a];
+  const r = W(n, V(a)), i = e.length, l = i === 0 ? 0 : i / t[0];
+  return gs(e, t, s, l, r, a), [r, a];
 }
 function ps(e, t, n, s, o, a, r, i) {
   if (e.length === 0)
@@ -1873,8 +1873,8 @@ function ps(e, t, n, s, o, a, r, i) {
   const l = t[0][0] - 1;
   if (us(a, r, l), s.length === 0)
     throw new Error("params.rank must be nonzero");
-  const u = s[0], { outSplits: h, valueSlices: f, numValues: p } = fs(a, r, e, u), I = gs(h), m = ms(n, s, o, f, p);
-  return [I, m[0], m[1]];
+  const u = s[0], { outSplits: h, valueSlices: f, numValues: p } = fs(a, r, e, u), w = ds(h), m = ms(n, s, o, f, p);
+  return [w, m[0], m[1]];
 }
 /**
  * @license
@@ -1893,7 +1893,7 @@ function ps(e, t, n, s, o, a, r, i) {
  * =============================================================================
  */
 const Rt = 2147483647;
-function Is(e, t, n, s, o, a, r) {
+function ws(e, t, n, s, o, a, r) {
   if (t.length > 1)
     throw new Error("starts must be a scalar or vector");
   if (o.length > 1)
@@ -1902,29 +1902,29 @@ function Is(e, t, n, s, o, a, r) {
     throw new Error("deltas must be a scalar or vector");
   const i = t.length === 0, l = o.length === 0, u = r.length === 0, h = [];
   i || h.push(t[0]), l || h.push(o[0]), u || h.push(r[0]);
-  for (let g = 1; g < h.length; ++g)
-    if (h[g] !== h[g - 1])
+  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], p = D("int32", f + 1);
+  const f = h.length === 0 ? 1 : h[0], p = W("int32", f + 1);
   p[0] = 0;
-  for (let g = 0; g < f; ++g) {
-    const d = i ? e[0] : e[g], b = l ? s[0] : s[g], k = u ? a[0] : a[g];
+  for (let d = 0; d < f; ++d) {
+    const g = i ? e[0] : e[d], b = l ? s[0] : s[d], k = u ? a[0] : a[d];
     if (k === 0)
       throw new Error("Requires delta != 0");
     let y;
-    if (k > 0 && b < d || k < 0 && b > d)
+    if (k > 0 && b < g || k < 0 && b > g)
       y = 0;
-    else if (y = Math.ceil(Math.abs((b - d) / k)), y > Rt)
+    else if (y = Math.ceil(Math.abs((b - g) / k)), y > Rt)
       throw new Error(`Requires ((limit - start) / delta) <= ${Rt}`);
-    p[g + 1] = p[g] + y;
+    p[d + 1] = p[d] + y;
   }
-  const I = p[f], m = D(n, I);
+  const w = p[f], m = W(n, w);
   let F = 0;
-  for (let g = 0; g < f; ++g) {
-    const d = p[g + 1] - p[g];
-    let b = i ? e[0] : e[g];
-    const k = u ? a[0] : a[g];
-    for (let y = 0; y < d; ++y)
+  for (let d = 0; d < f; ++d) {
+    const g = p[d + 1] - p[d];
+    let b = i ? e[0] : e[d];
+    const k = u ? a[0] : a[d];
+    for (let y = 0; y < g; ++y)
       m[F++] = b, b += k;
   }
   return [p, m];
@@ -1948,7 +1948,7 @@ function Is(e, t, n, s, o, a, r) {
 var Z = tn;
 class ft {
   constructor(t, n, s, o, a, r, i, l, u, h) {
-    this.shape = t, this.shapeShape = n, this.values = s, this.valuesShape = o, this.valuesDType = a, this.defaultValue = r, this.defaultValueShape = i, this.rowPartitionValues = l, this.rowPartitionValuesShapes = u, this.rowPartitionTypes = Je(h), this.raggedRank = Qe(this.rowPartitionTypes);
+    this.shape = t, this.shapeShape = n, this.values = s, this.valuesShape = o, this.valuesDType = a, this.defaultValue = r, this.defaultValueShape = i, this.rowPartitionValues = l, this.rowPartitionValuesShapes = u, this.rowPartitionTypes = Qe(h), this.raggedRank = Ye(this.rowPartitionTypes);
   }
   getRowPartitionTypeByDimension(t) {
     return this.rowPartitionTypes[0] === Z.FIRST_DIM_SIZE ? this.rowPartitionTypes[t + 1] : this.rowPartitionTypes[t];
@@ -1996,7 +1996,7 @@ class ft {
         return [];
       throw new Error("The only valid scalar shape tensor is the fully unknown shape specified as -1.");
     }
-    return Ct(t, s);
+    return Ot(t, s);
   }
   calculateOutputSize(t) {
     const n = this.valuesShape, s = this.defaultValueShape;
@@ -2024,7 +2024,7 @@ class ft {
       a.push(r);
     for (let i = o; i < t; ++i)
       a.push(-1);
-    return qt(a.length === t, () => "Final length of result must be equal to firstDimension."), a;
+    return Lt(a.length === t, () => "Final length of result must be equal to firstDimension."), a;
   }
   calculateOutputIndexRowSplit(t, n, s, o) {
     const a = t.length, r = [];
@@ -2122,7 +2122,7 @@ class ft {
     o[o.length - 1] = 1;
     for (let l = o.length - 2; l >= 0; --l)
       o[l] = o[l + 1] * s[l + 1];
-    const a = Ct(s, !1), r = D(this.valuesDType, A(a));
+    const a = Ot(s, !1), r = W(this.valuesDType, V(a));
     if (o[0] * s[0] > 0) {
       let l = this.calculateFirstParentOutputIndex(n, o[0], s[0]);
       for (let u = 1; u <= this.raggedRank; ++u)
@@ -2137,7 +2137,7 @@ class ft {
     const a = this.values, r = s;
     let i = o.slice();
     i = i.slice(t + 1);
-    const l = A(i), u = n.length;
+    const l = V(i), u = n.length;
     let h = this.defaultValue;
     if (h.length !== l && h.length !== 1) {
       const m = this.defaultValueShape;
@@ -2146,38 +2146,38 @@ class ft {
         h = xn(F, i).dataSync();
       });
     }
-    let f = 0, p = 0, I = 0;
+    let f = 0, p = 0, w = 0;
     for (let m = 0; m <= u; ++m) {
       let F = m < u ? n[m] : -1;
-      if (F === I) {
-        ++I;
+      if (F === w) {
+        ++w;
         continue;
       }
-      if (p < I) {
-        const g = a.subarray(f * l), d = r.subarray(p * l), b = (I - p) * l;
-        Pt(d, g, b);
+      if (p < w) {
+        const d = a.subarray(f * l), g = r.subarray(p * l), b = (w - p) * l;
+        Mt(g, d, b);
       }
       if (m >= u) {
-        const g = s.length;
-        F = Math.floor(g / l);
+        const d = s.length;
+        F = Math.floor(d / l);
       }
-      if (F > I)
+      if (F > w)
         if (this.defaultValue.length === 1)
-          r.subarray(I * l, F * l).fill(this.defaultValue[0]), I = F;
+          r.subarray(w * l, F * l).fill(this.defaultValue[0]), w = F;
         else
-          for (; F > I; ) {
-            const g = r.slice(I * l);
-            Pt(g, h, l), ++I;
+          for (; F > w; ) {
+            const d = r.slice(w * l);
+            Mt(d, h, l), ++w;
           }
-      F < 0 ? (f = m + 1, p = I) : (f = m, p = I, I = p + 1);
+      F < 0 ? (f = m + 1, p = w) : (f = m, p = w, w = p + 1);
     }
   }
 }
-function Pt(e, t, n) {
+function Mt(e, t, n) {
   for (let s = 0; s < n; s++)
     e[s] = t[s];
 }
-function Ct(e, t) {
+function Ot(e, t) {
   const n = [];
   for (let s of e) {
     if (s < 0) {
@@ -2191,7 +2191,7 @@ function Ct(e, t) {
   }
   return n;
 }
-function ws(e, t, n, s, o, a, r, i, l, u) {
+function Is(e, t, n, s, o, a, r, i, l, u) {
   return new ft(e, t, n, s, o, a, r, i, l, u).compute();
 }
 /**
@@ -2236,8 +2236,8 @@ function bs(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-const qe = X((e) => 1 / Math.sqrt(e)), xs = J(Jt, qe), yo = {
-  kernelName: Jt,
+const Le = X((e) => 1 / Math.sqrt(e)), xs = Q(Qt, Le), Fo = {
+  kernelName: Qt,
   backendName: "cpu",
   kernelFunc: xs
 };
@@ -2260,22 +2260,22 @@ const qe = X((e) => 1 / Math.sqrt(e)), xs = J(Jt, qe), yo = {
 function Es(e, t, n, s, o, a, r, i, l, u) {
   const h = [s / o, o], f = e.values, p = t.values;
   if (s === 0)
-    return H(n, t.dtype);
-  const I = l instanceof wt ? l : H(h, t.dtype);
-  typeof l == "string" || typeof l == "number" ? I.values.fill(l) : typeof l == "boolean" && I.values.fill(+l);
+    return K(n, t.dtype);
+  const w = l instanceof It ? l : K(h, t.dtype);
+  typeof l == "string" || typeof l == "number" ? w.values.fill(l) : typeof l == "boolean" && w.values.fill(+l);
   for (let m = 0; m < a; m++) {
     const F = [];
-    let g = 0;
-    for (let d = 0; d < r; d++) {
-      const b = f[m * r + d];
-      F.push(b), g += b * i[d];
+    let d = 0;
+    for (let g = 0; g < r; g++) {
+      const b = f[m * r + g];
+      F.push(b), d += b * i[g];
     }
-    if (g < 0 || g >= s / o)
+    if (d < 0 || d >= s / o)
       throw new Error(`Invalid indices: ${F} does not index into ${n}`);
-    for (let d = 0; d < o; d++)
-      u ? I.values[g * o + d] += p[m * o + d] : I.values[g * o + d] = t.rank === 0 ? p[0] : p[m * o + d];
+    for (let g = 0; g < o; g++)
+      u ? w.values[d * o + g] += p[m * o + g] : w.values[d * o + g] = t.rank === 0 ? p[0] : p[m * o + g];
   }
-  return I;
+  return w;
 }
 /**
  * @license
@@ -2293,8 +2293,8 @@ function Es(e, t, n, s, o, a, r, i, l, u) {
  * limitations under the License.
  * =============================================================================
  */
-const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = ge(Qt, (e) => 1 / (1 + Math.exp(-e))), ko = {
-  kernelName: Qt,
+const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = de(Yt, (e) => 1 / (1 + Math.exp(-e))), yo = {
+  kernelName: Yt,
   backendName: "cpu",
   kernelFunc: ys
 };
@@ -2314,16 +2314,16 @@ const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = ge(Qt, (e) => 1 / (1 + Math.ex
  * limitations under the License.
  * =============================================================================
  */
-function Ue(e, t, n, s, o) {
-  const a = kn(s, t, n), r = A(n), i = K(s);
+function Pe(e, t, n, s, o) {
+  const a = kn(s, t, n), r = V(n), i = H(s);
   if (a) {
     const f = Nn(t, i);
     return o === "string" ? e.slice(f, f + r) : e.subarray(f, f + r);
   }
-  const l = o === "string" ? it(e) : e, u = H(s, o, l), h = H(n, o);
+  const l = o === "string" ? it(e) : e, u = K(s, o, l), h = K(n, o);
   for (let f = 0; f < h.size; ++f) {
-    const p = h.indexToLoc(f), I = p.map((m, F) => m + t[F]);
-    h.set(u.get(...I), ...p);
+    const p = h.indexToLoc(f), w = p.map((m, F) => m + t[F]);
+    h.set(u.get(...w), ...p);
   }
   return o === "string" ? sn(h.values) : h.values;
 }
@@ -2332,11 +2332,11 @@ function ks(e) {
   nt(o, "slice");
   const [i, l] = Fn(o, a, r);
   yn(o, i, l);
-  const u = n.data.get(o.dataId).values, h = Ue(u, i, l, o.shape, o.dtype);
+  const u = n.data.get(o.dataId).values, h = Pe(u, i, l, o.shape, o.dtype);
   return n.makeTensorInfo(l, o.dtype, h);
 }
-const No = {
-  kernelName: Ye,
+const ko = {
+  kernelName: Je,
   backendName: "cpu",
   kernelFunc: ks
 };
@@ -2361,61 +2361,61 @@ function Ns(e, t, n, s, o, a, r) {
   if (l === 0) {
     if (i !== 0)
       throw new Error(on(i));
-    const g = D(n, 0), d = D(o, 0);
+    const d = W(n, 0), g = W(o, 0);
     return [
-      g,
-      [0, f],
       d,
+      [0, f],
+      g,
       u,
       h
     ];
   }
-  let p = !0, I = 0;
+  let p = !0, w = 0;
   const m = new Array(l).fill(0);
-  for (let g = 0; g < i; ++g) {
-    const d = e[g * f];
-    if (d < 0)
-      throw new Error(rn(g, d));
-    if (d >= l)
-      throw new Error(an(g, d, l));
-    ++m[d], p = p && d >= I, I = d;
+  for (let d = 0; d < i; ++d) {
+    const g = e[d * f];
+    if (g < 0)
+      throw new Error(rn(d, g));
+    if (g >= l)
+      throw new Error(an(d, g, l));
+    ++m[g], p = p && g >= w, w = g;
   }
   let F = !0;
-  for (let g = 0; g < l; ++g) {
-    const d = m[g] === 0;
-    u[g] = d, F = F && !d, m[g] = Math.max(m[g], 1), g > 0 && (m[g] += m[g - 1]);
+  for (let d = 0; d < l; ++d) {
+    const g = m[d] === 0;
+    u[d] = g, F = F && !g, m[d] = Math.max(m[d], 1), d > 0 && (m[d] += m[d - 1]);
   }
   if (F && p) {
-    const g = e, d = s;
+    const d = e, g = s;
     for (let b = 0; b < i; ++b)
       h[b] = b;
     return [
-      g,
-      [i, f],
       d,
+      [i, f],
+      g,
       u,
       h
     ];
   } else {
-    const g = m[l - 1], d = D(n, g * f), b = D(o, g), k = new Array(l).fill(0);
+    const d = m[l - 1], g = W(n, d * f), b = W(o, d), k = new Array(l).fill(0);
     for (let y = 0; y < i; ++y) {
-      const S = e[y * f], P = k[S], C = (S === 0 ? 0 : m[S - 1]) + P;
-      k[S]++;
-      for (let v = 0; v < f; ++v)
-        d[C * f + v] = e[y * f + v];
-      b[C] = s[y], h[y] = C;
+      const v = e[y * f], M = k[v], O = (v === 0 ? 0 : m[v - 1]) + M;
+      k[v]++;
+      for (let S = 0; S < f; ++S)
+        g[O * f + S] = e[y * f + S];
+      b[O] = s[y], h[y] = O;
     }
     for (let y = 0; y < l; ++y)
       if (k[y] === 0) {
-        const P = y === 0 ? 0 : m[y - 1];
-        d[P * f + 0] = y;
-        for (let C = 1; C < f; ++C)
-          d[P * f + C] = 0;
-        b[P] = r;
+        const M = y === 0 ? 0 : m[y - 1];
+        g[M * f + 0] = y;
+        for (let O = 1; O < f; ++O)
+          g[M * f + O] = 0;
+        b[M] = r;
       }
     return [
-      d,
-      [g, f],
+      g,
+      [d, f],
       b,
       u,
       h
@@ -2438,50 +2438,50 @@ function Ns(e, t, n, s, o, a, r) {
  * limitations under the License.
  * =============================================================================
  */
-function Ss(e, t, n, s, o) {
-  const a = A(s), r = t[0], i = o.length, l = [];
+function vs(e, t, n, s, o) {
+  const a = V(s), r = t[0], i = o.length, l = [];
   let u = 1, h = -1;
-  for (let g = 0; g < i; ++g) {
-    const d = o[g];
-    if (d === -1) {
+  for (let d = 0; d < i; ++d) {
+    const g = o[d];
+    if (g === -1) {
       if (h !== -1)
-        throw new Error(ln(h, g));
-      h = g, l.push(1);
+        throw new Error(ln(h, d));
+      h = d, l.push(1);
     } else {
-      if (d < 0)
-        throw new Error(cn(g, d));
-      u *= d, l.push(d);
+      if (g < 0)
+        throw new Error(cn(d, g));
+      u *= g, l.push(g);
     }
   }
   if (h !== -1) {
     if (u <= 0)
       throw new Error(un());
-    const g = Math.trunc(a / u);
-    if (u * g !== a)
+    const d = Math.trunc(a / u);
+    if (u * d !== a)
       throw new Error(hn(s, l));
-    l[h] = g;
+    l[h] = d;
   }
-  if (A(l) !== a)
+  if (V(l) !== a)
     throw new Error(fn(s, l));
-  const p = s.length, I = [];
+  const p = s.length, w = [];
   if (p > 0) {
-    I[p - 1] = 1;
-    for (let g = p - 2; g >= 0; --g)
-      I[g] = I[g + 1] * s[g + 1];
+    w[p - 1] = 1;
+    for (let d = p - 2; d >= 0; --d)
+      w[d] = w[d + 1] * s[d + 1];
   }
   const m = [];
   if (i > 0) {
     m[i - 1] = 1;
-    for (let g = i - 2; g >= 0; --g)
-      m[g] = m[g + 1] * l[g + 1];
+    for (let d = i - 2; d >= 0; --d)
+      m[d] = m[d + 1] * l[d + 1];
   }
-  const F = D(n, r * i);
-  for (let g = 0; g < r; ++g) {
-    let d = 0;
+  const F = W(n, r * i);
+  for (let d = 0; d < r; ++d) {
+    let g = 0;
     for (let b = 0; b < p; ++b)
-      d += e[g * p + b] * I[b];
+      g += e[d * p + b] * w[b];
     for (let b = 0; b < i; ++b)
-      F[g * i + b] = Math.trunc(d / m[b]), d %= m[b];
+      F[d * i + b] = Math.trunc(g / m[b]), g %= m[b];
   }
   return [F, [r, i], l];
 }
@@ -2501,45 +2501,45 @@ function Ss(e, t, n, s, o) {
  * limitations under the License.
  * =============================================================================
  */
-function vs(e, t, n, s, o, a = !1, r = 0) {
+function Ss(e, t, n, s, o, a = !1, r = 0) {
   const i = s.length, l = [t[0], e.length / t[0]], u = l[1], f = i > 0 ? o[i - 1] + 1 : 0;
   if (f < 0)
     throw new Error(Nt());
   const p = t.slice();
   p[0] = f;
-  const I = p.reduce((k, y) => k * y, 1), m = D(n, I);
+  const w = p.reduce((k, y) => k * y, 1), m = W(n, w);
   if (i === 0)
     return f > 0 && m.fill(r), [m, p];
   if (f <= 0)
     throw new Error(Nt());
-  let F = 0, g = 1, d = 0, b = o[F];
+  let F = 0, d = 1, g = 0, b = o[F];
   for (; ; ) {
     let k = 0;
-    if (g < i) {
-      if (k = o[g], b === k) {
-        ++g;
+    if (d < i) {
+      if (k = o[d], b === k) {
+        ++d;
         continue;
       }
       if (b >= k)
-        throw new Error(gn());
+        throw new Error(dn());
     }
     if (b < 0 || b >= f)
-      throw new Error(dn(b, f));
-    b > d && m.fill(r, d * u, b * u);
-    for (let y = F; y < g; ++y) {
-      const S = s[y];
-      if (S < 0 || S >= l[0])
+      throw new Error(gn(b, f));
+    b > g && m.fill(r, g * u, b * u);
+    for (let y = F; y < d; ++y) {
+      const v = s[y];
+      if (v < 0 || v >= l[0])
         throw new Error(mn(y, s[y], l[0]));
-      for (let P = 0; P < u; P++)
-        m[b * u + P] += e[S * u + P];
+      for (let M = 0; M < u; M++)
+        m[b * u + M] += e[v * u + M];
     }
     if (a)
       for (let y = 0; y < u; y++)
-        m[b * u + y] /= g - F;
-    if (F = g, ++g, d = b + 1, b = k, g > i)
+        m[b * u + y] /= d - F;
+    if (F = d, ++d, g = b + 1, b = k, d > i)
       break;
   }
-  return d < f && m.fill(r, d * u, f * u), [m, p];
+  return g < f && m.fill(r, g * u, f * u), [m, p];
 }
 /**
  * @license
@@ -2557,7 +2557,7 @@ function vs(e, t, n, s, o, a = !1, r = 0) {
  * limitations under the License.
  * =============================================================================
  */
-const Ts = X((e) => Math.sqrt(e)), Rs = ge(te, (e) => Math.sqrt(e)), So = {
+const Ts = X((e) => Math.sqrt(e)), Rs = de(te, (e) => Math.sqrt(e)), No = {
   kernelName: te,
   backendName: "cpu",
   kernelFunc: Rs
@@ -2578,13 +2578,13 @@ const Ts = X((e) => Math.sqrt(e)), Rs = ge(te, (e) => Math.sqrt(e)), So = {
  * limitations under the License.
  * =============================================================================
  */
-const Me = W((e, t) => {
+const qe = $((e, t) => {
   const n = e - t;
   return n * n;
-}), Ps = z(ee, Me), vo = {
+}), Ms = z(ee, qe), vo = {
   kernelName: ee,
   backendName: "cpu",
-  kernelFunc: Ps
+  kernelFunc: Ms
 };
 /**
  * @license
@@ -2602,13 +2602,13 @@ const Me = W((e, t) => {
  * limitations under the License.
  * =============================================================================
  */
-const Oe = X((e, t) => {
+const Ae = X((e, t) => {
   const { pattern: n, replaceGlobal: s, rewrite: o } = t;
   return e.replace(new RegExp(n, s ? "g" : ""), o);
-}), Cs = J(ne, Oe), To = {
+}), Os = Q(ne, Ae), So = {
   kernelName: ne,
   backendName: "cpu",
-  kernelFunc: Cs
+  kernelFunc: Os
 };
 /**
  * @license
@@ -2626,8 +2626,8 @@ const Oe = X((e, t) => {
  * limitations under the License.
  * =============================================================================
  */
-function qs(e, t, n, s) {
-  const o = H(e, t.dtype);
+function Ls(e, t, n, s) {
+  const o = K(e, t.dtype);
   for (let a = 0; a < o.size; a++) {
     const r = o.indexToLoc(a), i = new Array(r.length);
     for (let l = 0; l < i.length; l++)
@@ -2652,7 +2652,7 @@ function qs(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-class Us {
+class Ps {
   constructor(t, n, s, o, a, r) {
     this.separator = pt(t), this.nGramWidths = n, this.leftPad = pt(s), this.rightPad = pt(o), this.padWidth = a, this.preserveShort = r;
   }
@@ -2666,28 +2666,28 @@ class Us {
   createNGrams(t, n, s, o, a, r) {
     for (let i = 0; i < a; ++i) {
       const l = this.getPadWidth(r), u = Math.max(0, l - i), h = Math.max(0, l - (a - (i + 1))), f = r - (u + h), p = n + (u > 0 ? 0 : i - l);
-      let I = 0;
-      I += u * this.leftPad.length;
+      let w = 0;
+      w += u * this.leftPad.length;
       for (let b = 0; b < f; ++b)
-        I += t[p + b].length;
-      I += h * this.rightPad.length;
+        w += t[p + b].length;
+      w += h * this.rightPad.length;
       const m = u + h + f - 1;
-      I += m * this.separator.length, s[o + i] = new Uint8Array(I);
+      w += m * this.separator.length, s[o + i] = new Uint8Array(w);
       const F = s[o + i];
-      let g = 0;
-      const d = (b) => b.forEach((k) => F[g++] = k);
+      let d = 0;
+      const g = (b) => b.forEach((k) => F[d++] = k);
       for (let b = 0; b < u; ++b)
-        d(this.leftPad), d(this.separator);
+        g(this.leftPad), g(this.separator);
       for (let b = 0; b < f - 1; ++b)
-        d(t[p + b]), d(this.separator);
+        g(t[p + b]), g(this.separator);
       if (f > 0) {
-        d(t[p + f - 1]);
+        g(t[p + f - 1]);
         for (let b = 0; b < h; ++b)
-          d(this.separator), d(this.rightPad);
+          g(this.separator), g(this.rightPad);
       } else {
         for (let b = 0; b < h - 1; ++b)
-          d(this.rightPad), d(this.separator);
-        d(this.rightPad);
+          g(this.rightPad), g(this.separator);
+        g(this.rightPad);
       }
     }
   }
@@ -2709,7 +2709,7 @@ class Us {
       if (l !== s)
         throw new Error(`Last split value must be data size. Expected ${s}, got ${l}`);
     }
-    const a = o - 1, r = D("int32", o);
+    const a = o - 1, r = W("int32", o);
     if (s === 0 || o === 0) {
       const l = new Array(s);
       for (let u = 0; u <= a; ++u)
@@ -2729,8 +2729,8 @@ class Us {
       const u = n[l];
       let h = r[l];
       if (this.nGramWidths.forEach((f) => {
-        const p = n[l + 1] - n[l], I = this.getNumNGrams(p, f);
-        this.createNGrams(t, u, i, h, I, f), h += I;
+        const p = n[l + 1] - n[l], w = this.getNumNGrams(p, f);
+        this.createNGrams(t, u, i, h, w, f), h += w;
       }), this.preserveShort && h === r[l]) {
         const f = n[l + 1] - n[l];
         if (f === 0)
@@ -2742,8 +2742,8 @@ class Us {
     return [i, r];
   }
 }
-function Ms(e, t, n, s, o, a, r, i) {
-  return new Us(n, s, o, a, r, i).compute(e, t);
+function qs(e, t, n, s, o, a, r, i) {
+  return new Ps(n, s, o, a, r, i).compute(e, t);
 }
 /**
  * @license
@@ -2761,7 +2761,7 @@ function Ms(e, t, n, s, o, a, r, i) {
  * limitations under the License.
  * =============================================================================
  */
-function Os(e, t, n, s) {
+function As(e, t, n, s) {
   if (!e.length)
     return;
   if (t.length === 0) {
@@ -2786,21 +2786,21 @@ function Os(e, t, n, s) {
       (!n || r.length !== 0) && s.push(r), o = a + 1;
     }
 }
-function Ls(e, t, n) {
+function _s(e, t, n) {
   const s = e.length, o = [];
   let a = 0, r = 0;
   const i = new Array(s);
   for (let p = 0; p < s; ++p) {
-    const I = o.length;
-    Os(e[p], t, n, o);
-    const m = o.length - I;
+    const w = o.length;
+    As(e[p], t, n, o);
+    const m = o.length - w;
     i[p] = m, a += m, r = Math.max(r, m);
   }
-  const l = D("int32", a * 2), u = new Array(a), h = [s, r];
+  const l = W("int32", a * 2), u = new Array(a), h = [s, r];
   let f = 0;
   for (let p = 0; p < s; ++p)
-    for (let I = 0; I < i[p]; ++I)
-      l[f * 2] = p, l[f * 2 + 1] = I, u[f] = o[f], ++f;
+    for (let w = 0; w < i[p]; ++w)
+      l[f * 2] = p, l[f * 2 + 1] = w, u[f] = o[f], ++f;
   return [l, u, h];
 }
 /**
@@ -2819,10 +2819,10 @@ function Ls(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-function As(e, t) {
-  const n = D("int32", e.length);
+function Vs(e, t) {
+  const n = W("int32", e.length);
   for (let s = 0; s < e.length; ++s)
-    n[s] = Mn(e[s]).modulo(t).getLowBitsUnsigned();
+    n[s] = qn(e[s]).modulo(t).getLowBitsUnsigned();
   return n;
 }
 /**
@@ -2841,10 +2841,10 @@ function As(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-const Le = W((e, t) => e - t), _s = Ft((e, t, n, s) => ({ real: e - n, imag: t - s })), Vs = z(se, Le, _s), Ro = {
+const _e = $((e, t) => e - t), Cs = Ft((e, t, n, s) => ({ real: e - n, imag: t - s })), Ds = z(se, _e, Cs), To = {
   kernelName: se,
   backendName: "cpu",
-  kernelFunc: Vs
+  kernelFunc: Ds
 };
 /**
  * @license
@@ -2862,11 +2862,11 @@ const Le = W((e, t) => e - t), _s = Ft((e, t, n, s) => ({ real: e - n, imag: t -
  * limitations under the License.
  * =============================================================================
  */
-function Ds(e, t) {
+function Ws(e, t) {
   const n = new Array(e.rank);
   for (let o = 0; o < n.length; o++)
     n[o] = e.shape[o] * t[o];
-  const s = H(n, e.dtype);
+  const s = K(n, e.dtype);
   for (let o = 0; o < s.values.length; ++o) {
     const a = s.indexToLoc(o), r = new Array(e.rank);
     for (let l = 0; l < r.length; l++)
@@ -2896,11 +2896,11 @@ const rt = (e, t) => {
   const n = t.value - e.value;
   return n === 0 ? e.index - t.index : n;
 };
-function Ae(e, t, n = 0, s = e.length - 1) {
+function Ve(e, t, n = 0, s = e.length - 1) {
   for (; s > n; ) {
     if (s - n > 600) {
-      const i = s - n + 1, l = t - n + 1, u = Math.log(i), h = 0.5 * Math.exp(2 * u / 3), f = 0.5 * Math.sqrt(u * h * (i - h) / i) * Math.sign(l - i / 2), p = Math.max(n, Math.floor(t - l * h / i + f)), I = Math.min(s, Math.floor(t + (i - l) * h / i + f));
-      Ae(e, t, p, I);
+      const i = s - n + 1, l = t - n + 1, u = Math.log(i), h = 0.5 * Math.exp(2 * u / 3), f = 0.5 * Math.sqrt(u * h * (i - h) / i) * Math.sign(l - i / 2), p = Math.max(n, Math.floor(t - l * h / i + f)), w = Math.min(s, Math.floor(t + (i - l) * h / i + f));
+      Ve(e, t, p, w);
     }
     const o = e[t];
     let a = n, r = s;
@@ -2913,20 +2913,20 @@ function Ae(e, t, n = 0, s = e.length - 1) {
     rt(e[n], o) === 0 ? ot(e, n, r) : (r = r + 1, ot(e, r, s)), r <= t && (n = r + 1), t <= r && (s = r - 1);
   }
 }
-function Ws(e, t, n, s, o) {
+function $s(e, t, n, s, o) {
   const a = t[t.length - 1], [r, i] = [e.length / a, a], l = et(n, r * s), u = et("int32", r * s);
   for (let f = 0; f < r; f++) {
-    const p = f * i, I = e.subarray(p, p + i);
-    let m = new Array(I.length);
-    I.forEach((b, k) => m[k] = { value: b, index: k }), s < m.length && (Ae(m, s), m = m.slice(0, s)), o && m.sort(rt);
-    const F = f * s, g = l.subarray(F, F + s), d = u.subarray(F, F + s);
+    const p = f * i, w = e.subarray(p, p + i);
+    let m = new Array(w.length);
+    w.forEach((b, k) => m[k] = { value: b, index: k }), s < m.length && (Ve(m, s), m = m.slice(0, s)), o && m.sort(rt);
+    const F = f * s, d = l.subarray(F, F + s), g = u.subarray(F, F + s);
     for (let b = 0; b < s; b++)
-      g[b] = m[b].value, d[b] = m[b].index;
+      d[b] = m[b].value, g[b] = m[b].index;
   }
   const h = t.slice();
   return h[h.length - 1] = s, [
-    H(h, n, l),
-    H(h, "int32", u)
+    K(h, n, l),
+    K(h, "int32", u)
   ];
 }
 /**
@@ -2945,45 +2945,45 @@ function Ws(e, t, n, s, o) {
  * limitations under the License.
  * =============================================================================
  */
-function $s(e, t, n, s) {
-  const o = Yt(t, n)[0], a = [1, n[0], 1];
+function Us(e, t, n, s) {
+  const o = Jt(t, n)[0], a = [1, n[0], 1];
   for (let m = 0; m < o; m++)
     a[0] *= n[m];
   a[1] = n[o];
   for (let m = o + 1; m < n.length; m++)
     a[2] *= n[m];
-  const r = /* @__PURE__ */ new Map(), i = new Int32Array(n[o]), l = new wt(a, s, e), u = [], h = a[0] === 1 && a[2] === 1;
+  const r = /* @__PURE__ */ new Map(), i = new Int32Array(n[o]), l = new It(a, s, e), u = [], h = a[0] === 1 && a[2] === 1;
   for (let m = 0; m < n[o]; m++) {
     let F;
     if (h)
       F = e[m].toString();
     else {
-      const d = [];
+      const g = [];
       for (let b = 0; b < a[0]; b++)
         for (let k = 0; k < a[2]; k++)
-          d.push(l.get(b, m, k));
-      F = d.join(",");
+          g.push(l.get(b, m, k));
+      F = g.join(",");
     }
-    const g = r.get(F);
-    if (g != null)
-      i[m] = g;
+    const d = r.get(F);
+    if (d != null)
+      i[m] = d;
     else {
-      const d = r.size;
-      r.set(F, d), i[m] = d, u.push(m);
+      const g = r.size;
+      r.set(F, g), i[m] = g, u.push(m);
     }
   }
   const f = a.slice();
   f[1] = r.size;
-  const p = new wt(f, s);
+  const p = new It(f, s);
   u.forEach((m, F) => {
-    for (let g = 0; g < a[0]; g++)
-      for (let d = 0; d < a[2]; d++)
-        p.set(l.get(g, m, d), g, F, d);
+    for (let d = 0; d < a[0]; d++)
+      for (let g = 0; g < a[2]; g++)
+        p.set(l.get(d, m, g), d, F, g);
   });
-  const I = n.slice();
-  return I[o] = f[1], {
+  const w = n.slice();
+  return w[o] = f[1], {
     outputValues: p.values,
-    outputShape: I,
+    outputShape: w,
     indices: i
   };
 }
@@ -3003,22 +3003,22 @@ function $s(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-const zs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const Ro = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   addImpl: he,
-  bincountImpl: _n,
-  bincountReduceImpl: Vn,
+  bincountImpl: Cn,
+  bincountReduceImpl: Dn,
   bitwiseAndImpl: fe,
   castImpl: ue,
-  ceilImpl: de,
-  concatImpl: $n,
+  ceilImpl: ge,
+  concatImpl: Un,
   equalImpl: me,
   expImpl: pe,
-  expm1Impl: Ie,
+  expm1Impl: we,
   floorDivImpl: be,
-  floorImpl: we,
-  gatherNdImpl: Hn,
-  gatherV2Impl: Kn,
+  floorImpl: Ie,
+  gatherNdImpl: Kn,
+  gatherV2Impl: Hn,
   greaterEqualImpl: Ee,
   greaterImpl: xe,
   lessEqualImpl: ye,
@@ -3027,173 +3027,108 @@ const zs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   logImpl: ke,
   maxImpl: ns,
   maximumImpl: Ne,
-  minimumImpl: Se,
+  minimumImpl: ve,
   multiplyImpl: yt,
-  negImpl: ve,
+  negImpl: Se,
   notEqualImpl: Te,
-  prodImpl: Ce,
+  prodImpl: Oe,
   raggedGatherImpl: ps,
-  raggedRangeImpl: Is,
-  raggedTensorToTensorImpl: ws,
+  raggedRangeImpl: ws,
+  raggedTensorToTensorImpl: Is,
   rangeImpl: bs,
-  rsqrtImpl: qe,
+  rsqrtImpl: Le,
   scatterImpl: Es,
   sigmoidImpl: Fs,
   simpleAbsImpl: le,
-  sliceImpl: Ue,
+  sliceImpl: Pe,
   sparseFillEmptyRowsImpl: Ns,
-  sparseReshapeImpl: Ss,
-  sparseSegmentReductionImpl: vs,
+  sparseReshapeImpl: vs,
+  sparseSegmentReductionImpl: Ss,
   sqrtImpl: Ts,
-  squaredDifferenceImpl: Me,
-  staticRegexReplaceImpl: Oe,
-  stridedSliceImpl: qs,
-  stringNGramsImpl: Ms,
-  stringSplitImpl: Ls,
-  stringToHashBucketFastImpl: As,
-  subImpl: Le,
-  tileImpl: Ds,
-  topKImpl: Ws,
+  squaredDifferenceImpl: qe,
+  staticRegexReplaceImpl: Ae,
+  stridedSliceImpl: Ls,
+  stringNGramsImpl: qs,
+  stringSplitImpl: _s,
+  stringToHashBucketFastImpl: Vs,
+  subImpl: _e,
+  tileImpl: Ws,
+  topKImpl: $s,
   transposeImpl: Re,
-  uniqueImpl: $s
+  uniqueImpl: Us
 }, Symbol.toStringTag, { value: "Module" }));
-/**
- * @license
- * Copyright 2020 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-const { addImpl: Po, bincountImpl: Co, bincountReduceImpl: qo, bitwiseAndImpl: Uo, castImpl: Mo, ceilImpl: Oo, concatImpl: Lo, equalImpl: Ao, expImpl: _o, expm1Impl: Vo, floorImpl: Do, gatherNdImpl: Wo, gatherV2Impl: $o, greaterImpl: zo, greaterEqualImpl: Bo, lessImpl: Go, lessEqualImpl: jo, linSpaceImpl: Zo, logImpl: Ho, maxImpl: Ko, maximumImpl: Xo, minimumImpl: Yo, multiplyImpl: Jo, negImpl: Qo, notEqualImpl: tr, prodImpl: er, raggedGatherImpl: nr, raggedRangeImpl: sr, raggedTensorToTensorImpl: or, rangeImpl: rr, rsqrtImpl: ar, scatterImpl: ir, sigmoidImpl: lr, simpleAbsImpl: cr, sliceImpl: ur, sparseFillEmptyRowsImpl: hr, sparseReshapeImpl: fr, sparseSegmentReductionImpl: gr, sqrtImpl: dr, staticRegexReplaceImpl: mr, stridedSliceImpl: pr, stringNGramsImpl: Ir, stringSplitImpl: wr, stringToHashBucketFastImpl: br, subImpl: xr, tileImpl: Er, topKImpl: Fr, transposeImpl: yr, uniqueImpl: kr } = zs;
 export {
   uo as $,
-  ps as A,
+  ws as A,
   Is as B,
-  ws as C,
-  bs as D,
-  Es as E,
-  Ns as F,
+  bs as C,
+  Es as D,
+  Ns as E,
+  vs as F,
   Ss as G,
-  vs as H,
+  Ls as H,
   qs as I,
-  Ms as J,
-  Ls as K,
-  As as L,
-  Ds as M,
-  Ws as N,
-  $s as O,
-  zn as P,
-  Ys as Q,
+  _s as J,
+  Vs as K,
+  Ws as L,
+  $s as M,
+  Us as N,
+  zn as O,
+  Xs as P,
+  eo as Q,
   no as R,
-  so as S,
-  eo as T,
-  oo as U,
-  Js as V,
+  to as S,
+  so as T,
+  Js as U,
+  oo as V,
   ro as W,
   ao as X,
   io as Y,
   lo as Z,
   co as _,
   nt as a,
-  br as a$,
-  ho as a0,
-  Qs as a1,
+  Qs as a0,
+  ho as a1,
   fo as a2,
   go as a3,
   mo as a4,
   po as a5,
-  Io as a6,
-  wo as a7,
+  wo as a6,
+  Io as a7,
   bo as a8,
-  xo as a9,
-  $o as aA,
-  zo as aB,
-  Bo as aC,
-  Go as aD,
-  jo as aE,
-  Zo as aF,
-  Ho as aG,
-  Xo as aH,
-  Yo as aI,
-  xr as aJ,
-  Qo as aK,
-  er as aL,
-  nr as aM,
-  sr as aN,
-  or as aO,
-  rr as aP,
-  ar as aQ,
-  lr as aR,
-  hr as aS,
-  fr as aT,
-  gr as aU,
-  ir as aV,
-  dr as aW,
-  mr as aX,
-  pr as aY,
-  Ir as aZ,
-  wr as a_,
-  Fo as aa,
-  to as ab,
+  Eo as a9,
+  Ys as aa,
+  Fo as ab,
   yo as ac,
   ko as ad,
   No as ae,
-  So as af,
-  vo as ag,
+  vo as af,
+  So as ag,
   To as ah,
-  Ro as ai,
-  Eo as aj,
-  cr as ak,
-  Jo as al,
-  Po as am,
-  ur as an,
-  Co as ao,
-  Uo as ap,
-  tr as aq,
-  Mo as ar,
-  Oo as as,
-  Lo as at,
-  qo as au,
-  Ao as av,
-  _o as aw,
-  Vo as ax,
-  Do as ay,
-  Wo as az,
-  An as b,
-  Er as b0,
-  Fr as b1,
-  kr as b2,
-  W as c,
-  Pe as d,
+  xo as ai,
+  ys as b,
+  $ as c,
+  Vn as d,
   z as e,
   ks as f,
-  _n as g,
+  Cn as g,
   mt as h,
   Et as i,
-  $n as j,
-  Vn as k,
+  Un as j,
+  Dn as k,
   lt as l,
-  Ko as m,
-  as as n,
-  Vs as o,
+  as as m,
+  Ds as n,
+  Kn as o,
   Hn as p,
-  Kn as q,
+  ts as q,
   ce as r,
-  ys as s,
-  yr as t,
-  ge as u,
-  ts as v,
-  Re as w,
-  ns as x,
-  Bn as y,
+  Ro as s,
+  Me as t,
+  de as u,
+  Re as v,
+  ns as w,
+  Bn as x,
+  ps as y,
   xt as z
 };