goobs-frontend
Version:
A comprehensive React-based libary for building modern web applications
1,202 lines • 635 kB
JavaScript
'use client';
import { r as h1 } from "./rolldown-runtime-DkpYurw3.js";
import { t as Se } from "./typeof-BWlKwew5.js";
var sr = Uint8Array, zn = Uint16Array, th = Int32Array, eh = new sr([
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,
0,
0,
0
]), nh = new sr([
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,
0,
0
]), Vh = new sr([
16,
17,
18,
0,
8,
7,
9,
6,
10,
5,
11,
4,
12,
3,
13,
2,
14,
1,
15
]), pc = function(t, n) {
for (var e = new zn(31), r = 0; r < 31; ++r) e[r] = n += 1 << t[r - 1];
for (var a = new th(e[30]), r = 1; r < 30; ++r) for (var o = e[r]; o < e[r + 1]; ++o) a[o] = o - e[r] << 5 | r;
return {
b: e,
r: a
};
}, gc = pc(eh, 2), u1 = gc.b, Rl = gc.r;
u1[28] = 258, Rl[258] = 28;
var vc = pc(nh, 0), O0 = vc.b, Zh = vc.r, Ml = new zn(32768);
for (var Ce = 0; Ce < 32768; ++Ce) {
var si = (Ce & 43690) >> 1 | (Ce & 21845) << 1;
si = (si & 52428) >> 2 | (si & 13107) << 2, si = (si & 61680) >> 4 | (si & 3855) << 4, Ml[Ce] = ((si & 65280) >> 8 | (si & 255) << 8) >> 1;
}
var oo = (function(t, n, e) {
for (var r = t.length, a = 0, o = new zn(n); a < r; ++a) t[a] && ++o[t[a] - 1];
var u = new zn(n);
for (a = 1; a < n; ++a) u[a] = u[a - 1] + o[a - 1] << 1;
var l;
if (e) {
l = new zn(1 << n);
var c = 15 - n;
for (a = 0; a < r; ++a) if (t[a])
for (var d = a << 4 | t[a], v = n - t[a], y = u[t[a] - 1]++ << v, N = y | (1 << v) - 1; y <= N; ++y) l[Ml[y] >> c] = d;
} else
for (l = new zn(r), a = 0; a < r; ++a) t[a] && (l[a] = Ml[u[t[a] - 1]++] >> 15 - t[a]);
return l;
}), qi = new sr(288);
for (var Ce = 0; Ce < 144; ++Ce) qi[Ce] = 8;
for (var Ce = 144; Ce < 256; ++Ce) qi[Ce] = 9;
for (var Ce = 256; Ce < 280; ++Ce) qi[Ce] = 7;
for (var Ce = 280; Ce < 288; ++Ce) qi[Ce] = 8;
var ws = new sr(32);
for (var Ce = 0; Ce < 32; ++Ce) ws[Ce] = 5;
var c1 = /* @__PURE__ */ oo(qi, 9, 0), f1 = /* @__PURE__ */ oo(ws, 5, 0), mc = function(t) {
return (t + 7) / 8 | 0;
}, d1 = function(t, n, e) {
return (n == null || n < 0) && (n = 0), (e == null || e > t.length) && (e = t.length), new sr(t.subarray(n, e));
}, zr = function(t, n, e) {
e <<= n & 7;
var r = n / 8 | 0;
t[r] |= e, t[r + 1] |= e >> 8;
}, eo = function(t, n, e) {
e <<= n & 7;
var r = n / 8 | 0;
t[r] |= e, t[r + 1] |= e >> 8, t[r + 2] |= e >> 16;
}, ul = function(t, n) {
for (var e = [], r = 0; r < t.length; ++r) t[r] && e.push({
s: r,
f: t[r]
});
var a = e.length, o = e.slice();
if (!a) return {
t: wc,
l: 0
};
if (a == 1) {
var u = new sr(e[0].s + 1);
return u[e[0].s] = 1, {
t: u,
l: 1
};
}
e.sort(function(rt, mt) {
return rt.f - mt.f;
}), e.push({
s: -1,
f: 25001
});
var l = e[0], c = e[1], d = 0, v = 1, y = 2;
for (e[0] = {
s: -1,
f: l.f + c.f,
l,
r: c
}; v != a - 1; )
l = e[e[d].f < e[y].f ? d++ : y++], c = e[d != v && e[d].f < e[y].f ? d++ : y++], e[v++] = {
s: -1,
f: l.f + c.f,
l,
r: c
};
for (var N = o[0].s, r = 1; r < a; ++r) o[r].s > N && (N = o[r].s);
var p = new zn(N + 1), j = Dl(e[v - 1], p, 0);
if (j > n) {
var r = 0, F = 0, T = j - n, k = 1 << T;
for (o.sort(function(mt, ct) {
return p[ct.s] - p[mt.s] || mt.f - ct.f;
}); r < a; ++r) {
var G = o[r].s;
if (p[G] > n)
F += k - (1 << j - p[G]), p[G] = n;
else break;
}
for (F >>= T; F > 0; ) {
var Z = o[r].s;
p[Z] < n ? F -= 1 << n - p[Z]++ - 1 : ++r;
}
for (; r >= 0 && F; --r) {
var q = o[r].s;
p[q] == n && (--p[q], ++F);
}
j = n;
}
return {
t: new sr(p),
l: j
};
}, Dl = function(t, n, e) {
return t.s == -1 ? Math.max(Dl(t.l, n, e + 1), Dl(t.r, n, e + 1)) : n[t.s] = e;
}, Yh = function(t) {
for (var n = t.length; n && !t[--n]; ) ;
for (var e = new zn(++n), r = 0, a = t[0], o = 1, u = function(c) {
e[r++] = c;
}, l = 1; l <= n; ++l) if (t[l] == a && l != n) ++o;
else {
if (!a && o > 2) {
for (; o > 138; o -= 138) u(32754);
o > 2 && (u(o > 10 ? o - 11 << 5 | 28690 : o - 3 << 5 | 12305), o = 0);
} else if (o > 3) {
for (u(a), --o; o > 6; o -= 6) u(8304);
o > 2 && (u(o - 3 << 5 | 8208), o = 0);
}
for (; o--; ) u(a);
o = 1, a = t[l];
}
return {
c: e.subarray(0, r),
n
};
}, no = function(t, n) {
for (var e = 0, r = 0; r < n.length; ++r) e += t[r] * n[r];
return e;
}, bc = function(t, n, e) {
var r = e.length, a = mc(n + 2);
t[a] = r & 255, t[a + 1] = r >> 8, t[a + 2] = t[a] ^ 255, t[a + 3] = t[a + 1] ^ 255;
for (var o = 0; o < r; ++o) t[a + o + 4] = e[o];
return (a + 4 + r) * 8;
}, $h = function(t, n, e, r, a, o, u, l, c, d, v) {
zr(n, v++, e), ++a[256];
for (var y = ul(a, 15), N = y.t, p = y.l, j = ul(o, 15), F = j.t, T = j.l, k = Yh(N), G = k.c, Z = k.n, q = Yh(F), rt = q.c, mt = q.n, ct = new zn(19), J = 0; J < G.length; ++J) ++ct[G[J] & 31];
for (var J = 0; J < rt.length; ++J) ++ct[rt[J] & 31];
for (var R = ul(ct, 7), P = R.t, L = R.l, D = 19; D > 4 && !P[Vh[D - 1]]; --D) ;
var z = d + 5 << 3, Y = no(a, qi) + no(o, ws) + u, it = no(a, N) + no(o, F) + u + 14 + 3 * D + no(ct, P) + 2 * ct[16] + 3 * ct[17] + 7 * ct[18];
if (c >= 0 && z <= Y && z <= it) return bc(n, v, t.subarray(c, c + d));
var gt, at, nt, dt;
if (zr(n, v, 1 + (it < Y)), v += 2, it < Y) {
gt = oo(N, p, 0), at = N, nt = oo(F, T, 0), dt = F;
var Nt = oo(P, L, 0);
zr(n, v, Z - 257), zr(n, v + 5, mt - 1), zr(n, v + 10, D - 4), v += 14;
for (var J = 0; J < D; ++J) zr(n, v + 3 * J, P[Vh[J]]);
v += 3 * D;
for (var bt = [G, rt], A = 0; A < 2; ++A)
for (var B = bt[A], J = 0; J < B.length; ++J) {
var M = B[J] & 31;
zr(n, v, Nt[M]), v += P[M], M > 15 && (zr(n, v, B[J] >> 5 & 127), v += B[J] >> 12);
}
} else gt = c1, at = qi, nt = f1, dt = ws;
for (var J = 0; J < l; ++J) {
var W = r[J];
if (W > 255) {
var M = W >> 18 & 31;
eo(n, v, gt[M + 257]), v += at[M + 257], M > 7 && (zr(n, v, W >> 23 & 31), v += eh[M]);
var $ = W & 31;
eo(n, v, nt[$]), v += dt[$], $ > 3 && (eo(n, v, W >> 5 & 8191), v += nh[$]);
} else eo(n, v, gt[W]), v += at[W];
}
return eo(n, v, gt[256]), v + at[256];
}, p1 = /* @__PURE__ */ new th([
65540,
131080,
131088,
131104,
262176,
1048704,
1048832,
2114560,
2117632
]), wc = /* @__PURE__ */ new sr(0), g1 = function(t, n, e, r, a, o) {
var u = o.z || t.length, l = new sr(r + u + 5 * (1 + Math.ceil(u / 7e3)) + a), c = l.subarray(r, l.length - a), d = o.l, v = (o.r || 0) & 7;
if (n) {
v && (c[0] = o.r >> 3);
for (var y = p1[n - 1], N = y >> 13, p = y & 8191, j = (1 << e) - 1, F = o.p || new zn(32768), T = o.h || new zn(j + 1), k = Math.ceil(e / 3), G = 2 * k, Z = function(kt) {
return (t[kt] ^ t[kt + 1] << k ^ t[kt + 2] << G) & j;
}, q = new th(25e3), rt = new zn(288), mt = new zn(32), ct = 0, J = 0, R = o.i || 0, P = 0, L = o.w || 0, D = 0; R + 2 < u; ++R) {
var z = Z(R), Y = R & 32767, it = T[z];
if (F[Y] = it, T[z] = Y, L <= R) {
var gt = u - R;
if ((ct > 7e3 || P > 24576) && (gt > 423 || !d)) {
v = $h(t, c, 0, q, rt, mt, J, P, D, R - D, v), P = ct = J = 0, D = R;
for (var at = 0; at < 286; ++at) rt[at] = 0;
for (var at = 0; at < 30; ++at) mt[at] = 0;
}
var nt = 2, dt = 0, Nt = p, bt = Y - it & 32767;
if (gt > 2 && z == Z(R - bt))
for (var A = Math.min(N, gt) - 1, B = Math.min(32767, R), M = Math.min(258, gt); bt <= B && --Nt && Y != it; ) {
if (t[R + nt] == t[R + nt - bt]) {
for (var W = 0; W < M && t[R + W] == t[R + W - bt]; ++W) ;
if (W > nt) {
if (nt = W, dt = bt, W > A) break;
for (var $ = Math.min(bt, W - 2), Q = 0, at = 0; at < $; ++at) {
var ot = R - bt + at & 32767, st = ot - F[ot] & 32767;
st > Q && (Q = st, it = ot);
}
}
}
Y = it, it = F[Y], bt += Y - it & 32767;
}
if (dt) {
q[P++] = 268435456 | Rl[nt] << 18 | Zh[dt];
var pt = Rl[nt] & 31, At = Zh[dt] & 31;
J += eh[pt] + nh[At], ++rt[257 + pt], ++mt[At], L = R + nt, ++ct;
} else
q[P++] = t[R], ++rt[t[R]];
}
}
for (R = Math.max(R, L); R < u; ++R)
q[P++] = t[R], ++rt[t[R]];
v = $h(t, c, d, q, rt, mt, J, P, D, R - D, v), d || (o.r = v & 7 | c[v / 8 | 0] << 3, v -= 7, o.h = T, o.p = F, o.i = R, o.w = L);
} else {
for (var R = o.w || 0; R < u + d; R += 65535) {
var St = R + 65535;
St >= u && (c[v / 8 | 0] = d, St = u), v = bc(c, v + 1, t.subarray(R, St));
}
o.i = u;
}
return d1(l, 0, r + mc(v) + a);
}, _c = function() {
var t = 1, n = 0;
return {
p: function(e) {
for (var r = t, a = n, o = e.length | 0, u = 0; u != o; ) {
for (var l = Math.min(u + 2655, o); u < l; ++u) a += r += e[u];
r = (r & 65535) + 15 * (r >> 16), a = (a & 65535) + 15 * (a >> 16);
}
t = r, n = a;
},
d: function() {
return t %= 65521, n %= 65521, (t & 255) << 24 | (t & 65280) << 8 | (n & 255) << 8 | n >> 8;
}
};
}, v1 = function(t, n, e, r, a) {
if (!a && (a = { l: 1 }, n.dictionary)) {
var o = n.dictionary.subarray(-32768), u = new sr(o.length + t.length);
u.set(o), u.set(t, o.length), t = u, a.w = o.length;
}
return g1(t, n.level == null ? 6 : n.level, n.mem == null ? a.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(t.length))) * 1.5) : 20 : 12 + n.mem, e, r, a);
}, yc = function(t, n, e) {
for (; e; ++n) t[n] = e, e >>>= 8;
}, m1 = function(t, n) {
var e = n.level, r = e == 0 ? 0 : e < 6 ? 1 : e == 9 ? 3 : 2;
if (t[0] = 120, t[1] = r << 6 | (n.dictionary && 32), t[1] |= 31 - (t[0] << 8 | t[1]) % 31, n.dictionary) {
var a = _c();
a.p(n.dictionary), yc(t, 2, a.d());
}
};
function ql(t, n) {
n || (n = {});
var e = _c();
e.p(t);
var r = v1(t, n, n.dictionary ? 6 : 2, 4);
return m1(r, n), yc(r, r.length - 4, e.d()), r;
}
var b1 = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), w1 = 0;
try {
b1.decode(wc, { stream: !0 }), w1 = 1;
} catch {
}
function _1(t) {
if (Array.isArray(t)) return t;
}
function y1(t, n) {
var e = t == null ? null : typeof Symbol < "u" && t[Symbol.iterator] || t["@@iterator"];
if (e != null) {
var r, a, o, u, l = [], c = !0, d = !1;
try {
if (o = (e = e.call(t)).next, n === 0) {
if (Object(e) !== e) return;
c = !1;
} else for (; !(c = (r = o.call(e)).done) && (l.push(r.value), l.length !== n); c = !0) ;
} catch (v) {
d = !0, a = v;
} finally {
try {
if (!c && e.return != null && (u = e.return(), Object(u) !== u)) return;
} finally {
if (d) throw a;
}
}
return l;
}
}
function Kh(t, n) {
(n == null || n > t.length) && (n = t.length);
for (var e = 0, r = Array(n); e < n; e++) r[e] = t[e];
return r;
}
function A1(t, n) {
if (t) {
if (typeof t == "string") return Kh(t, n);
var e = {}.toString.call(t).slice(8, -1);
return e === "Object" && t.constructor && (e = t.constructor.name), e === "Map" || e === "Set" ? Array.from(t) : e === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e) ? Kh(t, n) : void 0;
}
}
function x1() {
throw new TypeError(`Invalid attempt to destructure non-iterable instance.
In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
}
function Jh(t, n) {
return _1(t) || y1(t, n) || A1(t, n) || x1();
}
function Xh(t, n = "utf8") {
return new TextDecoder(n).decode(t);
}
var N1 = new TextEncoder();
function L1(t) {
return N1.encode(t);
}
var S1 = 1024 * 8, k1 = (() => {
const t = /* @__PURE__ */ new Uint8Array(4), n = new Uint32Array(t.buffer);
return !((n[0] = 1) & t[0]);
})(), cl = {
int8: globalThis.Int8Array,
uint8: globalThis.Uint8Array,
int16: globalThis.Int16Array,
uint16: globalThis.Uint16Array,
int32: globalThis.Int32Array,
uint32: globalThis.Uint32Array,
uint64: globalThis.BigUint64Array,
int64: globalThis.BigInt64Array,
float32: globalThis.Float32Array,
float64: globalThis.Float64Array
}, P1 = class Ac {
buffer;
byteLength;
byteOffset;
length;
offset;
lastWrittenByte;
littleEndian;
_data;
_mark;
_marks;
constructor(n = S1, e = {}) {
let r = !1;
typeof n == "number" ? n = new ArrayBuffer(n) : (r = !0, this.lastWrittenByte = n.byteLength);
const a = e.offset ? e.offset >>> 0 : 0, o = n.byteLength - a;
let u = a;
(ArrayBuffer.isView(n) || n instanceof Ac) && (n.byteLength !== n.buffer.byteLength && (u = n.byteOffset + a), n = n.buffer), r ? this.lastWrittenByte = o : this.lastWrittenByte = 0, this.buffer = n, this.length = o, this.byteLength = o, this.byteOffset = u, this.offset = 0, this.littleEndian = !0, this._data = new DataView(this.buffer, u, o), this._mark = 0, this._marks = [];
}
available(n = 1) {
return this.offset + n <= this.length;
}
isLittleEndian() {
return this.littleEndian;
}
setLittleEndian() {
return this.littleEndian = !0, this;
}
isBigEndian() {
return !this.littleEndian;
}
setBigEndian() {
return this.littleEndian = !1, this;
}
skip(n = 1) {
return this.offset += n, this;
}
back(n = 1) {
return this.offset -= n, this;
}
seek(n) {
return this.offset = n, this;
}
mark() {
return this._mark = this.offset, this;
}
reset() {
return this.offset = this._mark, this;
}
pushMark() {
return this._marks.push(this.offset), this;
}
popMark() {
const n = this._marks.pop();
if (n === void 0) throw new Error("Mark stack empty");
return this.seek(n), this;
}
rewind() {
return this.offset = 0, this;
}
ensureAvailable(n = 1) {
if (!this.available(n)) {
const e = (this.offset + n) * 2, r = new Uint8Array(e);
r.set(new Uint8Array(this.buffer)), this.buffer = r.buffer, this.length = e, this.byteLength = e, this._data = new DataView(this.buffer);
}
return this;
}
readBoolean() {
return this.readUint8() !== 0;
}
readInt8() {
return this._data.getInt8(this.offset++);
}
readUint8() {
return this._data.getUint8(this.offset++);
}
readByte() {
return this.readUint8();
}
readBytes(n = 1) {
return this.readArray(n, "uint8");
}
readArray(n, e) {
const r = cl[e].BYTES_PER_ELEMENT * n, a = this.byteOffset + this.offset, o = this.buffer.slice(a, a + r);
if (this.littleEndian === k1 && e !== "uint8" && e !== "int8") {
const l = new Uint8Array(this.buffer.slice(a, a + r));
l.reverse();
const c = new cl[e](l.buffer);
return this.offset += r, c.reverse(), c;
}
const u = new cl[e](o);
return this.offset += r, u;
}
readInt16() {
const n = this._data.getInt16(this.offset, this.littleEndian);
return this.offset += 2, n;
}
readUint16() {
const n = this._data.getUint16(this.offset, this.littleEndian);
return this.offset += 2, n;
}
readInt32() {
const n = this._data.getInt32(this.offset, this.littleEndian);
return this.offset += 4, n;
}
readUint32() {
const n = this._data.getUint32(this.offset, this.littleEndian);
return this.offset += 4, n;
}
readFloat32() {
const n = this._data.getFloat32(this.offset, this.littleEndian);
return this.offset += 4, n;
}
readFloat64() {
const n = this._data.getFloat64(this.offset, this.littleEndian);
return this.offset += 8, n;
}
readBigInt64() {
const n = this._data.getBigInt64(this.offset, this.littleEndian);
return this.offset += 8, n;
}
readBigUint64() {
const n = this._data.getBigUint64(this.offset, this.littleEndian);
return this.offset += 8, n;
}
readChar() {
return String.fromCharCode(this.readInt8());
}
readChars(n = 1) {
let e = "";
for (let r = 0; r < n; r++) e += this.readChar();
return e;
}
readUtf8(n = 1) {
return Xh(this.readBytes(n));
}
decodeText(n = 1, e = "utf8") {
return Xh(this.readBytes(n), e);
}
writeBoolean(n) {
return this.writeUint8(n ? 255 : 0), this;
}
writeInt8(n) {
return this.ensureAvailable(1), this._data.setInt8(this.offset++, n), this._updateLastWrittenByte(), this;
}
writeUint8(n) {
return this.ensureAvailable(1), this._data.setUint8(this.offset++, n), this._updateLastWrittenByte(), this;
}
writeByte(n) {
return this.writeUint8(n);
}
writeBytes(n) {
this.ensureAvailable(n.length);
for (let e = 0; e < n.length; e++) this._data.setUint8(this.offset++, n[e]);
return this._updateLastWrittenByte(), this;
}
writeInt16(n) {
return this.ensureAvailable(2), this._data.setInt16(this.offset, n, this.littleEndian), this.offset += 2, this._updateLastWrittenByte(), this;
}
writeUint16(n) {
return this.ensureAvailable(2), this._data.setUint16(this.offset, n, this.littleEndian), this.offset += 2, this._updateLastWrittenByte(), this;
}
writeInt32(n) {
return this.ensureAvailable(4), this._data.setInt32(this.offset, n, this.littleEndian), this.offset += 4, this._updateLastWrittenByte(), this;
}
writeUint32(n) {
return this.ensureAvailable(4), this._data.setUint32(this.offset, n, this.littleEndian), this.offset += 4, this._updateLastWrittenByte(), this;
}
writeFloat32(n) {
return this.ensureAvailable(4), this._data.setFloat32(this.offset, n, this.littleEndian), this.offset += 4, this._updateLastWrittenByte(), this;
}
writeFloat64(n) {
return this.ensureAvailable(8), this._data.setFloat64(this.offset, n, this.littleEndian), this.offset += 8, this._updateLastWrittenByte(), this;
}
writeBigInt64(n) {
return this.ensureAvailable(8), this._data.setBigInt64(this.offset, n, this.littleEndian), this.offset += 8, this._updateLastWrittenByte(), this;
}
writeBigUint64(n) {
return this.ensureAvailable(8), this._data.setBigUint64(this.offset, n, this.littleEndian), this.offset += 8, this._updateLastWrittenByte(), this;
}
writeChar(n) {
return this.writeUint8(n.charCodeAt(0));
}
writeChars(n) {
for (let e = 0; e < n.length; e++) this.writeUint8(n.charCodeAt(e));
return this;
}
writeUtf8(n) {
return this.writeBytes(L1(n));
}
toArray() {
return new Uint8Array(this.buffer, this.byteOffset, this.lastWrittenByte);
}
getWrittenByteLength() {
return this.lastWrittenByte - this.byteOffset;
}
_updateLastWrittenByte() {
this.offset > this.lastWrittenByte && (this.lastWrittenByte = this.offset);
}
}, E1 = 4, Qh = 0, tu = 1, I1 = 2;
function Pa(t) {
let n = t.length;
for (; --n >= 0; ) t[n] = 0;
}
var F1 = 0, xc = 1, C1 = 2, Nc = 29, rh = 256, Lc = 286, ya = 30, ih = 19, Sc = 573, so = 15, fl = 16, O1 = 7, ah = 256, kc = 16, Pc = 17, Ec = 18, Ul = new Uint8Array([
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
]), fs = new Uint8Array([
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
]), j1 = new Uint8Array([
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
2,
3,
7
]), Ic = new Uint8Array([
16,
17,
18,
0,
8,
7,
9,
6,
10,
5,
11,
4,
12,
3,
13,
2,
14,
1,
15
]), B1 = 512, Wr = new Array(288 * 2);
Pa(Wr);
var lo = new Array(ya * 2);
Pa(lo);
var co = new Array(B1);
Pa(co);
var fo = new Array(256);
Pa(fo);
var oh = new Array(Nc);
Pa(oh);
var _s = new Array(ya);
Pa(_s);
function dl(t, n, e, r, a) {
this.static_tree = t, this.extra_bits = n, this.extra_base = e, this.elems = r, this.max_length = a, this.has_stree = t && t.length;
}
var Fc, Cc, Oc;
function pl(t, n) {
this.dyn_tree = t, this.max_code = 0, this.stat_desc = n;
}
var jc = (t) => t < 256 ? co[t] : co[256 + (t >>> 7)], po = (t, n) => {
t.pending_buf[t.pending++] = n & 255, t.pending_buf[t.pending++] = n >>> 8 & 255;
}, Fn = (t, n, e) => {
t.bi_valid > fl - e ? (t.bi_buf |= n << t.bi_valid & 65535, po(t, t.bi_buf), t.bi_buf = n >> fl - t.bi_valid, t.bi_valid += e - fl) : (t.bi_buf |= n << t.bi_valid & 65535, t.bi_valid += e);
}, Ar = (t, n, e) => {
Fn(t, e[n * 2], e[n * 2 + 1]);
}, Bc = (t, n) => {
let e = 0;
do
e |= t & 1, t >>>= 1, e <<= 1;
while (--n > 0);
return e >>> 1;
}, T1 = (t) => {
t.bi_valid === 16 ? (po(t, t.bi_buf), t.bi_buf = 0, t.bi_valid = 0) : t.bi_valid >= 8 && (t.pending_buf[t.pending++] = t.bi_buf & 255, t.bi_buf >>= 8, t.bi_valid -= 8);
}, R1 = (t, n) => {
const e = n.dyn_tree, r = n.max_code, a = n.stat_desc.static_tree, o = n.stat_desc.has_stree, u = n.stat_desc.extra_bits, l = n.stat_desc.extra_base, c = n.stat_desc.max_length;
let d, v, y, N, p, j, F = 0;
for (N = 0; N <= so; N++) t.bl_count[N] = 0;
for (e[t.heap[t.heap_max] * 2 + 1] = 0, d = t.heap_max + 1; d < Sc; d++)
v = t.heap[d], N = e[e[v * 2 + 1] * 2 + 1] + 1, N > c && (N = c, F++), e[v * 2 + 1] = N, !(v > r) && (t.bl_count[N]++, p = 0, v >= l && (p = u[v - l]), j = e[v * 2], t.opt_len += j * (N + p), o && (t.static_len += j * (a[v * 2 + 1] + p)));
if (F !== 0) {
do {
for (N = c - 1; t.bl_count[N] === 0; ) N--;
t.bl_count[N]--, t.bl_count[N + 1] += 2, t.bl_count[c]--, F -= 2;
} while (F > 0);
for (N = c; N !== 0; N--)
for (v = t.bl_count[N]; v !== 0; )
y = t.heap[--d], !(y > r) && (e[y * 2 + 1] !== N && (t.opt_len += (N - e[y * 2 + 1]) * e[y * 2], e[y * 2 + 1] = N), v--);
}
}, Tc = (t, n, e) => {
const r = new Array(16);
let a = 0, o, u;
for (o = 1; o <= so; o++)
a = a + e[o - 1] << 1, r[o] = a;
for (u = 0; u <= n; u++) {
let l = t[u * 2 + 1];
l !== 0 && (t[u * 2] = Bc(r[l]++, l));
}
}, M1 = () => {
let t, n, e, r, a;
const o = new Array(16);
for (e = 0, r = 0; r < Nc - 1; r++)
for (oh[r] = e, t = 0; t < 1 << Ul[r]; t++) fo[e++] = r;
for (fo[e - 1] = r, a = 0, r = 0; r < 16; r++)
for (_s[r] = a, t = 0; t < 1 << fs[r]; t++) co[a++] = r;
for (a >>= 7; r < ya; r++)
for (_s[r] = a << 7, t = 0; t < 1 << fs[r] - 7; t++) co[256 + a++] = r;
for (n = 0; n <= so; n++) o[n] = 0;
for (t = 0; t <= 143; )
Wr[t * 2 + 1] = 8, t++, o[8]++;
for (; t <= 255; )
Wr[t * 2 + 1] = 9, t++, o[9]++;
for (; t <= 279; )
Wr[t * 2 + 1] = 7, t++, o[7]++;
for (; t <= 287; )
Wr[t * 2 + 1] = 8, t++, o[8]++;
for (Tc(Wr, 287, o), t = 0; t < ya; t++)
lo[t * 2 + 1] = 5, lo[t * 2] = Bc(t, 5);
Fc = new dl(Wr, Ul, 257, Lc, so), Cc = new dl(lo, fs, 0, ya, so), Oc = new dl(new Array(0), j1, 0, ih, O1);
}, Rc = (t) => {
let n;
for (n = 0; n < Lc; n++) t.dyn_ltree[n * 2] = 0;
for (n = 0; n < ya; n++) t.dyn_dtree[n * 2] = 0;
for (n = 0; n < ih; n++) t.bl_tree[n * 2] = 0;
t.dyn_ltree[ah * 2] = 1, t.opt_len = t.static_len = 0, t.sym_next = t.matches = 0;
}, Mc = (t) => {
t.bi_valid > 8 ? po(t, t.bi_buf) : t.bi_valid > 0 && (t.pending_buf[t.pending++] = t.bi_buf), t.bi_buf = 0, t.bi_valid = 0;
}, eu = (t, n, e, r) => {
const a = n * 2, o = e * 2;
return t[a] < t[o] || t[a] === t[o] && r[n] <= r[e];
}, gl = (t, n, e) => {
const r = t.heap[e];
let a = e << 1;
for (; a <= t.heap_len && (a < t.heap_len && eu(n, t.heap[a + 1], t.heap[a], t.depth) && a++, !eu(n, r, t.heap[a], t.depth)); )
t.heap[e] = t.heap[a], e = a, a <<= 1;
t.heap[e] = r;
}, nu = (t, n, e) => {
let r, a, o = 0, u, l;
if (t.sym_next !== 0) do
r = t.pending_buf[t.sym_buf + o++] & 255, r += (t.pending_buf[t.sym_buf + o++] & 255) << 8, a = t.pending_buf[t.sym_buf + o++], r === 0 ? Ar(t, a, n) : (u = fo[a], Ar(t, u + rh + 1, n), l = Ul[u], l !== 0 && (a -= oh[u], Fn(t, a, l)), r--, u = jc(r), Ar(t, u, e), l = fs[u], l !== 0 && (r -= _s[u], Fn(t, r, l)));
while (o < t.sym_next);
Ar(t, ah, n);
}, zl = (t, n) => {
const e = n.dyn_tree, r = n.stat_desc.static_tree, a = n.stat_desc.has_stree, o = n.stat_desc.elems;
let u, l, c = -1, d;
for (t.heap_len = 0, t.heap_max = Sc, u = 0; u < o; u++) e[u * 2] !== 0 ? (t.heap[++t.heap_len] = c = u, t.depth[u] = 0) : e[u * 2 + 1] = 0;
for (; t.heap_len < 2; )
d = t.heap[++t.heap_len] = c < 2 ? ++c : 0, e[d * 2] = 1, t.depth[d] = 0, t.opt_len--, a && (t.static_len -= r[d * 2 + 1]);
for (n.max_code = c, u = t.heap_len >> 1; u >= 1; u--) gl(t, e, u);
d = o;
do
u = t.heap[1], t.heap[1] = t.heap[t.heap_len--], gl(t, e, 1), l = t.heap[1], t.heap[--t.heap_max] = u, t.heap[--t.heap_max] = l, e[d * 2] = e[u * 2] + e[l * 2], t.depth[d] = (t.depth[u] >= t.depth[l] ? t.depth[u] : t.depth[l]) + 1, e[u * 2 + 1] = e[l * 2 + 1] = d, t.heap[1] = d++, gl(t, e, 1);
while (t.heap_len >= 2);
t.heap[--t.heap_max] = t.heap[1], R1(t, n), Tc(e, c, t.bl_count);
}, ru = (t, n, e) => {
let r, a = -1, o, u = n[1], l = 0, c = 7, d = 4;
for (u === 0 && (c = 138, d = 3), n[(e + 1) * 2 + 1] = 65535, r = 0; r <= e; r++)
o = u, u = n[(r + 1) * 2 + 1], !(++l < c && o === u) && (l < d ? t.bl_tree[o * 2] += l : o !== 0 ? (o !== a && t.bl_tree[o * 2]++, t.bl_tree[kc * 2]++) : l <= 10 ? t.bl_tree[Pc * 2]++ : t.bl_tree[Ec * 2]++, l = 0, a = o, u === 0 ? (c = 138, d = 3) : o === u ? (c = 6, d = 3) : (c = 7, d = 4));
}, iu = (t, n, e) => {
let r, a = -1, o, u = n[1], l = 0, c = 7, d = 4;
for (u === 0 && (c = 138, d = 3), r = 0; r <= e; r++)
if (o = u, u = n[(r + 1) * 2 + 1], !(++l < c && o === u)) {
if (l < d) do
Ar(t, o, t.bl_tree);
while (--l !== 0);
else o !== 0 ? (o !== a && (Ar(t, o, t.bl_tree), l--), Ar(t, kc, t.bl_tree), Fn(t, l - 3, 2)) : l <= 10 ? (Ar(t, Pc, t.bl_tree), Fn(t, l - 3, 3)) : (Ar(t, Ec, t.bl_tree), Fn(t, l - 11, 7));
l = 0, a = o, u === 0 ? (c = 138, d = 3) : o === u ? (c = 6, d = 3) : (c = 7, d = 4);
}
}, D1 = (t) => {
let n;
for (ru(t, t.dyn_ltree, t.l_desc.max_code), ru(t, t.dyn_dtree, t.d_desc.max_code), zl(t, t.bl_desc), n = ih - 1; n >= 3 && t.bl_tree[Ic[n] * 2 + 1] === 0; n--) ;
return t.opt_len += 3 * (n + 1) + 5 + 5 + 4, n;
}, q1 = (t, n, e, r) => {
let a;
for (Fn(t, n - 257, 5), Fn(t, e - 1, 5), Fn(t, r - 4, 4), a = 0; a < r; a++) Fn(t, t.bl_tree[Ic[a] * 2 + 1], 3);
iu(t, t.dyn_ltree, n - 1), iu(t, t.dyn_dtree, e - 1);
}, U1 = (t) => {
let n = 4093624447, e;
for (e = 0; e <= 31; e++, n >>>= 1) if (n & 1 && t.dyn_ltree[e * 2] !== 0) return Qh;
if (t.dyn_ltree[18] !== 0 || t.dyn_ltree[20] !== 0 || t.dyn_ltree[26] !== 0) return tu;
for (e = 32; e < rh; e++) if (t.dyn_ltree[e * 2] !== 0) return tu;
return Qh;
}, au = !1, z1 = (t) => {
au || (M1(), au = !0), t.l_desc = new pl(t.dyn_ltree, Fc), t.d_desc = new pl(t.dyn_dtree, Cc), t.bl_desc = new pl(t.bl_tree, Oc), t.bi_buf = 0, t.bi_valid = 0, Rc(t);
}, Dc = (t, n, e, r) => {
Fn(t, (F1 << 1) + (r ? 1 : 0), 3), Mc(t), po(t, e), po(t, ~e), e && t.pending_buf.set(t.window.subarray(n, n + e), t.pending), t.pending += e;
}, H1 = (t) => {
Fn(t, xc << 1, 3), Ar(t, ah, Wr), T1(t);
}, W1 = (t, n, e, r) => {
let a, o, u = 0;
t.level > 0 ? (t.strm.data_type === I1 && (t.strm.data_type = U1(t)), zl(t, t.l_desc), zl(t, t.d_desc), u = D1(t), a = t.opt_len + 3 + 7 >>> 3, o = t.static_len + 3 + 7 >>> 3, o <= a && (a = o)) : a = o = e + 5, e + 4 <= a && n !== -1 ? Dc(t, n, e, r) : t.strategy === E1 || o === a ? (Fn(t, (xc << 1) + (r ? 1 : 0), 3), nu(t, Wr, lo)) : (Fn(t, (C1 << 1) + (r ? 1 : 0), 3), q1(t, t.l_desc.max_code + 1, t.d_desc.max_code + 1, u + 1), nu(t, t.dyn_ltree, t.dyn_dtree)), Rc(t), r && Mc(t);
}, G1 = (t, n, e) => (t.pending_buf[t.sym_buf + t.sym_next++] = n, t.pending_buf[t.sym_buf + t.sym_next++] = n >> 8, t.pending_buf[t.sym_buf + t.sym_next++] = e, n === 0 ? t.dyn_ltree[e * 2]++ : (t.matches++, n--, t.dyn_ltree[(fo[e] + rh + 1) * 2]++, t.dyn_dtree[jc(n) * 2]++), t.sym_next === t.sym_end), V1 = {
_tr_init: z1,
_tr_stored_block: Dc,
_tr_flush_block: W1,
_tr_tally: G1,
_tr_align: H1
}, Z1 = (t, n, e, r) => {
let a = t & 65535 | 0, o = t >>> 16 & 65535 | 0, u = 0;
for (; e !== 0; ) {
u = e > 2e3 ? 2e3 : e, e -= u;
do
a = a + n[r++] | 0, o = o + a | 0;
while (--u);
a %= 65521, o %= 65521;
}
return a | o << 16 | 0;
}, go = Z1, Y1 = () => {
let t, n = [];
for (var e = 0; e < 256; e++) {
t = e;
for (var r = 0; r < 8; r++) t = t & 1 ? 3988292384 ^ t >>> 1 : t >>> 1;
n[e] = t;
}
return n;
}, $1 = new Uint32Array(Y1()), K1 = (t, n, e, r) => {
const a = $1, o = r + e;
t ^= -1;
for (let u = r; u < o; u++) t = t >>> 8 ^ a[(t ^ n[u]) & 255];
return t ^ -1;
}, an = K1, Ui = {
2: "need dictionary",
1: "stream end",
0: "",
"-1": "file error",
"-2": "stream error",
"-3": "data error",
"-4": "insufficient memory",
"-5": "buffer error",
"-6": "incompatible version"
}, Ea = {
Z_NO_FLUSH: 0,
Z_PARTIAL_FLUSH: 1,
Z_SYNC_FLUSH: 2,
Z_FULL_FLUSH: 3,
Z_FINISH: 4,
Z_BLOCK: 5,
Z_TREES: 6,
Z_OK: 0,
Z_STREAM_END: 1,
Z_NEED_DICT: 2,
Z_ERRNO: -1,
Z_STREAM_ERROR: -2,
Z_DATA_ERROR: -3,
Z_MEM_ERROR: -4,
Z_BUF_ERROR: -5,
Z_NO_COMPRESSION: 0,
Z_BEST_SPEED: 1,
Z_BEST_COMPRESSION: 9,
Z_DEFAULT_COMPRESSION: -1,
Z_FILTERED: 1,
Z_HUFFMAN_ONLY: 2,
Z_RLE: 3,
Z_FIXED: 4,
Z_DEFAULT_STRATEGY: 0,
Z_BINARY: 0,
Z_TEXT: 1,
Z_UNKNOWN: 2,
Z_DEFLATED: 8
}, { _tr_init: J1, _tr_stored_block: Hl, _tr_flush_block: X1, _tr_tally: ci, _tr_align: Q1 } = V1, { Z_NO_FLUSH: fi, Z_PARTIAL_FLUSH: t2, Z_FULL_FLUSH: e2, Z_FINISH: Jn, Z_BLOCK: ou, Z_OK: fn, Z_STREAM_END: su, Z_STREAM_ERROR: Nr, Z_DATA_ERROR: n2, Z_BUF_ERROR: vl, Z_DEFAULT_COMPRESSION: r2, Z_FILTERED: i2, Z_HUFFMAN_ONLY: ns, Z_RLE: a2, Z_FIXED: o2, Z_DEFAULT_STRATEGY: s2, Z_UNKNOWN: l2, Z_DEFLATED: Ls } = Ea, h2 = 9, u2 = 15, c2 = 8, f2 = 573, ve = 3, Ti = 258, Lr = 262, d2 = 32, Sa = 42, sh = 57, Wl = 69, Gl = 73, Vl = 91, Zl = 103, Ri = 113, io = 666, kn = 1, Ia = 2, zi = 3, Fa = 4, p2 = 3, Mi = (t, n) => (t.msg = Ui[n], n), lu = (t) => t * 2 - (t > 4 ? 9 : 0), hi = (t) => {
let n = t.length;
for (; --n >= 0; ) t[n] = 0;
}, g2 = (t) => {
let n, e, r, a = t.w_size;
n = t.hash_size, r = n;
do
e = t.head[--r], t.head[r] = e >= a ? e - a : 0;
while (--n);
n = a, r = n;
do
e = t.prev[--r], t.prev[r] = e >= a ? e - a : 0;
while (--n);
}, v2 = (t, n, e) => (n << t.hash_shift ^ e) & t.hash_mask, di = v2, Un = (t) => {
const n = t.state;
let e = n.pending;
e > t.avail_out && (e = t.avail_out), e !== 0 && (t.output.set(n.pending_buf.subarray(n.pending_out, n.pending_out + e), t.next_out), t.next_out += e, n.pending_out += e, t.total_out += e, t.avail_out -= e, n.pending -= e, n.pending === 0 && (n.pending_out = 0));
}, Hn = (t, n) => {
X1(t, t.block_start >= 0 ? t.block_start : -1, t.strstart - t.block_start, n), t.block_start = t.strstart, Un(t.strm);
}, be = (t, n) => {
t.pending_buf[t.pending++] = n;
}, ro = (t, n) => {
t.pending_buf[t.pending++] = n >>> 8 & 255, t.pending_buf[t.pending++] = n & 255;
}, Yl = (t, n, e, r) => {
let a = t.avail_in;
return a > r && (a = r), a === 0 ? 0 : (t.avail_in -= a, n.set(t.input.subarray(t.next_in, t.next_in + a), e), t.state.wrap === 1 ? t.adler = go(t.adler, n, a, e) : t.state.wrap === 2 && (t.adler = an(t.adler, n, a, e)), t.next_in += a, t.total_in += a, a);
}, qc = (t, n) => {
let e = t.max_chain_length, r = t.strstart, a, o, u = t.prev_length, l = t.nice_match;
const c = t.strstart > t.w_size - Lr ? t.strstart - (t.w_size - Lr) : 0, d = t.window, v = t.w_mask, y = t.prev, N = t.strstart + Ti;
let p = d[r + u - 1], j = d[r + u];
t.prev_length >= t.good_match && (e >>= 2), l > t.lookahead && (l = t.lookahead);
do
if (a = n, !(d[a + u] !== j || d[a + u - 1] !== p || d[a] !== d[r] || d[++a] !== d[r + 1])) {
r += 2, a++;
do
;
while (d[++r] === d[++a] && d[++r] === d[++a] && d[++r] === d[++a] && d[++r] === d[++a] && d[++r] === d[++a] && d[++r] === d[++a] && d[++r] === d[++a] && d[++r] === d[++a] && r < N);
if (o = Ti - (N - r), r = N - Ti, o > u) {
if (t.match_start = n, u = o, o >= l) break;
p = d[r + u - 1], j = d[r + u];
}
}
while ((n = y[n & v]) > c && --e !== 0);
return u <= t.lookahead ? u : t.lookahead;
}, ka = (t) => {
const n = t.w_size;
let e, r, a;
do {
if (r = t.window_size - t.lookahead - t.strstart, t.strstart >= n + (n - Lr) && (t.window.set(t.window.subarray(n, n + n - r), 0), t.match_start -= n, t.strstart -= n, t.block_start -= n, t.insert > t.strstart && (t.insert = t.strstart), g2(t), r += n), t.strm.avail_in === 0) break;
if (e = Yl(t.strm, t.window, t.strstart + t.lookahead, r), t.lookahead += e, t.lookahead + t.insert >= ve)
for (a = t.strstart - t.insert, t.ins_h = t.window[a], t.ins_h = di(t, t.ins_h, t.window[a + 1]); t.insert && (t.ins_h = di(t, t.ins_h, t.window[a + ve - 1]), t.prev[a & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = a, a++, t.insert--, !(t.lookahead + t.insert < ve)); )
;
} while (t.lookahead < Lr && t.strm.avail_in !== 0);
}, Uc = (t, n) => {
let e = t.pending_buf_size - 5 > t.w_size ? t.w_size : t.pending_buf_size - 5, r, a, o, u = 0, l = t.strm.avail_in;
do {
if (r = 65535, o = t.bi_valid + 42 >> 3, t.strm.avail_out < o || (o = t.strm.avail_out - o, a = t.strstart - t.block_start, r > a + t.strm.avail_in && (r = a + t.strm.avail_in), r > o && (r = o), r < e && (r === 0 && n !== Jn || n === fi || r !== a + t.strm.avail_in))) break;
u = n === Jn && r === a + t.strm.avail_in ? 1 : 0, Hl(t, 0, 0, u), t.pending_buf[t.pending - 4] = r, t.pending_buf[t.pending - 3] = r >> 8, t.pending_buf[t.pending - 2] = ~r, t.pending_buf[t.pending - 1] = ~r >> 8, Un(t.strm), a && (a > r && (a = r), t.strm.output.set(t.window.subarray(t.block_start, t.block_start + a), t.strm.next_out), t.strm.next_out += a, t.strm.avail_out -= a, t.strm.total_out += a, t.block_start += a, r -= a), r && (Yl(t.strm, t.strm.output, t.strm.next_out, r), t.strm.next_out += r, t.strm.avail_out -= r, t.strm.total_out += r);
} while (u === 0);
return l -= t.strm.avail_in, l && (l >= t.w_size ? (t.matches = 2, t.window.set(t.strm.input.subarray(t.strm.next_in - t.w_size, t.strm.next_in), 0), t.strstart = t.w_size, t.insert = t.strstart) : (t.window_size - t.strstart <= l && (t.strstart -= t.w_size, t.window.set(t.window.subarray(t.w_size, t.w_size + t.strstart), 0), t.matches < 2 && t.matches++, t.insert > t.strstart && (t.insert = t.strstart)), t.window.set(t.strm.input.subarray(t.strm.next_in - l, t.strm.next_in), t.strstart), t.strstart += l, t.insert += l > t.w_size - t.insert ? t.w_size - t.insert : l), t.block_start = t.strstart), t.high_water < t.strstart && (t.high_water = t.strstart), u ? Fa : n !== fi && n !== Jn && t.strm.avail_in === 0 && t.strstart === t.block_start ? Ia : (o = t.window_size - t.strstart, t.strm.avail_in > o && t.block_start >= t.w_size && (t.block_start -= t.w_size, t.strstart -= t.w_size, t.window.set(t.window.subarray(t.w_size, t.w_size + t.strstart), 0), t.matches < 2 && t.matches++, o += t.w_size, t.insert > t.strstart && (t.insert = t.strstart)), o > t.strm.avail_in && (o = t.strm.avail_in), o && (Yl(t.strm, t.window, t.strstart, o), t.strstart += o, t.insert += o > t.w_size - t.insert ? t.w_size - t.insert : o), t.high_water < t.strstart && (t.high_water = t.strstart), o = t.bi_valid + 42 >> 3, o = t.pending_buf_size - o > 65535 ? 65535 : t.pending_buf_size - o, e = o > t.w_size ? t.w_size : o, a = t.strstart - t.block_start, (a >= e || (a || n === Jn) && n !== fi && t.strm.avail_in === 0 && a <= o) && (r = a > o ? o : a, u = n === Jn && t.strm.avail_in === 0 && r === a ? 1 : 0, Hl(t, t.block_start, r, u), t.block_start += r, Un(t.strm)), u ? zi : kn);
}, ml = (t, n) => {
let e, r;
for (; ; ) {
if (t.lookahead < Lr) {
if (ka(t), t.lookahead < Lr && n === fi) return kn;
if (t.lookahead === 0) break;
}
if (e = 0, t.lookahead >= ve && (t.ins_h = di(t, t.ins_h, t.window[t.strstart + ve - 1]), e = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), e !== 0 && t.strstart - e <= t.w_size - Lr && (t.match_length = qc(t, e)), t.match_length >= ve)
if (r = ci(t, t.strstart - t.match_start, t.match_length - ve), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= ve) {
t.match_length--;
do
t.strstart++, t.ins_h = di(t, t.ins_h, t.window[t.strstart + ve - 1]), e = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart;
while (--t.match_length !== 0);
t.strstart++;
} else
t.strstart += t.match_length, t.match_length = 0, t.ins_h = t.window[t.strstart], t.ins_h = di(t, t.ins_h, t.window[t.strstart + 1]);
else
r = ci(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
if (r && (Hn(t, !1), t.strm.avail_out === 0))
return kn;
}
return t.insert = t.strstart < ve - 1 ? t.strstart : ve - 1, n === Jn ? (Hn(t, !0), t.strm.avail_out === 0 ? zi : Fa) : t.sym_next && (Hn(t, !1), t.strm.avail_out === 0) ? kn : Ia;
}, ga = (t, n) => {
let e, r, a;
for (; ; ) {
if (t.lookahead < Lr) {
if (ka(t), t.lookahead < Lr && n === fi) return kn;
if (t.lookahead === 0) break;
}
if (e = 0, t.lookahead >= ve && (t.ins_h = di(t, t.ins_h, t.window[t.strstart + ve - 1]), e = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = ve - 1, e !== 0 && t.prev_length < t.max_lazy_match && t.strstart - e <= t.w_size - Lr && (t.match_length = qc(t, e), t.match_length <= 5 && (t.strategy === i2 || t.match_length === ve && t.strstart - t.match_start > 4096) && (t.match_length = ve - 1)), t.prev_length >= ve && t.match_length <= t.prev_length) {
a = t.strstart + t.lookahead - ve, r = ci(t, t.strstart - 1 - t.prev_match, t.prev_length - ve), t.lookahead -= t.prev_length - 1, t.prev_length -= 2;
do
++t.strstart <= a && (t.ins_h = di(t, t.ins_h, t.window[t.strstart + ve - 1]), e = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart);
while (--t.prev_length !== 0);
if (t.match_available = 0, t.match_length = ve - 1, t.strstart++, r && (Hn(t, !1), t.strm.avail_out === 0))
return kn;
} else if (t.match_available) {
if (r = ci(t, 0, t.window[t.strstart - 1]), r && Hn(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0) return kn;
} else
t.match_available = 1, t.strstart++, t.lookahead--;
}
return t.match_available && (r = ci(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < ve - 1 ? t.strstart : ve - 1, n === Jn ? (Hn(t, !0), t.strm.avail_out === 0 ? zi : Fa) : t.sym_next && (Hn(t, !1), t.strm.avail_out === 0) ? kn : Ia;
}, m2 = (t, n) => {
let e, r, a, o;
const u = t.window;
for (; ; ) {
if (t.lookahead <= Ti) {
if (ka(t), t.lookahead <= Ti && n === fi) return kn;
if (t.lookahead === 0) break;
}
if (t.match_length = 0, t.lookahead >= ve && t.strstart > 0 && (a = t.strstart - 1, r = u[a], r === u[++a] && r === u[++a] && r === u[++a])) {
o = t.strstart + Ti;
do
;
while (r === u[++a] && r === u[++a] && r === u[++a] && r === u[++a] && r === u[++a] && r === u[++a] && r === u[++a] && r === u[++a] && a < o);
t.match_length = Ti - (o - a), t.match_length > t.lookahead && (t.match_length = t.lookahead);
}
if (t.match_length >= ve ? (e = ci(t, 1, t.match_length - ve), t.lookahead -= t.match_length, t.strstart += t.match_length, t.match_length = 0) : (e = ci(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++), e && (Hn(t, !1), t.strm.avail_out === 0))
return kn;
}
return t.insert = 0, n === Jn ? (Hn(t, !0), t.strm.avail_out === 0 ? zi : Fa) : t.sym_next && (Hn(t, !1), t.strm.avail_out === 0) ? kn : Ia;
}, b2 = (t, n) => {
let e;
for (; ; ) {
if (t.lookahead === 0 && (ka(t), t.lookahead === 0)) {
if (n === fi) return kn;
break;
}
if (t.match_length = 0, e = ci(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++, e && (Hn(t, !1), t.strm.avail_out === 0))
return kn;
}
return t.insert = 0, n === Jn ? (Hn(t, !0), t.strm.avail_out === 0 ? zi : Fa) : t.sym_next && (Hn(t, !1), t.strm.avail_out === 0) ? kn : Ia;
};
function _r(t, n, e, r, a) {
this.good_length = t, this.max_lazy = n, this.nice_length = e, this.max_chain = r, this.func = a;
}
var ao = [
new _r(0, 0, 0, 0, Uc),
new _r(4, 4, 8, 4, ml),
new _r(4, 5, 16, 8, ml),
new _r(4, 6, 32, 32, ml),
new _r(4, 4, 16, 16, ga),
new _r(8, 16, 32, 32, ga),
new _r(8, 16, 128, 128, ga),
new _r(8, 32, 128, 256, ga),
new _r(32, 128, 258, 1024, ga),
new _r(32, 258, 258, 4096, ga)
], w2 = (t) => {
t.window_size = 2 * t.w_size, hi(t.head), t.max_lazy_match = ao[t.level].max_lazy, t.good_match = ao[t.level].good_length, t.nice_match = ao[t.level].nice_length, t.max_chain_length = ao[t.level].max_chain, t.strstart = 0, t.block_start = 0, t.lookahead = 0, t.insert = 0, t.match_length = t.prev_length = ve - 1, t.match_available = 0, t.ins_h = 0;
};
function _2() {
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = Ls, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Uint16Array(f2 * 2), this.dyn_dtree = /* @__PURE__ */ new Uint16Array(122), this.bl_tree = /* @__PURE__ */ new Uint16Array(78), hi(this.dyn_ltree), hi(this.dyn_dtree), hi(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = /* @__PURE__ */ new Uint16Array(16), this.heap = /* @__PURE__ */ new Uint16Array(573), hi(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = /* @__PURE__ */ new Uint16Array(573), hi(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
}
var wo = (t) => {
if (!t) return 1;
const n = t.state;
return !n || n.strm !== t || n.status !== Sa && n.status !== sh && n.status !== Wl && n.status !== Gl && n.status !== Vl && n.status !== Zl && n.status !== Ri && n.status !== io ? 1 : 0;
}, zc = (t) => {
if (wo(t)) return Mi(t, Nr);
t.total_in = t.total_out = 0, t.data_type = l2;
const n = t.state;
return n.pending = 0, n.pending_out = 0, n.wrap < 0 && (n.wrap = -n.wrap), n.status = n.wrap === 2 ? sh : n.wrap ? Sa : Ri, t.adler = n.wrap === 2 ? 0 : 1, n.last_flush = -2, J1(n), fn;
}, Hc = (t) => {
const n = zc(t);
return n === fn && w2(t.state), n;
}, y2 = (t, n) => wo(t) || t.state.wrap !== 2 ? Nr : (t.state.gzhead = n, fn), Wc = (t, n, e, r, a, o) => {
if (!t) return Nr;
let u = 1;
if (n === r2 && (n = 6), r < 0 ? (u = 0, r = -r) : r > 15 && (u = 2, r -= 16), a < 1 || a > h2 || e !== Ls || r < 8 || r > 15 || n < 0 || n > 9 || o < 0 || o > o2 || r === 8 && u !== 1) return Mi(t, Nr);
r === 8 && (r = 9);
const l = new _2();
return t.state = l, l.strm = t, l.status = Sa, l.wrap = u, l.gzhead = null, l.w_bits = r, l.w_size = 1 << l.w_bits, l.w_mask = l.w_size - 1, l.hash_bits = a + 7, l.hash_size = 1 << l.hash_bits, l.hash_mask = l.hash_size - 1, l.hash_shift = ~~((l.hash_bits + ve - 1) / ve), l.window = new Uint8Array(l.w_size * 2), l.head = new Uint16Array(l.hash_size), l.prev = new Uint16Array(l.w_size), l.lit_bufsize = 1 << a + 6, l.pending_buf_size = l.lit_bufsize * 4, l.pending_buf = new Uint8Array(l.pending_buf_size), l.sym_buf = l.lit_bufsize, l.sym_end = (l.lit_bufsize - 1) * 3, l.level = n, l.strategy = o, l.method = e, Hc(t);
}, A2 = (t, n) => Wc(t, n, Ls, u2, c2, s2), x2 = (t, n) => {
if (wo(t) || n > ou || n < 0) return t ? Mi(t, Nr) : Nr;
const e = t.state;
if (!t.output || t.avail_in !== 0 && !t.input || e.status === io && n !== Jn) return Mi(t, t.avail_out === 0 ? vl : Nr);
const r = e.last_flush;
if (e.last_flush = n, e.pending !== 0) {
if (Un(t), t.avail_out === 0)
return e.last_flush = -1, fn;
} else if (t.avail_in === 0 && lu(n) <= lu(r) && n !== Jn) return Mi(t, vl);
if (e.status === io && t.avail_in !== 0) return Mi(t, vl);
if (e.status === Sa && e.wrap === 0 && (e.status = Ri), e.status === Sa) {
let a = Ls + (e.w_bits - 8 << 4) << 8, o = -1;
if (e.strategy >= ns || e.level < 2 ? o = 0 : e.level < 6 ? o = 1 : e.level === 6 ? o = 2 : o = 3, a |= o << 6, e.strstart !== 0 && (a |= d2), a += 31 - a % 31, ro(e, a), e.strstart !== 0 && (ro(e, t.adler >>> 16), ro(e, t.adler & 65535)), t.adler = 1, e.status = Ri, Un(t), e.pending !== 0)
return e.last_flush = -1, fn;
}
if (e.status === sh) {
if (t.adler = 0, be(e, 31), be(e, 139), be(e, 8), e.gzhead)
be(e, (e.gzhead.text ? 1 : 0) + (e.gzhead.hcrc ? 2 : 0) + (e.gzhead.extra ? 4 : 0) + (e.gzhead.name ? 8 : 0) + (e.gzhead.comment ? 16 : 0)), be(e, e.gzhead.time & 255), be(e, e.gzhead.time >> 8 & 255), be(e, e.gzhead.time >> 16 & 255), be(e, e.gzhead.time >> 24 & 255), be(e, e.level === 9 ? 2 : e.strategy >= ns || e.level < 2 ? 4 : 0), be(e, e.gzhead.os & 255), e.gzhead.extra && e.gzhead.extra.length && (be(e, e.gzhead.extra.length & 255), be(e, e.gzhead.extra.length >> 8 & 255)), e.gzhead.hcrc && (t.adler = an(t.adler, e.pending_buf, e.pending, 0)), e.gzindex = 0, e.status = Wl;
else if (be(e, 0), be(e, 0), be(e, 0), be(e, 0), be(e, 0), be(e, e.level === 9 ? 2 : e.strategy >= ns || e.level < 2 ? 4 : 0), be(e, p2), e.status = Ri, Un(t), e.pending !== 0)
return e.last_flush = -1, fn;
}
if (e.status === Wl) {
if (e.gzhead.extra) {
let a = e.pending, o = (e.gzhead.extra.length & 65535) - e.gzindex;
for (; e.pending + o > e.pending_buf_size; ) {
let l = e.pending_buf_size - e.pending;
if (e.pending_buf.set(e.gzhead.extra.subarray(e.gzindex, e.gzindex + l), e.pending), e.pending = e.pending_buf_size, e.gzhead.hcrc && e.pending > a && (t.adler = an(t.adler, e.pending_buf, e.pending - a, a)), e.gzindex += l, Un(t), e.pending !== 0)
return e.last_flush = -1, fn;
a = 0, o -= l;
}
let u = new Uint8Array(e.gzhead.extra);
e.pending_buf.set(u.subarray(e.gzindex, e.gzindex + o), e.pending), e.pending += o, e.gzhead.hcrc && e.pending > a && (t.adler = an(t.adler, e.pending_buf, e.pending - a, a)), e.gzindex = 0;
}
e.status = Gl;
}
if (e.status === Gl) {
if (e.gzhead.name) {
let a = e.pending, o;
do {
if (e.pending === e.pending_buf_size) {
if (e.gzhead.hcrc && e.pending > a && (t.adler = an(t.adler, e.pending_buf, e.pending - a, a)), Un(t), e.pending !== 0)
return e.last_flush = -1, fn;
a = 0;
}
e.gzindex < e.gzhead.name.length ? o = e.gzhead.name.charCodeAt(e.gzindex++) & 255 : o = 0, be(e, o);
} while (o !== 0);
e.gzhead.hcrc && e.pending > a && (t.adler = an(t.adler, e.pending_buf, e.pending - a, a)), e.gzindex = 0;
}
e.status = Vl;
}
if (e.status === Vl) {
if (e.gzhead.comment) {
let a = e.pending, o;
do {
if (e.pending === e.pending_buf_size) {
if (e.gzhead.hcrc && e.pending > a && (t.adler = an(t.adler, e.pending_buf, e.pending - a, a)), Un(t), e.pending !== 0)
return e.last_flush = -1, fn;
a = 0;
}
e.gzindex < e.gzhead.comment.length ? o = e.gzhead.comment.charCodeAt(e.gzindex++) & 255 : o = 0, be(e, o);
} while (o !== 0);
e.gzhead.hcrc && e.pending > a && (t.adler = an(t.adler, e.pending_buf, e.pending - a, a));
}
e.status = Zl;
}
if (e.status === Zl) {
if (e.gzhead.hcrc) {
if (e.pending + 2 > e.pending_buf_size && (Un(t), e.pending !== 0))
return e.last_flush = -1, fn;
be(e, t.adler & 255), be(e, t.adler >> 8 & 255), t.adler = 0;
}
if (e.status = Ri, Un(t), e.pending !== 0)
return e.last_flush = -1, fn;
}
if (t.avail_in !== 0 || e.lookahead !== 0 || n !== fi && e.status !== io) {
let a = e.level === 0 ? Uc(e, n) : e.strategy === ns ? b2(e, n) : e.strategy === a2 ? m2(e, n) : ao[e.level].func(e, n);
if ((a === zi || a === Fa) && (e.status = io), a === kn || a === zi)
return t.avail_out === 0 && (e.last_flush = -1), fn;
if (a === Ia && (n === t2 ? Q1(e) : n !== ou && (Hl(e, 0, 0, !1), n === e2 && (hi(e.head), e.lookahead === 0 && (e.strstart = 0, e.block_start = 0, e.insert = 0))), Un(t), t.avail_out === 0))
return e.last_flush = -1, fn;
}
return n !== Jn ? fn : e.wrap <= 0 ? su : (e.wrap === 2 ? (be(e, t.adler & 255), be(e, t.adler >> 8 & 255), be(e, t.adler >> 16 & 255), be(e, t.adler >> 24 & 255), be(e, t.total_in & 255), be(e, t.total_in >> 8 & 255), be(e, t.total_in >> 16 & 255), be(e, t.total_in >> 24 & 255)) : (ro(e, t.adler >>> 16), ro(e, t.adler & 65535)), Un(t), e.wrap > 0 && (e.wrap = -e.wrap), e.pending !== 0 ? fn : su);
}, N2 = (t) => {
if (wo(t)) return Nr;
const n = t.state.status;
return t.state = null, n === Ri ? Mi(t, n2) : fn;
}, L2 = (t, n) =>