@genai-fi/nanogpt 0.19.1 → 0.20.1

package/dist/range-C-CjF-LI.js

@@ -1,10 +0,0 @@
-import { E as e, Z as f } from "./index-CUXkjxiT.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-J_X6MUzx.js

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

package/dist/reshape-BDOuCSNW.js

@@ -1,9 +0,0 @@
-import { o, q as t, E as a, R as p } from "./index-CUXkjxiT.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-BojqlfRe.js

@@ -1,150 +0,0 @@
-import { o, q as t, E as i, aZ as y, ah as K, a_ as c, l as E, p as A, a as D, n as z, B as g, _ as p, a$ as I, b0 as w, b1 as B, b2 as v, b3 as T, b4 as L, L as k, b5 as G, b6 as S, b7 as M, x as f, b8 as R, b9 as P, ba as U } from "./index-CUXkjxiT.js";
-import { e as Z } from "./axis_util-GTVlo58H.js";
-import { m as d } from "./not_equal-hurPF26l.js";
-import { r as b } from "./reshape-BDOuCSNW.js";
-import { s as h } from "./sum-BpiwSWvg.js";
-function j(s, r = null, e = !1) {
-  const a = { x: t(s, "x", "min") }, u = { axis: r, keepDims: e };
-  return i.runKernel(y, a, u);
-}
-const q = /* @__PURE__ */ o({ min_: j });
-function C(s, r = "euclidean", e = null, n = !1) {
-  s = t(s, "x", "norm");
-  const a = N(s, r, e);
-  let u = a.shape;
-  if (n) {
-    const m = K(e, s.shape);
-    u = Z(a.shape, m);
-  }
-  return b(a, u);
-}
-function N(s, r, e = null) {
-  if (s.rank === 0)
-    return c(s);
-  if (s.rank !== 1 && e === null)
-    return N(b(s, [-1]), r, e);
-  if (s.rank === 1 || typeof e == "number" || Array.isArray(e) && e.length === 1) {
-    if (r === 1)
-      return h(c(s), e);
-    if (r === 1 / 0)
-      return d(c(s), e);
-    if (r === -1 / 0)
-      return q(c(s), e);
-    if (r === "euclidean" || r === 2)
-      return E(h(A(c(s), D(2, "int32")), e));
-    throw new Error(`Error in norm: invalid ord value: ${r}`);
-  }
-  if (Array.isArray(e) && e.length === 2) {
-    if (r === 1)
-      return d(h(c(s), e[0]), e[1] - 1);
-    if (r === 1 / 0)
-      return d(h(c(s), e[1]), e[0]);
-    if (r === -1 / 0)
-      return q(h(c(s), e[1]), e[0]);
-    if (r === "fro" || r === "euclidean")
-      return E(h(z(s), e));
-    throw new Error(`Error in norm: invalid ord value: ${r}`);
-  }
-  throw new Error(`Error in norm: invalid axis: ${e}`);
-}
-const ie = /* @__PURE__ */ o({ norm_: C });
-function F(s, r) {
-  let e = t(s, "a", "greater", "string_or_numeric"), n = t(r, "b", "greater", "string_or_numeric");
-  [e, n] = g(e, n), p(e.shape, n.shape);
-  const a = { a: e, b: n };
-  return i.runKernel(I, a);
-}
-const ue = /* @__PURE__ */ o({ greater_: F });
-function H(s, r) {
-  let e = t(s, "a", "greaterEqual", "string_or_numeric"), n = t(r, "b", "greaterEqual", "string_or_numeric");
-  [e, n] = g(e, n), p(e.shape, n.shape);
-  const a = { a: e, b: n };
-  return i.runKernel(w, a);
-}
-const le = /* @__PURE__ */ o({ greaterEqual_: H });
-function J(s, r) {
-  let e = t(s, "a", "less", "string_or_numeric"), n = t(r, "b", "less", "string_or_numeric");
-  [e, n] = g(e, n), p(e.shape, n.shape);
-  const a = { a: e, b: n };
-  return i.runKernel(B, a);
-}
-const ce = /* @__PURE__ */ o({ less_: J });
-function O(s, r) {
-  let e = t(s, "a", "lessEqual", "string_or_numeric"), n = t(r, "b", "lessEqual", "string_or_numeric");
-  [e, n] = g(e, n), p(e.shape, n.shape);
-  const a = { a: e, b: n };
-  return i.runKernel(v, a);
-}
-const fe = /* @__PURE__ */ o({ lessEqual_: O });
-function Q(s) {
-  const e = { x: t(s, "x", "log1p") };
-  return i.runKernel(T, e);
-}
-const me = /* @__PURE__ */ o({ log1p_: Q });
-function V(s, r) {
-  const e = t(s, "a", "logicalAnd", "bool"), n = t(r, "b", "logicalAnd", "bool");
-  p(e.shape, n.shape);
-  const a = { a: e, b: n };
-  return i.runKernel(L, a);
-}
-const pe = /* @__PURE__ */ o({ logicalAnd_: V });
-function W(s, r) {
-  let e = t(s, "a", "minimum"), n = t(r, "b", "minimum");
-  [e, n] = g(e, n), e.dtype === "bool" && (e = k(e, "int32"), n = k(n, "int32")), p(e.shape, n.shape);
-  const a = { a: e, b: n };
-  return i.runKernel(G, a);
-}
-const he = /* @__PURE__ */ o({ minimum_: W });
-function X(s) {
-  const e = { x: t(s, "x", "round") };
-  return i.runKernel(S, e);
-}
-const be = /* @__PURE__ */ o({ round_: X });
-function Y(s, r) {
-  let e = t(s, "a", "squaredDifference"), n = t(r, "b", "squaredDifference");
-  [e, n] = g(e, n), p(e.shape, n.shape);
-  const a = { a: e, b: n }, u = {};
-  return i.runKernel(M, a, u);
-}
-const ge = /* @__PURE__ */ o({ squaredDifference_: Y });
-function x(s, r = 0) {
-  const e = t(s, "x", "unstack", "string_or_numeric");
-  f(r >= -e.shape.length && r < e.shape.length, () => `Axis = ${r} is not in [-${e.shape.length}, ${e.shape.length})`);
-  const n = { value: e }, a = { axis: r };
-  return i.runKernel(R, n, a);
-}
-const _e = /* @__PURE__ */ o({ unstack_: x });
-function ee(s, r, e = !1, n = !1) {
-  const a = t(s, "images", "resizeBilinear");
-  f(a.rank === 3 || a.rank === 4, () => `Error in resizeBilinear: x must be rank 3 or 4, but got rank ${a.rank}.`), f(r.length === 2, () => `Error in resizeBilinear: new shape must 2D, but got shape ${r}.`), f(n === !1 || e === !1, () => "Error in resizeBilinear: If halfPixelCenters is true, alignCorners must be false.");
-  let u = a, m = !1;
-  a.rank === 3 && (m = !0, u = b(a, [1, a.shape[0], a.shape[1], a.shape[2]]));
-  const _ = { images: u }, $ = { alignCorners: e, halfPixelCenters: n, size: r }, l = i.runKernel(P, _, $);
-  return m ? b(l, [l.shape[1], l.shape[2], l.shape[3]]) : l;
-}
-const $e = /* @__PURE__ */ o({ resizeBilinear_: ee });
-function re(s, r, e = !1, n = !1) {
-  const a = t(s, "images", "resizeNearestNeighbor");
-  f(a.rank === 3 || a.rank === 4, () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got rank ${a.rank}.`), f(r.length === 2, () => `Error in resizeNearestNeighbor: new shape must 2D, but got shape ${r}.`), f(a.dtype === "float32" || a.dtype === "int32", () => "`images` must have `int32` or `float32` as dtype"), f(n === !1 || e === !1, () => "Error in resizeNearestNeighbor: If halfPixelCenters is true, alignCorners must be false.");
-  let u = a, m = !1;
-  a.rank === 3 && (m = !0, u = b(a, [1, a.shape[0], a.shape[1], a.shape[2]]));
-  const _ = { images: u }, $ = { alignCorners: e, halfPixelCenters: n, size: r }, l = i.runKernel(U, _, $);
-  return m ? b(l, [l.shape[1], l.shape[2], l.shape[3]]) : l;
-}
-const de = /* @__PURE__ */ o({ resizeNearestNeighbor_: re });
-export {
-  ce as a,
-  pe as b,
-  le as c,
-  me as d,
-  de as e,
-  $e as f,
-  ue as g,
-  q as h,
-  fe as l,
-  he as m,
-  ie as n,
-  be as r,
-  ge as s,
-  _e as u
-};

package/dist/rope-DcrZM_e6.js

@@ -1,24 +0,0 @@
-import { e as p, h as s } from "./index-CUXkjxiT.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[2] + r), s().runKernel("Rope", { x: e }, {
-    pastLen: r,
-    negSin: o,
-    ropeCache: n
-  });
-}
-export {
-  u as a,
-  i as r
-};

package/dist/scatter_nd_util-ByNJaL6I.js

@@ -1,46 +0,0 @@
-import { U as p, a9 as w } from "./index-CUXkjxiT.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)
-    throw new Error(h + ` update.rank < ${e}. `);
-  if (o.length < n + (r.rank - e))
-    throw new Error(h + ` Output shape length < ${n + (r.rank - e)}`);
-  if (r.rank !== e + o.length - n)
-    throw new Error(h + ` update.rank != ${e + o.length - n}`);
-  for (let a = 0; a < e; ++a)
-    if (r.shape[a] !== t.shape[a])
-      throw new Error(h + ` updates.shape[${a}] (${r.shape[a]}) != indices.shape[${a}] (${t.shape[a]}).`);
-  for (let a = 0; a < r.rank - e; ++a)
-    if (r.shape[a + e] !== o[a + n])
-      throw new Error(h + ` updates.shape[${a + e}] (${r.shape[a + e]}) != shape[${a + e}] (${o[a + e]})`);
-}
-function $(o, t, r) {
-  if (t.rank < 1)
-    throw new Error(`tf.scatterND() expects the indices to be rank 1 or higher, but the rank was ${t.rank}.`);
-  if (o.rank < 1)
-    throw new Error(`tf.scatterND() expects the updates to be rank 1 or higher, but the rank was ${o.rank}.`);
-  if (t.dtype !== "int32")
-    throw new Error(`The dtype of 'indices' should be int32, but got dtype: ${t.dtype}`);
-  if (r.length < 1)
-    throw new Error(`Output rank must be greater or equal to 1, but got shape: ${r}`);
-  if (r.length === 0) {
-    if (t.size === 0)
-      throw new Error(`Indices specified for empty output. indices shape: ${t.shape}`);
-    if (o.size === 0)
-      throw new Error(`Updates specified for empty output. updates shape: ${o.shape}`);
-  }
-  k(r, t, o);
-}
-function m(o, t, r) {
-  const n = t.shape.length, e = n > 1 ? t.shape[n - 1] : 1, h = r.length;
-  let a = 1;
-  for (let s = e; s < h; ++s)
-    a *= r[s];
-  const i = e < 1 ? 1 : e, f = p(t.shape) / i, c = [...w(r.slice(0, e)), 1], l = p(r);
-  return { sliceRank: e, numUpdates: f, sliceSize: a, strides: c, outputSize: l };
-}
-export {
-  k as a,
-  m as c,
-  $ as v
-};

package/dist/segment_util-Dasb2Zaf.js

@@ -1,43 +0,0 @@
-import { P as w } from "./backend_util-GaFarB78.js";
-import { a8 as f } from "./index-CUXkjxiT.js";
-function g(o, s) {
-  let r = !1, t;
-  for (o <= w ? (t = o, r = !0) : t = f(o, Math.floor(Math.sqrt(o))); !r; )
-    t > s || t === o ? r = !0 : t = f(o, t + 1);
-  return t;
-}
-function c(o, s, r) {
-  const t = [], p = o.length;
-  for (let h = 0; h < p; h++)
-    h !== s ? t.push(o[h]) : t.push(r);
-  return t;
-}
-function O(o, s, r, t) {
-  const p = s.shape.length, h = o.shape.length;
-  if (t !== 0 && (t < -p || t > p))
-    throw new Error(`Expect batchDims in the range of [-${p}, ${p}], but got ${t}`);
-  if (t < 0 && (t += p), t > h)
-    throw new Error(`batchDims (${t}) must be less than rank(x) (
-    ${h}).`);
-  if (r < t)
-    throw new Error(`batchDims (${t}) must be less than or equal to axis (${r}).`);
-  for (let e = 0; e < t; ++e)
-    if (o.shape[e] !== s.shape[e])
-      throw new Error(`x.shape[${e}]: ${o.shape[e]} should be equal to indices.shape[${e}]: ${s.shape[e]}.`);
-  const $ = o.shape[r], l = [];
-  let a = 1, n = 1, u = 1;
-  for (let e = 0; e < t; ++e)
-    l.push(o.shape[e]), a *= o.shape[e];
-  for (let e = t; e < r; e++)
-    l.push(o.shape[e]), n *= o.shape[e];
-  for (let e = t; e < p; e++)
-    l.push(s.shape[e]);
-  for (let e = r + 1; e < h; e++)
-    l.push(o.shape[e]), u *= o.shape[e];
-  return { batchSize: a, sliceSize: u, outerSize: n, dimSize: $, outputShape: l };
-}
-export {
-  c as a,
-  O as c,
-  g as s
-};

package/dist/selu_util-BLhIqRkw.js

@@ -1,44 +0,0 @@
-import { m as n, $ as l } from "./index-CUXkjxiT.js";
-import { e as o, r as t, p as f, l as a, s as p, a as i } from "./step-BTxPtq1r.js";
-import { r as m } from "./relu-J_X6MUzx.js";
-import { r as d } from "./reshape-BDOuCSNW.js";
-import { s as g } from "./sum-BpiwSWvg.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-3agzAqQ_.js

@@ -1,53 +0,0 @@
-import { s as l } from "./shared-CagdqkLh.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,
-  O as B,
-  S as C,
-  w as D,
-  y as E,
-  A as F,
-  F as G,
-  G as H,
-  N as I,
-  k as J,
-  K,
-  V as L,
-  j as M,
-  f as N,
-  v as O,
-  z as P,
-  D as Q,
-  J as R,
-  L as S,
-  M as T,
-  Q as U,
-  W as V,
-  Y as W,
-  E as a,
-  m as b,
-  H as c,
-  s as d,
-  I as e,
-  e as f,
-  t as g,
-  r as h,
-  a as i,
-  i as j,
-  C as k,
-  P as l,
-  h as m,
-  T as n,
-  U as o,
-  n as p,
-  g as q,
-  o as r,
-  B as s,
-  X as t,
-  c as u,
-  u as v,
-  d as w,
-  q as x,
-  R as y,
-  x as z
-};