@genai-fi/nanogpt 0.7.3 → 0.8.1

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

@@ -1,9 +1,9 @@
-import { l as Lt, bf as Ce, j as V, k as Pt, a1 as H, bg as et, aa as ht, bh as dt, bi as at, a6 as De, a7 as st, am as We, b2 as $e, bj as Ue, bk as ze, bl as Be, bm as qt, al as K, bn as At, bo as W, bp as _t, bq as Vt, ae as Ct, br as Dt, ak as Wt, bs as $t, aW as Ut, aX as zt, aZ as Bt, a_ as jt, af as Gt, bt as Zt, b1 as Kt, bu as Ht, a$ as je, ao as Ge, bv as Xt, b5 as Ze, bw as Ke, p as Jt, u as He, t as Xe, bx as Qt, by as It, ar as Yt, W as Je, bz as te, bA as ee, bB as ne, aM as pt, bC as se, bD as ot } from "./index-BoWRt-10.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-TE7aTPhZ.js";
-import { g as pn, a as wn, e as In, c as bn } from "./axis_util-BzbKo31C.js";
-import { b as xn } from "./broadcast_to-CdbwV-Dj.js";
-import { r as En } from "./reshape-CdBq1WJ6.js";
-import { p as Fn, q as yn, r as kn, u as Nn } from "./selu_util-BJEXVvjX.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, q = 0; q < I.length; q += 8) {
-      var U = Math.min(8, I.length - q), j = parseInt(I.substring(q, q + 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,9 +412,9 @@ 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), q = this, U = ""; ; ) {
-      var j = q.div(R), C = q.sub(j.mul(R)).toInt() >>> 0, P = C.toString(c);
-      if (q = j, q.isZero())
+    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;
@@ -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, q = c.high >>> 16, U = c.high & 65535, j = c.low >>> 16, C = c.low & 65535, P = 0, G = 0, _ = 0, B = 0;
-    return B += R + C, _ += B >>> 16, B &= 65535, _ += L + j, G += _ >>> 16, _ &= 65535, G += N + U, P += G >>> 16, G &= 65535, P += E + q, P &= 65535, i(_ << 16 | B, P << 16 | G, this.unsigned);
+    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, q = this.low & 65535, U = c.high >>> 16, j = c.high & 65535, C = c.low >>> 16, P = c.low & 65535, G = 0, _ = 0, B = 0, ct = 0;
-    return ct += q * P, B += ct >>> 16, ct &= 65535, B += R * P, _ += B >>> 16, B &= 65535, B += q * C, _ += B >>> 16, B &= 65535, _ += L * P, G += _ >>> 16, _ &= 65535, _ += R * C, G += _ >>> 16, _ &= 65535, _ += q * j, G += _ >>> 16, _ &= 65535, G += N * P + L * C + R * j + q * U, G &= 65535, i(B << 16 | ct, G << 16 | _, this.unsigned);
+    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 q = this.shr(1);
-        return N = q.div(c).shl(1), N.eq(g) ? c.isNegative() ? k : v : (L = this.sub(c.mul(N)), R = N.add(L.div(c)), R);
+        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())
@@ -675,7 +675,7 @@ 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 J(e, t, n = gt("9ddfea08eb382d69")) {
@@ -685,16 +685,16 @@ function J(e, t, n = gt("9ddfea08eb382d69")) {
   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);
+    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) {
@@ -709,13 +709,13 @@ function On(e, t = e.length) {
 }
 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);
