@genai-fi/nanogpt 0.10.2 → 0.11.0

package/dist/range-CuGvVN2c.js

@@ -0,0 +1,10 @@
+import { E as e, _ as f } from "./index-D0RBWjq8.js";
+function E(n, o, r = 1, a = "float32") {
+  if (r === 0)
+    throw new Error("Cannot have a step of zero");
+  const t = { start: n, stop: o, step: r, dtype: a };
+  return e.runKernel(f, {}, t);
+}
+export {
+  E as r
+};

package/dist/relu-Cf80uA2p.js

@@ -0,0 +1,9 @@
+import { q as o, u as e, E as s, I as t } from "./index-D0RBWjq8.js";
+function u(r) {
+  const n = { x: e(r, "x", "relu") };
+  return s.runKernel(t, n);
+}
+const l = /* @__PURE__ */ o({ relu_: u });
+export {
+  l as r
+};

package/dist/reshape-CkjKPPqB.js

@@ -0,0 +1,9 @@
+import { q as o, u as t, E as a, R as p } from "./index-D0RBWjq8.js";
+function c(r, s) {
+  const e = { x: t(r, "x", "reshape", "string_or_numeric") }, n = { shape: s };
+  return a.runKernel(p, e, n);
+}
+const x = /* @__PURE__ */ o({ reshape_: c });
+export {
+  x as r
+};

package/dist/resize_nearest_neighbor-DB8k9KN_.js

@@ -0,0 +1,175 @@
+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: $,
+    e: l
+  };
+  return u.runKernel(y, w);
+}
+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 N = /* @__PURE__ */ i({ min_: Q });
+function V(s, r = "euclidean", e = null, n = !1) {
+  s = a(s, "x", "norm");
+  const t = K(s, r, e);
+  let o = t.shape;
+  if (n) {
+    const c = D(e, s.shape);
+    o = J(t.shape, c);
+  }
+  return g(t, o);
+}
+function K(s, r, e = null) {
+  if (s.rank === 0)
+    return p(s);
+  if (s.rank !== 1 && e === null)
+    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 N(p(s), e);
+    if (r === "euclidean" || r === 2)
+      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) {
+    if (r === 1)
+      return E(b(p(s), e[0]), e[1] - 1);
+    if (r === 1 / 0)
+      return E(b(p(s), e[1]), e[0]);
+    if (r === -1 / 0)
+      return N(b(p(s), e[1]), e[0]);
+    if (r === "fro" || r === "euclidean")
+      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_: 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_: 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_: 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);
+  const t = { a: e, b: n };
+  return u.runKernel(S, t);
+}
+const Ee = /* @__PURE__ */ i({ less_: Y });
+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(G, t);
+}
+const qe = /* @__PURE__ */ i({ lessEqual_: x });
+function ee(s) {
+  const e = { x: a(s, "x", "log1p") };
+  return u.runKernel(L, e);
+}
+const ke = /* @__PURE__ */ i({ log1p_: ee });
+function ne(s, r) {
+  const e = a(s, "a", "logicalAnd", "bool"), n = a(r, "b", "logicalAnd", "bool");
+  f(e.shape, n.shape);
+  const t = { a: e, b: n };
+  return u.runKernel(M, t);
+}
+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 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);
+  const t = { a: e, b: n };
+  return u.runKernel(j, t);
+}
+const we = /* @__PURE__ */ i({ minimum_: se });
+function te(s, r) {
+  let e = a(s, "a", "notEqual", "string_or_numeric"), n = a(r, "b", "notEqual", "string_or_numeric");
+  [e, n] = m(e, n), f(e.shape, n.shape);
+  const t = { a: e, b: n };
+  return u.runKernel(C, t);
+}
+const ye = /* @__PURE__ */ i({ notEqual_: te });
+function ae(s) {
+  const e = { x: a(s, "x", "round") };
+  return u.runKernel(P, e);
+}
+const Ae = /* @__PURE__ */ i({ round_: ae });
+function oe(s, r) {
+  let e = a(s, "a", "squaredDifference"), n = a(r, "b", "squaredDifference");
+  [e, n] = m(e, n), f(e.shape, n.shape);
+  const t = { a: e, b: n }, o = {};
+  return u.runKernel(U, t, o);
+}
+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(Z, n, t);
+}
+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(F, d, $);
+  return c ? g(l, [l.shape[1], l.shape[2], l.shape[3]]) : l;
+}
+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(H, d, $);
+  return c ? g(l, [l.shape[1], l.shape[2], l.shape[3]]) : l;
+}
+const Be = /* @__PURE__ */ i({ resizeNearestNeighbor_: le });
+export {
+  Ee as a,
+  Ne as b,
+  _e as c,
+  Ke as d,
+  ye as e,
+  ke as f,
+  $e as g,
+  Be as h,
+  Ie as i,
+  N as j,
+  qe as l,
+  we as m,
+  de as n,
+  Ae as r,
+  De as s,
+  ze as u,
+  ge as w
+};

package/dist/rope-BmZmp9uP.js

@@ -0,0 +1,24 @@
+import { j as p, e as s } from "./index-D0RBWjq8.js";
+import "./ops/cpu/rope.js";
+import "./ops/webgl/rope.js";
+const u = {
+  kernelName: "Rope",
+  inputsToSave: [],
+  outputsToSave: [],
+  gradFunc: (e, n, r) => {
+    const { ropeCache: o } = r, a = i(e, o, 0, !0);
+    return { x: () => a };
+  }
+};
+p(u);
+function i(e, n, r, o = !1) {
+  return n.ensureRopeCache(e.shape[1] + r), s().runKernel("Rope", { x: e }, {
+    pastLen: r,
+    negSin: o,
+    ropeCache: n
+  });
+}
+export {
+  u as a,
+  i as r
+};

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

@@ -1,4 +1,4 @@
-import { s as p, i as w } from "./tensor-CzmOBsdf.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-BuLbmbrl.js

@@ -0,0 +1,44 @@
+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;
+  if (s === "relu")
+    return n(e, i(r));
+  throw new Error(`Cannot compute gradient for fused activation ${s}.`);
+}
+function S(e, r) {
+  let s = r;
+  const u = l(e.shape, r.shape);
+  return u.length > 0 && (s = g(s, u)), d(s, e.shape);
+}
+function k(e, r, s, u) {
+  if (r === "linear")
+    return e;
+  if (r === "relu")
+    return m(e);
+  if (r === "elu")
+    return o(e);
+  if (r === "relu6")
+    return t(e);
+  if (r === "prelu")
+    return f(e, s);
+  if (r === "leakyrelu")
+    return a(e, u);
+  if (r === "sigmoid")
+    return p(e);
+  throw new Error(`Unknown fused activation ${r}.`);
+}
+const C = (e, r) => !(e > 0) || r === "linear";
+const F = 1.7580993408473768, U = 1.0507009873554805;
+export {
+  U as S,
+  F as a,
+  k as b,
+  L as c,
+  S as g,
+  C as s
+};

package/dist/{shared-CHhxz-O5.js → shared-B7USJZgw.js}

@@ -1,4 +1,4 @@
-import { s as l } from "./shared-D2NP_CpY.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,