@genai-fi/nanogpt 0.9.0 → 0.10.0

package/dist/data/textLoader.js

@@ -1,4 +1,4 @@
-import { p as s } from "../papaparse.min-C8l2Kvo1.js";
+import { p as s } from "../papaparse.min-C0cScC2i.js";
 import { loadParquet as m } from "./parquet.js";
 import { loadPDF as u } from "./pdf.js";
 import { loadDOCX as f } from "./docx.js";

package/dist/{dataset-DlZtKmBq.js → dataset-0xP8GjwI.js}

@@ -1,134 +1,85 @@
-import { ak as S, T as h, ag as k, d as v, al as o, am as p, an as g, n as N, t as y } from "./index-BzFyqcy-.js";
-import { s as R } from "./index-C4L8Cm77.js";
-import { s as $ } from "./stack-DFatutCx.js";
-import { t as B } from "./tensor-CZr4dh61.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 _(s, t) {
-  return b(s, t);
+import { d as v, t as y } from "./index-ZyQhjEPo.js";
+import { s as g } from "./index-CieiGp4Y.js";
+import { D as S, T as h, e as N, x as R, a as k } from "./tensor-DdQUJZlz.js";
+import { t as o, O as p } from "./tensor_util-DV-FP5Q3.js";
+import { s as $ } from "./stack-yOIAalTq.js";
+import { t as B } from "./tensor-f35l8Odg.js";
+function _(r, t) {
+  return b(r, t);
 }