+  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 = 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 = 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 qn(e, t = e.length) {
+function An(e, t = e.length) {
   const n = tt.fromNumber(81, !0);
   if (t <= 32)
     return t <= 16 ? On(e, t) : Ln(e, t);
@@ -726,10 +726,10 @@ function qn(e, t = e.length) {
   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 = 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 = 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);
+  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 = Pt(t, n), i = r.length, l = H(r), u = V(r), h = et(a, u), f = t.length, p = n.length, w = H(t), m = H(n), F = ht(t, r), d = ht(n, r);
+    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]);
@@ -1013,7 +1013,7 @@ function z(e, t, n, s) {
 }
 function Ft(e) {
   return (t, n, s, o, a, r) => {
-    const i = Pt(t, n), l = V(i), u = i.length, h = H(i), f = et("float32", l), p = et("float32", l), w = ht(t, i), m = ht(n, i), F = kt(s, o), d = kt(a, r), g = t.length, b = H(t), k = n.length, y = H(n);
+    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(qt, he, _n), eo = {
-  kernelName: qt,
+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
 };
@@ -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];
@@ -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;
@@ -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})`);
     }
   });
@@ -2260,8 +2260,8 @@ const Le = X((e) => 1 / Math.sqrt(e)), xs = Q(Qt, 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 = [];
@@ -2315,12 +2315,12 @@ const Fs = X((e) => 1 / (1 + Math.exp(-e))), ys = de(Yt, (e) => 1 / (1 + Math.ex
  * =============================================================================
  */
 function Pe(e, t, n, s, o) {
-  const a = kn(s, t, n), r = V(n), i = H(s);
+  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);
@@ -2578,10 +2578,10 @@ const Ts = X((e) => Math.sqrt(e)), Rs = de(te, (e) => Math.sqrt(e)), No = {
  * limitations under the License.
  * =============================================================================
  */
-const qe = $((e, t) => {
+const Ae = $((e, t) => {
   const n = e - t;
   return n * n;
-}), Ms = z(ee, qe), vo = {
+}), Ms = z(ee, Ae), vo = {
   kernelName: ee,
   backendName: "cpu",
   kernelFunc: Ms
@@ -2602,10 +2602,10 @@ const qe = $((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 = Q(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++)
@@ -2742,7 +2742,7 @@ class Ps {
     return [i, r];
   }
 }
-function qs(e, t, n, s, o, a, r, i) {
+function As(e, t, n, s, o, a, r, i) {
   return new Ps(n, s, o, a, r, i).compute(e, t);
 }
 /**
@@ -2761,7 +2761,7 @@ function qs(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] = qn(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)
   ];
 }
 /**
@@ -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,
@@ -3045,10 +3045,10 @@ const Ro = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   sparseReshapeImpl: vs,
   sparseSegmentReductionImpl: Ss,
   sqrtImpl: Ts,
-  squaredDifferenceImpl: qe,
-  staticRegexReplaceImpl: Ae,
+  squaredDifferenceImpl: Ae,
+  staticRegexReplaceImpl: qe,
   stridedSliceImpl: Ls,
-  stringNGramsImpl: qs,
+  stringNGramsImpl: As,
   stringSplitImpl: _s,
   stringToHashBucketFastImpl: Vs,
   subImpl: _e,
@@ -3067,7 +3067,7 @@ export {
   vs as F,
   Ss as G,
   Ls as H,
-  qs as I,
+  As as I,
   _s as J,
   Vs as K,
   Ws as L,
@@ -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,

package/dist/{sin-BeA3tsEd.js → sin-CPxad7Am.js}

@@ -1,4 +1,4 @@
-import { B as o, C as t, E as c, a8 as a, a9 as e } from "./index-BoWRt-10.js";
+import { C as o, D as t, E as c, ac as a, ad as e } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/{slice-BiOsknYS.js → slice-B7jXtPnp.js}

@@ -1,4 +1,4 @@
-import { B as c, C as e, E as a, W as l } from "./index-BoWRt-10.js";
+import { C as c, D as e, E as a, $ as l } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/{softmax-Bv_6lyMX.js → softmax-BfsyI4As.js}

@@ -1,4 +1,4 @@
-import { B as r, C as f, E as e, S as i } from "./index-BoWRt-10.js";
+import { C as r, D as f, E as e, S as i } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/{split-B-dikLRw.js → split-BPxr8_8m.js}

@@ -1,4 +1,4 @@
-import { B as p, C as i, E as a, L as c } from "./index-BoWRt-10.js";
+import { C as p, D as i, E as a, W as c } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.

package/dist/{stack-B17UN2nn.js → stack-BNwLzE43.js}

@@ -1,4 +1,4 @@
-import { B as e, D as c, l as n, E as k, P as i } from "./index-BoWRt-10.js";
+import { C as e, F as c, n, E as k, P as i } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.

package/dist/{sum-66ew2byf.js → sum-ByFINZgi.js}

@@ -1,4 +1,4 @@
-import { B as e, C as u, X as c, E as l, Y as m } from "./index-BoWRt-10.js";
+import { C as e, D as u, a0 as c, E as l, a1 as m } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -18,8 +18,8 @@ import { B as e, C as u, X as c, E as l, Y as m } from "./index-BoWRt-10.js";
 function i(t, n = null, o = !1) {
   let s = u(t, "x", "sum");
   s.dtype === "bool" && (s = c(s, "int32"));
-  const r = { x: s }, a = { axis: n, keepDims: o };
-  return l.runKernel(m, r, a);
+  const a = { x: s }, r = { axis: n, keepDims: o };
+  return l.runKernel(m, a, r);
 }
 const f = /* @__PURE__ */ e({ sum_: i });
 export {

package/dist/{tensor-JwS7ZYY6.js → tensor-DbqgIV9B.js}

@@ -1,4 +1,4 @@
-import { Z as t, _ as a } from "./index-BoWRt-10.js";
+import { A as t, B as a } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/tensor1d-CtJq5BOv.js

@@ -0,0 +1,27 @@
+import { z as o, A as s, B as t } from "./index-DdmHGZjq.js";
+/**
+ * @license
+ * Copyright 2018 Google LLC. All Rights Reserved.
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ * =============================================================================
+ */
+function h(r, e) {
+  o(r);
+  const n = s(r, e);
+  if (n.length !== 1)
+    throw new Error("tensor1d() requires values to be a flat/TypedArray");
+  return t(r, null, n, e);
+}
+export {
+  h as t
+};

package/dist/{tensor2d-wxPAnDQy.js → tensor2d-CObBWBkW.js}

@@ -1,4 +1,4 @@
-import { $ as t, Z as s, _ as a } from "./index-BoWRt-10.js";
+import { z as t, A as s, B as a } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/tensor3d-BOukqWwr.js

@@ -0,0 +1,30 @@
+import { z as o, A as a, B as s } from "./index-DdmHGZjq.js";
+/**
+ * @license
+ * Copyright 2018 Google LLC. All Rights Reserved.
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ * =============================================================================
+ */
+function h(n, r, t) {
+  if (o(n), r != null && r.length !== 3)
+    throw new Error("tensor3d() requires shape to have three numbers");
+  const e = a(n, t);
+  if (e.length !== 3 && e.length !== 1)
+    throw new Error("tensor3d() requires values to be number[][][] or flat/TypedArray");
+  if (e.length === 1 && r == null)
+    throw new Error("tensor3d() requires shape to be provided when `values` are a flat array");
+  return s(n, r, e, t);
+}
+export {
+  h as t
+};

package/dist/tensor4d-DLtk7Nxh.js

@@ -0,0 +1,30 @@
+import { z as t, A as a, B as s } from "./index-DdmHGZjq.js";
+/**
+ * @license
+ * Copyright 2018 Google LLC. All Rights Reserved.
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ * =============================================================================
+ */
+function i(n, r, o) {
+  if (t(n), r != null && r.length !== 4)
+    throw new Error("tensor4d() requires shape to have four numbers");
+  const e = a(n, o);
+  if (e.length !== 4 && e.length !== 1)
+    throw new Error("tensor4d() requires values to be number[][][][] or flat/TypedArray");
+  if (e.length === 1 && r == null)
+    throw new Error("tensor4d() requires shape to be provided when `values` are a flat array");
+  return s(n, r, e, o);
+}
+export {
+  i as t
+};

package/dist/training/Adam.js

@@ -1,7 +1,7 @@
 import { adamAdjust as b } from "../ops/adamAdjust.js";
 import { adamMoments as d } from "../ops/adamMoments.js";
-import { O as g, e as h, t as o, d as B } from "../index-BoWRt-10.js";
-import { z as M } from "../zeros--BdLQ3oG.js";
+import { O as g, e as h, t as o, d as B } from "../index-DdmHGZjq.js";
+import { z as M } from "../zeros-Dnwix0p4.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/training/AdamExt.js

@@ -1,4 +1,4 @@
-import { a as r, b as c, c as h, e as o } from "../index-BoWRt-10.js";
+import { a as r, b as c, c as h, e as o } from "../index-DdmHGZjq.js";
 import { AdamOptimizer as g } from "./Adam.js";
 class y extends g {
   constructor(t, e, s, i, a) {

package/dist/training/DatasetBuilder.js

@@ -1,5 +1,5 @@
-import { t as g } from "../index-BoWRt-10.js";
-import { d as u, i as d } from "../dataset-CtdBYwjo.js";
+import { t as g } from "../index-DdmHGZjq.js";
+import { d as u, i as d } from "../dataset-DPPl-iLT.js";
 import "../index-Tf7vU29b.js";
 /**
  * @license

package/dist/training/Evaluator.d.ts

@@ -1,9 +1,9 @@
-import { default as NanoGPT } from '../NanoGPTModel';
 import { Dataset } from '@tensorflow/tfjs-data';
 import { TensorContainer } from '@tensorflow/tfjs-core';
+import { default as Model, ModelForwardAttributes } from '../models/model';
 export default class Evaluator {
     private model;
     private iterator;
-    constructor(model: NanoGPT, dataset: Dataset<TensorContainer>);
+    constructor(model: Model<ModelForwardAttributes>, dataset: Dataset<TensorContainer>);
     evaluate(maxBatches?: number): Promise<number>;
 }

package/dist/training/FullTrainer.d.ts

@@ -1,10 +1,10 @@
 import { ITokeniser } from '../tokeniser/type';
-import { default as NanoGPT, TrainingLogEntry } from '../NanoGPTModel';
-import { default as GPTTrainer, TrainingOptions, TrainingProgress } from './Trainer';
+import { default as GPTTrainer, TrainingLogEntry, TrainingOptions, TrainingProgress } from './Trainer';
 import { Tensor } from '@tensorflow/tfjs-core';
 import { Dataset } from '@tensorflow/tfjs-data';
+import { default as Model, ModelForwardAttributes } from '../models/model';
 export default class FullTrainer extends GPTTrainer {
-    constructor(model: NanoGPT, tokenizer: ITokeniser, learningRate?: number);
+    constructor(model: Model<ModelForwardAttributes>, tokenizer: ITokeniser, learningRate?: number);
     private createEmptyState;
     private createLogEntry;
     private createProgress;