vitessce
Version:
This package is the main `vitessce` package on NPM. It exports the `<Vitessce/>` from `@vitessce/all` for backwards compatibility.
1,558 lines • 1.67 MB
JavaScript
var f_ = Object.defineProperty;
var p_ = (i, e, t) => e in i ? f_(i, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : i[e] = t;
var Qn = (i, e, t) => p_(i, typeof e != "symbol" ? e + "" : e, t);
import { aI as Qe, b2 as g_, b3 as Ot, b4 as ut, b5 as Hv, b6 as qv, b7 as $k, b8 as jv, b9 as Mr, ba as Jv, bb as aa, bc as Ro, bd as Ao, be as Gk, bf as oa, bg as qu, bh as Nr, bi as ju, bj as Ju, bk as xs, bl as m_, bm as v_, bn as y_, bo as Ku, bp as S_, bq as b_, br as Wk, bs as Yu, bt as w_, bu as C_, bv as x_, bw as E_, bx as k_, by as Kv, bz as Hk, bA as T_, bB as Yv, bC as L_, bD as D_, bE as I_, bF as P_, bG as R_, bH as A_, bI as __, bJ as M_, bK as N_, bL as O_, ao as Hb } from "./index-CiwyZ_Wn.js";
import qb from "react";
var V_ = g_();
const H = /* @__PURE__ */ Qe(V_);
var jb = {}, Nf, Jb;
function qk() {
if (Jb) return Nf;
Jb = 1;
var i = Ot(), e = ut(), t = Hv();
return Nf = function(n, r) {
var s = (e.Object || {})[n] || Object[n], a = {};
a[n] = r(s), i(i.S + i.F * t(function() {
s(1);
}), "Object", a);
}, Nf;
}
var Kb;
function B_() {
if (Kb) return jb;
Kb = 1;
var i = qv(), e = $k();
return qk()("keys", function() {
return function(n) {
return e(i(n));
};
}), jb;
}
var Of, Yb;
function F_() {
return Yb || (Yb = 1, B_(), Of = ut().Object.keys), Of;
}
var Vf, Xb;
function U_() {
return Xb || (Xb = 1, Vf = { default: F_(), __esModule: !0 }), Vf;
}
var z_ = U_();
const Qt = /* @__PURE__ */ Qe(z_);
var xd = {}, Bf, Zb;
function Xu() {
if (Zb) return Bf;
Zb = 1;
var i = jv(), e = Mr()("toStringTag"), t = i(/* @__PURE__ */ function() {
return arguments;
}()) == "Arguments", n = function(r, s) {
try {
return r[s];
} catch {
}
};
return Bf = function(r) {
var s, a, l;
return r === void 0 ? "Undefined" : r === null ? "Null" : typeof (a = n(s = Object(r), e)) == "string" ? a : t ? i(s) : (l = i(s)) == "Object" && typeof s.callee == "function" ? "Arguments" : l;
}, Bf;
}
var Ff, Qb;
function $_() {
if (Qb) return Ff;
Qb = 1;
var i = Xu(), e = Mr()("iterator"), t = Jv();
return Ff = ut().isIterable = function(n) {
var r = Object(n);
return r[e] !== void 0 || "@@iterator" in r || t.hasOwnProperty(i(r));
}, Ff;
}
var Uf, ew;
function G_() {
return ew || (ew = 1, aa(), Ro(), Uf = $_()), Uf;
}
var zf, tw;
function W_() {
return tw || (tw = 1, zf = { default: G_(), __esModule: !0 }), zf;
}
var $f, nw;
function Xv() {
if (nw) return $f;
nw = 1;
var i = Xu(), e = Mr()("iterator"), t = Jv();
return $f = ut().getIteratorMethod = function(n) {
if (n != null) return n[e] || n["@@iterator"] || t[i(n)];
}, $f;
}
var Gf, iw;
function H_() {
if (iw) return Gf;
iw = 1;
var i = Ao(), e = Xv();
return Gf = ut().getIterator = function(t) {
var n = e(t);
if (typeof n != "function") throw TypeError(t + " is not iterable!");
return i(n.call(t));
}, Gf;
}
var Wf, rw;
function q_() {
return rw || (rw = 1, aa(), Ro(), Wf = H_()), Wf;
}
var Hf, sw;
function jk() {
return sw || (sw = 1, Hf = { default: q_(), __esModule: !0 }), Hf;
}
var aw;
function j_() {
if (aw) return xd;
aw = 1, xd.__esModule = !0;
var i = W_(), e = r(i), t = jk(), n = r(t);
function r(s) {
return s && s.__esModule ? s : { default: s };
}
return xd.default = /* @__PURE__ */ function() {
function s(a, l) {
var d = [], u = !0, h = !1, g = void 0;
try {
for (var v = (0, n.default)(a), y; !(u = (y = v.next()).done) && (d.push(y.value), !(l && d.length === l)); u = !0)
;
} catch (C) {
h = !0, g = C;
} finally {
try {
!u && v.return && v.return();
} finally {
if (h) throw g;
}
}
return d;
}
return function(a, l) {
if (Array.isArray(a))
return a;
if ((0, e.default)(Object(a)))
return s(a, l);
throw new TypeError("Invalid attempt to destructure non-iterable instance");
};
}(), xd;
}
var J_ = j_();
const ae = /* @__PURE__ */ Qe(J_);
var qf, ow;
function Zu() {
if (ow) return qf;
ow = 1;
var i = Gk();
return qf = function(e, t, n) {
for (var r in t)
n && e[r] ? e[r] = t[r] : i(e, r, t[r]);
return e;
}, qf;
}
var jf, lw;
function Qu() {
return lw || (lw = 1, jf = function(i, e, t, n) {
if (!(i instanceof e) || n !== void 0 && n in i)
throw TypeError(t + ": incorrect invocation!");
return i;
}), jf;
}
var Jf = { exports: {} }, Kf, cw;
function Jk() {
if (cw) return Kf;
cw = 1;
var i = Ao();
return Kf = function(e, t, n, r) {
try {
return r ? t(i(n)[0], n[1]) : t(n);
} catch (a) {
var s = e.return;
throw s !== void 0 && i(s.call(e)), a;
}
}, Kf;
}
var Yf, dw;
function Kk() {
if (dw) return Yf;
dw = 1;
var i = Jv(), e = Mr()("iterator"), t = Array.prototype;
return Yf = function(n) {
return n !== void 0 && (i.Array === n || t[e] === n);
}, Yf;
}
var uw;
function _o() {
if (uw) return Jf.exports;
uw = 1;
var i = oa(), e = Jk(), t = Kk(), n = Ao(), r = qu(), s = Xv(), a = {}, l = {}, d = Jf.exports = function(u, h, g, v, y) {
var C = y ? function() {
return u;
} : s(u), w = i(g, v, h ? 2 : 1), b = 0, E, T, P, R;
if (typeof C != "function") throw TypeError(u + " is not iterable!");
if (t(C)) {
for (E = r(u.length); E > b; b++)
if (R = h ? w(n(T = u[b])[0], T[1]) : w(u[b]), R === a || R === l) return R;
} else for (P = C.call(u); !(T = P.next()).done; )
if (R = e(P, w, T.value, h), R === a || R === l) return R;
};
return d.BREAK = a, d.RETURN = l, Jf.exports;
}
var Xf, hw;
function Yk() {
if (hw) return Xf;
hw = 1;
var i = Nr(), e = ut(), t = ju(), n = Ju(), r = Mr()("species");
return Xf = function(s) {
var a = typeof e[s] == "function" ? e[s] : i[s];
n && a && !a[r] && t.f(a, r, {
configurable: !0,
get: function() {
return this;
}
});
}, Xf;
}
var Zf, fw;
function Qs() {
if (fw) return Zf;
fw = 1;
var i = xs();
return Zf = function(e, t) {
if (!i(e) || e._t !== t) throw TypeError("Incompatible receiver, " + t + " required!");
return e;
}, Zf;
}
var Qf, pw;
function Xk() {
if (pw) return Qf;
pw = 1;
var i = ju().f, e = m_(), t = Zu(), n = oa(), r = Qu(), s = _o(), a = v_(), l = y_(), d = Yk(), u = Ju(), h = Ku().fastKey, g = Qs(), v = u ? "_s" : "size", y = function(C, w) {
var b = h(w), E;
if (b !== "F") return C._i[b];
for (E = C._f; E; E = E.n)
if (E.k == w) return E;
};
return Qf = {
getConstructor: function(C, w, b, E) {
var T = C(function(P, R) {
r(P, T, w, "_i"), P._t = w, P._i = e(null), P._f = void 0, P._l = void 0, P[v] = 0, R != null && s(R, b, P[E], P);
});
return t(T.prototype, {
// 23.1.3.1 Map.prototype.clear()
// 23.2.3.2 Set.prototype.clear()
clear: function() {
for (var R = g(this, w), I = R._i, L = R._f; L; L = L.n)
L.r = !0, L.p && (L.p = L.p.n = void 0), delete I[L.i];
R._f = R._l = void 0, R[v] = 0;
},
// 23.1.3.3 Map.prototype.delete(key)
// 23.2.3.4 Set.prototype.delete(value)
delete: function(P) {
var R = g(this, w), I = y(R, P);
if (I) {
var L = I.n, A = I.p;
delete R._i[I.i], I.r = !0, A && (A.n = L), L && (L.p = A), R._f == I && (R._f = L), R._l == I && (R._l = A), R[v]--;
}
return !!I;
},
// 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined)
// 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined)
forEach: function(R) {
g(this, w);
for (var I = n(R, arguments.length > 1 ? arguments[1] : void 0, 3), L; L = L ? L.n : this._f; )
for (I(L.v, L.k, this); L && L.r; ) L = L.p;
},
// 23.1.3.7 Map.prototype.has(key)
// 23.2.3.7 Set.prototype.has(value)
has: function(R) {
return !!y(g(this, w), R);
}
}), u && i(T.prototype, "size", {
get: function() {
return g(this, w)[v];
}
}), T;
},
def: function(C, w, b) {
var E = y(C, w), T, P;
return E ? E.v = b : (C._l = E = {
i: P = h(w, !0),
// <- index
k: w,
// <- key
v: b,
// <- value
p: T = C._l,
// <- previous entry
n: void 0,
// <- next entry
r: !1
// <- removed
}, C._f || (C._f = E), T && (T.n = E), C[v]++, P !== "F" && (C._i[P] = E)), C;
},
getEntry: y,
setStrong: function(C, w, b) {
a(C, w, function(E, T) {
this._t = g(E, w), this._k = T, this._l = void 0;
}, function() {
for (var E = this, T = E._k, P = E._l; P && P.r; ) P = P.p;
return !E._t || !(E._l = P = P ? P.n : E._t._f) ? (E._t = void 0, l(1)) : T == "keys" ? l(0, P.k) : T == "values" ? l(0, P.v) : l(0, [P.k, P.v]);
}, b ? "entries" : "values", !b, !0), d(w);
}
}, Qf;
}
var ep, gw;
function K_() {
if (gw) return ep;
gw = 1;
var i = xs(), e = S_(), t = Mr()("species");
return ep = function(n) {
var r;
return e(n) && (r = n.constructor, typeof r == "function" && (r === Array || e(r.prototype)) && (r = void 0), i(r) && (r = r[t], r === null && (r = void 0))), r === void 0 ? Array : r;
}, ep;
}
var tp, mw;
function Y_() {
if (mw) return tp;
mw = 1;
var i = K_();
return tp = function(e, t) {
return new (i(e))(t);
}, tp;
}
var np, vw;
function Zv() {
if (vw) return np;
vw = 1;
var i = oa(), e = b_(), t = qv(), n = qu(), r = Y_();
return np = function(s, a) {
var l = s == 1, d = s == 2, u = s == 3, h = s == 4, g = s == 6, v = s == 5 || g, y = a || r;
return function(C, w, b) {
for (var E = t(C), T = e(E), P = i(w, b, 3), R = n(T.length), I = 0, L = l ? y(C, R) : d ? y(C, 0) : void 0, A, M; R > I; I++) if ((v || I in T) && (A = T[I], M = P(A, I, E), s)) {
if (l) L[I] = M;
else if (M) switch (s) {
case 3:
return !0;
// some
case 5:
return A;
// find
case 6:
return I;
// findIndex
case 2:
L.push(A);
}
else if (h) return !1;
}
return g ? -1 : u || h ? h : L;
};
}, np;
}
var ip, yw;
function eh() {
if (yw) return ip;
yw = 1;
var i = Nr(), e = Ot(), t = Ku(), n = Hv(), r = Gk(), s = Zu(), a = _o(), l = Qu(), d = xs(), u = Wk(), h = ju().f, g = Zv()(0), v = Ju();
return ip = function(y, C, w, b, E, T) {
var P = i[y], R = P, I = E ? "set" : "add", L = R && R.prototype, A = {};
return !v || typeof R != "function" || !(T || L.forEach && !n(function() {
new R().entries().next();
})) ? (R = b.getConstructor(C, y, E, I), s(R.prototype, w), t.NEED = !0) : (R = C(function(M, O) {
l(M, R, y, "_c"), M._c = new P(), O != null && a(O, E, M[I], M);
}), g("add,clear,delete,forEach,get,has,set,keys,values,entries,toJSON".split(","), function(M) {
var O = M == "add" || M == "set";
M in L && !(T && M == "clear") && r(R.prototype, M, function(F, q) {
if (l(this, R, M), !O && T && !d(F)) return M == "get" ? void 0 : !1;
var U = this._c[M](F === 0 ? 0 : F, q);
return O ? this : U;
});
}), T || h(R.prototype, "size", {
get: function() {
return this._c.size;
}
})), u(R, y), A[y] = R, e(e.G + e.W + e.F, A), T || b.setStrong(R, y, E), R;
}, ip;
}
var rp, Sw;
function X_() {
if (Sw) return rp;
Sw = 1;
var i = Xk(), e = Qs(), t = "Map";
return rp = eh()(t, function(n) {
return function() {
return n(this, arguments.length > 0 ? arguments[0] : void 0);
};
}, {
// 23.1.3.6 Map.prototype.get(key)
get: function(r) {
var s = i.getEntry(e(this, t), r);
return s && s.v;
},
// 23.1.3.9 Map.prototype.set(key, value)
set: function(r, s) {
return i.def(e(this, t), r === 0 ? 0 : r, s);
}
}, i, !0), rp;
}
var bw = {}, sp, ww;
function Z_() {
if (ww) return sp;
ww = 1;
var i = _o();
return sp = function(e, t) {
var n = [];
return i(e, !1, n.push, n, t), n;
}, sp;
}
var ap, Cw;
function Zk() {
if (Cw) return ap;
Cw = 1;
var i = Xu(), e = Z_();
return ap = function(t) {
return function() {
if (i(this) != t) throw TypeError(t + "#toJSON isn't generic");
return e(this);
};
}, ap;
}
var xw;
function Q_() {
if (xw) return bw;
xw = 1;
var i = Ot();
return i(i.P + i.R, "Map", { toJSON: Zk()("Map") }), bw;
}
var Ew = {}, op, kw;
function th() {
if (kw) return op;
kw = 1;
var i = Ot();
return op = function(e) {
i(i.S, e, { of: function() {
for (var n = arguments.length, r = new Array(n); n--; ) r[n] = arguments[n];
return new this(r);
} });
}, op;
}
var Tw;
function eM() {
return Tw || (Tw = 1, th()("Map")), Ew;
}
var Lw = {}, lp, Dw;
function nh() {
if (Dw) return lp;
Dw = 1;
var i = Ot(), e = Yu(), t = oa(), n = _o();
return lp = function(r) {
i(i.S, r, { from: function(a) {
var l = arguments[1], d, u, h, g;
return e(this), d = l !== void 0, d && e(l), a == null ? new this() : (u = [], d ? (h = 0, g = t(l, arguments[2], 2), n(a, !1, function(v) {
u.push(g(v, h++));
})) : n(a, !1, u.push, u), new this(u));
} });
}, lp;
}
var Iw;
function tM() {
return Iw || (Iw = 1, nh()("Map")), Lw;
}
var cp, Pw;
function nM() {
return Pw || (Pw = 1, Ro(), aa(), X_(), Q_(), eM(), tM(), cp = ut().Map), cp;
}
var dp, Rw;
function iM() {
return Rw || (Rw = 1, dp = { default: nM(), __esModule: !0 }), dp;
}
var rM = iM();
const ce = /* @__PURE__ */ Qe(rM);
var sM = w_();
const Mn = /* @__PURE__ */ Qe(sM);
var Aw = {}, up, _w;
function aM() {
if (_w) return up;
_w = 1;
var i = ju(), e = C_();
return up = function(t, n, r) {
n in t ? i.f(t, n, e(0, r)) : t[n] = r;
}, up;
}
var hp, Mw;
function Qk() {
if (Mw) return hp;
Mw = 1;
var i = Mr()("iterator"), e = !1;
try {
var t = [7][i]();
t.return = function() {
e = !0;
}, Array.from(t, function() {
throw 2;
});
} catch {
}
return hp = function(n, r) {
if (!r && !e) return !1;
var s = !1;
try {
var a = [7], l = a[i]();
l.next = function() {
return { done: s = !0 };
}, a[i] = function() {
return l;
}, n(a);
} catch {
}
return s;
}, hp;
}
var Nw;
function oM() {
if (Nw) return Aw;
Nw = 1;
var i = oa(), e = Ot(), t = qv(), n = Jk(), r = Kk(), s = qu(), a = aM(), l = Xv();
return e(e.S + e.F * !Qk()(function(d) {
Array.from(d);
}), "Array", {
// 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined)
from: function(u) {
var h = t(u), g = typeof this == "function" ? this : Array, v = arguments.length, y = v > 1 ? arguments[1] : void 0, C = y !== void 0, w = 0, b = l(h), E, T, P, R;
if (C && (y = i(y, v > 2 ? arguments[2] : void 0, 2)), b != null && !(g == Array && r(b)))
for (R = b.call(h), T = new g(); !(P = R.next()).done; w++)
a(T, w, C ? n(R, y, [P.value, w], !0) : P.value);
else
for (E = s(h.length), T = new g(E); E > w; w++)
a(T, w, C ? y(h[w], w) : h[w]);
return T.length = w, T;
}
}), Aw;
}
var fp, Ow;
function lM() {
return Ow || (Ow = 1, Ro(), oM(), fp = ut().Array.from), fp;
}
var pp, Vw;
function eT() {
return Vw || (Vw = 1, pp = { default: lM(), __esModule: !0 }), pp;
}
var cM = eT();
const Te = /* @__PURE__ */ Qe(cM);
var gp, Bw;
function dM() {
if (Bw) return gp;
Bw = 1;
var i = Xk(), e = Qs(), t = "Set";
return gp = eh()(t, function(n) {
return function() {
return n(this, arguments.length > 0 ? arguments[0] : void 0);
};
}, {
// 23.2.3.1 Set.prototype.add(value)
add: function(r) {
return i.def(e(this, t), r = r === 0 ? 0 : r, r);
}
}, i), gp;
}
var Fw = {}, Uw;
function uM() {
if (Uw) return Fw;
Uw = 1;
var i = Ot();
return i(i.P + i.R, "Set", { toJSON: Zk()("Set") }), Fw;
}
var zw = {}, $w;
function hM() {
return $w || ($w = 1, th()("Set")), zw;
}
var Gw = {}, Ww;
function fM() {
return Ww || (Ww = 1, nh()("Set")), Gw;
}
var mp, Hw;
function pM() {
return Hw || (Hw = 1, Ro(), aa(), dM(), uM(), hM(), fM(), mp = ut().Set), mp;
}
var vp, qw;
function gM() {
return qw || (qw = 1, vp = { default: pM(), __esModule: !0 }), vp;
}
var mM = gM();
const Ge = /* @__PURE__ */ Qe(mM);
var yp, jw;
function vM() {
if (jw) return yp;
jw = 1;
var i = ut(), e = i.JSON || (i.JSON = { stringify: JSON.stringify });
return yp = function(n) {
return e.stringify.apply(e, arguments);
}, yp;
}
var Sp, Jw;
function yM() {
return Jw || (Jw = 1, Sp = { default: vM(), __esModule: !0 }), Sp;
}
var SM = yM();
const re = /* @__PURE__ */ Qe(SM);
/**
* @license
* Copyright 2016 Google Inc.
* 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(i, e) {
let t = i.length, n = 0;
for (let r = 0; r < t; ++r)
e(i[r], r, i) && (i[n] = i[r], ++n);
i.length = n;
}
function bM(i, e) {
if (i.length === e)
return i;
let t = new i.constructor(e);
return t.set(i), t;
}
function om(i, e, t, n) {
const r = i.length / e, s = i.length * t * n, a = new i.constructor(s), l = i.length * n, d = e, u = e * n;
for (let h = 0; h < r; ++h)
for (let g = 0; g < e; ++g) {
const v = i[h * e + g], y = h * u + g;
for (let C = 0; C < t; ++C)
for (let w = 0; w < n; ++w)
a[C * l + w * d + y] = v;
}
return a;
}
function wM(i, e, t, n = 0, r = i.length) {
for (; n < r; ) {
const s = n + r - 1 >> 1, a = t(e, i[s]);
if (a > 0)
n = s + 1;
else if (a < 0)
r = s;
else
return s;
}
return ~n;
}
function CM(i, e, t) {
let n = e - i;
for (; n > 0; ) {
let r = Math.floor(n / 2), s = i + r;
t(s) ? n = r : (i = s + 1, n -= r + 1);
}
return i;
}
function xM(i, e) {
const t = [];
for (let n = 0, r = i.length; n < r; ++n)
i[n] === e && t.push(n);
return t;
}
function Be(i, e) {
const t = i.length;
if (e.length !== t) return !1;
for (let n = 0; n < t; ++n)
if (i[n] !== e[n]) return !1;
return !0;
}
function lm(i, e, t = (n, r) => n === r) {
const n = i.length;
if (e.length !== n) return !1;
for (let r = 0; r < n; ++r)
if (!t(i[r], e[r])) return !1;
return !0;
}
function EM(i, e, t) {
const n = [];
if (t === e) {
for (let r = 0; r < i; ++r)
n[r] = r;
return n;
}
n[t] = e;
for (let r = 0, s = 0; r < i; ) {
if (r === e) {
++r;
continue;
}
s === t && ++s, n[s++] = r++;
}
return n;
}
function Kw(i, e, t) {
for (let n = 0, r = t.length; n < r; ++n) {
const s = t[n];
s !== -1 && (i[n] = e[s]);
}
return i;
}
function uc(i) {
const e = [];
for (let t = 0, n = i.length; t < n; ++t) {
const r = i[t];
for (let s = 0, a = r.length; s < a; ++s) {
let l = e[s];
l === void 0 && (l = e[s] = []), l.push(r[s]);
}
}
return e;
}
function kM(i, e) {
const t = [];
let n = 0;
for (let a = 0, l = e.length; a < l; ++a) {
var r = e[a];
const d = r.retainCount, u = r.deleteCount, h = r.insertCount;
d !== 0 && (t.push(i.slice(n, n + d)), n += d), n += u, h !== 0 && t.push(new Array(h));
}
const s = i.length;
return n !== s && t.push(i.slice(n)), new Array(0).concat(...t);
}
function TM(i, e, t) {
const n = [];
let r = 0, s = 0, a = i.length, l = e.length;
for (; r < a && s < l; ) {
let d, u = i[r], h = e[s];
if (d = t(u, h), d === 0) {
let g = 1;
for (++r, ++s; r < a && s < l && (d = t(i[r], e[s])) === 0; )
++g, ++r, ++s;
n.push({ retainCount: g, deleteCount: 0, insertCount: 0 });
continue;
}
if (d < 0) {
let g = 1;
for (; ++r < a && (d = t(i[r], h)) < 0; )
++g;
n.push({ retainCount: 0, deleteCount: g, insertCount: 0 });
continue;
}
if (d > 0) {
let g = 1;
for (; ++s < l && (d = t(u, e[s])) > 0; )
++g;
n.push({ retainCount: 0, deleteCount: 0, insertCount: g });
continue;
}
}
return (r < a || s < l) && n.push({ retainCount: 0, deleteCount: a - r, insertCount: l - s }), n;
}
function LM(i, e, t, n, r, s) {
let a = 0, l = 0;
if (i !== 0 && e !== 0)
for (; ; ) {
const d = t(a, l);
if (d < 0) {
if (n(a), ++a === i) break;
} else if (d > 0) {
if (r(l), ++l === e) break;
} else if (s(a, l), ++a, ++l, a === i || l === e) break;
}
for (; a < i; )
n(a), ++a;
for (; l < e; )
r(l), ++l;
}
var DM = jk();
const Qv = /* @__PURE__ */ Qe(DM);
var bp, Yw;
function IM() {
if (Yw) return bp;
Yw = 1;
var i = x_(), e = function() {
return i.Date.now();
};
return bp = e, bp;
}
var wp, Xw;
function PM() {
if (Xw) return wp;
Xw = 1;
var i = /\s/;
function e(t) {
for (var n = t.length; n-- && i.test(t.charAt(n)); )
;
return n;
}
return wp = e, wp;
}
var Cp, Zw;
function RM() {
if (Zw) return Cp;
Zw = 1;
var i = PM(), e = /^\s+/;
function t(n) {
return n && n.slice(0, i(n) + 1).replace(e, "");
}
return Cp = t, Cp;
}
var xp, Qw;
function AM() {
if (Qw) return xp;
Qw = 1;
var i = E_(), e = k_(), t = "[object Symbol]";
function n(r) {
return typeof r == "symbol" || e(r) && i(r) == t;
}
return xp = n, xp;
}
var Ep, eC;
function _M() {
if (eC) return Ep;
eC = 1;
var i = RM(), e = Kv(), t = AM(), n = NaN, r = /^[-+]0x[0-9a-f]+$/i, s = /^0b[01]+$/i, a = /^0o[0-7]+$/i, l = parseInt;
function d(u) {
if (typeof u == "number")
return u;
if (t(u))
return n;
if (e(u)) {
var h = typeof u.valueOf == "function" ? u.valueOf() : u;
u = e(h) ? h + "" : h;
}
if (typeof u != "string")
return u === 0 ? u : +u;
u = i(u);
var g = s.test(u);
return g || a.test(u) ? l(u.slice(2), g ? 2 : 8) : r.test(u) ? n : +u;
}
return Ep = d, Ep;
}
var kp, tC;
function nT() {
if (tC) return kp;
tC = 1;
var i = Kv(), e = IM(), t = _M(), n = "Expected a function", r = Math.max, s = Math.min;
function a(l, d, u) {
var h, g, v, y, C, w, b = 0, E = !1, T = !1, P = !0;
if (typeof l != "function")
throw new TypeError(n);
d = t(d) || 0, i(u) && (E = !!u.leading, T = "maxWait" in u, v = T ? r(t(u.maxWait) || 0, d) : v, P = "trailing" in u ? !!u.trailing : P);
function R(V) {
var $ = h, B = g;
return h = g = void 0, b = V, y = l.apply(B, $), y;
}
function I(V) {
return b = V, C = setTimeout(M, d), E ? R(V) : y;
}
function L(V) {
var $ = V - w, B = V - b, le = d - $;
return T ? s(le, v - B) : le;
}
function A(V) {
var $ = V - w, B = V - b;
return w === void 0 || $ >= d || $ < 0 || T && B >= v;
}
function M() {
var V = e();
if (A(V))
return O(V);
C = setTimeout(M, L(V));
}
function O(V) {
return C = void 0, P && h ? R(V) : (h = g = void 0, y);
}
function F() {
C !== void 0 && clearTimeout(C), b = 0, h = w = g = C = void 0;
}
function q() {
return C === void 0 ? y : O(e());
}
function U() {
var V = e(), $ = A(V);
if (h = arguments, g = this, w = V, $) {
if (C === void 0)
return I(w);
if (T)
return clearTimeout(C), C = setTimeout(M, d), R(w);
}
return C === void 0 && (C = setTimeout(M, d)), y;
}
return U.cancel = F, U.flush = q, U;
}
return kp = a, kp;
}
var MM = nT();
const it = /* @__PURE__ */ Qe(MM);
/**
* @license
* Copyright 2016 Google Inc.
* 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(i) {
typeof i == "object" ? i.dispose() : i();
}
function ao(i) {
for (let e = i.length; e > 0; --e)
iT(i[e - 1]);
}
function Ti(i, e, t, n) {
return i.addEventListener(e, t, n), () => i.removeEventListener(e, t, n);
}
class X {
constructor() {
this.refCount = 1;
}
addRef() {
return ++this.refCount, this;
}
dispose() {
--this.refCount === 0 && this.refCountReachedZero();
}
refCountReachedZero() {
this.disposed();
let e = this.disposers;
e !== void 0 && (ao(e), this.disposers = void 0), this.wasDisposed = !0;
}
disposed() {
}
registerDisposer(e) {
let t = this.disposers;
return t == null ? this.disposers = [e] : t.push(e), e;
}
unregisterDisposer(e) {
let t = this.disposers;
if (t != null) {
let n = t.indexOf(e);
n !== -1 && t.splice(n, 1);
}
return e;
}
registerEventListener(e, t, n, r) {
this.registerDisposer(Ti(e, t, n, r));
}
registerCancellable(e) {
return this.registerDisposer(() => {
e.cancel();
}), e;
}
}
class rT extends X {
constructor(e) {
super(), this.value = e;
}
}
function sT(i) {
return () => {
if (i !== void 0) {
let e = i;
i = void 0, iT(e);
}
};
}
/**
* @license
* Copyright 2016 Google Inc.
* 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.
*/
class Ze {
constructor() {
this.handlers = new Ge(), this.count = 0;
const e = this;
this.dispatch = function() {
++e.count, e.handlers.forEach((t) => {
t.apply(this, arguments);
});
};
}
/**
* Add a handler function. If `dispatch` is currently be called, then the new handler will be
* called before `dispatch` returns.
*
* @param handler The handler function to add.
*
* @return A function that unregisters the handler.
*/
add(e) {
return this.handlers.add(e), () => this.remove(e);
}
/**
* Remove a handler function. If `dispatch` is currently be called and the new handler has not
* yet been called, then it will not be called.
*
* @param handler Handler to remove.
* @return `true` if the handler was present, `false` otherwise.
*/
remove(e) {
return this.handlers.delete(e);
}
/**
* Disposes of resources. No methods, including `dispatch`, may be invoked afterwards.
*/
dispose() {
this.handlers = void 0;
}
}
class be extends Ze {
}
const aT = {
count: 0,
add(i) {
return () => {
};
},
remove(i) {
return !1;
}
};
class ct {
constructor(e) {
this.value_ = e, this.changed = new be();
}
get value() {
return this.value_;
}
set value(e) {
e !== this.value_ && (this.value_ = e, this.changed.dispatch());
}
}
class Kt extends ct {
constructor(e, t, n = e) {
super(e), this.validator = t, this.defaultValue = n;
}
toJSON() {
if (this.value_ !== this.defaultValue)
return this.value_;
}
reset() {
this.value = this.defaultValue;
}
restoreState(e) {
if (e !== void 0) {
let t = this.validator;
try {
this.value = t(e);
return;
} catch {
}
}
this.value = this.defaultValue;
}
}
class oT extends X {
constructor(e, t) {
super(), this.changed = new be(), this.f = e, this.ws = t;
for (const n of t)
this.registerDisposer(n.changed.add(this.changed.dispatch));
}
get value() {
return this.f(...this.ws.map((e) => e.value));
}
}
function nC(i, ...e) {
return new oT(i, e);
}
class NM extends X {
constructor(e, t) {
super(), this.changed = new be(), this.valueGeneration = -1, this.f = e, this.ws = t;
for (const n of t)
this.registerDisposer(n.changed.add(this.changed.dispatch));
}
get value() {
const e = this.changed.count;
return e !== this.valueGeneration && (this.value_ = this.f(...this.ws.map((t) => t.value)), this.valueGeneration = e), this.value_;
}
}
function qi(i, ...e) {
return new NM(i, e);
}
class lT extends X {
constructor(e, t = (n, r) => n === r) {
super(), this.changed = new Ze(), this.value = e.value, this.registerDisposer(e.changed.add(() => {
const n = e.value;
t(this.value, n) || (this.value = n, this.changed.dispatch());
}));
}
}
function ci(i, e, t) {
const n = new oT(i, e), r = new lT(n, t);
return r.registerDisposer(n), r;
}
class cT extends X {
constructor(e) {
super(), this.changed = new be();
const t = e(this), n = Qt(t), r = () => {
const s = Array.isArray(t) ? [] : {};
for (const a of n)
s[a] = t[a].value;
this.value = s, this.changed.dispatch();
};
r();
for (const s of n) {
const a = t[s];
this.registerDisposer(a.changed.add(() => r()));
}
}
}
class OM {
constructor(e) {
this.changed = new be(), e === void 0 ? this.values = new Ge() : this.values = new Ge(e);
}
add(e) {
const t = this.values;
return t.has(e) || (t.add(e), this.changed.dispatch()), this;
}
delete(e) {
return this.values.delete(e) ? (this.changed.dispatch(), !0) : !1;
}
has(e) {
return this.values.has(e);
}
get size() {
return this.values.size;
}
[Mn]() {
return Qv(this.values);
}
clear() {
const e = this.values;
e.size > 0 && (e.clear(), this.changed.dispatch());
}
}
function Ir(i, ...e) {
let t = e.map((d) => d.value);
const n = e.length;
let r = new X(), s = i(r, ...t);
const a = it(() => {
let d = !1;
for (let u = 0; u < n; ++u) {
const g = e[u].value;
t[u] !== g && (t[u] = g, d = !0);
}
d && (r.dispose(), r = new X(), s = i(r, ...t));
}, 0), l = e.map((d) => d.changed.add(a));
return {
flush() {
a.flush();
},
dispose() {
a.cancel(), ao(l), r.dispose();
},
get value() {
return a.flush(), s;
}
};
}
function oo(i, ...e) {
let t = e.map((d) => d.value);
const n = e.length;
let r = new X(), s = i(r, ...t);
const a = () => {
let d = !1;
for (let u = 0; u < n; ++u) {
const g = e[u].value;
t[u] !== g && (t[u] = g, d = !0);
}
d && (r.dispose(), r = new X(), s = i(r, ...t));
}, l = e.map((d) => d.changed.add(a));
return {
dispose() {
ao(l), r.dispose();
},
get value() {
return s;
}
};
}
function ea(i) {
return { changed: aT, value: i };
}
function Tr(i, e) {
return i(e.value), e.changed.add(() => i(e.value));
}
class $d {
constructor(e, t) {
this.outer = e, this.getInner = t, this.changed = new be(), this.update = () => {
const n = this.disposer, r = this.outer;
n !== void 0 && n();
const s = this.inner = this.getInner(r.value);
this.disposer = s.changed.add(this.changed.dispatch), this.changed.dispatch();
}, e.changed.add(this.update), this.update();
}
dispose() {
this.outer.changed.remove(this.update), this.disposer();
}
get value() {
return this.inner.value;
}
set value(e) {
this.inner.value = e;
}
}
class Tp extends $d {
reset() {
this.inner.reset();
}
restoreState(e) {
this.inner.restoreState(e);
}
toJSON() {
return this.inner.toJSON();
}
}
/**
* @license
* Copyright 2018 Google Inc.
* 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 Ed = new Float32Array(1);
function VM(i) {
Ed[0] = i, i = Ed[0];
for (let e = 1; e < 21; ++e) {
let t = i.toPrecision(e);
if (Ed[0] = parseFloat(t), Ed[0] === i)
return t;
}
return i.toString();
}
var Gd = 1e-6, yn = typeof Float32Array < "u" ? Float32Array : Array;
Math.hypot || (Math.hypot = function() {
for (var i = 0, e = arguments.length; e--; )
i += arguments[e] * arguments[e];
return Math.sqrt(i);
});
function hc() {
var i = new yn(9);
return yn != Float32Array && (i[1] = 0, i[2] = 0, i[3] = 0, i[5] = 0, i[6] = 0, i[7] = 0), i[0] = 1, i[4] = 1, i[8] = 1, i;
}
function BM(i, e) {
if (i === e) {
var t = e[1], n = e[2], r = e[5];
i[1] = e[3], i[2] = e[6], i[3] = t, i[5] = e[7], i[6] = n, i[7] = r;
} else
i[0] = e[0], i[1] = e[3], i[2] = e[6], i[3] = e[1], i[4] = e[4], i[5] = e[7], i[6] = e[2], i[7] = e[5], i[8] = e[8];
return i;
}
function FM(i, e) {
var t = e[0], n = e[1], r = e[2], s = e[3], a = e[4], l = e[5], d = e[6], u = e[7], h = e[8], g = h * a - l * u, v = -h * s + l * d, y = u * s - a * d, C = t * g + n * v + r * y;
return C ? (C = 1 / C, i[0] = g * C, i[1] = (-h * n + r * u) * C, i[2] = (l * n - r * a) * C, i[3] = v * C, i[4] = (h * t - r * d) * C, i[5] = (-l * t + r * s) * C, i[6] = y * C, i[7] = (-u * t + n * d) * C, i[8] = (a * t - n * s) * C, i) : null;
}
function ey(i) {
var e = i[0], t = i[1], n = i[2], r = i[3], s = i[4], a = i[5], l = i[6], d = i[7], u = i[8];
return e * (u * s - a * d) + t * (-u * r + a * l) + n * (d * r - s * l);
}
function dT(i, e) {
var t = e[0], n = e[1], r = e[2], s = e[3], a = t + t, l = n + n, d = r + r, u = t * a, h = n * a, g = n * l, v = r * a, y = r * l, C = r * d, w = s * a, b = s * l, E = s * d;
return i[0] = 1 - g - C, i[3] = h - E, i[6] = v + b, i[1] = h + E, i[4] = 1 - u - C, i[7] = y - w, i[2] = v - b, i[5] = y + w, i[8] = 1 - u - g, i;
}
function Je() {
var i = new yn(16);
return yn != Float32Array && (i[1] = 0, i[2] = 0, i[3] = 0, i[4] = 0, i[6] = 0, i[7] = 0, i[8] = 0, i[9] = 0, i[11] = 0, i[12] = 0, i[13] = 0, i[14] = 0), i[0] = 1, i[5] = 1, i[10] = 1, i[15] = 1, i;
}
function UM(i) {
var e = new yn(16);
return e[0] = i[0], e[1] = i[1], e[2] = i[2], e[3] = i[3], e[4] = i[4], e[5] = i[5], e[6] = i[6], e[7] = i[7], e[8] = i[8], e[9] = i[9], e[10] = i[10], e[11] = i[11], e[12] = i[12], e[13] = i[13], e[14] = i[14], e[15] = i[15], e;
}
function tu(i, e) {
return i[0] = e[0], i[1] = e[1], i[2] = e[2], i[3] = e[3], i[4] = e[4], i[5] = e[5], i[6] = e[6], i[7] = e[7], i[8] = e[8], i[9] = e[9], i[10] = e[10], i[11] = e[11], i[12] = e[12], i[13] = e[13], i[14] = e[14], i[15] = e[15], i;
}
function uT(i) {
return i[0] = 1, i[1] = 0, i[2] = 0, i[3] = 0, i[4] = 0, i[5] = 1, i[6] = 0, i[7] = 0, i[8] = 0, i[9] = 0, i[10] = 1, i[11] = 0, i[12] = 0, i[13] = 0, i[14] = 0, i[15] = 1, i;
}
function ty(i, e) {
if (i === e) {
var t = e[1], n = e[2], r = e[3], s = e[6], a = e[7], l = e[11];
i[1] = e[4], i[2] = e[8], i[3] = e[12], i[4] = t, i[6] = e[9], i[7] = e[13], i[8] = n, i[9] = s, i[11] = e[14], i[12] = r, i[13] = a, i[14] = l;
} else
i[0] = e[0], i[1] = e[4], i[2] = e[8], i[3] = e[12], i[4] = e[1], i[5] = e[5], i[6] = e[9], i[7] = e[13], i[8] = e[2], i[9] = e[6], i[10] = e[10], i[11] = e[14], i[12] = e[3], i[13] = e[7], i[14] = e[11], i[15] = e[15];
return i;
}
function gs(i, e) {
var t = e[0], n = e[1], r = e[2], s = e[3], a = e[4], l = e[5], d = e[6], u = e[7], h = e[8], g = e[9], v = e[10], y = e[11], C = e[12], w = e[13], b = e[14], E = e[15], T = t * l - n * a, P = t * d - r * a, R = t * u - s * a, I = n * d - r * l, L = n * u - s * l, A = r * u - s * d, M = h * w - g * C, O = h * b - v * C, F = h * E - y * C, q = g * b - v * w, U = g * E - y * w, V = v * E - y * b, $ = T * V - P * U + R * q + I * F - L * O + A * M;
return $ ? ($ = 1 / $, i[0] = (l * V - d * U + u * q) * $, i[1] = (r * U - n * V - s * q) * $, i[2] = (w * A - b * L + E * I) * $, i[3] = (v * L - g * A - y * I) * $, i[4] = (d * F - a * V - u * O) * $, i[5] = (t * V - r * F + s * O) * $, i[6] = (b * R - C * A - E * P) * $, i[7] = (h * A - v * R + y * P) * $, i[8] = (a * U - l * F + u * M) * $, i[9] = (n * F - t * U - s * M) * $, i[10] = (C * L - w * R + E * T) * $, i[11] = (g * R - h * L - y * T) * $, i[12] = (l * O - a * q - d * M) * $, i[13] = (t * q - n * O + r * M) * $, i[14] = (w * P - C * I - b * T) * $, i[15] = (h * I - g * P + v * T) * $, i) : null;
}
function en(i, e, t) {
var n = e[0], r = e[1], s = e[2], a = e[3], l = e[4], d = e[5], u = e[6], h = e[7], g = e[8], v = e[9], y = e[10], C = e[11], w = e[12], b = e[13], E = e[14], T = e[15], P = t[0], R = t[1], I = t[2], L = t[3];
return i[0] = P * n + R * l + I * g + L * w, i[1] = P * r + R * d + I * v + L * b, i[2] = P * s + R * u + I * y + L * E, i[3] = P * a + R * h + I * C + L * T, P = t[4], R = t[5], I = t[6], L = t[7], i[4] = P * n + R * l + I * g + L * w, i[5] = P * r + R * d + I * v + L * b, i[6] = P * s + R * u + I * y + L * E, i[7] = P * a + R * h + I * C + L * T, P = t[8], R = t[9], I = t[10], L = t[11], i[8] = P * n + R * l + I * g + L * w, i[9] = P * r + R * d + I * v + L * b, i[10] = P * s + R * u + I * y + L * E, i[11] = P * a + R * h + I * C + L * T, P = t[12], R = t[13], I = t[14], L = t[15], i[12] = P * n + R * l + I * g + L * w, i[13] = P * r + R * d + I * v + L * b, i[14] = P * s + R * u + I * y + L * E, i[15] = P * a + R * h + I * C + L * T, i;
}
function zM(i, e, t) {
var n = t[0], r = t[1], s = t[2], a, l, d, u, h, g, v, y, C, w, b, E;
return e === i ? (i[12] = e[0] * n + e[4] * r + e[8] * s + e[12], i[13] = e[1] * n + e[5] * r + e[9] * s + e[13], i[14] = e[2] * n + e[6] * r + e[10] * s + e[14], i[15] = e[3] * n + e[7] * r + e[11] * s + e[15]) : (a = e[0], l = e[1], d = e[2], u = e[3], h = e[4], g = e[5], v = e[6], y = e[7], C = e[8], w = e[9], b = e[10], E = e[11], i[0] = a, i[1] = l, i[2] = d, i[3] = u, i[4] = h, i[5] = g, i[6] = v, i[7] = y, i[8] = C, i[9] = w, i[10] = b, i[11] = E, i[12] = a * n + h * r + C * s + e[12], i[13] = l * n + g * r + w * s + e[13], i[14] = d * n + v * r + b * s + e[14], i[15] = u * n + y * r + E * s + e[15]), i;
}
function $M(i, e, t) {
var n = t[0], r = t[1], s = t[2];
return i[0] = e[0] * n, i[1] = e[1] * n, i[2] = e[2] * n, i[3] = e[3] * n, i[4] = e[4] * r, i[5] = e[5] * r, i[6] = e[6] * r, i[7] = e[7] * r, i[8] = e[8] * s, i[9] = e[9] * s, i[10] = e[10] * s, i[11] = e[11] * s, i[12] = e[12], i[13] = e[13], i[14] = e[14], i[15] = e[15], i;
}
function GM(i, e, t, n) {
var r = e[0], s = e[1], a = e[2], l = e[3], d = r + r, u = s + s, h = a + a, g = r * d, v = r * u, y = r * h, C = s * u, w = s * h, b = a * h, E = l * d, T = l * u, P = l * h, R = n[0], I = n[1], L = n[2];
return i[0] = (1 - (C + b)) * R, i[1] = (v + P) * R, i[2] = (y - T) * R, i[3] = 0, i[4] = (v - P) * I, i[5] = (1 - (g + b)) * I, i[6] = (w + E) * I, i[7] = 0, i[8] = (y + T) * L, i[9] = (w - E) * L, i[10] = (1 - (g + C)) * L, i[11] = 0, i[12] = t[0], i[13] = t[1], i[14] = t[2], i[15] = 1, i;
}
function WM(i, e) {
var t = e[0], n = e[1], r = e[2], s = e[3], a = t + t, l = n + n, d = r + r, u = t * a, h = n * a, g = n * l, v = r * a, y = r * l, C = r * d, w = s * a, b = s * l, E = s * d;
return i[0] = 1 - g - C, i[1] = h + E, i[2] = v - b, i[3] = 0, i[4] = h - E, i[5] = 1 - u - C, i[6] = y + w, i[7] = 0, i[8] = v + b, i[9] = y - w, i[10] = 1 - u - g, i[11] = 0, i[12] = 0, i[13] = 0, i[14] = 0, i[15] = 1, i;
}
function HM(i, e, t, n, r) {
var s = 1 / Math.tan(e / 2), a;
return i[0] = s / t, i[1] = 0, i[2] = 0, i[3] = 0, i[4] = 0, i[5] = s, i[6] = 0, i[7] = 0, i[8] = 0, i[9] = 0, i[11] = -1, i[12] = 0, i[13] = 0, i[15] = 0, r != null && r !== 1 / 0 ? (a = 1 / (n - r), i[10] = (r + n) * a, i[14] = 2 * r * n * a) : (i[10] = -1, i[14] = -2 * n), i;
}
function hT(i, e, t, n, r, s, a) {
var l = 1 / (e - t), d = 1 / (n - r), u = 1 / (s - a);
return i[0] = -2 * l, i[1] = 0, i[2] = 0, i[3] = 0, i[4] = 0, i[5] = -2 * d, i[6] = 0, i[7] = 0, i[8] = 0, i[9] = 0, i[10] = 2 * u, i[11] = 0, i[12] = (e + t) * l, i[13] = (r + n) * d, i[14] = (a + s) * u, i[15] = 1, i;
}
function Ne() {
var i = new yn(3);
return yn != Float32Array && (i[0] = 0, i[1] = 0, i[2] = 0), i;
}
function cm(i) {
var e = new yn(3);
return e[0] = i[0], e[1] = i[1], e[2] = i[2], e;
}
function qM(i) {
var e = i[0], t = i[1], n = i[2];
return Math.hypot(e, t, n);
}
function lt(i, e, t) {
var n = new yn(3);
return n[0] = i, n[1] = e, n[2] = t, n;
}
function jM(i, e) {
return i[0] = e[0], i[1] = e[1], i[2] = e[2], i;
}
function dm(i, e, t, n) {
return i[0] = e, i[1] = t, i[2] = n, i;
}
function fT(i, e, t) {
return i[0] = e[0] + t[0], i[1] = e[1] + t[1], i[2] = e[2] + t[2], i;
}
function pT(i, e, t) {
return i[0] = e[0] - t[0], i[1] = e[1] - t[1], i[2] = e[2] - t[2], i;
}
function gT(i, e, t) {
return i[0] = e[0] * t[0], i[1] = e[1] * t[1], i[2] = e[2] * t[2], i;
}
function um(i, e, t) {
return i[0] = e[0] / t[0], i[1] = e[1] / t[1], i[2] = e[2] / t[2], i;
}
function iC(i, e) {
return i[0] = Math.ceil(e[0]), i[1] = Math.ceil(e[1]), i[2] = Math.ceil(e[2]), i;
}
function ny(i, e, t) {
return i[0] = e[0] * t, i[1] = e[1] * t, i[2] = e[2] * t, i;
}
function nu(i, e) {
var t = e[0], n = e[1], r = e[2], s = t * t + n * n + r * r;
return s > 0 && (s = 1 / Math.sqrt(s)), i[0] = e[0] * s, i[1] = e[1] * s, i[2] = e[2] * s, i;
}
function iy(i, e) {
return i[0] * e[0] + i[1] * e[1] + i[2] * e[2];
}
function Lp(i, e, t) {
var n = e[0], r = e[1], s = e[2], a = t[0], l = t[1], d = t[2];
return i[0] = r * d - s * l, i[1] = s * a - n * d, i[2] = n * l - r * a, i;
}
function ai(i, e, t) {
var n = e[0], r = e[1], s = e[2], a = t[3] * n + t[7] * r + t[11] * s + t[15];
return a = a || 1, i[0] = (t[0] * n + t[4] * r + t[8] * s + t[12]) / a, i[1] = (t[1] * n + t[5] * r + t[9] * s + t[13]) / a, i[2] = (t[2] * n + t[6] * r + t[10] * s + t[14]) / a, i;
}
function eo(i, e, t) {
var n = t[0], r = t[1], s = t[2], a = t[3], l = e[0], d = e[1], u = e[2], h = r * u - s * d, g = s * l - n * u, v = n * d - r * l, y = r * v - s * g, C = s * h - n * v, w = n * g - r * h, b = a * 2;
return h *= b, g *= b, v *= b, y *= 2, C *= 2, w *= 2, i[0] = l + h + y, i[1] = d + g + C, i[2] = u + v + w, i;
}
function hm(i, e) {
var t = i[0], n = i[1], r = i[2], s = e[0], a = e[1], l = e[2];
return Math.abs(t - s) <= Gd * Math.max(1, Math.abs(t), Math.abs(s)) && Math.abs(n - a) <= Gd * Math.max(1, Math.abs(n), Math.abs(a)) && Math.abs(r - l) <= Gd * Math.max(1, Math.abs(r), Math.abs(l));
}
var JM = pT, KM = qM;
(function() {
var i = Ne();
return function(e, t, n, r, s, a) {
var l, d;
for (t || (t = 3), n || (n = 0), r ? d = Math.min(r * t + n, e.length) : d = e.length, l = n; l < d; l += t)
i[0] = e[l], i[1] = e[l + 1], i[2] = e[l + 2], s(i, i, a), e[l] = i[0], e[l + 1] = i[1], e[l + 2] = i[2];
return e;
};
})();
function ih() {
var i = new yn(4);
return yn != Float32Array && (i[0] = 0, i[1] = 0, i[2] = 0, i[3] = 0), i;
}
function fc(i, e, t, n) {
var r = new yn(4);
return r[0] = i, r[1] = e, r[2] = t, r[3] = n, r;
}
function YM(i, e) {
return i[0] = e[0], i[1] = e[1], i[2] = e[2], i[3] = e[3], i;
}
function XM(i, e) {
var t = e[0], n = e[1], r = e[2], s = e[3], a = t * t + n * n + r * r + s * s;
return a > 0 && (a = 1 / Math.sqrt(a)), i[0] = t * a, i[1] = n * a, i[2] = r * a, i[3] = s * a, i;
}
(function() {
var i = ih();
return function(e, t, n, r, s, a) {
var l, d;
for (t || (t = 4), n || (n = 0), r ? d = Math.min(r * t + n, e.length) : d = e.length, l = n; l < d; l += t)
i[0] = e[l], i[1] = e[l + 1], i[2] = e[l + 2], i[3] = e[l + 3], s(i, i, a), e[l] = i[0], e[l + 1] = i[1], e[l + 2] = i[2], e[l + 3] = i[3];
return e;
};
})();
function Rn() {
var i = new yn(4);
return yn != Float32Array && (i[0] = 0, i[1] = 0, i[2] = 0), i[3] = 1, i;
}
function rC(i) {
return i[0] = 0, i[1] = 0, i[2] = 0, i[3] = 1, i;
}
function fm(i, e, t) {
t = t * 0.5;
var n = Math.sin(t);
return i[0] = n * e[0], i[1] = n * e[1], i[2] = n * e[2], i[3] = Math.cos(t), i;
}
function us(i, e, t) {
var n = e[0], r = e[1], s = e[2], a = e[3], l = t[0], d = t[1], u = t[2], h = t[3];
return i[0] = n * h + a * l + r * u - s * d, i[1] = r * h + a * d + s * l - n * u, i[2] = s * h + a * u + n * d - r * l, i[3] = a * h - n * l - r * d - s * u, i;
}
function ZM(i, e, t) {
t *= 0.5;
var n = e[0], r = e[1], s = e[2], a = e[3], l = Math.sin(t), d = Math.cos(t);
return i[0] = n * d + a * l, i[1] = r * d + s * l, i[2] = s * d - r * l, i[3] = a * d - n * l, i;
}
function QM(i, e, t) {
t *= 0.5;
var n = e[0], r = e[1], s = e[2], a = e[3], l = Math.sin(t), d = Math.cos(t);
return i[0] = n * d - s * l, i[1] = r * d + a * l, i[2] = s * d + n * l, i[3] = a * d - r * l, i;
}
function Dp(i, e, t, n) {
var r = e[0], s = e[1], a = e[2], l = e[3], d = t[0], u = t[1], h = t[2], g = t[3], v, y, C, w, b;
return y = r * d + s * u + a * h + l * g, y < 0 && (y = -y, d = -d, u = -u, h = -h, g = -g), 1 - y > Gd ? (v = Math.acos(y), C = Math.sin(v), w = Math.sin((1 - n) * v) / C, b = Math.sin(n * v) / C) : (w = 1 - n, b = n), i[0] = w * r + b * d, i[1] = w * s + b * u, i[2] = w * a + b * h, i[3] = w * l + b * g, i;
}
function iu(i, e) {
var t = e[0], n = e[1], r = e[2], s = e[3], a = t * t + n * n + r * r + s * s, l = a ? 1 / a : 0;
return i[0] = -t * l, i[1] = -n * l, i[2] = -r * l, i[3] = s * l, i;
}
function mT(i, e) {
var t = e[0] + e[4] + e[8], n;
if (t > 0)
n = Math.sqrt(t + 1), i[3] = 0.5 * n, n = 0.5 / n, i[0] = (e[5] - e[7]) * n, i[1] = (e[6] - e[2]) * n, i[2] = (e[1] - e[3]) * n;
else {
var r = 0;
e[4] > e[0] && (r = 1), e[8] > e[r * 3 + r] && (r = 2);
var s = (r + 1) % 3, a = (r + 2) % 3;
n = Math.sqrt(e[r * 3 + r] - e[s * 3 + s] - e[a * 3 + a] + 1), i[r] = 0.5 * n, n = 0.5 / n, i[3] = (e[s * 3 + a] - e[a * 3 + s]) * n, i[s] = (e[s * 3 + r] + e[r * 3 + s]) * n, i[a] = (e[a * 3 + r] + e[r * 3 + a]) * n;
}
return i;
}
var eN = YM, jl = XM;
(function() {
var i = Ne(), e = lt(1, 0, 0), t = lt(0, 1, 0);
return function(n, r, s) {
var a = iy(r, s);
return a < -0.999999 ? (Lp(i, e, r), KM(i) < 1e-6 && Lp(i, t, r), nu(i, i), fm(n, i, Math.PI), n) : a > 0.999999 ? (n[0] = 0, n[1] = 0, n[2] = 0, n[3] = 1, n) : (Lp(i, r, s), n[0] = i[0], n[1] = i[1], n[2] = i[2], n[3] = 1 + a, jl(n, n));
};
})();
(function() {
var i = Rn(), e = Rn();
return function(t, n, r, s, a, l) {
return Dp(i, n, a, l), Dp(e, r, s, l), Dp(t, i, e, 2 * l * (1 - l)), t;
};
})();
(function() {
var i = hc();
return function(e, t, n, r) {
return i[0] = n[0], i[3] = n[1], i[6] = n[2], i[1] = r[0], i[4] = r[1], i[7] = r[2], i[2] = -t[0], i[5] = -t[1], i[8] = -t[2], jl(e, mT(e, i));
};
})();
function vT() {
var i = new yn(2);
return yn != Float32Array && (i[0] = 0, i[1] = 0), i;
}
function tN(i, e, t) {
return i[0] = e, i[1] = t, i;
}
function nN(i, e, t) {
return i[0] = e[0] + t[0], i[1] = e[1] + t[1], i;
}
(function() {
var i = vT();
return function(e, t, n, r, s, a) {
var l, d;
for (t || (t = 2), n || (n = 0), r ? d = Math.min(r * t + n, e.length) : d = e.length, l = n; l < d; l += t)
i[0] = e[l], i[1] = e[l + 1], s(i, i, a), e[l] = i[0], e[l + 1] = i[1];
return e;
};
})();
/**
* @license
* Copyright 2016 Google Inc.
* 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 yT = Je(), iN = ["x", "y", "z"], zi = [lt(1, 0, 0), lt(0, 1, 0), lt(0, 0, 1)];
lt(0, 0, 0);
const pm = fc(0, 0, 0, 0), ST = lt(1, 1, 1);
lt(1 / 0, 1 / 0, 1 / 0);
Rn();
function gm(i) {
return i[0] * i[1] * i[2];
}
function mm(i) {
return `${i[0]},${i[1]},${i[2]}`;
}
function rN(i, e, t) {
let n = e[0], r = e[1], s = e[2];
return i[0] = t[0] * n + t[4] * r + t[8] * s, i[1] = t[1] * n + t[5] * r + t[9] * s, i[2] = t[2] * n + t[6] * r + t[10] * s, i;
}
function bT(i, e, t) {
let n = e[0], r = e[1], s = e[2];
return i[0] = t[0] * n + t[1] * r + t[2] * s, i[1] = t[4] * n + t[5] * r + t[6] * s, i[2] = t[8] * n + t[9] * r + t[10] * s, i;
}
function sN(i, e, t) {
const n = t.length;
let r = 0;
for (let a = 0; a < n; ++a)
r += (i[a] - e[a]) ** 2;
let s = 0;
for (let a = 0; a < n; ++a) {
const l = i[a];
s -= (l - t[a]) * (e[a] - l);
}
retu