@genai-fi/nanogpt 0.5.6 → 0.6.1

package/dist/{zeros-BaHhQTWf.js → zeros-DUkkVccu.js}

@@ -1,4 +1,4 @@
-import { o as m, j as r, X as l, E as c, Y as i, n as p, Z as u, q as f } from "./index-Du-bmOP8.js";
+import { q as m, w as r, Z as l, E as c, _ as i, y as p, $ as u, i as f } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -16,9 +16,9 @@ import { o as m, j as r, X as l, E as c, Y as i, n as p, Z as u, q as f } from "
  * =============================================================================
  */
 function x(a, e) {
-  const o = r(a, "real", "complex"), s = r(e, "imag", "complex");
-  l(o.shape, s.shape, `real and imag shapes, ${o.shape} and ${s.shape}, must match in call to tf.complex().`);
-  const n = { real: o, imag: s };
+  const s = r(a, "real", "complex"), o = r(e, "imag", "complex");
+  l(s.shape, o.shape, `real and imag shapes, ${s.shape} and ${o.shape}, must match in call to tf.complex().`);
+  const n = { real: s, imag: o };
   return c.runKernel(i, n);
 }
 const g = /* @__PURE__ */ m({ complex_: x });
@@ -40,11 +40,11 @@ const g = /* @__PURE__ */ m({ complex_: x });
  */
 function t(a, e = "float32") {
   if (p(a), e === "complex64") {
-    const s = t(a, "float32"), n = t(a, "float32");
-    return g(s, n);
+    const o = t(a, "float32"), n = t(a, "float32");
+    return g(o, n);
   }
-  const o = u(f(a), e);
-  return c.makeTensor(o, a, e);
+  const s = u(f(a), e);
+  return c.makeTensor(s, a, e);
 }
 export {
   g as c,

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@genai-fi/nanogpt",
-    "version": "0.5.6",
+    "version": "0.6.1",
     "type": "module",
     "main": "dist/main.js",
     "types": "dist/main.d.ts",
@@ -24,18 +24,11 @@
         "test:gl": "playwright test",
         "ci:test": "vitest --coverage --reporter=junit --outputFile=junit.xml",
         "coverage": "vitest run --coverage",
-        "train": "tsx scripts/train.ts",
-        "generate": "tsx scripts/generate.ts",
-        "evaluate": "tsx scripts/evaluate.ts",
         "debug": "tsx scripts/debug.ts"
     },
-    "peerDependencies": {
-        "@tensorflow/tfjs": "^4.22.0"
-    },
     "devDependencies": {
         "@eslint/js": "^9.32.0",
         "@playwright/test": "^1.55.0",
-        "@tensorflow/tfjs-node-gpu": "^4.22.0",
         "@types/node": "^22.13.14",
         "@types/papaparse": "^5.3.16",
         "@types/yargs": "^17.0.33",
@@ -59,6 +52,7 @@
         "eventemitter3": "^5.0.1",
         "jszip": "^3.10.1",
         "papaparse": "^5.5.3",
-        "pdfjs-dist": "^5.4.149"
+        "pdfjs-dist": "^5.4.149",
+        "@tensorflow/tfjs": "^4.22.0"
     }
 }

package/dist/Reshape-Biok_3X1.js

