@genai-fi/nanogpt 0.5.4 → 0.5.5

package/dist/ops/webgl/fusedSoftmax.js

@@ -1,11 +1,11 @@
-import { a$ as qt, q as y, Q as Ct, ad as J, b0 as nt, b1 as It, b2 as pt, b3 as ft, b4 as kt, Z as ot, al as B, b5 as q, b6 as Ut, U as Gt, l as jt, t as Zt, b7 as dt, ao as ct, b8 as tt, a1 as ut, b9 as Bt, N as Ht, ba as Kt, r as Xt } from "../../index-CnHyhpKc.js";
-import { f as $t, a as Qt, g as yt, b as Yt, c as Jt } from "../../kernel_funcs_utils-Dqo82NH4.js";
-import { c as mt, g as Tt, a as Vt, b as Mt, e as wt } from "../../axis_util-CVbf1vmL.js";
-import { b as te } from "../../broadcast_to-BBoMQXbL.js";
-import { r as ee } from "../../reshape-CTIbqjwm.js";
-import { i as ne, c as oe } from "../../slice_util-n4wHKmex.js";
+import { a_ as qt, q as y, Q as Ct, ac as J, a$ as nt, b0 as It, b1 as pt, b2 as ft, b3 as kt, Z as ot, ak as B, b4 as q, b5 as Ut, U as Gt, l as jt, t as Zt, b6 as dt, an as ct, b7 as tt, a1 as ut, b8 as Bt, N as Ht, b9 as Kt, r as Xt } from "../../index-Du-bmOP8.js";
+import { f as $t, a as Qt, g as yt, b as Yt, c as Jt } from "../../kernel_funcs_utils-DShm7-0k.js";
+import { c as mt, g as Tt, a as Vt, b as Mt, e as wt } from "../../axis_util-BczFISHz.js";
+import { b as te } from "../../broadcast_to-B7NGsBSh.js";
+import { r as ee } from "../../reshape-BH7eBpwq.js";
+import { i as ne, c as oe } from "../../slice_util-DskXqRZa.js";
 import { g as se } from "../../_commonjsHelpers-ByX85dGu.js";
