@genai-fi/nanogpt 0.10.2 → 0.10.3

package/dist/{dataset-D2P7rHAw.js → dataset-BcwmTGYc.js}

@@ -1,84 +1,82 @@
-import { d as v, t as y } from "./index-D6Q1lPZO.js";
-import { s as g } from "./index-CieiGp4Y.js";
-import { C as S, T as h, e as N, v as R, a as k } from "./tensor-CzmOBsdf.js";
-import { t as o, O as p } from "./tensor_util-DfwaWayG.js";
-import { s as $ } from "./stack-ChnHwRpX.js";
-import { t as B } from "./tensor-0r5yOo2R.js";
-function _(r, t) {
-  return b(r, t);
+import { aC as S, a8 as h, j as N, d as v, aD as o, aE as p, aF as g, l as k, t as y } from "./index-DOvlwCh-.js";
+import { s as R } from "./index-CieiGp4Y.js";
+import { s as $ } from "./stack-Cf4n9h0N.js";
+import { t as B } from "./tensor-DJoc7gJU.js";
+function _(s, t) {
+  return b(s, t);
 }
-function b(r, t, e = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Set()) {
-  if (r == null)
+function b(s, t, e = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Set()) {
+  if (s == null)
     return null;
-  if (typeof Blob == "function" && r instanceof Blob)
-    return r.slice();
-  if (s.has(r))
+  if (typeof Blob == "function" && s instanceof Blob)
+    return s.slice();
+  if (r.has(s))
     throw new Error("Circular references are not supported.");
-  if (e.has(r))
-    return e.get(r);
-  const n = t(r);
+  if (e.has(s))
+    return e.get(s);
+  const n = t(s);
   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(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;
+    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;
       }
-      return s.delete(r), r.__proto__ && (i.__proto__ = r.__proto__), i;
+      return r.delete(s), s.__proto__ && (a.__proto__ = s.__proto__), a;
     } else
-      throw new Error(`Can't recurse into non-iterable type: ${r}`);
-  else return e.set(r, n.value), n.value;
+      throw new Error(`Can't recurse into non-iterable type: ${s}`);
+  else return e.set(s, n.value), n.value;
 }
-function P(r, t = I) {
-  return E(r, t);
+function P(s, t = I) {
+  return E(s, t);
 }
-function E(r, t, e = /* @__PURE__ */ new Set()) {
-  const s = r[0];
-  if (e.has(s))
+function E(s, t, e = /* @__PURE__ */ new Set()) {
+  const r = s[0];
+  if (e.has(r))
     throw new Error("Circular references are not supported.");
-  const n = t(r);
+  const n = t(s);
   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(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;
+    if (c(r)) {
+      const a = Array.isArray(r) ? [] : {};
+      e.add(r);
+      for (const l in r) {
+        const d = s.map((T) => T[l]), m = E(d, t, e);
+        a[l] = m;
       }
-      return e.delete(s), i;
+      return e.delete(r), a;
     } else
-      throw new Error(`Can't recurse into non-iterable type: ${s}`);
+      throw new Error(`Can't recurse into non-iterable type: ${r}`);
   else return n.value;
 }
-function I(r) {
-  return r === null ? null : c(r[0]) ? { value: null, recurse: !0 } : { value: r, recurse: !1 };
+function I(s) {
+  return s === null ? null : c(s[0]) ? { value: null, recurse: !0 } : { value: s, recurse: !1 };
 }
-function c(r) {
+function c(s) {
   let t = !1;
   if (N().get("IS_BROWSER"))
-    t = r instanceof TextDecoder;
+    t = s instanceof TextDecoder;
   else {
     const { StringDecoder: e } = require("string_decoder");
-    t = r instanceof e;
+    t = s instanceof e;
   }
-  return r != null && !ArrayBuffer.isView(r) && (Array.isArray(r) || typeof r == "object" && !(r instanceof h) && !(r instanceof Promise) && !t);
+  return s != null && !ArrayBuffer.isView(s) && (Array.isArray(s) || typeof s == "object" && !(s instanceof h) && !(s instanceof Promise) && !t);
 }
-function M(r) {
-  return r == null || L(r) || Array.isArray(r) || typeof r == "object" && r instanceof h || S(r);
+function M(s) {
+  return s == null || L(s) || Array.isArray(s) || typeof s == "object" && s instanceof h || S(s);
 }
-function L(r) {
-  return r === null || typeof r != "object" && typeof r != "function";
+function L(s) {
+  return s === null || typeof s != "object" && typeof s != "function";
 }
-function D(r) {
-  return _(r, O);
+function D(s) {
+  return _(s, O);
 }
-function O(r) {
-  return r instanceof h ? { value: r.clone(), recurse: !1 } : c(r) ? { value: null, recurse: !0 } : { value: r, recurse: !1 };
+function O(s) {
+  return s instanceof h ? { value: s.clone(), recurse: !1 } : c(s) ? { value: null, recurse: !0 } : { value: s, recurse: !1 };
 }
 class z {
   /**
@@ -187,8 +185,8 @@ class z {
   shuffleExcise(t) {
     if (this.isEmpty())
       throw new RangeError("Ring buffer is empty.");
-    const e = this.wrap(this.begin + t), s = this.get(e);
-    return this.set(e, this.pop()), s;
+    const e = this.wrap(this.begin + t), r = this.get(e);
+    return this.set(e, this.pop()), r;
   }
 }
 class f extends z {
@@ -211,23 +209,23 @@ class f extends z {
    * Doubles the capacity of the buffer.
    */
   expand() {
-    const t = this.capacity * 2, e = new Array(t), s = this.length();
-    for (let n = 0; n < s; n++)
+    const t = this.capacity * 2, e = new Array(t), r = this.length();
+    for (let n = 0; n < r; 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 = s;
+    this.data = e, this.capacity = t, this.doubledCapacity = 2 * this.capacity, this.begin = 0, this.end = r;
   }
 }
 f.INITIAL_CAPACITY = 32;
-function H(r) {
-  return new G(r);
+function H(s) {
+  return new G(s);
 }
-function q(r) {
-  return new W(r);
+function q(s) {
+  return new W(s);
 }
-function Q(r, t) {
-  return new A(r, t);
+function Q(s, t) {
+  return new A(s, t);
 }
-class a {
+class i {
   /**
    * Collect all remaining elements of a bounded stream into an array.
    * Obviously this will succeed only for small streams that fit in memory.
@@ -256,9 +254,9 @@ class a {
    */
   async toArrayForTest() {
     const t = this.prefetch(100), e = [];
-    let s = await t.next();
-    for (; !s.done; )
-      e.push(s.value), s = await t.next();
+    let r = await t.next();
+    for (; !r.done; )
+      e.push(r.value), r = await t.next();
     return e;
   }
   /**
@@ -281,9 +279,9 @@ class a {
    * fully processed.
    */
   async resolveWhile(t) {
-    let e = await this.next(), s = t(e.value);
-    for (; !e.done && s; )
-      e = await this.next(), s = t(e.value);
+    let e = await this.next(), r = t(e.value);
+    for (; !e.done && r; )
+      e = await this.next(), r = t(e.value);
   }
   /**
    * Handles errors thrown on this stream using a provided handler function.
@@ -298,7 +296,7 @@ class a {
    *   throw an `Error`.
    */
   handleErrors(t) {
-    return new Z(this, t);
+    return new j(this, t);
   }
   // TODO(soergel): Implement reduce() etc.
   /**
@@ -427,8 +425,8 @@ class a {
    * @returns A `LazyIterator` of batches of elements, represented as an object
    *   with collections at the leaves.
    */
-  columnMajorBatch(t, e = !0, s = I) {
-    return this.rowMajorBatch(t, e).map((i) => P(i, s));
+  columnMajorBatch(t, e = !0, r = I) {
+    return this.rowMajorBatch(t, e).map((a) => P(a, r));
   }
   /**
    * Concatenate this `LazyIterator` with another.
@@ -494,7 +492,7 @@ class a {
     return new U(this);
   }
 }
-class G extends a {
+class G extends i {
   constructor(t) {
     super(), this.items = t, this.trav = 0;
   }
@@ -508,7 +506,7 @@ class G extends a {
     return this.trav++, { value: D(t), done: !1 };
   }
 }
-class W extends a {
+class W extends i {
   constructor(t) {
     super(), this.nextFn = t;
   }
@@ -523,7 +521,7 @@ class W extends a {
     }
   }
 }
-class U extends a {
+class U extends i {
   constructor(t) {
     super(), this.upstream = t, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -537,7 +535,7 @@ class U extends a {
     return this.upstream.next();
   }
 }
-class Y extends a {
+class Y extends i {
   constructor(t, e) {
     super(), this.upstream = t, this.maxCount = e, this.count = 0, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -557,7 +555,7 @@ class Y extends a {
     return this.upstream.next();
   }
 }
-class J extends a {
+class J extends i {
   constructor(t, e) {
     super(), this.upstream = t, this.maxCount = e, this.count = 0;
   }
@@ -568,9 +566,9 @@ class J extends a {
     return this.count++ >= this.maxCount ? { value: null, done: !0 } : this.upstream.next();
   }
 }
-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 });
+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 });
   }
   summary() {
     return `${this.upstream.summary()} -> RowMajorBatch`;
@@ -589,7 +587,7 @@ class V extends a {
     return { value: t, done: !1 };
   }
 }
-class X extends a {
+class X extends i {
   constructor(t, e) {
     super(), this.upstream = t, this.predicate = e, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -608,7 +606,7 @@ class X extends a {
     }
   }
 }
-class K extends a {
+class K extends i {
   constructor(t, e) {
     super(), this.upstream = t, this.transform = e;
   }
@@ -619,13 +617,13 @@ class K extends a {
     const t = await this.upstream.next();
     if (t.done)
       return { value: null, done: !0 };
-    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 };
+    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 };
   }
 }
-class Z extends a {
+class j extends i {
   constructor(t, e) {
     super(), this.upstream = t, this.handler = e, this.count = 0, this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -645,7 +643,7 @@ class Z extends a {
       }
   }
 }
-class w extends a {
+class w extends i {
   constructor(t, e) {
     super(), this.upstream = t, this.transform = e;
   }
@@ -656,13 +654,13 @@ class w extends a {
     const t = await this.upstream.next();
     if (t.done)
       return { value: null, done: !0 };
-    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 };
+    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 };
   }
 }
-class j extends a {
+class Z extends i {
   constructor() {
     super(), this.outputQueue = new f(), this.lastRead = Promise.resolve({ value: null, done: !1 });
   }
@@ -676,7 +674,7 @@ class j extends a {
     return { value: this.outputQueue.shift(), done: !1 };
   }
 }
-class tt extends j {
+class tt extends Z {
   constructor(t, e) {
     super(), this.upstream = t, this.transform = e;
   }
@@ -687,14 +685,14 @@ class tt extends j {
     const t = await this.upstream.next();
     if (t.done)
       return !1;
-    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();
+    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();
     return !0;
   }
 }
-class A extends a {
+class A extends i {
   constructor(t, e) {
     super(), this.baseErrorHandler = e, this.lastRead = null, this.iterator = null, this.moreIterators = t;
   }
@@ -706,20 +704,20 @@ class A extends a {
   }
   async readFromChain(t) {
     if (await t, this.iterator == null) {
-      const s = await this.moreIterators.next();
-      if (s.done)
+      const r = await this.moreIterators.next();
+      if (r.done)
         return { value: null, done: !0 };
-      this.iterator = s.value, this.baseErrorHandler != null && (this.iterator = this.iterator.handleErrors(this.baseErrorHandler));
+      this.iterator = r.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(r) {
-  r[r.FAIL = 0] = "FAIL", r[r.SHORTEST = 1] = "SHORTEST", r[r.LONGEST = 2] = "LONGEST";
+(function(s) {
+  s[s.FAIL = 0] = "FAIL", s[s.SHORTEST = 1] = "SHORTEST", s[s.LONGEST = 2] = "LONGEST";
 })(x || (x = {}));
-class C extends a {
+class C extends i {
   constructor(t, e) {
     super(), this.upstream = t, this.bufferSize = e, this.buffer = new z(e);
   }
@@ -741,8 +739,8 @@ class C extends a {
   }
 }
 class et extends C {
-  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 });
+  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 });
   }
   async next() {
     return this.lastRead = this.lastRead.then(() => this.serialNext()), this.lastRead;
@@ -764,7 +762,7 @@ class et extends C {
     return { value: null, done: !0 };
   }
 }
-class T {
+class F {
   constructor() {
     this.size = null;
   }
@@ -829,11 +827,11 @@ class T {
    * @doc {heading: 'Data', subheading: 'Classes'}
    */
   batch(t, e = !0) {
-    const s = this;
+    const r = 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 s.iterator()).columnMajorBatch(t, e, rt), 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);
   }
   /**
    * Concatenates this `Dataset` with another.
@@ -852,8 +850,8 @@ class T {
    */
   concatenate(t) {
     const e = this;
-    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);
+    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);
   }
   /**
    * Filters this dataset according to `predicate`.
@@ -873,8 +871,8 @@ class T {
    */
   filter(t) {
     const e = this;
-    let s;
-    return this.size === 1 / 0 ? s = 1 / 0 : s = null, u(async () => (await e.iterator()).filter((n) => y(() => t(n))), s);
+    let r;
+    return this.size === 1 / 0 ? r = 1 / 0 : r = null, u(async () => (await e.iterator()).filter((n) => y(() => t(n))), r);
   }
   /**
    * Apply a function to every element of the dataset.
@@ -912,7 +910,7 @@ class T {
    */
   map(t) {
     const e = this;
-    return u(async () => (await e.iterator()).map((s) => y(() => t(s))), this.size);
+    return u(async () => (await e.iterator()).map((r) => y(() => t(r))), this.size);
   }
   /**
    * Maps this dataset through an async 1-to-1 transform.
@@ -976,11 +974,11 @@ class T {
    */
   repeat(t) {
     const e = this;
-    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 () => {
+    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 () => {
       const n = q(async () => ({ value: await e.iterator(), done: !1 }));
       return Q(n.take(t));
-    }, s);
+    }, r);
   }
   /**
    * Creates a `Dataset` that skips `count` initial elements from this dataset.
@@ -1001,8 +999,8 @@ class T {
    */
   skip(t) {
     const e = this;
-    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);
+    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);
   }
   /**
    * Pseudorandomly shuffles the elements of this dataset. This is done in a
@@ -1025,13 +1023,13 @@ class T {
    *
    * @doc {heading: 'Data', subheading: 'Classes'}
    */
-  shuffle(t, e, s = !0) {
+  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, i = g.alea(e || R().toString());
+    const n = this, a = R.alea(e || g().toString());
     return u(async () => {
-      let l = i.int32();
-      return s && (l += i.int32()), (await n.iterator()).shuffle(t, l.toString());
+      let l = a.int32();
+      return r && (l += a.int32()), (await n.iterator()).shuffle(t, l.toString());
     }, this.size);
   }
   /**
@@ -1053,8 +1051,8 @@ class T {
    */
   take(t) {
     const e = this;
-    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);
+    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);
   }
   /**
    * Collect all elements of this dataset into an array.
@@ -1094,9 +1092,9 @@ class T {
     return (await this.iterator()).toArrayForTest();
   }
 }
-T.MAX_BUFFER_SIZE = 1e4;
-function u(r, t = null) {
-  return new class extends T {
+F.MAX_BUFFER_SIZE = 1e4;
+function u(s, t = null) {
+  return new class extends F {
     constructor() {
       super(...arguments), this.size = t;
     }
@@ -1105,20 +1103,20 @@ function u(r, t = null) {
      * from any underlying `Dataset`s.
      */
     async iterator() {
-      return r();
+      return s();
     }
   }();
 }
-function rt(r) {
-  if (r === null)
+function st(s) {
+  if (s === null)
     return null;
-  const t = r[0];
-  return M(t) ? { value: st(r), recurse: !1 } : { value: null, recurse: !0 };
+  const t = s[0];
+  return M(t) ? { value: rt(s), recurse: !1 } : { value: null, recurse: !0 };
 }
-function st(r) {
-  if (r.length === 0)
+function rt(s) {
+  if (s.length === 0)
     throw new Error("Can't make a batch of zero elements.");
-  return r[0] instanceof h ? $(r) : B(r);
+  return s[0] instanceof h ? $(s) : B(s);
 }
 export {
   u as d,

package/dist/dropout-BcvN9JYi.js

@@ -0,0 +1,92 @@
+import { A as l, C as h, at as d, n as f, B as m, l as u, a8 as p, w as g, x as V, m as v } from "./index-DOvlwCh-.js";
+import { f as w } from "./floor-D5QdR_le.js";
+import { s as c } from "./index-CieiGp4Y.js";
+class N {
+  constructor(t, e, s, n, o) {
+    this.mean = t, this.stdDev = e, this.dtype = s, this.nextVal = NaN, this.truncated = n, this.truncated && (this.upper = this.mean + this.stdDev * 2, this.lower = this.mean - this.stdDev * 2);
+    const a = o || Math.random();
+    this.random = c.alea(a.toString());
+  }
+  /** Returns next sample from a Gaussian distribution. */
+  nextValue() {
+    if (!isNaN(this.nextVal)) {
+      const n = this.nextVal;
+      return this.nextVal = NaN, n;
+    }
+    let t, e, s = !1;
+    for (; !s; ) {
+      let n, o, a;
+      do
+        n = 2 * this.random() - 1, o = 2 * this.random() - 1, a = n * n + o * o;
+      while (a >= 1 || a === 0);
+      const i = Math.sqrt(-2 * Math.log(a) / a);
+      t = this.mean + this.stdDev * n * i, e = this.mean + this.stdDev * o * i, (!this.truncated || this.isValidTruncated(t)) && (s = !0);
+    }
+    return (!this.truncated || this.isValidTruncated(e)) && (this.nextVal = this.convertValue(e)), this.convertValue(t);
+  }
+  /** Handles proper rounding for non-floating-point numbers. */
+  convertValue(t) {
+    return this.dtype == null || this.dtype === "float32" ? t : Math.round(t);
+  }
+  /** Returns true if less than 2-standard-deviations from the mean. */
+  isValidTruncated(t) {
+    return t <= this.upper && t >= this.lower;
+  }
+}
+class b {
+  constructor(t = 0, e = 1, s, n) {
+    if (this.canReturnFloat = () => this.dtype == null || this.dtype === "float32", this.min = t, this.range = e - t, this.dtype = s, n == null && (n = Math.random()), typeof n == "number" && (n = n.toString()), !this.canReturnFloat() && this.range <= 1)
+      throw new Error(`The difference between ${t} - ${e} <= 1 and dtype is not float`);
+    this.random = c.alea(n);
+  }
+  convertValue(t) {
+    return this.canReturnFloat() ? t : Math.round(t);
+  }
+  nextValue() {
+    return this.convertValue(this.min + this.range * this.random());
+  }
+}
+function T(r, t = 0, e = 1, s, n) {
+  if (h(r), s != null && s === "bool")
+    throw new Error(`Unsupported data type ${s}`);
+  const o = new N(t, e, s, !1, n), a = d(r, s);
+  for (let i = 0; i < a.values.length; i++)
+    a.values[i] = o.nextValue();
+  return a.toTensor();
+}
+const U = /* @__PURE__ */ l({ randomNormal_: T });
+function x(r, t = 0, e = 1, s = "float32", n) {
+  h(r);
+  const o = d(r, s), a = new b(t, e, null, n);
+  for (let i = 0; i < o.values.length; i++)
+    o.values[i] = a.nextValue();
+  return o.toTensor();
+}
+const y = /* @__PURE__ */ l({ randomUniform_: x });
+function M(r, t) {
+  if (t == null)
+    return r.shape.slice();
+  if (f(r.shape, t))
+    return t;
+  if (r.shape.length === t.length) {
+    const e = [];
+    for (let s = 0; s < r.shape.length; s++)
+      t[s] == null && r.shape[s] != null ? e.push(r.shape[s]) : e.push(t[s]);
+    return e;
+  }
+  return t;
+}
+function D(r, t, e, s) {
+  const n = m(r, "x", "dropout");
+  if (u(n.dtype === "float32", () => `x has to be a floating point tensor since it's going to be scaled, but got a ${n.dtype} tensor instead.`), u(t >= 0 && t < 1, () => `rate must be a float in the range [0, 1), but got ${t}.`), t === 0)
+    return r instanceof p ? n.clone() : n;
+  const o = M(n, e), a = 1 - t, i = g(w(V(y(o, 0, 1, "float32", s), a)), a);
+  return v(n, i);
+}
+const F = /* @__PURE__ */ l({ dropout_: D });
+export {
+  N as M,
+  y as a,
+  F as d,
+  U as r
+};

package/dist/expand_dims-DT4tEPwA.js

@@ -0,0 +1,11 @@
+import { A as o, B as a, l as i, E as m, I as p } from "./index-DOvlwCh-.js";
+function c(t, n = 0) {
+  const s = a(t, "x", "expandDims", "string_or_numeric");
+  i(n <= s.rank, () => "Axis must be <= rank of the tensor");
+  const r = { input: s }, e = { dim: n };
+  return m.runKernel(p, r, e);
+}
+const x = /* @__PURE__ */ o({ expandDims_: c });
+export {
+  x as e
+};

package/dist/{exports_initializers-CZSUJoVE.js → exports_initializers-Hta_rEnm.js}

@@ -1,4 +1,4 @@
-import { R as o } from "./random_width-BVV9HveY.js";
+import { R as o } from "./random_width-or-CEftb.js";
 function m(r) {
   return new o(r);
 }