@genai-fi/nanogpt 0.9.1 → 0.10.1

package/dist/backend_util-CJIiDoV1.js

@@ -1,749 +0,0 @@
-import { j as m, a3 as R, n as g, aN as $, aO as O, aP as _, l as M, ae as y, ax as D, aQ as T, u as b, aR as F } from "./index-BzFyqcy-.js";
-import { b as L, d as W, f as v, c as N, e as x, g as P, a as C, h as z } from "./axis_util-TbGYJ208.js";
-import { S as U, a as B, b as V, c as j, d as G, e as H, f as k, g as q, h as Z, i as X, j as J, k as K, l as Q, m as Y, s as ee, n as te, o as ne, t as se } from "./selu_util-OtRzVwW5.js";
-import { c as re, v as oe, a as ae } from "./scatter_nd_util-BQdz--Gn.js";
-function ie(e, n) {
-  const r = e.shape.length, t = n.shape.length;
-  if (r < 1)
-    throw new Error(`tf.gatherND() expects the input to be rank 1 or higher, but the rank was ${r}.`);
-  if (t < 1)
-    throw new Error(`tf.gatherND() expects the indices to be rank 1 or higher, but the rank was ${t}.`);
-  if (n.dtype !== "int32")
-    throw new Error(`tf.gatherND() expects the indices to be int32 type, but the dtype was ${n.dtype}.`);
-  if (n.shape[t - 1] > r)
-    throw new Error(`index innermost dimension length must be <= tensor rank; saw: ${n.shape[t - 1]} vs. ${r}`);
-  if (m(e.shape) === 0)
-    throw new Error(`Requested more than 0 entries, but input is empty. Input shape: ${e.shape}.`);
-  const s = n.shape, o = s[s.length - 1];
-  let a = 1;
-  for (let i = 0; i < s.length - 1; ++i)
-    a *= s[i];
-  const u = e.shape, c = s.slice();
-  c.pop();
-  let h = 1;
-  for (let i = o; i < r; ++i)
-    h *= u[i], c.push(u[i]);
-  const d = [
-    ...R(e.shape).map((i) => i / h),
-    1
-  ].slice(0, o);
-  return [c, a, h, d];
-}
-/**
- * @license
- * Copyright 2017 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 ue(e, n) {
-  const r = e[0].length;
-  e.forEach((s, o) => {
-    g(s.length === r, () => `Error in concat${r}D: rank of tensors[${o}] must be the same as the rank of the rest (${r})`);
-  }), g(n >= 0 && n < r, () => `Error in concat${r}D: axis must be between 0 and ${r - 1}.`);
-  const t = e[0];
-  e.forEach((s, o) => {
-    for (let a = 0; a < r; a++)
-      g(a === n || s[a] === t[a], () => `Error in concat${r}D: Shape of tensors[${o}] (${s}) does not match the shape of the rest (${t}) along the non-concatenated axis ${o}.`);
-  });
-}
-function le(e, n) {
-  const r = e[0].slice();
-  for (let t = 1; t < e.length; t++)
-    r[n] += e[t][n];
-  return r;
-}
-/**
- * @license
- * Copyright 2022 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.
- * =============================================================================
- */
-var p;
-(function(e) {
-  e[e.FIRST_DIM_SIZE = 0] = "FIRST_DIM_SIZE", e[e.VALUE_ROWIDS = 1] = "VALUE_ROWIDS", e[e.ROW_LENGTHS = 2] = "ROW_LENGTHS", e[e.ROW_SPLITS = 3] = "ROW_SPLITS", e[e.ROW_LIMITS = 4] = "ROW_LIMITS", e[e.ROW_STARTS = 5] = "ROW_STARTS";
-})(p || (p = {}));
-function ce(e, n, r) {
-  let t = new Array();
-  if (r == null && n == null)
-    return t;
-  if (n == null)
-    for (; t.length < e + r.length; )
-      t.push(-1);
-  else
-    t = n.slice();
-  if (r == null)
-    return t;
-  if (e + r.length !== t.length)
-    throw new Error(`rt input.shape and shape=${n} are incompatible: rt input.rank = ${e + r.length}, but shape.rank = ${t.length}`);
-  for (let s = 1; s < r.length; ++s) {
-    const o = r[s], a = t[t.length - r.length + s], u = t[a];
-    if (o >= 0)
-      if (u >= 0) {
-        if (u !== o)
-          throw new Error(`rt input.shape and shape=${n} are incompatible: rt input.shape[${s + e}] = ${o} but shape[${s + e}] = ${u}`);
-      } else
-        t[a] = o;
-  }
-  return t;
-}
-function he(e) {
-  const n = {
-    FIRST_DIM_SIZE: p.FIRST_DIM_SIZE,
-    VALUE_ROWIDS: p.VALUE_ROWIDS,
-    ROW_LENGTHS: p.ROW_LENGTHS,
-    ROW_SPLITS: p.ROW_SPLITS,
-    ROW_LIMITS: p.ROW_LIMITS,
-    ROW_STARTS: p.ROW_STARTS
-  }, r = [];
-  for (const t of e)
-    if (t in n)
-      r.push(n[t]);
-    else
-      break;
-  return r;
-}
-function fe(e) {
-  return e.length === 0 ? 0 : e[0] === p.FIRST_DIM_SIZE ? e.length - 1 : e.length;
-}
-function pe(e, n) {
-  if (e == null || n == null)
-    return;
-  const r = e.length, t = n.length;
-  if (r >= t)
-    throw new Error(`defaultValue.shape=${e} and ragged tensor flatValues.shape=${n}, are incompatible: defaultValue.rank = ${r} must be less than ragged tensor input flatValues.rank = ${t})`);
-  for (let s = 0; s < Math.min(r, t - 1); ++s) {
-    const o = e[s], a = n[s + 1];
-    if (o >= 0 && a >= 0 && o !== 1 && o !== a)
-      throw new Error(`defaultValue.shape=${e}, and ragged tensor input flatValues.shape=${n} are incompatible: defaultValue.shape[${s - e.length}] = ${o} but ragged tensor input.flatValues.shape[${s - e.length}] = ${a}`);
-  }
-}
-/**
- * @license
- * Copyright 2017 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.
- * =============================================================================
- */
-const I = 30;
-function ge(e) {
-  return e <= I ? e : $(e, Math.floor(Math.sqrt(e)));
-}
-/**
- * @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, n, r) {
-  const t = r * (typeof e == "number" ? e : e[0]), s = n * (typeof e == "number" ? e : e[1]);
-  return [t, 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.
- * =============================================================================
- */
-function me(e, n, r, t = !0) {
-  let s = [];
-  if (t)
-    s = s.concat(n.slice(0)), s.push(e[0] / r), s = s.concat(e.slice(1));
-  else {
-    s = s.concat(e[0]);
-    const o = n.length;
-    for (let a = 0; a < o; ++a)
-      s = s.concat([e[a + 1] / n[a], n[a]]);
-    s = s.concat(e.slice(o + 1));
-  }
-  return s;
-}
-function Ee(e, n, r = !0) {
-  const t = [];
-  if (r) {
-    t.push(n);
-    for (let s = n + 1; s < e; ++s)
-      s <= 2 * n ? (t.push(s), t.push(s - (n + 1))) : t.push(s);
-  } else {
-    const s = [], o = [];
-    for (let a = 1; a < e; ++a)
-      a >= n * 2 + 1 || a % 2 === 1 ? o.push(a) : s.push(a);
-    t.push(...s), t.push(0), t.push(...o);
-  }
-  return t;
-}
-function $e(e, n, r, t = !0) {
-  const s = [];
-  t ? s.push(e[0] / r) : s.push(e[0] * r);
-  for (let o = 1; o < e.length; ++o)
-    o <= n.length ? t ? s.push(n[o - 1] * e[o]) : s.push(e[o] / n[o - 1]) : s.push(e[o]);
-  return s;
-}
-function Ie(e, n) {
-  const r = [0];
-  for (let t = 0; t < n; ++t)
-    r.push(e[t][0]);
-  return r;
-}
-function Se(e, n, r) {
-  const t = e.slice(0, 1);
-  for (let s = 0; s < r; ++s)
-    t.push(e[s + 1] - n[s][0] - n[s][1]);
-  return t;
-}
-/**
- * @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.
- * =============================================================================
- */
-const we = 0.3275911, Ae = 0.254829592, Re = -0.284496736, Oe = 1.421413741, _e = -1.453152027, Me = 1.061405429;
-/**
- * @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 ye(e, n) {
-  if (e.length !== n.length)
-    throw new Error(`Cannot merge real and imag arrays of different lengths. real:${e.length}, imag: ${n.length}.`);
-  const r = new Float32Array(e.length * 2);
-  for (let t = 0; t < r.length; t += 2)
-    r[t] = e[t / 2], r[t + 1] = n[t / 2];
-  return r;
-}
-function De(e) {
-  const n = new Float32Array(e.length / 2), r = new Float32Array(e.length / 2);
-  for (let t = 0; t < e.length; t += 2)
-    n[t / 2] = e[t], r[t / 2] = e[t + 1];
-  return { real: n, imag: r };
-}
-function Te(e) {
-  const n = Math.ceil(e.length / 4), r = new Float32Array(n), t = new Float32Array(n);
-  for (let s = 0; s < e.length; s += 4)
-    r[Math.floor(s / 4)] = e[s], t[Math.floor(s / 4)] = e[s + 1];
-  return { real: r, imag: t };
-}
-function be(e) {
-  const n = Math.floor(e.length / 4), r = new Float32Array(n), t = new Float32Array(n);
-  for (let s = 2; s < e.length; s += 4)
-    r[Math.floor(s / 4)] = e[s], t[Math.floor(s / 4)] = e[s + 1];
-  return { real: r, imag: t };
-}
-function Fe(e, n) {
-  const r = e[n * 2], t = e[n * 2 + 1];
-  return { real: r, imag: t };
-}
-function Le(e, n, r, t) {
-  e[t * 2] = n, e[t * 2 + 1] = r;
-}
-function We(e, n) {
-  const r = new Float32Array(e / 2), t = new Float32Array(e / 2);
-  for (let s = 0; s < Math.ceil(e / 2); s++) {
-    const o = (n ? 2 : -2) * Math.PI * (s / e);
-    r[s] = Math.cos(o), t[s] = Math.sin(o);
-  }
-  return { real: r, imag: t };
-}
-function ve(e, n, r) {
-  const t = (r ? 2 : -2) * Math.PI * (e / n), s = Math.cos(t), o = Math.sin(t);
-  return { real: s, imag: o };
-}
-/**
- * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-const E = "->", Ne = /->/g, S = ",", w = "...";
-function xe(e, n) {
-  e = e.replace(/\s/g, "");
-  const r = (e.length - e.replace(Ne, "").length) / E.length;
-  if (r < 1)
-    throw new Error("Equations without an arrow are not supported.");
-  if (r > 1)
-    throw new Error(`Equation must contain exactly one arrow ("${E}").`);
-  const [t, s] = e.split(E);
-  g(t.indexOf(w) === -1, () => `The ellipsis notation ("${w}") is not supported yet.`);
-  const o = t.split(S), a = o.length;
-  if (n !== a)
-    throw new Error(`Expected ${a} input tensors, received ${n}`);
-  if (a > 2)
-    throw new Error("Support for more than 2 input tensors is not implemented yet.");
-  const u = [];
-  for (let l = 0; l < s.length; ++l) {
-    const f = s[l];
-    if (!o.some((A) => A.indexOf(f) !== -1))
-      throw new Error(`Output subscripts contain the label ${f} not present in the input subscripts.`);
-    u.indexOf(f) === -1 && u.push(f);
-  }
-  for (let l = 0; l < t.length; ++l) {
-    const f = t[l];
-    u.indexOf(f) === -1 && f !== S && u.push(f);
-  }
-  const c = new Array(o.length);
-  for (let l = 0; l < a; ++l) {
-    if (new Set(o[l].split("")).size !== o[l].length)
-      throw new Error(`Found duplicate axes in input component ${o[l]}. Support for duplicate axes in input is not implemented yet.`);
-    c[l] = [];
-    for (let f = 0; f < o[l].length; ++f)
-      c[l].push(u.indexOf(o[l][f]));
-  }
-  const h = u.length, d = s.length, i = [];
-  for (let l = d; l < h; ++l)
-    i.push(l);
-  return { allDims: u, summedDims: i, idDims: c };
-}
-function Pe(e, n) {
-  let r = new Array(e);
-  r.fill(-1);
-  for (let s = 0; s < n.length; ++s)
-    r[n[s]] = s;
-  const t = [];
-  for (let s = 0; s < e; ++s)
-    r[s] === -1 && t.push(s);
-  return r = r.filter((s) => s !== -1), { permutationIndices: r, expandDims: t };
-}
-function Ce(e, n, r) {
-  const t = new Array(e);
-  for (let s = 0; s < r.length; ++s) {
-    const o = r[s].shape;
-    for (let a = 0; a < n[s].length; ++a)
-      t[n[s][a]] === void 0 ? t[n[s][a]] = o[a] : g(t[n[s][a]] === o[a], () => `Expected dimension ${t[n[s][a]]} at axis ${a} of input shaped ${JSON.stringify(o)}, but got dimension ${o[a]}`);
-  }
-}
-function ze(e, n) {
-  const r = e, t = [];
-  let s = 0;
-  e.length === 0 && r.push(-1), s = e.length + 1;
-  for (let a = 0; a < s; ++a)
-    t.push([]);
-  const o = [];
-  for (let a = 0; a < r.length; ++a) {
-    const u = r[a], c = Be(n, u);
-    for (const h of c)
-      o.indexOf(h) === -1 && (t[a].push(h), o.push(h));
-  }
-  return { path: r, steps: t };
-}
-function Ue(e) {
-  return e.every((n, r) => n === r);
-}
-function Be(e, n) {
-  const r = [];
-  for (let t = 0; t < e.length; ++t)
-    (e[t].length === 0 || e[t].indexOf(n) !== -1 || n === -1) && r.push(t);
-  return r;
-}
-function Ve(e, n, r = 0) {
-  let t = [];
-  if (typeof n == "number")
-    g(e.shape[r] % n === 0, () => "Number of splits must evenly divide the axis."), t = new Array(n).fill(e.shape[r] / n);
-  else {
-    const s = n.reduce((a, u) => (u === -1 && (a += 1), a), 0);
-    g(s <= 1, () => "There should be only one negative value in split array.");
-    const o = n.indexOf(-1);
-    if (o !== -1) {
-      const a = n.reduce((u, c) => c > 0 ? u + c : u);
-      n[o] = e.shape[r] - a;
-    }
-    g(e.shape[r] === n.reduce((a, u) => a + u), () => "The sum of sizes must match the size of the axis dimension."), t = n;
-  }
-  return t;
-}
-/**
- * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function je(e) {
-  return `Received SparseTensor with denseShape[0] = 0 but
-  indices.shape[0] = ${e}`;
-}
-function Ge(e, n) {
-  return `indices(${e}, 0) is invalid: ${n} < 0`;
-}
-function He(e, n, r) {
-  return `indices(${e}, 0) is invalid: ${n} >= ${r}`;
-}
-/**
- * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function ke(e, n) {
-  return `only one output dimension may be -1, not both ${e} and ${n}`;
-}
-function qe(e, n) {
-  return `size ${e} must be non-negative, not ${n}`;
-}
-function Ze() {
-  return "reshape cannot infer the missing input size for an empty tensor unless all specified input sizes are non-zero";
-}
-function Xe(e, n) {
-  const r = m(e), t = m(n);
-  return `Input to reshape is a SparseTensor with ${r}
-  dense values, but the requested shape requires a multiple of ${t}. inputShape=${e} outputShape= ${n}`;
-}
-function Je(e, n) {
-  const r = m(e), t = m(n);
-  return `Input to reshape is a tensor with ${r} dense values, but the requested shape has ${t}. inputShape=${e} outputShape=${n}`;
-}
-/**
- * @license
- * Copyright 2021 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function Ke() {
-  return "segment ids must be >= 0";
-}
-function Qe() {
-  return "segment ids are not increasing";
-}
-function Ye(e, n) {
-  return `Segment id ${e} out of range [0, ${n}), possibly because segmentIds input is not sorted.`;
-}
-function et(e, n, r) {
-  return `Bad: indices[${e}] == ${n} out of range [0, ${r})`;
-}
-/**
- * @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 tt(e, n) {
-  let r = !1, t;
-  for (e <= I ? (t = e, r = !0) : t = $(e, Math.floor(Math.sqrt(e))); !r; )
-    t > n || t === e ? r = !0 : t = $(e, t + 1);
-  return t;
-}
-function nt(e, n, r) {
-  const t = [], s = e.length;
-  for (let o = 0; o < s; o++)
-    o !== n ? t.push(e[o]) : t.push(r);
-  return t;
-}
-function st(e, n, r, t) {
-  const s = n.shape.length, o = e.shape.length;
-  if (t !== 0 && (t < -s || t > s))
-    throw new Error(`Expect batchDims in the range of [-${s}, ${s}], but got ${t}`);
-  if (t < 0 && (t += s), t > o)
-    throw new Error(`batchDims (${t}) must be less than rank(x) (
-    ${o}).`);
-  if (r < t)
-    throw new Error(`batchDims (${t}) must be less than or equal to axis (${r}).`);
-  for (let i = 0; i < t; ++i)
-    if (e.shape[i] !== n.shape[i])
-      throw new Error(`x.shape[${i}]: ${e.shape[i]} should be equal to indices.shape[${i}]: ${n.shape[i]}.`);
-  const a = e.shape[r], u = [];
-  let c = 1, h = 1, d = 1;
-  for (let i = 0; i < t; ++i)
-    u.push(e.shape[i]), c *= e.shape[i];
-  for (let i = t; i < r; i++)
-    u.push(e.shape[i]), h *= e.shape[i];
-  for (let i = t; i < s; i++)
-    u.push(n.shape[i]);
-  for (let i = r + 1; i < o; i++)
-    u.push(e.shape[i]), d *= e.shape[i];
-  return { batchSize: c, sliceSize: d, outerSize: h, dimSize: a, outputShape: u };
-}
-const rt = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  collectGatherOpShapeInfo: st,
-  computeOutShape: nt,
-  segOpComputeOptimalWindowSize: tt
-}, Symbol.toStringTag, { value: "Module" }));
-/**
- * @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 ot(e) {
-  try {
-    return e.map((n) => O(n));
-  } catch (n) {
-    throw new Error(`Failed to decode encoded string bytes into utf-8, error: ${n}`);
-  }
-}
-function at(e) {
-  return e.map((n) => _(n));
-}
-const ht = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  ERF_A1: Ae,
-  ERF_A2: Re,
-  ERF_A3: Oe,
-  ERF_A4: _e,
-  ERF_A5: Me,
-  ERF_P: we,
-  PARALLELIZE_THRESHOLD: I,
-  get RowPartitionType() {
-    return p;
-  },
-  SELU_SCALE: U,
-  SELU_SCALEALPHA: B,
-  applyActivation: V,
-  assertAndGetBroadcastShape: M,
-  assertAxesAreInnerMostDims: L,
-  assertParamsConsistent: ue,
-  assignToTypedArray: Le,
-  axesAreInnerMostDims: W,
-  calculateShapes: re,
-  checkEinsumDimSizes: Ce,
-  checkPadOnDimRoundingMode: j,
-  combineLocations: v,
-  combineRaggedTensorToTensorShapes: ce,
-  complexWithEvenIndex: Te,
-  complexWithOddIndex: be,
-  computeConv2DInfo: G,
-  computeConv3DInfo: H,
-  computeDefaultPad: k,
-  computeDilation2DInfo: q,
-  computeOptimalWindowSize: ge,
-  computeOutAndReduceShapes: N,
-  computeOutShape: le,
-  computePool2DInfo: Z,
-  computePool3DInfo: X,
-  convertConv2DDataFormat: J,
-  decodeEinsumEquation: xe,
-  eitherStridesOrDilationsAreOne: K,
-  expandShapeToKeepDim: x,
-  exponent: ve,
-  exponents: We,
-  fromStringArrayToUint8: at,
-  fromUint8ToStringArray: ot,
-  getAxesPermutation: P,
-  getBroadcastDims: y,
-  getComplexWithIndex: Fe,
-  getEinsumComputePath: ze,
-  getEinsumPermutation: Pe,
-  getFusedBiasGradient: Q,
-  getFusedDyActivation: Y,
-  getImageCenter: de,
-  getInnerMostAxes: C,
-  getPermuted: Ee,
-  getRaggedRank: fe,
-  getReductionAxes: D,
-  getReshaped: me,
-  getReshapedPermuted: $e,
-  getRowPartitionTypesHelper: he,
-  getSliceBeginCoords: Ie,
-  getSliceSize: Se,
-  getSparseFillEmptyRowsIndicesDenseShapeMismatch: je,
-  getSparseFillEmptyRowsNegativeIndexErrorMessage: Ge,
-  getSparseFillEmptyRowsOutOfRangeIndexErrorMessage: He,
-  getSparseReshapeEmptyTensorZeroOutputDimErrorMessage: Ze,
-  getSparseReshapeInputOutputMismatchErrorMessage: Je,
-  getSparseReshapeInputOutputMultipleErrorMessage: Xe,
-  getSparseReshapeMultipleNegativeOneOutputDimErrorMessage: ke,
-  getSparseReshapeNegativeOutputDimErrorMessage: qe,
-  getSparseSegmentReductionIndicesOutOfRangeErrorMessage: et,
-  getSparseSegmentReductionNegativeSegmentIdsErrorMessage: Ke,
-  getSparseSegmentReductionNonIncreasingSegmentIdsErrorMessage: Qe,
-  getSparseSegmentReductionSegmentIdOutOfRangeErrorMessage: Ye,
-  getUndoAxesPermutation: z,
-  isIdentityPermutation: Ue,
-  log: T,
-  mergeRealAndImagArrays: ye,
-  prepareAndValidate: ie,
-  prepareSplitSize: Ve,
-  segment_util: rt,
-  shouldFuse: ee,
-  slice_util: te,
-  splitRealAndImagArrays: De,
-  stridesOrDilationsArePositive: ne,
-  tupleValuesAreOne: se,
-  upcastType: b,
-  validateDefaultValueShape: pe,
-  validateInput: oe,
-  validateUpdateShape: ae,
-  warn: F
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  me as A,
-  Ee as B,
-  $e as C,
-  Ie as D,
-  we as E,
-  Se as F,
-  le as G,
-  ue as H,
-  xe as I,
-  Ce as J,
-  ze as K,
-  Pe as L,
-  Ue as M,
-  ie as N,
-  st as O,
-  de as P,
-  Ve as Q,
-  p as R,
-  nt as S,
-  Fe as T,
-  De as U,
-  Te as V,
-  be as W,
-  We as X,
-  Le as Y,
-  ve as Z,
-  tt as _,
-  fe as a,
-  ht as b,
-  ge as c,
-  ce as d,
-  at as e,
-  ot as f,
-  he as g,
-  je as h,
-  Ge as i,
-  He as j,
-  ke as k,
-  qe as l,
-  ye as m,
-  Ze as n,
-  Xe as o,
-  Je as p,
-  Ke as q,
-  Qe as r,
-  Ye as s,
-  et as t,
-  Ae as u,
-  pe as v,
-  Re as w,
-  Oe as x,
-  _e as y,
-  Me as z
-};