-import { r as st } from "../../Reshape-Bt_t7RNz.js";
+import { r as st } from "../../Reshape-Biok_3X1.js";
 function re(t, e) {
   for (var n = 0; n < e.length; n++) {
     const o = e[n];
@@ -341,9 +341,9 @@ function ie() {
       if (I >= m)
         return L;
     } else {
-      if (I <= -b)
+      if (I <= -v)
         return _;
-      if (I + 1 >= b)
+      if (I + 1 >= v)
         return D;
     }
     return I < 0 ? a(-I, l).neg() : i(I % p | 0, I / p | 0, l);
@@ -381,14 +381,14 @@ function ie() {
     return typeof I == "number" ? a(I, l) : typeof I == "string" ? c(I, l) : i(I.low, I.high, typeof l == "boolean" ? l : I.unsigned);
   }
   e.fromValue = h;
-  var f = 65536, w = 1 << 24, p = f * f, m = p * p, b = m / 2, d = r(w), g = r(0);
+  var f = 65536, w = 1 << 24, p = f * f, m = p * p, v = m / 2, d = r(w), g = r(0);
   e.ZERO = g;
   var x = r(0, !0);
   e.UZERO = x;
   var O = r(1);
   e.ONE = O;
-  var v = r(1, !0);
-  e.UONE = v;
+  var b = r(1, !0);
+  e.UONE = b;
   var V = r(-1);
   e.NEG_ONE = V;
   var D = i(-1, 2147483647, !1);
@@ -532,7 +532,7 @@ function ie() {
       if (l.unsigned || (l = l.toUnsigned()), l.gt(this))
         return x;
       if (l.gt(this.shru(1)))
-        return v;
+        return b;
       $ = x;
     } else {
       if (this.eq(_)) {
@@ -869,10 +869,10 @@ function Ee(t, e, n) {
  * limitations under the License.
  * =============================================================================
  */
-function be(t, e) {
+function ve(t, e) {
   return `only one output dimension may be -1, not both ${t} and ${e}`;
 }
-function ve(t, e) {
+function be(t, e) {
   return `size ${t} must be non-negative, not ${e}`;
 }
 function Oe() {
@@ -955,18 +955,18 @@ function Ve(t) {
  */
 function C(t) {
   return (e, n, o, s, r) => {
-    const a = Ct(e, n), i = a.length, u = J(a), c = y(a), h = nt(r, c), f = e.length, w = n.length, p = J(e), m = J(n), b = It(e, a), d = It(n, a);
-    if (b.length + d.length === 0)
+    const a = Ct(e, n), i = a.length, u = J(a), c = y(a), h = nt(r, c), f = e.length, w = n.length, p = J(e), m = J(n), v = It(e, a), d = It(n, a);
+    if (v.length + d.length === 0)
       for (let g = 0; g < h.length; ++g)
         h[g] = t(o[g % o.length], s[g % s.length]);
     else
       for (let g = 0; g < h.length; ++g) {
         const x = pt(g, i, u), O = x.slice(-f);
-        b.forEach((L) => O[L] = 0);
-        const v = ft(O, f, p), V = x.slice(-w);
+        v.forEach((L) => O[L] = 0);
+        const b = ft(O, f, p), V = x.slice(-w);
         d.forEach((L) => V[L] = 0);
         const D = ft(V, w, m);
-        h[g] = t(o[v], s[D]);
+        h[g] = t(o[b], s[D]);
       }
     return [h, a];
   };
@@ -1626,7 +1626,7 @@ function an(t, e, n, o) {
     for (let w = 0; w < n.length; ++w) {
       const p = n[w], m = w + e.length - 1;
       if (m >= 0) {
-        const b = i[m], d = b[b.length - 1] - p[h];
+        const v = i[m], d = v[v.length - 1] - p[h];
         for (let g = h; g < f; ++g)
           i[m].push(p[g + 1] + d);
       }
@@ -1644,7 +1644,7 @@ function un(t) {
   }
   return e;
 }
-function bt(t, e) {
+function vt(t, e) {
   const n = t.slice(0, e);
   for (; n.length < e; )
     n.push(1);
@@ -1653,7 +1653,7 @@ function bt(t, e) {
   return n;
 }
 function ln(t, e, n, o, s, r) {
-  const a = bt(e, 2)[1], i = bt(r, 2)[1];
+  const a = vt(e, 2)[1], i = vt(r, 2)[1];
   let u = 0;
   for (const c of n)
     for (let h = c[0]; h < c[1]; ++h) {
@@ -1695,7 +1695,7 @@ function hn(t, e, n, o, s, r, a, i) {
  * limitations under the License.
  * =============================================================================
  */
-const vt = 2147483647;
+const bt = 2147483647;
 function fn(t, e, n, o, s, r, a) {
   if (e.length > 1)
     throw new Error("starts must be a scalar or vector");
@@ -1714,21 +1714,21 @@ function fn(t, e, n, o, s, r, a) {
     const g = i ? t[0] : t[d], x = u ? o[0] : o[d], O = c ? r[0] : r[d];
     if (O === 0)
       throw new Error("Requires delta != 0");
-    let v;
+    let b;
     if (O > 0 && x < g || O < 0 && x > g)
-      v = 0;
-    else if (v = Math.ceil(Math.abs((x - g) / O)), v > vt)
-      throw new Error(`Requires ((limit - start) / delta) <= ${vt}`);
-    w[d + 1] = w[d] + v;
+      b = 0;
+    else if (b = Math.ceil(Math.abs((x - g) / O)), b > bt)
+      throw new Error(`Requires ((limit - start) / delta) <= ${bt}`);
+    w[d + 1] = w[d] + b;
   }
   const p = w[f], m = q(n, p);
-  let b = 0;
+  let v = 0;
   for (let d = 0; d < f; ++d) {
     const g = w[d + 1] - w[d];
     let x = i ? t[0] : t[d];
     const O = c ? r[0] : r[d];
-    for (let v = 0; v < g; ++v)
-      m[b++] = x, x += O;
+    for (let b = 0; b < g; ++b)
+      m[v++] = x, x += O;
   }
   return [w, m];
 }
@@ -1945,14 +1945,14 @@ class at {
     if (h.length !== u && h.length !== 1) {
       const m = this.defaultValueShape;
       Zt(() => {
-        const b = ee(h, m);
-        h = te(b, i).dataSync();
+        const v = ee(h, m);
+        h = te(v, i).dataSync();
       });
     }
     let f = 0, w = 0, p = 0;
     for (let m = 0; m <= c; ++m) {
-      let b = m < c ? n[m] : -1;
-      if (b === p) {
+      let v = m < c ? n[m] : -1;
+      if (v === p) {
         ++p;
         continue;
       }
@@ -1962,17 +1962,17 @@ class at {
       }
       if (m >= c) {
         const d = o.length;
-        b = Math.floor(d / u);
+        v = Math.floor(d / u);
       }
-      if (b > p)
+      if (v > p)
         if (this.defaultValue.length === 1)
-          a.subarray(p * u, b * u).fill(this.defaultValue[0]), p = b;
+          a.subarray(p * u, v * u).fill(this.defaultValue[0]), p = v;
         else
-          for (; b > p; ) {
+          for (; v > p; ) {
             const d = a.slice(p * u);
             Ot(d, h, u), ++p;
           }
-      b < 0 ? (f = m + 1, w = p) : (f = m, w = p, p = w + 1);
+      v < 0 ? (f = m + 1, w = p) : (f = m, w = p, p = w + 1);
     }
   }
 }
@@ -2063,14 +2063,14 @@ function mn(t, e, n, o, s, r, a, i, u, c) {
   const p = u instanceof dt ? u : B(h, e.dtype);
   typeof u == "string" || typeof u == "number" ? p.values.fill(u) : typeof u == "boolean" && p.values.fill(+u);
   for (let m = 0; m < r; m++) {
-    const b = [];
+    const v = [];
     let d = 0;
     for (let g = 0; g < a; g++) {
       const x = f[m * a + g];
-      b.push(x), d += x * i[g];
+      v.push(x), d += x * i[g];
     }
     if (d < 0 || d >= o / s)
-      throw new Error(`Invalid indices: ${b} does not index into ${n}`);
+      throw new Error(`Invalid indices: ${v} does not index into ${n}`);
     for (let g = 0; g < s; g++)
       c ? p.values[d * s + g] += w[m * s + g] : p.values[d * s + g] = e.rank === 0 ? w[0] : w[m * s + g];
   }
@@ -2117,7 +2117,7 @@ function In(t, e, n, o, s) {
   }
   const u = s === "string" ? $t(t) : t, c = B(o, s, u), h = B(n, s);
   for (let f = 0; f < h.size; ++f) {
-    const w = h.indexToLoc(f), p = w.map((m, b) => m + e[b]);
+    const w = h.indexToLoc(f), p = w.map((m, v) => m + e[v]);
     h.set(c.get(...p), ...w);
   }
   return s === "string" ? Qt(h.values) : h.values;
@@ -2162,12 +2162,12 @@ function xn(t, e, n, o, s, r, a) {
       throw new Error(Ee(d, g, u));
     ++m[g], w = w && g >= p, p = g;
   }
-  let b = !0;
+  let v = !0;
   for (let d = 0; d < u; ++d) {
     const g = m[d] === 0;
-    c[d] = g, b = b && !g, m[d] = Math.max(m[d], 1), d > 0 && (m[d] += m[d - 1]);
+    c[d] = g, v = v && !g, m[d] = Math.max(m[d], 1), d > 0 && (m[d] += m[d - 1]);
   }
-  if (b && w) {
+  if (v && w) {
     const d = t, g = o;
     for (let x = 0; x < i; ++x)
       h[x] = x;
@@ -2180,17 +2180,17 @@ function xn(t, e, n, o, s, r, a) {
     ];
   } else {
     const d = m[u - 1], g = q(n, d * f), x = q(s, d), O = new Array(u).fill(0);
-    for (let v = 0; v < i; ++v) {
-      const V = t[v * f], D = O[V], L = (V === 0 ? 0 : m[V - 1]) + D;
+    for (let b = 0; b < i; ++b) {
+      const V = t[b * f], D = O[V], L = (V === 0 ? 0 : m[V - 1]) + D;
       O[V]++;
       for (let _ = 0; _ < f; ++_)
-        g[L * f + _] = t[v * f + _];
-      x[L] = o[v], h[v] = L;
+        g[L * f + _] = t[b * f + _];
+      x[L] = o[b], h[b] = L;
     }
-    for (let v = 0; v < u; ++v)
-      if (O[v] === 0) {
-        const D = v === 0 ? 0 : m[v - 1];
-        g[D * f + 0] = v;
+    for (let b = 0; b < u; ++b)
+      if (O[b] === 0) {
+        const D = b === 0 ? 0 : m[b - 1];
+        g[D * f + 0] = b;
         for (let L = 1; L < f; ++L)
           g[D * f + L] = 0;
         x[D] = a;
@@ -2227,11 +2227,11 @@ function Sn(t, e, n, o, s) {
     const g = s[d];
     if (g === -1) {
       if (h !== -1)
-        throw new Error(be(h, d));
+        throw new Error(ve(h, d));
       h = d, u.push(1);
     } else {
       if (g < 0)
-        throw new Error(ve(d, g));
+        throw new Error(be(d, g));
       c *= g, u.push(g);
     }
   }
@@ -2257,15 +2257,15 @@ function Sn(t, e, n, o, s) {
     for (let d = i - 2; d >= 0; --d)
       m[d] = m[d + 1] * u[d + 1];
   }
-  const b = q(n, a * i);
+  const v = q(n, a * i);
   for (let d = 0; d < a; ++d) {
     let g = 0;
     for (let x = 0; x < w; ++x)
       g += t[d * w + x] * p[x];
     for (let x = 0; x < i; ++x)
-      b[d * i + x] = Math.trunc(g / m[x]), g %= m[x];
+      v[d * i + x] = Math.trunc(g / m[x]), g %= m[x];
   }
-  return [b, [a, i], u];
+  return [v, [a, i], u];
 }
 /**
  * @license
@@ -2289,12 +2289,12 @@ function En(t, e, n, o, s, r = !1, a = 0) {
     throw new Error(Et());
   const w = e.slice();
   w[0] = f;
-  const p = w.reduce((O, v) => O * v, 1), m = q(n, p);
+  const p = w.reduce((O, b) => O * b, 1), m = q(n, p);
   if (i === 0)
     return f > 0 && m.fill(a), [m, w];
   if (f <= 0)
     throw new Error(Et());
-  let b = 0, d = 1, g = 0, x = s[b];
+  let v = 0, d = 1, g = 0, x = s[v];
   for (; ; ) {
     let O = 0;
     if (d < i) {
@@ -2308,17 +2308,17 @@ function En(t, e, n, o, s, r = !1, a = 0) {
     if (x < 0 || x >= f)
       throw new Error(ye(x, f));
     x > g && m.fill(a, g * c, x * c);
-    for (let v = b; v < d; ++v) {
-      const V = o[v];
+    for (let b = v; b < d; ++b) {
+      const V = o[b];
       if (V < 0 || V >= u[0])
-        throw new Error(Te(v, o[v], u[0]));
+        throw new Error(Te(b, o[b], u[0]));
       for (let D = 0; D < c; D++)
         m[x * c + D] += t[V * c + D];
     }
     if (r)
-      for (let v = 0; v < c; v++)
-        m[x * c + v] /= d - b;
-    if (b = d, ++d, g = x + 1, x = O, d > i)
+      for (let b = 0; b < c; b++)
+        m[x * c + b] /= d - v;
+    if (v = d, ++d, g = x + 1, x = O, d > i)
       break;
   }
   return g < f && m.fill(a, g * c, f * c), [m, w];
@@ -2339,7 +2339,7 @@ function En(t, e, n, o, s, r = !1, a = 0) {
  * limitations under the License.
  * =============================================================================
  */
-const bn = K((t) => Math.sqrt(t));
+const vn = K((t) => Math.sqrt(t));
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -2356,7 +2356,7 @@ const bn = K((t) => Math.sqrt(t));
  * limitations under the License.
  * =============================================================================
  */
-const vn = C((t, e) => {
+const bn = C((t, e) => {
   const n = t - e;
   return n * n;
 });
@@ -2443,9 +2443,9 @@ class Rn {
       p += h * this.rightPad.length;
       const m = c + h + f - 1;
       p += m * this.separator.length, o[s + i] = new Uint8Array(p);
-      const b = o[s + i];
+      const v = o[s + i];
       let d = 0;
-      const g = (x) => x.forEach((O) => b[d++] = O);
+      const g = (x) => x.forEach((O) => v[d++] = O);
       for (let x = 0; x < c; ++x)
         g(this.leftPad), g(this.separator);
       for (let x = 0; x < f - 1; ++x)
@@ -2685,7 +2685,7 @@ function _n(t, e, n, o, s) {
     const w = f * i, p = t.subarray(w, w + i);
     let m = new Array(p.length);
     p.forEach((x, O) => m[O] = { value: x, index: O }), o < m.length && (Dt(m, o), m = m.slice(0, o)), s && m.sort(et);
-    const b = f * o, d = u.subarray(b, b + o), g = c.subarray(b, b + o);
+    const v = f * o, d = u.subarray(v, v + o), g = c.subarray(v, v + o);
     for (let x = 0; x < o; x++)
       d[x] = m[x].value, g[x] = m[x].index;
   }
@@ -2720,31 +2720,31 @@ function Nn(t, e, n, o) {
     r[2] *= n[m];
   const a = /* @__PURE__ */ new Map(), i = new Int32Array(n[s]), u = new dt(r, o, t), c = [], h = r[0] === 1 && r[2] === 1;
   for (let m = 0; m < n[s]; m++) {
-    let b;
+    let v;
     if (h)
-      b = t[m].toString();
+      v = t[m].toString();
     else {
       const g = [];
       for (let x = 0; x < r[0]; x++)
         for (let O = 0; O < r[2]; O++)
           g.push(u.get(x, m, O));
-      b = g.join(",");
+      v = g.join(",");
     }
-    const d = a.get(b);
+    const d = a.get(v);
     if (d != null)
       i[m] = d;
     else {
       const g = a.size;
-      a.set(b, g), i[m] = g, c.push(m);
+      a.set(v, g), i[m] = g, c.push(m);
     }
   }
   const f = r.slice();
   f[1] = a.size;
   const w = new dt(f, o);
-  c.forEach((m, b) => {
+  c.forEach((m, v) => {
     for (let d = 0; d < r[0]; d++)
       for (let g = 0; g < r[2]; g++)
-        w.set(u.get(d, m, g), d, b, g);
+        w.set(u.get(d, m, g), d, v, g);
   });
   const p = n.slice();
   return p[s] = f[1], {
@@ -2810,8 +2810,8 @@ const An = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   sparseFillEmptyRowsImpl: xn,
   sparseReshapeImpl: Sn,
   sparseSegmentReductionImpl: En,
-  sqrtImpl: bn,
-  squaredDifferenceImpl: vn,
+  sqrtImpl: vn,
+  squaredDifferenceImpl: bn,
   staticRegexReplaceImpl: On,
   stridedSliceImpl: Fn,
   stringNGramsImpl: $n,
@@ -3238,11 +3238,11 @@ function Gn(t) {
   let p = s;
   if (f) {
     if (w) {
-      const O = n.texData.get(p.dataId).values, v = new Array(i);
-      for (let L = 0; L < v.length; L++)
-        v[L] = s.shape[h[L]];
-      const V = Dn(O, s.shape, s.dtype, h, v);
-      p = n.makeTensorInfo(v, s.dtype);
+      const O = n.texData.get(p.dataId).values, b = new Array(i);
+      for (let L = 0; L < b.length; L++)
+        b[L] = s.shape[h[L]];
+      const V = Dn(O, s.shape, s.dtype, h, b);
+      p = n.makeTensorInfo(b, s.dtype);
       const D = n.texData.get(p.dataId);
       D.values = V;
     } else
@@ -3250,17 +3250,17 @@ function Gn(t) {
     c = Vt(c.length, i);
   }
   Mt("max", c, i);
-  const [m, b] = mt(p.shape, c);
+  const [m, v] = mt(p.shape, c);
   let d = m;
   a && (d = wt(m, u));
   let g;
   if (w) {
-    const O = n.texData.get(p.dataId).values, v = Pn(O, y(b), d, s.dtype);
+    const O = n.texData.get(p.dataId).values, b = Pn(O, y(v), d, s.dtype);
     g = n.makeTensorInfo(d, s.dtype);
     const V = n.texData.get(g.dataId);
-    V.values = v;
+    V.values = b;
   } else
-    g = qn(p, b, d, n);
+    g = qn(p, v, d, n);
   return f && n.disposeIntermediateTensorInfo(p), g;
 }
 /**
@@ -3288,8 +3288,8 @@ function jn(t, e, n, o) {
   const [f, w] = mt(h.shape, i);
   let p = f;
   n && (p = wt(f, a));
-  const m = y(w), d = y(t.shape) / m, g = st({ inputs: { x: h }, attrs: { shape: [d, m] }, backend: o }), x = Kt(t.dtype), O = zt(g, x, "sum", o), v = st({ inputs: { x: O }, attrs: { shape: p }, backend: o });
-  return o.disposeIntermediateTensorInfo(g), o.disposeIntermediateTensorInfo(O), c && o.disposeIntermediateTensorInfo(h), v;
+  const m = y(w), d = y(t.shape) / m, g = st({ inputs: { x: h }, attrs: { shape: [d, m] }, backend: o }), x = Kt(t.dtype), O = zt(g, x, "sum", o), b = st({ inputs: { x: O }, attrs: { shape: p }, backend: o });
+  return o.disposeIntermediateTensorInfo(g), o.disposeIntermediateTensorInfo(O), c && o.disposeIntermediateTensorInfo(h), b;
 }
 /**
  * @license
@@ -3414,8 +3414,8 @@ function Yn(t) {
     ]);
     return i.disposeIntermediateTensorInfo(w), i.disposeIntermediateTensorInfo(p), i.disposeIntermediateTensorInfo(m), g;
   }
-  const b = Kn({ inputs: { a: w, b: m }, backend: i });
-  return i.disposeIntermediateTensorInfo(w), i.disposeIntermediateTensorInfo(p), i.disposeIntermediateTensorInfo(m), b;
+  const v = Kn({ inputs: { a: w, b: m }, backend: i });
+  return i.disposeIntermediateTensorInfo(w), i.disposeIntermediateTensorInfo(p), i.disposeIntermediateTensorInfo(m), v;
 }
 const Jn = {
   kernelName: "FusedSoftmax",

package/dist/ops/webgl/gatherSub.js

@@ -1,4 +1,4 @@
-import { r as l } from "../../index-CnHyhpKc.js";
+import { r as l } from "../../index-Du-bmOP8.js";
 class u {
   variableNames = ["labels", "logits", "values"];
   outputShape;

package/dist/ops/webgl/gelu.js

@@ -1,5 +1,5 @@
-import { r as a } from "../../index-CnHyhpKc.js";
-import { u as s, C as x } from "../../kernel_funcs_utils-Dqo82NH4.js";
+import { r as a } from "../../index-Du-bmOP8.js";
+import { u as s, C as x } from "../../kernel_funcs_utils-DShm7-0k.js";
 const t = 0.7978845608028654, r = 0.044715, c = x + `
     float x3 = x * x * x;
     float inner = x + ${r} * x3;

package/dist/ops/webgl/matMulGelu.js

@@ -1,7 +1,7 @@
-import { r as C, t as R, e as I, q as G, Q as L, l as U, U as F } from "../../index-CnHyhpKc.js";
-import { r as S } from "../../Reshape-Bt_t7RNz.js";
-import { u as H } from "../../gpgpu_math-Df7gzJWH.js";
-import { m as B } from "../../mat_mul-DeGU1U_C.js";
+import { r as C, t as R, e as I, q as G, Q as L, l as U, U as F } from "../../index-Du-bmOP8.js";
+import { r as S } from "../../Reshape-Biok_3X1.js";
+import { u as H } from "../../gpgpu_math-BFbOyvk4.js";
+import { m as B } from "../../mat_mul-CbiqIe2d.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/ops/webgl/matMulMul.js

@@ -1,4 +1,4 @@
-import { r as u } from "../../index-CnHyhpKc.js";
+import { r as u } from "../../index-Du-bmOP8.js";
 import { batchMatMulGeluImpl as c } from "./matMulGelu.js";
 const M = `
     return a * b;

package/dist/ops/webgl/mulDropout.js

@@ -1,4 +1,4 @@
-import { r as m } from "../../index-CnHyhpKc.js";
+import { r as m } from "../../index-Du-bmOP8.js";
 class f {
   variableNames = ["a", "b"];
   outputShape;

package/dist/ops/webgl/normRMS.js

@@ -1,5 +1,5 @@
-import { r as p, e as G } from "../../index-CnHyhpKc.js";
-import { s as x } from "../../sum-UdfvaNhB.js";
+import { r as p, e as G } from "../../index-Du-bmOP8.js";
+import { s as x } from "../../sum-Cvq06317.js";
 class y {
   variableNames = ["x", "meanSquare", "gamma"];
   outputShape;

package/dist/ops/webgl/qkv.js

@@ -1,4 +1,4 @@
-import { r as i } from "../../index-CnHyhpKc.js";
+import { r as i } from "../../index-Du-bmOP8.js";
 class l {
   variableNames = ["x", "kernel"];
   outputShape;

package/dist/ops/webgl/rope.js

@@ -1,4 +1,4 @@
-import { r as u } from "../../index-CnHyhpKc.js";
+import { r as u } from "../../index-Du-bmOP8.js";
 class l {
   variableNames = ["x", "sin", "cos"];
   outputShape;

package/dist/ops/webgl/scatterSub.js

@@ -1,4 +1,4 @@
-import { r as i } from "../../index-CnHyhpKc.js";
+import { r as i } from "../../index-Du-bmOP8.js";
 class u {
   variableNames = ["labels", "softmaxProbs", "dy"];
   outputShape;

package/dist/{ops-DzQTmLIl.js → ops-CJNniCAV.js}

@@ -1,16 +1,16 @@
-import { o as h, j as l, E as f, aA as hn, l as p, aB as fn, Q as w, aC as dn, aD as bn, aE as gn, L as $n, al as xn, u as j, aF as kn, aG as yn, aH as In, aI as _n, aJ as En, aK as Mn, aL as Nn, D, aM as An, aN as Tn, aO as Sn, aP as wn, I as zn, J as Bn, K as qn, aQ as Kn, t as Gn, aR as J, aS as Rn, aT as Dn, aU as Pn, aV as Vn, aW as vn, aX as jn, f as Fn, aY as Wn, aZ as On, b as k, a9 as Z, am as G, g as Yn, s as S, a_ as Cn, y as L, a as Jn } from "./index-CnHyhpKc.js";
-import { r as _ } from "./reshape-CTIbqjwm.js";
-import { s as un } from "./split-CVwhL8Oe.js";
-import { s as q } from "./sum-UdfvaNhB.js";
-import { b as X } from "./broadcast_to-BBoMQXbL.js";
-import { r as O } from "./range-CkOJ7090.js";
-import { t as Ln } from "./tensor-IZex6Bwp.js";
-import { s as Y } from "./stack-S2-D2JAQ.js";
-import { c as Xn, z as Qn } from "./zeros-CYMicyqz.js";
-import { n as ln } from "./norm-BpWsOapl.js";
-import { c as Q } from "./concat-BRRtq4S2.js";
-import { m as T } from "./mat_mul-DeGU1U_C.js";
-import { t as H } from "./tensor2d-CqtBzOKq.js";
+import { o as h, j as l, E as f, az as hn, l as p, aA as fn, Q as w, aB as dn, aC as bn, aD as gn, L as $n, ak as xn, u as j, aE as kn, aF as yn, aG as In, aH as _n, aI as En, aJ as Mn, aK as Nn, D, aL as An, aM as Tn, aN as Sn, aO as wn, I as zn, J as Bn, K as qn, aP as Kn, t as Gn, aQ as J, aR as Rn, aS as Dn, aT as Pn, aU as Vn, aV as vn, aW as jn, f as Fn, aX as Wn, aY as On, b as k, a8 as Z, al as G, g as Yn, s as S, aZ as Cn, y as L, a as Jn } from "./index-Du-bmOP8.js";
+import { r as _ } from "./reshape-BH7eBpwq.js";
+import { s as un } from "./split-BCUhuU7B.js";
+import { s as q } from "./sum-Cvq06317.js";
+import { b as X } from "./broadcast_to-B7NGsBSh.js";
+import { r as O } from "./range-Bvs1hidm.js";
+import { t as Ln } from "./tensor-DgTOPY6h.js";
+import { s as Y } from "./stack-BV1v7l3S.js";
+import { c as Xn, z as Qn } from "./zeros-BaHhQTWf.js";
+import { n as ln } from "./norm-01kY9I2B.js";
+import { c as Q } from "./concat-DdKPyAtw.js";
+import { m as T } from "./mat_mul-CbiqIe2d.js";
+import { t as H } from "./tensor2d-CRWjDyUe.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.