@genai-fi/nanogpt 0.6.0 → 0.6.2

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

@@ -1,30 +1,30 @@
-import { q as $, Q as yt, ac as Y, b1 as nt, b2 as dt, b3 as gt, b4 as ht, b5 as Lt, Z as rt, ak as k, b6 as q, b7 as Mt, U as Nt, l as $t, t as At, b8 as ct, an as ut, b9 as tt, a1 as Dt } from "./index-bMBtI-WR.js";
-import { f as bt, c as Pt } from "./kernel_funcs_utils-CNmjLWnB.js";
-import { c as Wt } from "./axis_util-D17qZRQm.js";
-import { b as qt } from "./broadcast_to-BMQLjvt_.js";
-import { r as Vt } from "./reshape-T4yDEqoF.js";
-import { i as Ut, c as zt } from "./slice_util-Ddk0uxGJ.js";
-import { g as Gt } from "./_commonjsHelpers-ByX85dGu.js";
-function jt(e, t) {
+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) {
   for (var n = 0; n < t.length; n++) {
-    const r = t[n];
-    if (typeof r != "string" && !Array.isArray(r)) {
-      for (const o in r)
+    const s = t[n];
+    if (typeof s != "string" && !Array.isArray(s)) {
+      for (const o in s)
         if (o !== "default" && !(o in e)) {
-          const s = Object.getOwnPropertyDescriptor(r, o);
-          s && Object.defineProperty(e, o, s.get ? s : {
+          const a = Object.getOwnPropertyDescriptor(s, o);
+          a && Object.defineProperty(e, o, a.get ? a : {
             enumerable: !0,
-            get: () => r[o]
+            get: () => s[o]
           });
         }
     }
   }
   return Object.freeze(Object.defineProperty(e, Symbol.toStringTag, { value: "Module" }));
 }
-var at, mt;
-function Zt() {
-  if (mt) return at;
-  mt = 1, at = t;
+var It, St;
+function Tn() {
+  if (St) return It;
+  St = 1, It = t;
   var e = null;
   try {
     e = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
@@ -317,327 +317,327 @@ function Zt() {
     ])), {}).exports;
   } catch {
   }
-  function t(w, l, F) {
-    this.low = w | 0, this.high = l | 0, this.unsigned = !!F;
+  function t(w, c, E) {
+    this.low = w | 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;
   }
   t.isLong = n;
-  var r = {}, o = {};
-  function s(w, l) {
-    var F, T, _;
-    return l ? (w >>>= 0, (_ = 0 <= w && w < 256) && (T = o[w], T) ? T : (F = u(w, (w | 0) < 0 ? -1 : 0, !0), _ && (o[w] = F), F)) : (w |= 0, (_ = -128 <= w && w < 128) && (T = r[w], T) ? T : (F = u(w, w < 0 ? -1 : 0, !1), _ && (r[w] = F), F));
+  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));
   }
-  t.fromInt = s;
-  function i(w, l) {
+  t.fromInt = a;
+  function r(w, c) {
     if (isNaN(w))
-      return l ? E : d;
-    if (l) {
+      return c ? b : d;
+    if (c) {
       if (w < 0)
-        return E;
+        return b;
       if (w >= m)
-        return z;
+        return C;
     } else {
-      if (w <= -b)
-        return L;
-      if (w + 1 >= b)
-        return V;
+      if (w <= -F)
+        return v;
+      if (w + 1 >= F)
+        return P;
     }
-    return w < 0 ? i(-w, l).neg() : u(w % I | 0, w / I | 0, l);
+    return w < 0 ? r(-w, c).neg() : i(w % I | 0, w / I | 0, c);
   }
-  t.fromNumber = i;
-  function u(w, l, F) {
-    return new t(w, l, F);
+  t.fromNumber = r;
+  function i(w, c, E) {
+    return new t(w, c, E);
   }
-  t.fromBits = u;
-  var a = Math.pow;
-  function h(w, l, F) {
+  t.fromBits = i;
+  var l = Math.pow;
+  function u(w, c, E) {
     if (w.length === 0)
       throw Error("empty string");
     if (w === "NaN" || w === "Infinity" || w === "+Infinity" || w === "-Infinity")
       return d;
-    if (typeof l == "number" ? (F = l, l = !1) : l = !!l, F = F || 10, F < 2 || 36 < F)
+    if (typeof c == "number" ? (E = c, c = !1) : c = !!c, E = E || 10, E < 2 || 36 < E)
       throw RangeError("radix");
-    var T;
-    if ((T = w.indexOf("-")) > 0)
+    var N;
+    if ((N = w.indexOf("-")) > 0)
       throw Error("interior hyphen");
-    if (T === 0)
-      return h(w.substring(1), l, F).neg();
-    for (var _ = i(a(F, 8)), O = d, M = 0; M < w.length; M += 8) {
-      var G = Math.min(8, w.length - M), Z = parseInt(w.substring(M, M + G), F);
-      if (G < 8) {
-        var P = i(a(F, G));
-        O = O.mul(P).add(i(Z));
+    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));
       } else
-        O = O.mul(_), O = O.add(i(Z));
+        R = R.mul(q), R = R.add(r(G));
     }
-    return O.unsigned = l, O;
+    return R.unsigned = c, R;
   }
-  t.fromString = h;
-  function c(w, l) {
-    return typeof w == "number" ? i(w, l) : typeof w == "string" ? h(w, l) : u(w.low, w.high, typeof l == "boolean" ? l : w.unsigned);
+  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);
   }
-  t.fromValue = c;
-  var f = 65536, p = 1 << 24, I = f * f, m = I * I, b = m / 2, g = s(p), d = s(0);
+  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 E = s(0, !0);
-  t.UZERO = E;
-  var R = s(1);
-  t.ONE = R;
-  var x = s(1, !0);
-  t.UONE = x;
-  var D = s(-1);
-  t.NEG_ONE = D;
-  var V = u(-1, 2147483647, !1);
-  t.MAX_VALUE = V;
-  var z = u(-1, -1, !0);
-  t.MAX_UNSIGNED_VALUE = z;
-  var L = u(0, -2147483648, !1);
-  t.MIN_VALUE = L;
-  var S = t.prototype;
-  return S.toInt = function() {
+  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 x = t.prototype;
+  return x.toInt = function() {
     return this.unsigned ? this.low >>> 0 : this.low;
-  }, S.toNumber = function() {
+  }, x.toNumber = function() {
     return this.unsigned ? (this.high >>> 0) * I + (this.low >>> 0) : this.high * I + (this.low >>> 0);
-  }, S.toString = function(l) {
-    if (l = l || 10, l < 2 || 36 < l)
+  }, 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(L)) {
-        var F = i(l), T = this.div(F), _ = T.mul(F).sub(this);
-        return T.toString(l) + _.toInt().toString(l);
+      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);
       } else
-        return "-" + this.neg().toString(l);
-    for (var O = i(a(l, 6), this.unsigned), M = this, G = ""; ; ) {
-      var Z = M.div(O), P = M.sub(Z.mul(O)).toInt() >>> 0, y = P.toString(l);
-      if (M = Z, M.isZero())
-        return y + G;
-      for (; y.length < 6; )
-        y = "0" + y;
-      G = "" + y + G;
+        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 + $;
     }
-  }, S.getHighBits = function() {
+  }, x.getHighBits = function() {
     return this.high;
-  }, S.getHighBitsUnsigned = function() {
+  }, x.getHighBitsUnsigned = function() {
     return this.high >>> 0;
-  }, S.getLowBits = function() {
+  }, x.getLowBits = function() {
     return this.low;
-  }, S.getLowBitsUnsigned = function() {
+  }, x.getLowBitsUnsigned = function() {
     return this.low >>> 0;
-  }, S.getNumBitsAbs = function() {
+  }, x.getNumBitsAbs = function() {
     if (this.isNegative())
-      return this.eq(L) ? 64 : this.neg().getNumBitsAbs();
-    for (var l = this.high != 0 ? this.high : this.low, F = 31; F > 0 && (l & 1 << F) == 0; F--)
+      return this.eq(v) ? 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 ? F + 33 : F + 1;
-  }, S.isZero = function() {
+    return this.high != 0 ? E + 33 : E + 1;
+  }, x.isZero = function() {
     return this.high === 0 && this.low === 0;
-  }, S.eqz = S.isZero, S.isNegative = function() {
+  }, x.eqz = x.isZero, x.isNegative = function() {
     return !this.unsigned && this.high < 0;
-  }, S.isPositive = function() {
+  }, x.isPositive = function() {
     return this.unsigned || this.high >= 0;
-  }, S.isOdd = function() {
+  }, x.isOdd = function() {
     return (this.low & 1) === 1;
-  }, S.isEven = function() {
+  }, x.isEven = function() {
     return (this.low & 1) === 0;
-  }, S.equals = function(l) {
-    return n(l) || (l = c(l)), this.unsigned !== l.unsigned && this.high >>> 31 === 1 && l.high >>> 31 === 1 ? !1 : this.high === l.high && this.low === l.low;
-  }, S.eq = S.equals, S.notEquals = function(l) {
+  }, x.equals = function(c) {
+    return n(c) || (c = h(c)), this.unsigned !== c.unsigned && this.high >>> 31 === 1 && c.high >>> 31 === 1 ? !1 : this.high === c.high && this.low === c.low;
+  }, x.eq = x.equals, x.notEquals = function(c) {
     return !this.eq(
       /* validates */
-      l
+      c
     );
-  }, S.neq = S.notEquals, S.ne = S.notEquals, S.lessThan = function(l) {
+  }, x.neq = x.notEquals, x.ne = x.notEquals, x.lessThan = function(c) {
     return this.comp(
       /* validates */
-      l
+      c
     ) < 0;
-  }, S.lt = S.lessThan, S.lessThanOrEqual = function(l) {
+  }, x.lt = x.lessThan, x.lessThanOrEqual = function(c) {
     return this.comp(
       /* validates */
-      l
+      c
     ) <= 0;
-  }, S.lte = S.lessThanOrEqual, S.le = S.lessThanOrEqual, S.greaterThan = function(l) {
+  }, x.lte = x.lessThanOrEqual, x.le = x.lessThanOrEqual, x.greaterThan = function(c) {
     return this.comp(
       /* validates */
-      l
+      c
     ) > 0;
-  }, S.gt = S.greaterThan, S.greaterThanOrEqual = function(l) {
+  }, x.gt = x.greaterThan, x.greaterThanOrEqual = function(c) {
     return this.comp(
       /* validates */
-      l
+      c
     ) >= 0;
-  }, S.gte = S.greaterThanOrEqual, S.ge = S.greaterThanOrEqual, S.compare = function(l) {
-    if (n(l) || (l = c(l)), this.eq(l))
+  }, x.gte = x.greaterThanOrEqual, x.ge = x.greaterThanOrEqual, x.compare = function(c) {
+    if (n(c) || (c = h(c)), this.eq(c))
       return 0;
-    var F = this.isNegative(), T = l.isNegative();
-    return F && !T ? -1 : !F && T ? 1 : this.unsigned ? l.high >>> 0 > this.high >>> 0 || l.high === this.high && l.low >>> 0 > this.low >>> 0 ? -1 : 1 : this.sub(l).isNegative() ? -1 : 1;
-  }, S.comp = S.compare, S.negate = function() {
-    return !this.unsigned && this.eq(L) ? L : this.not().add(R);
-  }, S.neg = S.negate, S.add = function(l) {
-    n(l) || (l = c(l));
-    var F = this.high >>> 16, T = this.high & 65535, _ = this.low >>> 16, O = this.low & 65535, M = l.high >>> 16, G = l.high & 65535, Z = l.low >>> 16, P = l.low & 65535, y = 0, C = 0, A = 0, j = 0;
-    return j += O + P, A += j >>> 16, j &= 65535, A += _ + Z, C += A >>> 16, A &= 65535, C += T + G, y += C >>> 16, C &= 65535, y += F + M, y &= 65535, u(A << 16 | j, y << 16 | C, this.unsigned);
-  }, S.subtract = function(l) {
-    return n(l) || (l = c(l)), this.add(l.neg());
-  }, S.sub = S.subtract, S.multiply = function(l) {
+    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);
+  }, 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);
+  }, 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;
-    if (n(l) || (l = c(l)), e) {
-      var F = e.mul(
+    if (n(c) || (c = h(c)), e) {
+      var E = e.mul(
         this.low,
         this.high,
-        l.low,
-        l.high
+        c.low,
+        c.high
       );
-      return u(F, e.get_high(), this.unsigned);
+      return i(E, e.get_high(), this.unsigned);
     }
-    if (l.isZero())
+    if (c.isZero())
       return d;
-    if (this.eq(L))
-      return l.isOdd() ? L : d;
-    if (l.eq(L))
-      return this.isOdd() ? L : d;
+    if (this.eq(v))
+      return c.isOdd() ? v : d;
+    if (c.eq(v))
+      return this.isOdd() ? v : d;
     if (this.isNegative())
-      return l.isNegative() ? this.neg().mul(l.neg()) : this.neg().mul(l).neg();
-    if (l.isNegative())
-      return this.mul(l.neg()).neg();
-    if (this.lt(g) && l.lt(g))
-      return i(this.toNumber() * l.toNumber(), this.unsigned);
-    var T = this.high >>> 16, _ = this.high & 65535, O = this.low >>> 16, M = this.low & 65535, G = l.high >>> 16, Z = l.high & 65535, P = l.low >>> 16, y = l.low & 65535, C = 0, A = 0, j = 0, ot = 0;
-    return ot += M * y, j += ot >>> 16, ot &= 65535, j += O * y, A += j >>> 16, j &= 65535, j += M * P, A += j >>> 16, j &= 65535, A += _ * y, C += A >>> 16, A &= 65535, A += O * P, C += A >>> 16, A &= 65535, A += M * Z, C += A >>> 16, A &= 65535, C += T * y + _ * P + O * Z + M * G, C &= 65535, u(j << 16 | ot, C << 16 | A, this.unsigned);
-  }, S.mul = S.multiply, S.divide = function(l) {
-    if (n(l) || (l = c(l)), l.isZero())
+      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))
+      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);
+  }, x.mul = x.multiply, x.divide = function(c) {
+    if (n(c) || (c = h(c)), c.isZero())
       throw Error("division by zero");
     if (e) {
-      if (!this.unsigned && this.high === -2147483648 && l.low === -1 && l.high === -1)
+      if (!this.unsigned && this.high === -2147483648 && c.low === -1 && c.high === -1)
         return this;
-      var F = (this.unsigned ? e.div_u : e.div_s)(
+      var E = (this.unsigned ? e.div_u : e.div_s)(
         this.low,
         this.high,
-        l.low,
-        l.high
+        c.low,
+        c.high
       );
-      return u(F, e.get_high(), this.unsigned);
+      return i(E, e.get_high(), this.unsigned);
     }
     if (this.isZero())
-      return this.unsigned ? E : d;
-    var T, _, O;
+      return this.unsigned ? b : d;
+    var N, q, R;
     if (this.unsigned) {
-      if (l.unsigned || (l = l.toUnsigned()), l.gt(this))
-        return E;
-      if (l.gt(this.shru(1)))
-        return x;
-      O = E;
+      if (c.unsigned || (c = c.toUnsigned()), c.gt(this))
+        return b;
+      if (c.gt(this.shru(1)))
+        return y;
+      R = b;
     } else {
-      if (this.eq(L)) {
-        if (l.eq(R) || l.eq(D))
-          return L;
-        if (l.eq(L))
-          return R;
+      if (this.eq(v)) {
+        if (c.eq(k) || c.eq(S))
+          return v;
+        if (c.eq(v))
+          return k;
         var M = this.shr(1);
-        return T = M.div(l).shl(1), T.eq(d) ? l.isNegative() ? R : D : (_ = this.sub(l.mul(T)), O = T.add(_.div(l)), O);
-      } else if (l.eq(L))
-        return this.unsigned ? E : d;
+        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;
       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();
-      O = d;
+        return c.isNegative() ? this.neg().div(c.neg()) : this.neg().div(c).neg();
+      if (c.isNegative())
+        return this.div(c.neg()).neg();
+      R = d;
     }
-    for (_ = this; _.gte(l); ) {
-      T = Math.max(1, Math.floor(_.toNumber() / l.toNumber()));
-      for (var G = Math.ceil(Math.log(T) / Math.LN2), Z = G <= 48 ? 1 : a(2, G - 48), P = i(T), y = P.mul(l); y.isNegative() || y.gt(_); )
-        T -= Z, P = i(T, this.unsigned), y = P.mul(l);
-      P.isZero() && (P = R), O = O.add(P), _ = _.sub(y);
+    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);
     }
-    return O;
-  }, S.div = S.divide, S.modulo = function(l) {
-    if (n(l) || (l = c(l)), e) {
-      var F = (this.unsigned ? e.rem_u : e.rem_s)(
+    return R;
+  }, x.div = x.divide, x.modulo = function(c) {
+    if (n(c) || (c = h(c)), e) {
+      var E = (this.unsigned ? e.rem_u : e.rem_s)(
         this.low,
         this.high,
-        l.low,
-        l.high
+        c.low,
+        c.high
       );
-      return u(F, e.get_high(), this.unsigned);
+      return i(E, e.get_high(), this.unsigned);
     }
-    return this.sub(this.div(l).mul(l));
-  }, S.mod = S.modulo, S.rem = S.modulo, S.not = function() {
-    return u(~this.low, ~this.high, this.unsigned);
-  }, S.and = function(l) {
-    return n(l) || (l = c(l)), u(this.low & l.low, this.high & l.high, this.unsigned);
-  }, S.or = function(l) {
-    return n(l) || (l = c(l)), u(this.low | l.low, this.high | l.high, this.unsigned);
-  }, S.xor = function(l) {
-    return n(l) || (l = c(l)), u(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 ? u(this.low << l, this.high << l | this.low >>> 32 - l, this.unsigned) : u(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 ? u(this.low >>> l | this.high << 32 - l, this.high >> l, this.unsigned) : u(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.sub(this.div(c).mul(c));
+  }, x.mod = x.modulo, x.rem = x.modulo, x.not = function() {
+    return i(~this.low, ~this.high, this.unsigned);
+  }, x.and = function(c) {
+    return n(c) || (c = h(c)), i(this.low & c.low, this.high & c.high, this.unsigned);
+  }, x.or = function(c) {
+    return n(c) || (c = h(c)), i(this.low | c.low, this.high | c.high, this.unsigned);
+  }, x.xor = function(c) {
+    return n(c) || (c = h(c)), i(this.low ^ c.low, this.high ^ c.high, this.unsigned);
+  }, x.shiftLeft = function(c) {
+    return n(c) && (c = c.toInt()), (c &= 63) === 0 ? this : c < 32 ? i(this.low << c, this.high << c | this.low >>> 32 - c, this.unsigned) : i(0, this.low << c - 32, this.unsigned);
+  }, x.shl = x.shiftLeft, x.shiftRight = function(c) {
+    return n(c) && (c = c.toInt()), (c &= 63) === 0 ? this : c < 32 ? i(this.low >>> c | this.high << 32 - c, this.high >> c, this.unsigned) : i(this.high >> c - 32, this.high >= 0 ? 0 : -1, this.unsigned);
+  }, x.shr = x.shiftRight, x.shiftRightUnsigned = function(c) {
+    if (n(c) && (c = c.toInt()), c &= 63, c === 0)
       return this;
-    var F = this.high;
-    if (l < 32) {
-      var T = this.low;
-      return u(T >>> l | F << 32 - l, F >>> l, this.unsigned);
-    } else return l === 32 ? u(F, 0, this.unsigned) : u(F >>> l - 32, 0, this.unsigned);
-  }, S.shru = S.shiftRightUnsigned, S.shr_u = S.shiftRightUnsigned, S.toSigned = function() {
-    return this.unsigned ? u(this.low, this.high, !1) : this;
-  }, S.toUnsigned = function() {
-    return this.unsigned ? this : u(this.low, this.high, !0);
-  }, S.toBytes = function(l) {
-    return l ? this.toBytesLE() : this.toBytesBE();
-  }, S.toBytesLE = function() {
-    var l = this.high, F = this.low;
+    var E = this.high;
+    if (c < 32) {
+      var N = this.low;
+      return i(N >>> c | E << 32 - c, E >>> c, this.unsigned);
+    } else return c === 32 ? i(E, 0, this.unsigned) : i(E >>> c - 32, 0, this.unsigned);
+  }, x.shru = x.shiftRightUnsigned, x.shr_u = x.shiftRightUnsigned, x.toSigned = function() {
+    return this.unsigned ? i(this.low, this.high, !1) : this;
+  }, x.toUnsigned = function() {
+    return this.unsigned ? this : i(this.low, this.high, !0);
+  }, x.toBytes = function(c) {
+    return c ? this.toBytesLE() : this.toBytesBE();
+  }, x.toBytesLE = function() {
+    var c = this.high, E = this.low;
     return [
-      F & 255,
-      F >>> 8 & 255,
-      F >>> 16 & 255,
-      F >>> 24,
-      l & 255,
-      l >>> 8 & 255,
-      l >>> 16 & 255,
-      l >>> 24
+      E & 255,
+      E >>> 8 & 255,
+      E >>> 16 & 255,
+      E >>> 24,
+      c & 255,
+      c >>> 8 & 255,
+      c >>> 16 & 255,
+      c >>> 24
     ];
-  }, S.toBytesBE = function() {
-    var l = this.high, F = this.low;
+  }, x.toBytesBE = function() {
+    var c = this.high, E = this.low;
     return [
-      l >>> 24,
-      l >>> 16 & 255,
-      l >>> 8 & 255,
-      l & 255,
-      F >>> 24,
-      F >>> 16 & 255,
-      F >>> 8 & 255,
-      F & 255
+      c >>> 24,
+      c >>> 16 & 255,
+      c >>> 8 & 255,
+      c & 255,
+      E >>> 24,
+      E >>> 16 & 255,
+      E >>> 8 & 255,
+      E & 255
     ];
-  }, t.fromBytes = function(l, F, T) {
-    return T ? t.fromBytesLE(l, F) : t.fromBytesBE(l, F);
-  }, t.fromBytesLE = function(l, F) {
+  }, t.fromBytes = function(c, E, N) {
+    return N ? t.fromBytesLE(c, E) : t.fromBytesBE(c, E);
+  }, t.fromBytesLE = function(c, E) {
     return new t(
-      l[0] | l[1] << 8 | l[2] << 16 | l[3] << 24,
-      l[4] | l[5] << 8 | l[6] << 16 | l[7] << 24,
-      F
+      c[0] | c[1] << 8 | c[2] << 16 | c[3] << 24,
+      c[4] | c[5] << 8 | c[6] << 16 | c[7] << 24,
+      E
     );
-  }, t.fromBytesBE = function(l, F) {
+  }, t.fromBytesBE = function(c, E) {
     return new t(
-      l[4] << 24 | l[5] << 16 | l[6] << 8 | l[7],
-      l[0] << 24 | l[1] << 16 | l[2] << 8 | l[3],
-      F
+      c[4] << 24 | c[5] << 16 | c[6] << 8 | c[7],
+      c[0] << 24 | c[1] << 16 | c[2] << 8 | c[3],
+      E
     );
-  }, at;
+  }, It;
 }
-var xt = Zt();
-const Rt = /* @__PURE__ */ Gt(xt), Ct = /* @__PURE__ */ jt({
+var oe = Tn();
+const re = /* @__PURE__ */ Sn(oe), Rn = /* @__PURE__ */ vn({
   __proto__: null,
-  default: Rt
-}, [xt]);
+  default: re
+}, [oe]);
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -654,86 +654,86 @@ const Rt = /* @__PURE__ */ Gt(xt), Ct = /* @__PURE__ */ jt({
  * limitations under the License.
  * =============================================================================
  */
-const J = (
+const tt = (
   // tslint:disable-next-line
-  Rt || Ct
+  re || Rn
 );
-function lt(e) {
-  return J.fromString(e, !0, 16);
+function dt(e) {
+  return tt.fromString(e, !0, 16);
 }
-const Tt = lt("c3a5c85c97cb3127"), Q = lt("b492b66fbe98f273"), W = lt("9ae16a3b2f90404f");
-function ft(e) {
+const ae = dt("c3a5c85c97cb3127"), Q = dt("b492b66fbe98f273"), V = dt("9ae16a3b2f90404f");
+function bt(e) {
   return e.xor(e.shru(47));
 }
-function vt(e, t, n) {
-  const r = e.slice(t, t + n);
-  return J.fromBytes(Array.from(r), !0, !0);
+function ie(e, t, n) {
+  const s = e.slice(t, t + n);
+  return tt.fromBytes(Array.from(s), !0, !0);
 }
-function v(e, t) {
-  return vt(e, t, 8);
+function T(e, t) {
+  return ie(e, t, 8);
 }
-function wt(e, t) {
-  return vt(e, t, 4);
+function vt(e, t) {
+  return ie(e, t, 4);
 }
-function N(e, t) {
+function O(e, t) {
   return t === 0 ? e : e.shru(t).or(e.shl(64 - t));
 }
-function X(e, t, n = lt("9ddfea08eb382d69")) {
-  let r = e.xor(t).mul(n);
-  r = r.xor(r.shru(47));
-  let o = t.xor(r).mul(n);
+function Y(e, t, n = dt("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 Bt(e, t, n, r, o, s) {
-  o = o.add(e), s = N(s.add(o).add(r), 21);
-  const i = o;
-  return o = o.add(t), o = o.add(n), s = s.add(N(o, 44)), [o.add(r), s.add(i)];
+function Pn(e, t, n, s, o, a) {
+  o = o.add(e), a = O(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)];
 }
-function st(e, t, n, r) {
-  return Bt(v(e, t), v(e, t + 8), v(e, t + 16), v(e, t + 24), n, 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);
 }
-function kt(e, t = e.length) {
+function Cn(e, t = e.length) {
   if (t >= 8) {
-    const n = W.add(t * 2), r = v(e, 0).add(W), o = v(e, t - 8), s = N(o, 37).mul(n).add(r), i = N(r, 25).add(o).mul(n);
-    return X(s, i, n);
+    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);
   }
   if (t >= 4) {
-    const n = W.add(t * 2), r = wt(e, 0);
-    return X(r.shl(3).add(t), wt(e, t - 4), n);
+    const n = V.add(t * 2), s = vt(e, 0);
+    return Y(s.shl(3).add(t), vt(e, t - 4), n);
   }
   if (t > 0) {
-    const n = e[0], r = e[t >> 1], o = e[t - 1], s = n + (r << 8), i = t + (o << 2);
-    return ft(W.mul(s).xor(Tt.mul(i))).mul(W);
+    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 W;
+  return V;
 }
-function Ht(e, t = e.length) {
-  const n = W.add(t * 2), r = v(e, 0).mul(Q), o = v(e, 8), s = v(e, t - 8).mul(n), i = v(e, t - 16).mul(W);
-  return X(N(r.add(o), 43).add(N(s, 30)).add(i), r.add(N(o.add(W), 18)).add(s), n);
+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 Kt(e, t = e.length) {
-  const n = W.add(t * 2), r = v(e, 0).mul(W), o = v(e, 8), s = v(e, t - 8).mul(n), i = v(e, t - 16).mul(W), u = N(r.add(o), 43).add(N(s, 30)).add(i), a = X(u, r.add(N(o.add(W), 18)).add(s), n), h = v(e, 16).mul(n), c = v(e, 24), f = u.add(v(e, t - 32)).mul(n), p = a.add(v(e, t - 24)).mul(n);
-  return X(N(h.add(c), 43).add(N(f, 30)).add(p), h.add(N(c.add(r), 18)).add(f), 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 Xt(e, t = e.length) {
-  const n = J.fromNumber(81, !0);
+function Mn(e, t = e.length) {
+  const n = tt.fromNumber(81, !0);
   if (t <= 32)
-    return t <= 16 ? kt(e, t) : Ht(e, t);
+    return t <= 16 ? Cn(e, t) : qn(e, t);
   if (t <= 64)
-    return Kt(e, t);
-  let r = n, o = n.mul(Q).add(113), s = ft(o.mul(W).add(113)).mul(W), i = [J.UZERO, J.UZERO], u = [J.UZERO, J.UZERO];
-  r = r.mul(W).add(v(e, 0));
-  let a = 0;
-  const h = (t - 1 >> 6) * 64, c = h + (t - 1 & 63) - 63;
+    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));
+  let l = 0;
+  const u = (t - 1 >> 6) * 64, h = u + (t - 1 & 63) - 63;
   do
-    r = N(r.add(o).add(i[0]).add(v(e, a + 8)), 37).mul(Q), o = N(o.add(i[1]).add(v(e, a + 48)), 42).mul(Q), r = r.xor(u[1]), o = o.add(i[0]).add(v(e, a + 40)), s = N(s.add(u[0]), 33).mul(Q), i = st(e, a, i[1].mul(Q), r.add(u[0])), u = st(e, a + 32, s.add(u[1]), o.add(v(e, a + 16))), [s, r] = [r, s], a += 64;
-  while (a !== h);
-  const f = Q.add(s.and(255).shl(1));
-  return a = c, u[0] = u[0].add(t - 1 & 63), i[0] = i[0].add(u[0]), u[0] = u[0].add(i[0]), r = N(r.add(o).add(i[0]).add(v(e, a + 8)), 37).mul(f), o = N(o.add(i[1]).add(v(e, a + 48)), 42).mul(f), r = r.xor(u[1].mul(9)), o = o.add(i[0].mul(9).add(v(e, a + 40))), s = N(s.add(u[0]), 33).mul(f), i = st(e, a, i[1].mul(f), r.add(u[0])), u = st(e, a + 32, s.add(u[1]), o.add(v(e, a + 16))), [s, r] = [r, s], X(X(i[0], u[0], f).add(ft(o).mul(Tt)).add(s), X(i[1], u[1], f).add(r), f);
+    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;
+  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);
 }
 /**
  * @license
- * Copyright 2022 Google LLC. All Rights Reserved.
+ * Copyright 2019 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
@@ -747,68 +747,47 @@ function Xt(e, t = e.length) {
  * limitations under the License.
  * =============================================================================
  */
-var H;
-(function(e) {
-  e[e.FIRST_DIM_SIZE = 0] = "FIRST_DIM_SIZE", e[e.VALUE_ROWIDS = 1] = "VALUE_ROWIDS", e[e.ROW_LENGTHS = 2] = "ROW_LENGTHS", e[e.ROW_SPLITS = 3] = "ROW_SPLITS", e[e.ROW_LIMITS = 4] = "ROW_LIMITS", e[e.ROW_STARTS = 5] = "ROW_STARTS";
-})(H || (H = {}));
-function Qt(e, t, n) {
-  let r = new Array();
-  if (n == null && t == null)
-    return r;
-  if (t == null)
-    for (; r.length < e + n.length; )
-      r.push(-1);
-  else
-    r = t.slice();
-  if (n == null)
-    return r;
-  if (e + n.length !== r.length)
-    throw new Error(`rt input.shape and shape=${t} are incompatible: rt input.rank = ${e + n.length}, but shape.rank = ${r.length}`);
-  for (let o = 1; o < n.length; ++o) {
-    const s = n[o], i = r[r.length - n.length + o], u = r[i];
-    if (s >= 0)
-      if (u >= 0) {
-        if (u !== s)
-          throw new Error(`rt input.shape and shape=${t} are incompatible: rt input.shape[${o + e}] = ${s} but shape[${o + e}] = ${u}`);
-      } else
-        r[i] = s;
-  }
-  return r;
-}
-function Jt(e) {
-  const t = {
-    FIRST_DIM_SIZE: H.FIRST_DIM_SIZE,
-    VALUE_ROWIDS: H.VALUE_ROWIDS,
-    ROW_LENGTHS: H.ROW_LENGTHS,
-    ROW_SPLITS: H.ROW_SPLITS,
-    ROW_LIMITS: H.ROW_LIMITS,
-    ROW_STARTS: H.ROW_STARTS
-  }, n = [];
-  for (const r of e)
-    if (r in t)
-      n.push(t[r]);
-    else
-      break;
-  return n;
-}
-function Yt(e) {
-  return e.length === 0 ? 0 : e[0] === H.FIRST_DIM_SIZE ? e.length - 1 : 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.`);
+  });
 }
-function te(e, t) {
-  if (e == null || t == null)
-    return;
-  const n = e.length, r = t.length;
-  if (n >= r)
-    throw new Error(`defaultValue.shape=${e} and ragged tensor flatValues.shape=${t}, are incompatible: defaultValue.rank = ${n} must be less than ragged tensor input flatValues.rank = ${r})`);
-  for (let o = 0; o < Math.min(n, r - 1); ++o) {
-    const s = e[o], i = t[o + 1];
-    if (s >= 0 && i >= 0 && s !== 1 && s !== i)
-      throw new Error(`defaultValue.shape=${e}, and ragged tensor input flatValues.shape=${t} are incompatible: defaultValue.shape[${o - e.length}] = ${s} but ragged tensor input.flatValues.shape[${o - e.length}] = ${i}`);
-  }
+/**
+ * @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 le(e) {
+  const t = new Float32Array(e.length);
+  for (let n = 0; n < e.length; ++n)
+    t[n] = Math.abs(e[n]);
+  return t;
 }
+const On = (e) => {
+  const { x: t } = e.inputs, n = e.backend;
+  nt(t, "abs");
+  let s = new Float32Array(A(t.shape));
+  const o = n.data.get(t.dataId).values;
+  return s = le(o), n.makeOutput(s, t.shape, t.dtype);
+}, Ys = {
+  kernelName: _e,
+  backendName: "cpu",
+  kernelFunc: On
+};
 /**
  * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
+ * 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
@@ -822,19 +801,27 @@ function te(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function ee(e) {
-  return `Received SparseTensor with denseShape[0] = 0 but
-  indices.shape[0] = ${e}`;
-}
-function ne(e, t) {
-  return `indices(${e}, 0) is invalid: ${t} < 0`;
-}
-function re(e, t, n) {
-  return `indices(${e}, 0) is invalid: ${t} >= ${n}`;
+function W(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]);
+    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]);
+      }
+    return [h, r];
+  };
 }
 /**
  * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
+ * 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
@@ -848,27 +835,21 @@ function re(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-function oe(e, t) {
-  return `only one output dimension may be -1, not both ${e} and ${t}`;
-}
-function se(e, t) {
-  return `size ${e} must be non-negative, not ${t}`;
-}
-function ie() {
-  return "reshape cannot infer the missing input size for an empty tensor unless all specified input sizes are non-zero";
-}
-function le(e, t) {
-  const n = $(e), r = $(t);
-  return `Input to reshape is a SparseTensor with ${n}
-  dense values, but the requested shape requires a multiple of ${r}. inputShape=${e} outputShape= ${t}`;
-}
-function ue(e, t) {
-  const n = $(e), r = $(t);
-  return `Input to reshape is a tensor with ${n} dense values, but the requested shape has ${r}. inputShape=${e} outputShape=${t}`;
-}
+function mt(e) {
+  const { inputs: t, backend: n } = e, { real: s, imag: o } = t, a = n.data.get(s.dataId).values, r = n.data.get(o.dataId).values, i = n.makeTensorInfo(s.shape, "complex64"), l = n.data.get(i.dataId);
+  return l.complexTensorInfos = {
+    real: n.makeTensorInfo(s.shape, "float32", a),
+    imag: n.makeTensorInfo(o.shape, "float32", r)
+  }, i;
+}
+const Js = {
+  kernelName: Ve,
+  backendName: "cpu",
+  kernelFunc: mt
+};
 /**
  * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
+ * 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
@@ -882,40 +863,39 @@ function ue(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-function pt() {
-  return "segment ids must be >= 0";
-}
-function ae() {
-  return "segment ids are not increasing";
-}
-function he(e, t) {
-  return `Segment id ${e} out of range [0, ${t}), possibly because segmentIds input is not sorted.`;
-}
-function ce(e, t, n) {
-  return `Bad: indices[${e}] == ${t} out of range [0, ${n})`;
+function xt(e, t, n = "float32") {
+  if (n === "complex64") {
+    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);
+  return e.makeTensorInfo(t, n, s);
 }
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the License);
+ * 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,
+ * 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 fe(e) {
-  const t = new Float32Array(e.length);
-  for (let n = 0; n < e.length; ++n)
-    t[n] = Math.abs(e[n]);
-  return t;
-}
+function Et(e) {
+  const { inputs: t, backend: n } = e, { x: s } = t;
+  return n.incRef(s.dataId), { dataId: s.dataId, shape: s.shape, dtype: s.dtype };
+}
+const Qs = {
+  kernelName: De,
+  backendName: "cpu",
+  kernelFunc: Et
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -932,24 +912,15 @@ function fe(e) {
  * limitations under the License.
  * =============================================================================
  */
-function U(e) {
-  return (t, n, r, o, s) => {
-    const i = yt(t, n), u = i.length, a = Y(i), h = $(i), c = nt(s, h), f = t.length, p = n.length, I = Y(t), m = Y(n), b = dt(t, i), g = dt(n, i);
-    if (b.length + g.length === 0)
-      for (let d = 0; d < c.length; ++d)
-        c[d] = e(r[d % r.length], o[d % o.length]);
-    else
-      for (let d = 0; d < c.length; ++d) {
-        const E = gt(d, u, a), R = E.slice(-f);
-        b.forEach((z) => R[z] = 0);
-        const x = ht(R, f, I), D = E.slice(-p);
-        g.forEach((z) => D[z] = 0);
-        const V = ht(D, p, m);
-        c[d] = e(r[x], o[V]);
-      }
-    return [c, i];
-  };
-}
+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,
+  backendName: "cpu",
+  kernelFunc: ce
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -966,17 +937,41 @@ function U(e) {
  * limitations under the License.
  * =============================================================================
  */
-function ge(e, t, n, r) {
-  if (r === "int32") {
+function ue(e, t, n, s) {
+  if (s === "int32") {
     const o = Int32Array.from(e);
     return [t, "int32", o];
   }
-  if (r === "bool") {
-    const o = Lt([0], n), [s, i] = U((u, a) => u !== a ? 1 : 0)(t, [], e, o, "bool");
-    return [i, "bool", s];
+  if (s === "bool") {
+    const o = Be([0], n), [a, r] = W((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 ${r}`);
+  throw new Error(`Error in Cast: failed to cast ${n} to ${s}`);
 }
+function lt(e) {
+  const { inputs: t, backend: n, attrs: s } = e, { x: o } = t, { dtype: a } = s;
+  if (a === "complex64") {
+    if (o.dtype === "complex64")
+      return Et({ inputs: { x: o }, backend: n });
+    const h = xt(n, o.shape, o.dtype), f = lt({ inputs: { x: o }, backend: n, attrs: { dtype: "float32" } }), p = mt({ inputs: { real: f, imag: h }, backend: n });
+    return n.disposeIntermediateTensorInfo(h), n.disposeIntermediateTensorInfo(f), p;
+  }
+  if (o.dtype === "complex64") {
+    const h = ce({ inputs: { input: o }, backend: n }), f = lt({ inputs: { x: h }, backend: n, attrs: { dtype: a } });
+    return n.disposeIntermediateTensorInfo(h), f;
+  }
+  if (!ze(o.dtype, a)) {
+    const h = Et({ inputs: { x: o }, backend: n });
+    return { dataId: h.dataId, shape: h.shape, dtype: a };
+  }
+  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,
+  backendName: "cpu",
+  kernelFunc: lt
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -993,7 +988,49 @@ function ge(e, t, n, r) {
  * limitations under the License.
  * =============================================================================
  */
-const de = U((e, t) => e + t);
+function z(e, t, n, s) {
+  return n == null ? ({ inputs: o, backend: a }) => {
+    const { a: r, b: i } = o, l = a;
+    nt([r, i], e);
+    const u = l.data.get(r.dataId).values, h = l.data.get(i.dataId).values, f = r.dtype === "string" ? (
+      // tslint:disable-next-line: no-any
+      it(u)
+    ) : 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);
+  } : ({ 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;
+    } 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);
+    }
+  };
+}
+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;
+      }
+    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);
+        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;
+      }
+    return [f, p, i];
+  };
+}
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1010,26 +1047,47 @@ const de = U((e, t) => e + t);
  * limitations under the License.
  * =============================================================================
  */
-function me(e, t, n, r, o) {
-  const s = $(r), i = rt(o, n);
-  for (let u = 0; u < e.length; u++) {
-    const a = e[u];
-    if (a < 0)
+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,
+  backendName: "cpu",
+  kernelFunc: An
+};
+/**
+ * @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 _n(e, t, n, s, o) {
+  const a = A(s), r = st(o, n);
+  for (let i = 0; i < e.length; i++) {
+    const l = e[i];
+    if (l < 0)
       throw new Error("Input x must be non-negative!");
-    a >= o || (s > 0 ? i[a] += t[u] : i[a] += 1);
+    l >= o || (a > 0 ? r[l] += t[i] : r[l] += 1);
   }
-  return i;
+  return r;
 }
-function we(e, t, n, r = !1) {
-  const o = e.shape[0], s = e.shape[1], i = k([o, n], t.dtype);
-  for (let u = 0; u < o; u++)
-    for (let a = 0; a < s; a++) {
-      const h = e.get(u, a);
-      if (h < 0)
+function Vn(e, t, n, s = !1) {
+  const o = e.shape[0], a = e.shape[1], r = H([o, n], t.dtype);
+  for (let i = 0; i < o; i++)
+    for (let l = 0; l < a; l++) {
+      const u = e.get(i, l);
+      if (u < 0)
         throw new Error("Input x must be non-negative!");
-      h >= n || (r ? i.set(1, u, h) : t.size > 0 ? i.set(i.get(u, h) + t.get(u, a), u, h) : i.set(i.get(u, h) + 1, u, h));
+      u >= n || (s ? r.set(1, i, u) : t.size > 0 ? r.set(r.get(i, u) + t.get(i, l), i, u) : r.set(r.get(i, u) + 1, i, u));
     }
-  return i;
+  return r;
 }
 /**
  * @license
@@ -1047,7 +1105,11 @@ function we(e, t, n, r = !1) {
  * limitations under the License.
  * =============================================================================
  */
-const pe = U((e, t) => e & t);
+const fe = W((e, t) => e & t), Dn = z(Ot, fe), so = {
+  kernelName: Ot,
+  backendName: "cpu",
+  kernelFunc: Dn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1064,14 +1126,50 @@ const pe = U((e, t) => e & t);
  * limitations under the License.
  * =============================================================================
  */
-function K(e) {
-  return (t, n, r) => {
-    const o = q(n, t.length);
-    for (let s = 0; s < t.length; ++s)
-      o[s] = e(t[s], r);
+function X(e) {
+  return (t, n, s) => {
+    const o = D(n, t.length);
+    for (let a = 0; a < t.length; ++a)
+      o[a] = e(t[a], s);
     return o;
   };
 }
+/**
+ * @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 ge(e, t, n) {
+  const s = X(t);
+  return J(e, s, n);
+}
+function J(e, t, n) {
+  return ({ inputs: s, attrs: o, backend: a }) => {
+    const { x: r } = s;
+    nt(r, e);
+    const i = a, l = i.data.get(r.dataId).values;
+    let u;
+    if (r.dtype === "string") {
+      if (!Array.isArray(l))
+        throw new Error("String tensor's value was not an instance of Array");
+      u = it(l);
+    } else
+      u = l;
+    const h = n || r.dtype, f = t(u, h, o);
+    return i.makeTensorInfo(r.shape, h, f);
+  };
+}
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1088,7 +1186,11 @@ function K(e) {
  * limitations under the License.
  * =============================================================================
  */
-const Ie = K((e) => Math.ceil(e));
+const de = X((e) => Math.ceil(e)), Wn = J(Lt, de), oo = {
+  kernelName: Lt,
+  backendName: "cpu",
+  kernelFunc: Wn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1105,25 +1207,25 @@ const Ie = K((e) => Math.ceil(e));
  * limitations under the License.
  * =============================================================================
  */
-function Ee(e, t, n, r) {
-  const o = q(n, $(t));
-  if (r && n !== "string") {
-    let s = 0;
-    e.forEach((i) => {
-      const u = $(i.shape);
-      o.set(i.vals, s), s += u;
+function $n(e, t, n, s) {
+  const o = D(n, A(t));
+  if (s && n !== "string") {
+    let a = 0;
+    e.forEach((r) => {
+      const i = A(r.shape);
+      o.set(r.vals, a), a += i;
     });
   } else {
-    let s = 0;
-    e.forEach((i) => {
-      const u = n === "string" ? bt(i.vals) : i.vals;
-      let a = 0;
-      for (let h = 0; h < i.shape[0]; ++h) {
-        const c = h * t[1] + s;
-        for (let f = 0; f < i.shape[1]; ++f)
-          o[c + f] = u[a++];
+    let a = 0;
+    e.forEach((r) => {
+      const i = n === "string" ? it(r.vals) : r.vals;
+      let l = 0;
+      for (let u = 0; u < r.shape[0]; ++u) {
+        const h = u * t[1] + a;
+        for (let f = 0; f < r.shape[1]; ++f)
+          o[h + f] = i[l++];
       }
-      s += i.shape[1];
+      a += r.shape[1];
     });
   }
   return o;
@@ -1144,7 +1246,11 @@ function Ee(e, t, n, r) {
  * limitations under the License.
  * =============================================================================
  */
-const Se = U((e, t) => e === t ? 1 : 0);
+const me = W((e, t) => e === t ? 1 : 0), zn = z(At, me, null, "bool"), ro = {
+  kernelName: At,
+  backendName: "cpu",
+  kernelFunc: zn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1161,7 +1267,11 @@ const Se = U((e, t) => e === t ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const Fe = K((e) => Math.exp(e));
+const pe = X((e) => Math.exp(e)), Bn = J(_t, pe, "float32"), ao = {
+  kernelName: _t,
+  backendName: "cpu",
+  kernelFunc: Bn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1178,7 +1288,11 @@ const Fe = K((e) => Math.exp(e));
  * limitations under the License.
  * =============================================================================
  */
-const be = K((e) => Math.expm1(e));
+const Ie = X((e) => Math.expm1(e)), Gn = J(Vt, Ie), io = {
+  kernelName: Vt,
+  backendName: "cpu",
+  kernelFunc: Gn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1195,7 +1309,11 @@ const be = K((e) => Math.expm1(e));
  * limitations under the License.
  * =============================================================================
  */
-const xe = K((e) => Math.floor(e));
+const we = X((e) => Math.floor(e)), jn = J(Dt, we), lo = {
+  kernelName: Dt,
+  backendName: "cpu",
+  kernelFunc: jn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1212,7 +1330,11 @@ const xe = K((e) => Math.floor(e));
  * limitations under the License.
  * =============================================================================
  */
-const Re = U((e, t) => Math.floor(e / t));
+const be = W((e, t) => Math.floor(e / t)), Zn = z(Wt, be, null, "int32"), co = {
+  kernelName: Wt,
+  backendName: "cpu",
+  kernelFunc: Zn
+};
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -1229,21 +1351,21 @@ const Re = U((e, t) => Math.floor(e / t));
  * limitations under the License.
  * =============================================================================
  */
-function Te(e, t, n, r, o, s, i, u, a) {
-  const h = k([r, s], n);
-  for (let c = 0; c < r; c++) {
+function Hn(e, t, n, s, o, a, r, i, l) {
+  const u = H([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[c * o + I];
-      p += m * i[I], f.push(m);
+      const m = e[h * o + I];
+      p += m * r[I], f.push(m);
     }
-    if (p < 0 || p >= a / s)
-      throw new Error(`Invalid indices: ${f} does not index into ${u}`);
-    for (let I = 0; I < s; I++)
-      h.values[c * s + I] = t.get(...t.indexToLoc(p * s + I));
+    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));
   }
-  return h;
+  return u;
 }
 /**
  * @license
@@ -1261,15 +1383,15 @@ function Te(e, t, n, r, o, s, i, u, a) {
  * limitations under the License.
  * =============================================================================
  */
-function ve(e, t, n) {
-  const r = k(n, e.dtype);
-  for (let o = 0; o < r.size; ++o) {
-    const i = r.indexToLoc(o).slice(), u = i[0], a = i[2], h = t.locToIndex([u, a]);
-    i[2] = t.values[h];
-    const c = e.locToIndex(i);
-    0 <= c && c < e.values.length && (r.values[o] = e.values[c]);
+function Kn(e, t, n) {
+  const s = H(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];
+    const h = e.locToIndex(r);
+    0 <= h && h < e.values.length && (s.values[o] = e.values[h]);
   }
-  return r;
+  return s;
 }
 /**
  * @license
@@ -1287,7 +1409,11 @@ function ve(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const Oe = U((e, t) => e > t ? 1 : 0);
+const xe = W((e, t) => e > t ? 1 : 0), Xn = z($t, xe, null, "bool"), uo = {
+  kernelName: $t,
+  backendName: "cpu",
+  kernelFunc: Xn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1304,7 +1430,11 @@ const Oe = U((e, t) => e > t ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const _e = U((e, t) => e >= t ? 1 : 0);
+const Ee = W((e, t) => e >= t ? 1 : 0), Yn = z(zt, Ee, null, "bool"), ho = {
+  kernelName: zt,
+  backendName: "cpu",
+  kernelFunc: Yn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1321,7 +1451,11 @@ const _e = U((e, t) => e >= t ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const ye = U((e, t) => e < t ? 1 : 0);
+const Fe = W((e, t) => e < t ? 1 : 0), Jn = z(Bt, Fe, null, "bool"), fo = {
+  kernelName: Bt,
+  backendName: "cpu",
+  kernelFunc: Jn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1338,7 +1472,11 @@ const ye = U((e, t) => e < t ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-const Le = U((e, t) => e <= t ? 1 : 0);
+const ye = W((e, t) => e <= t ? 1 : 0), Qn = z(Gt, ye, null, "bool"), go = {
+  kernelName: Gt,
+  backendName: "cpu",
+  kernelFunc: Qn
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1355,11 +1493,11 @@ const Le = U((e, t) => e <= t ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-function Me(e, t, n) {
-  const r = (t - e) / (n - 1), o = rt(n, "float32");
+function ts(e, t, n) {
+  const s = (t - e) / (n - 1), o = st(n, "float32");
   o[0] = e;
-  for (let s = 1; s < o.length; s++)
-    o[s] = o[s - 1] + r;
+  for (let a = 1; a < o.length; a++)
+    o[a] = o[a - 1] + s;
   return o;
 }
 /**
@@ -1378,7 +1516,11 @@ function Me(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const Ne = K((e) => Math.log(e));
+const ke = X((e) => Math.log(e)), es = J(jt, ke), mo = {
+  kernelName: jt,
+  backendName: "cpu",
+  kernelFunc: es
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1395,16 +1537,16 @@ const Ne = K((e) => Math.log(e));
  * limitations under the License.
  * =============================================================================
  */
-function $e(e, t, n, r) {
-  const o = nt(r, $(n));
-  for (let s = 0; s < o.length; ++s) {
-    const i = s * t;
-    let u = e[i];
-    for (let a = 0; a < t; ++a) {
-      const h = e[i + a];
-      (Number.isNaN(h) || h > u) && (u = h);
+function ns(e, t, n, s) {
+  const o = et(s, A(n));
+  for (let a = 0; a < o.length; ++a) {
+    const r = a * t;
+    let i = e[r];
+    for (let l = 0; l < t; ++l) {
+      const u = e[r + l];
+      (Number.isNaN(u) || u > i) && (i = u);
     }
-    o[s] = u;
+    o[a] = i;
   }
   return o;
 }
@@ -1424,7 +1566,11 @@ function $e(e, t, n, r) {
  * limitations under the License.
  * =============================================================================
  */
-const Ae = U((e, t) => Math.max(e, t));
+const Ne = W((e, t) => Math.max(e, t)), ss = z(Zt, Ne), po = {
+  kernelName: Zt,
+  backendName: "cpu",
+  kernelFunc: ss
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1441,7 +1587,11 @@ const Ae = U((e, t) => Math.max(e, t));
  * limitations under the License.
  * =============================================================================
  */
-const De = U((e, t) => Math.min(e, t));
+const Se = W((e, t) => Math.min(e, t)), os = z(Ht, Se), Io = {
+  kernelName: Ht,
+  backendName: "cpu",
+  kernelFunc: os
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1458,7 +1608,14 @@ const De = U((e, t) => Math.min(e, t));
  * limitations under the License.
  * =============================================================================
  */
-const Ot = U((e, t) => e * t);
+const yt = W((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,
+  backendName: "cpu",
+  kernelFunc: as
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1475,10 +1632,21 @@ const Ot = U((e, t) => e * t);
  * limitations under the License.
  * =============================================================================
  */
-function Pe(e, t, n) {
-  const r = Mt(-1, n);
-  return Ot([], t, r, e, n);
-}
+function ve(e, t, n) {
+  const s = je(-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);
+  return n.makeTensorInfo(r, s.dtype, a);
+}
+const bo = {
+  kernelName: Ge,
+  backendName: "cpu",
+  kernelFunc: is
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1495,7 +1663,11 @@ function Pe(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const We = U((e, t) => e !== t ? 1 : 0);
+const Te = W((e, t) => e !== t ? 1 : 0), ls = z(Xt, Te, null, "bool"), xo = {
+  kernelName: Xt,
+  backendName: "cpu",
+  kernelFunc: ls
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -1512,16 +1684,16 @@ const We = U((e, t) => e !== t ? 1 : 0);
  * limitations under the License.
  * =============================================================================
  */
-function qe(e, t, n, r, o) {
-  const s = t.length, i = $(t), u = Y(t), a = Y(o), h = nt(n, $(o));
-  for (let c = 0; c < i; ++c) {
-    const f = gt(c, s, u), p = new Array(f.length);
+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));
+  for (let h = 0; h < r; ++h) {
+    const f = gt(h, a, i), p = new Array(f.length);
     for (let m = 0; m < p.length; m++)
-      p[m] = f[r[m]];
-    const I = ht(p, s, a);
-    h[I] = e[c];
+      p[m] = f[s[m]];
+    const I = at(p, a, l);
+    u[I] = e[h];
   }
-  return h;
+  return u;
 }
 /**
  * @license
@@ -1539,17 +1711,63 @@ function qe(e, t, n, r, o) {
  * limitations under the License.
  * =============================================================================
  */
-function Ve(e, t, n, r) {
-  const [o, s] = Wt(e, r), i = Nt(t, "int32"), u = rt($(o), i), a = $(s);
-  for (let h = 0; h < u.length; ++h) {
-    const c = h * a;
+function Pe(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);
+  for (let f = 0; f < i.length; f++)
+    i[f] = o.shape[a[f]];
+  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 = {
+  kernelName: Ze,
+  backendName: "cpu",
+  kernelFunc: Pe
+};
+/**
+ * @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 Ce(e, t, n, s) {
+  const [o, a] = bn(e, s), r = Ke(t, "int32"), i = st(A(o), r), l = A(a);
+  for (let u = 0; u < i.length; ++u) {
+    const h = u * l;
     let f = 1;
-    for (let p = 0; p < a; ++p)
-      f *= n[c + p];
-    u[h] = f;
-  }
-  return { outVals: u, outShape: o, outDtype: i };
-}
+    for (let p = 0; p < l; ++p)
+      f *= n[h + p];
+    i[u] = f;
+  }
+  return { outVals: i, outShape: o, outDtype: r };
+}
+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);
+  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);
+}
+const Fo = {
+  kernelName: He,
+  backendName: "cpu",
+  kernelFunc: cs
+};
 /**
  * @license
  * Copyright 2022 Google LLC. All Rights Reserved.
@@ -1566,96 +1784,96 @@ function Ve(e, t, n, r) {
  * limitations under the License.
  * =============================================================================
  */
-function Ue(e, t, n) {
-  e.forEach((r, o) => {
-    if (r < 0 || r >= n) {
-      const s = gt(o, t.length, Y(t)).join(",");
-      throw new Error(`indices[${s}] = ${r} is not in [0, ${n})`);
+function us(e, t, n) {
+  e.forEach((s, o) => {
+    if (s < 0 || s >= n) {
+      const a = gt(o, t.length, K(t)).join(",");
+      throw new Error(`indices[${a}] = ${s} is not in [0, ${n})`);
     }
   });
 }
-function ze(e, t) {
+function hs(e, t) {
   for (let n = 0; n < e.length; ++n) {
-    const r = e[n], o = n === e.length - 1 ? t : e[n + 1].length;
-    if (r.length === 0)
+    const s = e[n], o = n === e.length - 1 ? t : e[n + 1].length;
+    if (s.length === 0)
       throw new Error("Ragged splits may not be empty");
-    if (r[0] < 0)
+    if (s[0] < 0)
       throw new Error("Ragged splits must be non-negative");
-    if (r[r.length - 1] > o)
+    if (s[s.length - 1] > o)
       throw new Error("Ragged splits must not point past values");
-    for (let s = 1; s < r.length; ++s)
-      if (r[s - 1] > r[s])
+    for (let a = 1; a < s.length; ++a)
+      if (s[a - 1] > s[a])
         throw new Error("Ragged splits must be sorted in ascending order");
   }
 }
-function Ge(e, t, n, r) {
+function fs(e, t, n, s) {
   const o = [];
-  let s = 0;
-  const i = t.length - 1 + n.length, u = new Array(i).fill(null).map(() => [0]);
-  ze(n, r);
-  let a = 1;
-  for (let h = 0; h < t.length - 1; ++h) {
-    a *= t[h];
-    const c = t[h + 1];
-    for (let f = 1; f < a + 1; ++f)
-      u[h].push(f * c);
-  }
-  for (let h = 0; h < e.length; ++h) {
-    let c = e[h], f = e[h] + 1;
+  let a = 0;
+  const r = t.length - 1 + n.length, i = new Array(r).fill(null).map(() => [0]);
+  hs(n, s);
+  let l = 1;
+  for (let u = 0; u < t.length - 1; ++u) {
+    l *= t[u];
+    const h = t[u + 1];
+    for (let f = 1; f < l + 1; ++f)
+      i[u].push(f * h);
+  }
+  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;
       if (m >= 0) {
-        const b = u[m], g = b[b.length - 1] - I[c];
-        for (let d = c; d < f; ++d)
-          u[m].push(I[d + 1] + g);
+        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);
       }
-      c = I[c], f = I[f];
+      h = I[h], f = I[f];
     }
-    f !== c && (o.push([c, f]), s += f - c);
+    f !== h && (o.push([h, f]), a += f - h);
   }
-  return { outSplits: u, valueSlices: o, numValues: s };
+  return { outSplits: i, valueSlices: o, numValues: a };
 }
-function je(e) {
+function gs(e) {
   const t = [];
   for (let n = 0; n < e.length; ++n) {
-    const r = e[n].length, o = q("int32", r);
-    t.push(o), e[n].forEach((s, i) => o[i] = s);
+    const s = e[n].length, o = D("int32", s);
+    t.push(o), e[n].forEach((a, r) => o[r] = a);
   }
   return t;
 }
-function It(e, t) {
+function Tt(e, t) {
   const n = e.slice(0, t);
   for (; n.length < t; )
     n.push(1);
-  for (let r = t; r < e.length; r++)
-    n[t - 1] *= e[r];
+  for (let s = t; s < e.length; s++)
+    n[t - 1] *= e[s];
   return n;
 }
-function Ze(e, t, n, r, o, s) {
-  const i = It(t, 2)[1], u = It(s, 2)[1];
-  let a = 0;
-  for (const h of n)
-    for (let c = h[0]; c < h[1]; ++c) {
-      for (let f = 0; f < r; ++f)
-        o[a * u + f] = e[c * i + f];
-      ++a;
+function ds(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)
+    for (let h = u[0]; h < u[1]; ++h) {
+      for (let f = 0; f < s; ++f)
+        o[l * i + f] = e[h * r + f];
+      ++l;
     }
 }
-function Ce(e, t, n, r, o) {
-  const s = t.slice();
-  s[0] = o;
-  const i = q(n, $(s)), u = e.length, a = u === 0 ? 0 : u / t[0];
-  return Ze(e, t, r, a, i, s), [i, s];
+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];
 }
-function Be(e, t, n, r, o, s, i, u) {
+function ps(e, t, n, s, o, a, r, i) {
   if (e.length === 0)
     throw new Error("paramsNestedSplits must be non empty");
   if (t[0].length === 0)
     throw new Error("Split tensors must not be scalars");
-  const a = t[0][0] - 1;
-  if (Ue(s, i, a), r.length === 0)
+  const l = t[0][0] - 1;
+  if (us(a, r, l), s.length === 0)
     throw new Error("params.rank must be nonzero");
-  const h = r[0], { outSplits: c, valueSlices: f, numValues: p } = Ge(s, i, e, h), I = je(c), m = Ce(n, r, o, f, p);
+  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]];
 }
 /**
@@ -1674,40 +1892,40 @@ function Be(e, t, n, r, o, s, i, u) {
  * limitations under the License.
  * =============================================================================
  */
-const Et = 2147483647;
-function ke(e, t, n, r, o, s, i) {
+const Rt = 2147483647;
+function Is(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)
     throw new Error("limits must be a scalar or vector");
-  if (i.length > 1)
+  if (r.length > 1)
     throw new Error("deltas must be a scalar or vector");
-  const u = t.length === 0, a = o.length === 0, h = i.length === 0, c = [];
-  u || c.push(t[0]), a || c.push(o[0]), h || c.push(i[0]);
-  for (let g = 1; g < c.length; ++g)
-    if (c[g] !== c[g - 1])
+  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])
       throw new Error("starts, limits, and deltas must have the same shape");
-  const f = c.length === 0 ? 1 : c[0], p = q("int32", f + 1);
+  const f = h.length === 0 ? 1 : h[0], p = D("int32", f + 1);
   p[0] = 0;
   for (let g = 0; g < f; ++g) {
-    const d = u ? e[0] : e[g], E = a ? r[0] : r[g], R = h ? s[0] : s[g];
-    if (R === 0)
+    const d = i ? e[0] : e[g], b = l ? s[0] : s[g], k = u ? a[0] : a[g];
+    if (k === 0)
       throw new Error("Requires delta != 0");
-    let x;
-    if (R > 0 && E < d || R < 0 && E > d)
-      x = 0;
-    else if (x = Math.ceil(Math.abs((E - d) / R)), x > Et)
-      throw new Error(`Requires ((limit - start) / delta) <= ${Et}`);
-    p[g + 1] = p[g] + x;
-  }
-  const I = p[f], m = q(n, I);
-  let b = 0;
+    let y;
+    if (k > 0 && b < d || k < 0 && b > d)
+      y = 0;
+    else if (y = Math.ceil(Math.abs((b - d) / k)), y > Rt)
+      throw new Error(`Requires ((limit - start) / delta) <= ${Rt}`);
+    p[g + 1] = p[g] + y;
+  }
+  const I = p[f], m = D(n, I);
+  let F = 0;
   for (let g = 0; g < f; ++g) {
     const d = p[g + 1] - p[g];
-    let E = u ? e[0] : e[g];
-    const R = h ? s[0] : s[g];
-    for (let x = 0; x < d; ++x)
-      m[b++] = E, E += R;
+    let b = i ? e[0] : e[g];
+    const k = u ? a[0] : a[g];
+    for (let y = 0; y < d; ++y)
+      m[F++] = b, b += k;
   }
   return [p, m];
 }
@@ -1727,67 +1945,67 @@ function ke(e, t, n, r, o, s, i) {
  * limitations under the License.
  * =============================================================================
  */
-var B = H;
-class it {
-  constructor(t, n, r, o, s, i, u, a, h, c) {
-    this.shape = t, this.shapeShape = n, this.values = r, this.valuesShape = o, this.valuesDType = s, this.defaultValue = i, this.defaultValueShape = u, this.rowPartitionValues = a, this.rowPartitionValuesShapes = h, this.rowPartitionTypes = Jt(c), this.raggedRank = Yt(this.rowPartitionTypes);
+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);
   }
   getRowPartitionTypeByDimension(t) {
-    return this.rowPartitionTypes[0] === B.FIRST_DIM_SIZE ? this.rowPartitionTypes[t + 1] : this.rowPartitionTypes[t];
+    return this.rowPartitionTypes[0] === Z.FIRST_DIM_SIZE ? this.rowPartitionTypes[t + 1] : this.rowPartitionTypes[t];
   }
   // Returns the relationship between dimension and dimension + 1.
   getRowPartitionTensor(t) {
-    return this.rowPartitionTypes[0] === B.FIRST_DIM_SIZE ? this.rowPartitionValues[t + 1] : this.rowPartitionValues[t];
+    return this.rowPartitionTypes[0] === Z.FIRST_DIM_SIZE ? this.rowPartitionValues[t + 1] : this.rowPartitionValues[t];
   }
   getMaxWidth(t) {
     const n = this.getRowPartitionTensor(t - 1);
     switch (this.getRowPartitionTypeByDimension(t - 1)) {
-      case B.VALUE_ROWIDS:
-        return it.getMaxWidthValueRowID(n);
-      case B.ROW_SPLITS:
-        return it.getMaxWidthRowSplit(n);
+      case Z.VALUE_ROWIDS:
+        return ft.getMaxWidthValueRowID(n);
+      case Z.ROW_SPLITS:
+        return ft.getMaxWidthRowSplit(n);
       default:
-        throw new Error(`Cannot handle partition type ${B[this.getRowPartitionTypeByDimension(t - 1)]}`);
+        throw new Error(`Cannot handle partition type ${Z[this.getRowPartitionTypeByDimension(t - 1)]}`);
     }
   }
   static getMaxWidthRowSplit(t) {
     const n = t.length;
     if (n === 0 || n === 1)
       return 0;
-    let r = 0;
+    let s = 0;
     for (let o = 0; o < n - 1; ++o) {
-      const s = t[o + 1] - t[o];
-      s > r && (r = s);
+      const a = t[o + 1] - t[o];
+      a > s && (s = a);
     }
-    return r;
+    return s;
   }
   static getMaxWidthValueRowID(t) {
     const n = t.length;
     if (n === 0)
       return 0;
-    let r = 0, o = t[0], s = 0;
-    for (let i = 1; i < n; ++i) {
-      const u = t[i];
-      u !== o && (o = u, s = Math.max(i - r, s), r = i);
+    let s = 0, o = t[0], a = 0;
+    for (let r = 1; r < n; ++r) {
+      const i = t[r];
+      i !== o && (o = i, a = Math.max(r - s, a), s = r);
     }
-    return Math.max(n - r, s);
+    return Math.max(n - s, a);
   }
-  tensorShapeFromTensor(t, n, r = !0) {
+  tensorShapeFromTensor(t, n, s = !0) {
     if (n.length === 0) {
       if (t[0] === -1)
         return [];
       throw new Error("The only valid scalar shape tensor is the fully unknown shape specified as -1.");
     }
-    return Ft(t, r);
+    return Ct(t, s);
   }
   calculateOutputSize(t) {
-    const n = this.valuesShape, r = this.defaultValueShape;
-    te(r, n);
-    const o = this.tensorShapeFromTensor(this.shape, this.shapeShape), i = Qt(this.raggedRank, o, n);
-    i[0] < 0 && (i[0] = t);
-    for (let u = 1; u <= this.raggedRank; ++u)
-      i[u] < 0 && (i[u] = this.getMaxWidth(u));
-    return i;
+    const n = this.valuesShape, s = this.defaultValueShape;
+    en(s, n);
+    const o = this.tensorShapeFromTensor(this.shape, this.shapeShape), r = nn(this.raggedRank, o, n);
+    r[0] < 0 && (r[0] = t);
+    for (let i = 1; i <= this.raggedRank; ++i)
+      r[i] < 0 && (r[i] = this.getMaxWidth(i));
+    return r;
   }
   /**
    * The outputIndex represents the index in the output tensor
@@ -1799,29 +2017,29 @@ class it {
    * If firstDimensionOutput = 11 instead, then:
    * result = [0 100 200 300 400 500 600 700 800 900]
    */
-  calculateFirstParentOutputIndex(t, n, r) {
-    const o = Math.min(t, r), s = [];
-    let i = 0;
-    for (let u = 0; u < o; ++u, i += n)
-      s.push(i);
-    for (let u = o; u < t; ++u)
-      s.push(-1);
-    return $t(s.length === t, () => "Final length of result must be equal to firstDimension."), s;
-  }
-  calculateOutputIndexRowSplit(t, n, r, o) {
-    const s = t.length, i = [];
-    for (let u = 0; u < s - 1; ++u) {
-      const a = t[u + 1] - t[u];
-      let h = Math.min(o, a), c = n[u];
-      c === -1 && (h = 0);
-      for (let f = 0; f < h; ++f)
-        i.push(c), c += r;
-      for (let f = 0; f < a - h; ++f)
-        i.push(-1);
+  calculateFirstParentOutputIndex(t, n, s) {
+    const o = Math.min(t, s), a = [];
+    let r = 0;
+    for (let i = 0; i < o; ++i, r += n)
+      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;
+  }
+  calculateOutputIndexRowSplit(t, n, s, o) {
+    const a = t.length, r = [];
+    for (let i = 0; i < a - 1; ++i) {
+      const l = t[i + 1] - t[i];
+      let u = Math.min(o, l), h = n[i];
+      h === -1 && (u = 0);
+      for (let f = 0; f < u; ++f)
+        r.push(h), h += s;
+      for (let f = 0; f < l - u; ++f)
+        r.push(-1);
     }
-    if (s > 0 && i.length !== t[s - 1])
+    if (a > 0 && r.length !== t[a - 1])
       throw new Error("Invalid row split size.");
-    return i;
+    return r;
   }
   // Calculate the output index of the first element of a list.
   // The parentOutputIndex is the same computation for the previous list.
@@ -1844,41 +2062,41 @@ class it {
   // result[6] = -1 because parentOutputIndex[valueRowIds[6]] == -1
   // result[7] = -1 because parentOutputIndex[valueRowIds[6]] == -1
   // result[8] = parentOutputIndex[valueRowIds[7]]
-  calculateOutputIndexValueRowID(t, n, r, o) {
-    const s = t.length, i = [];
-    if (s === 0)
+  calculateOutputIndexValueRowID(t, n, s, o) {
+    const a = t.length, r = [];
+    if (a === 0)
       return [];
-    let u = 0, a = t[0];
-    if (a >= n.length)
-      throw new Error(`Got currentValueRowId=${a}, which is not less than ${n.length}`);
-    let h = n[a];
-    i.push(h);
-    for (let c = 1; c < s; ++c) {
-      const f = t[c];
-      if (f === a)
-        h >= 0 && (++u, u < o ? h += r : h = -1);
+    let i = 0, l = t[0];
+    if (l >= n.length)
+      throw new Error(`Got currentValueRowId=${l}, which is not less than ${n.length}`);
+    let u = n[l];
+    r.push(u);
+    for (let h = 1; h < a; ++h) {
+      const f = t[h];
+      if (f === l)
+        u >= 0 && (++i, i < o ? u += s : u = -1);
       else {
-        if (u = 0, a = f, f >= n.length)
+        if (i = 0, l = f, f >= n.length)
           throw new Error(`Got nextValueRowId=${f} which is not less than ${n.length}`);
-        h = n[f];
+        u = n[f];
       }
-      i.push(h);
+      r.push(u);
     }
-    if (i.length !== t.length)
+    if (r.length !== t.length)
       throw new Error("Invalid row ids.");
-    return i;
-  }
-  calculateOutputIndex(t, n, r, o) {
-    const s = this.getRowPartitionTensor(t), i = this.getRowPartitionTypeByDimension(t);
-    switch (i) {
-      case B.VALUE_ROWIDS:
-        return this.calculateOutputIndexValueRowID(s, n, r, o);
-      case B.ROW_SPLITS:
-        if (s.length - 1 > n.length)
-          throw new Error(`Row partition size is greater than output size: ${s.length - 1} > ${n.length}`);
-        return this.calculateOutputIndexRowSplit(s, n, r, o);
+    return r;
+  }
+  calculateOutputIndex(t, n, s, o) {
+    const a = this.getRowPartitionTensor(t), r = this.getRowPartitionTypeByDimension(t);
+    switch (r) {
+      case Z.VALUE_ROWIDS:
+        return this.calculateOutputIndexValueRowID(a, n, s, o);
+      case Z.ROW_SPLITS:
+        if (a.length - 1 > n.length)
+          throw new Error(`Row partition size is greater than output size: ${a.length - 1} > ${n.length}`);
+        return this.calculateOutputIndexRowSplit(a, n, s, o);
       default:
-        throw new Error(`Unsupported partition type: ${B[i]}`);
+        throw new Error(`Unsupported partition type: ${Z[r]}`);
     }
   }
   getFirstDimensionSize() {
@@ -1887,94 +2105,94 @@ class it {
       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 t[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() {
     if (this.rowPartitionValues[0].length <= 0)
       throw new Error("Invalid first partition input. Tensor requires at least one element.");
-    const n = this.getFirstDimensionSize(), r = this.calculateOutputSize(n), o = new Array(this.raggedRank + 1);
+    const n = this.getFirstDimensionSize(), s = this.calculateOutputSize(n), o = new Array(this.raggedRank + 1);
     o[o.length - 1] = 1;
-    for (let a = o.length - 2; a >= 0; --a)
-      o[a] = o[a + 1] * r[a + 1];
-    const s = Ft(r, !1), i = q(this.valuesDType, $(s));
-    if (o[0] * r[0] > 0) {
-      let a = this.calculateFirstParentOutputIndex(n, o[0], r[0]);
-      for (let h = 1; h <= this.raggedRank; ++h)
-        a = this.calculateOutputIndex(h - 1, a, o[h], r[h]);
-      this.setOutput(this.raggedRank, a, i, s);
+    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));
+    if (o[0] * s[0] > 0) {
+      let l = this.calculateFirstParentOutputIndex(n, o[0], s[0]);
+      for (let u = 1; u <= this.raggedRank; ++u)
+        l = this.calculateOutputIndex(u - 1, l, o[u], s[u]);
+      this.setOutput(this.raggedRank, l, r, a);
     }
-    return [s, i];
+    return [a, r];
   }
-  setOutput(t, n, r, o) {
-    if (r.length === 0)
+  setOutput(t, n, s, o) {
+    if (s.length === 0)
       return;
-    const s = this.values, i = r;
-    let u = o.slice();
-    u = u.slice(t + 1);
-    const a = $(u), h = n.length;
-    let c = this.defaultValue;
-    if (c.length !== a && c.length !== 1) {
+    const a = this.values, r = s;
+    let i = o.slice();
+    i = i.slice(t + 1);
+    const l = A(i), u = n.length;
+    let h = this.defaultValue;
+    if (h.length !== l && h.length !== 1) {
       const m = this.defaultValueShape;
-      At(() => {
-        const b = Vt(c, m);
-        c = qt(b, u).dataSync();
+      Xe(() => {
+        const F = En(h, m);
+        h = xn(F, i).dataSync();
       });
     }
     let f = 0, p = 0, I = 0;
-    for (let m = 0; m <= h; ++m) {
-      let b = m < h ? n[m] : -1;
-      if (b === I) {
+    for (let m = 0; m <= u; ++m) {
+      let F = m < u ? n[m] : -1;
+      if (F === I) {
         ++I;
         continue;
       }
       if (p < I) {
-        const g = s.subarray(f * a), d = i.subarray(p * a), E = (I - p) * a;
-        St(d, g, E);
+        const g = a.subarray(f * l), d = r.subarray(p * l), b = (I - p) * l;
+        Pt(d, g, b);
       }
-      if (m >= h) {
-        const g = r.length;
-        b = Math.floor(g / a);
+      if (m >= u) {
+        const g = s.length;
+        F = Math.floor(g / l);
       }
-      if (b > I)
+      if (F > I)
         if (this.defaultValue.length === 1)
-          i.subarray(I * a, b * a).fill(this.defaultValue[0]), I = b;
+          r.subarray(I * l, F * l).fill(this.defaultValue[0]), I = F;
         else
-          for (; b > I; ) {
-            const g = i.slice(I * a);
-            St(g, c, a), ++I;
+          for (; F > I; ) {
+            const g = r.slice(I * l);
+            Pt(g, h, l), ++I;
           }
-      b < 0 ? (f = m + 1, p = I) : (f = m, p = I, I = p + 1);
+      F < 0 ? (f = m + 1, p = I) : (f = m, p = I, I = p + 1);
     }
   }
 }
-function St(e, t, n) {
-  for (let r = 0; r < n; r++)
-    e[r] = t[r];
+function Pt(e, t, n) {
+  for (let s = 0; s < n; s++)
+    e[s] = t[s];
 }
-function Ft(e, t) {
+function Ct(e, t) {
   const n = [];
-  for (let r of e) {
-    if (r < 0) {
+  for (let s of e) {
+    if (s < 0) {
       if (!t)
-        throw new Error(`Dimension ${r} must be >= 0`);
-      if (r < -1)
-        throw new Error(`Dimension ${r} must be >= -1`);
-      r = -1;
+        throw new Error(`Dimension ${s} must be >= 0`);
+      if (s < -1)
+        throw new Error(`Dimension ${s} must be >= -1`);
+      s = -1;
     }
-    n.push(r);
+    n.push(s);
   }
   return n;
 }
-function He(e, t, n, r, o, s, i, u, a, h) {
-  return new it(e, t, n, r, o, s, i, u, a, h).compute();
+function ws(e, t, n, s, o, a, r, i, l, u) {
+  return new ft(e, t, n, s, o, a, r, i, l, u).compute();
 }
 /**
  * @license
@@ -1992,15 +2210,15 @@ function He(e, t, n, r, o, s, i, u, a, h) {
  * limitations under the License.
  * =============================================================================
  */
-function Ke(e, t, n, r) {
-  const o = e === t, s = e < t && n < 0, i = t < e && n > 1;
-  if (o || s || i)
-    return rt(0, r);
-  const u = Math.abs(Math.ceil((t - e) / n)), a = rt(u, r);
-  t < e && n === 1 && (n = -1), a[0] = e;
-  for (let h = 1; h < a.length; h++)
-    a[h] = a[h - 1] + n;
-  return a;
+function bs(e, t, n, s) {
+  const o = e === t, a = e < t && n < 0, r = t < e && n > 1;
+  if (o || a || r)
+    return st(0, s);
+  const i = Math.abs(Math.ceil((t - e) / n)), l = st(i, s);
+  t < e && n === 1 && (n = -1), l[0] = e;
+  for (let u = 1; u < l.length; u++)
+    l[u] = l[u - 1] + n;
+  return l;
 }
 /**
  * @license
@@ -2018,7 +2236,11 @@ function Ke(e, t, n, r) {
  * limitations under the License.
  * =============================================================================
  */
-const Xe = K((e) => 1 / Math.sqrt(e));
+const qe = X((e) => 1 / Math.sqrt(e)), xs = J(Jt, qe), yo = {
+  kernelName: Jt,
+  backendName: "cpu",
+  kernelFunc: xs
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2035,23 +2257,23 @@ const Xe = K((e) => 1 / Math.sqrt(e));
  * limitations under the License.
  * =============================================================================
  */
-function Qe(e, t, n, r, o, s, i, u, a, h) {
-  const c = [r / o, o], f = e.values, p = t.values;
-  if (r === 0)
-    return k(n, t.dtype);
-  const I = a instanceof ct ? a : k(c, t.dtype);
-  typeof a == "string" || typeof a == "number" ? I.values.fill(a) : typeof a == "boolean" && I.values.fill(+a);
-  for (let m = 0; m < s; m++) {
-    const b = [];
+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);
+  for (let m = 0; m < a; m++) {
+    const F = [];
     let g = 0;
-    for (let d = 0; d < i; d++) {
-      const E = f[m * i + d];
-      b.push(E), g += E * u[d];
+    for (let d = 0; d < r; d++) {
+      const b = f[m * r + d];
+      F.push(b), g += b * i[d];
     }
-    if (g < 0 || g >= r / o)
-      throw new Error(`Invalid indices: ${b} does not index into ${n}`);
+    if (g < 0 || g >= s / o)
+      throw new Error(`Invalid indices: ${F} does not index into ${n}`);
     for (let d = 0; d < o; d++)
-      h ? I.values[g * o + d] += p[m * o + d] : I.values[g * o + d] = t.rank === 0 ? p[0] : p[m * 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];
   }
   return I;
 }
@@ -2071,7 +2293,11 @@ function Qe(e, t, n, r, o, s, i, u, a, h) {
  * limitations under the License.
  * =============================================================================
  */
-const Je = K((e) => 1 / (1 + Math.exp(-e)));
+const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = ge(Qt, (e) => 1 / (1 + Math.exp(-e))), ko = {
+  kernelName: Qt,
+  backendName: "cpu",
+  kernelFunc: ys
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2088,19 +2314,32 @@ const Je = K((e) => 1 / (1 + Math.exp(-e)));
  * limitations under the License.
  * =============================================================================
  */
-function Ye(e, t, n, r, o) {
-  const s = Ut(r, t, n), i = $(n), u = Y(r);
-  if (s) {
-    const f = zt(t, u);
-    return o === "string" ? e.slice(f, f + i) : e.subarray(f, f + i);
-  }
-  const a = o === "string" ? bt(e) : e, h = k(r, o, a), c = k(n, o);
-  for (let f = 0; f < c.size; ++f) {
-    const p = c.indexToLoc(f), I = p.map((m, b) => m + t[b]);
-    c.set(h.get(...I), ...p);
-  }
-  return o === "string" ? Pt(c.values) : c.values;
-}
+function Ue(e, t, n, s, o) {
+  const a = kn(s, t, n), r = A(n), i = K(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);
+  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);
+  }
+  return o === "string" ? sn(h.values) : h.values;
+}
+function ks(e) {
+  const { inputs: t, backend: n, attrs: s } = e, { x: o } = t, { begin: a, size: r } = s;
+  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);
+  return n.makeTensorInfo(l, o.dtype, h);
+}
+const No = {
+  kernelName: Ye,
+  backendName: "cpu",
+  kernelFunc: ks
+};
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -2117,69 +2356,69 @@ function Ye(e, t, n, r, o) {
  * limitations under the License.
  * =============================================================================
  */
-function tn(e, t, n, r, o, s, i) {
-  const u = t[0], a = s[0], h = new Array(a), c = new Array(u), f = t[1];
-  if (a === 0) {
-    if (u !== 0)
-      throw new Error(ee(u));
-    const g = q(n, 0), d = q(o, 0);
+function Ns(e, t, n, s, o, a, r) {
+  const i = t[0], l = a[0], u = new Array(l), h = new Array(i), f = t[1];
+  if (l === 0) {
+    if (i !== 0)
+      throw new Error(on(i));
+    const g = D(n, 0), d = D(o, 0);
     return [
       g,
       [0, f],
       d,
-      h,
-      c
+      u,
+      h
     ];
   }
   let p = !0, I = 0;
-  const m = new Array(a).fill(0);
-  for (let g = 0; g < u; ++g) {
+  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(ne(g, d));
-    if (d >= a)
-      throw new Error(re(g, d, a));
+      throw new Error(rn(g, d));
+    if (d >= l)
+      throw new Error(an(g, d, l));
     ++m[d], p = p && d >= I, I = d;
   }
-  let b = !0;
-  for (let g = 0; g < a; ++g) {
+  let F = !0;
+  for (let g = 0; g < l; ++g) {
     const d = m[g] === 0;
-    h[g] = d, b = b && !d, m[g] = Math.max(m[g], 1), g > 0 && (m[g] += m[g - 1]);
+    u[g] = d, F = F && !d, m[g] = Math.max(m[g], 1), g > 0 && (m[g] += m[g - 1]);
   }
-  if (b && p) {
-    const g = e, d = r;
-    for (let E = 0; E < u; ++E)
-      c[E] = E;
+  if (F && p) {
+    const g = e, d = s;
+    for (let b = 0; b < i; ++b)
+      h[b] = b;
     return [
       g,
-      [u, f],
+      [i, f],
       d,
-      h,
-      c
+      u,
+      h
     ];
   } else {
-    const g = m[a - 1], d = q(n, g * f), E = q(o, g), R = new Array(a).fill(0);
-    for (let x = 0; x < u; ++x) {
-      const D = e[x * f], V = R[D], z = (D === 0 ? 0 : m[D - 1]) + V;
-      R[D]++;
-      for (let L = 0; L < f; ++L)
-        d[z * f + L] = e[x * f + L];
-      E[z] = r[x], c[x] = z;
+    const g = m[l - 1], d = D(n, g * f), b = D(o, g), 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;
     }
-    for (let x = 0; x < a; ++x)
-      if (R[x] === 0) {
-        const V = x === 0 ? 0 : m[x - 1];
-        d[V * f + 0] = x;
-        for (let z = 1; z < f; ++z)
-          d[V * f + z] = 0;
-        E[V] = i;
+    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;
       }
     return [
       d,
       [g, f],
-      E,
-      h,
-      c
+      b,
+      u,
+      h
     ];
   }
 }
@@ -2199,52 +2438,52 @@ function tn(e, t, n, r, o, s, i) {
  * limitations under the License.
  * =============================================================================
  */
-function en(e, t, n, r, o) {
-  const s = $(r), i = t[0], u = o.length, a = [];
-  let h = 1, c = -1;
-  for (let g = 0; g < u; ++g) {
+function Ss(e, t, n, s, o) {
+  const a = A(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) {
-      if (c !== -1)
-        throw new Error(oe(c, g));
-      c = g, a.push(1);
+      if (h !== -1)
+        throw new Error(ln(h, g));
+      h = g, l.push(1);
     } else {
       if (d < 0)
-        throw new Error(se(g, d));
-      h *= d, a.push(d);
+        throw new Error(cn(g, d));
+      u *= d, l.push(d);
     }
   }
-  if (c !== -1) {
-    if (h <= 0)
-      throw new Error(ie());
-    const g = Math.trunc(s / h);
-    if (h * g !== s)
-      throw new Error(le(r, a));
-    a[c] = g;
-  }
-  if ($(a) !== s)
-    throw new Error(ue(r, a));
-  const p = r.length, I = [];
+  if (h !== -1) {
+    if (u <= 0)
+      throw new Error(un());
+    const g = Math.trunc(a / u);
+    if (u * g !== a)
+      throw new Error(hn(s, l));
+    l[h] = g;
+  }
+  if (A(l) !== a)
+    throw new Error(fn(s, l));
+  const p = s.length, I = [];
   if (p > 0) {
     I[p - 1] = 1;
     for (let g = p - 2; g >= 0; --g)
-      I[g] = I[g + 1] * r[g + 1];
+      I[g] = I[g + 1] * s[g + 1];
   }
   const m = [];
-  if (u > 0) {
-    m[u - 1] = 1;
-    for (let g = u - 2; g >= 0; --g)
-      m[g] = m[g + 1] * a[g + 1];
+  if (i > 0) {
+    m[i - 1] = 1;
+    for (let g = i - 2; g >= 0; --g)
+      m[g] = m[g + 1] * l[g + 1];
   }
-  const b = q(n, i * u);
-  for (let g = 0; g < i; ++g) {
+  const F = D(n, r * i);
+  for (let g = 0; g < r; ++g) {
     let d = 0;
-    for (let E = 0; E < p; ++E)
-      d += e[g * p + E] * I[E];
-    for (let E = 0; E < u; ++E)
-      b[g * u + E] = Math.trunc(d / m[E]), d %= m[E];
+    for (let b = 0; b < p; ++b)
+      d += e[g * p + b] * I[b];
+    for (let b = 0; b < i; ++b)
+      F[g * i + b] = Math.trunc(d / m[b]), d %= m[b];
   }
-  return [b, [i, u], a];
+  return [F, [r, i], l];
 }
 /**
  * @license
@@ -2262,45 +2501,45 @@ function en(e, t, n, r, o) {
  * limitations under the License.
  * =============================================================================
  */
-function nn(e, t, n, r, o, s = !1, i = 0) {
-  const u = r.length, a = [t[0], e.length / t[0]], h = a[1], f = u > 0 ? o[u - 1] + 1 : 0;
+function vs(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(pt());
+    throw new Error(Nt());
   const p = t.slice();
   p[0] = f;
-  const I = p.reduce((R, x) => R * x, 1), m = q(n, I);
-  if (u === 0)
-    return f > 0 && m.fill(i), [m, p];
+  const I = p.reduce((k, y) => k * y, 1), m = D(n, I);
+  if (i === 0)
+    return f > 0 && m.fill(r), [m, p];
   if (f <= 0)
-    throw new Error(pt());
-  let b = 0, g = 1, d = 0, E = o[b];
+    throw new Error(Nt());
+  let F = 0, g = 1, d = 0, b = o[F];
   for (; ; ) {
-    let R = 0;
-    if (g < u) {
-      if (R = o[g], E === R) {
+    let k = 0;
+    if (g < i) {
+      if (k = o[g], b === k) {
         ++g;
         continue;
       }
-      if (E >= R)
-        throw new Error(ae());
+      if (b >= k)
+        throw new Error(gn());
     }
-    if (E < 0 || E >= f)
-      throw new Error(he(E, f));
-    E > d && m.fill(i, d * h, E * h);
-    for (let x = b; x < g; ++x) {
-      const D = r[x];
-      if (D < 0 || D >= a[0])
-        throw new Error(ce(x, r[x], a[0]));
-      for (let V = 0; V < h; V++)
-        m[E * h + V] += e[D * h + V];
+    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(mn(y, s[y], l[0]));
+      for (let P = 0; P < u; P++)
+        m[b * u + P] += e[S * u + P];
     }
-    if (s)
-      for (let x = 0; x < h; x++)
-        m[E * h + x] /= g - b;
-    if (b = g, ++g, d = E + 1, E = R, g > u)
+    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)
       break;
   }
-  return d < f && m.fill(i, d * h, f * h), [m, p];
+  return d < f && m.fill(r, d * u, f * u), [m, p];
 }
 /**
  * @license
@@ -2318,7 +2557,11 @@ function nn(e, t, n, r, o, s = !1, i = 0) {
  * limitations under the License.
  * =============================================================================
  */
-const rn = K((e) => Math.sqrt(e));
+const Ts = X((e) => Math.sqrt(e)), Rs = ge(te, (e) => Math.sqrt(e)), So = {
+  kernelName: te,
+  backendName: "cpu",
+  kernelFunc: Rs
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2335,10 +2578,14 @@ const rn = K((e) => Math.sqrt(e));
  * limitations under the License.
  * =============================================================================
  */
-const on = U((e, t) => {
+const Me = W((e, t) => {
   const n = e - t;
   return n * n;
-});
+}), Ps = z(ee, Me), vo = {
+  kernelName: ee,
+  backendName: "cpu",
+  kernelFunc: Ps
+};
 /**
  * @license
  * Copyright 2023 Google LLC.
@@ -2355,10 +2602,14 @@ const on = U((e, t) => {
  * limitations under the License.
  * =============================================================================
  */
-const sn = K((e, t) => {
-  const { pattern: n, replaceGlobal: r, rewrite: o } = t;
-  return e.replace(new RegExp(n, r ? "g" : ""), o);
-});
+const Oe = 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 = {
+  kernelName: ne,
+  backendName: "cpu",
+  kernelFunc: Cs
+};
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2375,13 +2626,13 @@ const sn = K((e, t) => {
  * limitations under the License.
  * =============================================================================
  */
-function ln(e, t, n, r) {
-  const o = k(e, t.dtype);
-  for (let s = 0; s < o.size; s++) {
-    const i = o.indexToLoc(s), u = new Array(i.length);
-    for (let a = 0; a < u.length; a++)
-      u[a] = i[a] * n[a] + r[a];
-    o.set(t.get(...u), ...i);
+function qs(e, t, n, s) {
+  const o = H(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++)
+      i[l] = r[l] * n[l] + s[l];
+    o.set(t.get(...i), ...r);
   }
   return o;
 }
@@ -2401,40 +2652,40 @@ function ln(e, t, n, r) {
  * limitations under the License.
  * =============================================================================
  */
-class un {
-  constructor(t, n, r, o, s, i) {
-    this.separator = ut(t), this.nGramWidths = n, this.leftPad = ut(r), this.rightPad = ut(o), this.padWidth = s, this.preserveShort = i;
+class Us {
+  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;
   }
   getPadWidth(t) {
     return Math.min(this.padWidth < 0 ? t - 1 : this.padWidth, t - 1);
   }
   getNumNGrams(t, n) {
-    const r = this.getPadWidth(n);
-    return Math.max(0, t + 2 * r - n + 1);
+    const s = this.getPadWidth(n);
+    return Math.max(0, t + 2 * s - n + 1);
   }
-  createNGrams(t, n, r, o, s, i) {
-    for (let u = 0; u < s; ++u) {
-      const a = this.getPadWidth(i), h = Math.max(0, a - u), c = Math.max(0, a - (s - (u + 1))), f = i - (h + c), p = n + (h > 0 ? 0 : u - a);
+  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 += h * this.leftPad.length;
-      for (let E = 0; E < f; ++E)
-        I += t[p + E].length;
-      I += c * this.rightPad.length;
-      const m = h + c + f - 1;
-      I += m * this.separator.length, r[o + u] = new Uint8Array(I);
-      const b = r[o + u];
+      I += u * this.leftPad.length;
+      for (let b = 0; b < f; ++b)
+        I += t[p + b].length;
+      I += h * this.rightPad.length;
+      const m = u + h + f - 1;
+      I += m * this.separator.length, s[o + i] = new Uint8Array(I);
+      const F = s[o + i];
       let g = 0;
-      const d = (E) => E.forEach((R) => b[g++] = R);
-      for (let E = 0; E < h; ++E)
+      const d = (b) => b.forEach((k) => F[g++] = k);
+      for (let b = 0; b < u; ++b)
         d(this.leftPad), d(this.separator);
-      for (let E = 0; E < f - 1; ++E)
-        d(t[p + E]), d(this.separator);
+      for (let b = 0; b < f - 1; ++b)
+        d(t[p + b]), d(this.separator);
       if (f > 0) {
         d(t[p + f - 1]);
-        for (let E = 0; E < c; ++E)
+        for (let b = 0; b < h; ++b)
           d(this.separator), d(this.rightPad);
       } else {
-        for (let E = 0; E < c - 1; ++E)
+        for (let b = 0; b < h - 1; ++b)
           d(this.rightPad), d(this.separator);
         d(this.rightPad);
       }
@@ -2444,55 +2695,55 @@ class un {
   // where data is 1 dimensional and contains the values of the tensor
   // and splits denotes the indices at which each row starts.
   compute(t, n) {
-    const r = t.length, o = n.length;
+    const s = t.length, o = n.length;
     if (o > 0) {
-      let a = n[0];
-      if (a !== 0)
-        throw new Error(`First split value must be 0, got ${a}`);
-      for (let h = 1; h < o; ++h) {
-        let c = n[h] >= a;
-        if (c = c && n[h] <= r, !c)
-          throw new Error(`Invalid split value ${n[h]}, must be in [${a}, ${r}]`);
-        a = n[h];
+      let l = n[0];
+      if (l !== 0)
+        throw new Error(`First split value must be 0, got ${l}`);
+      for (let u = 1; u < o; ++u) {
+        let h = n[u] >= l;
+        if (h = h && n[u] <= s, !h)
+          throw new Error(`Invalid split value ${n[u]}, must be in [${l}, ${s}]`);
+        l = n[u];
       }
-      if (a !== r)
-        throw new Error(`Last split value must be data size. Expected ${r}, got ${a}`);
+      if (l !== s)
+        throw new Error(`Last split value must be data size. Expected ${s}, got ${l}`);
     }
-    const s = o - 1, i = q("int32", o);
-    if (r === 0 || o === 0) {
-      const a = new Array(r);
-      for (let h = 0; h <= s; ++h)
-        i[h] = 0;
-      return [a, i];
+    const a = o - 1, r = D("int32", o);
+    if (s === 0 || o === 0) {
+      const l = new Array(s);
+      for (let u = 0; u <= a; ++u)
+        r[u] = 0;
+      return [l, r];
     }
-    i[0] = 0;
-    for (let a = 1; a <= s; ++a) {
-      const h = n[a] - n[a - 1];
-      let c = 0;
+    r[0] = 0;
+    for (let l = 1; l <= a; ++l) {
+      const u = n[l] - n[l - 1];
+      let h = 0;
       this.nGramWidths.forEach((f) => {
-        c += this.getNumNGrams(h, f);
-      }), this.preserveShort && h > 0 && c === 0 && (c = 1), i[a] = i[a - 1] + c;
+        h += this.getNumNGrams(u, f);
+      }), this.preserveShort && u > 0 && h === 0 && (h = 1), r[l] = r[l - 1] + h;
     }
-    const u = new Array(i[s]);
-    for (let a = 0; a < s; ++a) {
-      const h = n[a];
-      let c = i[a];
+    const i = new Array(r[a]);
+    for (let l = 0; l < a; ++l) {
+      const u = n[l];
+      let h = r[l];
       if (this.nGramWidths.forEach((f) => {
-        const p = n[a + 1] - n[a], I = this.getNumNGrams(p, f);
-        this.createNGrams(t, h, u, c, I, f), c += I;
-      }), this.preserveShort && c === i[a]) {
-        const f = n[a + 1] - n[a];
+        const p = n[l + 1] - n[l], I = this.getNumNGrams(p, f);
+        this.createNGrams(t, u, i, h, I, f), h += I;
+      }), this.preserveShort && h === r[l]) {
+        const f = n[l + 1] - n[l];
         if (f === 0)
           continue;
         const p = f + 2 * this.padWidth;
-        this.createNGrams(t, h, u, c, 1, p);
+        this.createNGrams(t, u, i, h, 1, p);
       }
     }
-    return [u, i];
+    return [i, r];
   }
 }
-function an(e, t, n, r, o, s, i, u) {
-  return new un(n, r, o, s, i, u).compute(e, t);
+function Ms(e, t, n, s, o, a, r, i) {
+  return new Us(n, s, o, a, r, i).compute(e, t);
 }
 /**
  * @license
@@ -2510,47 +2761,47 @@ function an(e, t, n, r, o, s, i, u) {
  * limitations under the License.
  * =============================================================================
  */
-function hn(e, t, n, r) {
+function Os(e, t, n, s) {
   if (!e.length)
     return;
   if (t.length === 0) {
-    for (let s = 0; s < e.length; ++s)
-      r.push(e.subarray(s, s + 1));
+    for (let a = 0; a < e.length; ++a)
+      s.push(e.subarray(a, a + 1));
     return;
   }
   if (t.length === 1) {
-    const s = t[0];
-    let i = e.indexOf(s);
-    for (; i !== -1; ) {
-      const u = e.subarray(0, i);
-      (!n || u.length !== 0) && r.push(u), e = e.subarray(i + 1), i = e.indexOf(s);
+    const a = t[0];
+    let r = e.indexOf(a);
+    for (; r !== -1; ) {
+      const i = e.subarray(0, r);
+      (!n || i.length !== 0) && s.push(i), e = e.subarray(r + 1), r = e.indexOf(a);
     }
-    (!n || e.length !== 0) && r.push(e);
+    (!n || e.length !== 0) && s.push(e);
     return;
   }
   let o = 0;
-  for (let s = 0; s < e.length + 1; s++)
-    if (s === e.length || t.indexOf(e[s]) !== -1) {
-      const i = e.subarray(o, s);
-      (!n || i.length !== 0) && r.push(i), o = s + 1;
+  for (let a = 0; a < e.length + 1; a++)
+    if (a === e.length || t.indexOf(e[a]) !== -1) {
+      const r = e.subarray(o, a);
+      (!n || r.length !== 0) && s.push(r), o = a + 1;
     }
 }
-function cn(e, t, n) {
-  const r = e.length, o = [];
-  let s = 0, i = 0;
-  const u = new Array(r);
-  for (let p = 0; p < r; ++p) {
+function Ls(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;
-    hn(e[p], t, n, o);
+    Os(e[p], t, n, o);
     const m = o.length - I;
-    u[p] = m, s += m, i = Math.max(i, m);
+    i[p] = m, a += m, r = Math.max(r, m);
   }
-  const a = q("int32", s * 2), h = new Array(s), c = [r, i];
+  const l = D("int32", a * 2), u = new Array(a), h = [s, r];
   let f = 0;
-  for (let p = 0; p < r; ++p)
-    for (let I = 0; I < u[p]; ++I)
-      a[f * 2] = p, a[f * 2 + 1] = I, h[f] = o[f], ++f;
-  return [a, h, c];
+  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;
+  return [l, u, h];
 }
 /**
  * @license
@@ -2568,10 +2819,10 @@ function cn(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-function fn(e, t) {
-  const n = q("int32", e.length);
-  for (let r = 0; r < e.length; ++r)
-    n[r] = Xt(e[r]).modulo(t).getLowBitsUnsigned();
+function As(e, t) {
+  const n = D("int32", e.length);
+  for (let s = 0; s < e.length; ++s)
+    n[s] = Mn(e[s]).modulo(t).getLowBitsUnsigned();
   return n;
 }
 /**
@@ -2590,7 +2841,11 @@ function fn(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-const gn = U((e, t) => e - t);
+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 = {
+  kernelName: se,
+  backendName: "cpu",
+  kernelFunc: Vs
+};
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -2607,19 +2862,19 @@ const gn = U((e, t) => e - t);
  * limitations under the License.
  * =============================================================================
  */
-function dn(e, t) {
+function Ds(e, t) {
   const n = new Array(e.rank);
   for (let o = 0; o < n.length; o++)
     n[o] = e.shape[o] * t[o];
-  const r = k(n, e.dtype);
-  for (let o = 0; o < r.values.length; ++o) {
-    const s = r.indexToLoc(o), i = new Array(e.rank);
-    for (let a = 0; a < i.length; a++)
-      i[a] = s[a] % e.shape[a];
-    const u = e.locToIndex(i);
-    r.values[o] = e.values[u];
+  const s = H(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++)
+      r[l] = a[l] % e.shape[l];
+    const i = e.locToIndex(r);
+    s.values[o] = e.values[i];
   }
-  return r;
+  return s;
 }
 /**
  * @license
@@ -2637,41 +2892,41 @@ function dn(e, t) {
  * limitations under the License.
  * =============================================================================
  */
-const et = (e, t) => {
+const rt = (e, t) => {
   const n = t.value - e.value;
   return n === 0 ? e.index - t.index : n;
 };
-function _t(e, t, n = 0, r = e.length - 1) {
-  for (; r > n; ) {
-    if (r - n > 600) {
-      const u = r - n + 1, a = t - n + 1, h = Math.log(u), c = 0.5 * Math.exp(2 * h / 3), f = 0.5 * Math.sqrt(h * c * (u - c) / u) * Math.sign(a - u / 2), p = Math.max(n, Math.floor(t - a * c / u + f)), I = Math.min(r, Math.floor(t + (u - a) * c / u + f));
-      _t(e, t, p, I);
+function Ae(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 o = e[t];
-    let s = n, i = r;
-    for (tt(e, n, t), et(e[r], o) > 0 && tt(e, n, r); s < i; ) {
-      for (tt(e, s, i), s++, i--; et(e[s], o) < 0; )
-        s = s + 1;
-      for (; et(e[i], o) > 0; )
-        i = i - 1;
+    let a = n, r = s;
+    for (ot(e, n, t), rt(e[s], o) > 0 && ot(e, n, s); a < r; ) {
+      for (ot(e, a, r), a++, r--; rt(e[a], o) < 0; )
+        a = a + 1;
+      for (; rt(e[r], o) > 0; )
+        r = r - 1;
     }
-    et(e[n], o) === 0 ? tt(e, n, i) : (i = i + 1, tt(e, i, r)), i <= t && (n = i + 1), t <= i && (r = i - 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 mn(e, t, n, r, o) {
-  const s = t[t.length - 1], [i, u] = [e.length / s, s], a = nt(n, i * r), h = nt("int32", i * r);
-  for (let f = 0; f < i; f++) {
-    const p = f * u, I = e.subarray(p, p + u);
+function Ws(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((E, R) => m[R] = { value: E, index: R }), r < m.length && (_t(m, r), m = m.slice(0, r)), o && m.sort(et);
-    const b = f * r, g = a.subarray(b, b + r), d = h.subarray(b, b + r);
-    for (let E = 0; E < r; E++)
-      g[E] = m[E].value, d[E] = m[E].index;
-  }
-  const c = t.slice();
-  return c[c.length - 1] = r, [
-    k(c, n, a),
-    k(c, "int32", h)
+    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);
+    for (let b = 0; b < s; b++)
+      g[b] = m[b].value, d[b] = m[b].index;
+  }
+  const h = t.slice();
+  return h[h.length - 1] = s, [
+    H(h, n, l),
+    H(h, "int32", u)
   ];
 }
 /**
@@ -2690,46 +2945,46 @@ function mn(e, t, n, r, o) {
  * limitations under the License.
  * =============================================================================
  */
-function wn(e, t, n, r) {
-  const o = Dt(t, n)[0], s = [1, n[0], 1];
+function $s(e, t, n, s) {
+  const o = Yt(t, n)[0], a = [1, n[0], 1];
   for (let m = 0; m < o; m++)
-    s[0] *= n[m];
-  s[1] = n[o];
+    a[0] *= n[m];
+  a[1] = n[o];
   for (let m = o + 1; m < n.length; m++)
-    s[2] *= n[m];
-  const i = /* @__PURE__ */ new Map(), u = new Int32Array(n[o]), a = new ct(s, r, e), h = [], c = s[0] === 1 && s[2] === 1;
+    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;
   for (let m = 0; m < n[o]; m++) {
-    let b;
-    if (c)
-      b = e[m].toString();
+    let F;
+    if (h)
+      F = e[m].toString();
     else {
       const d = [];
-      for (let E = 0; E < s[0]; E++)
-        for (let R = 0; R < s[2]; R++)
-          d.push(a.get(E, m, R));
-      b = d.join(",");
+      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(",");
     }
-    const g = i.get(b);
+    const g = r.get(F);
     if (g != null)
-      u[m] = g;
+      i[m] = g;
     else {
-      const d = i.size;
-      i.set(b, d), u[m] = d, h.push(m);
+      const d = r.size;
+      r.set(F, d), i[m] = d, u.push(m);
     }
   }
-  const f = s.slice();
-  f[1] = i.size;
-  const p = new ct(f, r);
-  h.forEach((m, b) => {
-    for (let g = 0; g < s[0]; g++)
-      for (let d = 0; d < s[2]; d++)
-        p.set(a.get(g, m, d), g, b, d);
+  const f = a.slice();
+  f[1] = r.size;
+  const p = new wt(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);
   });
   const I = n.slice();
   return I[o] = f[1], {
     outputValues: p.values,
     outputShape: I,
-    indices: u
+    indices: i
   };
 }
 /**
@@ -2748,59 +3003,59 @@ function wn(e, t, n, r) {
  * limitations under the License.
  * =============================================================================
  */
-const pn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const zs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  addImpl: de,
-  bincountImpl: me,
-  bincountReduceImpl: we,
-  bitwiseAndImpl: pe,
-  castImpl: ge,
-  ceilImpl: Ie,
-  concatImpl: Ee,
-  equalImpl: Se,
-  expImpl: Fe,
-  expm1Impl: be,
-  floorDivImpl: Re,
-  floorImpl: xe,
-  gatherNdImpl: Te,
-  gatherV2Impl: ve,
-  greaterEqualImpl: _e,
-  greaterImpl: Oe,
-  lessEqualImpl: Le,
-  lessImpl: ye,
-  linSpaceImpl: Me,
-  logImpl: Ne,
-  maxImpl: $e,
-  maximumImpl: Ae,
-  minimumImpl: De,
-  multiplyImpl: Ot,
-  negImpl: Pe,
-  notEqualImpl: We,
-  prodImpl: Ve,
-  raggedGatherImpl: Be,
-  raggedRangeImpl: ke,
-  raggedTensorToTensorImpl: He,
-  rangeImpl: Ke,
-  rsqrtImpl: Xe,
-  scatterImpl: Qe,
-  sigmoidImpl: Je,
-  simpleAbsImpl: fe,
-  sliceImpl: Ye,
-  sparseFillEmptyRowsImpl: tn,
-  sparseReshapeImpl: en,
-  sparseSegmentReductionImpl: nn,
-  sqrtImpl: rn,
-  squaredDifferenceImpl: on,
-  staticRegexReplaceImpl: sn,
-  stridedSliceImpl: ln,
-  stringNGramsImpl: an,
-  stringSplitImpl: cn,
-  stringToHashBucketFastImpl: fn,
-  subImpl: gn,
-  tileImpl: dn,
-  topKImpl: mn,
-  transposeImpl: qe,
-  uniqueImpl: wn
+  addImpl: he,
+  bincountImpl: _n,
+  bincountReduceImpl: Vn,
+  bitwiseAndImpl: fe,
+  castImpl: ue,
+  ceilImpl: de,
+  concatImpl: $n,
+  equalImpl: me,
+  expImpl: pe,
+  expm1Impl: Ie,
+  floorDivImpl: be,
+  floorImpl: we,
+  gatherNdImpl: Hn,
+  gatherV2Impl: Kn,
+  greaterEqualImpl: Ee,
+  greaterImpl: xe,
+  lessEqualImpl: ye,
+  lessImpl: Fe,
+  linSpaceImpl: ts,
+  logImpl: ke,
+  maxImpl: ns,
+  maximumImpl: Ne,
+  minimumImpl: Se,
+  multiplyImpl: yt,
+  negImpl: ve,
+  notEqualImpl: Te,
+  prodImpl: Ce,
+  raggedGatherImpl: ps,
+  raggedRangeImpl: Is,
+  raggedTensorToTensorImpl: ws,
+  rangeImpl: bs,
+  rsqrtImpl: qe,
+  scatterImpl: Es,
+  sigmoidImpl: Fs,
+  simpleAbsImpl: le,
+  sliceImpl: Ue,
+  sparseFillEmptyRowsImpl: Ns,
+  sparseReshapeImpl: Ss,
+  sparseSegmentReductionImpl: vs,
+  sqrtImpl: Ts,
+  squaredDifferenceImpl: Me,
+  staticRegexReplaceImpl: Oe,
+  stridedSliceImpl: qs,
+  stringNGramsImpl: Ms,
+  stringSplitImpl: Ls,
+  stringToHashBucketFastImpl: As,
+  subImpl: Le,
+  tileImpl: Ds,
+  topKImpl: Ws,
+  transposeImpl: Re,
+  uniqueImpl: $s
 }, Symbol.toStringTag, { value: "Module" }));
 /**
  * @license
@@ -2818,9 +3073,127 @@ const pn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
  * limitations under the License.
  * =============================================================================
  */
-const { logImpl: Tn, maxImpl: vn, transposeImpl: On } = pn;
+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 {
-  Tn as l,
-  vn as m,
-  On as t
+  uo as $,
+  ps as A,
+  Is as B,
+  ws as C,
+  bs as D,
+  Es as E,
+  Ns as F,
+  Ss as G,
+  vs 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,
+  no as R,
+  so as S,
+  eo as T,
+  oo as U,
+  Js 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,
+  fo as a2,
+  go as a3,
+  mo as a4,
+  po as a5,
+  Io as a6,
+  wo 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,
+  yo as ac,
+  ko as ad,
+  No as ae,
+  So as af,
+  vo 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,
+  z as e,
+  ks as f,
+  _n as g,
+  mt as h,
+  Et as i,
+  $n as j,
+  Vn as k,
+  lt as l,
+  Ko as m,
+  as as n,
+  Vs as o,
+  Hn as p,
+  Kn 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,
+  xt as z
 };