@genai-fi/nanogpt 0.10.2 → 0.10.3

package/dist/{tfjs_backend-CNkSTL0c.js → tfjs_backend-y1cvNhLA.js}

@@ -1,107 +1,99 @@
-import { A as g, B as $, i as _e, E as M, n as x, j as ie, w as ue, R as Te, t as A, G as ge, m as ke, l as Ee, S as Ie } from "./index-D6Q1lPZO.js";
-import { a as y, s as ae, v as le } from "./tensor-CzmOBsdf.js";
-import { t as Le } from "./tensor1d-BlUT89BP.js";
-import { r as Ne, d as be } from "./dropout-B1x1kYMa.js";
-import { s as C } from "./slice-DvovR5wq.js";
-import { r as c } from "./reshape-CaPQzFvz.js";
-import { g as Ce } from "./gather-CH9sdacz.js";
-import { s as ve, b as Fe, m as Pe, l as je, o as Be } from "./selu_util-BGPXmd4B.js";
-import { a1 as Me, m as fe, a2 as he } from "./tensor_util-DfwaWayG.js";
-import { t as Ue } from "./tile-CR074jmp.js";
-import { m as w } from "./mat_mul-C59XWcJd.js";
-import { t as xe } from "./transpose-DH4gmHvu.js";
-import { c as j } from "./concat-DmBLPVGC.js";
-function Ge(e, n, t) {
-  const s = $(e, "x", "clipByValue");
-  if (y(n <= t, () => `Error in clip: min (${n}) must be less than or equal to max (${t}).`), n === t)
-    return _e(s.shape, n, s.dtype);
-  const r = { x: s }, o = { clipValueMin: n, clipValueMax: t };
-  return M.runKernel(Me, r, o);
-}
-const Ve = /* @__PURE__ */ g({ clipByValue_: Ge });
-function qe(e) {
-  return j(
+import { A as w, B as S, l as T, E as q, x as U, L as ie, h as ue, a3 as ae, a6 as le, aX as fe, aF as he, aY as Te, t as $, X as ge, m as ke, w as _e, aZ as Ie } from "./index-DOvlwCh-.js";
+import { t as Ee } from "./tensor1d-D11P_7Dp.js";
+import { r as Le, d as Ne } from "./dropout-BcvN9JYi.js";
+import { s as F } from "./slice-BfEGSH82.js";
+import { r as c } from "./reshape-ByE68wS9.js";
+import { g as be } from "./gather-D3JcZUaI.js";
+import { e as Fe } from "./step-CINUs5QB.js";
+import { c as Ce } from "./clip_by_value-BnO7-a88.js";
+import { t as Pe } from "./tile-mbfagpsB.js";
+import { s as ve, b as Me, c as je, g as Ve } from "./selu_util-kbhpTdYD.js";
+import { m as k } from "./mat_mul-SjpJRLyL.js";
+import { t as Ue } from "./transpose-ClWiBS_b.js";
+import { c as M } from "./concat-BV8bt5H-.js";
+function Be(e) {
+  return M(
     e,
     0
     /* axis */
   );
 }
-const Je = /* @__PURE__ */ g({ concat1d_: qe });
-function Ke(e, n) {
-  return j(e, n);
+const xe = /* @__PURE__ */ w({ concat1d_: Be });
+function Ge(e, n) {
+  return M(e, n);
 }
-const Re = /* @__PURE__ */ g({ concat2d_: Ke });
+const Je = /* @__PURE__ */ w({ concat2d_: Ge });
+function qe(e, n) {
+  return M(e, n);
+}
+const Ke = /* @__PURE__ */ w({ concat3d_: qe });
 function Ze(e, n) {
-  return j(e, n);
+  return M(e, n);
 }
-const We = /* @__PURE__ */ g({ concat3d_: Ze });
-function Ye(e, n) {
-  return j(e, n);
+const Re = /* @__PURE__ */ w({ concat4d_: Ze });
+function Ye(e, n, t) {
+  const s = S(e, "x", "slice1d");
+  return T(s.rank === 1, () => `slice1d expects a rank-1 tensor, but got a rank-${s.rank} tensor`), F(s, [n], [t]);
 }
-const He = /* @__PURE__ */ g({ concat4d_: Ye });
-function Qe(e, n, t) {
-  const s = $(e, "x", "slice1d");
-  return y(s.rank === 1, () => `slice1d expects a rank-1 tensor, but got a rank-${s.rank} tensor`), C(s, [n], [t]);
+const H = /* @__PURE__ */ w({ slice1d_: Ye });
+function We(e, n, t) {
+  const s = S(e, "x", "slice2d");
+  return T(s.rank === 2, () => `slice2d expects a rank-2 tensor, but got a rank-${s.rank} tensor`), F(s, n, t);
 }
-const Q = /* @__PURE__ */ g({ slice1d_: Qe });
+const we = /* @__PURE__ */ w({ slice2d_: We });
 function Xe(e, n, t) {
-  const s = $(e, "x", "slice2d");
-  return y(s.rank === 2, () => `slice2d expects a rank-2 tensor, but got a rank-${s.rank} tensor`), C(s, n, t);
-}
-const we = /* @__PURE__ */ g({ slice2d_: Xe });
-function ze(e, n, t) {
-  const s = $(e, "x", "slice3d");
-  return y(s.rank === 3, () => `slice3d expects a rank-3 tensor, but got a rank-${s.rank} tensor`), C(s, n, t);
-}
-const X = /* @__PURE__ */ g({ slice3d_: ze });
-function en(e, n, t) {
-  const s = $(e, "x", "slice4d");
-  return y(s.rank === 4, () => `slice4d expects a rank-4 tensor, but got a rank-${s.rank} tensor`), C(s, n, t);
-}
-const U = /* @__PURE__ */ g({ slice4d_: en });
-function nn({ a: e, b: n, transposeA: t = !1, transposeB: s = !1, bias: r, activation: o = "linear", preluActivationWeights: a, leakyreluAlpha: f = 0.2 }) {
-  if (ve(M.state.gradientDepth, o) === !1) {
-    let D = w(e, n, t, s);
-    return r != null && (D = x(D, r)), Fe(D, o, a, f);
+  const s = S(e, "x", "slice3d");
+  return T(s.rank === 3, () => `slice3d expects a rank-3 tensor, but got a rank-${s.rank} tensor`), F(s, n, t);
+}
+const Q = /* @__PURE__ */ w({ slice3d_: Xe });
+function He(e, n, t) {
+  const s = S(e, "x", "slice4d");
+  return T(s.rank === 4, () => `slice4d expects a rank-4 tensor, but got a rank-${s.rank} tensor`), F(s, n, t);
+}
+const V = /* @__PURE__ */ w({ slice4d_: He });
+function Qe({ a: e, b: n, transposeA: t = !1, transposeB: s = !1, bias: r, activation: o = "linear", preluActivationWeights: a, leakyreluAlpha: f = 0.2 }) {
+  if (ve(q.state.gradientDepth, o) === !1) {
+    let D = k(e, n, t, s);
+    return r != null && (D = U(D, r)), Me(D, o, a, f);
   }
-  let i = $(e, "a", "fused matMul"), u = $(n, "b", "fused matMul");
-  [i, u] = fe(i, u);
-  const m = t ? i.shape[i.rank - 2] : i.shape[i.rank - 1], d = s ? u.shape[u.rank - 1] : u.shape[u.rank - 2], T = t ? i.shape[i.rank - 1] : i.shape[i.rank - 2], h = s ? u.shape[u.rank - 2] : u.shape[u.rank - 1], ee = i.shape.slice(0, -2), E = u.shape.slice(0, -2), ne = ae(ee), te = ae(E);
-  y(m === d, () => `Error in fused matMul: inner shapes (${m}) and (${d}) of Tensors with shapes ${i.shape} and ${u.shape} and transposeA=${t} and transposeB=${s} must match.`);
-  const V = ie(i.shape.slice(0, -2), u.shape.slice(0, -2)).concat([T, h]), q = t ? c(i, [ne, m, T]) : c(i, [ne, T, m]), J = s ? c(u, [te, h, d]) : c(u, [te, d, h]);
-  let I;
-  r != null && (I = $(r, "bias", "fused matMul"), [I] = fe(I, i), ie(V, I.shape));
+  let i = S(e, "a", "fused matMul"), u = S(n, "b", "fused matMul");
+  [i, u] = ie(i, u);
+  const m = t ? i.shape[i.rank - 2] : i.shape[i.rank - 1], d = s ? u.shape[u.rank - 1] : u.shape[u.rank - 2], _ = t ? i.shape[i.rank - 1] : i.shape[i.rank - 2], h = s ? u.shape[u.rank - 2] : u.shape[u.rank - 1], ee = i.shape.slice(0, -2), I = u.shape.slice(0, -2), ne = ue(ee), te = ue(I);
+  T(m === d, () => `Error in fused matMul: inner shapes (${m}) and (${d}) of Tensors with shapes ${i.shape} and ${u.shape} and transposeA=${t} and transposeB=${s} must match.`);
+  const x = ae(i.shape.slice(0, -2), u.shape.slice(0, -2)).concat([_, h]), G = t ? c(i, [ne, m, _]) : c(i, [ne, _, m]), J = s ? c(u, [te, h, d]) : c(u, [te, d, h]);
+  let E;
+  r != null && (E = S(r, "bias", "fused matMul"), [E] = ie(E, i), ae(x, E.shape));
   let se;
-  a != null && (se = $(a, "prelu weights", "fused matMul"));
-  const re = (D, v) => {
-    const [S, O, _, B] = v, k = Pe(c(D, _.shape), _, o);
+  a != null && (se = S(a, "prelu weights", "fused matMul"));
+  const re = (D, C) => {
+    const [A, O, y, j] = C, g = je(c(D, y.shape), y, o);
     let L, N;
-    if (!t && !s ? (L = w(k, O, !1, !0), N = w(S, k, !0, !1)) : !t && s ? (L = w(k, O, !1, !1), N = w(k, S, !0, !1)) : t && !s ? (L = w(O, k, !1, !0), N = w(S, k, !1, !1)) : (L = w(O, k, !0, !0), N = w(k, S, !0, !0)), r != null) {
-      const De = je(B, k);
-      return [L, N, De];
+    if (!t && !s ? (L = k(g, O, !1, !0), N = k(A, g, !0, !1)) : !t && s ? (L = k(g, O, !1, !1), N = k(g, A, !0, !1)) : t && !s ? (L = k(O, g, !1, !0), N = k(A, g, !1, !1)) : (L = k(O, g, !0, !0), N = k(g, A, !0, !0)), r != null) {
+      const ye = Ve(j, g);
+      return [L, N, ye];
     } else
       return [L, N];
   }, oe = {
-    a: q,
+    a: G,
     b: J,
-    bias: I,
+    bias: E,
     preluActivationWeights: se
   }, ce = { transposeA: t, transposeB: s, activation: o, leakyreluAlpha: f };
-  return r == null ? ue((v, S, O) => {
-    const _ = (
+  return r == null ? le((C, A, O) => {
+    const y = (
       // tslint:disable-next-line: no-unnecessary-type-assertion
-      M.runKernel(he, oe, ce)
+      q.runKernel(fe, oe, ce)
     );
-    return O([v, S, _]), { value: c(_, V), gradFunc: re };
-  })(q, J) : ue((v, S, O, _) => {
-    const B = (
+    return O([C, A, y]), { value: c(y, x), gradFunc: re };
+  })(G, J) : le((C, A, O, y) => {
+    const j = (
       // tslint:disable-next-line: no-unnecessary-type-assertion
-      M.runKernel(he, oe, ce)
+      q.runKernel(fe, oe, ce)
     );
-    return _([v, S, B, O]), { value: c(B, V), gradFunc: re };
-  })(q, J, I);
+    return y([C, A, j, O]), { value: c(j, x), gradFunc: re };
+  })(G, J, E);
 }
-const pe = /* @__PURE__ */ g({ fusedMatMul_: nn });
+const pe = /* @__PURE__ */ w({ fusedMatMul_: Qe });
 class $e extends Error {
   constructor(n) {
     super(n), Object.setPrototypeOf(this, $e.prototype);
@@ -117,9 +109,9 @@ class l extends Error {
     super(n), Object.setPrototypeOf(this, l.prototype);
   }
 }
-class P extends Error {
+class v extends Error {
   constructor(n) {
-    super(n), Object.setPrototypeOf(this, P.prototype);
+    super(n), Object.setPrototypeOf(this, v.prototype);
   }
 }
 class z extends Error {
@@ -127,7 +119,7 @@ class z extends Error {
     super(n), Object.setPrototypeOf(this, z.prototype);
   }
 }
-function In(e, n) {
+function Tn(e, n) {
   if (Array.isArray(e)) {
     let t = [];
     for (let s = 0; s < n; s++)
@@ -142,45 +134,45 @@ function de(e, n) {
   if (!e)
     throw new z(n);
 }
-function Ln(e, n) {
+function _n(e, n) {
   let t = 0;
   for (const s of e)
     s === n && t++;
   return t;
 }
-function Nn(e) {
+function In(e) {
   return e.length === 1 ? e[0] : e;
 }
-function bn(e) {
+function En(e) {
   return Array.isArray(e) ? e : [e];
 }
-function Cn(e) {
+function Ln(e) {
   const t = e.replace(/(.)([A-Z][a-z0-9]+)/g, "$1_$2").replace(/([a-z])([A-Z])/g, "$1_$2").toLowerCase();
   return t[0] !== "_" ? t : "private" + t;
 }
-function vn(e) {
+function Nn(e) {
   return e.length <= 1 || e.indexOf("_") === -1 ? e : e.replace(/[_]+(\w|$)/g, (n, t) => t.toUpperCase());
 }
 let p = {};
-function Fn(e) {
+function bn(e) {
   if (e == null)
     return null;
   const n = {};
   return n.className = e.getClassName(), n.config = e.getConfig(), n;
 }
-function W(e) {
+function Y(e) {
   if (!(e == null || typeof e != "object"))
     if (Array.isArray(e))
-      e.forEach((n) => W(n));
+      e.forEach((n) => Y(n));
     else {
       const n = Object.keys(e);
       for (const t of n) {
         const s = e[t];
-        s != null && typeof s == "object" && (!Array.isArray(s) && s.type === "ndarray" && typeof s.value == "number" ? e[t] = s.value : W(s));
+        s != null && typeof s == "object" && (!Array.isArray(s) && s.type === "ndarray" && typeof s.value == "number" ? e[t] = s.value : Y(s));
       }
     }
 }
-function Pn(e, n = {}, t = {}, s = "object", r = !1) {
+function Fn(e, n = {}, t = {}, s = "object", r = !1) {
   if (typeof e == "string") {
     const o = e;
     let a;
@@ -215,9 +207,9 @@ function Pn(e, n = {}, t = {}, s = "object", r = !1) {
       const d = Object.assign({}, p);
       for (const h of Object.keys(t))
         p[h] = t[h];
-      W(o.config);
-      const T = i(f, o.config, t, r);
-      return p = Object.assign({}, d), T;
+      Y(o.config);
+      const _ = i(f, o.config, t, r);
+      return p = Object.assign({}, d), _;
     } else {
       const u = Object.assign({}, p);
       for (const d of Object.keys(t))
@@ -227,13 +219,13 @@ function Pn(e, n = {}, t = {}, s = "object", r = !1) {
     }
   }
 }
-function tn(e, n) {
+function ze(e, n) {
   return e < n ? -1 : e > n ? 1 : 0;
 }
-function jn(e, n) {
-  return -1 * tn(e, n);
+function Cn(e, n) {
+  return -1 * ze(e, n);
 }
-function Bn(e) {
+function Pn(e) {
   if (e == null)
     return e;
   const n = [];
@@ -241,7 +233,7 @@ function Bn(e) {
     n.indexOf(t) === -1 && n.push(t);
   return n;
 }
-function Mn(e) {
+function vn(e) {
   if (e == null)
     throw new l(`Invalid value in obj: ${JSON.stringify(e)}`);
   for (const n in e)
@@ -249,63 +241,63 @@ function Mn(e) {
       return !1;
   return !0;
 }
-function G(e, n, t) {
+function B(e, n, t) {
   if (t != null && e.indexOf(t) < 0)
     throw new l(`${t} is not a valid ${n}.  Valid values are ${e} or null/undefined.`);
 }
-function Un(e, n, t = 0, s = 1 / 0) {
+function Mn(e, n, t = 0, s = 1 / 0) {
   return de(t >= 0), de(s >= t), Array.isArray(e) && e.length >= t && e.length <= s && e.every((r) => typeof r === n);
 }
-function sn(e, n) {
-  Array.isArray(e) ? (y(e.length > 0, () => `${n} is unexpectedly an empty array.`), e.forEach((t, s) => sn(t, `element ${s + 1} of ${n}`))) : y(Number.isInteger(e) && e > 0, () => `Expected ${n} to be a positive integer, but got ${Se(e)}.`);
+function en(e, n) {
+  Array.isArray(e) ? (T(e.length > 0, () => `${n} is unexpectedly an empty array.`), e.forEach((t, s) => en(t, `element ${s + 1} of ${n}`))) : T(Number.isInteger(e) && e > 0, () => `Expected ${n} to be a positive integer, but got ${Oe(e)}.`);
 }
-function Se(e) {
-  return e === null ? "null" : Array.isArray(e) ? "[" + e.map((n) => Se(n)).join(",") + "]" : typeof e == "string" ? `"${e}"` : `${e}`;
+function Oe(e) {
+  return e === null ? "null" : Array.isArray(e) ? "[" + e.map((n) => Oe(n)).join(",") + "]" : typeof e == "string" ? `"${e}"` : `${e}`;
 }
-function xn(e, n, t) {
-  let s = t != null ? t() : le(), r;
+function jn(e, n, t) {
+  let s = t != null ? t() : he(), r;
   return (...a) => {
-    const f = t != null ? t() : le();
+    const f = t != null ? t() : he();
     return f - s < n || (s = f, r = e(...a)), r;
   };
 }
-function Gn(e) {
+function Vn(e) {
   return e === "relu" ? "relu" : e === "linear" ? "linear" : e === "elu" ? "elu" : null;
 }
-const rn = ["channelsFirst", "channelsLast"], on = ["nearest", "bilinear"], cn = ["valid", "same", "causal"], un = ["max", "avg"], Vn = ["sum", "mul", "concat", "ave"];
+const nn = ["channelsFirst", "channelsLast"], tn = ["nearest", "bilinear"], sn = ["valid", "same", "causal"], rn = ["max", "avg"], Un = ["sum", "mul", "concat", "ave"];
 const b = /* @__PURE__ */ new Map();
-function an(e) {
-  G(rn, "DataFormat", e);
+function on(e) {
+  B(nn, "DataFormat", e);
 }
-function qn(e) {
-  G(on, "InterpolationFormat", e);
+function Bn(e) {
+  B(tn, "InterpolationFormat", e);
 }
-function Jn(e) {
-  G(cn, "PaddingMode", e);
+function xn(e) {
+  B(sn, "PaddingMode", e);
 }
-function Kn(e) {
-  G(un, "PoolMode", e);
+function Gn(e) {
+  B(rn, "PoolMode", e);
 }
-const F = [], me = "/";
-function Rn(e, n) {
-  F.push(e);
+const P = [], me = "/";
+function Jn(e, n) {
+  P.push(e);
   try {
     const t = n();
-    return F.pop(), t;
+    return P.pop(), t;
   } catch (t) {
-    throw F.pop(), t;
+    throw P.pop(), t;
   }
 }
-function ln() {
-  return F.length === 0 ? "" : F.join(me) + me;
+function cn() {
+  return P.length === 0 ? "" : P.join(me) + me;
 }
-function Zn(e) {
-  if (!Oe(e))
+function qn(e) {
+  if (!Se(e))
     throw new Error("Not a valid tensor name: '" + e + "'");
-  return ln() + e;
+  return cn() + e;
 }
-function Wn(e) {
-  if (!Oe(e))
+function Kn(e) {
+  if (!Se(e))
     throw new Error("Not a valid tensor name: '" + e + "'");
   b.has(e) || b.set(e, 0);
   const n = b.get(e);
@@ -315,21 +307,21 @@ function Wn(e) {
   } else
     return e;
 }
-const fn = new RegExp(/^[A-Za-z0-9][-A-Za-z0-9\._\/]*$/);
-function Oe(e) {
-  return !!e.match(fn);
+const un = new RegExp(/^[A-Za-z0-9][-A-Za-z0-9\._\/]*$/);
+function Se(e) {
+  return !!e.match(un);
 }
-function Yn(e) {
+function Zn(e) {
   return e === parseInt(e.toString(), 10);
 }
-function ye(e, n, t) {
+function De(e, n, t) {
   n == null && (n = 0), t == null && (t = e.length);
   let s = 1;
   for (let r = n; r < t; ++r)
     s *= e[r];
   return s;
 }
-function Hn(e) {
+function Rn(e) {
   if (e.length === 0)
     return Number.NaN;
   let n = Number.POSITIVE_INFINITY;
@@ -339,7 +331,7 @@ function Hn(e) {
   }
   return n;
 }
-function Qn(e) {
+function Yn(e) {
   if (e.length === 0)
     return Number.NaN;
   let n = Number.NEGATIVE_INFINITY;
@@ -349,7 +341,7 @@ function Qn(e) {
   }
   return n;
 }
-function Xn(e, n) {
+function Wn(e, n) {
   if (n < e)
     throw new l(`end (${n}) < begin (${e}) is forbidden.`);
   const t = [];
@@ -358,50 +350,50 @@ function Xn(e, n) {
   return t;
 }
 let K;
-function zn() {
+function Xn() {
   return K == null && (K = Te().epsilon()), K;
 }
-function Y() {
+function W() {
   return "channelsLast";
 }
-function et(e, n) {
+function Hn(e, n) {
   return ge(e, n);
 }
-function hn(e, n = -1) {
+function an(e, n = -1) {
   const t = e.shape.slice();
   return n < 0 && (n = t.length + n + 1), t.splice(n, 0, 1), c(e, t);
 }
-function nt(e, n) {
-  return A(() => {
+function Qn(e, n) {
+  return $(() => {
     if (e.shape.length !== 2)
       throw new l(`repeat() expects a rank-2 tensor, but received a rank-${e.shape.length} tensor.`);
-    const t = hn(e, 1);
-    return pn(t, [1, n, 1]);
+    const t = an(e, 1);
+    return ln(t, [1, n, 1]);
   });
 }
-function tt(e) {
-  const n = [ye(e.shape)];
+function zn(e) {
+  const n = [De(e.shape)];
   return c(e, n);
 }
-function st(e) {
+function et(e) {
   if (e.rank <= 1)
     throw new l(`batchFlatten requires a minimum rank of 2. Got rank: ${e.rank}.`);
-  const n = [e.shape[0], ye(e.shape, 1)];
+  const n = [e.shape[0], De(e.shape, 1)];
   return c(e, n);
 }
-function R(e, n, t) {
-  return A(() => {
+function Z(e, n, t) {
+  return $(() => {
     switch (e.rank) {
       case 1:
-        return Q(e, n, t);
+        return H(e, n, t);
       case 2:
         return we(e, [n, 0], [t, e.shape[1]]);
       case 3:
-        return X(e, [n, 0, 0], [t, e.shape[1], e.shape[2]]);
+        return Q(e, [n, 0, 0], [t, e.shape[1], e.shape[2]]);
       case 4:
-        return U(e, [n, 0, 0, 0], [t, e.shape[1], e.shape[2], e.shape[3]]);
+        return V(e, [n, 0, 0, 0], [t, e.shape[1], e.shape[2], e.shape[3]]);
       case 5:
-        return C(e, [n, 0, 0, 0, 0], [
+        return F(e, [n, 0, 0, 0, 0], [
           t,
           e.shape[1],
           e.shape[2],
@@ -409,7 +401,7 @@ function R(e, n, t) {
           e.shape[4]
         ]);
       case 6:
-        return C(e, [n, 0, 0, 0, 0, 0], [
+        return F(e, [n, 0, 0, 0, 0, 0], [
           t,
           e.shape[1],
           e.shape[2],
@@ -422,57 +414,57 @@ function R(e, n, t) {
     }
   });
 }
-function Z(e, n, t) {
-  return A(() => {
+function R(e, n, t) {
+  return $(() => {
     switch (e.rank) {
       case 1:
-        return Q(e, n, t);
+        return H(e, n, t);
       case 2:
         return we(e, [0, n], [e.shape[0], t]);
       case 3:
-        return X(e, [0, 0, n], [e.shape[0], e.shape[1], t]);
+        return Q(e, [0, 0, n], [e.shape[0], e.shape[1], t]);
       case 4:
-        return U(e, [0, 0, 0, n], [e.shape[0], e.shape[1], e.shape[2], t]);
+        return V(e, [0, 0, 0, n], [e.shape[0], e.shape[1], e.shape[2], t]);
       default:
         throw new l(`sliceAlongLastAxis() received an unsupported tensor rank: ${e.rank}`);
     }
   });
 }
-function rt(e, n, t, s) {
-  return A(() => {
+function nt(e, n, t, s) {
+  return $(() => {
     switch (e.rank) {
       case 1:
-        return Q(e, n, t);
+        return H(e, n, t);
       case 2:
         switch (s) {
           case 1:
-            return R(e, n, t);
-          case 2:
             return Z(e, n, t);
+          case 2:
+            return R(e, n, t);
           default:
             throw new l(`The axis is not within the rank of the tensor ${s}`);
         }
       case 3:
         switch (s) {
           case 1:
-            return R(e, n, t);
+            return Z(e, n, t);
           case 2:
-            return X(e, [0, n, 0], [e.shape[0], t, e.shape[2]]);
+            return Q(e, [0, n, 0], [e.shape[0], t, e.shape[2]]);
           case 3:
-            return Z(e, n, t);
+            return R(e, n, t);
           default:
             throw new l(`The axis is not within the rank of the tensor ${s}`);
         }
       case 4:
         switch (s) {
           case 1:
-            return R(e, n, t);
+            return Z(e, n, t);
           case 2:
-            return U(e, [0, n, 0, 0], [e.shape[0], t, e.shape[2], e.shape[3]]);
+            return V(e, [0, n, 0, 0], [e.shape[0], t, e.shape[2], e.shape[3]]);
           case 3:
-            return U(e, [0, 0, n, 0], [e.shape[0], e.shape[1], t, e.shape[3]]);
+            return V(e, [0, 0, n, 0], [e.shape[0], e.shape[1], t, e.shape[3]]);
           case 4:
-            return Z(e, n, t);
+            return R(e, n, t);
           default:
             throw new l(`The axis is not within the rank of the tensor ${s}`);
         }
@@ -481,39 +473,39 @@ function rt(e, n, t, s) {
     }
   });
 }
-function ot(e, n = -1) {
+function tt(e, n = -1) {
   let t;
-  return n < 0 && (t = e[0].rank, t !== 0 ? n = t : n = 0), n === e[0].rank && (n = -1), j(e, n);
+  return n < 0 && (t = e[0].rank, t !== 0 ? n = t : n = 0), n === e[0].rank && (n = -1), M(e, n);
 }
-function ct(e, n) {
+function st(e, n) {
   switch (e.rank) {
     case 1:
-      return Je([e, n]);
+      return xe([e, n]);
     case 2:
-      return Re([e, n], 0);
+      return Je([e, n], 0);
     case 3:
-      return We([e, n], 0);
+      return Ke([e, n], 0);
     case 4:
-      return He([e, n], 0);
+      return Re([e, n], 0);
     default:
       throw new l(`concatAlongFirstAxis() received an unsupported tensor rank: ${e.rank}`);
   }
 }
-function pn(e, n) {
+function ln(e, n) {
   if (Array.isArray(n) || (n = [n]), e.rank !== n.length)
     throw new l(`The length of input n (${n.length}) does not match the number of dimensions in input x (${e.rank})`);
-  return Ue(e, n);
+  return Pe(e, n);
 }
-function it(e, n = 0, t = 1, s, r) {
-  return Ne(e, n, t, s, r);
+function rt(e, n = 0, t = 1, s, r) {
+  return Le(e, n, t, s, r);
 }
-function ut(e, n, t, s) {
+function ot(e, n, t, s) {
   if (e.rank < 2 || n.rank < 2)
-    throw new P(`dot requires both inputs to be rank >= 2 but got x shape = ${e.shape} and y shape = ${n.shape}`);
+    throw new v(`dot requires both inputs to be rank >= 2 but got x shape = ${e.shape} and y shape = ${n.shape}`);
   if (n.rank >= 3) {
     const r = e.shape.slice(-1)[0], o = n.shape.slice(-2)[0];
     if (r !== o)
-      throw new P(`If rank y >= 3, then the second last dim of y must equal the last dim of x but got x shape = ${e.shape} and  y shape = ${n.shape}`);
+      throw new v(`If rank y >= 3, then the second last dim of y must equal the last dim of x but got x shape = ${e.shape} and  y shape = ${n.shape}`);
   }
   if (e.rank === 2 && n.rank === 2)
     return pe({
@@ -521,32 +513,32 @@ function ut(e, n, t, s) {
       b: n,
       transposeA: !1,
       transposeB: !1,
-      bias: s ? H(e.rank, s, Y()) : null,
+      bias: s ? X(e.rank, s, W()) : null,
       activation: t
     });
   {
     const r = e.shape.slice(), o = r.pop();
     e = c(e, [-1, o]);
-    const a = n.shape.slice(), f = a.pop(), i = a.pop(), u = [...a, f], m = Array.from({ length: n.rank }, (ee, E) => E === 0 ? n.rank - 2 : E <= n.rank - 2 ? E - 1 : E);
-    n = c(xe(n, m), [i, -1]);
+    const a = n.shape.slice(), f = a.pop(), i = a.pop(), u = [...a, f], m = Array.from({ length: n.rank }, (ee, I) => I === 0 ? n.rank - 2 : I <= n.rank - 2 ? I - 1 : I);
+    n = c(Ue(n, m), [i, -1]);
     const d = [...r, ...u];
     return c(pe({
       a: e,
       b: n,
       transposeA: !1,
       transposeB: !1,
-      bias: s ? H(e.rank, s, Y()) : null,
+      bias: s ? X(e.rank, s, W()) : null,
       activation: t
     }), d);
   }
 }
-function at(e, n, t) {
-  return A(() => (Array.isArray(n) ? n = Le(n, "int32") : n = ge(n, "int32"), Ce(e, n, t)));
+function ct(e, n, t) {
+  return $(() => (Array.isArray(n) ? n = Ee(n, "int32") : n = ge(n, "int32"), be(e, n, t)));
 }
-function lt(e) {
+function it(e) {
   return ke(e, e);
 }
-function H(e, n, t) {
+function X(e, n, t) {
   const s = n.shape;
   if (n.rank !== 1 && n.rank !== e)
     throw new l(`Unexpected bias dimensions: ${n.rank}; expected it to be 1 or ${e}`);
@@ -569,85 +561,84 @@ function H(e, n, t) {
     return n;
   throw new l(`Unsupported input rank by biasAdd: ${n.rank}`);
 }
-function ft(e, n, t) {
-  return A(() => (t == null && (t = Y()), an(t), x(e, H(e.rank, n, t))));
+function ut(e, n, t) {
+  return $(() => (t == null && (t = W()), on(t), U(e, X(e.rank, n, t))));
 }
-function ht(e, n = 1) {
+function at(e, n = 1) {
   if (n !== 1)
-    throw new P(`Support for alpha values other than 1 (${n}) is not implemented yet.`);
-  return Be(e);
+    throw new v(`Support for alpha values other than 1 (${n}) is not implemented yet.`);
+  return Fe(e);
 }
-function pt(e) {
-  return A(() => Ee(e, x(Ie(e), 1)));
+function lt(e) {
+  return $(() => _e(e, U(Ie(e), 1)));
 }
-function dt(e, n, t, s) {
-  return A(() => be(e, n, t, s));
+function ft(e, n, t, s) {
+  return $(() => Ne(e, n, t, s));
 }
-function mt(e) {
-  return A(() => {
-    const n = x(0.5, ke(0.2, e));
-    return Ve(n, 0, 1);
+function ht(e) {
+  return $(() => {
+    const n = U(0.5, ke(0.2, e));
+    return Ce(n, 0, 1);
   });
 }
-function gt(e, n, t = !1) {
+function pt(e, n, t = !1) {
   return t ? e() : n();
 }
 export {
-  st as $,
+  Qn as $,
   $e as A,
-  hn as B,
-  at as C,
-  Xn as D,
-  Ln as E,
+  ct as B,
+  Wn as C,
+  _n as D,
+  at as E,
   ht as F,
-  mt as G,
-  pt as H,
-  Qn as I,
-  Yn as J,
-  Un as K,
-  ft as L,
-  rt as M,
-  P as N,
-  qn as O,
-  sn as P,
-  Gn as Q,
+  lt as G,
+  Yn as H,
+  Zn as I,
+  Mn as J,
+  ut as K,
+  nt as L,
+  Bn as M,
+  v as N,
+  en as O,
+  Vn as P,
+  xn as Q,
   Ae as R,
-  Jn as S,
-  Y as T,
-  pn as U,
+  W as S,
+  ln as T,
+  Rn as U,
   l as V,
-  Hn as W,
-  ct as X,
-  gt as Y,
-  dt as Z,
-  ot as _,
-  an as a,
-  nt as a0,
-  Kn as a1,
-  Vn as a2,
-  ye as b,
-  G as c,
-  ut as d,
-  Pn as e,
-  Wn as f,
-  Zn as g,
-  Nn as h,
-  bn as i,
-  Ve as j,
-  zn as k,
-  xn as l,
-  tt as m,
-  Rn as n,
-  lt as o,
-  de as p,
-  et as q,
-  it as r,
-  Fn as s,
-  Cn as t,
-  vn as u,
-  Bn as v,
-  jn as w,
-  In as x,
-  Mn as y,
-  R as z
+  st as W,
+  pt as X,
+  ft as Y,
+  tt as Z,
+  et as _,
+  on as a,
+  Gn as a0,
+  Un as a1,
+  De as b,
+  B as c,
+  ot as d,
+  Fn as e,
+  Kn as f,
+  qn as g,
+  In as h,
+  En as i,
+  Xn as j,
+  jn as k,
+  zn as l,
+  it as m,
+  Jn as n,
+  de as o,
+  Hn as p,
+  Nn as q,
+  rt as r,
+  bn as s,
+  Ln as t,
+  Pn as u,
+  Cn as v,
+  Tn as w,
+  vn as x,
+  Z as y,
+  an as z
 };