@@ -1,212 +0,0 @@
-import { ac as f, ad as g, q as p, ae as C, l as x } from "./index-Du-bmOP8.js";
-import { u as I } from "./gpgpu_math-BFbOyvk4.js";
-/**
- * @license
- * Copyright 2018 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function R(t, e, o = "index") {
-  const s = f(e);
-  return s.map((n, r) => {
-    const i = `int ${t[r]} = ${o} / ${n}`, u = r === s.length - 1 ? `int ${t[r + 1]} = ${o} - ${t[r]} * ${n}` : `index -= ${t[r]} * ${n}`;
-    return `${i}; ${u};`;
-  }).join("");
-}
-function y(t, e) {
-  const o = t.length, s = t.map((r) => `${e}[${r}]`), n = new Array(o - 1);
-  n[o - 2] = s[o - 1];
-  for (let r = o - 3; r >= 0; --r)
-    n[r] = `(${n[r + 1]} * ${s[r + 1]})`;
-  return n;
-}
-function S(t, e, o = "index") {
-  const s = t.map((r, i) => i), n = y(s, e);
-  return n.map((r, i) => {
-    const u = `int ${t[i]} = ${o} / ${n[i]}`, a = i === n.length - 1 ? `int ${t[i + 1]} = ${o} - ${t[i]} * ${n[i]}` : `index -= ${t[i]} * ${n[i]}`;
-    return `${u}; ${a};`;
-  }).join("");
-}
-function F(t) {
-  const e = f(t).map((o) => o.toString());
-  return `
-  int getFlatIndex(ivec3 coords) {
-    return coords.x * ${e[0]} + coords.y * ${e[1]} + coords.z;
-  }
-`;
-}
-function v() {
-  return `
-  int getFlatIndex(ivec3 coords) {
-    return coords.x * outShapeStrides[0] + coords.y * outShapeStrides[1] + coords.z;
-  }
-`;
-}
-/**
- * @license
- * Copyright 2017 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function h(t, e = 2) {
-  return p(t.slice(0, t.length - e));
-}
-function m(t) {
-  if (t.length === 0)
-    throw Error("Cannot get rows and columns of an empty shape array.");
-  return [
-    t.length > 1 ? t[t.length - 2] : 1,
-    t[t.length - 1]
-  ];
-}
-function d(t) {
-  return t % 2 === 0;
-}
-function $(t, e) {
-  if (t = t.slice(-2), e = e.slice(-2), g(t, e) || !t.length || !e.length || t[0] === 0 || t[1] === 0 || e[0] === 0 || e[1] === 0)
-    return !0;
-  if (t.length !== e.length) {
-    const o = t[t.length - 1], s = e[e.length - 1];
-    if (o === s || d(o) && d(s) && (t[0] === 1 || e[0] === 1))
-      return !0;
-  }
-  return t[1] === e[1] && d(t[0]) && d(e[0]);
-}
-/**
- * @license
- * Copyright 2018 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-class b {
-  constructor(e, o) {
-    this.variableNames = ["A"], this.packedInputs = !0, this.packedOutput = !0, this.customUniforms = [{ name: "inputShape", type: "ivec3" }], this.outputShape = e, this.enableShapeUniforms = I(this.outputShape.length);
-    let s = "";
-    for (let n = 0; n < 4; n++) {
-      let r = "thisRC = rc;";
-      n % 2 === 1 && (r += "thisRC.z += 1;"), n > 1 && (r += "thisRC.y += 1;"), s += `
-        ${r}
-        ${n > 0 ? "if(thisRC.y < rows && thisRC.z < cols){" : ""}
-          int flatIndex = getFlatIndex(thisRC);
-
-          ivec3 inputRC = inputCoordsFromReshapedOutCoords(flatIndex);
-          vec2 inputRCInnerDims = vec2(float(inputRC.y),float(inputRC.z));
-
-          result[${n}] =
-            getChannel(getA(inputRC.x, inputRC.y, inputRC.z), inputRCInnerDims);
-        ${n > 0 ? "}" : ""}
-      `;
-    }
-    this.userCode = `
-      ${w(o, this.enableShapeUniforms)}
-      ${this.enableShapeUniforms ? v() : F(e)}
-
-      void main() {
-        ivec3 rc = getOutputCoords();
-
-        vec4 result = vec4(0.);
-
-        ivec3 thisRC;
-        int rows = ${this.enableShapeUniforms ? "outShape[1]" : e[1]};
-        int cols = ${this.enableShapeUniforms ? "outShape[2]" : e[2]};
-
-        ${s}
-
-        setOutput(result);
-      }
-    `;
-  }
-}
-function w(t, e) {
-  return `
-    ivec3 inputCoordsFromReshapedOutCoords(int index) {
-      ${e ? S(["r", "c", "d"], "inputShape") : R(["r", "c", "d"], t)}
-      return ivec3(r, c, d);
-    }
-  `;
-}
-/**
- * @license
- * Copyright 2020 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function D(t, e, o) {
-  const s = [
-    h(t.shape),
-    ...m(t.shape)
-  ], n = {
-    dtype: t.dtype,
-    shape: s,
-    dataId: t.dataId
-  }, r = [
-    h(e),
-    ...m(e)
-  ], i = new b(r, s), u = !0, a = [s], c = o.runWebGLProgram(i, [n], t.dtype, a, u);
-  return { dataId: c.dataId, shape: e, dtype: c.dtype };
-}
-/**
- * @license
- * Copyright 2020 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function k(t) {
-  const { inputs: e, backend: o, attrs: s } = t, { x: n } = e, { shape: r } = s, i = o, u = p(n.shape), a = C(r, u), c = p(a);
-  x(u === c, () => `The new shape (${a}) has ${c} elements and the old shape (${n.shape}) has ${u} elements. The new shape and old shape must have the same number of elements.`);
-  const l = i.texData.get(n.dataId);
-  return l.isPacked && !$(n.shape, a) && !(l.texture !== null && $(l.shape, a)) ? D(n, a, i) : (i.incRef(n.dataId), { dataId: n.dataId, shape: a, dtype: n.dtype });
-}
-export {
-  k as r
-};

package/dist/slice_util-DskXqRZa.js

@@ -1,49 +0,0 @@
-import { l as s } from "./index-Du-bmOP8.js";
-/**
- * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function u(r, n, t) {
-  let l = t.length;
-  for (let e = 0; e < t.length; e++)
-    if (t[e] > 1) {
-      l = e;
-      break;
-    }
-  for (let e = l + 1; e < t.length; e++)
-    if (n[e] > 0 || t[e] !== r[e])
-      return !1;
-  return !0;
-}
-function c(r, n) {
-  let t = r.length > 0 ? r[r.length - 1] : 1;
-  for (let l = 0; l < r.length - 1; l++)
-    t += r[l] * n[l];
-  return t;
-}
-function h(r, n, t) {
-  let l;
-  const e = r.shape.length;
-  typeof n == "number" ? l = [n, ...new Array(e - 1).fill(0)] : n.length < e ? l = n.concat(new Array(e - n.length).fill(0)) : l = n.slice(), l.forEach((a) => {
-    s(a !== -1, () => "slice() does not support negative begin indexing.");
-  });
-  let f;
-  return t == null ? f = new Array(e).fill(-1) : typeof t == "number" ? f = [t, ...new Array(e - 1).fill(-1)] : t.length < e ? f = t.concat(new Array(e - t.length).fill(-1)) : f = t, f = f.map((a, o) => a >= 0 ? a : (s(a === -1, () => `Negative size values should be exactly -1 but got ${a} for the slice() size at index ${o}.`), r.shape[o] - l[o])), [l, f];
-}
-export {
-  c,
-  u as i,
-  h as p
-};