@genai-fi/nanogpt 0.4.5 → 0.5.0

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--6vO-cOz.js";
+import { A as r, b as c, f as h, s as g, e as o } from "../index-iNhkcAEQ.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,7 +1,7 @@
-import { aj as $, ah as d, L as M, a as R, ak as f, al as v, am as z, j as _, t as x } from "../index--6vO-cOz.js";
+import { aj as $, V as d, K as M, a as R, ak as f, al as v, am as z, k as _, t as x } from "../index-iNhkcAEQ.js";
 import { s as E } from "../index-C4L8Cm77.js";
-import { s as P } from "../stack-CmqSdsfs.js";
-import { t as D } from "../tensor-BGYi41cj.js";
+import { s as P } from "../stack--cqr9Dgc.js";
+import { t as D } from "../tensor-CfiPXsW4.js";
 import "../index-Tf7vU29b.js";
 /**
  * @license
@@ -37,13 +37,13 @@ function I(s, t, e = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set()) {
     throw new Error("A deep map function may not return both a value and recurse=true.");
   if (n.recurse)
     if (p(s)) {
-      const a = Array.isArray(s) ? [] : {};
+      const i = Array.isArray(s) ? [] : {};
       r.add(s);
       for (const l in s) {
         const h = s[l], c = I(h, t, e, r);
-        a[l] = c;
+        i[l] = c;
       }
-      return r.delete(s), s.__proto__ && (a.__proto__ = s.__proto__), a;
+      return r.delete(s), s.__proto__ && (i.__proto__ = s.__proto__), i;
     } else
       throw new Error(`Can't recurse into non-iterable type: ${s}`);
   else return e.set(s, n.value), n.value;
@@ -60,13 +60,13 @@ function A(s, t, e = /* @__PURE__ */ new Set()) {
     throw new Error("A deep zip function may not return both a value and recurse=true.");
   if (n.recurse)
     if (p(r)) {
-      const a = Array.isArray(r) ? [] : {};
+      const i = Array.isArray(r) ? [] : {};
       e.add(r);
       for (const l in r) {
         const h = s.map((w) => w[l]), c = A(h, t, e);
-        a[l] = c;
+        i[l] = c;
       }
-      return e.delete(r), a;
+      return e.delete(r), i;
     } else
       throw new Error(`Can't recurse into non-iterable type: ${r}`);
   else return n.value;
@@ -303,15 +303,15 @@ y.INITIAL_CAPACITY = 32;
  * =============================================================================
  */
 function W(s) {
-  return new Y(s);
+  return new V(s);
 }
 function k(s) {
-  return new J(s);
+  return new Y(s);
 }
 function U(s, t) {
   return new F(s, t);
 }
-class i {
+class a {
   /**
    * Collect all remaining elements of a bounded stream into an array.
    * Obviously this will succeed only for small streams that fit in memory.
@@ -477,7 +477,7 @@ class i {
    *   of the original element type.
    */
   rowMajorBatch(t, e = !0) {
-    return new K(this, t, e);
+    return new j(this, t, e);
   }
   /**
    * Groups elements into batches, represented in column-major form.
@@ -512,7 +512,7 @@ class i {
    *   with collections at the leaves.
    */
   columnMajorBatch(t, e = !0, r = T) {
-    return this.rowMajorBatch(t, e).map((a) => O(a, r));
+    return this.rowMajorBatch(t, e).map((i) => O(i, r));
   }
   /**
    * Concatenate this `LazyIterator` with another.
@@ -535,7 +535,7 @@ class i {
    *   unaltered.
    */
   take(t) {
-    return t < 0 || t == null ? this : new j(this, t);
+    return t < 0 || t == null ? this : new X(this, t);
   }
   /**
    * Skips the first `count` items in this stream.
@@ -544,7 +544,7 @@ class i {
    * value is given, the entire stream is returned unaltered.
    */
   skip(t) {
-    return t < 0 || t == null ? this : new X(this, t);
+    return t < 0 || t == null ? this : new K(this, t);
   }
   /**
    * Prefetch the first `bufferSize` items in this stream.
@@ -575,10 +575,10 @@ class i {
    * prior one, so that they cannot execute concurrently.
    */
   serial() {
-    return new V(this);
+    return new J(this);
   }
 }
-class Y extends i {
+class V extends a {
   constructor(t) {
     super(), this.items = t, this.trav = 0;
   }
@@ -592,7 +592,7 @@ class Y extends i {
     return this.trav++, { value: Q(t), done: !1 };
   }
 }
-class J extends i {
+class Y extends a {
   constructor(t) {
     super(), this.nextFn = t;
   }
@@ -607,7 +607,7 @@ class J extends i {
     }
   }
 }
-class V extends i {
+class J extends a {
   constructor(t) {
     super(), this.upstream = t, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -621,7 +621,7 @@ class V extends i {
     return this.upstream.next();
   }
 }
-class X extends i {
+class K extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.maxCount = e, this.count = 0, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -641,7 +641,7 @@ class X extends i {
     return this.upstream.next();
   }
 }
-class j extends i {
+class X extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.maxCount = e, this.count = 0;
   }
@@ -652,7 +652,7 @@ class j extends i {
     return this.count++ >= this.maxCount ? { value: null, done: !0 } : this.upstream.next();
   }
 }
-class K extends i {
+class j extends a {
   constructor(t, e, r = !0) {
     super(), this.upstream = t, this.batchSize = e, this.enableSmallLastBatch = r, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -673,7 +673,7 @@ class K extends i {
     return { value: t, done: !1 };
   }
 }
-class Z extends i {
+class Z extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.predicate = e, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -692,7 +692,7 @@ class Z extends i {
     }
   }
 }
-class tt extends i {
+class tt extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.transform = e;
   }
@@ -704,12 +704,12 @@ class tt extends i {
     if (t.done)
       return { value: null, done: !0 };
     const e = f(t.value), r = this.transform(t.value), n = f(r);
-    for (const a of e)
-      v(a, n) || a.dispose();
+    for (const i of e)
+      v(i, n) || i.dispose();
     return { value: r, done: !1 };
   }
 }
-class et extends i {
+class et extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.handler = e, this.count = 0, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -729,7 +729,7 @@ class et extends i {
       }
   }
 }
-class g extends i {
+class g extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.transform = e;
   }
@@ -741,12 +741,12 @@ class g extends i {
     if (t.done)
       return { value: null, done: !0 };
     const e = f(t.value), r = await this.transform(t.value), n = f(r);
-    for (const a of e)
-      v(a, n) || a.dispose();
+    for (const i of e)
+      v(i, n) || i.dispose();
     return { value: r, done: !1 };
   }
 }
-class st extends i {
+class st extends a {
   constructor() {
     super(), this.outputQueue = new y(), this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -773,12 +773,12 @@ class rt extends st {
       return !1;
     const e = f(t.value), r = this.transform(t.value), n = f(r);
     this.outputQueue.pushAll(r);
-    for (const a of e)
-      v(a, n) || a.dispose();
+    for (const i of e)
+      v(i, n) || i.dispose();
     return !0;
   }
 }
-class F extends i {
+class F extends a {
   constructor(t, e) {
     super(), this.baseErrorHandler = e, this.lastRead = null, this.iterator = null, this.moreIterators = t;
   }
@@ -803,7 +803,7 @@ var b;
 (function(s) {
   s[s.FAIL = 0] = "FAIL", s[s.SHORTEST = 1] = "SHORTEST", s[s.LONGEST = 2] = "LONGEST";
 })(b || (b = {}));
-class S extends i {
+class S extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.bufferSize = e, this.buffer = new C(e);
   }
@@ -934,7 +934,7 @@ class N {
     _(t > 0, () => `batchSize needs to be positive, but it is
       ${t}`);
     let n;
-    return this.size === 1 / 0 || this.size == null ? n = this.size : e ? n = Math.ceil(this.size / t) : n = Math.floor(this.size / t), o(async () => (await r.iterator()).columnMajorBatch(t, e, at), n);
+    return this.size === 1 / 0 || this.size == null ? n = this.size : e ? n = Math.ceil(this.size / t) : n = Math.floor(this.size / t), o(async () => (await r.iterator()).columnMajorBatch(t, e, it), n);
   }
   /**
    * Concatenates this `Dataset` with another.
@@ -1129,10 +1129,10 @@ class N {
   shuffle(t, e, r = !0) {
     if (t == null || t < 0)
       throw this.size == null ? new RangeError("`Dataset.shuffle()` requires bufferSize to be specified.") : new RangeError(`\`Dataset.shuffle()\` requires bufferSize to be specified.  If your data fits in main memory (for regular JS objects), and/or GPU memory (for \`tf.Tensor\`s), consider setting bufferSize to the dataset size (${this.size} elements)`);
-    const n = this, a = E.alea(e || z().toString());
+    const n = this, i = E.alea(e || z().toString());
     return o(async () => {
-      let l = a.int32();
-      return r && (l += a.int32()), (await n.iterator()).shuffle(t, l.toString());
+      let l = i.int32();
+      return r && (l += i.int32()), (await n.iterator()).shuffle(t, l.toString());
     }, this.size);
   }
   /**
@@ -1210,13 +1210,13 @@ function o(s, t = null) {
     }
   }();
 }
-function at(s) {
+function it(s) {
   if (s === null)
     return null;
   const t = s[0];
-  return H(t) ? { value: it(s), recurse: !1 } : { value: null, recurse: !0 };
+  return H(t) ? { value: at(s), recurse: !1 } : { value: null, recurse: !0 };
 }
-function it(s) {
+function at(s) {
   if (s.length === 0)
     throw new Error("Can't make a batch of zero elements.");
   return s[0] instanceof d ? P(s) : D(s);
@@ -1252,7 +1252,7 @@ class mt {
   }
   // Create dataset from text files
   async createTextDataset(t, e = 32, r = 0, n = 1) {
-    const a = await Promise.all(t.map((u) => this.tokenizer.encode(u))), l = this.tokenizer.eosToken >= 0, h = a.map((u) => l ? [...u, this.tokenizer.eosToken] : u).flat(), c = h.slice(
+    const i = await Promise.all(t.map((u) => this.tokenizer.encode(u))), l = this.tokenizer.eosToken >= 0, h = i.map((u) => l ? [...u, this.tokenizer.eosToken] : u).flat(), c = h.slice(
       Math.floor(r * h.length),
       n === 1 ? void 0 : Math.floor(n * h.length)
     ), w = (function* () {

package/dist/training/Evaluator.js

@@ -5,14 +5,14 @@ class p {
   iterator;
   async evaluate(s = 100) {
     let t = 0, o = 0;
-    const c = await this.iterator;
+    const n = await this.iterator;
     for (let a = 0; a < s; a++) {
-      const e = await c.next();
+      const e = await n.next();
       if (e.done) break;
-      const n = e.value, { xs: r, ys: l } = n, { loss: i, logits: u } = this.model.forward(r, l, !1, !1);
-      u.dispose(), r.dispose(), l.dispose();
-      const d = i.arraySync();
-      i.dispose(), t += d, o++;
+      const c = e.value, { xs: r, ys: i } = c, [u, l] = this.model.forward({ training: !1 }, r, i);
+      u.dispose(), r.dispose(), i.dispose();
+      const d = l.arraySync();
+      l.dispose(), t += d, o++;
     }
     return t / o;
   }

package/dist/training/FullTrainer.js

@@ -1,7 +1,7 @@
 import { generateText as v } from "../utilities/generate.js";
 import L from "./Trainer.js";
 import x from "./Evaluator.js";
-import { a as h } from "../index--6vO-cOz.js";
+import { a as h } from "../index-iNhkcAEQ.js";
 const D = {
   desiredLoss: 0.01,
   logInterval: 1,

package/dist/training/Trainer.js

@@ -1,10 +1,10 @@
 import { DatasetBuilder as d } from "./DatasetBuilder.js";
 import h from "./AdamExt.js";
-import { t as g, v as u, a as o } from "../index--6vO-cOz.js";
-import { m as y, n as f } from "../norm-DSva3hI3.js";
-import { m as S, a as z } from "../moments-DYOHXoRV.js";
-import { m as b } from "../max-BUShNgfh.js";
-import { z as n } from "../zeros-8xl-W2DC.js";
+import { t as g, v as u, a as o } from "../index-iNhkcAEQ.js";
+import { m as y, n as f } from "../norm-D3676xIo.js";
+import { m as S, a as z } from "../moments-B06NlR_V.js";
+import { m as b } from "../max-CYaAjEEp.js";
+import { z as n } from "../zeros-NMYTayy7.js";
 class G {
   constructor(t, s, e = 1e-3) {
     this.tokenizer = s, this.model = t, this.learningRate = e, this.resetOptimizer(), this.datasetBuilder = new d(s, t.config.gpt.blockSize);
@@ -53,8 +53,8 @@ class G {
     return g(() => {
       this.model.getProfiler()?.startMemory();
       const { xs: a, ys: r } = t, l = () => {
-        const { loss: m, logits: p } = this.model.forward(a, r, !0);
-        return p.dispose(), m;
+        const [m, p] = this.model.forward({ training: !0 }, a, r);
+        return m.dispose(), p;
       }, { value: c, grads: i } = u(l);
       return s ? this.model.getProfiler()?.endMemory("Training") : (e && (console.log("-------"), this.printGradients(i), console.log("-------")), this.optimizer.applyGradients(i), this.model.getProfiler()?.endMemory("Training"), o(i)), c;
     });

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--6vO-cOz.js";
-import { s as v } from "../softmax-Dsxflvdl.js";
-import { m as z } from "../max-BUShNgfh.js";
-import { l as k } from "../log_sum_exp-CiEy1aUe.js";
+import { e as u, c as i, z as S, t as f, s as G } from "../index-iNhkcAEQ.js";
+import { s as v } from "../softmax-BjsptB07.js";
+import { m as z } from "../max-CYaAjEEp.js";
+import { l as k } from "../log_sum_exp-CkumwesB.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.js

@@ -1,14 +1,14 @@
-import "../index--6vO-cOz.js";
-import { z as n } from "../zeros-8xl-W2DC.js";
-async function a(s) {
-  const o = n([1, s.config.gpt.blockSize], "int32"), { logits: t, loss: i } = s.forward(o, void 0, !1);
-  await t.data(), t.dispose(), i && i.dispose(), o.dispose();
+import "../index-iNhkcAEQ.js";
+import { z as n } from "../zeros-NMYTayy7.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();
 }
-function c(s) {
-  const o = n([1, s.config.gpt.blockSize], "int32"), { logits: t, loss: i } = s.forward(o, void 0, !1);
-  t.dispose(), i && i.dispose(), o.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();
 }
 export {
-  c as dummyPass,
-  a as dummyPassAsync
+  d as dummyPass,
+  c as dummyPassAsync
 };

package/dist/utilities/generate.js

@@ -1,6 +1,6 @@
-import { t as y } from "../index--6vO-cOz.js";
-import { t as x } from "../tensor2d-DUr_htjt.js";
-import { c as f } from "../concat-DvWM7HGZ.js";
+import { t as y } from "../index-iNhkcAEQ.js";
+import { t as x } from "../tensor2d-tSxWdFMH.js";
+import { c as f } from "../concat-Cxbo2sOz.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 b } from "./weights.js";
 import u from "../tokeniser/CharTokeniser.js";
 import F from "../NanoGPTModel.js";
 import { dummyPassAsync as j } from "./dummy.js";
-import { d as T } from "../index--6vO-cOz.js";
+import { d as T } from "../index-iNhkcAEQ.js";
 import E from "../tokeniser/bpe.js";
 async function A(t) {
   const o = await fetch(t);

package/dist/utilities/profile.js

@@ -1,4 +1,4 @@
-import { m as s } from "../index--6vO-cOz.js";
+import { m as s } from "../index-iNhkcAEQ.js";
 const m = 1024 * 1024;
 class i {
   log = /* @__PURE__ */ new Map();

package/dist/utilities/save.js

@@ -1,19 +1,21 @@
 import { j as g } from "../jszip.min-CjP2V1VV.js";
 import { exportWeights as l } from "./weights.js";
 import b from "../tokeniser/CharTokeniser.js";
-const y = "1.0.0";
+const p = "1.0.0";
 async function h(t, a, i) {
-  const o = i?.includeLog ?? !0, c = t.saveWeights(), e = new g(), f = {};
-  for (const [n, s] of c) {
-    const r = await l(s);
-    f[n] = r.spec, e.file(`${n}.bin`, r.data.buffer, { binary: !0 });
+  const c = i?.includeLog ?? !0, f = /* @__PURE__ */ new Map();
+  t.saveWeights(f);
+  const e = new g(), r = {};
+  for (const [n, s] of f) {
+    const o = await l(s);
+    r[n] = o.spec, e.file(`${n}.bin`, o.data.buffer, { binary: !0 });
   }
   if (e.file(
     "manifest.json",
     JSON.stringify({
-      weightSpec: f,
+      weightSpec: r,
       config: t.config,
-      version: y,
+      version: p,
       application: "@genai-fi/nanogpt",
       meta: i?.metadata,
       name: i?.name
@@ -31,7 +33,7 @@ async function h(t, a, i) {
     {
       binary: !1
     }
-  ), o && e.file("log.json", JSON.stringify(t.log), { binary: !1 }), i?.files)
+  ), c && e.file("log.json", JSON.stringify(t.log), { binary: !1 }), i?.files)
     for (const [n, s] of Object.entries(i.files))
       e.file(n, JSON.stringify(s), { binary: !1 });
   return e.generateAsync({ type: "blob" });

package/dist/utilities/weights.js

@@ -1,5 +1,5 @@
-import "../index--6vO-cOz.js";
-import { t as p } from "../tensor-BGYi41cj.js";
+import "../index-iNhkcAEQ.js";
+import { t as p } from "../tensor-CfiPXsW4.js";
 function h(n) {
   const e = n.reduce((s, o) => s + o.length, 0), a = new Float32Array(e);
   let t = 0;

package/dist/{zeros-8xl-W2DC.js → zeros-NMYTayy7.js}

@@ -1,4 +1,4 @@
-import { o as m, h as r, X as l, E as c, Y as i, k as p, Z as u, n as f } from "./index--6vO-cOz.js";
+import { o as l, i as r, X as m, E as c, Y as i, l as p, Z as u, p as f } from "./index-iNhkcAEQ.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -17,11 +17,11 @@ import { o as m, h as r, X as l, E as c, Y as i, k as p, Z as u, n 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().`);
+  m(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 };
   return c.runKernel(i, n);
 }
-const g = /* @__PURE__ */ m({ complex_: x });
+const g = /* @__PURE__ */ l({ complex_: x });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@genai-fi/nanogpt",
-    "version": "0.4.5",
+    "version": "0.5.0",
     "type": "module",
     "main": "dist/main.js",
     "types": "dist/main.d.ts",

package/dist/slice_util-BdhYwFY_.js

@@ -1,90 +0,0 @@
-import { o as u, h as p, k as g, w as m, E as w, a4 as x, j as i } from "./index--6vO-cOz.js";
-import { r as y } from "./reshape-z51Eu-re.js";
-/**
- * @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 T(a, t) {
-  let e = p(a, "broadcastTo", "x");
-  const r = e.shape;
-  if (g(t), t.length < e.rank)
-    throw new Error(`broadcastTo(): shape.length=${t.length} < input.rank=${e.rank}.`);
-  if (t.length > e.rank) {
-    const l = e.shape.slice();
-    for (; l.length < t.length; )
-      l.unshift(1);
-    e = y(e, l);
-  }
-  const n = e.shape, o = Array.from(t);
-  for (let l = t.length - 1; l >= 0; l--)
-    if (n[l] === t[l])
-      o[l] = 1;
-    else if (e.shape[l] !== 1)
-      throw new Error(`broadcastTo(): [${r}] cannot be broadcast to [${t}].`);
-  if (o.map((l, h) => l > 1 ? h : -1).filter((l) => l >= 0).length === 0)
-    return m(e);
-  const f = { x: e }, c = { reps: o };
-  return w.runKernel(x, f, c);
-}
-const A = /* @__PURE__ */ u({ broadcastTo_: T });
-/**
- * @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 b(a, t, e) {
-  let r = e.length;
-  for (let n = 0; n < e.length; n++)
-    if (e[n] > 1) {
-      r = n;
-      break;
-    }
-  for (let n = r + 1; n < e.length; n++)
-    if (t[n] > 0 || e[n] !== a[n])
-      return !1;
-  return !0;
-}
-function E(a, t) {
-  let e = a.length > 0 ? a[a.length - 1] : 1;
-  for (let r = 0; r < a.length - 1; r++)
-    e += a[r] * t[r];
-  return e;
-}
-function N(a, t, e) {
-  let r;
-  const n = a.shape.length;
-  typeof t == "number" ? r = [t, ...new Array(n - 1).fill(0)] : t.length < n ? r = t.concat(new Array(n - t.length).fill(0)) : r = t.slice(), r.forEach((s) => {
-    i(s !== -1, () => "slice() does not support negative begin indexing.");
-  });
-  let o;
-  return e == null ? o = new Array(n).fill(-1) : typeof e == "number" ? o = [e, ...new Array(n - 1).fill(-1)] : e.length < n ? o = e.concat(new Array(n - e.length).fill(-1)) : o = e, o = o.map((s, f) => s >= 0 ? s : (i(s === -1, () => `Negative size values should be exactly -1 but got ${s} for the slice() size at index ${f}.`), a.shape[f] - r[f])), [r, o];
-}
-export {
-  A as b,
-  E as c,
-  b as i,
-  N as p
-};