@genai-fi/nanogpt 0.10.3 → 0.11.0

package/dist/{resize_nearest_neighbor-B19mCEg2.js → resize_nearest_neighbor-DB8k9KN_.js}

@@ -1,10 +1,10 @@
-import { A as i, B as a, a3 as f, E as u, a_ as y, a$ as A, af as z, aZ as p, y as q, z as D, b as B, b0 as I, L as m, b1 as v, b2 as T, b3 as S, b4 as L, b5 as G, b6 as M, b7 as R, X as k, b8 as j, b9 as C, ba as P, bb as U, l as h, bc as X, bd as Z, be as F } from "./index-DOvlwCh-.js";
-import { b as _ } from "./broadcast_to-B3eYlZm7.js";
-import { e as H } from "./axis_util-BaG7mf5A.js";
-import { m as E } from "./log_sum_exp-ngO0-4pK.js";
-import { r as g } from "./reshape-ByE68wS9.js";
-import { s as b } from "./sum-DWAtNGez.js";
-function J(s, r, e) {
+import { q as i, u as a, $ as f, E as u, a_ as y, a$ as A, af as D, aZ as p, o as q, p as z, b as I, b0 as B, D as m, b1 as v, b2 as T, b3 as S, b4 as G, b5 as L, b6 as M, b7 as R, N as k, b8 as j, b9 as C, ba as P, bb as U, y as h, bc as Z, bd as F, be as H } from "./index-D0RBWjq8.js";
+import { b as _ } from "./broadcast_to-DDaNMbX7.js";
+import { e as J } from "./axis_util-DofAuy0p.js";
+import { m as E } from "./log_sum_exp-VLZgbFAH.js";
+import { r as g } from "./reshape-CkjKPPqB.js";
+import { s as b } from "./sum-BdplSvq_.js";
+function O(s, r, e) {
   const n = a(r, "a", "where"), t = a(e, "b", "where"), o = a(s, "condition", "where", "bool"), c = f(f(o.shape, n.shape), t.shape), d = _(o, c), $ = _(n, c), l = _(t, c), w = {
     condition: d,
     t: $,
@@ -12,36 +12,36 @@ function J(s, r, e) {
   };
   return u.runKernel(y, w);
 }
-const ge = /* @__PURE__ */ i({ where_: J });
-function O(s, r = null, e = !1) {
+const ge = /* @__PURE__ */ i({ where_: O });
+function Q(s, r = null, e = !1) {
   const t = { x: a(s, "x", "min") }, o = { axis: r, keepDims: e };
   return u.runKernel(A, t, o);
 }
-const K = /* @__PURE__ */ i({ min_: O });
-function Q(s, r = "euclidean", e = null, n = !1) {
+const N = /* @__PURE__ */ i({ min_: Q });
+function V(s, r = "euclidean", e = null, n = !1) {
   s = a(s, "x", "norm");
-  const t = N(s, r, e);
+  const t = K(s, r, e);
   let o = t.shape;
   if (n) {
-    const c = z(e, s.shape);
-    o = H(t.shape, c);
+    const c = D(e, s.shape);
+    o = J(t.shape, c);
   }
   return g(t, o);
 }
-function N(s, r, e = null) {
+function K(s, r, e = null) {
   if (s.rank === 0)
     return p(s);
   if (s.rank !== 1 && e === null)
-    return N(g(s, [-1]), r, e);
+    return K(g(s, [-1]), r, e);
   if (s.rank === 1 || typeof e == "number" || Array.isArray(e) && e.length === 1) {
     if (r === 1)
       return b(p(s), e);
     if (r === 1 / 0)
       return E(p(s), e);
     if (r === -1 / 0)
-      return K(p(s), e);
+      return N(p(s), e);
     if (r === "euclidean" || r === 2)
-      return q(b(D(p(s), B(2, "int32")), e));
+      return q(b(z(p(s), I(2, "int32")), e));
     throw new Error(`Error in norm: invalid ord value: ${r}`);
   }
   if (Array.isArray(e) && e.length === 2) {
@@ -50,28 +50,28 @@ function N(s, r, e = null) {
     if (r === 1 / 0)
       return E(b(p(s), e[1]), e[0]);
     if (r === -1 / 0)
-      return K(b(p(s), e[1]), e[0]);
+      return N(b(p(s), e[1]), e[0]);
     if (r === "fro" || r === "euclidean")
-      return q(b(I(s), e));
+      return q(b(B(s), e));
     throw new Error(`Error in norm: invalid ord value: ${r}`);
   }
   throw new Error(`Error in norm: invalid axis: ${e}`);
 }
-const de = /* @__PURE__ */ i({ norm_: Q });
-function V(s, r) {
+const de = /* @__PURE__ */ i({ norm_: V });
+function W(s, r) {
   let e = a(s, "a", "greater", "string_or_numeric"), n = a(r, "b", "greater", "string_or_numeric");
   [e, n] = m(e, n), f(e.shape, n.shape);
   const t = { a: e, b: n };
   return u.runKernel(v, t);
 }
-const $e = /* @__PURE__ */ i({ greater_: V });
-function W(s, r) {
+const $e = /* @__PURE__ */ i({ greater_: W });
+function X(s, r) {
   let e = a(s, "a", "greaterEqual", "string_or_numeric"), n = a(r, "b", "greaterEqual", "string_or_numeric");
   [e, n] = m(e, n), f(e.shape, n.shape);
   const t = { a: e, b: n };
   return u.runKernel(T, t);
 }
-const _e = /* @__PURE__ */ i({ greaterEqual_: W });
+const _e = /* @__PURE__ */ i({ greaterEqual_: X });
 function Y(s, r) {
   let e = a(s, "a", "less", "string_or_numeric"), n = a(r, "b", "less", "string_or_numeric");
   [e, n] = m(e, n), f(e.shape, n.shape);
@@ -83,12 +83,12 @@ function x(s, r) {
   let e = a(s, "a", "lessEqual", "string_or_numeric"), n = a(r, "b", "lessEqual", "string_or_numeric");
   [e, n] = m(e, n), f(e.shape, n.shape);
   const t = { a: e, b: n };
-  return u.runKernel(L, t);
+  return u.runKernel(G, t);
 }
 const qe = /* @__PURE__ */ i({ lessEqual_: x });
 function ee(s) {
   const e = { x: a(s, "x", "log1p") };
-  return u.runKernel(G, e);
+  return u.runKernel(L, e);
 }
 const ke = /* @__PURE__ */ i({ log1p_: ee });
 function ne(s, r) {
@@ -97,12 +97,12 @@ function ne(s, r) {
   const t = { a: e, b: n };
   return u.runKernel(M, t);
 }
-const Ke = /* @__PURE__ */ i({ logicalAnd_: ne });
+const Ne = /* @__PURE__ */ i({ logicalAnd_: ne });
 function re(s, r = null, e = !1) {
   const t = { x: a(s, "x", "mean") }, o = { axis: r, keepDims: e };
   return u.runKernel(R, t, o);
 }
-const Ne = /* @__PURE__ */ i({ mean_: re });
+const Ke = /* @__PURE__ */ i({ mean_: re });
 function se(s, r) {
   let e = a(s, "a", "minimum"), n = a(r, "b", "minimum");
   [e, n] = m(e, n), e.dtype === "bool" && (e = k(e, "int32"), n = k(n, "int32")), f(e.shape, n.shape);
@@ -128,48 +128,48 @@ function oe(s, r) {
   const t = { a: e, b: n }, o = {};
   return u.runKernel(U, t, o);
 }
-const ze = /* @__PURE__ */ i({ squaredDifference_: oe });
+const De = /* @__PURE__ */ i({ squaredDifference_: oe });
 function ie(s, r = 0) {
   const e = a(s, "x", "unstack", "string_or_numeric");
   h(r >= -e.shape.length && r < e.shape.length, () => `Axis = ${r} is not in [-${e.shape.length}, ${e.shape.length})`);
   const n = { value: e }, t = { axis: r };
-  return u.runKernel(X, n, t);
+  return u.runKernel(Z, n, t);
 }
-const De = /* @__PURE__ */ i({ unstack_: ie });
+const ze = /* @__PURE__ */ i({ unstack_: ie });
 function ue(s, r, e = !1, n = !1) {
   const t = a(s, "images", "resizeBilinear");
   h(t.rank === 3 || t.rank === 4, () => `Error in resizeBilinear: x must be rank 3 or 4, but got rank ${t.rank}.`), h(r.length === 2, () => `Error in resizeBilinear: new shape must 2D, but got shape ${r}.`), h(n === !1 || e === !1, () => "Error in resizeBilinear: If halfPixelCenters is true, alignCorners must be false.");
   let o = t, c = !1;
   t.rank === 3 && (c = !0, o = g(t, [1, t.shape[0], t.shape[1], t.shape[2]]));
-  const d = { images: o }, $ = { alignCorners: e, halfPixelCenters: n, size: r }, l = u.runKernel(Z, d, $);
+  const d = { images: o }, $ = { alignCorners: e, halfPixelCenters: n, size: r }, l = u.runKernel(F, d, $);
   return c ? g(l, [l.shape[1], l.shape[2], l.shape[3]]) : l;
 }
-const Be = /* @__PURE__ */ i({ resizeBilinear_: ue });
+const Ie = /* @__PURE__ */ i({ resizeBilinear_: ue });
 function le(s, r, e = !1, n = !1) {
   const t = a(s, "images", "resizeNearestNeighbor");
   h(t.rank === 3 || t.rank === 4, () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got rank ${t.rank}.`), h(r.length === 2, () => `Error in resizeNearestNeighbor: new shape must 2D, but got shape ${r}.`), h(t.dtype === "float32" || t.dtype === "int32", () => "`images` must have `int32` or `float32` as dtype"), h(n === !1 || e === !1, () => "Error in resizeNearestNeighbor: If halfPixelCenters is true, alignCorners must be false.");
   let o = t, c = !1;
   t.rank === 3 && (c = !0, o = g(t, [1, t.shape[0], t.shape[1], t.shape[2]]));
-  const d = { images: o }, $ = { alignCorners: e, halfPixelCenters: n, size: r }, l = u.runKernel(F, d, $);
+  const d = { images: o }, $ = { alignCorners: e, halfPixelCenters: n, size: r }, l = u.runKernel(H, d, $);
   return c ? g(l, [l.shape[1], l.shape[2], l.shape[3]]) : l;
 }
-const Ie = /* @__PURE__ */ i({ resizeNearestNeighbor_: le });
+const Be = /* @__PURE__ */ i({ resizeNearestNeighbor_: le });
 export {
   Ee as a,
-  Ke as b,
+  Ne as b,
   _e as c,
-  Ne as d,
+  Ke as d,
   ye as e,
   ke as f,
   $e as g,
-  Ie as h,
-  Be as i,
-  K as j,
+  Be as h,
+  Ie as i,
+  N as j,
   qe as l,
   we as m,
   de as n,
   Ae as r,
-  ze as s,
-  De as u,
+  De as s,
+  ze as u,
   ge as w
 };

package/dist/{rope-Ir4mTyD1.js → rope-BmZmp9uP.js}

@@ -1,4 +1,4 @@
-import { u as p, e as s } from "./index-DOvlwCh-.js";
+import { j as p, e as s } from "./index-D0RBWjq8.js";
 import "./ops/cpu/rope.js";
 import "./ops/webgl/rope.js";
 const u = {

package/dist/{scatter_nd_util-lvSiX8q4.js → scatter_nd_util-BY22Cc-C.js}

@@ -1,4 +1,4 @@
-import { h as p, ad as w } from "./index-DOvlwCh-.js";
+import { V as p, a9 as w } from "./index-D0RBWjq8.js";
 function k(o, t, r) {
   const n = t.rank > 1 ? t.shape[t.rank - 1] : 1, e = t.rank > 1 ? t.rank - 1 : 1, h = `Must have updates.shape = indices.shape[:batchDim] + shape[sliceDim:], got updates.shape: ${r.shape}, indices.shape: ${t.shape}, shape: ${o}, sliceDim: ${n}, and batchDim: ${e}.`;
   if (r.rank < e)

package/dist/{selu_util-kbhpTdYD.js → selu_util-BuLbmbrl.js}

@@ -1,8 +1,8 @@
-import { m as n, a4 as l } from "./index-DOvlwCh-.js";
-import { e as o, r as t, p as f, l as a, s as p, a as i } from "./step-CINUs5QB.js";
-import { r as m } from "./relu-CP0ZcxWO.js";
-import { r as d } from "./reshape-ByE68wS9.js";
-import { s as g } from "./sum-DWAtNGez.js";
+import { m as n, a0 as l } from "./index-D0RBWjq8.js";
+import { e as o, r as t, p as f, l as a, s as p, a as i } from "./step-dXR33iOg.js";
+import { r as m } from "./relu-Cf80uA2p.js";
+import { r as d } from "./reshape-CkjKPPqB.js";
+import { s as g } from "./sum-BdplSvq_.js";
 function L(e, r, s) {
   if (s == null || s === "linear")
     return e;

package/dist/{shared-DT1TkE6w.js → shared-B7USJZgw.js}

@@ -1,4 +1,4 @@
-import { s as l } from "./shared-dntlHIDQ.js";
+import { s as l } from "./shared-BQboIImQ.js";
 const { addImpl: m, bincountImpl: s, bincountReduceImpl: a, bitwiseAndImpl: I, castImpl: e, ceilImpl: t, concatImpl: r, equalImpl: i, expImpl: C, expm1Impl: P, floorImpl: U, gatherNdImpl: n, gatherV2Impl: g, greaterImpl: o, greaterEqualImpl: c, lessImpl: u, lessEqualImpl: d, linSpaceImpl: q, logImpl: R, maxImpl: h, maximumImpl: x, minimumImpl: b, multiplyImpl: E, negImpl: S, notEqualImpl: T, prodImpl: w, raggedGatherImpl: y, raggedRangeImpl: A, raggedTensorToTensorImpl: F, rangeImpl: G, rsqrtImpl: N, scatterImpl: f, sigmoidImpl: k, simpleAbsImpl: B, sliceImpl: H, sparseFillEmptyRowsImpl: K, sparseReshapeImpl: V, sparseSegmentReductionImpl: j, sqrtImpl: v, staticRegexReplaceImpl: z, stridedSliceImpl: D, stringNGramsImpl: J, stringSplitImpl: L, stringToHashBucketFastImpl: M, subImpl: O, tileImpl: Q, topKImpl: W, transposeImpl: X, uniqueImpl: Y } = l;
 export {
   b as A,