@genai-fi/nanogpt 0.10.1 → 0.10.3

package/dist/tile-mbfagpsB.js

@@ -0,0 +1,11 @@
+import { A as e, B as a, l as i, E as c, T as l } from "./index-DOvlwCh-.js";
+function u(r, t) {
+  const n = a(r, "x", "tile", "string_or_numeric");
+  i(n.rank === t.length, () => `Error in transpose: rank of input ${n.rank} must match length of reps ${t}.`);
+  const s = { x: n }, o = { reps: t };
+  return c.runKernel(l, s, o);
+}
+const p = /* @__PURE__ */ e({ tile_: u });
+export {
+  p 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-ZyQhjEPo.js";
-import { z as M } from "../zeros-2gldETuK.js";
+import { O as g, e as h, t as o, d as B } from "../index-DOvlwCh-.js";
+import { z as M } from "../zeros-KnWaWf-X.js";
 class R extends g {
   constructor(t, a, e, s, i = null) {
     super(), this.learningRate = t, this.beta1 = a, this.beta2 = e, this.lossScaling = s, this.epsilon = i, this.accBeta1 = a, this.accBeta2 = e, i === null && (this.epsilon = h().backend.epsilon());

package/dist/training/AdamExt.js

@@ -1,4 +1,4 @@
-import { m as r, b as c, c as h, e as o } from "../index-ZyQhjEPo.js";
+import { m as r, b as c, c as h, e as o } from "../index-DOvlwCh-.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-ZyQhjEPo.js";
-import { d as u, i as d } from "../dataset-0xP8GjwI.js";
+import { t as g } from "../index-DOvlwCh-.js";
+import { d as u, i as d } from "../dataset-BcwmTGYc.js";
 import "../index-Cp39cXWe.js";
 function z(r) {
   return u(async () => {

package/dist/training/FullTrainer.js

@@ -1,6 +1,6 @@
 import b from "./Trainer.js";
 import L from "./Evaluator.js";
-import { d as w } from "../index-ZyQhjEPo.js";
+import { d as w } from "../index-DOvlwCh-.js";
 import y from "../utilities/profile.js";
 import { createTensorStatistics as D } from "../checks/weights.js";
 const T = {

package/dist/training/Trainer.js

@@ -1,7 +1,7 @@
 import { DatasetBuilder as f, flattenTokens as h, PAGE_FACTOR as y } from "./DatasetBuilder.js";
 import z from "./AdamExt.js";
-import { t as S, v as k, k as x, d as p, b as m } from "../index-ZyQhjEPo.js";
-import { z as g } from "../zeros-2gldETuK.js";
+import { t as S, v as k, k as x, d as p, b as m } from "../index-DOvlwCh-.js";
+import { z as g } from "../zeros-KnWaWf-X.js";
 class M {
   constructor(t, e, s = 1e-3) {
     this.tokenizer = e, this.model = t, this.lossScaling = t.lossScaling, this.learningRate = s, this.resetOptimizer(), this.datasetBuilder = new f(e, t.config.blockSize);

package/dist/training/sparseCrossEntropy.js

@@ -1,15 +1,15 @@
 import { gatherSub as x } from "../ops/gatherSub.js";
 import { scatterSub as L } from "../ops/scatterSub.js";
-import { w as C, t as u, z as E, c as G } from "../index-ZyQhjEPo.js";
-import { s as y } from "../softmax-ZHVebtR1.js";
-import { m as z, l as v } from "../log_sum_exp-DWI-76TI.js";
+import { a6 as C, t as u, a7 as E, c as G } from "../index-DOvlwCh-.js";
+import { s as y } from "../softmax-CA5jFsLR.js";
+import { m as z, l as v } from "../log_sum_exp-ngO0-4pK.js";
 function k(t, s) {
   return u(() => {
     const n = t.shape[t.shape.length - 1], c = t.shape.slice(0, -1).reduce((o, e) => o * e, 1), h = t.shape.length > 2 ? t.reshape([c, n]) : t, p = s.shape.length > 1 ? s.reshape([c]).cast("int32") : s.cast("int32"), r = z(h, -1, !0), a = G(h, r), d = v(a, -1);
     return x(d, p, a);
   });
 }
-function q() {
+function w() {
   return C(
     // @ts-expect-error Invalid params
     (s, n, m) => {
@@ -22,6 +22,6 @@ function q() {
   );
 }
 export {
-  q as createSoftmaxCrossEntropyWithGrad,
+  w as createSoftmaxCrossEntropyWithGrad,
   k as sparseSoftmaxCrossEntropy
 };

package/dist/transpose-ClWiBS_b.js

@@ -0,0 +1,36 @@
+import { A as u, B as i, E as o, ap as $, aq as g, ar as m, l, t as x, as as p } from "./index-DOvlwCh-.js";
+import { c as k } from "./complex-DjxcVmoX.js";
+function K(r) {
+  const e = { input: i(r, "input", "imag") };
+  return o.runKernel($, e);
+}
+const h = /* @__PURE__ */ u({ imag_: K });
+function E(r) {
+  const e = { x: i(r, "x", "neg") };
+  return o.runKernel(g, e);
+}
+const _ = /* @__PURE__ */ u({ neg_: E });
+function b(r) {
+  const e = { input: i(r, "input", "real") };
+  return o.runKernel(m, e);
+}
+const d = /* @__PURE__ */ u({ real_: b });
+function N(r, t, e) {
+  const n = i(r, "x", "transpose");
+  if (t == null && (t = n.shape.map((s, a) => a).reverse()), l(n.rank === t.length, () => `Error in transpose: rank of input ${n.rank} must match length of perm ${t}.`), t.forEach((s) => {
+    l(s >= 0 && s < n.rank, () => `All entries in 'perm' must be between 0 and ${n.rank - 1} but got ${t}`);
+  }), n.rank <= 1)
+    return n.clone();
+  const f = { x: n }, c = { perm: t };
+  return n.dtype === "complex64" ? x(() => {
+    let s = d(n), a = h(n);
+    return s = o.runKernel(p, { x: s }, c), a = o.runKernel(p, { x: a }, c), e && (a = _(a)), k(s, a);
+  }) : o.runKernel(p, f, c);
+}
+const y = /* @__PURE__ */ u({ transpose_: N });
+export {
+  h as i,
+  _ as n,
+  d as r,
+  y as t
+};

package/dist/unsorted_segment_sum-BDDhB_E6.js

@@ -0,0 +1,277 @@
+import { A as h, B as c, E as d, bo as T, bp as q, bq as H, l, br as P, X as _, bs as y, bt as B, bu as I, bv as W, bw as A, bx as G, by as L, bz as O, bA as z, bB as F, L as M, a3 as j, bC as J, bD as Q, bE as U, a6 as V, c as N, m as X, bF as Y, bG as Z, bH as R, bI as nn, bJ as tn, bK as sn, bL as en, bM as rn, bN as on, bO as an, bP as un, aG as cn, bQ as ln } from "./index-DOvlwCh-.js";
+import { k as C, c as g, m as D } from "./step-CINUs5QB.js";
+import { r as b } from "./reshape-ByE68wS9.js";
+import { m as pn, a as hn, e as w } from "./log_sum_exp-ngO0-4pK.js";
+import { s as K } from "./sum-DWAtNGez.js";
+function fn(s, n = null, t = !1) {
+  const i = { x: c(s, "x", "all", "bool") }, o = { axis: n, keepDims: t };
+  return d.runKernel(T, i, o);
+}
+const nt = /* @__PURE__ */ h({ all_: fn });
+function dn(s, n = null, t = !1) {
+  const i = { x: c(s, "x", "any", "bool") }, o = { axis: n, keepDims: t };
+  return d.runKernel(q, i, o);
+}
+const tt = /* @__PURE__ */ h({ any_: dn });
+function mn(s, n = 0) {
+  const e = { x: c(s, "x", "argMax") }, i = { axis: n };
+  return d.runKernel(H, e, i);
+}
+const st = /* @__PURE__ */ h({ argMax_: mn });
+function $n(s, n, t, e, i) {
+  const o = c(s, "x", "avgPool", "float32"), p = 1;
+  l(C(t, p), () => `Error in avgPool: Either strides or dilations must be 1. Got strides ${t} and dilations '${p}'`);
+  let r = o, a = !1;
+  o.rank === 3 && (a = !0, r = b(o, [1, o.shape[0], o.shape[1], o.shape[2]])), l(r.rank === 4, () => `Error in avgPool: x must be rank 4 but got rank ${r.rank}.`), g("avgPool", e, i);
+  const u = { x: r }, m = { filterSize: n, strides: t, pad: e, dimRoundingMode: i };
+  let f = d.runKernel(P, u, m);
+  return f = _(f, o.dtype), a ? b(f, [f.shape[1], f.shape[2], f.shape[3]]) : f;
+}
+const et = /* @__PURE__ */ h({ avgPool_: $n });
+function bn(s) {
+  const t = { x: c(s, "x", "tanh", "float32") };
+  return d.runKernel(y, t);
+}
+const rt = /* @__PURE__ */ h({ tanh_: bn });
+function xn(s, n, t) {
+  const e = c(s, "x", "batchToSpaceND"), i = n.reduce((r, a) => r * a);
+  l(e.rank >= 1 + n.length, () => `input rank is ${e.rank} but should be > than blockShape.length ${n.length}`), l(t.length === n.length, () => `crops.length is ${t.length} but should be equal to blockShape.length  ${n.length}`), l(e.shape[0] % i === 0, () => `input tensor batch is ${e.shape[0]} but is not divisible by the product of the elements of blockShape ${n.join(" * ")} === ${i}`);
+  const o = { x: e }, p = { blockShape: n, crops: t };
+  return d.runKernel(B, o, p);
+}
+const ot = /* @__PURE__ */ h({ batchToSpaceND_: xn });
+function kn(s) {
+  let n;
+  return s.rank === 0 || s.rank === 1 ? n = b(s, [1, 1, 1, s.size]) : s.rank === 2 ? n = b(s, [1, 1, s.shape[0], s.shape[1]]) : s.rank === 3 ? n = b(s, [1, s.shape[0], s.shape[1], s.shape[2]]) : n = s, n;
+}
+function vn(s, n, t, e, i, o) {
+  o == null && (o = 1e-3);
+  const p = c(s, "x", "batchNorm"), r = c(n, "mean", "batchNorm"), a = c(t, "variance", "batchNorm");
+  let u;
+  i != null && (u = c(i, "scale", "batchNorm"));
+  let m;
+  e != null && (m = c(e, "offset", "batchNorm")), l(r.rank === a.rank, () => "Batch normalization gradient requires mean and variance to have equal ranks."), l(m == null || r.rank === m.rank, () => "Batch normalization gradient requires mean and offset to have equal ranks."), l(u == null || r.rank === u.rank, () => "Batch normalization gradient requires mean and scale to have equal ranks.");
+  const x = {
+    x: kn(p),
+    scale: u,
+    offset: m,
+    mean: r,
+    variance: a
+  }, k = { varianceEpsilon: o }, $ = d.runKernel(I, x, k);
+  return b($, p.shape);
+}
+const at = /* @__PURE__ */ h({ batchNorm_: vn });
+function gn(s, n, t, e, i = "NHWC", o = [1, 1], p) {
+  const r = c(s, "x", "conv2d", "float32"), a = c(n, "filter", "conv2d", "float32");
+  let u = r, m = !1;
+  r.rank === 3 && (m = !0, u = b(r, [1, r.shape[0], r.shape[1], r.shape[2]])), l(u.rank === 4, () => `Error in conv2d: input must be rank 4, but got rank ${u.rank}.`), l(a.rank === 4, () => `Error in conv2d: filter must be rank 4, but got rank ${a.rank}.`), g("conv2d", e, p);
+  const f = i === "NHWC" ? u.shape[3] : u.shape[1];
+  l(f === a.shape[2], () => `Error in conv2d: depth of input (${f}) must match input depth for filter ${a.shape[2]}.`), l(C(t, o), () => `Error in conv2D: Either strides or dilations must be 1. Got strides ${t} and dilations '${o}'`), l(D(o), () => "Error in conv2D: Dilated rates should be larger than 0."), l(D(t), () => "Error in conv2D: Strides should be larger than 0.");
+  const x = { x: u, filter: a }, k = { strides: t, pad: e, dataFormat: i, dilations: o, dimRoundingMode: p }, $ = d.runKernel(W, x, k);
+  return m ? b($, [$.shape[1], $.shape[2], $.shape[3]]) : $;
+}
+const S = /* @__PURE__ */ h({ conv2d_: gn });
+function Dn(s, n, t, e, i = "NWC", o = 1, p) {
+  const r = c(s, "x", "conv1d"), a = c(n, "filter", "conv1d");
+  let u = r, m = !1;
+  r.rank === 2 && (m = !0, u = b(r, [1, r.shape[0], r.shape[1]])), l(u.rank === 3, () => `Error in conv1d: input must be rank 3, but got rank ${u.rank}.`), l(a.rank === 3, () => `Error in conv1d: filter must be rank 3, but got rank ${a.rank}.`), g("conv1d", e, p), l(u.shape[2] === a.shape[1], () => `Error in conv1d: depth of input (${u.shape[2]}) must match input depth for filter ${a.shape[1]}.`), l(C(t, o), () => `Error in conv1D: Either stride or dilation must be 1. Got stride ${t} and dilation '${o}'`), l(D(o), () => "Error in conv1D: Dilated rates should be larger than 0."), l(D(t), () => "Error in conv1D: Stride should be larger than 0."), l(i === "NWC", () => `Error in conv1d: got dataFormat of ${i} but only NWC is currently supported.`);
+  const f = b(a, [1, a.shape[0], a.shape[1], a.shape[2]]), x = b(u, [u.shape[0], 1, u.shape[1], u.shape[2]]), v = S(x, f, [1, t], e, "NHWC", [1, o], p);
+  return m ? b(v, [v.shape[2], v.shape[3]]) : b(v, [v.shape[0], v.shape[2], v.shape[3]]);
+}
+const it = /* @__PURE__ */ h({ conv1d_: Dn });
+function Cn(s, n, t, e, i, o = "NHWC", p) {
+  l(s.length === n.rank, () => `Length of inShape (${s.length}) and rank of dy (${n.rank}) must match`);
+  let r = s, a = n, u = !1;
+  n.rank === 3 && (u = !0, a = b(n, [1, n.shape[0], n.shape[1], n.shape[2]]), r = [1, s[0], s[1], s[2]]), l(r.length === 4, () => `Error in conv2dDerInput: inShape must be length 4, but got length ${r.length}.`), l(a.rank === 4, () => `Error in conv2dDerInput: dy must be rank 4, but got rank ${a.rank}`), l(t.rank === 4, () => `Error in conv2dDerInput: filter must be rank 4, but got rank ${t.rank}`);
+  const m = o === "NHWC" ? r[3] : r[1], f = o === "NHWC" ? a.shape[3] : a.shape[1];
+  l(m === t.shape[2], () => `Error in conv2dDerInput: depth of input (${m}) must match input depth for filter ${t.shape[2]}.`), l(f === t.shape[3], () => `Error in conv2dDerInput: depth of output (${f}) must match output depth for filter ${t.shape[3]}.`), g("conv2dDerInput", i, p);
+  const x = { dy: a, filter: t }, k = { strides: e, pad: i, dataFormat: o, dimRoundingMode: p, inputShape: r }, $ = d.runKernel(A, x, k);
+  return u ? b($, [$.shape[1], $.shape[2], $.shape[3]]) : $;
+}
+const En = /* @__PURE__ */ h({ conv2DBackpropInput_: Cn });
+function Nn(s, n, t, e, i, o) {
+  const p = c(s, "x", "conv2dTranspose"), r = c(n, "filter", "conv2dTranspose");
+  return En(t, p, r, e, i, "NHWC", o);
+}
+const ut = /* @__PURE__ */ h({ conv2dTranspose_: Nn });
+function _n(s) {
+  const t = { x: c(s, "x", "cos", "float32") };
+  return d.runKernel(G, t);
+}
+const ct = /* @__PURE__ */ h({ cos_: _n });
+function wn(s) {
+  const t = { x: c(s, "x", "cosh", "float32") };
+  return d.runKernel(L, t);
+}
+const lt = /* @__PURE__ */ h({ cosh_: wn });
+function Kn(s, n = 0, t = !1, e = !1) {
+  const o = { x: c(s, "x", "cumprod") }, p = { axis: n, exclusive: t, reverse: e };
+  return d.runKernel(O, o, p);
+}
+const pt = /* @__PURE__ */ h({ cumprod_: Kn });
+function Sn(s, n = 0, t = !1, e = !1) {
+  const o = { x: c(s, "x", "cumsum") }, p = { axis: n, exclusive: t, reverse: e };
+  return d.runKernel(z, o, p);
+}
+const ht = /* @__PURE__ */ h({ cumsum_: Sn });
+function Tn(s, n, t, e, i = "NHWC", o = [1, 1], p) {
+  const r = c(s, "x", "depthwiseConv2d", "float32"), a = c(n, "filter", "depthwiseConv2d", "float32");
+  let u = r, m = !1;
+  r.rank === 3 && (m = !0, u = b(r, [1, r.shape[0], r.shape[1], r.shape[2]])), l(u.rank === 4, () => `Error in depthwiseConv2d: input must be rank 4, but got rank ${u.rank}.`), l(a.rank === 4, () => `Error in depthwiseConv2d: filter must be rank 4, but got rank ${a.rank}.`);
+  const f = i === "NHWC" ? u.shape[3] : u.shape[1];
+  l(f === a.shape[2], () => `Error in depthwiseConv2d: number of input channels (${f}) must match the inChannels dimension in filter ${a.shape[2]}.`), g("depthwiseConv2d", e, p);
+  const x = { x: u, filter: a }, k = { strides: t, pad: e, dataFormat: i, dilations: o, dimRoundingMode: p }, $ = d.runKernel(F, x, k);
+  return m ? b($, [$.shape[1], $.shape[2], $.shape[3]]) : $;
+}
+const qn = /* @__PURE__ */ h({ depthwiseConv2d_: Tn });
+function Hn(s, n) {
+  let t = c(s, "a", "equal", "string_or_numeric"), e = c(n, "b", "equal", "string_or_numeric");
+  [t, e] = M(t, e), j(t.shape, e.shape);
+  const i = { a: t, b: e };
+  return d.runKernel(J, i);
+}
+const ft = /* @__PURE__ */ h({ equal_: Hn });
+function Pn(s) {
+  let n = c(s, "x", "erf");
+  l(n.dtype === "int32" || n.dtype === "float32", () => "Input dtype must be `int32` or `float32`."), n.dtype === "int32" && (n = _(n, "float32"));
+  const t = { x: n };
+  return d.runKernel(Q, t);
+}
+const dt = /* @__PURE__ */ h({ erf_: Pn });
+function yn(s) {
+  const t = { x: c(s, "x", "softplus") };
+  return d.runKernel(U, t);
+}
+const mt = /* @__PURE__ */ h({ softplus_: yn });
+function Bn(s, n = -1) {
+  const t = c(s, "logits", "logSoftmax");
+  if (n === -1 && (n = t.rank - 1), n !== t.rank - 1)
+    throw Error(`Log Softmax along a non-last dimension is not yet supported. Logits was rank ${t.rank} and axis was ${n}`);
+  return V((i, o) => {
+    const r = pn(i, n, !0), a = N(i, r), u = N(_(a, "float32"), hn(K(w(a), n, !0)));
+    return o([u]), { value: u, gradFunc: (f, x) => {
+      const [k] = x, $ = !0, E = w(k);
+      return N(f, X(K(f, n, $), E));
+    } };
+  })(t);
+}
+const $t = /* @__PURE__ */ h({ logSoftmax_: Bn });
+function In(s) {
+  const t = { x: c(s, "x", "logicalNot", "bool") };
+  return d.runKernel(Y, t);
+}
+const bt = /* @__PURE__ */ h({ logicalNot_: In });
+function Wn(s, n, t, e, i) {
+  const o = c(s, "x", "maxPool"), p = 1;
+  let r = o, a = !1;
+  o.rank === 3 && (a = !0, r = b(o, [1, o.shape[0], o.shape[1], o.shape[2]])), l(r.rank === 4, () => `Error in maxPool: input must be rank 4 but got rank ${r.rank}.`), l(C(t, p), () => `Error in maxPool: Either strides or dilations must be 1. Got strides ${t} and dilations '${p}'`), g("maxPool", e, i);
+  const u = { x: r }, m = { filterSize: n, strides: t, pad: e, dimRoundingMode: i }, f = d.runKernel(Z, u, m);
+  return a ? b(f, [f.shape[1], f.shape[2], f.shape[3]]) : f;
+}
+const xt = /* @__PURE__ */ h({ maxPool_: Wn });
+function An(s, n, t = 1, e = 0, i = "int32") {
+  if (n < 2)
+    throw new Error(`Error in oneHot: depth must be >=2, but it is ${n}`);
+  const p = { indices: c(s, "indices", "oneHot", "int32") }, r = { dtype: i, depth: n, onValue: t, offValue: e };
+  return d.runKernel(R, p, r);
+}
+const kt = /* @__PURE__ */ h({ oneHot_: An });
+function Gn(s) {
+  const t = { x: c(s, "x", "onesLike") };
+  return d.runKernel(nn, t);
+}
+const vt = /* @__PURE__ */ h({ onesLike_: Gn });
+function Ln(s, n, t = 0) {
+  const e = c(s, "x", "pad");
+  if (e.rank === 0)
+    throw new Error("pad(scalar) is not defined. Pass non-scalar to pad");
+  const i = { paddings: n, constantValue: t }, o = { x: e };
+  return d.runKernel(tn, o, i);
+}
+const gt = /* @__PURE__ */ h({ pad_: Ln });
+function On(s, n, t) {
+  const e = c(s, "x", "spaceToBatchND");
+  l(e.rank >= 1 + n.length, () => `input rank ${e.rank} should be > than [blockShape] ${n.length}`), l(t.length === n.length, () => `paddings.shape[0] ${t.length} must be equal to [blockShape] ${n.length}`), l(e.shape.reduce((p, r, a) => a > 0 && a <= n.length ? p && (r + t[a - 1][0] + t[a - 1][1]) % n[a - 1] === 0 : p, !0), () => `input spatial dimensions ${e.shape.slice(1)} with paddings ${t.toString()} must be divisible by blockShapes ${n.toString()}`);
+  const i = { x: e }, o = { blockShape: n, paddings: t };
+  return d.runKernel(sn, i, o);
+}
+const Dt = /* @__PURE__ */ h({ spaceToBatchND_: On });
+function zn(s, n) {
+  const e = { x: c(s, "x", "reverse") }, i = { dims: n };
+  return d.runKernel(en, e, i);
+}
+const Ct = /* @__PURE__ */ h({ reverse_: zn });
+function Fn(s) {
+  const t = { x: c(s, "x", "rsqrt", "float32") };
+  return d.runKernel(rn, t);
+}
+const Et = /* @__PURE__ */ h({ rsqrt_: Fn });
+function Mn(s) {
+  const t = { x: c(s, "x", "selu") };
+  return d.runKernel(on, t);
+}
+const Nt = /* @__PURE__ */ h({ selu_: Mn });
+function jn(s, n, t, e, i, o = [1, 1], p = "NHWC") {
+  const r = c(s, "x", "separableConv2d"), a = c(n, "depthwiseFilter", "separableConv2d"), u = c(t, "pointwiseFilter", "separableConv2d");
+  let m = r, f = !1;
+  if (r.rank === 3 && (f = !0, m = b(r, [1, r.shape[0], r.shape[1], r.shape[2]])), p === "NCHW")
+    throw new Error("separableConv2d currently does not support dataFormat NCHW; only NHWC is supported");
+  l(m.rank === 4, () => `Error in separableConv2d: input must be rank 4, but got rank ${m.rank}.`), l(a.rank === 4, () => `Error in separableConv2d: depthwise filter must be rank 4, but got rank ${a.rank}.`), l(u.rank === 4, () => `Error in separableConv2d: pointwise filter must be rank 4, but got rank ${a.rank}.`), l(u.shape[0] === 1, () => `Error in separableConv2d: the first dimension of pointwise filter  must be 1, but got ${u.shape[0]}.`), l(u.shape[1] === 1, () => `Error in separableConv2d: the second dimension of pointwise filter must be 1, but got ${u.shape[1]}.`);
+  const x = a.shape[2], k = a.shape[3];
+  l(u.shape[2] === x * k, () => `Error in separableConv2d: the third dimension of pointwise filter must be ${x * k}, but got ${u.shape[2]}.`);
+  const $ = qn(m, a, e, i, p, o), v = S($, u, 1, "valid", p);
+  return f ? b(v, [v.shape[1], v.shape[2], v.shape[3]]) : v;
+}
+const _t = /* @__PURE__ */ h({ separableConv2d_: jn });
+function Jn(s) {
+  const t = { x: c(s, "x", "sin", "float32") };
+  return d.runKernel(an, t);
+}
+const wt = /* @__PURE__ */ h({ sin_: Jn });
+function Qn(s) {
+  const t = { x: c(s, "x", "sinh") };
+  return d.runKernel(un, t);
+}
+const Kt = /* @__PURE__ */ h({ sinh_: Qn });
+function Un(s, n, t) {
+  const e = c(s, "x", "unsortedSegmentSum"), i = c(n, "segmentIds", "unsortedSegmentSum", "int32");
+  l(cn(t), () => "numSegments must be of dtype int");
+  const o = { x: e, segmentIds: i }, p = { numSegments: t };
+  return d.runKernel(ln, o, p);
+}
+const St = /* @__PURE__ */ h({ unsortedSegmentSum_: Un });
+export {
+  Et as A,
+  Nt as B,
+  _t as C,
+  Kt as D,
+  rt as E,
+  St as F,
+  En as G,
+  mt as a,
+  Dt as b,
+  ct as c,
+  et as d,
+  ft as e,
+  ot as f,
+  nt as g,
+  tt as h,
+  st as i,
+  at as j,
+  it as k,
+  bt as l,
+  xt as m,
+  ut as n,
+  S as o,
+  lt as p,
+  pt as q,
+  Ct as r,
+  wt as s,
+  ht as t,
+  qn as u,
+  dt as v,
+  $t as w,
+  kt as x,
+  vt as y,
+  gt as z
+};

package/dist/utilities/dummy.js

@@ -1,6 +1,6 @@
-import { a as y, e as S, v as w } from "../index-ZyQhjEPo.js";
-import { z as m } from "../zeros-2gldETuK.js";
-import { o as P } from "../ones-CAMiP4I2.js";
+import { a as y, e as S, v as w } from "../index-DOvlwCh-.js";
+import { z as m } from "../zeros-KnWaWf-X.js";
+import { o as P } from "../ones-D2rT0xk2.js";
 async function b(s) {
   const t = m([1, s.config.blockSize], "int32"), [n, o] = s.forward({ training: !1 }, t);
   await n.data(), n.dispose(), o && o.dispose(), t.dispose();

package/dist/utilities/multinomialCPU.js

@@ -1,5 +1,5 @@
-import "../index-ZyQhjEPo.js";
-import { t as e } from "../tensor2d-G4Ys2GxX.js";
+import "../index-DOvlwCh-.js";
+import { t as e } from "../tensor2d-Bs9wZRc7.js";
 function l(n) {
   let r = 0;
   const i = Math.random();

package/dist/utilities/packed.d.ts

@@ -1,7 +1,4 @@
-import { PackableTensor } from '../patches/PackedTensor';
 import { Tensor } from '@tensorflow/tfjs-core';
 export declare function packingSupported(): boolean;
-export declare function isPackableTensor(tensor: Tensor): tensor is PackableTensor;
+export declare function isPackableTensor(tensor: Tensor): boolean;
 export declare function isPackedTensor(tensor: Tensor): boolean;
-export declare function packTensor(tensor: Tensor): Tensor;
-export declare function unpackTensor(tensor: Tensor): Tensor;