-function b(s, t, e = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set()) {
-  if (s == null)
+function b(r, t, e = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Set()) {
+  if (r == null)
     return null;
-  if (typeof Blob == "function" && s instanceof Blob)
-    return s.slice();
-  if (r.has(s))
+  if (typeof Blob == "function" && r instanceof Blob)
+    return r.slice();
+  if (s.has(r))
     throw new Error("Circular references are not supported.");
-  if (e.has(s))
-    return e.get(s);
-  const n = t(s);
+  if (e.has(r))
+    return e.get(r);
+  const n = t(r);
   if (n.recurse && n.value !== null)
     throw new Error("A deep map function may not return both a value and recurse=true.");
   if (n.recurse)
-    if (c(s)) {
-      const a = Array.isArray(s) ? [] : {};
-      r.add(s);
-      for (const l in s) {
-        const d = s[l], m = b(d, t, e, r);
-        a[l] = m;
+    if (c(r)) {
+      const i = Array.isArray(r) ? [] : {};
+      s.add(r);
+      for (const l in r) {
+        const m = r[l], d = b(m, t, e, s);
+        i[l] = d;
       }
-      return r.delete(s), s.__proto__ && (a.__proto__ = s.__proto__), a;
+      return s.delete(r), r.__proto__ && (i.__proto__ = r.__proto__), i;
     } else
-      throw new Error(`Can't recurse into non-iterable type: ${s}`);
-  else return e.set(s, n.value), n.value;
+      throw new Error(`Can't recurse into non-iterable type: ${r}`);
+  else return e.set(r, n.value), n.value;
 }
-function P(s, t = I) {
-  return E(s, t);
+function P(r, t = I) {
+  return E(r, t);
 }
-function E(s, t, e = /* @__PURE__ */ new Set()) {
-  const r = s[0];
-  if (e.has(r))
+function E(r, t, e = /* @__PURE__ */ new Set()) {
+  const s = r[0];
+  if (e.has(s))
     throw new Error("Circular references are not supported.");
-  const n = t(s);
+  const n = t(r);
   if (n.recurse && n.value !== null)
     throw new Error("A deep zip function may not return both a value and recurse=true.");
   if (n.recurse)
-    if (c(r)) {
-      const a = Array.isArray(r) ? [] : {};
-      e.add(r);
-      for (const l in r) {
-        const d = s.map((F) => F[l]), m = E(d, t, e);
-        a[l] = m;
+    if (c(s)) {
+      const i = Array.isArray(s) ? [] : {};
+      e.add(s);
+      for (const l in s) {
+        const m = r.map((F) => F[l]), d = E(m, t, e);
+        i[l] = d;
       }
-      return e.delete(r), a;
+      return e.delete(s), i;
     } else
-      throw new Error(`Can't recurse into non-iterable type: ${r}`);
+      throw new Error(`Can't recurse into non-iterable type: ${s}`);
   else return n.value;
 }
-function I(s) {
-  return s === null ? null : c(s[0]) ? { value: null, recurse: !0 } : { value: s, recurse: !1 };
+function I(r) {
+  return r === null ? null : c(r[0]) ? { value: null, recurse: !0 } : { value: r, recurse: !1 };
 }
-function c(s) {
+function c(r) {
   let t = !1;
-  if (k().get("IS_BROWSER"))
-    t = s instanceof TextDecoder;
+  if (N().get("IS_BROWSER"))
+    t = r instanceof TextDecoder;
   else {
     const { StringDecoder: e } = require("string_decoder");
-    t = s instanceof e;
+    t = r instanceof e;
   }
-  return s != null && !ArrayBuffer.isView(s) && (Array.isArray(s) || typeof s == "object" && !(s instanceof h) && !(s instanceof Promise) && !t);
+  return r != null && !ArrayBuffer.isView(r) && (Array.isArray(r) || typeof r == "object" && !(r instanceof h) && !(r instanceof Promise) && !t);
 }
-function M(s) {
-  return s == null || L(s) || Array.isArray(s) || typeof s == "object" && s instanceof h || S(s);
+function M(r) {
+  return r == null || L(r) || Array.isArray(r) || typeof r == "object" && r instanceof h || S(r);
 }
-function L(s) {
-  return s === null || typeof s != "object" && typeof s != "function";
+function L(r) {
+  return r === null || typeof r != "object" && typeof r != "function";
 }
-/**
- * @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 D(s) {
-  return _(s, O);
+function D(r) {
+  return _(r, O);
 }
-function O(s) {
-  return s instanceof h ? { value: s.clone(), recurse: !1 } : c(s) ? { value: null, recurse: !0 } : { value: s, recurse: !1 };
+function O(r) {
+  return r instanceof h ? { value: r.clone(), recurse: !1 } : c(r) ? { value: null, recurse: !0 } : { value: r, recurse: !1 };
 }
-/**
- * @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 z {
   /**
    * Constructs a `RingBuffer`.
@@ -236,27 +187,10 @@ class z {
   shuffleExcise(t) {
     if (this.isEmpty())
       throw new RangeError("Ring buffer is empty.");
-    const e = this.wrap(this.begin + t), r = this.get(e);
-    return this.set(e, this.pop()), r;
+    const e = this.wrap(this.begin + t), s = this.get(e);
+    return this.set(e, this.pop()), s;
   }
 }
-/**
- * @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 f extends z {
   /**
    * Constructs a `GrowingRingBuffer`.
@@ -277,40 +211,23 @@ class f extends z {
    * Doubles the capacity of the buffer.
    */
   expand() {
-    const t = this.capacity * 2, e = new Array(t), r = this.length();
-    for (let n = 0; n < r; n++)
+    const t = this.capacity * 2, e = new Array(t), s = this.length();
+    for (let n = 0; n < s; n++)
       e[n] = this.get(this.wrap(this.begin + n));
-    this.data = e, this.capacity = t, this.doubledCapacity = 2 * this.capacity, this.begin = 0, this.end = r;
+    this.data = e, this.capacity = t, this.doubledCapacity = 2 * this.capacity, this.begin = 0, this.end = s;
   }
 }
 f.INITIAL_CAPACITY = 32;
-/**
- * @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 H(s) {
-  return new G(s);
+function H(r) {
+  return new G(r);
 }
-function q(s) {
-  return new W(s);
+function q(r) {
+  return new W(r);
 }
-function Q(s, t) {
-  return new A(s, t);
+function Q(r, t) {
+  return new A(r, 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.
@@ -339,9 +256,9 @@ class i {
    */
   async toArrayForTest() {
     const t = this.prefetch(100), e = [];
-    let r = await t.next();
-    for (; !r.done; )
-      e.push(r.value), r = await t.next();
+    let s = await t.next();
+    for (; !s.done; )
+      e.push(s.value), s = await t.next();
     return e;
   }
   /**
@@ -364,9 +281,9 @@ class i {
    * fully processed.
    */
   async resolveWhile(t) {
-    let e = await this.next(), r = t(e.value);
-    for (; !e.done && r; )
-      e = await this.next(), r = t(e.value);
+    let e = await this.next(), s = t(e.value);
+    for (; !e.done && s; )
+      e = await this.next(), s = t(e.value);
   }
   /**
    * Handles errors thrown on this stream using a provided handler function.
@@ -510,8 +427,8 @@ class i {
    * @returns A `LazyIterator` of batches of elements, represented as an object
    *   with collections at the leaves.
    */
-  columnMajorBatch(t, e = !0, r = I) {
-    return this.rowMajorBatch(t, e).map((a) => P(a, r));
+  columnMajorBatch(t, e = !0, s = I) {
+    return this.rowMajorBatch(t, e).map((i) => P(i, s));
   }
   /**
    * Concatenate this `LazyIterator` with another.
@@ -577,7 +494,7 @@ class i {
     return new U(this);
   }
 }
-class G extends i {
+class G extends a {
   constructor(t) {
     super(), this.items = t, this.trav = 0;
   }
@@ -591,7 +508,7 @@ class G extends i {
     return this.trav++, { value: D(t), done: !1 };
   }
 }
-class W extends i {
+class W extends a {
   constructor(t) {
     super(), this.nextFn = t;
   }
@@ -606,7 +523,7 @@ class W extends i {
     }
   }
 }
-class U extends i {
+class U extends a {
   constructor(t) {
     super(), this.upstream = t, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -620,7 +537,7 @@ class U extends i {
     return this.upstream.next();
   }
 }
-class Y extends i {
+class Y extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.maxCount = e, this.count = 0, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -640,7 +557,7 @@ class Y extends i {
     return this.upstream.next();
   }
 }
-class J extends i {
+class J extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.maxCount = e, this.count = 0;
   }
@@ -651,9 +568,9 @@ class J extends i {
     return this.count++ >= this.maxCount ? { value: null, done: !0 } : this.upstream.next();
   }
 }
-class V extends i {
-  constructor(t, e, r = !0) {
-    super(), this.upstream = t, this.batchSize = e, this.enableSmallLastBatch = r, this.lastRead = Promise.resolve({ value: null, done: !1 });
+class V extends a {
+  constructor(t, e, s = !0) {
+    super(), this.upstream = t, this.batchSize = e, this.enableSmallLastBatch = s, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
   summary() {
     return `${this.upstream.summary()} -> RowMajorBatch`;
@@ -672,7 +589,7 @@ class V extends i {
     return { value: t, done: !1 };
   }
 }
-class X extends i {
+class X extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.predicate = e, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -691,7 +608,7 @@ class X extends i {
     }
   }
 }
-class K extends i {
+class K extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.transform = e;
   }
@@ -702,13 +619,13 @@ class K extends i {
     const t = await this.upstream.next();
     if (t.done)
       return { value: null, done: !0 };
-    const e = o(t.value), r = this.transform(t.value), n = o(r);
-    for (const a of e)
-      p(a, n) || a.dispose();
-    return { value: r, done: !1 };
+    const e = o(t.value), s = this.transform(t.value), n = o(s);
+    for (const i of e)
+      p(i, n) || i.dispose();
+    return { value: s, done: !1 };
   }
 }
-class Z extends i {
+class Z extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.handler = e, this.count = 0, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -728,7 +645,7 @@ class Z extends i {
       }
   }
 }
-class w extends i {
+class w extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.transform = e;
   }
@@ -739,13 +656,13 @@ class w extends i {
     const t = await this.upstream.next();
     if (t.done)
       return { value: null, done: !0 };
-    const e = o(t.value), r = await this.transform(t.value), n = o(r);
-    for (const a of e)
-      p(a, n) || a.dispose();
-    return { value: r, done: !1 };
+    const e = o(t.value), s = await this.transform(t.value), n = o(s);
+    for (const i of e)
+      p(i, n) || i.dispose();
+    return { value: s, done: !1 };
   }
 }
-class j extends i {
+class j extends a {
   constructor() {
     super(), this.outputQueue = new f(), this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -770,14 +687,14 @@ class tt extends j {
     const t = await this.upstream.next();
     if (t.done)
       return !1;
-    const e = o(t.value), r = this.transform(t.value), n = o(r);
-    this.outputQueue.pushAll(r);
-    for (const a of e)
-      p(a, n) || a.dispose();
+    const e = o(t.value), s = this.transform(t.value), n = o(s);
+    this.outputQueue.pushAll(s);
+    for (const i of e)
+      p(i, n) || i.dispose();
     return !0;
   }
 }
-class A extends i {
+class A extends a {
   constructor(t, e) {
     super(), this.baseErrorHandler = e, this.lastRead = null, this.iterator = null, this.moreIterators = t;
   }
@@ -789,20 +706,20 @@ class A extends i {
   }
   async readFromChain(t) {
     if (await t, this.iterator == null) {
-      const r = await this.moreIterators.next();
-      if (r.done)
+      const s = await this.moreIterators.next();
+      if (s.done)
         return { value: null, done: !0 };
-      this.iterator = r.value, this.baseErrorHandler != null && (this.iterator = this.iterator.handleErrors(this.baseErrorHandler));
+      this.iterator = s.value, this.baseErrorHandler != null && (this.iterator = this.iterator.handleErrors(this.baseErrorHandler));
     }
     const e = await this.iterator.next();
     return e.done ? (this.iterator = null, this.readFromChain(t)) : e;
   }
 }
 var x;
-(function(s) {
-  s[s.FAIL = 0] = "FAIL", s[s.SHORTEST = 1] = "SHORTEST", s[s.LONGEST = 2] = "LONGEST";
+(function(r) {
+  r[r.FAIL = 0] = "FAIL", r[r.SHORTEST = 1] = "SHORTEST", r[r.LONGEST = 2] = "LONGEST";
 })(x || (x = {}));
-class C extends i {
+class C extends a {
   constructor(t, e) {
     super(), this.upstream = t, this.bufferSize = e, this.buffer = new z(e);
   }
@@ -824,8 +741,8 @@ class C extends i {
   }
 }
 class et extends C {
-  constructor(t, e, r) {
-    super(t, e), this.upstream = t, this.windowSize = e, this.upstreamExhausted = !1, this.random = R.alea(r || g().toString()), this.lastRead = Promise.resolve({ value: null, done: !1 });
+  constructor(t, e, s) {
+    super(t, e), this.upstream = t, this.windowSize = e, this.upstreamExhausted = !1, this.random = g.alea(s || R().toString()), this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
   async next() {
     return this.lastRead = this.lastRead.then(() => this.serialNext()), this.lastRead;
@@ -847,23 +764,6 @@ class et extends C {
     return { value: null, done: !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 T {
   constructor() {
     this.size = null;
@@ -929,11 +829,11 @@ class T {
    * @doc {heading: 'Data', subheading: 'Classes'}
    */
   batch(t, e = !0) {
-    const r = this;
-    N(t > 0, () => `batchSize needs to be positive, but it is
+    const s = this;
+    k(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), u(async () => (await r.iterator()).columnMajorBatch(t, e, st), 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), u(async () => (await s.iterator()).columnMajorBatch(t, e, rt), n);
   }
   /**
    * Concatenates this `Dataset` with another.
@@ -952,8 +852,8 @@ class T {
    */
   concatenate(t) {
     const e = this;
-    let r;
-    return this.size === 1 / 0 || t.size === 1 / 0 ? r = 1 / 0 : this.size != null && t.size != null ? r = this.size + t.size : r = null, u(async () => (await e.iterator()).concatenate(await t.iterator()), r);
+    let s;
+    return this.size === 1 / 0 || t.size === 1 / 0 ? s = 1 / 0 : this.size != null && t.size != null ? s = this.size + t.size : s = null, u(async () => (await e.iterator()).concatenate(await t.iterator()), s);
   }
   /**
    * Filters this dataset according to `predicate`.
@@ -973,8 +873,8 @@ class T {
    */
   filter(t) {
     const e = this;
-    let r;
-    return this.size === 1 / 0 ? r = 1 / 0 : r = null, u(async () => (await e.iterator()).filter((n) => y(() => t(n))), r);
+    let s;
+    return this.size === 1 / 0 ? s = 1 / 0 : s = null, u(async () => (await e.iterator()).filter((n) => y(() => t(n))), s);
   }
   /**
    * Apply a function to every element of the dataset.
@@ -1012,7 +912,7 @@ class T {
    */
   map(t) {
     const e = this;
-    return u(async () => (await e.iterator()).map((r) => y(() => t(r))), this.size);
+    return u(async () => (await e.iterator()).map((s) => y(() => t(s))), this.size);
   }
   /**
    * Maps this dataset through an async 1-to-1 transform.
@@ -1076,11 +976,11 @@ class T {
    */
   repeat(t) {
     const e = this;
-    let r;
-    return this.size != null && t > 0 ? r = this.size * t : t === 0 ? r = 0 : this.size != null && (t === void 0 || t < 0) ? r = 1 / 0 : r = null, u(async () => {
+    let s;
+    return this.size != null && t > 0 ? s = this.size * t : t === 0 ? s = 0 : this.size != null && (t === void 0 || t < 0) ? s = 1 / 0 : s = null, u(async () => {
       const n = q(async () => ({ value: await e.iterator(), done: !1 }));
       return Q(n.take(t));
-    }, r);
+    }, s);
   }
   /**
    * Creates a `Dataset` that skips `count` initial elements from this dataset.
@@ -1101,8 +1001,8 @@ class T {
    */
   skip(t) {
     const e = this;
-    let r;
-    return this.size != null && t >= 0 && this.size >= t ? r = this.size - t : this.size != null && (this.size < t || t === void 0 || t < 0) ? r = 0 : r = null, u(async () => (await e.iterator()).skip(t), r);
+    let s;
+    return this.size != null && t >= 0 && this.size >= t ? s = this.size - t : this.size != null && (this.size < t || t === void 0 || t < 0) ? s = 0 : s = null, u(async () => (await e.iterator()).skip(t), s);
   }
   /**
    * Pseudorandomly shuffles the elements of this dataset. This is done in a
@@ -1125,13 +1025,13 @@ class T {
    *
    * @doc {heading: 'Data', subheading: 'Classes'}
    */
-  shuffle(t, e, r = !0) {
+  shuffle(t, e, s = !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 = R.alea(e || g().toString());
+    const n = this, i = g.alea(e || R().toString());
     return u(async () => {
-      let l = a.int32();
-      return r && (l += a.int32()), (await n.iterator()).shuffle(t, l.toString());
+      let l = i.int32();
+      return s && (l += i.int32()), (await n.iterator()).shuffle(t, l.toString());
     }, this.size);
   }
   /**
@@ -1153,8 +1053,8 @@ class T {
    */
   take(t) {
     const e = this;
-    let r;
-    return this.size != null && this.size > t ? r = t : this.size != null && this.size <= t ? r = this.size : r = null, u(async () => (await e.iterator()).take(t), r);
+    let s;
+    return this.size != null && this.size > t ? s = t : this.size != null && this.size <= t ? s = this.size : s = null, u(async () => (await e.iterator()).take(t), s);
   }
   /**
    * Collect all elements of this dataset into an array.
@@ -1195,7 +1095,7 @@ class T {
   }
 }
 T.MAX_BUFFER_SIZE = 1e4;
-function u(s, t = null) {
+function u(r, t = null) {
   return new class extends T {
     constructor() {
       super(...arguments), this.size = t;
@@ -1205,20 +1105,20 @@ function u(s, t = null) {
      * from any underlying `Dataset`s.
      */
     async iterator() {
-      return s();
+      return r();
     }
   }();
 }
-function st(s) {
-  if (s === null)
+function rt(r) {
+  if (r === null)
     return null;
-  const t = s[0];
-  return M(t) ? { value: rt(s), recurse: !1 } : { value: null, recurse: !0 };
+  const t = r[0];
+  return M(t) ? { value: st(r), recurse: !1 } : { value: null, recurse: !0 };
 }
-function rt(s) {
-  if (s.length === 0)
+function st(r) {
+  if (r.length === 0)
     throw new Error("Can't make a batch of zero elements.");
-  return s[0] instanceof h ? $(s) : B(s);
+  return r[0] instanceof h ? $(r) : B(r);
 }
 export {
   u as d,