@genai-fi/nanogpt 0.4.4 → 0.5.0

package/dist/ops-ObfXLHYQ.js

@@ -0,0 +1,1269 @@
+import { o as h, i as l, E as f, aA as hn, k as p, aB as fn, N as w, aC as dn, aD as bn, aE as gn, T as $n, ah as xn, q as j, aF as kn, aG as yn, aH as In, aI as _n, aJ as En, aK as Nn, aL as Mn, y as D, aM as An, aN as Tn, aO as Sn, aP as wn, H as zn, I as Bn, J as qn, aQ as Gn, t as Kn, aR as J, aS as Rn, aT as Dn, aU as Pn, aV as Vn, aW as vn, aX as jn, f as Fn, aY as Wn, aZ as On, b as k, a9 as Z, ai as K, g as Yn, s as S, a_ as Cn, x as L, a as Jn } from "./index-iNhkcAEQ.js";
+import { r as _ } from "./reshape-DxTPgnwL.js";
+import { s as un } from "./split-BCbrzthj.js";
+import { s as q } from "./sum-B_92TaHD.js";
+import { b as X } from "./broadcast_to-CMlkG8NS.js";
+import { r as O } from "./range-BsFU-SNG.js";
+import { t as Ln } from "./tensor-CfiPXsW4.js";
+import { s as Y } from "./stack--cqr9Dgc.js";
+import { c as Xn, z as Hn } from "./zeros-NMYTayy7.js";
+import { n as ln } from "./norm-D3676xIo.js";
+import { c as H } from "./concat-Cxbo2sOz.js";
+import { m as T } from "./mat_mul-D0SifYfJ.js";
+import { t as Q } from "./tensor2d-tSxWdFMH.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 Qn(r, t, n) {
+  const e = l(r, "x", "slice", "string_or_numeric");
+  if (e.rank === 0)
+    throw new Error("Slicing scalar is not possible");
+  const s = { x: e }, a = { begin: t, size: n };
+  return f.runKernel(hn, s, a);
+}
+const N = /* @__PURE__ */ h({ slice_: Qn });
+/**
+ * @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 Zn(r, t, n) {
+  const e = l(r, "x", "bincount"), s = l(t, "weights", "bincount");
+  p(e.dtype === "int32", () => `Error in bincount: input dtype must be int32, but got ${e.dtype}`), p(n >= 0, () => `size must be non-negative, but got ${n}.`), p(s.size === e.size || s.size === 0, () => `Error in bincount: weights must have the same size as input or0-length, but got input shape: ${e.shape}, weights shape: ${s.shape}.`);
+  const a = { x: e, weights: s }, o = { size: n };
+  return f.runKernel(fn, a, o);
+}
+const Un = /* @__PURE__ */ h({ bincount_: Zn });
+/**
+ * @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(r, t, n) {
+  const e = l(t, "a", "where"), s = l(n, "b", "where"), a = l(r, "condition", "where", "bool"), o = w(w(a.shape, e.shape), s.shape), i = X(a, o), u = X(e, o), c = X(s, o), d = {
+    condition: i,
+    t: u,
+    e: c
+  };
+  return f.runKernel(dn, d);
+}
+const R = /* @__PURE__ */ h({ where_: ne });
+/**
+ * @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 ee(r, ...t) {
+  const n = t.map((s, a) => l(s, `tensors${a}`, "einsum")), e = { equation: r };
+  return f.runKernel(bn, n, e);
+}
+const v = /* @__PURE__ */ h({ einsum_: ee });
+/**
+ * @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 se(r, t = 0) {
+  const n = l(r, "x", "expandDims", "string_or_numeric");
+  p(t <= n.rank, () => "Axis must be <= rank of the tensor");
+  const e = { input: n }, s = { dim: t };
+  return f.runKernel(gn, e, s);
+}
+const G = /* @__PURE__ */ h({ expandDims_: se });
+/**
+ * @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 te(r, t) {
+  const n = l(r, "x", "tile", "string_or_numeric");
+  p(n.rank === t.length, () => `Error in transpose: rank of input ${n.rank} must match length of reps ${t}.`);
+  const e = { x: n }, s = { reps: t };
+  return f.runKernel($n, e, s);
+}
+const W = /* @__PURE__ */ h({ tile_: te });
+/**
+ * @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 re(r, t, n, e = "float32") {
+  t == null && (t = r);
+  const s = xn([r, t], e), a = r <= t ? r : t;
+  for (let i = 0; i < a; ++i)
+    s.set(1, i, i);
+  const o = _(s.toTensor(), [r, t]);
+  if (n == null)
+    return o;
+  if (n.length === 1)
+    return W(G(o, 0), [n[0], 1, 1]);
+  if (n.length === 2)
+    return W(G(G(o, 0), 0), [n[0], n[1], 1, 1]);
+  if (n.length === 3)
+    return W(G(G(G(o, 0), 0), 0), [
+      n[0],
+      n[1],
+      n[2],
+      1,
+      1
+    ]);
+  throw new Error(`eye() currently supports only 1D and 2D batchShapes, but received ${n.length}D.`);
+}
+const ae = /* @__PURE__ */ h({ eye_: re });
+/**
+ * @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 oe(r, t) {
+  let n = l(r, "a", "greater", "string_or_numeric"), e = l(t, "b", "greater", "string_or_numeric");
+  [n, e] = j(n, e), w(n.shape, e.shape);
+  const s = { a: n, b: e };
+  return f.runKernel(kn, s);
+}
+const U = /* @__PURE__ */ h({ greater_: oe });
+/**
+ * @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 ie(r, t) {
+  let n = l(r, "a", "greaterEqual", "string_or_numeric"), e = l(t, "b", "greaterEqual", "string_or_numeric");
+  [n, e] = j(n, e), w(n.shape, e.shape);
+  const s = { a: n, b: e };
+  return f.runKernel(yn, s);
+}
+const ce = /* @__PURE__ */ h({ greaterEqual_: ie });
+/**
+ * @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 ue(r) {
+  const n = { input: l(r, "input", "imag") };
+  return f.runKernel(In, n);
+}
+const le = /* @__PURE__ */ h({ imag_: ue });
+/**
+ * @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 pe(r, t) {
+  let n = l(r, "a", "less", "string_or_numeric"), e = l(t, "b", "less", "string_or_numeric");
+  [n, e] = j(n, e), w(n.shape, e.shape);
+  const s = { a: n, b: e };
+  return f.runKernel(_n, s);
+}
+const tn = /* @__PURE__ */ h({ less_: pe });
+/**
+ * @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 me(r, t) {
+  let n = l(r, "a", "lessEqual", "string_or_numeric"), e = l(t, "b", "lessEqual", "string_or_numeric");
+  [n, e] = j(n, e), w(n.shape, e.shape);
+  const s = { a: n, b: e };
+  return f.runKernel(En, s);
+}
+const pn = /* @__PURE__ */ h({ lessEqual_: me });
+/**
+ * @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 he(r) {
+  const n = { x: l(r, "x", "neg") };
+  return f.runKernel(Nn, n);
+}
+const nn = /* @__PURE__ */ h({ neg_: he });
+/**
+ * @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 fe(r, t) {
+  const n = l(r, "a", "logicalAnd", "bool"), e = l(t, "b", "logicalAnd", "bool");
+  w(n.shape, e.shape);
+  const s = { a: n, b: e };
+  return f.runKernel(Mn, s);
+}
+const de = /* @__PURE__ */ h({ logicalAnd_: fe });
+/**
+ * @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 be(r, t) {
+  let n = l(r, "a", "minimum"), e = l(t, "b", "minimum");
+  [n, e] = j(n, e), n.dtype === "bool" && (n = D(n, "int32"), e = D(e, "int32")), w(n.shape, e.shape);
+  const s = { a: n, b: e };
+  return f.runKernel(An, s);
+}
+const rn = /* @__PURE__ */ h({ minimum_: be });
+/**
+ * @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 ge(r) {
+  const n = { input: l(r, "input", "real") };
+  return f.runKernel(Tn, n);
+}
+const $e = /* @__PURE__ */ h({ real_: ge });
+/**
+ * @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 xe(r) {
+  const n = { x: l(r, "x", "round") };
+  return f.runKernel(Sn, n);
+}
+const ke = /* @__PURE__ */ h({ round_: xe });
+/**
+ * @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 ye(r, t) {
+  const n = l(r, "x", "squeeze", "string_or_numeric");
+  return _(n, wn(n.shape, t).newShape);
+}
+const Ie = /* @__PURE__ */ h({ squeeze_: ye });
+/**
+ * @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 M(r, t) {
+  zn(r);
+  const n = Bn(r, t);
+  if (n.length !== 1)
+    throw new Error("tensor1d() requires values to be a flat/TypedArray");
+  return qn(r, null, n, 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 _e(r, t = 0) {
+  const n = l(r, "x", "unstack", "string_or_numeric");
+  p(t >= -n.shape.length && t < n.shape.length, () => `Axis = ${t} is not in [-${n.shape.length}, ${n.shape.length})`);
+  const e = { value: n }, s = { axis: t };
+  return f.runKernel(Gn, e, s);
+}
+const mn = /* @__PURE__ */ h({ unstack_: _e });
+/**
+ * @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 Ee(r, t, n) {
+  const e = l(r, "x", "transpose");
+  if (t == null && (t = e.shape.map((o, i) => i).reverse()), p(e.rank === t.length, () => `Error in transpose: rank of input ${e.rank} must match length of perm ${t}.`), t.forEach((o) => {
+    p(o >= 0 && o < e.rank, () => `All entries in 'perm' must be between 0 and ${e.rank - 1} but got ${t}`);
+  }), e.rank <= 1)
+    return e.clone();
+  const s = { x: e }, a = { perm: t };
+  return e.dtype === "complex64" ? Kn(() => {
+    let o = $e(e), i = le(e);
+    return o = f.runKernel(J, { x: o }, a), i = f.runKernel(J, { x: i }, a), n && (i = nn(i)), Xn(o, i);
+  }) : f.runKernel(J, s, a);
+}
+const an = /* @__PURE__ */ h({ transpose_: Ee });
+/**
+ * @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(r, t, n, e, s = "bilinear", a = 0) {
+  const o = l(r, "image", "cropAndResize"), i = l(t, "boxes", "cropAndResize", "float32"), u = l(n, "boxInd", "cropAndResize", "int32"), c = i.shape[0];
+  p(o.rank === 4, () => `Error in cropAndResize: image must be rank 4,but got rank ${o.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(e.length === 2, () => `Error in cropAndResize: cropSize must be of length 2, but got length ${e.length}.`), p(e[0] >= 1 && e[1] >= 1, () => `cropSize must be atleast [1,1], but was ${e}`), p(s === "bilinear" || s === "nearest", () => `method must be bilinear or nearest, but was ${s}`);
+  const d = { image: o, boxes: i, boxInd: u }, m = { method: s, extrapolationValue: a, cropSize: e };
+  return f.runKernel(Rn, d, m);
+}
+const Me = /* @__PURE__ */ h({ cropAndResize_: Ne });
+/**
+ * @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 Ae(r) {
+  const t = l(r, "image", "flipLeftRight", "float32");
+  p(t.rank === 4, () => `Error in flipLeftRight: image must be rank 4,but got rank ${t.rank}.`);
+  const n = { image: t };
+  return f.runKernel(Dn, n, {});
+}
+const Te = /* @__PURE__ */ h({ flipLeftRight_: Ae });
+/**
+ * @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 Se(r) {
+  const t = l(r, "image", "grayscaleToRGB"), n = t.rank - 1, e = t.shape[n];
+  p(t.rank >= 2, () => `Error in grayscaleToRGB: images must be at least rank 2, but got rank ${t.rank}.`), p(e === 1, () => `Error in grayscaleToRGB: last dimension of a grayscale image should be size 1, but got size ${e}.`);
+  const s = new Array(t.rank);
+  return s.fill(1, 0, n), s[n] = 3, W(t, s);
+}
+const we = /* @__PURE__ */ h({ grayscaleToRGB_: Se });
+/**
+ * @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 ze(r) {
+  const t = l(r, "image", "RGBToGrayscale"), n = t.rank - 1, e = t.shape[n];
+  p(t.rank >= 2, () => `Error in RGBToGrayscale: images must be at least rank 2, but got rank ${t.rank}.`), p(e === 3, () => `Error in RGBToGrayscale: last dimension of an RGB image should be size 3, but got size ${e}.`);
+  const s = t.dtype, a = D(t, "float32"), o = M([0.2989, 0.587, 0.114]);
+  let i;
+  switch (t.rank) {
+    case 2:
+      i = v("ij,j->i", a, o);
+      break;
+    case 3:
+      i = v("ijk,k->ij", a, o);
+      break;
+    case 4:
+      i = v("ijkl,l->ijk", a, o);
+      break;
+    case 5:
+      i = v("ijklm,m->ijkl", a, o);
+      break;
+    case 6:
+      i = v("ijklmn,n->ijklm", a, o);
+      break;
+    default:
+      throw new Error("Not a valid tensor rank.");
+  }
+  return i = G(i, -1), D(i, s);
+}
+const Be = /* @__PURE__ */ h({ rgbToGrayscale_: ze });
+/**
+ * @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 qe(r, t, n = 0, e = 0.5) {
+  const s = l(r, "image", "rotateWithOffset", "float32");
+  p(s.rank === 4, () => `Error in rotateWithOffset: image must be rank 4,but got rank ${s.rank}.`);
+  const a = { image: s }, o = { radians: t, fillValue: n, center: e };
+  return f.runKernel(Pn, a, o);
+}
+const Ge = /* @__PURE__ */ h({ rotateWithOffset_: qe });
+/**
+ * @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 P(r, t, n, e, s, a) {
+  e == null && (e = 0.5), s == null && (s = Number.NEGATIVE_INFINITY), a == null && (a = 0);
+  const o = r.shape[0];
+  return n = Math.min(n, o), p(0 <= e && e <= 1, () => `iouThreshold must be in [0, 1], but was '${e}'`), p(r.rank === 2, () => `boxes must be a 2D tensor, but was of rank '${r.rank}'`), p(r.shape[1] === 4, () => `boxes must have 4 columns, but 2nd dimension was ${r.shape[1]}`), p(t.rank === 1, () => "scores must be a 1D tensor"), p(t.shape[0] === o, () => `scores has incompatible shape with boxes. Expected ${o}, but was ${t.shape[0]}`), p(0 <= a && a <= 1, () => `softNmsSigma must be in [0, 1], but was '${a}'`), { maxOutputSize: n, iouThreshold: e, scoreThreshold: s, softNmsSigma: a };
+}
+/**
+ * @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 Ke(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY) {
+  const a = l(r, "boxes", "nonMaxSuppression", "float32"), o = l(t, "scores", "nonMaxSuppression", "float32"), i = P(a, o, n, e, s);
+  n = i.maxOutputSize, e = i.iouThreshold, s = i.scoreThreshold;
+  const u = { maxOutputSize: n, iouThreshold: e, scoreThreshold: s };
+  return f.runKernel(Vn, { boxes: a, scores: o }, u);
+}
+const Re = /* @__PURE__ */ h({ nonMaxSuppression_: Ke });
+/**
+ * @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 De(r, t, n) {
+  const e = Pe(r, t, n), s = e < 0 ? -(e + 1) : e;
+  r.splice(s, 0, t);
+}
+function Pe(r, t, n) {
+  return ve(r, t, n || Ve);
+}
+function Ve(r, t) {
+  return r > t ? 1 : r < t ? -1 : 0;
+}
+function ve(r, t, n) {
+  let e = 0, s = r.length, a = 0, o = !1;
+  for (; e < s; ) {
+    a = e + (s - e >>> 1);
+    const i = n(t, r[a]);
+    i > 0 ? e = a + 1 : (s = a, o = !i);
+  }
+  return o ? e : -e - 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 je(r, t, n, e, s) {
+  return en(
+    r,
+    t,
+    n,
+    e,
+    s,
+    0
+    /* softNmsSigma */
+  );
+}
+function Fe(r, t, n, e, s, a) {
+  return en(
+    r,
+    t,
+    n,
+    e,
+    s,
+    0,
+    !1,
+    a,
+    !0
+    /* returnValidOutputs */
+  );
+}
+function We(r, t, n, e, s, a) {
+  return en(
+    r,
+    t,
+    n,
+    e,
+    s,
+    a,
+    !0
+    /* returnScoresTensor */
+  );
+}
+function en(r, t, n, e, s, a, o = !1, i = !1, u = !1) {
+  const c = [];
+  for (let b = 0; b < t.length; b++)
+    t[b] > s && c.push({ score: t[b], boxIndex: b, suppressBeginIndex: 0 });
+  c.sort(on);
+  const d = a > 0 ? -0.5 / a : 0, m = [], $ = [];
+  for (; m.length < n && c.length > 0; ) {
+    const b = c.pop(), { score: E, boxIndex: I, suppressBeginIndex: A } = b;
+    if (E < s)
+      break;
+    let z = !1;
+    for (let B = m.length - 1; B >= A; --B) {
+      const V = Oe(r, I, m[B]);
+      if (V >= e) {
+        z = !0;
+        break;
+      }
+      if (b.score = b.score * Ye(e, d, V), b.score <= s)
+        break;
+    }
+    b.suppressBeginIndex = m.length, z || (b.score === E ? (m.push(I), $.push(b.score)) : b.score > s && De(c, b, on));
+  }
+  const g = m.length, x = n - g;
+  i && x > 0 && (m.push(...new Array(x).fill(0)), $.push(...new Array(x).fill(0)));
+  const y = { selectedIndices: m };
+  return o && (y.selectedScores = $), u && (y.validOutputs = g), y;
+}
+function Oe(r, t, n) {
+  const e = r.subarray(t * 4, t * 4 + 4), s = r.subarray(n * 4, n * 4 + 4), a = Math.min(e[0], e[2]), o = Math.min(e[1], e[3]), i = Math.max(e[0], e[2]), u = Math.max(e[1], e[3]), c = Math.min(s[0], s[2]), d = Math.min(s[1], s[3]), m = Math.max(s[0], s[2]), $ = Math.max(s[1], s[3]), g = (i - a) * (u - o), x = (m - c) * ($ - d);
+  if (g <= 0 || x <= 0)
+    return 0;
+  const y = Math.max(a, c), b = Math.max(o, d), E = Math.min(i, m), I = Math.min(u, $), A = Math.max(E - y, 0) * Math.max(I - b, 0);
+  return A / (g + x - A);
+}
+function Ye(r, t, n) {
+  const e = Math.exp(t * n * n);
+  return n <= r ? e : 0;
+}
+function on(r, t) {
+  return r.score - t.score || r.score === t.score && t.boxIndex - r.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 Ce(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY) {
+  const a = l(r, "boxes", "nonMaxSuppressionAsync"), o = l(t, "scores", "nonMaxSuppressionAsync"), i = P(a, o, n, e, s);
+  n = i.maxOutputSize, e = i.iouThreshold, s = i.scoreThreshold;
+  const u = await Promise.all([a.data(), o.data()]), c = u[0], d = u[1], { selectedIndices: m } = je(c, d, n, e, s);
+  return a !== r && a.dispose(), o !== t && o.dispose(), M(m, "int32");
+}
+const Je = Ce;
+/**
+ * @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 Le(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = 0) {
+  const o = l(r, "boxes", "nonMaxSuppression"), i = l(t, "scores", "nonMaxSuppression"), u = P(o, i, n, e, s, a);
+  n = u.maxOutputSize, e = u.iouThreshold, s = u.scoreThreshold, a = u.softNmsSigma;
+  const c = { boxes: o, scores: i }, d = { maxOutputSize: n, iouThreshold: e, scoreThreshold: s, softNmsSigma: a }, m = f.runKernel(vn, c, d);
+  return { selectedIndices: m[0], selectedScores: m[1] };
+}
+const Xe = /* @__PURE__ */ h({ nonMaxSuppressionWithScore_: Le });
+/**
+ * @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 He(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = 0) {
+  const o = l(r, "boxes", "nonMaxSuppressionAsync"), i = l(t, "scores", "nonMaxSuppressionAsync"), u = P(o, i, n, e, s, a);
+  n = u.maxOutputSize, e = u.iouThreshold, s = u.scoreThreshold, a = u.softNmsSigma;
+  const c = await Promise.all([o.data(), i.data()]), d = c[0], m = c[1], { selectedIndices: $, selectedScores: g } = We(d, m, n, e, s, a);
+  return o !== r && o.dispose(), i !== t && i.dispose(), {
+    selectedIndices: M($, "int32"),
+    selectedScores: M(g)
+  };
+}
+const Qe = He;
+/**
+ * @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 Ze(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = !1) {
+  const o = l(r, "boxes", "nonMaxSuppression"), i = l(t, "scores", "nonMaxSuppression"), u = P(
+    o,
+    i,
+    n,
+    e,
+    s,
+    null
+    /* softNmsSigma */
+  ), c = u.maxOutputSize, d = u.iouThreshold, m = u.scoreThreshold, $ = { boxes: o, scores: i }, g = {
+    maxOutputSize: c,
+    iouThreshold: d,
+    scoreThreshold: m,
+    padToMaxOutputSize: a
+  }, x = f.runKernel(jn, $, g);
+  return { selectedIndices: x[0], validOutputs: x[1] };
+}
+const Ue = /* @__PURE__ */ h({ nonMaxSuppressionPadded_: Ze });
+/**
+ * @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(r, t, n, e = 0.5, s = Number.NEGATIVE_INFINITY, a = !1) {
+  const o = l(r, "boxes", "nonMaxSuppressionAsync"), i = l(t, "scores", "nonMaxSuppressionAsync"), u = P(
+    o,
+    i,
+    n,
+    e,
+    s,
+    null
+    /* softNmsSigma */
+  ), c = u.maxOutputSize, d = u.iouThreshold, m = u.scoreThreshold, [$, g] = await Promise.all([o.data(), i.data()]), { selectedIndices: x, validOutputs: y } = Fe($, g, c, d, m, a);
+  return o !== r && o.dispose(), i !== t && i.dispose(), {
+    selectedIndices: M(x, "int32"),
+    validOutputs: Fn(y, "int32")
+  };
+}
+const es = 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 ss(r, t, n = !1, e = !1) {
+  const s = l(r, "images", "resizeBilinear");
+  p(s.rank === 3 || s.rank === 4, () => `Error in resizeBilinear: x must be rank 3 or 4, but got rank ${s.rank}.`), p(t.length === 2, () => `Error in resizeBilinear: new shape must 2D, but got shape ${t}.`), p(e === !1 || n === !1, () => "Error in resizeBilinear: If halfPixelCenters is true, alignCorners must be false.");
+  let a = s, o = !1;
+  s.rank === 3 && (o = !0, a = _(s, [1, s.shape[0], s.shape[1], s.shape[2]]));
+  const i = { images: a }, u = { alignCorners: n, halfPixelCenters: e, size: t }, c = f.runKernel(Wn, i, u);
+  return o ? _(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
+}
+const ts = /* @__PURE__ */ h({ resizeBilinear_: 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(r, t, n = !1, e = !1) {
+  const s = l(r, "images", "resizeNearestNeighbor");
+  p(s.rank === 3 || s.rank === 4, () => `Error in resizeNearestNeighbor: x must be rank 3 or 4, but got rank ${s.rank}.`), p(t.length === 2, () => `Error in resizeNearestNeighbor: new shape must 2D, but got shape ${t}.`), p(s.dtype === "float32" || s.dtype === "int32", () => "`images` must have `int32` or `float32` as dtype"), p(e === !1 || n === !1, () => "Error in resizeNearestNeighbor: If halfPixelCenters is true, alignCorners must be false.");
+  let a = s, o = !1;
+  s.rank === 3 && (o = !0, a = _(s, [1, s.shape[0], s.shape[1], s.shape[2]]));
+  const i = { images: a }, u = { alignCorners: n, halfPixelCenters: e, size: t }, c = f.runKernel(On, i, u);
+  return o ? _(c, [c.shape[1], c.shape[2], c.shape[3]]) : c;
+}
+const as = /* @__PURE__ */ h({ resizeNearestNeighbor_: rs });
+/**
+ * @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 os(r, t = "binary", n = !1, e = 0.5) {
+  const s = l(r, "image", "threshold"), a = 0.2989, o = 0.587, i = 0.114, u = s.shape[0] * s.shape[1];
+  let c = k(M([e]), 255), d, m, $, g;
+  if (p(s.rank === 3, () => `Error in threshold: image must be rank 3,but got rank ${s.rank}.`), p(s.shape[2] === 3 || s.shape[2] === 1, () => `Error in threshold: image color channel must be equal to 3 or 1but got ${s.shape[2]}.`), p(s.dtype === "int32" || s.dtype === "float32", () => `Error in dtype: image dtype must be int32 or float32,but got dtype ${s.dtype}.`), p(t === "otsu" || t === "binary", () => `Method must be binary or otsu, but was ${t}`), s.shape[2] === 3) {
+    [d, m, $] = un(s, [1, 1, 1], -1);
+    const b = k(d, a), E = k(m, o), I = k($, i);
+    g = Z(Z(b, E), I);
+  } else
+    g = r;
+  if (t === "otsu") {
+    const b = Un(D(ke(g), "int32"), Ln([]), 256);
+    c = is(b, u);
+  }
+  const x = n ? pn(g, c) : U(g, c);
+  return D(k(x, 255), "int32");
+}
+function is(r, t) {
+  let n = M([-1]), e = M([0]), s = M([0]), a, o, i, u, c, d;
+  for (let m = 0; m < r.size - 1; m++) {
+    a = N(r, 0, m + 1), o = N(r, m + 1), c = K(q(a), t), d = K(q(o), t);
+    const $ = q(k(a, O(0, a.size)));
+    i = K($, q(a));
+    const g = Yn(o.shape, a.size), x = Z(O(0, o.size), g), y = k(o, x);
+    u = K(q(y), q(o));
+    const b = S(i, u), E = S(i, u), I = k(c, d);
+    s = k(k(I, b), E);
+    const A = U(s, e);
+    e = R(A, s, e), n = R(A, M([m]), n);
+  }
+  return n;
+}
+const cs = /* @__PURE__ */ h({ threshold_: os });
+/**
+ * @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 us(r, t, n = "nearest", e = "constant", s = 0, a) {
+  const o = l(r, "image", "transform", "float32"), i = l(t, "transforms", "transform", "float32");
+  p(o.rank === 4, () => `Error in transform: image must be rank 4,but got rank ${o.rank}.`), p(i.rank === 2 && (i.shape[0] === o.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(a == null || a.length === 2, () => `Error in transform: outputShape must be [height, width] or null, but got ${a}.`);
+  const u = { image: o, transforms: i }, c = { interpolation: n, fillMode: e, fillValue: s, outputShape: a };
+  return f.runKernel(Cn, u, c);
+}
+const ls = /* @__PURE__ */ h({ transform_: us });
+/**
+ * @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 ps(r, t, n) {
+  const e = l(r, "a", "bandPart");
+  p(e.rank >= 2, () => `bandPart(): Rank must be at least 2, got ${e.rank}.`);
+  const s = e.shape, [a, o] = e.shape.slice(-2);
+  let i, u;
+  typeof t == "number" ? (p(t % 1 === 0, () => `bandPart(): numLower must be an integer, got ${t}.`), p(t <= a, () => `bandPart(): numLower (${t}) must not be greater than the number of rows (${a}).`), i = l(t < 0 ? a : t, "numLower", "bandPart")) : (p(t.dtype === "int32", () => "bandPart(): numLower's dtype must be an int32."), i = R(tn(t, 0), a, rn(t, a))), typeof n == "number" ? (p(n % 1 === 0, () => `bandPart(): numUpper must be an integer, got ${n}.`), p(n <= o, () => `bandPart(): numUpper (${n}) must not be greater than the number of columns (${o}).`), u = l(n < 0 ? o : n, "numUpper", "bandPart")) : (p(n.dtype === "int32", () => "bandPart(): numUpper's dtype must be an int32."), u = R(tn(n, 0), o, rn(n, o)));
+  const c = _(O(0, a, 1, "int32"), [-1, 1]), d = O(0, o, 1, "int32"), m = S(c, d), $ = de(pn(m, i), ce(m, nn(u))), g = Hn([a, o], e.dtype);
+  return _(Y(mn(_(e, [-1, a, o])).map((x) => R($, x, g))), s);
+}
+const ms = /* @__PURE__ */ h({ bandPart_: ps });
+/**
+ * @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 hs(r) {
+  let t;
+  if (Array.isArray(r)) {
+    t = !1, p(r != null && r.length > 0, () => "Gram-Schmidt process: input must not be null, undefined, or empty");
+    const s = r[0].shape[0];
+    for (let a = 1; a < r.length; ++a)
+      p(r[a].shape[0] === s, () => `Gram-Schmidt: Non-unique lengths found in the input vectors: (${r[a].shape[0]} vs. ${s})`);
+  } else
+    t = !0, r = un(r, r.shape[0], 0).map((s) => Ie(s, [0]));
+  p(r.length <= r[0].shape[0], () => `Gram-Schmidt: Number of vectors (${r.length}) exceeds number of dimensions (${r[0].shape[0]}).`);
+  const n = [], e = r;
+  for (let s = 0; s < r.length; ++s)
+    n.push(f.tidy(() => {
+      let a = e[s];
+      if (s > 0)
+        for (let o = 0; o < s; ++o) {
+          const i = k(q(k(n[o], a)), n[o]);
+          a = S(a, i);
+        }
+      return K(a, ln(a, "euclidean"));
+    }));
+  return t ? Y(n, 0) : n;
+}
+const fs = /* @__PURE__ */ h({ gramSchmidt_: hs });
+/**
+ * @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(r, t = !1) {
+  if (p(r.rank >= 2, () => `qr() requires input tensor to have a rank >= 2, but got rank ${r.rank}`), r.rank === 2)
+    return cn(r, t);
+  {
+    const n = r.shape.slice(0, r.shape.length - 2).reduce((u, c) => u * c), e = mn(_(r, [
+      n,
+      r.shape[r.shape.length - 2],
+      r.shape[r.shape.length - 1]
+    ]), 0), s = [], a = [];
+    e.forEach((u) => {
+      const [c, d] = cn(u, t);
+      s.push(c), a.push(d);
+    });
+    const o = _(Y(s, 0), r.shape), i = _(Y(a, 0), r.shape);
+    return [o, i];
+  }
+}
+function cn(r, t = !1) {
+  return f.tidy(() => {
+    p(r.shape.length === 2, () => `qr2d() requires a 2D Tensor, but got a ${r.shape.length}D Tensor.`);
+    const n = r.shape[0], e = r.shape[1];
+    let s = ae(n), a = L(r);
+    const o = Q([[1]], [1, 1]);
+    let i = L(o);
+    const u = n >= e ? e : n;
+    for (let c = 0; c < u; ++c) {
+      const d = a, m = i, $ = s;
+      [i, a, s] = f.tidy(() => {
+        const g = N(a, [c, c], [n - c, 1]), x = ln(g), y = N(a, [c, c], [1, 1]), b = R(U(y, 0), Q([[-1]]), Q([[1]])), E = S(y, k(b, x)), I = K(g, E);
+        I.shape[0] === 1 ? i = L(o) : i = H([
+          o,
+          N(I, [1, 0], [I.shape[0] - 1, I.shape[1]])
+        ], 0);
+        const A = nn(K(T(b, E), x)), z = N(a, [c, 0], [n - c, e]), B = k(A, i), V = an(i);
+        if (c === 0)
+          a = S(z, T(B, T(V, z)));
+        else {
+          const C = S(z, T(B, T(V, z)));
+          a = H([N(a, [0, 0], [c, e]), C], 0);
+        }
+        const sn = an(B), F = N(s, [0, c], [n, s.shape[1] - c]);
+        if (c === 0)
+          s = S(F, T(T(F, i), sn));
+        else {
+          const C = S(F, T(T(F, i), sn));
+          s = H([N(s, [0, 0], [n, c]), C], 1);
+        }
+        return [i, a, s];
+      }), Jn([d, m, $]);
+    }
+    return !t && n > e && (s = N(s, [0, 0], [n, e]), a = N(a, [0, 0], [e, e])), [s, a];
+  });
+}
+const bs = /* @__PURE__ */ h({ qr_: ds });
+/**
+ * @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 ws = {
+  flipLeftRight: Te,
+  grayscaleToRGB: we,
+  resizeNearestNeighbor: as,
+  resizeBilinear: ts,
+  rgbToGrayscale: Be,
+  rotateWithOffset: Ge,
+  cropAndResize: Me,
+  nonMaxSuppression: Re,
+  nonMaxSuppressionAsync: Je,
+  nonMaxSuppressionWithScore: Xe,
+  nonMaxSuppressionWithScoreAsync: Qe,
+  nonMaxSuppressionPadded: Ue,
+  nonMaxSuppressionPaddedAsync: es,
+  threshold: cs,
+  transform: ls
+}, zs = {
+  bandPart: ms,
+  gramSchmidt: fs,
+  qr: bs
+};
+export {
+  W as a,
+  an as b,
+  de as c,
+  pn as d,
+  ae as e,
+  U as f,
+  ce as g,
+  tn as h,
+  G as i,
+  Ie as j,
+  ws as k,
+  zs as l,
+  rn as m,
+  nn as n,
+  N as s,
+  M as t,
+  mn as u,
+  R as w
+};