@genai-fi/nanogpt 0.10.3 → 0.12.0

package/dist/{shared-dntlHIDQ.js → shared-nnSWpC3u.js}

@@ -1,10 +1,10 @@
-import { l as Lt, bR as Ce, h as V, a3 as Pt, ad as K, i as et, o as ht, bS as dt, bT as at, ac as De, Z as st, aQ as We, ar as Ue, bU as $e, bV as ze, bW as Be, bX as qt, at as H, bY as At, bZ as W, b_ as _t, bC as Vt, an as Ct, b$ as Dt, J as Wt, c0 as Ut, b1 as $t, b2 as zt, b3 as Bt, b4 as jt, ao as Gt, c1 as Zt, b8 as Ht, c2 as Kt, aq as je, aR as Ge, b9 as Xt, as as Ze, c3 as He, af as Jt, ak as Ke, t as Xe, bM as Qt, c4 as It, aH as Yt, S as Je, c5 as te, bb as ee, c6 as ne, aB as pt, c7 as se, c8 as ot } from "./index-DOvlwCh-.js";
-import { f as it, 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, m as un, n as hn, o as fn, p as kt, q as dn, r as gn, s as mn } from "./backend_util-RCe-rHaj.js";
+import { x as Lt, bR as Ce, U as V, _ as Pt, a8 as K, ae as et, ac as ht, bS as dt, bT as at, a7 as De, Q as st, aQ as Ue, ar as We, bU as $e, bV as ze, bW as Be, bX as qt, at as H, bY as At, bZ as U, b_ as _t, bC as Vt, an as Ct, b$ as Dt, F as Ut, c0 as Wt, b1 as $t, b2 as zt, b3 as Bt, b4 as jt, ao as Gt, c1 as Zt, b8 as Ht, c2 as Kt, aq as je, aR as Ge, b9 as Xt, as as Ze, c3 as He, af as Qt, ak as Ke, t as Xe, bM as Yt, c4 as It, aH as Jt, S as Qe, c5 as te, bb as ee, c6 as ne, aB as pt, c7 as se, c8 as ot } from "./index-Duu1Lvvv.js";
+import { f as it, g as Ye, a as Je, 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, m as un, n as hn, o as fn, p as kt, q as dn, r as gn, s as mn } from "./backend_util-DC3rBo_H.js";
 import { m as Nt } from "./complex_util-Yc1A_gV1.js";
