@genai-fi/nanogpt 0.8.0 → 0.8.2

package/dist/{shared-CkNorDcU.js → shared-V6D_md-c.js}

@@ -1,9 +1,9 @@
-import { n as Lt, bh as Ce, j as V, l as qt, a2 as H, bi as et, ad as ht, bj as dt, bk as at, a9 as De, aa as st, ao as We, b4 as $e, bl as Ue, bm as ze, bn as Be, bo as Pt, an as K, bp as At, bq as W, br as _t, bs as Vt, ag as Ct, bt as Dt, am as Wt, bu as $t, aY as Ut, aZ as zt, a$ as Bt, b0 as jt, ah as Gt, bv as Zt, b3 as Kt, bw as Ht, b1 as je, aq as Ge, bx as Xt, b7 as Ze, by as Ke, p as Yt, u as He, t as Xe, bz as Jt, bA as It, at as Qt, _ as Ye, bB as te, bC as ee, bD as ne, aO as pt, bE as se, bF as ot } from "./index-CUQrfsw_.js";
-import { f as it, m as kt, g as Je, a as Qe, R as tn, v as en, d as nn, e as sn, h as on, i as rn, j as an, k as ln, l as cn, n as un, o as hn, p as fn, q as Nt, r as dn, s as gn, t as mn } from "./backend_util-BJ-_jSeK.js";
-import { g as pn, a as wn, e as In, c as bn } from "./axis_util-DubwyOhW.js";
-import { b as xn } from "./broadcast_to-BYfCp5iL.js";
-import { r as En } from "./reshape-DEfQGSin.js";
-import { p as Fn, q as yn, r as kn, u as Nn } from "./selu_util-8vv5JxQV.js";
+import { n as Lt, bm as Ce, j as V, l as Pt, a3 as K, bn as et, ae as ht, bo as dt, bp as at, aa as De, ab as st, az as We, b8 as $e, bq as Ue, br as ze, bs as Be, bt as At, ap as H, bu as qt, bv as W, bw as _t, bx as Vt, ai as Ct, by as Dt, ao as Wt, bz as $t, aZ as Ut, a_ as zt, b0 as Bt, b1 as jt, aj as Gt, bA as Zt, b6 as Ht, bB as Kt, b3 as je, aA as Ge, b7 as Xt, bc as Ze, bC as He, p as Jt, u as Ke, t as Xe, bD as Qt, bE as It, ar as Yt, $ as Je, bF as te, ba as ee, bG as ne, aP as pt, bH as se, bI as ot } from "./index-DdmHGZjq.js";
+import { f as it, m as kt, g as Qe, a as Ye, R as tn, v as en, d as nn, e as sn, h as on, i as rn, j as an, k as ln, l as cn, n as un, o as hn, p as fn, q as Nt, r as dn, s as gn, t as mn } from "./backend_util-yC3YH1jo.js";
+import { g as pn, a as wn, e as In, c as bn } from "./axis_util-Did9235A.js";
+import { b as xn } from "./broadcast_to-CUvOdOT5.js";
+import { r as En } from "./reshape-WeJkT3ja.js";
+import { p as Fn, q as yn, r as kn, u as Nn } from "./selu_util-BgUO9gHY.js";
 import { g as vn } from "./_commonjsHelpers-ByX85dGu.js";
 function Sn(e, t) {
   for (var n = 0; n < t.length; n++) {
@@ -365,8 +365,8 @@ function Tn() {
       throw Error("interior hyphen");
     if (N === 0)
       return u(I.substring(1), c, E).neg();
-    for (var L = r(l(E, 8)), R = g, P = 0; P < I.length; P += 8) {
-      var U = Math.min(8, I.length - P), j = parseInt(I.substring(P, P + U), E);
+    for (var L = r(l(E, 8)), R = g, A = 0; A < I.length; A += 8) {
+      var U = Math.min(8, I.length - A), j = parseInt(I.substring(A, A + U), E);
       if (U < 8) {
         var C = r(l(E, U));
         R = R.mul(C).add(r(j));
@@ -412,13 +412,13 @@ function Tn() {
         return N.toString(c) + L.toInt().toString(c);
       } else
         return "-" + this.neg().toString(c);
-    for (var R = r(l(c, 6), this.unsigned), P = this, U = ""; ; ) {
-      var j = P.div(R), C = P.sub(j.mul(R)).toInt() >>> 0, q = C.toString(c);
-      if (P = j, P.isZero())
-        return q + U;
-      for (; q.length < 6; )
-        q = "0" + q;
-      U = "" + q + U;
+    for (var R = r(l(c, 6), this.unsigned), A = this, U = ""; ; ) {
+      var j = A.div(R), C = A.sub(j.mul(R)).toInt() >>> 0, P = C.toString(c);
+      if (A = j, A.isZero())
+        return P + U;
+      for (; P.length < 6; )
+        P = "0" + P;
+      U = "" + P + U;
     }
   }, x.getHighBits = function() {
     return this.high;
@@ -480,8 +480,8 @@ function Tn() {
     return !this.unsigned && this.eq(S) ? S : this.not().add(k);
   }, x.neg = x.negate, x.add = function(c) {
     n(c) || (c = h(c));
-    var E = this.high >>> 16, N = this.high & 65535, L = this.low >>> 16, R = this.low & 65535, P = c.high >>> 16, U = c.high & 65535, j = c.low >>> 16, C = c.low & 65535, q = 0, G = 0, _ = 0, B = 0;
-    return B += R + C, _ += B >>> 16, B &= 65535, _ += L + j, G += _ >>> 16, _ &= 65535, G += N + U, q += G >>> 16, G &= 65535, q += E + P, q &= 65535, i(_ << 16 | B, q << 16 | G, this.unsigned);
+    var E = this.high >>> 16, N = this.high & 65535, L = this.low >>> 16, R = this.low & 65535, A = c.high >>> 16, U = c.high & 65535, j = c.low >>> 16, C = c.low & 65535, P = 0, G = 0, _ = 0, B = 0;
+    return B += R + C, _ += B >>> 16, B &= 65535, _ += L + j, G += _ >>> 16, _ &= 65535, G += N + U, P += G >>> 16, G &= 65535, P += E + A, P &= 65535, i(_ << 16 | B, P << 16 | G, this.unsigned);
   }, x.subtract = function(c) {
     return n(c) || (c = h(c)), this.add(c.neg());
   }, x.sub = x.subtract, x.multiply = function(c) {
@@ -508,8 +508,8 @@ function Tn() {
       return this.mul(c.neg()).neg();
     if (this.lt(d) && c.lt(d))
       return r(this.toNumber() * c.toNumber(), this.unsigned);
-    var N = this.high >>> 16, L = this.high & 65535, R = this.low >>> 16, P = this.low & 65535, U = c.high >>> 16, j = c.high & 65535, C = c.low >>> 16, q = c.low & 65535, G = 0, _ = 0, B = 0, ct = 0;
-    return ct += P * q, B += ct >>> 16, ct &= 65535, B += R * q, _ += B >>> 16, B &= 65535, B += P * C, _ += B >>> 16, B &= 65535, _ += L * q, G += _ >>> 16, _ &= 65535, _ += R * C, G += _ >>> 16, _ &= 65535, _ += P * j, G += _ >>> 16, _ &= 65535, G += N * q + L * C + R * j + P * U, G &= 65535, i(B << 16 | ct, G << 16 | _, this.unsigned);
+    var N = this.high >>> 16, L = this.high & 65535, R = this.low >>> 16, A = this.low & 65535, U = c.high >>> 16, j = c.high & 65535, C = c.low >>> 16, P = c.low & 65535, G = 0, _ = 0, B = 0, ct = 0;
+    return ct += A * P, B += ct >>> 16, ct &= 65535, B += R * P, _ += B >>> 16, B &= 65535, B += A * C, _ += B >>> 16, B &= 65535, _ += L * P, G += _ >>> 16, _ &= 65535, _ += R * C, G += _ >>> 16, _ &= 65535, _ += A * j, G += _ >>> 16, _ &= 65535, G += N * P + L * C + R * j + A * U, G &= 65535, i(B << 16 | ct, G << 16 | _, this.unsigned);
   }, x.mul = x.multiply, x.divide = function(c) {
     if (n(c) || (c = h(c)), c.isZero())
       throw Error("division by zero");
@@ -539,8 +539,8 @@ function Tn() {
           return S;
         if (c.eq(S))
           return k;
-        var P = this.shr(1);
-        return N = P.div(c).shl(1), N.eq(g) ? c.isNegative() ? k : v : (L = this.sub(c.mul(N)), R = N.add(L.div(c)), R);
+        var A = this.shr(1);
+        return N = A.div(c).shl(1), N.eq(g) ? c.isNegative() ? k : v : (L = this.sub(c.mul(N)), R = N.add(L.div(c)), R);
       } else if (c.eq(S))
         return this.unsigned ? b : g;
       if (this.isNegative())
@@ -551,9 +551,9 @@ function Tn() {
     }
     for (L = this; L.gte(c); ) {
       N = Math.max(1, Math.floor(L.toNumber() / c.toNumber()));
-      for (var U = Math.ceil(Math.log(N) / Math.LN2), j = U <= 48 ? 1 : l(2, U - 48), C = r(N), q = C.mul(c); q.isNegative() || q.gt(L); )
-        N -= j, C = r(N, this.unsigned), q = C.mul(c);
-      C.isZero() && (C = k), R = R.add(C), L = L.sub(q);
+      for (var U = Math.ceil(Math.log(N) / Math.LN2), j = U <= 48 ? 1 : l(2, U - 48), C = r(N), P = C.mul(c); P.isNegative() || P.gt(L); )
+        N -= j, C = r(N, this.unsigned), P = C.mul(c);
+      C.isZero() && (C = k), R = R.add(C), L = L.sub(P);
     }
     return R;
   }, x.div = x.divide, x.modulo = function(c) {
@@ -661,7 +661,7 @@ const tt = (
 function gt(e) {
   return tt.fromString(e, !0, 16);
 }
-const ae = gt("c3a5c85c97cb3127"), Q = gt("b492b66fbe98f273"), D = gt("9ae16a3b2f90404f");
+const ae = gt("c3a5c85c97cb3127"), Y = gt("b492b66fbe98f273"), D = gt("9ae16a3b2f90404f");
 function bt(e) {
   return e.xor(e.shru(47));
 }
@@ -675,31 +675,31 @@ function T(e, t) {
 function St(e, t) {
   return ie(e, t, 4);
 }
-function A(e, t) {
+function q(e, t) {
   return t === 0 ? e : e.shru(t).or(e.shl(64 - t));
 }
-function Y(e, t, n = gt("9ddfea08eb382d69")) {
+function J(e, t, n = gt("9ddfea08eb382d69")) {
   let s = e.xor(t).mul(n);
   s = s.xor(s.shru(47));
   let o = t.xor(s).mul(n);
   return o = o.xor(o.shru(47)), o = o.mul(n), o;
 }
 function Mn(e, t, n, s, o, a) {
-  o = o.add(e), a = A(a.add(o).add(s), 21);
+  o = o.add(e), a = q(a.add(o).add(s), 21);
   const r = o;
-  return o = o.add(t), o = o.add(n), a = a.add(A(o, 44)), [o.add(s), a.add(r)];
+  return o = o.add(t), o = o.add(n), a = a.add(q(o, 44)), [o.add(s), a.add(r)];
 }
 function ut(e, t, n, s) {
   return Mn(T(e, t), T(e, t + 8), T(e, t + 16), T(e, t + 24), n, s);
 }
 function On(e, t = e.length) {
   if (t >= 8) {
-    const n = D.add(t * 2), s = T(e, 0).add(D), o = T(e, t - 8), a = A(o, 37).mul(n).add(s), r = A(s, 25).add(o).mul(n);
-    return Y(a, r, n);
+    const n = D.add(t * 2), s = T(e, 0).add(D), o = T(e, t - 8), a = q(o, 37).mul(n).add(s), r = q(s, 25).add(o).mul(n);
+    return J(a, r, n);
   }
   if (t >= 4) {
     const n = D.add(t * 2), s = St(e, 0);
-    return Y(s.shl(3).add(t), St(e, t - 4), n);
+    return J(s.shl(3).add(t), St(e, t - 4), n);
   }
   if (t > 0) {
     const n = e[0], s = e[t >> 1], o = e[t - 1], a = n + (s << 8), r = t + (o << 2);
@@ -708,28 +708,28 @@ function On(e, t = e.length) {
   return D;
 }
 function Ln(e, t = e.length) {
-  const n = D.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(D);
-  return Y(A(s.add(o), 43).add(A(a, 30)).add(r), s.add(A(o.add(D), 18)).add(a), n);
-}
-function qn(e, t = e.length) {
-  const n = D.add(t * 2), s = T(e, 0).mul(D), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(D), i = A(s.add(o), 43).add(A(a, 30)).add(r), l = Y(i, s.add(A(o.add(D), 18)).add(a), n), u = T(e, 16).mul(n), h = T(e, 24), f = i.add(T(e, t - 32)).mul(n), p = l.add(T(e, t - 24)).mul(n);
-  return Y(A(u.add(h), 43).add(A(f, 30)).add(p), u.add(A(h.add(s), 18)).add(f), n);
+  const n = D.add(t * 2), s = T(e, 0).mul(Y), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(D);
+  return J(q(s.add(o), 43).add(q(a, 30)).add(r), s.add(q(o.add(D), 18)).add(a), n);
 }
 function Pn(e, t = e.length) {
+  const n = D.add(t * 2), s = T(e, 0).mul(D), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(D), i = q(s.add(o), 43).add(q(a, 30)).add(r), l = J(i, s.add(q(o.add(D), 18)).add(a), n), u = T(e, 16).mul(n), h = T(e, 24), f = i.add(T(e, t - 32)).mul(n), p = l.add(T(e, t - 24)).mul(n);
+  return J(q(u.add(h), 43).add(q(f, 30)).add(p), u.add(q(h.add(s), 18)).add(f), n);
+}
+function An(e, t = e.length) {
   const n = tt.fromNumber(81, !0);
   if (t <= 32)
     return t <= 16 ? On(e, t) : Ln(e, t);
   if (t <= 64)
-    return qn(e, t);
-  let s = n, o = n.mul(Q).add(113), a = bt(o.mul(D).add(113)).mul(D), r = [tt.UZERO, tt.UZERO], i = [tt.UZERO, tt.UZERO];
+    return Pn(e, t);
+  let s = n, o = n.mul(Y).add(113), a = bt(o.mul(D).add(113)).mul(D), r = [tt.UZERO, tt.UZERO], i = [tt.UZERO, tt.UZERO];
   s = s.mul(D).add(T(e, 0));
   let l = 0;
   const u = (t - 1 >> 6) * 64, h = u + (t - 1 & 63) - 63;
   do
-    s = A(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(Q), o = A(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 = A(a.add(i[0]), 33).mul(Q), r = ut(e, l, r[1].mul(Q), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], l += 64;
+    s = q(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(Y), o = q(o.add(r[1]).add(T(e, l + 48)), 42).mul(Y), s = s.xor(i[1]), o = o.add(r[0]).add(T(e, l + 40)), a = q(a.add(i[0]), 33).mul(Y), r = ut(e, l, r[1].mul(Y), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], l += 64;
   while (l !== u);
-  const f = Q.add(a.and(255).shl(1));
-  return l = h, i[0] = i[0].add(t - 1 & 63), r[0] = r[0].add(i[0]), i[0] = i[0].add(r[0]), s = A(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(f), o = A(o.add(r[1]).add(T(e, l + 48)), 42).mul(f), s = s.xor(i[1].mul(9)), o = o.add(r[0].mul(9).add(T(e, l + 40))), a = A(a.add(i[0]), 33).mul(f), r = ut(e, l, r[1].mul(f), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], Y(Y(r[0], i[0], f).add(bt(o).mul(ae)).add(a), Y(r[1], i[1], f).add(s), f);
+  const f = Y.add(a.and(255).shl(1));
+  return l = h, i[0] = i[0].add(t - 1 & 63), r[0] = r[0].add(i[0]), i[0] = i[0].add(r[0]), s = q(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(f), o = q(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 = q(a.add(i[0]), 33).mul(f), r = ut(e, l, r[1].mul(f), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], J(J(r[0], i[0], f).add(bt(o).mul(ae)).add(a), J(r[1], i[1], f).add(s), f);
 }
 /**
  * @license
@@ -774,7 +774,7 @@ function le(e) {
     t[n] = Math.abs(e[n]);
   return t;
 }
-const An = (e) => {
+const qn = (e) => {
   const { x: t } = e.inputs, n = e.backend;
   nt(t, "abs");
   let s = new Float32Array(V(t.shape));
@@ -783,7 +783,7 @@ const An = (e) => {
 }, Xs = {
   kernelName: Ce,
   backendName: "cpu",
-  kernelFunc: An
+  kernelFunc: qn
 };
 /**
  * @license
@@ -803,7 +803,7 @@ const An = (e) => {
  */
 function $(e) {
   return (t, n, s, o, a) => {
-    const r = qt(t, n), i = r.length, l = H(r), u = V(r), h = et(a, u), f = t.length, p = n.length, w = H(t), m = H(n), F = ht(t, r), d = ht(n, r);
+    const r = Pt(t, n), i = r.length, l = K(r), u = V(r), h = et(a, u), f = t.length, p = n.length, w = K(t), m = K(n), F = ht(t, r), d = ht(n, r);
     if (F.length + d.length === 0)
       for (let g = 0; g < h.length; ++g)
         h[g] = e(s[g % s.length], o[g % o.length]);
@@ -842,7 +842,7 @@ function mt(e) {
     imag: n.makeTensorInfo(o.shape, "float32", r)
   }, i;
 }
-const Ys = {
+const Js = {
   kernelName: De,
   backendName: "cpu",
   kernelFunc: mt
@@ -891,7 +891,7 @@ 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 Js = {
+const Qs = {
   kernelName: We,
   backendName: "cpu",
   kernelFunc: Et
@@ -916,7 +916,7 @@ 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 Qs = {
+const Ys = {
   kernelName: $e,
   backendName: "cpu",
   kernelFunc: ce
@@ -1013,7 +1013,7 @@ function z(e, t, n, s) {
 }
 function Ft(e) {
   return (t, n, s, o, a, r) => {
-    const i = qt(t, n), l = V(i), u = i.length, h = H(i), f = et("float32", l), p = et("float32", l), w = ht(t, i), m = ht(n, i), F = kt(s, o), d = kt(a, r), g = t.length, b = H(t), k = n.length, y = H(n);
+    const i = Pt(t, n), l = V(i), u = i.length, h = K(i), f = et("float32", l), p = et("float32", l), w = ht(t, i), m = ht(n, i), F = kt(s, o), d = kt(a, r), g = t.length, b = K(t), k = n.length, y = K(n);
     if (w.length + m.length === 0)
       for (let v = 0; v < f.length; v++) {
         const M = v % F.length, O = v % d.length, S = e(F[M * 2], F[M * 2 + 1], d[O * 2], d[O * 2 + 1]);
@@ -1047,8 +1047,8 @@ function Ft(e) {
  * limitations under the License.
  * =============================================================================
  */
-const he = $((e, t) => e + t), _n = Ft((e, t, n, s) => ({ real: e + n, imag: t + s })), Vn = z(Pt, he, _n), eo = {
-  kernelName: Pt,
+const he = $((e, t) => e + t), _n = Ft((e, t, n, s) => ({ real: e + n, imag: t + s })), Vn = z(At, he, _n), eo = {
+  kernelName: At,
   backendName: "cpu",
   kernelFunc: Vn
 };
@@ -1079,7 +1079,7 @@ function Cn(e, t, n, s, o) {
   return r;
 }
 function Dn(e, t, n, s = !1) {
-  const o = e.shape[0], a = e.shape[1], r = K([o, n], t.dtype);
+  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);
@@ -1105,8 +1105,8 @@ function Dn(e, t, n, s = !1) {
  * limitations under the License.
  * =============================================================================
  */
-const fe = $((e, t) => e & t), Wn = z(At, fe), no = {
-  kernelName: At,
+const fe = $((e, t) => e & t), Wn = z(qt, fe), no = {
+  kernelName: qt,
   backendName: "cpu",
   kernelFunc: Wn
 };
@@ -1152,9 +1152,9 @@ function X(e) {
  */
 function de(e, t, n) {
   const s = X(t);
-  return J(e, s, n);
+  return Q(e, s, n);
 }
-function J(e, t, n) {
+function Q(e, t, n) {
   return ({ inputs: s, attrs: o, backend: a }) => {
     const { x: r } = s;
     nt(r, e);
@@ -1186,7 +1186,7 @@ function J(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const ge = X((e) => Math.ceil(e)), $n = J(_t, ge), so = {
+const ge = X((e) => Math.ceil(e)), $n = Q(_t, ge), so = {
   kernelName: _t,
   backendName: "cpu",
   kernelFunc: $n
@@ -1267,7 +1267,7 @@ const me = $((e, t) => e === t ? 1 : 0), zn = z(Vt, me, null, "bool"), oo = {
  * limitations under the License.
  * =============================================================================
  */
-const pe = X((e) => Math.exp(e)), Bn = J(Ct, pe, "float32"), ro = {
+const pe = X((e) => Math.exp(e)), Bn = Q(Ct, pe, "float32"), ro = {
   kernelName: Ct,
   backendName: "cpu",
   kernelFunc: Bn
@@ -1288,7 +1288,7 @@ const pe = X((e) => Math.exp(e)), Bn = J(Ct, pe, "float32"), ro = {
  * limitations under the License.
  * =============================================================================
  */
-const we = X((e) => Math.expm1(e)), jn = J(Dt, we), ao = {
+const we = X((e) => Math.expm1(e)), jn = Q(Dt, we), ao = {
   kernelName: Dt,
   backendName: "cpu",
   kernelFunc: jn
@@ -1309,7 +1309,7 @@ const we = X((e) => Math.expm1(e)), jn = J(Dt, we), ao = {
  * limitations under the License.
  * =============================================================================
  */
-const Ie = X((e) => Math.floor(e)), Gn = J(Wt, Ie), io = {
+const Ie = X((e) => Math.floor(e)), Gn = Q(Wt, Ie), io = {
   kernelName: Wt,
   backendName: "cpu",
   kernelFunc: Gn
@@ -1351,8 +1351,8 @@ const be = $((e, t) => Math.floor(e / t)), Zn = z($t, be, null, "int32"), lo = {
  * limitations under the License.
  * =============================================================================
  */
-function Kn(e, t, n, s, o, a, r, i, l) {
-  const u = K([s, a], n);
+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;
@@ -1383,8 +1383,8 @@ function Kn(e, t, n, s, o, a, r, i, l) {
  * limitations under the License.
  * =============================================================================
  */
-function Hn(e, t, n) {
-  const s = K(n, e.dtype);
+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];
@@ -1430,10 +1430,10 @@ const xe = $((e, t) => e > t ? 1 : 0), Xn = z(Ut, xe, null, "bool"), co = {
  * limitations under the License.
  * =============================================================================
  */
-const Ee = $((e, t) => e >= t ? 1 : 0), Yn = z(zt, Ee, null, "bool"), uo = {
+const Ee = $((e, t) => e >= t ? 1 : 0), Jn = z(zt, Ee, null, "bool"), uo = {
   kernelName: zt,
   backendName: "cpu",
-  kernelFunc: Yn
+  kernelFunc: Jn
 };
 /**
  * @license
@@ -1451,10 +1451,10 @@ const Ee = $((e, t) => e >= t ? 1 : 0), Yn = z(zt, Ee, null, "bool"), uo = {
  * limitations under the License.
  * =============================================================================
  */
-const Fe = $((e, t) => e < t ? 1 : 0), Jn = z(Bt, Fe, null, "bool"), ho = {
+const Fe = $((e, t) => e < t ? 1 : 0), Qn = z(Bt, Fe, null, "bool"), ho = {
   kernelName: Bt,
   backendName: "cpu",
-  kernelFunc: Jn
+  kernelFunc: Qn
 };
 /**
  * @license
@@ -1472,10 +1472,10 @@ const Fe = $((e, t) => e < t ? 1 : 0), Jn = z(Bt, Fe, null, "bool"), ho = {
  * limitations under the License.
  * =============================================================================
  */
-const ye = $((e, t) => e <= t ? 1 : 0), Qn = z(jt, ye, null, "bool"), fo = {
+const ye = $((e, t) => e <= t ? 1 : 0), Yn = z(jt, ye, null, "bool"), fo = {
   kernelName: jt,
   backendName: "cpu",
-  kernelFunc: Qn
+  kernelFunc: Yn
 };
 /**
  * @license
@@ -1516,7 +1516,7 @@ function ts(e, t, n) {
  * limitations under the License.
  * =============================================================================
  */
-const ke = X((e) => Math.log(e)), es = J(Gt, ke), go = {
+const ke = X((e) => Math.log(e)), es = Q(Gt, ke), go = {
   kernelName: Gt,
   backendName: "cpu",
   kernelFunc: es
@@ -1587,8 +1587,8 @@ const Ne = $((e, t) => Math.max(e, t)), ss = z(Zt, Ne), mo = {
  * limitations under the License.
  * =============================================================================
  */
-const ve = $((e, t) => Math.min(e, t)), os = z(Kt, ve), po = {
-  kernelName: Kt,
+const ve = $((e, t) => Math.min(e, t)), os = z(Ht, ve), po = {
+  kernelName: Ht,
   backendName: "cpu",
   kernelFunc: os
 };
@@ -1611,8 +1611,8 @@ const ve = $((e, t) => Math.min(e, t)), os = z(Kt, ve), po = {
 const yt = $((e, t) => e * t), rs = Ft((e, t, n, s) => ({
   real: e * n - t * s,
   imag: e * s + t * n
-})), as = z(Ht, yt, rs), wo = {
-  kernelName: Ht,
+})), as = z(Kt, yt, rs), wo = {
+  kernelName: Kt,
   backendName: "cpu",
   kernelFunc: as
 };
@@ -1685,7 +1685,7 @@ const Te = $((e, t) => e !== t ? 1 : 0), ls = z(Xt, Te, null, "bool"), bo = {
  * =============================================================================
  */
 function Re(e, t, n, s, o) {
-  const a = t.length, r = V(t), i = H(t), l = H(o), u = et(n, V(o));
+  const a = t.length, r = V(t), i = K(t), l = K(o), u = et(n, V(o));
   for (let h = 0; h < r; ++h) {
     const f = dt(h, a, i), p = new Array(f.length);
     for (let m = 0; m < p.length; m++)
@@ -1742,7 +1742,7 @@ const xo = {
  * =============================================================================
  */
 function Oe(e, t, n, s) {
-  const [o, a] = bn(e, s), r = He(t, "int32"), i = st(V(o), r), l = V(a);
+  const [o, a] = bn(e, s), r = Ke(t, "int32"), i = st(V(o), r), l = V(a);
   for (let u = 0; u < i.length; ++u) {
     const h = u * l;
     let f = 1;
@@ -1755,7 +1755,7 @@ function Oe(e, t, n, s) {
 function cs(e) {
   const { inputs: t, backend: n, attrs: s } = e, { x: o } = t, { axis: a, keepDims: r } = s;
   nt(o, "prod");
-  const i = o.shape.length, l = Yt(a, o.shape), u = pn(l, i);
+  const i = o.shape.length, l = Jt(a, o.shape), u = pn(l, i);
   let h = l, f = o;
   const p = [];
   u != null && (f = Me({ inputs: { x: o }, backend: n, attrs: { perm: u } }), p.push(f), h = wn(h.length, i));
@@ -1764,7 +1764,7 @@ function cs(e) {
   return r && (g = In(F, l)), p.forEach((b) => n.disposeIntermediateTensorInfo(b)), n.makeTensorInfo(g, d, m);
 }
 const Eo = {
-  kernelName: Ke,
+  kernelName: He,
   backendName: "cpu",
   kernelFunc: cs
 };
@@ -1787,7 +1787,7 @@ const Eo = {
 function us(e, t, n) {
   e.forEach((s, o) => {
     if (s < 0 || s >= n) {
-      const a = dt(o, t.length, H(t)).join(",");
+      const a = dt(o, t.length, K(t)).join(",");
       throw new Error(`indices[${a}] = ${s} is not in [0, ${n})`);
     }
   });
@@ -1948,7 +1948,7 @@ function ws(e, t, n, s, o, a, r) {
 var Z = tn;
 class ft {
   constructor(t, n, s, o, a, r, i, l, u, h) {
-    this.shape = t, this.shapeShape = n, this.values = s, this.valuesShape = o, this.valuesDType = a, this.defaultValue = r, this.defaultValueShape = i, this.rowPartitionValues = l, this.rowPartitionValuesShapes = u, this.rowPartitionTypes = Je(h), this.raggedRank = Qe(this.rowPartitionTypes);
+    this.shape = t, this.shapeShape = n, this.values = s, this.valuesShape = o, this.valuesDType = a, this.defaultValue = r, this.defaultValueShape = i, this.rowPartitionValues = l, this.rowPartitionValuesShapes = u, this.rowPartitionTypes = Qe(h), this.raggedRank = Ye(this.rowPartitionTypes);
   }
   getRowPartitionTypeByDimension(t) {
     return this.rowPartitionTypes[0] === Z.FIRST_DIM_SIZE ? this.rowPartitionTypes[t + 1] : this.rowPartitionTypes[t];
@@ -2236,8 +2236,8 @@ function bs(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-const Le = X((e) => 1 / Math.sqrt(e)), xs = J(Jt, Le), Fo = {
-  kernelName: Jt,
+const Le = X((e) => 1 / Math.sqrt(e)), xs = Q(Qt, Le), Fo = {
+  kernelName: Qt,
   backendName: "cpu",
   kernelFunc: xs
 };
@@ -2260,8 +2260,8 @@ const Le = X((e) => 1 / Math.sqrt(e)), xs = J(Jt, Le), Fo = {
 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 K(n, t.dtype);
-  const w = l instanceof It ? l : K(h, t.dtype);
+    return H(n, t.dtype);
+  const w = l instanceof It ? l : H(h, t.dtype);
   typeof l == "string" || typeof l == "number" ? w.values.fill(l) : typeof l == "boolean" && w.values.fill(+l);
   for (let m = 0; m < a; m++) {
     const F = [];
@@ -2293,8 +2293,8 @@ function Es(e, t, n, s, o, a, r, i, l, u) {
  * limitations under the License.
  * =============================================================================
  */
-const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = de(Qt, (e) => 1 / (1 + Math.exp(-e))), yo = {
-  kernelName: Qt,
+const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = de(Yt, (e) => 1 / (1 + Math.exp(-e))), yo = {
+  kernelName: Yt,
   backendName: "cpu",
   kernelFunc: ys
 };
@@ -2314,13 +2314,13 @@ const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = de(Qt, (e) => 1 / (1 + Math.ex
  * limitations under the License.
  * =============================================================================
  */
-function qe(e, t, n, s, o) {
-  const a = kn(s, t, n), r = V(n), i = H(s);
+function Pe(e, t, n, s, o) {
+  const a = kn(s, t, n), r = V(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 = K(s, o, l), h = K(n, o);
+  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), w = p.map((m, F) => m + t[F]);
     h.set(u.get(...w), ...p);
@@ -2332,11 +2332,11 @@ function ks(e) {
   nt(o, "slice");
   const [i, l] = Fn(o, a, r);
   yn(o, i, l);
-  const u = n.data.get(o.dataId).values, h = qe(u, i, l, o.shape, o.dtype);
+  const u = n.data.get(o.dataId).values, h = Pe(u, i, l, o.shape, o.dtype);
   return n.makeTensorInfo(l, o.dtype, h);
 }
 const ko = {
-  kernelName: Ye,
+  kernelName: Je,
   backendName: "cpu",
   kernelFunc: ks
 };
@@ -2578,10 +2578,10 @@ const Ts = X((e) => Math.sqrt(e)), Rs = de(te, (e) => Math.sqrt(e)), No = {
  * limitations under the License.
  * =============================================================================
  */
-const Pe = $((e, t) => {
+const Ae = $((e, t) => {
   const n = e - t;
   return n * n;
-}), Ms = z(ee, Pe), vo = {
+}), Ms = z(ee, Ae), vo = {
   kernelName: ee,
   backendName: "cpu",
   kernelFunc: Ms
@@ -2602,10 +2602,10 @@ const Pe = $((e, t) => {
  * limitations under the License.
  * =============================================================================
  */
-const Ae = X((e, t) => {
+const qe = X((e, t) => {
   const { pattern: n, replaceGlobal: s, rewrite: o } = t;
   return e.replace(new RegExp(n, s ? "g" : ""), o);
-}), Os = J(ne, Ae), So = {
+}), Os = Q(ne, qe), So = {
   kernelName: ne,
   backendName: "cpu",
   kernelFunc: Os
@@ -2627,7 +2627,7 @@ const Ae = X((e, t) => {
  * =============================================================================
  */
 function Ls(e, t, n, s) {
-  const o = K(e, t.dtype);
+  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++)
@@ -2652,7 +2652,7 @@ function Ls(e, t, n, s) {
  * limitations under the License.
  * =============================================================================
  */
-class qs {
+class Ps {
   constructor(t, n, s, o, a, r) {
     this.separator = pt(t), this.nGramWidths = n, this.leftPad = pt(s), this.rightPad = pt(o), this.padWidth = a, this.preserveShort = r;
   }
@@ -2742,8 +2742,8 @@ class qs {
     return [i, r];
   }
 }
-function Ps(e, t, n, s, o, a, r, i) {
-  return new qs(n, s, o, a, r, i).compute(e, t);
+function As(e, t, n, s, o, a, r, i) {
+  return new Ps(n, s, o, a, r, i).compute(e, t);
 }
 /**
  * @license
@@ -2761,7 +2761,7 @@ function Ps(e, t, n, s, o, a, r, i) {
  * limitations under the License.
  * =============================================================================
  */
-function As(e, t, n, s) {
+function qs(e, t, n, s) {
   if (!e.length)
     return;
   if (t.length === 0) {
@@ -2792,7 +2792,7 @@ function _s(e, t, n) {
   const i = new Array(s);
   for (let p = 0; p < s; ++p) {
     const w = o.length;
-    As(e[p], t, n, o);
+    qs(e[p], t, n, o);
     const m = o.length - w;
     i[p] = m, a += m, r = Math.max(r, m);
   }
@@ -2822,7 +2822,7 @@ function _s(e, t, n) {
 function Vs(e, t) {
   const n = W("int32", e.length);
   for (let s = 0; s < e.length; ++s)
-    n[s] = Pn(e[s]).modulo(t).getLowBitsUnsigned();
+    n[s] = An(e[s]).modulo(t).getLowBitsUnsigned();
   return n;
 }
 /**
@@ -2866,7 +2866,7 @@ function Ws(e, t) {
   const n = new Array(e.rank);
   for (let o = 0; o < n.length; o++)
     n[o] = e.shape[o] * t[o];
-  const s = K(n, e.dtype);
+  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++)
@@ -2925,8 +2925,8 @@ function $s(e, t, n, s, o) {
   }
   const h = t.slice();
   return h[h.length - 1] = s, [
-    K(h, n, l),
-    K(h, "int32", u)
+    H(h, n, l),
+    H(h, "int32", u)
   ];
 }
 /**
@@ -2946,7 +2946,7 @@ function $s(e, t, n, s, o) {
  * =============================================================================
  */
 function Us(e, t, n, s) {
-  const o = Yt(t, n)[0], a = [1, n[0], 1];
+  const o = Jt(t, n)[0], a = [1, n[0], 1];
   for (let m = 0; m < o; m++)
     a[0] *= n[m];
   a[1] = n[o];
@@ -3017,8 +3017,8 @@ const Ro = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   expm1Impl: we,
   floorDivImpl: be,
   floorImpl: Ie,
-  gatherNdImpl: Kn,
-  gatherV2Impl: Hn,
+  gatherNdImpl: Hn,
+  gatherV2Impl: Kn,
   greaterEqualImpl: Ee,
   greaterImpl: xe,
   lessEqualImpl: ye,
@@ -3040,15 +3040,15 @@ const Ro = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   scatterImpl: Es,
   sigmoidImpl: Fs,
   simpleAbsImpl: le,
-  sliceImpl: qe,
+  sliceImpl: Pe,
   sparseFillEmptyRowsImpl: Ns,
   sparseReshapeImpl: vs,
   sparseSegmentReductionImpl: Ss,
   sqrtImpl: Ts,
-  squaredDifferenceImpl: Pe,
-  staticRegexReplaceImpl: Ae,
+  squaredDifferenceImpl: Ae,
+  staticRegexReplaceImpl: qe,
   stridedSliceImpl: Ls,
-  stringNGramsImpl: Ps,
+  stringNGramsImpl: As,
   stringSplitImpl: _s,
   stringToHashBucketFastImpl: Vs,
   subImpl: _e,
@@ -3067,7 +3067,7 @@ export {
   vs as F,
   Ss as G,
   Ls as H,
-  Ps as I,
+  As as I,
   _s as J,
   Vs as K,
   Ws as L,
@@ -3079,7 +3079,7 @@ export {
   no as R,
   to as S,
   so as T,
-  Ys as U,
+  Js as U,
   oo as V,
   ro as W,
   ao as X,
@@ -3087,7 +3087,7 @@ export {
   lo as Z,
   co as _,
   nt as a,
-  Js as a0,
+  Qs as a0,
   ho as a1,
   fo as a2,
   go as a3,
@@ -3097,7 +3097,7 @@ export {
   Io as a7,
   bo as a8,
   Eo as a9,
-  Qs as aa,
+  Ys as aa,
   Fo as ab,
   yo as ac,
   ko as ad,
@@ -3119,8 +3119,8 @@ export {
   lt as l,
   as as m,
   Ds as n,
-  Kn as o,
-  Hn as p,
+  Hn as o,
+  Kn as p,
   ts as q,
   ce as r,
   Ro as s,