@genai-fi/nanogpt 0.4.5 → 0.5.1

package/dist/tfjs_backend-DuKis_xG.js

@@ -1,2271 +0,0 @@
-import { o as f, h as l, E as d, ap as nn, aq as tn, j as p, ar as sn, D as Ve, as as rn, O as P, at as on, au as an, av as cn, aw as un, a4 as ln, ag as pn, p as Y, ax as fn, ay as hn, az as dn, aA as mn, aB as gn, aC as $n, aD as bn, aE as kn, x as C, aF as xn, aG as wn, aH as An, aI as yn, aJ as _n, aK as In, aL as En, aM as Sn, I as Tn, J as Nn, K as Dn, aN as Mn, t as K, aO as he, b as I, aP as On, a8 as U, n as Me, c as Oe, aQ as Be, aR as Bn, aS as Pn, aT as Kn, aU as Rn, aV as qn, aW as jn, f as Fn, aX as Gn, aY as Ln, ai as L, s as q, aZ as Vn, w as de, a as Cn, am as Pe, a_ as vn, a2 as zn } from "./index--6vO-cOz.js";
-import { r as $ } from "./reshape-z51Eu-re.js";
-import { s as Ce } from "./split-B_k_jwud.js";
-import { s as G } from "./sum-DdkDf2MG.js";
-import { b as me } from "./slice_util-BdhYwFY_.js";
-import { r as ue } from "./range-C_vpUjBu.js";
-import { t as Wn } from "./tensor-BGYi41cj.js";
-import { s as le } from "./stack-CmqSdsfs.js";
-import { c as Jn, z as Yn } from "./zeros-8xl-W2DC.js";
-import { n as ve } from "./norm-DSva3hI3.js";
-import { c as V } from "./concat-DvWM7HGZ.js";
-import { m as y } from "./mat_mul-BEHRPMh0.js";
-import { t as ge } from "./tensor2d-DUr_htjt.js";
-import { r as Un, d as Zn } from "./dropout-DFEXTPV0.js";
-import { g as Xn } from "./gather-C5D8PxwA.js";
-/**
- * @license
- * Copyright 2018 Google LLC. All Rights Reserved.
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- * http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- * =============================================================================
- */
-function Hn(e) {
-  const t = { x: l(e, "x", "sigmoid", "float32") };
-  return d.runKernel(nn, t);
-}
-const Qn = /* @__PURE__ */ f({ sigmoid_: Hn });
-/**
- * @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 et(e, n, t) {
-  const s = l(e, "x", "slice", "string_or_numeric");
-  if (s.rank === 0)
-    throw new Error("Slicing scalar is not possible");
-  const r = { x: s }, o = { begin: n, size: t };
-  return d.runKernel(tn, r, o);
-}
-const _ = /* @__PURE__ */ f({ slice_: et });
-/**
- * @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 nt(e, n, t) {
-  const s = l(e, "x", "bincount"), r = l(n, "weights", "bincount");
-  p(s.dtype === "int32", () => `Error in bincount: input dtype must be int32, but got ${s.dtype}`), p(t >= 0, () => `size must be non-negative, but got ${t}.`), p(r.size === s.size || r.size === 0, () => `Error in bincount: weights must have the same size as input or0-length, but got input shape: ${s.shape}, weights shape: ${r.shape}.`);
-  const o = { x: s, weights: r }, a = { size: t };
-  return d.runKernel(sn, o, a);
-}
-const tt = /* @__PURE__ */ f({ bincount_: nt });
-/**
- * @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 st(e, n, t) {
-  const s = l(e, "x", "clipByValue");
-  if (p(n <= t, () => `Error in clip: min (${n}) must be less than or equal to max (${t}).`), n === t)
-    return Ve(s.shape, n, s.dtype);
-  const r = { x: s }, o = { clipValueMin: n, clipValueMax: t };
-  return d.runKernel(rn, r, o);
-}
-const rt = /* @__PURE__ */ f({ clipByValue_: st });
-function ot(e) {
-  return V(
-    e,
-    0
-    /* axis */
-  );
-}
-const at = /* @__PURE__ */ f({ concat1d_: ot });
-function it(e, n) {
-  return V(e, n);
-}
-const ct = /* @__PURE__ */ f({ concat2d_: it });
-function ut(e, n) {
-  return V(e, n);
-}
-const lt = /* @__PURE__ */ f({ concat3d_: ut });
-function pt(e, n) {
-  return V(e, n);
-}
-const ft = /* @__PURE__ */ f({ concat4d_: pt });
-/**
- * @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 ht(e, n, t) {
-  const s = l(n, "a", "where"), r = l(t, "b", "where"), o = l(e, "condition", "where", "bool"), a = P(P(o.shape, s.shape), r.shape), i = me(o, a), u = me(s, a), c = me(r, a), m = {
-    condition: i,
-    t: u,
-    e: c
-  };
-  return d.runKernel(on, m);
-}
-const ee = /* @__PURE__ */ f({ where_: ht });
-/**
- * @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 dt(e, ...n) {
-  const t = n.map((r, o) => l(r, `tensors${o}`, "einsum")), s = { equation: e };
-  return d.runKernel(an, t, s);
-}
-const re = /* @__PURE__ */ f({ einsum_: dt });
-/**
- * @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 mt(e) {
-  const t = { x: l(e, "x", "elu", "float32") };
-  return d.runKernel(cn, t);
-}
-const ze = /* @__PURE__ */ f({ elu_: mt });
-/**
- * @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 gt(e, n = 0) {
-  const t = l(e, "x", "expandDims", "string_or_numeric");
-  p(n <= t.rank, () => "Axis must be <= rank of the tensor");
-  const s = { input: t }, r = { dim: n };
-  return d.runKernel(un, s, r);
-}
-const J = /* @__PURE__ */ f({ expandDims_: gt });
-/**
- * @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 $t(e, n) {
-  const t = l(e, "x", "tile", "string_or_numeric");
-  p(t.rank === n.length, () => `Error in transpose: rank of input ${t.rank} must match length of reps ${n}.`);
-  const s = { x: t }, r = { reps: n };
-  return d.runKernel(ln, s, r);
-}
-const oe = /* @__PURE__ */ f({ tile_: $t });
-/**
- * @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 bt(e, n, t, s = "float32") {
-  n == null && (n = e);
-  const r = pn([e, n], s), o = e <= n ? e : n;
-  for (let i = 0; i < o; ++i)
-    r.set(1, i, i);
-  const a = $(r.toTensor(), [e, n]);
-  if (t == null)
-    return a;
-  if (t.length === 1)
-    return oe(J(a, 0), [t[0], 1, 1]);
-  if (t.length === 2)
-    return oe(J(J(a, 0), 0), [t[0], t[1], 1, 1]);
-  if (t.length === 3)
-    return oe(J(J(J(a, 0), 0), 0), [
-      t[0],
-      t[1],
-      t[2],
-      1,
-      1
-    ]);
-  throw new Error(`eye() currently supports only 1D and 2D batchShapes, but received ${t.length}D.`);
-}
-const kt = /* @__PURE__ */ f({ eye_: bt });
-/**
- * @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 xt(e, n) {
-  let t = l(e, "a", "greater", "string_or_numeric"), s = l(n, "b", "greater", "string_or_numeric");
-  [t, s] = Y(t, s), P(t.shape, s.shape);
-  const r = { a: t, b: s };
-  return d.runKernel(fn, r);
-}
-const _e = /* @__PURE__ */ f({ greater_: xt });
-/**
- * @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 wt(e, n) {
-  let t = l(e, "a", "greaterEqual", "string_or_numeric"), s = l(n, "b", "greaterEqual", "string_or_numeric");
-  [t, s] = Y(t, s), P(t.shape, s.shape);
-  const r = { a: t, b: s };
-  return d.runKernel(hn, r);
-}
-const At = /* @__PURE__ */ f({ greaterEqual_: wt });
-/**
- * @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 yt(e) {
-  const t = { input: l(e, "input", "imag") };
-  return d.runKernel(dn, t);
-}
-const _t = /* @__PURE__ */ f({ imag_: yt });
-/**
- * @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 It(e, n = 0.2) {
-  const s = { x: l(e, "x", "leakyRelu") }, r = { alpha: n };
-  return d.runKernel(mn, s, r);
-}
-const Et = /* @__PURE__ */ f({ leakyRelu_: It });
-/**
- * @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 St(e, n) {
-  let t = l(e, "a", "less", "string_or_numeric"), s = l(n, "b", "less", "string_or_numeric");
-  [t, s] = Y(t, s), P(t.shape, s.shape);
-  const r = { a: t, b: s };
-  return d.runKernel(gn, r);
-}
-const Ke = /* @__PURE__ */ f({ less_: St });
-/**
- * @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 Tt(e, n) {
-  let t = l(e, "a", "lessEqual", "string_or_numeric"), s = l(n, "b", "lessEqual", "string_or_numeric");
-  [t, s] = Y(t, s), P(t.shape, s.shape);
-  const r = { a: t, b: s };
-  return d.runKernel($n, r);
-}
-const We = /* @__PURE__ */ f({ lessEqual_: Tt });
-/**
- * @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 Nt(e) {
-  const t = { x: l(e, "x", "neg") };
-  return d.runKernel(bn, t);
-}
-const Ie = /* @__PURE__ */ f({ neg_: Nt });
-/**
- * @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 Dt(e, n) {
-  const t = l(e, "a", "logicalAnd", "bool"), s = l(n, "b", "logicalAnd", "bool");
-  P(t.shape, s.shape);
-  const r = { a: t, b: s };
-  return d.runKernel(kn, r);
-}
-const Mt = /* @__PURE__ */ f({ logicalAnd_: Dt });
-/**
- * @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 Ot(e, n) {
-  let t = l(e, "a", "minimum"), s = l(n, "b", "minimum");
-  [t, s] = Y(t, s), t.dtype === "bool" && (t = C(t, "int32"), s = C(s, "int32")), P(t.shape, s.shape);
-  const r = { a: t, b: s };
-  return d.runKernel(xn, r);
-}
-const Re = /* @__PURE__ */ f({ minimum_: Ot });
-/**
- * @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 Bt(e, n) {
-  const t = l(e, "x", "prelu"), s = l(n, "alpha", "prelu"), r = { x: t, alpha: s };
-  return d.runKernel(wn, r);
-}
-const Pt = /* @__PURE__ */ f({ prelu_: Bt });
-/**
- * @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 Kt(e) {
-  const t = { input: l(e, "input", "real") };
-  return d.runKernel(An, t);
-}
-const Rt = /* @__PURE__ */ f({ real_: Kt });
-/**
- * @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 qt(e) {
-  const t = { x: l(e, "x", "relu") };
-  return d.runKernel(yn, t);
-}
-const jt = /* @__PURE__ */ f({ relu_: qt });
-/**
- * @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 Ft(e) {
-  const t = { x: l(e, "x", "relu6") };
-  return d.runKernel(_n, t);
-}
-const Gt = /* @__PURE__ */ f({ relu6_: Ft });
-/**
- * @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 Lt(e) {
-  const t = { x: l(e, "x", "round") };
-  return d.runKernel(In, t);
-}
-const Vt = /* @__PURE__ */ f({ round_: Lt });
-/**
- * @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 Ct(e, n, t) {
-  const s = l(e, "x", "slice1d");
-  return p(s.rank === 1, () => `slice1d expects a rank-1 tensor, but got a rank-${s.rank} tensor`), _(s, [n], [t]);
-}
-const Ee = /* @__PURE__ */ f({ slice1d_: Ct });
-/**
- * @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 vt(e, n, t) {
-  const s = l(e, "x", "slice2d");
-  return p(s.rank === 2, () => `slice2d expects a rank-2 tensor, but got a rank-${s.rank} tensor`), _(s, n, t);
-}
-const Je = /* @__PURE__ */ f({ slice2d_: vt });
-/**
- * @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 zt(e, n, t) {
-  const s = l(e, "x", "slice3d");
-  return p(s.rank === 3, () => `slice3d expects a rank-3 tensor, but got a rank-${s.rank} tensor`), _(s, n, t);
-}
-const Se = /* @__PURE__ */ f({ slice3d_: zt });
-/**
- * @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 Wt(e, n, t) {
-  const s = l(e, "x", "slice4d");
-  return p(s.rank === 4, () => `slice4d expects a rank-4 tensor, but got a rank-${s.rank} tensor`), _(s, n, t);
-}
-const pe = /* @__PURE__ */ f({ slice4d_: Wt });
-/**
- * @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 Jt(e, n) {
-  const t = l(e, "x", "squeeze", "string_or_numeric");
-  return $(t, En(t.shape, n).newShape);
-}
-const Yt = /* @__PURE__ */ f({ squeeze_: Jt });
-/**
- * @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 Ut(e, n = 0) {
-  const s = { x: l(e, "x", "step") }, r = { alpha: n };
-  return d.runKernel(Sn, s, r);
-}
-const Zt = /* @__PURE__ */ f({ step_: Ut });
-/**
- * @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 B(e, n) {
-  Tn(e);
-  const t = Nn(e, n);
-  if (t.length !== 1)
-    throw new Error("tensor1d() requires values to be a flat/TypedArray");
-  return Dn(e, null, t, n);
-}
-/**
- * @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 Xt(e, n = 0) {
-  const t = l(e, "x", "unstack", "string_or_numeric");
-  p(n >= -t.shape.length && n < t.shape.length, () => `Axis = ${n} is not in [-${t.shape.length}, ${t.shape.length})`);
-  const s = { value: t }, r = { axis: n };
-  return d.runKernel(Mn, s, r);
-}
-const Ye = /* @__PURE__ */ f({ unstack_: Xt });
-/**
- * @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 Ht(e, n, t) {
-  const s = l(e, "x", "transpose");
-  if (n == null && (n = s.shape.map((a, i) => i).reverse()), p(s.rank === n.length, () => `Error in transpose: rank of input ${s.rank} must match length of perm ${n}.`), n.forEach((a) => {
-    p(a >= 0 && a < s.rank, () => `All entries in 'perm' must be between 0 and ${s.rank - 1} but got ${n}`);
-  }), s.rank <= 1)
-    return s.clone();
-  const r = { x: s }, o = { perm: n };
-  return s.dtype === "complex64" ? K(() => {
-    let a = Rt(s), i = _t(s);
-    return a = d.runKernel(he, { x: a }, o), i = d.runKernel(he, { x: i }, o), t && (i = Ie(i)), Jn(a, i);
-  }) : d.runKernel(he, r, o);
-}
-const xe = /* @__PURE__ */ f({ transpose_: Ht });
-/**
- * @license
- * Copyright 2019 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 Qt(e, n, t) {
-  if (t == null || t === "linear")
-    return e;
-  if (t === "relu")
-    return I(e, Zt(n));
-  throw new Error(`Cannot compute gradient for fused activation ${t}.`);
-}
-function es(e, n) {
-  let t = n;
-  const s = On(e.shape, n.shape);
-  return s.length > 0 && (t = G(t, s)), $(t, e.shape);
-}
-function ns(e, n, t, s) {
-  if (n === "linear")
-    return e;
-  if (n === "relu")
-    return jt(e);
-  if (n === "elu")
-    return ze(e);
-  if (n === "relu6")
-    return Gt(e);
-  if (n === "prelu")
-    return Pt(e, t);
-  if (n === "leakyrelu")
-    return Et(e, s);
-  if (n === "sigmoid")
-    return Qn(e);
-  throw new Error(`Unknown fused activation ${n}.`);
-}
-const ts = (e, n) => !(e > 0) || n === "linear";
-/**
- * @license
- * Copyright 2019 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 ss({ a: e, b: n, transposeA: t = !1, transposeB: s = !1, bias: r, activation: o = "linear", preluActivationWeights: a, leakyreluAlpha: i = 0.2 }) {
-  if (ts(d.state.gradientDepth, o) === !1) {
-    let z = y(e, n, t, s);
-    return r != null && (z = U(z, r)), ns(z, o, a, i);
-  }
-  let u = l(e, "a", "fused matMul"), c = l(n, "b", "fused matMul");
-  [u, c] = Y(u, c);
-  const m = t ? u.shape[u.rank - 2] : u.shape[u.rank - 1], h = s ? c.shape[c.rank - 1] : c.shape[c.rank - 2], b = t ? u.shape[u.rank - 1] : u.shape[u.rank - 2], g = s ? c.shape[c.rank - 2] : c.shape[c.rank - 1], x = u.shape.slice(0, -2), w = c.shape.slice(0, -2), k = Me(x), E = Me(w);
-  p(m === h, () => `Error in fused matMul: inner shapes (${m}) and (${h}) of Tensors with shapes ${u.shape} and ${c.shape} and transposeA=${t} and transposeB=${s} must match.`);
-  const T = P(u.shape.slice(0, -2), c.shape.slice(0, -2)).concat([b, g]), M = t ? $(u, [k, m, b]) : $(u, [k, b, m]), O = s ? $(c, [E, g, h]) : $(c, [E, h, g]);
-  let N;
-  r != null && (N = l(r, "bias", "fused matMul"), [N] = Y(N, u), P(T, N.shape));
-  let te;
-  a != null && (te = l(a, "prelu weights", "fused matMul"));
-  const v = (z, se) => {
-    const [j, F, W, ce] = se, R = Qt($(z, W.shape), W, o);
-    let X, H;
-    if (!t && !s ? (X = y(R, F, !1, !0), H = y(j, R, !0, !1)) : !t && s ? (X = y(R, F, !1, !1), H = y(R, j, !0, !1)) : t && !s ? (X = y(F, R, !1, !0), H = y(j, R, !1, !1)) : (X = y(F, R, !0, !0), H = y(R, j, !0, !0)), r != null) {
-      const en = es(ce, R);
-      return [X, H, en];
-    } else
-      return [X, H];
-  }, Z = {
-    a: M,
-    b: O,
-    bias: N,
-    preluActivationWeights: te
-  }, De = { transposeA: t, transposeB: s, activation: o, leakyreluAlpha: i };
-  return r == null ? Oe((se, j, F) => {
-    const W = (
-      // tslint:disable-next-line: no-unnecessary-type-assertion
-      d.runKernel(Be, Z, De)
-    );
-    return F([se, j, W]), { value: $(W, T), gradFunc: v };
-  })(M, O) : Oe((se, j, F, W) => {
-    const ce = (
-      // tslint:disable-next-line: no-unnecessary-type-assertion
-      d.runKernel(Be, Z, De)
-    );
-    return W([se, j, ce, F]), { value: $(ce, T), gradFunc: v };
-  })(M, O, N);
-}
-const qe = /* @__PURE__ */ f({ fusedMatMul_: ss });
-/**
- * @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 rs(e, n, t, s, r = "bilinear", o = 0) {
-  const a = l(e, "image", "cropAndResize"), i = l(n, "boxes", "cropAndResize", "float32"), u = l(t, "boxInd", "cropAndResize", "int32"), c = i.shape[0];
-  p(a.rank === 4, () => `Error in cropAndResize: image must be rank 4,but got rank ${a.rank}.`), p(i.rank === 2 && i.shape[1] === 4, () => `Error in cropAndResize: boxes must be have size [${c},4] but had shape ${i.shape}.`), p(u.rank === 1 && u.shape[0] === c, () => `Error in cropAndResize: boxInd must be have size [${c}] but had shape ${i.shape}.`), p(s.length === 2, () => `Error in cropAndResize: cropSize must be of length 2, but got length ${s.length}.`), p(s[0] >= 1 && s[1] >= 1, () => `cropSize must be atleast [1,1], but was ${s}`), p(r === "bilinear" || r === "nearest", () => `method must be bilinear or nearest, but was ${r}`);
-  const m = { image: a, boxes: i, boxInd: u }, h = { method: r, extrapolationValue: o, cropSize: s };
-  return d.runKernel(Bn, m, h);
-}
-const os = /* @__PURE__ */ f({ cropAndResize_: rs });
-/**
- * @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 as(e) {
-  const n = l(e, "image", "flipLeftRight", "float32");
-  p(n.rank === 4, () => `Error in flipLeftRight: image must be rank 4,but got rank ${n.rank}.`);
-  const t = { image: n };
-  return d.runKernel(Pn, t, {});
-}
-const is = /* @__PURE__ */ f({ flipLeftRight_: as });
-/**
- * @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 cs(e) {
-  const n = l(e, "image", "grayscaleToRGB"), t = n.rank - 1, s = n.shape[t];
-  p(n.rank >= 2, () => `Error in grayscaleToRGB: images must be at least rank 2, but got rank ${n.rank}.`), p(s === 1, () => `Error in grayscaleToRGB: last dimension of a grayscale image should be size 1, but got size ${s}.`);
-  const r = new Array(n.rank);
-  return r.fill(1, 0, t), r[t] = 3, oe(n, r);
-}
-const us = /* @__PURE__ */ f({ grayscaleToRGB_: cs });
-/**
- * @license
- * Copyright 2023 Google LLC.
- * 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 ls(e) {
-  const n = l(e, "image", "RGBToGrayscale"), t = n.rank - 1, s = n.shape[t];
-  p(n.rank >= 2, () => `Error in RGBToGrayscale: images must be at least rank 2, but got rank ${n.rank}.`), p(s === 3, () => `Error in RGBToGrayscale: last dimension of an RGB image should be size 3, but got size ${s}.`);
-  const r = n.dtype, o = C(n, "float32"), a = B([0.2989, 0.587, 0.114]);
-  let i;
-  switch (n.rank) {
-    case 2:
-      i = re("ij,j->i", o, a);
-      break;
-    case 3:
-      i = re("ijk,k->ij", o, a);
-      break;
-    case 4:
-      i = re("ijkl,l->ijk", o, a);
-      break;
-    case 5:
-      i = re("ijklm,m->ijkl", o, a);
-      break;
-    case 6:
-      i = re("ijklmn,n->ijklm", o, a);
-      break;
-    default:
-      throw new Error("Not a valid tensor rank.");
-  }
-  return i = J(i, -1), C(i, r);
-}
-const ps = /* @__PURE__ */ f({ rgbToGrayscale_: ls });
-/**
- * @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 fs(e, n, t = 0, s = 0.5) {
-  const r = l(e, "image", "rotateWithOffset", "float32");
-  p(r.rank === 4, () => `Error in rotateWithOffset: image must be rank 4,but got rank ${r.rank}.`);
-  const o = { image: r }, a = { radians: n, fillValue: t, center: s };
-  return d.runKernel(Kn, o, a);
-}
-const hs = /* @__PURE__ */ f({ rotateWithOffset_: fs });
-/**
- * @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 ne(e, n, t, s, r, o) {
-  s == null && (s = 0.5), r == null && (r = Number.NEGATIVE_INFINITY), o == null && (o = 0);
-  const a = e.shape[0];
-  return t = Math.min(t, a), p(0 <= s && s <= 1, () => `iouThreshold must be in [0, 1], but was '${s}'`), p(e.rank === 2, () => `boxes must be a 2D tensor, but was of rank '${e.rank}'`), p(e.shape[1] === 4, () => `boxes must have 4 columns, but 2nd dimension was ${e.shape[1]}`), p(n.rank === 1, () => "scores must be a 1D tensor"), p(n.shape[0] === a, () => `scores has incompatible shape with boxes. Expected ${a}, but was ${n.shape[0]}`), p(0 <= o && o <= 1, () => `softNmsSigma must be in [0, 1], but was '${o}'`), { maxOutputSize: t, iouThreshold: s, scoreThreshold: r, softNmsSigma: o };
-}
-/**
- * @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 ds(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY) {
-  const o = l(e, "boxes", "nonMaxSuppression", "float32"), a = l(n, "scores", "nonMaxSuppression", "float32"), i = ne(o, a, t, s, r);
-  t = i.maxOutputSize, s = i.iouThreshold, r = i.scoreThreshold;
-  const u = { maxOutputSize: t, iouThreshold: s, scoreThreshold: r };
-  return d.runKernel(Rn, { boxes: o, scores: a }, u);
-}
-const ms = /* @__PURE__ */ f({ nonMaxSuppression_: ds });
-/**
- * @license
- * Copyright 2019 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 gs(e, n, t) {
-  const s = $s(e, n, t), r = s < 0 ? -(s + 1) : s;
-  e.splice(r, 0, n);
-}
-function $s(e, n, t) {
-  return ks(e, n, t || bs);
-}
-function bs(e, n) {
-  return e > n ? 1 : e < n ? -1 : 0;
-}
-function ks(e, n, t) {
-  let s = 0, r = e.length, o = 0, a = !1;
-  for (; s < r; ) {
-    o = s + (r - s >>> 1);
-    const i = t(n, e[o]);
-    i > 0 ? s = o + 1 : (r = o, a = !i);
-  }
-  return a ? s : -s - 1;
-}
-/**
- * @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 xs(e, n, t, s, r) {
-  return Te(
-    e,
-    n,
-    t,
-    s,
-    r,
-    0
-    /* softNmsSigma */
-  );
-}
-function ws(e, n, t, s, r, o) {
-  return Te(
-    e,
-    n,
-    t,
-    s,
-    r,
-    0,
-    !1,
-    o,
-    !0
-    /* returnValidOutputs */
-  );
-}
-function As(e, n, t, s, r, o) {
-  return Te(
-    e,
-    n,
-    t,
-    s,
-    r,
-    o,
-    !0
-    /* returnScoresTensor */
-  );
-}
-function Te(e, n, t, s, r, o, a = !1, i = !1, u = !1) {
-  const c = [];
-  for (let k = 0; k < n.length; k++)
-    n[k] > r && c.push({ score: n[k], boxIndex: k, suppressBeginIndex: 0 });
-  c.sort(je);
-  const m = o > 0 ? -0.5 / o : 0, h = [], b = [];
-  for (; h.length < t && c.length > 0; ) {
-    const k = c.pop(), { score: E, boxIndex: S, suppressBeginIndex: T } = k;
-    if (E < r)
-      break;
-    let M = !1;
-    for (let O = h.length - 1; O >= T; --O) {
-      const N = ys(e, S, h[O]);
-      if (N >= s) {
-        M = !0;
-        break;
-      }
-      if (k.score = k.score * _s(s, m, N), k.score <= r)
-        break;
-    }
-    k.suppressBeginIndex = h.length, M || (k.score === E ? (h.push(S), b.push(k.score)) : k.score > r && gs(c, k, je));
-  }
-  const g = h.length, x = t - g;
-  i && x > 0 && (h.push(...new Array(x).fill(0)), b.push(...new Array(x).fill(0)));
-  const w = { selectedIndices: h };
-  return a && (w.selectedScores = b), u && (w.validOutputs = g), w;
-}
-function ys(e, n, t) {
-  const s = e.subarray(n * 4, n * 4 + 4), r = e.subarray(t * 4, t * 4 + 4), o = Math.min(s[0], s[2]), a = Math.min(s[1], s[3]), i = Math.max(s[0], s[2]), u = Math.max(s[1], s[3]), c = Math.min(r[0], r[2]), m = Math.min(r[1], r[3]), h = Math.max(r[0], r[2]), b = Math.max(r[1], r[3]), g = (i - o) * (u - a), x = (h - c) * (b - m);
-  if (g <= 0 || x <= 0)
-    return 0;
-  const w = Math.max(o, c), k = Math.max(a, m), E = Math.min(i, h), S = Math.min(u, b), T = Math.max(E - w, 0) * Math.max(S - k, 0);
-  return T / (g + x - T);
-}
-function _s(e, n, t) {
-  const s = Math.exp(n * t * t);
-  return t <= e ? s : 0;
-}
-function je(e, n) {
-  return e.score - n.score || e.score === n.score && n.boxIndex - e.boxIndex;
-}
-/**
- * @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.
- * =============================================================================
- */
-async function Is(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY) {
-  const o = l(e, "boxes", "nonMaxSuppressionAsync"), a = l(n, "scores", "nonMaxSuppressionAsync"), i = ne(o, a, t, s, r);
-  t = i.maxOutputSize, s = i.iouThreshold, r = i.scoreThreshold;
-  const u = await Promise.all([o.data(), a.data()]), c = u[0], m = u[1], { selectedIndices: h } = xs(c, m, t, s, r);
-  return o !== e && o.dispose(), a !== n && a.dispose(), B(h, "int32");
-}
-const Es = Is;
-/**
- * @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 Ss(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
-  const a = l(e, "boxes", "nonMaxSuppression"), i = l(n, "scores", "nonMaxSuppression"), u = ne(a, i, t, s, r, o);
-  t = u.maxOutputSize, s = u.iouThreshold, r = u.scoreThreshold, o = u.softNmsSigma;
-  const c = { boxes: a, scores: i }, m = { maxOutputSize: t, iouThreshold: s, scoreThreshold: r, softNmsSigma: o }, h = d.runKernel(qn, c, m);
-  return { selectedIndices: h[0], selectedScores: h[1] };
-}
-const Ts = /* @__PURE__ */ f({ nonMaxSuppressionWithScore_: Ss });
-/**
- * @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.
- * =============================================================================
- */
-async function Ns(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = 0) {
-  const a = l(e, "boxes", "nonMaxSuppressionAsync"), i = l(n, "scores", "nonMaxSuppressionAsync"), u = ne(a, i, t, s, r, o);
-  t = u.maxOutputSize, s = u.iouThreshold, r = u.scoreThreshold, o = u.softNmsSigma;
-  const c = await Promise.all([a.data(), i.data()]), m = c[0], h = c[1], { selectedIndices: b, selectedScores: g } = As(m, h, t, s, r, o);
-  return a !== e && a.dispose(), i !== n && i.dispose(), {
-    selectedIndices: B(b, "int32"),
-    selectedScores: B(g)
-  };
-}
-const Ds = Ns;
-/**
- * @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 Ms(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
-  const a = l(e, "boxes", "nonMaxSuppression"), i = l(n, "scores", "nonMaxSuppression"), u = ne(
-    a,
-    i,
-    t,
-    s,
-    r,
-    null
-    /* softNmsSigma */
-  ), c = u.maxOutputSize, m = u.iouThreshold, h = u.scoreThreshold, b = { boxes: a, scores: i }, g = {
-    maxOutputSize: c,
-    iouThreshold: m,
-    scoreThreshold: h,
-    padToMaxOutputSize: o
-  }, x = d.runKernel(jn, b, g);
-  return { selectedIndices: x[0], validOutputs: x[1] };
-}
-const Os = /* @__PURE__ */ f({ nonMaxSuppressionPadded_: Ms });
-/**
- * @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.
- * =============================================================================
- */
-async function Bs(e, n, t, s = 0.5, r = Number.NEGATIVE_INFINITY, o = !1) {
-  const a = l(e, "boxes", "nonMaxSuppressionAsync"), i = l(n, "scores", "nonMaxSuppressionAsync"), u = ne(
-    a,
-    i,
-    t,
-    s,
-    r,
-    null
-    /* softNmsSigma */
-  ), c = u.maxOutputSize, m = u.iouThreshold, h = u.scoreThreshold, [b, g] = await Promise.all([a.data(), i.data()]), { selectedIndices: x, validOutputs: w } = ws(b, g, c, m, h, o);
-  return a !== e && a.dispose(), i !== n && i.dispose(), {
-    selectedIndices: B(x, "int32"),
-    validOutputs: Fn(w, "int32")
-  };
-}
-const Ps = Bs;
-/**
- * @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 Ks(e, n, t = !1, s = !1) {
-  const r = l(e, "images", "resizeBilinear");
-  p(r.rank === 3 || r.rank === 4, () => `Error in resizeBilinear: x must be rank 3 or 4, but got rank ${r.rank}.`), p(n.length === 2, () => `Error in resizeBilinear: new shape must 2D, but got shape ${n}.`), p(s === !1 || t === !1, () => "Error in resizeBilinear: If halfPixelCenters is true, alignCorners must be false.");
-  let o = r, a = !1;
-  r.rank === 3 && (a = !0, o = $(r, [1, r.shape[0], r.shape[1], r.shape[2]]));
-  const i = { images: o }, u = { alignCorners: t, halfPixelCenters: s, size: n }, c = d.runKernel(Gn, i, u);
-  return a ? $(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
-}
-const Rs = /* @__PURE__ */ f({ resizeBilinear_: Ks });
-/**
- * @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 qs(e, n, t = !1, s = !1) {
-  const r = l(e, "images", "resizeNearestNeighbor");
-  p(r.rank === 3 || r.rank === 4, () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got rank ${r.rank}.`), p(n.length === 2, () => `Error in resizeNearestNeighbor: new shape must 2D, but got shape ${n}.`), p(r.dtype === "float32" || r.dtype === "int32", () => "`images` must have `int32` or `float32` as dtype"), p(s === !1 || t === !1, () => "Error in resizeNearestNeighbor: If halfPixelCenters is true, alignCorners must be false.");
-  let o = r, a = !1;
-  r.rank === 3 && (a = !0, o = $(r, [1, r.shape[0], r.shape[1], r.shape[2]]));
-  const i = { images: o }, u = { alignCorners: t, halfPixelCenters: s, size: n }, c = d.runKernel(Ln, i, u);
-  return a ? $(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
-}
-const js = /* @__PURE__ */ f({ resizeNearestNeighbor_: qs });
-/**
- * @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
- *
- * https://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 Fs(e, n = "binary", t = !1, s = 0.5) {
-  const r = l(e, "image", "threshold"), o = 0.2989, a = 0.587, i = 0.114, u = r.shape[0] * r.shape[1];
-  let c = I(B([s]), 255), m, h, b, g;
-  if (p(r.rank === 3, () => `Error in threshold: image must be rank 3,but got rank ${r.rank}.`), p(r.shape[2] === 3 || r.shape[2] === 1, () => `Error in threshold: image color channel must be equal to 3 or 1but got ${r.shape[2]}.`), p(r.dtype === "int32" || r.dtype === "float32", () => `Error in dtype: image dtype must be int32 or float32,but got dtype ${r.dtype}.`), p(n === "otsu" || n === "binary", () => `Method must be binary or otsu, but was ${n}`), r.shape[2] === 3) {
-    [m, h, b] = Ce(r, [1, 1, 1], -1);
-    const k = I(m, o), E = I(h, a), S = I(b, i);
-    g = U(U(k, E), S);
-  } else
-    g = e;
-  if (n === "otsu") {
-    const k = tt(C(Vt(g), "int32"), Wn([]), 256);
-    c = Gs(k, u);
-  }
-  const x = t ? We(g, c) : _e(g, c);
-  return C(I(x, 255), "int32");
-}
-function Gs(e, n) {
-  let t = B([-1]), s = B([0]), r = B([0]), o, a, i, u, c, m;
-  for (let h = 0; h < e.size - 1; h++) {
-    o = _(e, 0, h + 1), a = _(e, h + 1), c = L(G(o), n), m = L(G(a), n);
-    const b = G(I(o, ue(0, o.size)));
-    i = L(b, G(o));
-    const g = Ve(a.shape, o.size), x = U(ue(0, a.size), g), w = I(a, x);
-    u = L(G(w), G(a));
-    const k = q(i, u), E = q(i, u), S = I(c, m);
-    r = I(I(S, k), E);
-    const T = _e(r, s);
-    s = ee(T, r, s), t = ee(T, B([h]), t);
-  }
-  return t;
-}
-const Ls = /* @__PURE__ */ f({ threshold_: Fs });
-/**
- * @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 Vs(e, n, t = "nearest", s = "constant", r = 0, o) {
-  const a = l(e, "image", "transform", "float32"), i = l(n, "transforms", "transform", "float32");
-  p(a.rank === 4, () => `Error in transform: image must be rank 4,but got rank ${a.rank}.`), p(i.rank === 2 && (i.shape[0] === a.shape[0] || i.shape[0] === 1) && i.shape[1] === 8, () => "Error in transform: Input transform should be batch x 8 or 1 x 8"), p(o == null || o.length === 2, () => `Error in transform: outputShape must be [height, width] or null, but got ${o}.`);
-  const u = { image: a, transforms: i }, c = { interpolation: t, fillMode: s, fillValue: r, outputShape: o };
-  return d.runKernel(Vn, u, c);
-}
-const Cs = /* @__PURE__ */ f({ transform_: Vs });
-/**
- * @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 vs(e, n, t) {
-  const s = l(e, "a", "bandPart");
-  p(s.rank >= 2, () => `bandPart(): Rank must be at least 2, got ${s.rank}.`);
-  const r = s.shape, [o, a] = s.shape.slice(-2);
-  let i, u;
-  typeof n == "number" ? (p(n % 1 === 0, () => `bandPart(): numLower must be an integer, got ${n}.`), p(n <= o, () => `bandPart(): numLower (${n}) must not be greater than the number of rows (${o}).`), i = l(n < 0 ? o : n, "numLower", "bandPart")) : (p(n.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), i = ee(Ke(n, 0), o, Re(n, o))), typeof t == "number" ? (p(t % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${t}.`), p(t <= a, () => `bandPart(): numUpper (${t}) must not be greater than the number of columns (${a}).`), u = l(t < 0 ? a : t, "numUpper", "bandPart")) : (p(t.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), u = ee(Ke(t, 0), a, Re(t, a)));
-  const c = $(ue(0, o, 1, "int32"), [-1, 1]), m = ue(0, a, 1, "int32"), h = q(c, m), b = Mt(We(h, i), At(h, Ie(u))), g = Yn([o, a], s.dtype);
-  return $(le(Ye($(s, [-1, o, a])).map((x) => ee(b, x, g))), r);
-}
-const zs = /* @__PURE__ */ f({ bandPart_: vs });
-/**
- * @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 Ws(e) {
-  let n;
-  if (Array.isArray(e)) {
-    n = !1, p(e != null && e.length > 0, () => "Gram-Schmidt process: input must not be null, undefined, or empty");
-    const r = e[0].shape[0];
-    for (let o = 1; o < e.length; ++o)
-      p(e[o].shape[0] === r, () => `Gram-Schmidt: Non-unique lengths found in the input vectors: (${e[o].shape[0]} vs. ${r})`);
-  } else
-    n = !0, e = Ce(e, e.shape[0], 0).map((r) => Yt(r, [0]));
-  p(e.length <= e[0].shape[0], () => `Gram-Schmidt: Number of vectors (${e.length}) exceeds number of dimensions (${e[0].shape[0]}).`);
-  const t = [], s = e;
-  for (let r = 0; r < e.length; ++r)
-    t.push(d.tidy(() => {
-      let o = s[r];
-      if (r > 0)
-        for (let a = 0; a < r; ++a) {
-          const i = I(G(I(t[a], o)), t[a]);
-          o = q(o, i);
-        }
-      return L(o, ve(o, "euclidean"));
-    }));
-  return n ? le(t, 0) : t;
-}
-const Js = /* @__PURE__ */ f({ gramSchmidt_: Ws });
-/**
- * @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 Ys(e, n = !1) {
-  if (p(e.rank >= 2, () => `qr() requires input tensor to have a rank >= 2, but got rank ${e.rank}`), e.rank === 2)
-    return Fe(e, n);
-  {
-    const t = e.shape.slice(0, e.shape.length - 2).reduce((u, c) => u * c), s = Ye($(e, [
-      t,
-      e.shape[e.shape.length - 2],
-      e.shape[e.shape.length - 1]
-    ]), 0), r = [], o = [];
-    s.forEach((u) => {
-      const [c, m] = Fe(u, n);
-      r.push(c), o.push(m);
-    });
-    const a = $(le(r, 0), e.shape), i = $(le(o, 0), e.shape);
-    return [a, i];
-  }
-}
-function Fe(e, n = !1) {
-  return d.tidy(() => {
-    p(e.shape.length === 2, () => `qr2d() requires a 2D Tensor, but got a ${e.shape.length}D Tensor.`);
-    const t = e.shape[0], s = e.shape[1];
-    let r = kt(t), o = de(e);
-    const a = ge([[1]], [1, 1]);
-    let i = de(a);
-    const u = t >= s ? s : t;
-    for (let c = 0; c < u; ++c) {
-      const m = o, h = i, b = r;
-      [i, o, r] = d.tidy(() => {
-        const g = _(o, [c, c], [t - c, 1]), x = ve(g), w = _(o, [c, c], [1, 1]), k = ee(_e(w, 0), ge([[-1]]), ge([[1]])), E = q(w, I(k, x)), S = L(g, E);
-        S.shape[0] === 1 ? i = de(a) : i = V([
-          a,
-          _(S, [1, 0], [S.shape[0] - 1, S.shape[1]])
-        ], 0);
-        const T = Ie(L(y(k, E), x)), M = _(o, [c, 0], [t - c, s]), O = I(T, i), N = xe(i);
-        if (c === 0)
-          o = q(M, y(O, y(N, M)));
-        else {
-          const Z = q(M, y(O, y(N, M)));
-          o = V([_(o, [0, 0], [c, s]), Z], 0);
-        }
-        const te = xe(O), v = _(r, [0, c], [t, r.shape[1] - c]);
-        if (c === 0)
-          r = q(v, y(y(v, i), te));
-        else {
-          const Z = q(v, y(y(v, i), te));
-          r = V([_(r, [0, 0], [t, c]), Z], 1);
-        }
-        return [i, o, r];
-      }), Cn([m, h, b]);
-    }
-    return !n && t > s && (r = _(r, [0, 0], [t, s]), o = _(o, [0, 0], [s, s])), [r, o];
-  });
-}
-const Us = /* @__PURE__ */ f({ qr_: Ys });
-/**
- * @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.
- * =============================================================================
- */
-const Ar = {
-  flipLeftRight: is,
-  grayscaleToRGB: us,
-  resizeNearestNeighbor: js,
-  resizeBilinear: Rs,
-  rgbToGrayscale: ps,
-  rotateWithOffset: hs,
-  cropAndResize: os,
-  nonMaxSuppression: ms,
-  nonMaxSuppressionAsync: Es,
-  nonMaxSuppressionWithScore: Ts,
-  nonMaxSuppressionWithScoreAsync: Ds,
-  nonMaxSuppressionPadded: Os,
-  nonMaxSuppressionPaddedAsync: Ps,
-  threshold: Ls,
-  transform: Cs
-}, yr = {
-  bandPart: zs,
-  gramSchmidt: Js,
-  qr: Us
-};
-/**
- * @license
- * Copyright 2018 Google LLC
- *
- * Use of this source code is governed by an MIT-style
- * license that can be found in the LICENSE file or at
- * https://opensource.org/licenses/MIT.
- * =============================================================================
- */
-const Zs = ["channelsFirst", "channelsLast"], Xs = ["nearest", "bilinear"], Hs = ["valid", "same", "causal"], Qs = ["max", "avg"], _r = ["sum", "mul", "concat", "ave"];
-/**
- * @license
- * Copyright 2018 Google LLC
- *
- * Use of this source code is governed by an MIT-style
- * license that can be found in the LICENSE file or at
- * https://opensource.org/licenses/MIT.
- * =============================================================================
- */
-class Ue extends Error {
-  constructor(n) {
-    super(n), Object.setPrototypeOf(this, Ue.prototype);
-  }
-}
-class Ze extends Error {
-  constructor(n) {
-    super(n), Object.setPrototypeOf(this, Ze.prototype);
-  }
-}
-class A extends Error {
-  constructor(n) {
-    super(n), Object.setPrototypeOf(this, A.prototype);
-  }
-}
-class ie extends Error {
-  constructor(n) {
-    super(n), Object.setPrototypeOf(this, ie.prototype);
-  }
-}
-class Ne extends Error {
-  constructor(n) {
-    super(n), Object.setPrototypeOf(this, Ne.prototype);
-  }
-}
-/**
- * @license
- * Copyright 2018 Google LLC
- *
- * Use of this source code is governed by an MIT-style
- * license that can be found in the LICENSE file or at
- * https://opensource.org/licenses/MIT.
- * =============================================================================
- */
-function Ir(e, n) {
-  if (Array.isArray(e)) {
-    let t = [];
-    for (let s = 0; s < n; s++)
-      t = t.concat(e);
-    return t;
-  } else {
-    const t = new Array(n);
-    return t.fill(e), t;
-  }
-}
-function Ge(e, n) {
-  if (!e)
-    throw new Ne(n);
-}
-function Er(e, n) {
-  let t = 0;
-  for (const s of e)
-    s === n && t++;
-  return t;
-}
-function Sr(e) {
-  return e.length === 1 ? e[0] : e;
-}
-function Tr(e) {
-  return Array.isArray(e) ? e : [e];
-}
-function Nr(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 Dr(e) {
-  return e.length <= 1 || e.indexOf("_") === -1 ? e : e.replace(/[_]+(\w|$)/g, (n, t) => t.toUpperCase());
-}
-let D = {};
-function Mr(e) {
-  if (e == null)
-    return null;
-  const n = {};
-  return n.className = e.getClassName(), n.config = e.getConfig(), n;
-}
-function we(e) {
-  if (!(e == null || typeof e != "object"))
-    if (Array.isArray(e))
-      e.forEach((n) => we(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 : we(s));
-      }
-    }
-}
-function Or(e, n = {}, t = {}, s = "object", r = !1) {
-  if (typeof e == "string") {
-    const o = e;
-    let a;
-    if (o in t)
-      a = t[o];
-    else if (o in D)
-      a = D[o];
-    else if (a = n[o], a == null)
-      throw new A(`Unknown ${s}: ${e}. This may be due to one of the following reasons:
-1. The ${s} is defined in Python, in which case it needs to be ported to TensorFlow.js or your JavaScript code.
-2. The custom ${s} is defined in JavaScript, but is not registered properly with tf.serialization.registerClass().`);
-    return a;
-  } else {
-    const o = e;
-    if (o.className == null || o.config == null)
-      throw new A(`${s}: Improper config format: ${JSON.stringify(o)}.
-'className' and 'config' must set.`);
-    const a = o.className;
-    let i, u;
-    if (a in t ? [i, u] = t[a] : a in D ? [i, u] = D.className : a in n && ([i, u] = n[a]), i == null)
-      throw new A(`Unknown ${s}: ${a}. This may be due to one of the following reasons:
-1. The ${s} is defined in Python, in which case it needs to be ported to TensorFlow.js or your JavaScript code.
-2. The custom ${s} is defined in JavaScript, but is not registered properly with tf.serialization.registerClass().`);
-    if (u != null) {
-      const c = {};
-      for (const g of Object.keys(D))
-        c[g] = D[g];
-      for (const g of Object.keys(t))
-        c[g] = t[g];
-      const m = o.config;
-      m.customObjects = c;
-      const h = Object.assign({}, D);
-      for (const g of Object.keys(t))
-        D[g] = t[g];
-      we(o.config);
-      const b = u(i, o.config, t, r);
-      return D = Object.assign({}, h), b;
-    } else {
-      const c = Object.assign({}, D);
-      for (const h of Object.keys(t))
-        D[h] = t[h];
-      const m = new i(o.config);
-      return D = Object.assign({}, c), m;
-    }
-  }
-}
-function er(e, n) {
-  return e < n ? -1 : e > n ? 1 : 0;
-}
-function Br(e, n) {
-  return -1 * er(e, n);
-}
-function Pr(e) {
-  if (e == null)
-    return e;
-  const n = [];
-  for (const t of e)
-    n.indexOf(t) === -1 && n.push(t);
-  return n;
-}
-function Kr(e) {
-  if (e == null)
-    throw new A(`Invalid value in obj: ${JSON.stringify(e)}`);
-  for (const n in e)
-    if (e.hasOwnProperty(n))
-      return !1;
-  return !0;
-}
-function fe(e, n, t) {
-  if (t != null && e.indexOf(t) < 0)
-    throw new A(`${t} is not a valid ${n}.  Valid values are ${e} or null/undefined.`);
-}
-function Rr(e, n, t = 0, s = 1 / 0) {
-  return Ge(t >= 0), Ge(s >= t), Array.isArray(e) && e.length >= t && e.length <= s && e.every((r) => typeof r === n);
-}
-function nr(e, n) {
-  Array.isArray(e) ? (p(e.length > 0, () => `${n} is unexpectedly an empty array.`), e.forEach((t, s) => nr(t, `element ${s + 1} of ${n}`))) : p(Number.isInteger(e) && e > 0, () => `Expected ${n} to be a positive integer, but got ${Xe(e)}.`);
-}
-function Xe(e) {
-  return e === null ? "null" : Array.isArray(e) ? "[" + e.map((n) => Xe(n)).join(",") + "]" : typeof e == "string" ? `"${e}"` : `${e}`;
-}
-function qr(e, n, t) {
-  let s = t != null ? t() : Pe(), r;
-  return (...a) => {
-    const i = t != null ? t() : Pe();
-    return i - s < n || (s = i, r = e(...a)), r;
-  };
-}
-function jr(e) {
-  return e === "relu" ? "relu" : e === "linear" ? "linear" : e === "elu" ? "elu" : null;
-}
-/**
- * @license
- * Copyright 2018 Google LLC
- *
- * Use of this source code is governed by an MIT-style
- * license that can be found in the LICENSE file or at
- * https://opensource.org/licenses/MIT.
- * =============================================================================
- */
-const Q = /* @__PURE__ */ new Map();
-function tr(e) {
-  fe(Zs, "DataFormat", e);
-}
-function Fr(e) {
-  fe(Xs, "InterpolationFormat", e);
-}
-function Gr(e) {
-  fe(Hs, "PaddingMode", e);
-}
-function Lr(e) {
-  fe(Qs, "PoolMode", e);
-}
-const ae = [], Le = "/";
-function Vr(e, n) {
-  ae.push(e);
-  try {
-    const t = n();
-    return ae.pop(), t;
-  } catch (t) {
-    throw ae.pop(), t;
-  }
-}
-function sr() {
-  return ae.length === 0 ? "" : ae.join(Le) + Le;
-}
-function Cr(e) {
-  if (!He(e))
-    throw new Error("Not a valid tensor name: '" + e + "'");
-  return sr() + e;
-}
-function vr(e) {
-  if (!He(e))
-    throw new Error("Not a valid tensor name: '" + e + "'");
-  Q.has(e) || Q.set(e, 0);
-  const n = Q.get(e);
-  if (Q.set(e, Q.get(e) + 1), n > 0) {
-    const t = `${e}_${n}`;
-    return Q.set(t, 1), t;
-  } else
-    return e;
-}
-const rr = new RegExp(/^[A-Za-z0-9][-A-Za-z0-9\._\/]*$/);
-function He(e) {
-  return !!e.match(rr);
-}
-/**
- * @license
- * Copyright 2018 Google LLC
- *
- * Use of this source code is governed by an MIT-style
- * license that can be found in the LICENSE file or at
- * https://opensource.org/licenses/MIT.
- * =============================================================================
- */
-function zr(e) {
-  return e === parseInt(e.toString(), 10);
-}
-function Qe(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 Wr(e) {
-  if (e.length === 0)
-    return Number.NaN;
-  let n = Number.POSITIVE_INFINITY;
-  for (let t = 0; t < e.length; t++) {
-    const s = e[t];
-    s < n && (n = s);
-  }
-  return n;
-}
-function Jr(e) {
-  if (e.length === 0)
-    return Number.NaN;
-  let n = Number.NEGATIVE_INFINITY;
-  for (let t = 0; t < e.length; t++) {
-    const s = e[t];
-    s > n && (n = s);
-  }
-  return n;
-}
-function Yr(e, n) {
-  if (n < e)
-    throw new A(`end (${n}) < begin (${e}) is forbidden.`);
-  const t = [];
-  for (let s = e; s < n; ++s)
-    t.push(s);
-  return t;
-}
-/**
- * @license
- * Copyright 2018 Google LLC
- *
- * Use of this source code is governed by an MIT-style
- * license that can be found in the LICENSE file or at
- * https://opensource.org/licenses/MIT.
- * =============================================================================
- */
-let $e;
-function Ur() {
-  return $e == null && ($e = vn().epsilon()), $e;
-}
-function Ae() {
-  return "channelsLast";
-}
-/**
- * @license
- * Copyright 2018 Google LLC
- *
- * Use of this source code is governed by an MIT-style
- * license that can be found in the LICENSE file or at
- * https://opensource.org/licenses/MIT.
- * =============================================================================
- */
-function Zr(e, n) {
-  return C(e, n);
-}
-function or(e, n = -1) {
-  const t = e.shape.slice();
-  return n < 0 && (n = t.length + n + 1), t.splice(n, 0, 1), $(e, t);
-}
-function Xr(e, n) {
-  return K(() => {
-    if (e.shape.length !== 2)
-      throw new A(`repeat() expects a rank-2 tensor, but received a rank-${e.shape.length} tensor.`);
-    const t = or(e, 1);
-    return ar(t, [1, n, 1]);
-  });
-}
-function Hr(e) {
-  const n = [Qe(e.shape)];
-  return $(e, n);
-}
-function Qr(e) {
-  if (e.rank <= 1)
-    throw new A(`batchFlatten requires a minimum rank of 2. Got rank: ${e.rank}.`);
-  const n = [e.shape[0], Qe(e.shape, 1)];
-  return $(e, n);
-}
-function be(e, n, t) {
-  return K(() => {
-    switch (e.rank) {
-      case 1:
-        return Ee(e, n, t);
-      case 2:
-        return Je(e, [n, 0], [t, e.shape[1]]);
-      case 3:
-        return Se(e, [n, 0, 0], [t, e.shape[1], e.shape[2]]);
-      case 4:
-        return pe(e, [n, 0, 0, 0], [t, e.shape[1], e.shape[2], e.shape[3]]);
-      case 5:
-        return _(e, [n, 0, 0, 0, 0], [
-          t,
-          e.shape[1],
-          e.shape[2],
-          e.shape[3],
-          e.shape[4]
-        ]);
-      case 6:
-        return _(e, [n, 0, 0, 0, 0, 0], [
-          t,
-          e.shape[1],
-          e.shape[2],
-          e.shape[3],
-          e.shape[4],
-          e.shape[5]
-        ]);
-      default:
-        throw new A(`sliceAlongFirstAxis() received an unsupported tensor rank: ${e.rank}`);
-    }
-  });
-}
-function ke(e, n, t) {
-  return K(() => {
-    switch (e.rank) {
-      case 1:
-        return Ee(e, n, t);
-      case 2:
-        return Je(e, [0, n], [e.shape[0], t]);
-      case 3:
-        return Se(e, [0, 0, n], [e.shape[0], e.shape[1], t]);
-      case 4:
-        return pe(e, [0, 0, 0, n], [e.shape[0], e.shape[1], e.shape[2], t]);
-      default:
-        throw new A(`sliceAlongLastAxis() received an unsupported tensor rank: ${e.rank}`);
-    }
-  });
-}
-function eo(e, n, t, s) {
-  return K(() => {
-    switch (e.rank) {
-      case 1:
-        return Ee(e, n, t);
-      case 2:
-        switch (s) {
-          case 1:
-            return be(e, n, t);
-          case 2:
-            return ke(e, n, t);
-          default:
-            throw new A(`The axis is not within the rank of the tensor ${s}`);
-        }
-      case 3:
-        switch (s) {
-          case 1:
-            return be(e, n, t);
-          case 2:
-            return Se(e, [0, n, 0], [e.shape[0], t, e.shape[2]]);
-          case 3:
-            return ke(e, n, t);
-          default:
-            throw new A(`The axis is not within the rank of the tensor ${s}`);
-        }
-      case 4:
-        switch (s) {
-          case 1:
-            return be(e, n, t);
-          case 2:
-            return pe(e, [0, n, 0, 0], [e.shape[0], t, e.shape[2], e.shape[3]]);
-          case 3:
-            return pe(e, [0, 0, n, 0], [e.shape[0], e.shape[1], t, e.shape[3]]);
-          case 4:
-            return ke(e, n, t);
-          default:
-            throw new A(`The axis is not within the rank of the tensor ${s}`);
-        }
-      default:
-        throw new A(`sliceAlongLastAxis() received an unsupported tensor rank: ${e.rank}`);
-    }
-  });
-}
-function no(e, n = -1) {
-  let t;
-  return n < 0 && (t = e[0].rank, t !== 0 ? n = t : n = 0), n === e[0].rank && (n = -1), V(e, n);
-}
-function to(e, n) {
-  switch (e.rank) {
-    case 1:
-      return at([e, n]);
-    case 2:
-      return ct([e, n], 0);
-    case 3:
-      return lt([e, n], 0);
-    case 4:
-      return ft([e, n], 0);
-    default:
-      throw new A(`concatAlongFirstAxis() received an unsupported tensor rank: ${e.rank}`);
-  }
-}
-function ar(e, n) {
-  if (Array.isArray(n) || (n = [n]), e.rank !== n.length)
-    throw new A(`The length of input n (${n.length}) does not match the number of dimensions in input x (${e.rank})`);
-  return oe(e, n);
-}
-function so(e, n = 0, t = 1, s, r) {
-  return Un(e, n, t, s, r);
-}
-function ro(e, n, t, s) {
-  if (e.rank < 2 || n.rank < 2)
-    throw new ie(`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 ie(`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 qe({
-      a: e,
-      b: n,
-      transposeA: !1,
-      transposeB: !1,
-      bias: s ? ye(e.rank, s, Ae()) : null,
-      activation: t
-    });
-  {
-    const r = e.shape.slice(), o = r.pop();
-    e = $(e, [-1, o]);
-    const a = n.shape.slice(), i = a.pop(), u = a.pop(), c = [...a, i], m = Array.from({ length: n.rank }, (x, w) => w === 0 ? n.rank - 2 : w <= n.rank - 2 ? w - 1 : w);
-    n = $(xe(n, m), [u, -1]);
-    const h = [...r, ...c];
-    return $(qe({
-      a: e,
-      b: n,
-      transposeA: !1,
-      transposeB: !1,
-      bias: s ? ye(e.rank, s, Ae()) : null,
-      activation: t
-    }), h);
-  }
-}
-function oo(e, n, t) {
-  return K(() => (Array.isArray(n) ? n = B(n, "int32") : n = C(n, "int32"), Xn(e, n, t)));
-}
-function ao(e) {
-  return I(e, e);
-}
-function ye(e, n, t) {
-  const s = n.shape;
-  if (n.rank !== 1 && n.rank !== e)
-    throw new A(`Unexpected bias dimensions: ${n.rank}; expected it to be 1 or ${e}`);
-  if (e === 5) {
-    if (t === "channelsFirst")
-      return s.length === 1 ? $(n, [1, s[0], 1, 1, 1]) : $(n, [1, s[3], s[0], s[1], s[2]]);
-    if (t === "channelsLast")
-      return s.length === 1 ? $(n, [1, 1, 1, 1, s[0]]) : $(n, [1].concat(s));
-  } else if (e === 4) {
-    if (t === "channelsFirst")
-      return s.length === 1 ? $(n, [1, s[0], 1, 1]) : $(n, [1, s[2], s[0], s[1]]);
-    if (t === "channelsLast")
-      return s.length === 1 ? $(n, [1, 1, 1, s[0]]) : $(n, [1].concat(s));
-  } else if (e === 3) {
-    if (t === "channelsFirst")
-      return s.length === 1 ? $(n, [1, s[0], 1]) : $(n, [1, s[1], s[0]]);
-    if (t === "channelsLast")
-      return s.length === 1 ? $(n, [1, 1, s[0]]) : $(n, [1].concat(s));
-  } else if (e < 3)
-    return n;
-  throw new A(`Unsupported input rank by biasAdd: ${n.rank}`);
-}
-function io(e, n, t) {
-  return K(() => (t == null && (t = Ae()), tr(t), U(e, ye(e.rank, n, t))));
-}
-function co(e, n = 1) {
-  if (n !== 1)
-    throw new ie(`Support for alpha values other than 1 (${n}) is not implemented yet.`);
-  return ze(e);
-}
-function uo(e) {
-  return K(() => L(e, U(zn(e), 1)));
-}
-function lo(e, n, t, s) {
-  return K(() => Zn(e, n, t, s));
-}
-function po(e) {
-  return K(() => {
-    const n = U(0.5, I(0.2, e));
-    return rt(n, 0, 1);
-  });
-}
-function fo(e, n, t = !1) {
-  return t ? e() : n();
-}
-export {
-  or as $,
-  Ue as A,
-  oe as B,
-  _e as C,
-  Ke as D,
-  _ as E,
-  Ye as F,
-  Qn as G,
-  J as H,
-  rt as I,
-  Ur as J,
-  jt as K,
-  qr as L,
-  Hr as M,
-  ie as N,
-  ao as O,
-  Ge as P,
-  Zr as Q,
-  Ze as R,
-  Yt as S,
-  Dr as T,
-  Pr as U,
-  A as V,
-  Br as W,
-  Ir as X,
-  Kr as Y,
-  B as Z,
-  be as _,
-  ns as a,
-  oo as a0,
-  Yr as a1,
-  Er as a2,
-  co as a3,
-  Re as a4,
-  po as a5,
-  uo as a6,
-  Et as a7,
-  Pt as a8,
-  ze as a9,
-  Jr as aa,
-  zr as ab,
-  Rr as ac,
-  io as ad,
-  eo as ae,
-  Fr as af,
-  Ar as ag,
-  nr as ah,
-  jr as ai,
-  Gr as aj,
-  Ae as ak,
-  ar as al,
-  Wr as am,
-  to as an,
-  fo as ao,
-  lo as ap,
-  no as aq,
-  Qr as ar,
-  Xr as as,
-  Lr as at,
-  _r as au,
-  es as b,
-  fe as c,
-  ro as d,
-  kt as e,
-  tr as f,
-  Qt as g,
-  Qe as h,
-  Or as i,
-  Mr as j,
-  Cr as k,
-  yr as l,
-  vr as m,
-  Sr as n,
-  Tr as o,
-  Vr as p,
-  Zt as q,
-  so as r,
-  ts as s,
-  Nr as t,
-  Ie as u,
-  Mt as v,
-  ee as w,
-  At as x,
-  We as y,
-  xe as z
-};