-import { a as pn, b as wn, e as In, c as bn } from "./axis_util-BaG7mf5A.js";
-import { b as xn } from "./broadcast_to-B3eYlZm7.js";
-import { r as En } from "./reshape-ByE68wS9.js";
-import { p as Fn, a as yn, i as kn, c as Nn } from "./slice_util-uTKwiEpW.js";
+import { a as pn, b as wn, e as In, c as bn } from "./axis_util-DGqbT-FX.js";
+import { b as xn } from "./broadcast_to-D1Dmg2Oz.js";
+import { r as En } from "./reshape-BI0yzp1T.js";
+import { p as Fn, a as yn, i as kn, c as Nn } from "./slice_util-zN8KFC5I.js";
 import { g as vn } from "./_commonjsHelpers-ByX85dGu.js";
 function Sn(e, t) {
   for (var n = 0; n < t.length; n++) {
@@ -646,7 +646,7 @@ const tt = (
 function gt(e) {
   return tt.fromString(e, !0, 16);
 }
-const ae = gt("c3a5c85c97cb3127"), Y = gt("b492b66fbe98f273"), D = gt("9ae16a3b2f90404f");
+const ae = gt("c3a5c85c97cb3127"), J = gt("b492b66fbe98f273"), D = gt("9ae16a3b2f90404f");
 function bt(e) {
   return e.xor(e.shru(47));
 }
@@ -663,7 +663,7 @@ function St(e, t) {
 function A(e, t) {
   return t === 0 ? e : e.shru(t).or(e.shl(64 - t));
 }
-function J(e, t, n = gt("9ddfea08eb382d69")) {
+function Q(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);
@@ -680,11 +680,11 @@ function ut(e, t, 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 J(a, r, n);
+    return Q(a, r, n);
   }
   if (t >= 4) {
     const n = D.add(t * 2), s = St(e, 0);
-    return J(s.shl(3).add(t), St(e, t - 4), n);
+    return Q(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);
@@ -693,12 +693,12 @@ 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(Y), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(D);
-  return J(A(s.add(o), 43).add(A(a, 30)).add(r), s.add(A(o.add(D), 18)).add(a), n);
+  const n = D.add(t * 2), s = T(e, 0).mul(J), o = T(e, 8), a = T(e, t - 8).mul(n), r = T(e, t - 16).mul(D);
+  return Q(A(s.add(o), 43).add(A(a, 30)).add(r), s.add(A(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 = A(s.add(o), 43).add(A(a, 30)).add(r), l = J(i, s.add(A(o.add(D), 18)).add(a), n), u = T(e, 16).mul(n), h = T(e, 24), f = i.add(T(e, t - 32)).mul(n), p = l.add(T(e, t - 24)).mul(n);
-  return J(A(u.add(h), 43).add(A(f, 30)).add(p), u.add(A(h.add(s), 18)).add(f), n);
+  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 = Q(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 Q(A(u.add(h), 43).add(A(f, 30)).add(p), u.add(A(h.add(s), 18)).add(f), n);
 }
 function qn(e, t = e.length) {
   const n = tt.fromNumber(81, !0);
@@ -706,15 +706,15 @@ function qn(e, t = e.length) {
     return t <= 16 ? On(e, t) : Ln(e, t);
   if (t <= 64)
     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];
+  let s = n, o = n.mul(J).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(Y), o = A(o.add(r[1]).add(T(e, l + 48)), 42).mul(Y), s = s.xor(i[1]), o = o.add(r[0]).add(T(e, l + 40)), a = A(a.add(i[0]), 33).mul(Y), r = ut(e, l, r[1].mul(Y), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], l += 64;
+    s = A(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(J), o = A(o.add(r[1]).add(T(e, l + 48)), 42).mul(J), s = s.xor(i[1]), o = o.add(r[0]).add(T(e, l + 40)), a = A(a.add(i[0]), 33).mul(J), r = ut(e, l, r[1].mul(J), 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 = Y.add(a.and(255).shl(1));
-  return l = h, i[0] = i[0].add(t - 1 & 63), r[0] = r[0].add(i[0]), i[0] = i[0].add(r[0]), s = A(s.add(o).add(r[0]).add(T(e, l + 8)), 37).mul(f), o = A(o.add(r[1]).add(T(e, l + 48)), 42).mul(f), s = s.xor(i[1].mul(9)), o = o.add(r[0].mul(9).add(T(e, l + 40))), a = A(a.add(i[0]), 33).mul(f), r = ut(e, l, r[1].mul(f), s.add(i[0])), i = ut(e, l + 32, a.add(i[1]), o.add(T(e, l + 16))), [a, s] = [s, a], J(J(r[0], i[0], f).add(bt(o).mul(ae)).add(a), J(r[1], i[1], f).add(s), f);
+  const f = J.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], Q(Q(r[0], i[0], f).add(bt(o).mul(ae)).add(a), Q(r[1], i[1], f).add(s), f);
 }
 function nt(e, t) {
   Array.isArray(e) || (e = [e]), e.forEach((n) => {
@@ -733,12 +733,12 @@ const An = (e) => {
   let s = new Float32Array(V(t.shape));
   const o = n.data.get(t.dataId).values;
   return s = le(o), n.makeOutput(s, t.shape, t.dtype);
-}, Js = {
+}, Qs = {
   kernelName: Ce,
   backendName: "cpu",
   kernelFunc: An
 };
-function U(e) {
+function W(e) {
   return (t, n, s, o, a) => {
     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)
@@ -763,7 +763,7 @@ function mt(e) {
     imag: n.makeTensorInfo(o.shape, "float32", r)
   }, i;
 }
-const Qs = {
+const Ys = {
   kernelName: De,
   backendName: "cpu",
   kernelFunc: mt
@@ -780,8 +780,8 @@ 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 Ys = {
-  kernelName: We,
+const Js = {
+  kernelName: Ue,
   backendName: "cpu",
   kernelFunc: Et
 };
@@ -790,7 +790,7 @@ function ce(e) {
   return n.makeTensorInfo(o.shape, o.dtype, a);
 }
 const to = {
-  kernelName: Ue,
+  kernelName: We,
   backendName: "cpu",
   kernelFunc: ce
 };
@@ -800,7 +800,7 @@ function ue(e, t, n, s) {
     return [t, "int32", o];
   }
   if (s === "bool") {
-    const o = Be([0], n), [a, r] = U((i, l) => i !== l ? 1 : 0)(t, [], e, o, "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 ${s}`);
@@ -872,7 +872,7 @@ function Ft(e) {
     return [f, p, i];
   };
 }
-const he = U(((e, t) => e + t)), _n = Ft(((e, t, n, s) => ({ real: e + n, imag: t + s }))), Vn = z(qt, he, _n), no = {
+const he = W(((e, t) => e + t)), _n = Ft(((e, t, n, s) => ({ real: e + n, imag: t + s }))), Vn = z(qt, he, _n), no = {
   kernelName: qt,
   backendName: "cpu",
   kernelFunc: Vn
@@ -898,14 +898,14 @@ function Dn(e, t, n, s = !1) {
     }
   return r;
 }
-const fe = U(((e, t) => e & t)), Wn = z(At, fe), so = {
+const fe = W(((e, t) => e & t)), Un = z(At, fe), so = {
   kernelName: At,
   backendName: "cpu",
-  kernelFunc: Wn
+  kernelFunc: Un
 };
 function X(e) {
   return (t, n, s) => {
-    const o = W(n, t.length);
+    const o = U(n, t.length);
     for (let a = 0; a < t.length; ++a)
       o[a] = e(t[a], s);
     return o;
@@ -913,9 +913,9 @@ function X(e) {
 }
 function de(e, t, n) {
   const s = X(t);
-  return Q(e, s, n);
+  return Y(e, s, n);
 }
-function Q(e, t, n) {
+function Y(e, t, n) {
   return ({ inputs: s, attrs: o, backend: a }) => {
     const { x: r } = s;
     nt(r, e);
@@ -931,13 +931,13 @@ function Q(e, t, n) {
     return i.makeTensorInfo(r.shape, h, f);
   };
 }
-const ge = X((e) => Math.ceil(e)), Un = Q(_t, ge), oo = {
+const ge = X((e) => Math.ceil(e)), Wn = Y(_t, ge), oo = {
   kernelName: _t,
   backendName: "cpu",
-  kernelFunc: Un
+  kernelFunc: Wn
 };
 function $n(e, t, n, s) {
-  const o = W(n, V(t));
+  const o = U(n, V(t));
   if (s && n !== "string") {
     let a = 0;
     e.forEach((r) => {
@@ -959,28 +959,28 @@ function $n(e, t, n, s) {
   }
   return o;
 }
-const me = U((e, t) => e === t ? 1 : 0), zn = z(Vt, me, null, "bool"), ro = {
+const me = W((e, t) => e === t ? 1 : 0), zn = z(Vt, me, null, "bool"), ro = {
   kernelName: Vt,
   backendName: "cpu",
   kernelFunc: zn
 };
-const pe = X((e) => Math.exp(e)), Bn = Q(Ct, pe, "float32"), ao = {
+const pe = X((e) => Math.exp(e)), Bn = Y(Ct, pe, "float32"), ao = {
   kernelName: Ct,
   backendName: "cpu",
   kernelFunc: Bn
 };
-const we = X((e) => Math.expm1(e)), jn = Q(Dt, we), io = {
+const we = X((e) => Math.expm1(e)), jn = Y(Dt, we), io = {
   kernelName: Dt,
   backendName: "cpu",
   kernelFunc: jn
 };
-const Ie = X((e) => Math.floor(e)), Gn = Q(Wt, Ie), lo = {
-  kernelName: Wt,
+const Ie = X((e) => Math.floor(e)), Gn = Y(Ut, Ie), lo = {
+  kernelName: Ut,
   backendName: "cpu",
   kernelFunc: Gn
 };
-const be = U((e, t) => Math.floor(e / t)), Zn = z(Ut, be, null, "int32"), co = {
-  kernelName: Ut,
+const be = W((e, t) => Math.floor(e / t)), Zn = z(Wt, be, null, "int32"), co = {
+  kernelName: Wt,
   backendName: "cpu",
   kernelFunc: Zn
 };
@@ -1010,25 +1010,25 @@ function Kn(e, t, n) {
   }
   return s;
 }
-const xe = U((e, t) => e > t ? 1 : 0), Xn = z($t, xe, null, "bool"), uo = {
+const xe = W((e, t) => e > t ? 1 : 0), Xn = z($t, xe, null, "bool"), uo = {
   kernelName: $t,
   backendName: "cpu",
   kernelFunc: Xn
 };
-const Ee = U((e, t) => e >= t ? 1 : 0), Jn = z(zt, Ee, null, "bool"), ho = {
+const Ee = W((e, t) => e >= t ? 1 : 0), Qn = z(zt, Ee, null, "bool"), ho = {
   kernelName: zt,
   backendName: "cpu",
-  kernelFunc: Jn
+  kernelFunc: Qn
 };
-const Fe = U((e, t) => e < t ? 1 : 0), Qn = z(Bt, Fe, null, "bool"), fo = {
+const Fe = W((e, t) => e < t ? 1 : 0), Yn = z(Bt, Fe, null, "bool"), fo = {
   kernelName: Bt,
   backendName: "cpu",
-  kernelFunc: Qn
+  kernelFunc: Yn
 };
-const ye = U((e, t) => e <= t ? 1 : 0), Yn = z(jt, ye, null, "bool"), go = {
+const ye = W((e, t) => e <= t ? 1 : 0), Jn = z(jt, ye, null, "bool"), go = {
   kernelName: jt,
   backendName: "cpu",
-  kernelFunc: Yn
+  kernelFunc: Jn
 };
 function ts(e, t, n) {
   const s = (t - e) / (n - 1), o = st(n, "float32");
@@ -1037,7 +1037,7 @@ function ts(e, t, n) {
     o[a] = o[a - 1] + s;
   return o;
 }
-const ke = X((e) => Math.log(e)), es = Q(Gt, ke), mo = {
+const ke = X((e) => Math.log(e)), es = Y(Gt, ke), mo = {
   kernelName: Gt,
   backendName: "cpu",
   kernelFunc: es
@@ -1055,17 +1055,17 @@ function ns(e, t, n, s) {
   }
   return o;
 }
-const Ne = U(((e, t) => Math.max(e, t))), ss = z(Zt, Ne), po = {
+const Ne = W(((e, t) => Math.max(e, t))), ss = z(Zt, Ne), po = {
   kernelName: Zt,
   backendName: "cpu",
   kernelFunc: ss
 };
-const ve = U(((e, t) => Math.min(e, t))), os = z(Ht, ve), wo = {
+const ve = W(((e, t) => Math.min(e, t))), os = z(Ht, ve), wo = {
   kernelName: Ht,
   backendName: "cpu",
   kernelFunc: os
 };
-const yt = U(((e, t) => e * t)), rs = Ft(((e, t, n, s) => ({
+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), Io = {
@@ -1088,7 +1088,7 @@ const bo = {
   backendName: "cpu",
   kernelFunc: is
 };
-const Te = U(((e, t) => e !== t ? 1 : 0)), ls = z(Xt, Te, null, "bool"), xo = {
+const Te = W(((e, t) => e !== t ? 1 : 0)), ls = z(Xt, Te, null, "bool"), xo = {
   kernelName: Xt,
   backendName: "cpu",
   kernelFunc: ls
@@ -1132,7 +1132,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 = Jt(a, o.shape), u = pn(l, i);
+  const i = o.shape.length, l = Qt(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));
@@ -1197,7 +1197,7 @@ function fs(e, t, n, s) {
 function ds(e) {
   const t = [];
   for (let n = 0; n < e.length; ++n) {
-    const s = e[n].length, o = W("int32", s);
+    const s = e[n].length, o = U("int32", s);
     t.push(o), e[n].forEach((a, r) => o[r] = a);
   }
   return t;
@@ -1223,7 +1223,7 @@ function gs(e, t, n, s, o, a) {
 function ms(e, t, n, s, o) {
   const a = t.slice();
   a[0] = o;
-  const r = W(n, V(a)), i = e.length, l = i === 0 ? 0 : i / t[0];
+  const r = U(n, V(a)), i = e.length, l = i === 0 ? 0 : i / t[0];
   return gs(e, t, s, l, r, a), [r, a];
 }
 function ps(e, t, n, s, o, a, r, i) {
@@ -1250,7 +1250,7 @@ function ws(e, t, n, s, o, a, r) {
   for (let d = 1; d < h.length; ++d)
     if (h[d] !== h[d - 1])
       throw new Error("starts, limits, and deltas must have the same shape");
-  const f = h.length === 0 ? 1 : h[0], p = W("int32", f + 1);
+  const f = h.length === 0 ? 1 : h[0], p = U("int32", f + 1);
   p[0] = 0;
   for (let d = 0; d < f; ++d) {
     const g = i ? e[0] : e[d], b = l ? s[0] : s[d], k = u ? a[0] : a[d];
@@ -1263,7 +1263,7 @@ function ws(e, t, n, s, o, a, r) {
       throw new Error(`Requires ((limit - start) / delta) <= ${Rt}`);
     p[d + 1] = p[d] + y;
   }
-  const w = p[f], m = W(n, w);
+  const w = p[f], m = U(n, w);
   let F = 0;
   for (let d = 0; d < f; ++d) {
     const g = p[d + 1] - p[d];
@@ -1277,7 +1277,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 = Qe(h), this.raggedRank = Ye(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 = Ye(h), this.raggedRank = Je(this.rowPartitionTypes);
   }
   getRowPartitionTypeByDimension(t) {
     return this.rowPartitionTypes[0] === Z.FIRST_DIM_SIZE ? this.rowPartitionTypes[t + 1] : this.rowPartitionTypes[t];
@@ -1451,7 +1451,7 @@ class ft {
     o[o.length - 1] = 1;
     for (let l = o.length - 2; l >= 0; --l)
       o[l] = o[l + 1] * s[l + 1];
-    const a = Ot(s, !1), r = W(this.valuesDType, V(a));
+    const a = Ot(s, !1), r = U(this.valuesDType, V(a));
     if (o[0] * s[0] > 0) {
       let l = this.calculateFirstParentOutputIndex(n, o[0], s[0]);
       for (let u = 1; u <= this.raggedRank; ++u)
@@ -1533,8 +1533,8 @@ function bs(e, t, n, s) {
     l[u] = l[u - 1] + n;
   return l;
 }
-const Le = X((e) => 1 / Math.sqrt(e)), xs = Q(Qt, Le), yo = {
-  kernelName: Qt,
+const Le = X((e) => 1 / Math.sqrt(e)), xs = Y(Yt, Le), yo = {
+  kernelName: Yt,
   backendName: "cpu",
   kernelFunc: xs
 };
@@ -1558,8 +1558,8 @@ function Es(e, t, n, s, o, a, r, i, l, u) {
   }
   return w;
 }
-const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = de(Yt, (e) => 1 / (1 + Math.exp(-e))), ko = {
-  kernelName: Yt,
+const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = de(Jt, (e) => 1 / (1 + Math.exp(-e))), ko = {
+  kernelName: Jt,
   backendName: "cpu",
   kernelFunc: ys
 };
@@ -1585,7 +1585,7 @@ function ks(e) {
   return n.makeTensorInfo(l, o.dtype, h);
 }
 const No = {
-  kernelName: Je,
+  kernelName: Qe,
   backendName: "cpu",
   kernelFunc: ks
 };
@@ -1594,7 +1594,7 @@ function Ns(e, t, n, s, o, a, r) {
   if (l === 0) {
     if (i !== 0)
       throw new Error(on(i));
-    const d = W(n, 0), g = W(o, 0);
+    const d = U(n, 0), g = U(o, 0);
     return [
       d,
       [0, f],
@@ -1630,7 +1630,7 @@ function Ns(e, t, n, s, o, a, r) {
       h
     ];
   } else {
-    const d = m[l - 1], g = W(n, d * f), b = W(o, d), k = new Array(l).fill(0);
+    const d = m[l - 1], g = U(n, d * f), b = U(o, d), k = new Array(l).fill(0);
     for (let y = 0; y < i; ++y) {
       const v = e[y * f], M = k[v], O = (v === 0 ? 0 : m[v - 1]) + M;
       k[v]++;
@@ -1692,7 +1692,7 @@ function vs(e, t, n, s, o) {
     for (let d = i - 2; d >= 0; --d)
       m[d] = m[d + 1] * l[d + 1];
   }
-  const F = W(n, r * i);
+  const F = U(n, r * i);
   for (let d = 0; d < r; ++d) {
     let g = 0;
     for (let b = 0; b < p; ++b)
@@ -1708,7 +1708,7 @@ function Ss(e, t, n, s, o, a = !1, r = 0) {
     throw new Error(kt());
   const p = t.slice();
   p[0] = f;
-  const w = p.reduce((k, y) => k * y, 1), m = W(n, w);
+  const w = p.reduce((k, y) => k * y, 1), m = U(n, w);
   if (i === 0)
     return f > 0 && m.fill(r), [m, p];
   if (f <= 0)
@@ -1747,7 +1747,7 @@ const Ts = X((e) => Math.sqrt(e)), Rs = de(te, (e) => Math.sqrt(e)), vo = {
   backendName: "cpu",
   kernelFunc: Rs
 };
-const qe = U(((e, t) => {
+const qe = W(((e, t) => {
   const n = e - t;
   return n * n;
 })), Ms = z(ee, qe), So = {
@@ -1758,7 +1758,7 @@ const qe = U(((e, t) => {
 const Ae = X((e, t) => {
   const { pattern: n, replaceGlobal: s, rewrite: o } = t;
   return e.replace(new RegExp(n, s ? "g" : ""), o);
-}), Os = Q(ne, Ae), To = {
+}), Os = Y(ne, Ae), To = {
   kernelName: ne,
   backendName: "cpu",
   kernelFunc: Os
@@ -1830,7 +1830,7 @@ class Ps {
       if (l !== s)
         throw new Error(`Last split value must be data size. Expected ${s}, got ${l}`);
     }
-    const a = o - 1, r = W("int32", o);
+    const a = o - 1, r = U("int32", o);
     if (s === 0 || o === 0) {
       const l = new Array(s);
       for (let u = 0; u <= a; ++u)
@@ -1901,7 +1901,7 @@ function _s(e, t, n) {
     const m = o.length - w;
     i[p] = m, a += m, r = Math.max(r, m);
   }
-  const l = W("int32", a * 2), u = new Array(a), h = [s, r];
+  const l = U("int32", a * 2), u = new Array(a), h = [s, r];
   let f = 0;
   for (let p = 0; p < s; ++p)
     for (let w = 0; w < i[p]; ++w)
@@ -1909,17 +1909,17 @@ function _s(e, t, n) {
   return [l, u, h];
 }
 function Vs(e, t) {
-  const n = W("int32", e.length);
+  const n = U("int32", e.length);
   for (let s = 0; s < e.length; ++s)
     n[s] = qn(e[s]).modulo(t).getLowBitsUnsigned();
   return n;
 }
-const _e = U(((e, t) => e - t)), Cs = Ft(((e, t, n, s) => ({ real: e - n, imag: t - s }))), Ds = z(se, _e, Cs), Ro = {
+const _e = W(((e, t) => e - t)), Cs = Ft(((e, t, n, s) => ({ real: e - n, imag: t - s }))), Ds = z(se, _e, Cs), Ro = {
   kernelName: se,
   backendName: "cpu",
   kernelFunc: Ds
 };
-function Ws(e, t) {
+function Us(e, t) {
   const n = new Array(e.rank);
   for (let o = 0; o < n.length; o++)
     n[o] = e.shape[o] * t[o];
@@ -1954,7 +1954,7 @@ function Ve(e, t, n = 0, s = e.length - 1) {
     rt(e[n], o) === 0 ? ot(e, n, r) : (r = r + 1, ot(e, r, s)), r <= t && (n = r + 1), t <= r && (s = r - 1);
   }
 }
-function Us(e, t, n, s, o) {
+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, w = e.subarray(p, p + i);
@@ -1971,7 +1971,7 @@ function Us(e, t, n, s, o) {
   ];
 }
 function $s(e, t, n, s) {
-  const o = Jt(t, n)[0], a = [1, n[0], 1];
+  const o = Qt(t, n)[0], a = [1, n[0], 1];
   for (let m = 0; m < o; m++)
     a[0] *= n[m];
   a[1] = n[o];
@@ -2061,8 +2061,8 @@ const Mo = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   stringSplitImpl: _s,
   stringToHashBucketFastImpl: Vs,
   subImpl: _e,
-  tileImpl: Ws,
-  topKImpl: Us,
+  tileImpl: Us,
+  topKImpl: Ws,
   transposeImpl: Re,
   uniqueImpl: $s
 }, Symbol.toStringTag, { value: "Module" }));
@@ -2079,16 +2079,16 @@ export {
   qs as I,
   _s as J,
   Vs as K,
-  Ws as L,
-  Us as M,
+  Us as L,
+  Ws as M,
   $s as N,
   zn as O,
-  Js as P,
+  Qs as P,
   no as Q,
   so as R,
   eo as S,
   oo as T,
-  Qs as U,
+  Ys as U,
   ro as V,
   ao as W,
   io as X,
@@ -2096,7 +2096,7 @@ export {
   co as Z,
   uo as _,
   nt as a,
-  Ys as a0,
+  Js as a0,
   fo as a1,
   go as a2,
   mo as a3,
@@ -2116,7 +2116,7 @@ export {
   Ro as ah,
   Eo as ai,
   ys as b,
-  U as c,
+  W as c,
   Vn as d,
   z as e,
   ks as f,

package/dist/{slice-BfEGSH82.js → slice-wBNvzVyz.js}

@@ -1,4 +1,4 @@
-import { A as c, B as e, E as a, S as l } from "./index-DOvlwCh-.js";
+import { o as c, q as e, E as a, S as l } from "./index-Duu1Lvvv.js";
 function p(r, n, o) {
   const s = e(r, "x", "slice", "string_or_numeric");
   if (s.rank === 0)

package/dist/{slice_util-uTKwiEpW.js → slice_util-zN8KFC5I.js}

@@ -1,4 +1,4 @@
-import { l as E, aa as x } from "./index-DOvlwCh-.js";
+import { x as E, a5 as x } from "./index-Duu1Lvvv.js";
 const N = -2, L = -1;
 function P(n, e, i) {
   const r = n.shape.length;

package/dist/{softmax-CA5jFsLR.js → softmax-DfuYyjMh.js}

@@ -1,4 +1,4 @@
-import { A as r, B as f, E as e, Q as i } from "./index-DOvlwCh-.js";
+import { o as r, q as f, E as e, I as i } from "./index-Duu1Lvvv.js";
 function l(s, o = -1) {
   const t = f(s, "logits", "softmax", "float32");
   if (o === -1 && (o = t.rank - 1), o !== t.rank - 1)

package/dist/split-BYrLboMq.js

@@ -0,0 +1,9 @@
+import { o as p, q as i, E as a, J as c } from "./index-Duu1Lvvv.js";
+function e(t, s, o = 0) {
+  const n = { x: i(t, "x", "split") }, r = { numOrSizeSplits: s, axis: o };
+  return a.runKernel(c, n, r);
+}
+const u = /* @__PURE__ */ p({ split_: e });
+export {
+  u as s
+};

package/dist/squeeze-Bk8Brcct.js

@@ -0,0 +1,10 @@
+import { o as r, q as n, K as a } from "./index-Duu1Lvvv.js";
+import { r as t } from "./reshape-BI0yzp1T.js";
+function p(s, o) {
+  const e = n(s, "x", "squeeze", "string_or_numeric");
+  return t(e, a(e.shape, o).newShape);
+}
+const i = /* @__PURE__ */ r({ squeeze_: p });
+export {
+  i as s
+};

package/dist/{stack-Cf4n9h0N.js → stack-CDWShFHF.js}

@@ -1,4 +1,4 @@
-import { A as e, G as c, l as n, E as k, W as i } from "./index-DOvlwCh-.js";
+import { o as e, y as c, x as n, E as k, P as i } from "./index-Duu1Lvvv.js";
 function u(r, t = 0) {
   const s = c(r, "tensors", "stack", "string_or_numeric");
   n(s.length >= 1, () => "Pass at least one tensor to tf.stack"), s.length > 0 && n(t <= s[0].rank, () => "Axis must be <= rank of the tensor");