@qwik.dev/core
Version:
An open source framework for building instant loading web apps at any scale, without the extra effort.
1,411 lines (1,407 loc) • 761 kB
HTML
<!doctype html>
<html>
<head>
<meta charset="UTF-8" />
<meta name="color-scheme" content="dark light" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>Playwright Test Report</title>
<script type="module">
var J0 = Object.defineProperty;
var _0 = (e, t, n) =>
t in e
? J0(e, t, {
enumerable: !0,
configurable: !0,
writable: !0,
value: n,
})
: (e[t] = n);
var Rt = (e, t, n) => (_0(e, typeof t != "symbol" ? t + "" : t, n), n);
(function () {
const t = document.createElement("link").relList;
if (t && t.supports && t.supports("modulepreload")) return;
for (const o of document.querySelectorAll('link[rel="modulepreload"]'))
r(o);
new MutationObserver((o) => {
for (const s of o)
if (s.type === "childList")
for (const i of s.addedNodes)
i.tagName === "LINK" && i.rel === "modulepreload" && r(i);
}).observe(document, { childList: !0, subtree: !0 });
function n(o) {
const s = {};
return (
o.integrity && (s.integrity = o.integrity),
o.referrerPolicy && (s.referrerPolicy = o.referrerPolicy),
o.crossOrigin === "use-credentials"
? (s.credentials = "include")
: o.crossOrigin === "anonymous"
? (s.credentials = "omit")
: (s.credentials = "same-origin"),
s
);
}
function r(o) {
if (o.ep) return;
o.ep = !0;
const s = n(o);
fetch(o.href, s);
}
})();
var Xn =
typeof globalThis < "u"
? globalThis
: typeof window < "u"
? window
: typeof global < "u"
? global
: typeof self < "u"
? self
: {};
function $0(e) {
return e &&
e.__esModule &&
Object.prototype.hasOwnProperty.call(e, "default")
? e.default
: e;
}
var tf = { exports: {} },
xs = {},
nf = { exports: {} },
Q = {};
/**
* @license React
* react.production.min.js
*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/ var Jr = Symbol.for("react.element"),
eh = Symbol.for("react.portal"),
th = Symbol.for("react.fragment"),
nh = Symbol.for("react.strict_mode"),
rh = Symbol.for("react.profiler"),
oh = Symbol.for("react.provider"),
sh = Symbol.for("react.context"),
ih = Symbol.for("react.forward_ref"),
lh = Symbol.for("react.suspense"),
ch = Symbol.for("react.memo"),
ah = Symbol.for("react.lazy"),
Vc = Symbol.iterator;
function uh(e) {
return e === null || typeof e != "object"
? null
: ((e = (Vc && e[Vc]) || e["@@iterator"]),
typeof e == "function" ? e : null);
}
var rf = {
isMounted: function () {
return !1;
},
enqueueForceUpdate: function () {},
enqueueReplaceState: function () {},
enqueueSetState: function () {},
},
of = Object.assign,
sf = {};
function tr(e, t, n) {
(this.props = e),
(this.context = t),
(this.refs = sf),
(this.updater = n || rf);
}
tr.prototype.isReactComponent = {};
tr.prototype.setState = function (e, t) {
if (typeof e != "object" && typeof e != "function" && e != null)
throw Error(
"setState(...): takes an object of state variables to update or a function which returns an object of state variables.",
);
this.updater.enqueueSetState(this, e, t, "setState");
};
tr.prototype.forceUpdate = function (e) {
this.updater.enqueueForceUpdate(this, e, "forceUpdate");
};
function lf() {}
lf.prototype = tr.prototype;
function Il(e, t, n) {
(this.props = e),
(this.context = t),
(this.refs = sf),
(this.updater = n || rf);
}
var bl = (Il.prototype = new lf());
bl.constructor = Il;
of(bl, tr.prototype);
bl.isPureReactComponent = !0;
var Wc = Array.isArray,
cf = Object.prototype.hasOwnProperty,
Nl = { current: null },
af = { key: !0, ref: !0, __self: !0, __source: !0 };
function uf(e, t, n) {
var r,
o = {},
s = null,
i = null;
if (t != null)
for (r in (t.ref !== void 0 && (i = t.ref),
t.key !== void 0 && (s = "" + t.key),
t))
cf.call(t, r) && !af.hasOwnProperty(r) && (o[r] = t[r]);
var l = arguments.length - 2;
if (l === 1) o.children = n;
else if (1 < l) {
for (var c = Array(l), a = 0; a < l; a++) c[a] = arguments[a + 2];
o.children = c;
}
if (e && e.defaultProps)
for (r in ((l = e.defaultProps), l)) o[r] === void 0 && (o[r] = l[r]);
return {
$$typeof: Jr,
type: e,
key: s,
ref: i,
props: o,
_owner: Nl.current,
};
}
function fh(e, t) {
return {
$$typeof: Jr,
type: e.type,
key: t,
ref: e.ref,
props: e.props,
_owner: e._owner,
};
}
function Ol(e) {
return typeof e == "object" && e !== null && e.$$typeof === Jr;
}
function dh(e) {
var t = { "=": "=0", ":": "=2" };
return (
"$" +
e.replace(/[=:]/g, function (n) {
return t[n];
})
);
}
var Gc = /\/+/g;
function Vs(e, t) {
return typeof e == "object" && e !== null && e.key != null
? dh("" + e.key)
: t.toString(36);
}
function bo(e, t, n, r, o) {
var s = typeof e;
(s === "undefined" || s === "boolean") && (e = null);
var i = !1;
if (e === null) i = !0;
else
switch (s) {
case "string":
case "number":
i = !0;
break;
case "object":
switch (e.$$typeof) {
case Jr:
case eh:
i = !0;
}
}
if (i)
return (
(i = e),
(o = o(i)),
(e = r === "" ? "." + Vs(i, 0) : r),
Wc(o)
? ((n = ""),
e != null && (n = e.replace(Gc, "$&/") + "/"),
bo(o, t, n, "", function (a) {
return a;
}))
: o != null &&
(Ol(o) &&
(o = fh(
o,
n +
(!o.key || (i && i.key === o.key)
? ""
: ("" + o.key).replace(Gc, "$&/") + "/") +
e,
)),
t.push(o)),
1
);
if (((i = 0), (r = r === "" ? "." : r + ":"), Wc(e)))
for (var l = 0; l < e.length; l++) {
s = e[l];
var c = r + Vs(s, l);
i += bo(s, t, n, c, o);
}
else if (((c = uh(e)), typeof c == "function"))
for (e = c.call(e), l = 0; !(s = e.next()).done; )
(s = s.value), (c = r + Vs(s, l++)), (i += bo(s, t, n, c, o));
else if (s === "object")
throw (
((t = String(e)),
Error(
"Objects are not valid as a React child (found: " +
(t === "[object Object]"
? "object with keys {" + Object.keys(e).join(", ") + "}"
: t) +
"). If you meant to render a collection of children, use an array instead.",
))
);
return i;
}
function oo(e, t, n) {
if (e == null) return e;
var r = [],
o = 0;
return (
bo(e, r, "", "", function (s) {
return t.call(n, s, o++);
}),
r
);
}
function ph(e) {
if (e._status === -1) {
var t = e._result;
(t = t()),
t.then(
function (n) {
(e._status === 0 || e._status === -1) &&
((e._status = 1), (e._result = n));
},
function (n) {
(e._status === 0 || e._status === -1) &&
((e._status = 2), (e._result = n));
},
),
e._status === -1 && ((e._status = 0), (e._result = t));
}
if (e._status === 1) return e._result.default;
throw e._result;
}
var ke = { current: null },
No = { transition: null },
hh = {
ReactCurrentDispatcher: ke,
ReactCurrentBatchConfig: No,
ReactCurrentOwner: Nl,
};
Q.Children = {
map: oo,
forEach: function (e, t, n) {
oo(
e,
function () {
t.apply(this, arguments);
},
n,
);
},
count: function (e) {
var t = 0;
return (
oo(e, function () {
t++;
}),
t
);
},
toArray: function (e) {
return (
oo(e, function (t) {
return t;
}) || []
);
},
only: function (e) {
if (!Ol(e))
throw Error(
"React.Children.only expected to receive a single React element child.",
);
return e;
},
};
Q.Component = tr;
Q.Fragment = th;
Q.Profiler = rh;
Q.PureComponent = Il;
Q.StrictMode = nh;
Q.Suspense = lh;
Q.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED = hh;
Q.cloneElement = function (e, t, n) {
if (e == null)
throw Error(
"React.cloneElement(...): The argument must be a React element, but you passed " +
e +
".",
);
var r = of({}, e.props),
o = e.key,
s = e.ref,
i = e._owner;
if (t != null) {
if (
(t.ref !== void 0 && ((s = t.ref), (i = Nl.current)),
t.key !== void 0 && (o = "" + t.key),
e.type && e.type.defaultProps)
)
var l = e.type.defaultProps;
for (c in t)
cf.call(t, c) &&
!af.hasOwnProperty(c) &&
(r[c] = t[c] === void 0 && l !== void 0 ? l[c] : t[c]);
}
var c = arguments.length - 2;
if (c === 1) r.children = n;
else if (1 < c) {
l = Array(c);
for (var a = 0; a < c; a++) l[a] = arguments[a + 2];
r.children = l;
}
return {
$$typeof: Jr,
type: e.type,
key: o,
ref: s,
props: r,
_owner: i,
};
};
Q.createContext = function (e) {
return (
(e = {
$$typeof: sh,
_currentValue: e,
_currentValue2: e,
_threadCount: 0,
Provider: null,
Consumer: null,
_defaultValue: null,
_globalName: null,
}),
(e.Provider = { $$typeof: oh, _context: e }),
(e.Consumer = e)
);
};
Q.createElement = uf;
Q.createFactory = function (e) {
var t = uf.bind(null, e);
return (t.type = e), t;
};
Q.createRef = function () {
return { current: null };
};
Q.forwardRef = function (e) {
return { $$typeof: ih, render: e };
};
Q.isValidElement = Ol;
Q.lazy = function (e) {
return {
$$typeof: ah,
_payload: { _status: -1, _result: e },
_init: ph,
};
};
Q.memo = function (e, t) {
return { $$typeof: ch, type: e, compare: t === void 0 ? null : t };
};
Q.startTransition = function (e) {
var t = No.transition;
No.transition = {};
try {
e();
} finally {
No.transition = t;
}
};
Q.unstable_act = function () {
throw Error("act(...) is not supported in production builds of React.");
};
Q.useCallback = function (e, t) {
return ke.current.useCallback(e, t);
};
Q.useContext = function (e) {
return ke.current.useContext(e);
};
Q.useDebugValue = function () {};
Q.useDeferredValue = function (e) {
return ke.current.useDeferredValue(e);
};
Q.useEffect = function (e, t) {
return ke.current.useEffect(e, t);
};
Q.useId = function () {
return ke.current.useId();
};
Q.useImperativeHandle = function (e, t, n) {
return ke.current.useImperativeHandle(e, t, n);
};
Q.useInsertionEffect = function (e, t) {
return ke.current.useInsertionEffect(e, t);
};
Q.useLayoutEffect = function (e, t) {
return ke.current.useLayoutEffect(e, t);
};
Q.useMemo = function (e, t) {
return ke.current.useMemo(e, t);
};
Q.useReducer = function (e, t, n) {
return ke.current.useReducer(e, t, n);
};
Q.useRef = function (e) {
return ke.current.useRef(e);
};
Q.useState = function (e) {
return ke.current.useState(e);
};
Q.useSyncExternalStore = function (e, t, n) {
return ke.current.useSyncExternalStore(e, t, n);
};
Q.useTransition = function () {
return ke.current.useTransition();
};
Q.version = "18.1.0";
nf.exports = Q;
var j = nf.exports;
/**
* @license React
* react-jsx-runtime.production.min.js
*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/ var gh = j,
mh = Symbol.for("react.element"),
vh = Symbol.for("react.fragment"),
wh = Object.prototype.hasOwnProperty,
yh =
gh.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED
.ReactCurrentOwner,
Ah = { key: !0, ref: !0, __self: !0, __source: !0 };
function ff(e, t, n) {
var r,
o = {},
s = null,
i = null;
n !== void 0 && (s = "" + n),
t.key !== void 0 && (s = "" + t.key),
t.ref !== void 0 && (i = t.ref);
for (r in t) wh.call(t, r) && !Ah.hasOwnProperty(r) && (o[r] = t[r]);
if (e && e.defaultProps)
for (r in ((t = e.defaultProps), t)) o[r] === void 0 && (o[r] = t[r]);
return {
$$typeof: mh,
type: e,
key: s,
ref: i,
props: o,
_owner: yh.current,
};
}
xs.Fragment = vh;
xs.jsx = ff;
xs.jsxs = ff;
tf.exports = xs;
var Pl = tf.exports;
const yn = Pl.Fragment,
A = Pl.jsx,
L = Pl.jsxs,
Eh = 15,
V = 0,
yt = 1,
xh = 2,
De = -2,
J = -3,
Yc = -4,
At = -5,
Pe = [
0, 1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383,
32767, 65535,
],
df = 1440,
Sh = 0,
kh = 4,
Ch = 9,
Dh = 5,
Rh = [
96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0,
8, 48, 0, 9, 192, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 160, 0, 8, 0,
0, 8, 128, 0, 8, 64, 0, 9, 224, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9,
144, 83, 7, 59, 0, 8, 120, 0, 8, 56, 0, 9, 208, 81, 7, 17, 0, 8, 104,
0, 8, 40, 0, 9, 176, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 240, 80, 7,
4, 0, 8, 84, 0, 8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0,
9, 200, 81, 7, 13, 0, 8, 100, 0, 8, 36, 0, 9, 168, 0, 8, 4, 0, 8, 132,
0, 8, 68, 0, 9, 232, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 152, 84, 7,
83, 0, 8, 124, 0, 8, 60, 0, 9, 216, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0,
9, 184, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9, 248, 80, 7, 3, 0, 8, 82,
0, 8, 18, 85, 8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 196, 81,
7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 164, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0,
9, 228, 80, 7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 148, 84, 7, 67, 0, 8, 122,
0, 8, 58, 0, 9, 212, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 180, 0, 8,
10, 0, 8, 138, 0, 8, 74, 0, 9, 244, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192,
8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 204, 81, 7, 15, 0, 8, 102,
0, 8, 38, 0, 9, 172, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 236, 80, 7,
9, 0, 8, 94, 0, 8, 30, 0, 9, 156, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0,
9, 220, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 188, 0, 8, 14, 0, 8,
142, 0, 8, 78, 0, 9, 252, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131,
82, 7, 31, 0, 8, 113, 0, 8, 49, 0, 9, 194, 80, 7, 10, 0, 8, 97, 0, 8,
33, 0, 9, 162, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 226, 80, 7, 6, 0,
8, 89, 0, 8, 25, 0, 9, 146, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 210,
81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 178, 0, 8, 9, 0, 8, 137, 0, 8,
73, 0, 9, 242, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0,
8, 117, 0, 8, 53, 0, 9, 202, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9,
170, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 234, 80, 7, 8, 0, 8, 93, 0,
8, 29, 0, 9, 154, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 218, 82, 7,
23, 0, 8, 109, 0, 8, 45, 0, 9, 186, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0,
9, 250, 80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8,
115, 0, 8, 51, 0, 9, 198, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 166, 0,
8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 230, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0,
9, 150, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 214, 82, 7, 19, 0, 8,
107, 0, 8, 43, 0, 9, 182, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 246,
80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8,
55, 0, 9, 206, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 174, 0, 8, 7, 0,
8, 135, 0, 8, 71, 0, 9, 238, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 158,
84, 7, 99, 0, 8, 127, 0, 8, 63, 0, 9, 222, 82, 7, 27, 0, 8, 111, 0, 8,
47, 0, 9, 190, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 254, 96, 7, 256,
0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9,
193, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 161, 0, 8, 0, 0, 8, 128, 0,
8, 64, 0, 9, 225, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 145, 83, 7, 59,
0, 8, 120, 0, 8, 56, 0, 9, 209, 81, 7, 17, 0, 8, 104, 0, 8, 40, 0, 9,
177, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 241, 80, 7, 4, 0, 8, 84, 0,
8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 201, 81, 7,
13, 0, 8, 100, 0, 8, 36, 0, 9, 169, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0,
9, 233, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 153, 84, 7, 83, 0, 8, 124,
0, 8, 60, 0, 9, 217, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 185, 0, 8,
12, 0, 8, 140, 0, 8, 76, 0, 9, 249, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85,
8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 197, 81, 7, 11, 0, 8,
98, 0, 8, 34, 0, 9, 165, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0, 9, 229, 80,
7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 149, 84, 7, 67, 0, 8, 122, 0, 8, 58,
0, 9, 213, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 181, 0, 8, 10, 0, 8,
138, 0, 8, 74, 0, 9, 245, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83,
7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 205, 81, 7, 15, 0, 8, 102, 0, 8, 38,
0, 9, 173, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 237, 80, 7, 9, 0, 8,
94, 0, 8, 30, 0, 9, 157, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9, 221,
82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 189, 0, 8, 14, 0, 8, 142, 0, 8,
78, 0, 9, 253, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31,
0, 8, 113, 0, 8, 49, 0, 9, 195, 80, 7, 10, 0, 8, 97, 0, 8, 33, 0, 9,
163, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 227, 80, 7, 6, 0, 8, 89, 0,
8, 25, 0, 9, 147, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 211, 81, 7,
17, 0, 8, 105, 0, 8, 41, 0, 9, 179, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0,
9, 243, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8,
117, 0, 8, 53, 0, 9, 203, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 171,
0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 235, 80, 7, 8, 0, 8, 93, 0, 8, 29,
0, 9, 155, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 219, 82, 7, 23, 0, 8,
109, 0, 8, 45, 0, 9, 187, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0, 9, 251,
80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8,
51, 0, 9, 199, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 167, 0, 8, 3, 0,
8, 131, 0, 8, 67, 0, 9, 231, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 151,
84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 215, 82, 7, 19, 0, 8, 107, 0, 8,
43, 0, 9, 183, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 247, 80, 7, 5, 0,
8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9, 207,
81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 175, 0, 8, 7, 0, 8, 135, 0, 8,
71, 0, 9, 239, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 159, 84, 7, 99, 0,
8, 127, 0, 8, 63, 0, 9, 223, 82, 7, 27, 0, 8, 111, 0, 8, 47, 0, 9,
191, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 255,
],
Th = [
80, 5, 1, 87, 5, 257, 83, 5, 17, 91, 5, 4097, 81, 5, 5, 89, 5, 1025,
85, 5, 65, 93, 5, 16385, 80, 5, 3, 88, 5, 513, 84, 5, 33, 92, 5, 8193,
82, 5, 9, 90, 5, 2049, 86, 5, 129, 192, 5, 24577, 80, 5, 2, 87, 5,
385, 83, 5, 25, 91, 5, 6145, 81, 5, 7, 89, 5, 1537, 85, 5, 97, 93, 5,
24577, 80, 5, 4, 88, 5, 769, 84, 5, 49, 92, 5, 12289, 82, 5, 13, 90,
5, 3073, 86, 5, 193, 192, 5, 24577,
],
Ih = [
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51,
59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0,
],
bh = [
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4,
4, 5, 5, 5, 5, 0, 112, 112,
],
Nh = [
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385,
513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385,
24577,
],
Oh = [
0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10,
10, 11, 11, 12, 12, 13, 13,
],
Tt = 15;
function ki() {
const e = this;
let t, n, r, o, s, i;
function l(a, p, m, h, x, E, v, g, u, f, d) {
let y, k, w, S, C, R, D, T, M, O, q, U, B, Y, I;
(O = 0), (C = m);
do r[a[p + O]]++, O++, C--;
while (C !== 0);
if (r[0] == m) return (v[0] = -1), (g[0] = 0), V;
for (T = g[0], R = 1; R <= Tt && r[R] === 0; R++);
for (D = R, T < R && (T = R), C = Tt; C !== 0 && r[C] === 0; C--);
for (
w = C, T > C && (T = C), g[0] = T, Y = 1 << R;
R < C;
R++, Y <<= 1
)
if ((Y -= r[R]) < 0) return J;
if ((Y -= r[C]) < 0) return J;
for (r[C] += Y, i[1] = R = 0, O = 1, B = 2; --C !== 0; )
(i[B] = R += r[O]), B++, O++;
(C = 0), (O = 0);
do (R = a[p + O]) !== 0 && (d[i[R]++] = C), O++;
while (++C < m);
for (
m = i[w],
i[0] = C = 0,
O = 0,
S = -1,
U = -T,
s[0] = 0,
q = 0,
I = 0;
D <= w;
D++
)
for (y = r[D]; y-- !== 0; ) {
for (; D > U + T; ) {
if (
(S++,
(U += T),
(I = w - U),
(I = I > T ? T : I),
(k = 1 << (R = D - U)) > y + 1 &&
((k -= y + 1), (B = D), R < I))
)
for (; ++R < I && !((k <<= 1) <= r[++B]); ) k -= r[B];
if (((I = 1 << R), f[0] + I > df)) return J;
(s[S] = q = f[0]),
(f[0] += I),
S !== 0
? ((i[S] = C),
(o[0] = R),
(o[1] = T),
(R = C >>> (U - T)),
(o[2] = q - s[S - 1] - R),
u.set(o, (s[S - 1] + R) * 3))
: (v[0] = q);
}
for (
o[1] = D - U,
O >= m
? (o[0] = 128 + 64)
: d[O] < h
? ((o[0] = d[O] < 256 ? 0 : 32 + 64), (o[2] = d[O++]))
: ((o[0] = E[d[O] - h] + 16 + 64),
(o[2] = x[d[O++] - h])),
k = 1 << (D - U),
R = C >>> U;
R < I;
R += k
)
u.set(o, (q + R) * 3);
for (R = 1 << (D - 1); C & R; R >>>= 1) C ^= R;
for (C ^= R, M = (1 << U) - 1; (C & M) != i[S]; )
S--, (U -= T), (M = (1 << U) - 1);
}
return Y !== 0 && w != 1 ? At : V;
}
function c(a) {
let p;
for (
t ||
((t = []),
(n = []),
(r = new Int32Array(Tt + 1)),
(o = []),
(s = new Int32Array(Tt)),
(i = new Int32Array(Tt + 1))),
n.length < a && (n = []),
p = 0;
p < a;
p++
)
n[p] = 0;
for (p = 0; p < Tt + 1; p++) r[p] = 0;
for (p = 0; p < 3; p++) o[p] = 0;
s.set(r.subarray(0, Tt), 0), i.set(r.subarray(0, Tt + 1), 0);
}
(e.inflate_trees_bits = function (a, p, m, h, x) {
let E;
return (
c(19),
(t[0] = 0),
(E = l(a, 0, 19, 19, null, null, m, p, h, t, n)),
E == J
? (x.msg = "oversubscribed dynamic bit lengths tree")
: (E == At || p[0] === 0) &&
((x.msg = "incomplete dynamic bit lengths tree"), (E = J)),
E
);
}),
(e.inflate_trees_dynamic = function (a, p, m, h, x, E, v, g, u) {
let f;
return (
c(288),
(t[0] = 0),
(f = l(m, 0, a, 257, Ih, bh, E, h, g, t, n)),
f != V || h[0] === 0
? (f == J
? (u.msg = "oversubscribed literal/length tree")
: f != Yc &&
((u.msg = "incomplete literal/length tree"), (f = J)),
f)
: (c(288),
(f = l(m, a, p, 0, Nh, Oh, v, x, g, t, n)),
f != V || (x[0] === 0 && a > 257)
? (f == J
? (u.msg = "oversubscribed distance tree")
: f == At
? ((u.msg = "incomplete distance tree"), (f = J))
: f != Yc &&
((u.msg = "empty distance tree with lengths"),
(f = J)),
f)
: V)
);
});
}
ki.inflate_trees_fixed = function (e, t, n, r) {
return (e[0] = Ch), (t[0] = Dh), (n[0] = Rh), (r[0] = Th), V;
};
const so = 0,
zc = 1,
Xc = 2,
Kc = 3,
Zc = 4,
Jc = 5,
_c = 6,
Ws = 7,
$c = 8,
io = 9;
function Ph() {
const e = this;
let t,
n = 0,
r,
o = 0,
s = 0,
i = 0,
l = 0,
c = 0,
a = 0,
p = 0,
m,
h = 0,
x,
E = 0;
function v(g, u, f, d, y, k, w, S) {
let C, R, D, T, M, O, q, U, B, Y, I, H, N, z, F, G;
(q = S.next_in_index),
(U = S.avail_in),
(M = w.bitb),
(O = w.bitk),
(B = w.write),
(Y = B < w.read ? w.read - B - 1 : w.end - B),
(I = Pe[g]),
(H = Pe[u]);
do {
for (; O < 20; )
U--, (M |= (S.read_byte(q++) & 255) << O), (O += 8);
if (
((C = M & I),
(R = f),
(D = d),
(G = (D + C) * 3),
(T = R[G]) === 0)
) {
(M >>= R[G + 1]), (O -= R[G + 1]), (w.win[B++] = R[G + 2]), Y--;
continue;
}
do {
if (((M >>= R[G + 1]), (O -= R[G + 1]), T & 16)) {
for (
T &= 15, N = R[G + 2] + (M & Pe[T]), M >>= T, O -= T;
O < 15;
)
U--, (M |= (S.read_byte(q++) & 255) << O), (O += 8);
(C = M & H), (R = y), (D = k), (G = (D + C) * 3), (T = R[G]);
do
if (((M >>= R[G + 1]), (O -= R[G + 1]), T & 16)) {
for (T &= 15; O < T; )
U--, (M |= (S.read_byte(q++) & 255) << O), (O += 8);
if (
((z = R[G + 2] + (M & Pe[T])),
(M >>= T),
(O -= T),
(Y -= N),
B >= z)
)
(F = B - z),
B - F > 0 && 2 > B - F
? ((w.win[B++] = w.win[F++]),
(w.win[B++] = w.win[F++]),
(N -= 2))
: (w.win.set(w.win.subarray(F, F + 2), B),
(B += 2),
(F += 2),
(N -= 2));
else {
F = B - z;
do F += w.end;
while (F < 0);
if (((T = w.end - F), N > T)) {
if (((N -= T), B - F > 0 && T > B - F))
do w.win[B++] = w.win[F++];
while (--T !== 0);
else
w.win.set(w.win.subarray(F, F + T), B),
(B += T),
(F += T),
(T = 0);
F = 0;
}
}
if (B - F > 0 && N > B - F)
do w.win[B++] = w.win[F++];
while (--N !== 0);
else
w.win.set(w.win.subarray(F, F + N), B),
(B += N),
(F += N),
(N = 0);
break;
} else if (!(T & 64))
(C += R[G + 2]),
(C += M & Pe[T]),
(G = (D + C) * 3),
(T = R[G]);
else
return (
(S.msg = "invalid distance code"),
(N = S.avail_in - U),
(N = O >> 3 < N ? O >> 3 : N),
(U += N),
(q -= N),
(O -= N << 3),
(w.bitb = M),
(w.bitk = O),
(S.avail_in = U),
(S.total_in += q - S.next_in_index),
(S.next_in_index = q),
(w.write = B),
J
);
while (!0);
break;
}
if (T & 64)
return T & 32
? ((N = S.avail_in - U),
(N = O >> 3 < N ? O >> 3 : N),
(U += N),
(q -= N),
(O -= N << 3),
(w.bitb = M),
(w.bitk = O),
(S.avail_in = U),
(S.total_in += q - S.next_in_index),
(S.next_in_index = q),
(w.write = B),
yt)
: ((S.msg = "invalid literal/length code"),
(N = S.avail_in - U),
(N = O >> 3 < N ? O >> 3 : N),
(U += N),
(q -= N),
(O -= N << 3),
(w.bitb = M),
(w.bitk = O),
(S.avail_in = U),
(S.total_in += q - S.next_in_index),
(S.next_in_index = q),
(w.write = B),
J);
if (
((C += R[G + 2]),
(C += M & Pe[T]),
(G = (D + C) * 3),
(T = R[G]) === 0)
) {
(M >>= R[G + 1]), (O -= R[G + 1]), (w.win[B++] = R[G + 2]), Y--;
break;
}
} while (!0);
} while (Y >= 258 && U >= 10);
return (
(N = S.avail_in - U),
(N = O >> 3 < N ? O >> 3 : N),
(U += N),
(q -= N),
(O -= N << 3),
(w.bitb = M),
(w.bitk = O),
(S.avail_in = U),
(S.total_in += q - S.next_in_index),
(S.next_in_index = q),
(w.write = B),
V
);
}
(e.init = function (g, u, f, d, y, k) {
(t = so),
(a = g),
(p = u),
(m = f),
(h = d),
(x = y),
(E = k),
(r = null);
}),
(e.proc = function (g, u, f) {
let d,
y,
k,
w = 0,
S = 0,
C = 0,
R,
D,
T,
M;
for (
C = u.next_in_index,
R = u.avail_in,
w = g.bitb,
S = g.bitk,
D = g.write,
T = D < g.read ? g.read - D - 1 : g.end - D;
;
)
switch (t) {
case so:
if (
T >= 258 &&
R >= 10 &&
((g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
(f = v(a, p, m, h, x, E, g, u)),
(C = u.next_in_index),
(R = u.avail_in),
(w = g.bitb),
(S = g.bitk),
(D = g.write),
(T = D < g.read ? g.read - D - 1 : g.end - D),
f != V)
) {
t = f == yt ? Ws : io;
break;
}
(s = a), (r = m), (o = h), (t = zc);
case zc:
for (d = s; S < d; ) {
if (R !== 0) f = V;
else
return (
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
R--, (w |= (u.read_byte(C++) & 255) << S), (S += 8);
}
if (
((y = (o + (w & Pe[d])) * 3),
(w >>>= r[y + 1]),
(S -= r[y + 1]),
(k = r[y]),
k === 0)
) {
(i = r[y + 2]), (t = _c);
break;
}
if (k & 16) {
(l = k & 15), (n = r[y + 2]), (t = Xc);
break;
}
if (!(k & 64)) {
(s = k), (o = y / 3 + r[y + 2]);
break;
}
if (k & 32) {
t = Ws;
break;
}
return (
(t = io),
(u.msg = "invalid literal/length code"),
(f = J),
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
case Xc:
for (d = l; S < d; ) {
if (R !== 0) f = V;
else
return (
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
R--, (w |= (u.read_byte(C++) & 255) << S), (S += 8);
}
(n += w & Pe[d]),
(w >>= d),
(S -= d),
(s = p),
(r = x),
(o = E),
(t = Kc);
case Kc:
for (d = s; S < d; ) {
if (R !== 0) f = V;
else
return (
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
R--, (w |= (u.read_byte(C++) & 255) << S), (S += 8);
}
if (
((y = (o + (w & Pe[d])) * 3),
(w >>= r[y + 1]),
(S -= r[y + 1]),
(k = r[y]),
k & 16)
) {
(l = k & 15), (c = r[y + 2]), (t = Zc);
break;
}
if (!(k & 64)) {
(s = k), (o = y / 3 + r[y + 2]);
break;
}
return (
(t = io),
(u.msg = "invalid distance code"),
(f = J),
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
case Zc:
for (d = l; S < d; ) {
if (R !== 0) f = V;
else
return (
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
R--, (w |= (u.read_byte(C++) & 255) << S), (S += 8);
}
(c += w & Pe[d]), (w >>= d), (S -= d), (t = Jc);
case Jc:
for (M = D - c; M < 0; ) M += g.end;
for (; n !== 0; ) {
if (
T === 0 &&
(D == g.end &&
g.read !== 0 &&
((D = 0),
(T = D < g.read ? g.read - D - 1 : g.end - D)),
T === 0 &&
((g.write = D),
(f = g.inflate_flush(u, f)),
(D = g.write),
(T = D < g.read ? g.read - D - 1 : g.end - D),
D == g.end &&
g.read !== 0 &&
((D = 0),
(T = D < g.read ? g.read - D - 1 : g.end - D)),
T === 0))
)
return (
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
(g.win[D++] = g.win[M++]), T--, M == g.end && (M = 0), n--;
}
t = so;
break;
case _c:
if (
T === 0 &&
(D == g.end &&
g.read !== 0 &&
((D = 0), (T = D < g.read ? g.read - D - 1 : g.end - D)),
T === 0 &&
((g.write = D),
(f = g.inflate_flush(u, f)),
(D = g.write),
(T = D < g.read ? g.read - D - 1 : g.end - D),
D == g.end &&
g.read !== 0 &&
((D = 0),
(T = D < g.read ? g.read - D - 1 : g.end - D)),
T === 0))
)
return (
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
(f = V), (g.win[D++] = i), T--, (t = so);
break;
case Ws:
if (
(S > 7 && ((S -= 8), R++, C--),
(g.write = D),
(f = g.inflate_flush(u, f)),
(D = g.write),
(T = D < g.read ? g.read - D - 1 : g.end - D),
g.read != g.write)
)
return (
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
t = $c;
case $c:
return (
(f = yt),
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
case io:
return (
(f = J),
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
default:
return (
(f = De),
(g.bitb = w),
(g.bitk = S),
(u.avail_in = R),
(u.total_in += C - u.next_in_index),
(u.next_in_index = C),
(g.write = D),
g.inflate_flush(u, f)
);
}
}),
(e.free = function () {});
}
const ea = [
16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15,
],
kn = 0,
Gs = 1,
ta = 2,
na = 3,
ra = 4,
oa = 5,
lo = 6,
co = 7,
sa = 8,
nn = 9;
function Lh(e, t) {
const n = this;
let r = kn,
o = 0,
s = 0,
i = 0,
l;
const c = [0],
a = [0],
p = new Ph();
let m = 0,
h = new Int32Array(df * 3);
const x = 0,
E = new ki();
(n.bitk = 0),
(n.bitb = 0),
(n.win = new Uint8Array(t)),
(n.end = t),
(n.read = 0),
(n.write = 0),
(n.reset = function (v, g) {
g && (g[0] = x),
r == lo && p.free(v),
(r = kn),
(n.bitk = 0),
(n.bitb = 0),
(n.read = n.write = 0);
}),
n.reset(e, null),
(n.inflate_flush = function (v, g) {
let u, f, d;
return (
(f = v.next_out_index),
(d = n.read),
(u = (d <= n.write ? n.write : n.end) - d),
u > v.avail_out && (u = v.avail_out),
u !== 0 && g == At && (g = V),
(v.avail_out -= u),
(v.total_out += u),
v.next_out.set(n.win.subarray(d, d + u), f),
(f += u),
(d += u),
d == n.end &&
((d = 0),
n.write == n.end && (n.write = 0),
(u = n.write - d),
u > v.avail_out && (u = v.avail_out),
u !== 0 && g == At && (g = V),
(v.avail_out -= u),
(v.total_out += u),
v.next_out.set(n.win.subarray(d, d + u), f),
(f += u),
(d += u)),
(v.next_out_index = f),
(n.read = d),
g
);
}),
(n.proc = function (v, g) {
let u, f, d, y, k, w, S, C;
for (
y = v.next_in_index,
k = v.avail_in,
f = n.bitb,
d = n.bitk,
w = n.write,
S = w < n.read ? n.read - w - 1 : n.end - w;
;
) {
let R, D, T, M, O, q, U, B;
switch (r) {
case kn:
for (; d < 3; ) {
if (k !== 0) g = V;
else
return (
(n.bitb = f),
(n.bitk = d),
(v.avail_in = k),
(v.total_in += y - v.next_in_index),
(v.next_in_index = y),
(n.write = w),
n.inflate_flush(v, g)
);
k--, (f |= (v.read_byte(y++) & 255) << d), (d += 8);
}
switch (((u = f & 7), (m = u & 1), u >>> 1)) {
case 0:
(f >>>= 3),
(d -= 3),
(u = d & 7),
(f >>>= u),
(d -= u),
(r = Gs);
break;
case 1:
(R = []),
(D = []),
(T = [[]]),
(M = [[]]),
ki.inflate_trees_fixed(R, D, T, M),
p.init(R[0], D[0], T[0], 0, M[0], 0),
(f >>>= 3),
(d -= 3),
(r = lo);
break;
case 2:
(f >>>= 3), (d -= 3), (r = na);
break;
case 3:
return (
(f >>>= 3),
(d -= 3),
(r = nn),
(v.msg = "invalid block type"),
(g = J),
(n.bitb = f),
(n.bitk = d),
(v.avail_in = k),
(v.total_in += y - v.next_in_index),
(v.next_in_index = y),
(n.write = w),
n.inflate_flush(v, g)
);
}
break;
case Gs:
for (; d < 32; ) {
if (k !== 0) g = V;
else
return (
(n.bitb = f),
(n.bitk = d),
(v.avail_in = k),
(v.total_in += y - v.next_in_index),