@genai-fi/nanogpt 0.8.0 → 0.8.2

package/dist/{max-B3JOcNGb.js → relu-B1AXs7p5.js}

@@ -1,4 +1,4 @@
-import { B as r, C as e, E as x, X as c } from "./index-CUQrfsw_.js";
+import { C as o, D as e, E as s, _ as t } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -15,11 +15,11 @@ import { B as r, C as e, E as x, X as c } from "./index-CUQrfsw_.js";
  * limitations under the License.
  * =============================================================================
  */
-function m(n, s = null, o = !1) {
-  const t = { x: e(n, "x", "max") }, a = { reductionIndices: s, keepDims: o };
-  return x.runKernel(c, t, a);
+function u(r) {
+  const n = { x: e(r, "x", "relu") };
+  return s.runKernel(t, n);
 }
-const l = /* @__PURE__ */ r({ max_: m });
+const l = /* @__PURE__ */ o({ relu_: u });
 export {
-  l as m
+  l as r
 };

package/dist/{reshape-DEfQGSin.js → reshape-WeJkT3ja.js}

@@ -1,4 +1,4 @@
-import { B as o, C as t, E as a, U as p } from "./index-CUQrfsw_.js";
+import { C as o, D as t, E as a, V as p } from "./index-DdmHGZjq.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.

package/dist/{scatter_nd_util-CUPPNLaA.js → scatter_nd_util-B7yDhiQr.js}

@@ -1,4 +1,4 @@
-import { j as p, a2 as w } from "./index-CUQrfsw_.js";
+import { j as p, a3 as w } from "./index-DdmHGZjq.js";
 function k(o, t, r) {
   const n = t.rank > 1 ? t.shape[t.rank - 1] : 1, e = t.rank > 1 ? t.rank - 1 : 1, h = `Must have updates.shape = indices.shape[:batchDim] + shape[sliceDim:], got updates.shape: ${r.shape}, indices.shape: ${t.shape}, shape: ${o}, sliceDim: ${n}, and batchDim: ${e}.`;
   if (r.rank < e)

package/dist/{selu_util-8vv5JxQV.js → selu_util-BgUO9gHY.js}

@@ -1,6 +1,7 @@
-import { n as N, as as H, B as _, C as S, E as L, at as te, au as ne, ap as se, ar as re, av as ie, aw as oe, ax as le, a as ue, ay as fe, az as O } from "./index-CUQrfsw_.js";
-import { r as ce } from "./reshape-DEfQGSin.js";
-import { s as ae } from "./sum-l_0SqM4h.js";
+import { n as D, aq as H, C, D as N, E as G, ar as te, as as ne, at as se, au as re, av as ie, aw as oe, a as le, ax as ue, ay as R } from "./index-DdmHGZjq.js";
+import { r as fe } from "./relu-B1AXs7p5.js";
+import { r as ce } from "./reshape-WeJkT3ja.js";
+import { s as ae } from "./sum-ByFINZgi.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -17,9 +18,9 @@ import { s as ae } from "./sum-l_0SqM4h.js";
  * limitations under the License.
  * =============================================================================
  */
-function Be(e, t, n, s, r = "NHWC", u) {
+function Ke(e, t, n, s, r = "NHWC", u) {
   const i = e[3], o = [...t, i], c = Ae(r);
-  return B(e, o, n, u, s, null, null, c);
+  return X(e, o, n, u, s, null, null, c);
 }
 function Xe(e, t, n, s, r, u, i = "channelsLast") {
   const [o, c] = T(t);
@@ -30,9 +31,9 @@ function Xe(e, t, n, s, r, u, i = "channelsLast") {
     a = [o, c, e[1], e[1]];
   else
     throw new Error(`Unknown dataFormat ${i}`);
-  return B(e, a, n, s, r, u, !1, i);
+  return X(e, a, n, s, r, u, !1, i);
 }
-function je(e, t, n, s, r, u, i = "NDHWC") {
+function Be(e, t, n, s, r, u, i = "NDHWC") {
   const [o, c, a] = W(t);
   let p, g;
   if (i === "NDHWC")
@@ -43,7 +44,7 @@ function je(e, t, n, s, r, u, i = "NDHWC") {
     throw new Error(`Unknown dataFormat ${i}`);
   return he(e, p, n, s, r, !1, g, u);
 }
-function B(e, t, n, s, r, u, i = !1, o = "channelsLast") {
+function X(e, t, n, s, r, u, i = !1, o = "channelsLast") {
   let [c, a, p, g] = [-1, -1, -1, -1];
   if (o === "channelsLast")
     [c, a, p, g] = e;
@@ -51,17 +52,17 @@ function B(e, t, n, s, r, u, i = !1, o = "channelsLast") {
     [c, g, a, p] = e;
   else
     throw new Error(`Unknown dataFormat ${o}`);
-  const [l, h, , d] = t, [A, m] = T(n), [b, k] = T(s), f = G(l, b), w = G(h, k), { padInfo: E, outHeight: I, outWidth: x } = de(r, a, p, A, m, f, w, u, o), y = i ? d * g : d;
+  const [l, h, , d] = t, [A, m] = T(n), [b, k] = T(s), f = L(l, b), w = L(h, k), { padInfo: E, outHeight: I, outWidth: y } = de(r, a, p, A, m, f, w, u, o), x = i ? d * g : d;
   let $;
-  return o === "channelsFirst" ? $ = [c, y, I, x] : o === "channelsLast" && ($ = [c, I, x, y]), {
+  return o === "channelsFirst" ? $ = [c, x, I, y] : o === "channelsLast" && ($ = [c, I, y, x]), {
     batchSize: c,
     dataFormat: o,
     inHeight: a,
     inWidth: p,
     inChannels: g,
     outHeight: I,
-    outWidth: x,
-    outChannels: y,
+    outWidth: y,
+    outChannels: x,
     padInfo: E,
     strideHeight: A,
     strideWidth: m,
@@ -84,9 +85,9 @@ function he(e, t, n, s, r, u = !1, i = "channelsLast", o) {
     [c, l, a, p, g] = e;
   else
     throw new Error(`Unknown dataFormat ${i}`);
-  const [h, d, A, , m] = t, [b, k, f] = W(n), [w, E, I] = W(s), x = G(h, w), y = G(d, E), $ = G(A, I), { padInfo: C, outDepth: M, outHeight: D, outWidth: F } = me(r, a, p, g, b, k, f, x, y, $, o), V = u ? m * l : m;
+  const [h, d, A, , m] = t, [b, k, f] = W(n), [w, E, I] = W(s), y = L(h, w), x = L(d, E), $ = L(A, I), { padInfo: _, outDepth: M, outHeight: S, outWidth: F } = me(r, a, p, g, b, k, f, y, x, $, o), V = u ? m * l : m;
   let U;
-  return i === "channelsFirst" ? U = [c, V, M, D, F] : i === "channelsLast" && (U = [c, M, D, F, V]), {
+  return i === "channelsFirst" ? U = [c, V, M, S, F] : i === "channelsLast" && (U = [c, M, S, F, V]), {
     batchSize: c,
     dataFormat: i,
     inDepth: a,
@@ -94,18 +95,18 @@ function he(e, t, n, s, r, u = !1, i = "channelsLast", o) {
     inWidth: g,
     inChannels: l,
     outDepth: M,
-    outHeight: D,
+    outHeight: S,
     outWidth: F,
     outChannels: V,
-    padInfo: C,
+    padInfo: _,
     strideDepth: b,
     strideHeight: k,
     strideWidth: f,
     filterDepth: h,
     filterHeight: d,
     filterWidth: A,
-    effectiveFilterDepth: x,
-    effectiveFilterHeight: y,
+    effectiveFilterDepth: y,
+    effectiveFilterHeight: x,
     effectiveFilterWidth: $,
     dilationDepth: w,
     dilationHeight: E,
@@ -116,19 +117,19 @@ function he(e, t, n, s, r, u = !1, i = "channelsLast", o) {
   };
 }
 function ge(e, t, n, s, r) {
-  s == null && (s = X(e, t, n));
-  const u = e[0], i = e[1], o = R((u - t + 2 * s) / n + 1, r), c = R((i - t + 2 * s) / n + 1, r);
+  s == null && (s = B(e, t, n));
+  const u = e[0], i = e[1], o = O((u - t + 2 * s) / n + 1, r), c = O((i - t + 2 * s) / n + 1, r);
   return [o, c];
 }
 function pe(e, t, n, s, r, u) {
-  r == null && (r = X(e, t[0], s[0]));
+  r == null && (r = B(e, t[0], s[0]));
   const i = [0, 0, 0, n];
   for (let o = 0; o < 3; o++)
-    e[o] + 2 * r >= t[o] && (i[o] = R((e[o] - t[o] + 2 * r) / s[o] + 1, u));
+    e[o] + 2 * r >= t[o] && (i[o] = O((e[o] - t[o] + 2 * r) / s[o] + 1, u));
   return i;
 }
-function X(e, t, n, s = 1) {
-  const r = G(t, s);
+function B(e, t, n, s = 1) {
+  const r = L(t, s);
   return Math.floor((e[0] * (n - 1) - n + r) / 2);
 }
 function T(e) {
@@ -137,7 +138,7 @@ function T(e) {
 function W(e) {
   return typeof e == "number" ? [e, e, e] : e;
 }
-function G(e, t) {
+function L(e, t) {
   return t <= 1 ? e : e + (e - 1) * (t - 1);
 }
 function de(e, t, n, s, r, u, i, o, c) {
@@ -154,7 +155,7 @@ function de(e, t, n, s, r, u, i, o, c) {
     a = { top: 0, bottom: 0, left: 0, right: 0, type: "VALID" }, p = Math.ceil((t - u + 1) / s), g = Math.ceil((n - i + 1) / r);
   else if (typeof e == "object") {
     const l = c === "channelsLast" ? e[1][0] : e[2][0], h = c === "channelsLast" ? e[1][1] : e[2][1], d = c === "channelsLast" ? e[2][0] : e[3][0], A = c === "channelsLast" ? e[2][1] : e[3][1];
-    a = { top: l, bottom: h, left: d, right: A, type: l === 0 && h === 0 && d === 0 && A === 0 ? "VALID" : "EXPLICIT" }, p = R((t - u + l + h) / s + 1, o), g = R((n - i + d + A) / r + 1, o);
+    a = { top: l, bottom: h, left: d, right: A, type: l === 0 && h === 0 && d === 0 && A === 0 ? "VALID" : "EXPLICIT" }, p = O((t - u + l + h) / s + 1, o), g = O((n - i + d + A) / r + 1, o);
   } else
     throw Error(`Unknown padding parameter: ${e}`);
   return { padInfo: a, outHeight: p, outWidth: g };
@@ -175,13 +176,13 @@ function me(e, t, n, s, r, u, i, o, c, a, p) {
     l = m[0], h = m[1], d = m[2];
   } else if (e === "same") {
     l = Math.ceil(t / r), h = Math.ceil(n / u), d = Math.ceil(s / i);
-    const A = (l - 1) * r + o - t, m = (h - 1) * u + c - n, b = (d - 1) * i + a - s, k = Math.floor(A / 2), f = A - k, w = Math.floor(m / 2), E = m - w, I = Math.floor(b / 2), x = b - I;
-    g = { top: w, bottom: E, left: I, right: x, front: k, back: f, type: "SAME" };
+    const A = (l - 1) * r + o - t, m = (h - 1) * u + c - n, b = (d - 1) * i + a - s, k = Math.floor(A / 2), f = A - k, w = Math.floor(m / 2), E = m - w, I = Math.floor(b / 2), y = b - I;
+    g = { top: w, bottom: E, left: I, right: y, front: k, back: f, type: "SAME" };
   } else
     throw Error(`Unknown padding parameter: ${e}`);
   return { padInfo: g, outDepth: l, outHeight: h, outWidth: d };
 }
-function R(e, t) {
+function O(e, t) {
   if (!t)
     return Math.trunc(e);
   switch (t) {
@@ -199,10 +200,10 @@ function P(e) {
   const [t, n, s] = T(e);
   return t === 1 && n === 1 && s === 1;
 }
-function qe(e, t) {
+function je(e, t) {
   return P(e) || P(t);
 }
-function Je(e) {
+function qe(e) {
   return T(e).every((t) => t > 0);
 }
 function Ae(e) {
@@ -212,16 +213,16 @@ function Ae(e) {
     return "channelsFirst";
   throw new Error(`Unknown dataFormat ${e}`);
 }
-function Qe(e, t, n) {
+function Je(e, t, n) {
   if (n != null) {
     if (typeof t == "string")
       throw Error(`Error in ${e}: pad must be an integer when using dimRoundingMode ${n} but got pad ${t}.`);
     if (typeof t == "number")
-      N(H(t), () => `Error in ${e}: pad must be an integer when using dimRoundingMode ${n} but got pad ${t}.`);
+      D(H(t), () => `Error in ${e}: pad must be an integer when using dimRoundingMode ${n} but got pad ${t}.`);
     else if (typeof t == "object")
       t.forEach((s) => {
         s.forEach((r) => {
-          N(H(r), () => `Error in ${e}: pad must be an integer when using dimRoundingMode ${n} but got pad ${r}.`);
+          D(H(r), () => `Error in ${e}: pad must be an integer when using dimRoundingMode ${n} but got pad ${r}.`);
         });
       });
     else
@@ -245,10 +246,10 @@ function Qe(e, t, n) {
  * =============================================================================
  */
 function we(e) {
-  const n = { x: S(e, "x", "sigmoid", "float32") };
-  return L.runKernel(te, n);
+  const n = { x: N(e, "x", "sigmoid", "float32") };
+  return G.runKernel(te, n);
 }
-const Ee = /* @__PURE__ */ _({ sigmoid_: we });
+const Ee = /* @__PURE__ */ C({ sigmoid_: we });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -266,10 +267,10 @@ const Ee = /* @__PURE__ */ _({ sigmoid_: we });
  * =============================================================================
  */
 function be(e) {
-  const n = { x: S(e, "x", "elu", "float32") };
-  return L.runKernel(ne, n);
+  const n = { x: N(e, "x", "elu", "float32") };
+  return G.runKernel(ne, n);
 }
-const $e = /* @__PURE__ */ _({ elu_: be });
+const $e = /* @__PURE__ */ C({ elu_: be });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -287,10 +288,10 @@ const $e = /* @__PURE__ */ _({ elu_: be });
  * =============================================================================
  */
 function Ie(e, t = 0.2) {
-  const s = { x: S(e, "x", "leakyRelu") }, r = { alpha: t };
-  return L.runKernel(se, s, r);
+  const s = { x: N(e, "x", "leakyRelu") }, r = { alpha: t };
+  return G.runKernel(se, s, r);
 }
-const xe = /* @__PURE__ */ _({ leakyRelu_: Ie });
+const ye = /* @__PURE__ */ C({ leakyRelu_: Ie });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -307,11 +308,11 @@ const xe = /* @__PURE__ */ _({ leakyRelu_: Ie });
  * limitations under the License.
  * =============================================================================
  */
-function ye(e, t) {
-  const n = S(e, "x", "prelu"), s = S(t, "alpha", "prelu"), r = { x: n, alpha: s };
-  return L.runKernel(re, r);
+function xe(e, t) {
+  const n = N(e, "x", "prelu"), s = N(t, "alpha", "prelu"), r = { x: n, alpha: s };
+  return G.runKernel(re, r);
 }
-const Me = /* @__PURE__ */ _({ prelu_: ye });
+const Me = /* @__PURE__ */ C({ prelu_: xe });
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.
@@ -329,31 +330,10 @@ const Me = /* @__PURE__ */ _({ prelu_: ye });
  * =============================================================================
  */
 function ke(e) {
-  const n = { x: S(e, "x", "relu") };
-  return L.runKernel(ie, n);
+  const n = { x: N(e, "x", "relu6") };
+  return G.runKernel(ie, n);
 }
-const Se = /* @__PURE__ */ _({ relu_: ke });
-/**
- * @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 De(e) {
-  const n = { x: S(e, "x", "relu6") };
-  return L.runKernel(oe, n);
-}
-const Ne = /* @__PURE__ */ _({ relu6_: De });
+const Se = /* @__PURE__ */ C({ relu6_: ke });
 /**
  * @license
  * Copyright 2018 Google LLC. All Rights Reserved.
@@ -370,11 +350,11 @@ const Ne = /* @__PURE__ */ _({ relu6_: De });
  * limitations under the License.
  * =============================================================================
  */
-function _e(e, t = 0) {
-  const s = { x: S(e, "x", "step") }, r = { alpha: t };
-  return L.runKernel(le, s, r);
+function De(e, t = 0) {
+  const s = { x: N(e, "x", "step") }, r = { alpha: t };
+  return G.runKernel(oe, s, r);
 }
-const Le = /* @__PURE__ */ _({ step_: _e });
+const Ne = /* @__PURE__ */ C({ step_: De });
 /**
  * @license
  * Copyright 2019 Google LLC. All Rights Reserved.
@@ -391,36 +371,36 @@ const Le = /* @__PURE__ */ _({ step_: _e });
  * limitations under the License.
  * =============================================================================
  */
-function Ye(e, t, n) {
+function Qe(e, t, n) {
   if (n == null || n === "linear")
     return e;
   if (n === "relu")
-    return ue(e, Le(t));
+    return le(e, Ne(t));
   throw new Error(`Cannot compute gradient for fused activation ${n}.`);
 }
-function Ze(e, t) {
+function Ye(e, t) {
   let n = t;
-  const s = fe(e.shape, t.shape);
+  const s = ue(e.shape, t.shape);
   return s.length > 0 && (n = ae(n, s)), ce(n, e.shape);
 }
-function ze(e, t, n, s) {
+function Ze(e, t, n, s) {
   if (t === "linear")
     return e;
   if (t === "relu")
-    return Se(e);
+    return fe(e);
   if (t === "elu")
     return $e(e);
   if (t === "relu6")
-    return Ne(e);
+    return Se(e);
   if (t === "prelu")
     return Me(e, n);
   if (t === "leakyrelu")
-    return xe(e, s);
+    return ye(e, s);
   if (t === "sigmoid")
     return Ee(e);
   throw new Error(`Unknown fused activation ${t}.`);
 }
-const et = (e, t) => !(e > 0) || t === "linear";
+const ze = (e, t) => !(e > 0) || t === "linear";
 /**
  * @license
  * Copyright 2021 Google LLC. All Rights Reserved.
@@ -437,21 +417,21 @@ const et = (e, t) => !(e > 0) || t === "linear";
  * limitations under the License.
  * =============================================================================
  */
-const v = -2, Ce = -1;
-function Ge(e, t, n) {
+const v = -2, _e = -1;
+function Le(e, t, n) {
   const s = e.shape.length;
-  N(s === t.length, () => `Error in slice${s}D: Length of begin ${t} must match the rank of the array (${s}).`), N(s === n.length, () => `Error in slice${s}D: Length of size ${n} must match the rank of the array (${s}).`);
+  D(s === t.length, () => `Error in slice${s}D: Length of begin ${t} must match the rank of the array (${s}).`), D(s === n.length, () => `Error in slice${s}D: Length of size ${n} must match the rank of the array (${s}).`);
   for (let r = 0; r < s; ++r)
-    N(t[r] + n[r] <= e.shape[r], () => `Error in slice${s}D: begin[${r}] + size[${r}] (${t[r] + n[r]}) would overflow input.shape[${r}] (${e.shape[r]})`);
+    D(t[r] + n[r] <= e.shape[r], () => `Error in slice${s}D: begin[${r}] + size[${r}] (${t[r] + n[r]}) would overflow input.shape[${r}] (${e.shape[r]})`);
 }
-function Te(e) {
+function Ce(e) {
   const t = [];
   let n = 0;
   for (; e > 0; )
     e & 1 && t.push(n), e /= 2, n++;
   return t;
 }
-function Re(e, t, n) {
+function Ge(e, t, n) {
   const s = [];
   for (let r = 0; r < e.length; r++)
     s[r] = Math.ceil((t[r] - e[r]) / n[r]);
@@ -479,7 +459,7 @@ function J(e, t) {
     n.push(t + s);
   return n;
 }
-function Oe(e, t, n, s, r, u, i, o, c) {
+function Te(e, t, n, s, r, u, i, o, c) {
   const a = e.length;
   let p = new Array(a), g = new Array(a), l = new Array(a);
   if (t.length && n > 0) {
@@ -518,7 +498,7 @@ function Y(e, t, n, s, r) {
     }
   for (let o = 0; o < u.length; o++) {
     const c = r[o];
-    u[o] < 0 && (u[o] += c), u[o] = O(0, u[o], r[o]);
+    u[o] < 0 && (u[o] += c), u[o] = R(0, u[o], r[o]);
   }
   return u;
 }
@@ -531,16 +511,16 @@ function z(e, t, n, s, r, u) {
   const o = n[r] || 1;
   (e & 1 << r || u & 1 << r || i == null) && (o > 0 ? i = Number.MIN_SAFE_INTEGER : i = Number.MAX_SAFE_INTEGER);
   const c = s[r];
-  return i < 0 && (i += c), i = O(0, i, c - 1), i;
+  return i < 0 && (i += c), i = R(0, i, c - 1), i;
 }
 function ee(e, t, n, s, r, u) {
   let i = t[r];
   const o = n[r] || 1;
   (e & 1 << r || u & 1 << r || i == null) && (o > 0 ? i = Number.MAX_SAFE_INTEGER : i = Number.MIN_SAFE_INTEGER);
   const c = s[r];
-  return i < 0 && (i += c), o > 0 ? i = O(0, i, c) : i = O(-1, i, c - 1), i;
+  return i < 0 && (i += c), o > 0 ? i = R(0, i, c) : i = R(-1, i, c - 1), i;
 }
-function Fe(e, t, n) {
+function Oe(e, t, n) {
   let s = n.length;
   for (let r = 0; r < n.length; r++)
     if (n[r] > 1) {
@@ -552,22 +532,22 @@ function Fe(e, t, n) {
       return !1;
   return !0;
 }
-function Ve(e, t) {
+function Re(e, t) {
   let n = e.length > 0 ? e[e.length - 1] : 1;
   for (let s = 0; s < e.length - 1; s++)
     n += e[s] * t[s];
   return n;
 }
-function Ue(e, t, n) {
+function Fe(e, t, n) {
   let s;
   const r = e.shape.length;
   typeof t == "number" ? s = [t, ...new Array(r - 1).fill(0)] : t.length < r ? s = t.concat(new Array(r - t.length).fill(0)) : s = t.slice(), s.forEach((i) => {
-    N(i !== -1, () => "slice() does not support negative begin indexing.");
+    D(i !== -1, () => "slice() does not support negative begin indexing.");
   });
   let u;
-  return n == null ? u = new Array(r).fill(-1) : typeof n == "number" ? u = [n, ...new Array(r - 1).fill(-1)] : n.length < r ? u = n.concat(new Array(r - n.length).fill(-1)) : u = n, u = u.map((i, o) => i >= 0 ? i : (N(i === -1, () => `Negative size values should be exactly -1 but got ${i} for the slice() size at index ${o}.`), e.shape[o] - s[o])), [s, u];
+  return n == null ? u = new Array(r).fill(-1) : typeof n == "number" ? u = [n, ...new Array(r - 1).fill(-1)] : n.length < r ? u = n.concat(new Array(r - n.length).fill(-1)) : u = n, u = u.map((i, o) => i >= 0 ? i : (D(i === -1, () => `Negative size values should be exactly -1 but got ${i} for the slice() size at index ${o}.`), e.shape[o] - s[o])), [s, u];
 }
-function We(e, t, n, s, r, u, i, o, c) {
+function Ve(e, t, n, s, r, u, i, o, c) {
   let a;
   if (s == null ? (a = new Array(t.length), a.fill(1)) : a = s, i != null && (i & i - 1) !== 0)
     throw new Error("Multiple ellipses in slice is not allowed.");
@@ -594,7 +574,7 @@ function We(e, t, n, s, r, u, i, o, c) {
     beginValid: !1,
     endValid: !1
   };
-  ve(g, l);
+  Ue(g, l);
   let h = !0, d = !0, A = !0;
   const m = [], b = [];
   for (let f = 0; f < e.length; ++f) {
@@ -605,27 +585,27 @@ function We(e, t, n, s, r, u, i, o, c) {
       m.push(w ? 1 : -1);
       continue;
     }
-    const I = [l.beginMask & 1 << f, l.endMask & 1 << f], x = [
+    const I = [l.beginMask & 1 << f, l.endMask & 1 << f], y = [
       l.strides[f] > 0 ? 0 : -1,
       l.strides[f] > 0 ? E : E - 1
     ];
     if (w && l.strides[f] <= 0)
       throw Error("only stride 1 allowed on non-range indexing.");
     A = A && l.strides[f] === 1;
-    const y = !!(l.beginMask & 1 << f && l.endMask & 1 << f);
+    const x = !!(l.beginMask & 1 << f && l.endMask & 1 << f);
     if (l.beginValid && l.endValid) {
       if (w) {
-        const D = l.begin[f] < 0 ? E + l.begin[f] : l.begin[f];
-        if (l.begin[f] = D, l.end[f] = l.begin[f] + 1, D < 0 || D >= E)
+        const S = l.begin[f] < 0 ? E + l.begin[f] : l.begin[f];
+        if (l.begin[f] = S, l.end[f] = l.begin[f] + 1, S < 0 || S >= E)
           throw Error(`slice index ${l.begin[f]} of dimension ${f} out of bounds.`);
       } else
-        l.begin[f] = K(l.begin[f], 0, l.strides[f], E, I, x), l.end[f] = K(l.end[f], 1, l.strides[f], E, I, x);
+        l.begin[f] = K(l.begin[f], 0, l.strides[f], E, I, y), l.end[f] = K(l.end[f], 1, l.strides[f], E, I, y);
       const M = l.strides[f] === 1 && l.begin[f] === 0 && l.end[f] === E;
       h = h && M, d = d && (f === 0 && l.strides[f] === 1 || M);
     } else
-      h = h && l.strides[f] === 1 && y, d = d && (f === 0 && l.strides[f] === 1 || y);
-    let $, C = !1;
-    if (l.beginValid && l.endValid ? ($ = l.end[f] - l.begin[f], C = !0) : w ? ($ = 1, C = !0) : y && E >= 0 && (l.strides[f] < 0 ? $ = -E : $ = E, C = !0), C) {
+      h = h && l.strides[f] === 1 && x, d = d && (f === 0 && l.strides[f] === 1 || x);
+    let $, _ = !1;
+    if (l.beginValid && l.endValid ? ($ = l.end[f] - l.begin[f], _ = !0) : w ? ($ = 1, _ = !0) : x && E >= 0 && (l.strides[f] < 0 ? $ = -E : $ = E, _ = !0), _) {
       let M;
       $ === 0 || $ < 0 != l.strides[f] < 0 ? M = 0 : M = Math.trunc($ / l.strides[f]) + ($ % l.strides[f] !== 0 ? 1 : 0), m.push(M);
     } else
@@ -646,7 +626,7 @@ function We(e, t, n, s, r, u, i, o, c) {
     strides: l.strides
   };
 }
-function ve(e, t) {
+function Ue(e, t) {
   t.beginMask = 0, t.endMask = 0, t.shrinkAxisMask = 0;
   let n = 0;
   t.beginValid = e.begin != null, t.endValid = e.end != null, t.begin = new Array(t.dims), t.end = new Array(t.dims), t.strides = new Array(t.dims), t.finalShapeGatherIndices = [], t.finalShapeGatherIndicesSparse = [], t.inputShapeGatherIndicesSparse = new Array(t.dims);
@@ -660,7 +640,7 @@ function ve(e, t) {
     else {
       if (n === t.begin.length)
         throw Error(`Index out of range using input dim ${n}; input has only ${t.dims} dims, ${t.begin.length}.`);
-      e.begin != null && (t.begin[n] = e.begin[s]), e.end != null && (t.end[n] = e.end[s]), t.strides[n] = e.strides[s], e.beginMask & 1 << s && (t.beginMask |= 1 << n), e.endMask & 1 << s && (t.endMask |= 1 << n), e.shrinkAxisMask & 1 << s ? (t.finalShapeGatherIndices.push(Ce), t.finalShapeGatherIndicesSparse.push(-1), t.shrinkAxisMask |= 1 << n) : (t.finalShapeGatherIndices.push(n), t.finalShapeGatherIndicesSparse.push(s)), t.inputShapeGatherIndicesSparse[n] = s, n++;
+      e.begin != null && (t.begin[n] = e.begin[s]), e.end != null && (t.end[n] = e.end[s]), t.strides[n] = e.strides[s], e.beginMask & 1 << s && (t.beginMask |= 1 << n), e.endMask & 1 << s && (t.endMask |= 1 << n), e.shrinkAxisMask & 1 << s ? (t.finalShapeGatherIndices.push(_e), t.finalShapeGatherIndicesSparse.push(-1), t.shrinkAxisMask |= 1 << n) : (t.finalShapeGatherIndices.push(n), t.finalShapeGatherIndicesSparse.push(s)), t.inputShapeGatherIndicesSparse[n] = s, n++;
     }
 }
 function K(e, t, n, s, r, u) {
@@ -671,16 +651,16 @@ function K(e, t, n, s, r, u) {
     return i < u[0] ? u[0] : i > u[1] ? u[1] : i;
   }
 }
-const tt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const et = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  assertParamsValid: Ge,
-  computeFlatOffset: Ve,
-  computeOutShape: Re,
-  getNormalizedAxes: Oe,
-  isSliceContinous: Fe,
-  maskToAxes: Te,
-  parseSliceParams: Ue,
-  sliceInfo: We,
+  assertParamsValid: Le,
+  computeFlatOffset: Re,
+  computeOutShape: Ge,
+  getNormalizedAxes: Te,
+  isSliceContinous: Oe,
+  maskToAxes: Ce,
+  parseSliceParams: Fe,
+  sliceInfo: Ve,
   startForAxis: z,
   startIndicesWithElidedDims: Q,
   stopForAxis: ee,
@@ -704,37 +684,36 @@ const tt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
  * limitations under the License.
  * =============================================================================
  */
-const nt = 1.7580993408473768, st = 1.0507009873554805;
+const tt = 1.7580993408473768, nt = 1.0507009873554805;
 export {
-  Me as A,
-  We as B,
-  Re as C,
-  Ne as D,
-  st as S,
-  nt as a,
-  ze as b,
-  Qe as c,
-  B as d,
+  Ve as A,
+  Ge as B,
+  Se as C,
+  nt as S,
+  tt as a,
+  Ze as b,
+  Je as c,
+  X as d,
   he as e,
-  X as f,
-  Be as g,
+  B as f,
+  Ke as g,
   Xe as h,
-  je as i,
+  Be as i,
   Ae as j,
-  qe as k,
-  Ze as l,
-  Ye as m,
-  tt as n,
-  Je as o,
-  Ue as p,
-  Ge as q,
-  Fe as r,
-  et as s,
+  je as k,
+  Ye as l,
+  Qe as m,
+  et as n,
+  qe as o,
+  Fe as p,
+  Le as q,
+  Oe as r,
+  ze as s,
   P as t,
-  Ve as u,
-  Le as v,
+  Re as u,
+  Ne as v,
   Ee as w,
   $e as x,
-  Se as y,
-  xe as z
+  ye as y,
+  Me as z
 };

package/dist/{shared-D1elLckx.js → shared-CZiWmQCI.js}

@@ -1,4 +1,4 @@
-import { s as l } from "./shared-CkNorDcU.js";
+import { s as l } from "./shared-V6D_md-c.js";
 /**
  * @license
  * Copyright 2020 Google LLC. All Rights Reserved.