@genai-fi/nanogpt 0.6.0 → 0.6.1

package/dist/{sin-EEhbrRO_.js → sin-9JBrfVaB.js}

@@ -1,4 +1,4 @@
-import { o, j as t, E as c, _ as a, $ as e } from "./index-bMBtI-WR.js";
+import { q as o, w as t, E as c, a0 as a, a1 as e } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/{softmax-B2_IKPDR.js → softmax-DvMvui-_.js}

@@ -1,4 +1,4 @@
-import { o as r, j as f, E as e, S as i } from "./index-bMBtI-WR.js";
+import { q as r, w as f, E as e, S as i } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/{split-dcks18H1.js → split-DxrHrPFK.js}

@@ -1,4 +1,4 @@
-import { o as p, j as i, E as a, x as c } from "./index-bMBtI-WR.js";
+import { q as p, w as i, E as a, H as c } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -15,9 +15,9 @@ import { o as p, j as i, E as a, x as c } from "./index-bMBtI-WR.js";
  * limitations under the License.
  * =============================================================================
  */
-function e(t, s, o = 0) {
-  const n = { x: i(t, "x", "split") }, r = { numOrSizeSplits: s, axis: o };
-  return a.runKernel(c, n, r);
+function e(t, s, n = 0) {
+  const o = { x: i(t, "x", "split") }, r = { numOrSizeSplits: s, axis: n };
+  return a.runKernel(c, o, r);
 }
 const u = /* @__PURE__ */ p({ split_: e });
 export {

package/dist/{stack-lpJ5kYvE.js → stack-DgaoDmnF.js}

@@ -1,4 +1,4 @@
-import { o as e, k as c, l as n, E as k, P as i } from "./index-bMBtI-WR.js";
+import { q as e, x as c, k as n, E as k, P as i } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.

package/dist/{sum-CutF5lj2.js → sum-BpcpxNEh.js}

@@ -1,4 +1,4 @@
-import { o as e, j as u, D as c, E as l, F as m } from "./index-bMBtI-WR.js";
+import { q as e, w as u, N as c, E as l, O as m } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -15,10 +15,10 @@ import { o as e, j as u, D as c, E as l, F as m } from "./index-bMBtI-WR.js";
  * limitations under the License.
  * =============================================================================
  */
-function i(t, o = null, n = !1) {
+function i(t, n = null, o = !1) {
   let s = u(t, "x", "sum");
   s.dtype === "bool" && (s = c(s, "int32"));
-  const r = { x: s }, a = { axis: o, keepDims: n };
+  const r = { x: s }, a = { axis: n, keepDims: o };
   return l.runKernel(m, r, a);
 }
 const f = /* @__PURE__ */ e({ sum_: i });

package/dist/{tensor-C15NA2LA.js → tensor-CDz5x1mP.js}

@@ -1,4 +1,4 @@
-import { J as t, K as a } from "./index-bMBtI-WR.js";
+import { Q as t, U as a } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/{tensor2d-DZ_e5eKM.js → tensor2d-jO8JY5Jd.js}

@@ -1,4 +1,4 @@
-import { I as t, J as s, K as a } from "./index-bMBtI-WR.js";
+import { V as t, Q as s, U as a } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/training/AdamExt.js

@@ -1,4 +1,4 @@
-import { A as r, b as c, f as h, s as g, e as o } from "../index-bMBtI-WR.js";
+import { A as r, b as c, f as h, s as g, e as o } from "../index-CamYe_M8.js";
 class u extends r {
   constructor(t, e, s, a, i) {
     super(t, e, s, a), this.config = i, this.startLearningRate = t;

package/dist/training/DatasetBuilder.js

@@ -1,5 +1,5 @@
-import { t as u } from "../index-bMBtI-WR.js";
-import { d as z, i as f } from "../dataset-oilnemHf.js";
+import { t as u } from "../index-CamYe_M8.js";
+import { d as z, i as f } from "../dataset-BFFipD1c.js";
 import "../index-Tf7vU29b.js";
 /**
  * @license

package/dist/training/FullTrainer.js

@@ -1,7 +1,7 @@
 import { generateText as T } from "../utilities/generate.js";
 import L from "./Trainer.js";
 import x from "./Evaluator.js";
-import { a as h } from "../index-bMBtI-WR.js";
+import { a as h } from "../index-CamYe_M8.js";
 import y from "../utilities/profile.js";
 const D = {
   desiredLoss: 0.01,

package/dist/training/Trainer.js

@@ -1,8 +1,8 @@
 import { DatasetBuilder as g, flattenTokens as m, PAGE_FACTOR as u } from "./DatasetBuilder.js";
 import f from "./AdamExt.js";
-import { t as y, v as z, a as c } from "../index-bMBtI-WR.js";
-import { n as S } from "../norm-B9hWHZH1.js";
-import { z as p } from "../zeros-CAbHfODe.js";
+import { t as y, v as z, a as c } from "../index-CamYe_M8.js";
+import { n as S } from "../norm-B9dQTFYn.js";
+import { z as p } from "../zeros-DUkkVccu.js";
 class R {
   constructor(t, e, s = 1e-3) {
     this.tokenizer = e, this.model = t, this.learningRate = s, this.resetOptimizer(), this.datasetBuilder = new g(e, t.config.gpt.blockSize);

package/dist/training/sparseCrossEntropy.js

@@ -1,9 +1,9 @@
 import { gatherSub as L } from "../ops/gatherSub.js";
 import { scatterSub as y } from "../ops/scatterSub.js";
-import { e as u, c as i, z as S, t as f, s as G } from "../index-bMBtI-WR.js";
-import { s as v } from "../softmax-B2_IKPDR.js";
-import { m as z } from "../max-DechV4Bc.js";
-import { l as k } from "../log_sum_exp-BHdkCb4s.js";
+import { e as u, c as i, z as S, t as f, s as G } from "../index-CamYe_M8.js";
+import { s as v } from "../softmax-DvMvui-_.js";
+import { m as z } from "../max-JBBv7aUf.js";
+import { l as k } from "../log_sum_exp-CV_5-TTu.js";
 function F(a, s) {
   return f(() => {
     const e = a.shape[a.shape.length - 1], o = a.shape.slice(0, -1).reduce((d, c) => d * c, 1), p = a.shape.length > 2 ? a.reshape([o, e]) : a, n = s.shape.length > 1 ? s.reshape([o]).cast("int32") : s.cast("int32"), t = z(p, -1, !0), r = G(p, t), h = k(r, -1);

package/dist/utilities/dummy.d.ts

@@ -1,3 +1,9 @@
 import { default as NanoGPT } from '../NanoGPTModel';
 export declare function dummyPassAsync(model: NanoGPT): Promise<void>;
+export interface MemoryRequirements {
+    perBatch: number;
+    tapeSize: number;
+    gradients: number;
+}
+export declare function dummyPassTrainAsync(model: NanoGPT): Promise<MemoryRequirements>;
 export declare function dummyPass(model: NanoGPT): void;

package/dist/utilities/dummy.js

@@ -1,14 +1,35 @@
-import "../index-bMBtI-WR.js";
-import { z as n } from "../zeros-CAbHfODe.js";
-async function c(s) {
-  const i = n([1, s.config.gpt.blockSize], "int32"), [t, o] = s.forward({ training: !1 }, i);
-  await t.data(), t.dispose(), o && o.dispose(), i.dispose();
+import { m as f, v as S, e as w } from "../index-CamYe_M8.js";
+import { z as i } from "../zeros-DUkkVccu.js";
+async function P(s) {
+  const t = i([1, s.config.gpt.blockSize], "int32"), [e, n] = s.forward({ training: !1 }, t);
+  await e.data(), e.dispose(), n && n.dispose(), t.dispose();
 }
-function d(s) {
-  const i = n([1, s.config.gpt.blockSize], "int32"), [t, o] = s.forward({ training: !1 }, i);
-  t.dispose(), o && o.dispose(), i.dispose();
+async function v(s) {
+  const t = f(), e = t.numBytesInGPUAllocated ?? t.numBytes;
+  await P(s);
+  const n = i([1, s.config.gpt.blockSize], "int32"), r = i([1, s.config.gpt.blockSize], "int32"), o = {
+    perBatch: 0,
+    tapeSize: 0,
+    gradients: s.getNumParams() * 4
+  }, g = () => {
+    const [a, l] = s.forward({ training: !0 }, n, r), d = w().state.activeTape;
+    let u = 0;
+    if (d)
+      for (const z of d)
+        u += z.saved?.reduce((B, I) => B + I.size * 4, 0) || 0;
+    return o.tapeSize = u, a.dispose(), l;
+  }, { value: c, grads: m } = S(g), p = f(), y = p.numBytesInGPUAllocated ?? p.numBytes;
+  o.perBatch = y - e - o.gradients, console.log("Dummy training memory requirements:", o), await c.data(), c.dispose();
+  for (const a in m)
+    m[a].dispose();
+  return n.dispose(), r.dispose(), o;
+}
+function A(s) {
+  const t = i([1, s.config.gpt.blockSize], "int32"), [e, n] = s.forward({ training: !1 }, t);
+  e.dispose(), n && n.dispose(), t.dispose();
 }
 export {
-  d as dummyPass,
-  c as dummyPassAsync
+  A as dummyPass,
+  P as dummyPassAsync,
+  v as dummyPassTrainAsync
 };

package/dist/utilities/generate.js

@@ -1,6 +1,6 @@
-import { t as y } from "../index-bMBtI-WR.js";
-import { t as x } from "../tensor2d-DZ_e5eKM.js";
-import { c as f } from "../concat-DhZfF1GY.js";
+import { t as y } from "../index-CamYe_M8.js";
+import { t as x } from "../tensor2d-jO8JY5Jd.js";
+import { c as f } from "../concat-XOK9ANZu.js";
 async function A(o, r, a, c, T) {
   if (c <= 0)
     throw new Error("Length must be a positive integer");

package/dist/utilities/load.js

@@ -3,7 +3,7 @@ import { importWeights as F } from "./weights.js";
 import h from "../tokeniser/CharTokeniser.js";
 import b from "../NanoGPTModel.js";
 import { dummyPassAsync as u } from "./dummy.js";
-import { d as k } from "../index-bMBtI-WR.js";
+import { d as k } from "../index-CamYe_M8.js";
 import j from "../tokeniser/bpe.js";
 import { load_safetensors as N } from "./safetensors.js";
 const I = 2;

package/dist/utilities/profile.d.ts

@@ -1,3 +1,7 @@
+import { MemoryInfo } from '@tensorflow/tfjs-core';
+export interface ExtendedMemoryInfo extends MemoryInfo {
+    numBytesInGPUAllocated?: number;
+}
 export default class MemoryProfiler {
     private log;
     private maxMemory;
@@ -6,6 +10,7 @@ export default class MemoryProfiler {
     private peakMemory;
     startMemory(): void;
     getPeakMemory(): number;
+    getMaxMemory(): number;
     endMemory(label: string): void;
     printSummary(): void;
 }

package/dist/utilities/profile.js

@@ -1,4 +1,4 @@
-import { m as s } from "../index-bMBtI-WR.js";
+import { m as a } from "../index-CamYe_M8.js";
 const m = 1024 * 1024;
 class l {
   log = /* @__PURE__ */ new Map();
@@ -7,23 +7,26 @@ class l {
   lastMemInfo = [];
   peakMemory = 0;
   startMemory() {
-    this.lastMemInfo.push(s());
+    this.lastMemInfo.push(a());
   }
   getPeakMemory() {
     return this.peakMemory;
   }
-  endMemory(e) {
+  getMaxMemory() {
+    return this.maxMemory;
+  }
+  endMemory(o) {
     if (this.lastMemInfo.length === 0) {
       console.warn("MemoryProfiler: endMemory called without matching startMemory");
       return;
     }
-    const o = s(), t = o.numBytes - (this.lastMemInfo.pop()?.numBytes || 0);
-    this.log.set(e, Math.max(this.log.get(e) || 0, t)), t > this.maxMemory && (this.maxMemory = t, this.maxLabel = e), this.peakMemory = Math.max(this.peakMemory, o.numBytesInGPUAllocated || o.numBytes);
+    const e = a(), s = this.lastMemInfo.pop(), t = (e.numBytesInGPUAllocated ?? e.numBytes) - (s?.numBytes ?? s?.numBytesInGPUAllocated ?? 0);
+    this.log.set(o, Math.max(this.log.get(o) || 0, t)), t > this.maxMemory && (this.maxMemory = t, this.maxLabel = o), this.peakMemory = Math.max(this.peakMemory, e.numBytesInGPUAllocated ?? e.numBytes);
   }
   printSummary() {
     console.log("Memory Usage Summary:");
-    for (const [e, o] of this.log.entries())
-      console.log(`- ${e}: ${(o / m).toFixed(2)} MB`);
+    for (const [o, e] of this.log.entries())
+      console.log(`- ${o}: ${(e / m).toFixed(2)} MB`);
     this.maxLabel && console.log(`Peak Memory Usage: ${(this.maxMemory / m).toFixed(2)} MB at "${this.maxLabel}"`), console.log(`Overall Peak Memory Usage: ${(this.peakMemory / m).toFixed(2)} MB`);
   }
 }

package/dist/utilities/safetensors.js

@@ -1,5 +1,5 @@
-import "../index-bMBtI-WR.js";
-import { t as y } from "../tensor-C15NA2LA.js";
+import "../index-CamYe_M8.js";
+import { t as y } from "../tensor-CDz5x1mP.js";
 function l(t) {
   if (t === "float32") return "F32";
   if (t === "int32") return "I32";

package/dist/utilities/weights.js

@@ -1,5 +1,5 @@
-import "../index-bMBtI-WR.js";
-import { t as p } from "../tensor-C15NA2LA.js";
+import "../index-CamYe_M8.js";
+import { t as p } from "../tensor-CDz5x1mP.js";
 function h(n) {
   const e = n.reduce((s, o) => s + o.length, 0), a = new Float32Array(e);
   let t = 0;

package/dist/{variable-CdRKKp8x.js → variable-CLVXjN7F.js}

@@ -1,4 +1,4 @@
-import { E as i } from "./index-bMBtI-WR.js";
+import { E as i } from "./index-CamYe_M8.js";
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/dist/{zeros-CAbHfODe.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-bMBtI-WR.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.6.0",
+    "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-CLOrdpve.js

@@ -1,212 +0,0 @@
-import { ac as f, ad as g, q as p, ae as C, l as x } from "./index-bMBtI-WR.js";
-import { u as I } from "./gpgpu_math-Ctc31slO.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-Ddk0uxGJ.js

@@ -1,49 +0,0 @@
-import { l as s } from "./index-bMBtI-WR.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
-};