diff --git a/js_dependencies/JSServe.bundled.js b/js_dependencies/JSServe.bundled.js index bfd99c8c..7ca0a636 100644 --- a/js_dependencies/JSServe.bundled.js +++ b/js_dependencies/JSServe.bundled.js @@ -1960,12 +1960,11 @@ this && this.__generator || function(thisArg, body) { }; } }; -var Mi = 4, xt = 0, kt = 1, Fi = 2; function _e(e) { let i = e.length; for(; --i >= 0;)e[i] = 0; } -var Hi = 0, li = 1, Bi = 2, Ki = 3, Pi = 258, dt = 29, Ae = 256, ge = Ae + 1 + dt, oe = 30, st = 19, ri = 2 * ge + 1, Q = 15, Ge = 16, Xi = 7, ct = 256, fi = 16, oi = 17, _i = 18, ft = new Uint8Array([ +var $i = 0, ai = 1, Ci = 2, Fi = 3, Mi = 258, dt = 29, Ae = 256, ge = Ae + 1 + dt, oe = 30, st = 19, ni = 2 * ge + 1, Q = 15, Ge = 16, Hi = 7, ct = 256, li = 16, ri = 17, fi = 18, ft = new Uint8Array([ 0, 0, 0, @@ -1995,7 +1994,7 @@ var Hi = 0, li = 1, Bi = 2, Ki = 3, Pi = 258, dt = 29, Ae = 256, ge = Ae + 1 + d 5, 5, 0 -]), Ce = new Uint8Array([ +]), $e = new Uint8Array([ 0, 0, 0, @@ -2026,7 +2025,7 @@ var Hi = 0, li = 1, Bi = 2, Ki = 3, Pi = 258, dt = 29, Ae = 256, ge = Ae + 1 + d 12, 13, 13 -]), Yi = new Uint8Array([ +]), Bi = new Uint8Array([ 0, 0, 0, @@ -2046,7 +2045,7 @@ var Hi = 0, li = 1, Bi = 2, Ki = 3, Pi = 258, dt = 29, Ae = 256, ge = Ae + 1 + d 2, 3, 7 -]), hi = new Uint8Array([ +]), oi = new Uint8Array([ 16, 17, 18, @@ -2066,13 +2065,13 @@ var Hi = 0, li = 1, Bi = 2, Ki = 3, Pi = 258, dt = 29, Ae = 256, ge = Ae + 1 + d 14, 1, 15 -]), Gi = 512, B = new Array((ge + 2) * 2); +]), Ki = 512, B = new Array((ge + 2) * 2); _e(B); var ue = new Array(oe * 2); _e(ue); -var pe = new Array(Gi); +var pe = new Array(Ki); _e(pe); -var xe = new Array(Pi - Ki + 1); +var xe = new Array(Mi - Fi + 1); _e(xe); var ut = new Array(dt); _e(ut); @@ -2081,27 +2080,27 @@ _e(He); function je(e, i, t, n, a) { this.static_tree = e, this.extra_bits = i, this.extra_base = t, this.elems = n, this.max_length = a, this.has_stree = e && e.length; } -var di, si, ci; +var _i, hi, di; function We(e, i) { this.dyn_tree = e, this.max_code = 0, this.stat_desc = i; } -var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ +var si = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ e.pending_buf[e.pending++] = i & 255, e.pending_buf[e.pending++] = i >>> 8 & 255; }, N = (e, i, t)=>{ e.bi_valid > Ge - t ? (e.bi_buf |= i << e.bi_valid & 65535, ke(e, e.bi_buf), e.bi_buf = i >> Ge - e.bi_valid, e.bi_valid += t - Ge) : (e.bi_buf |= i << e.bi_valid & 65535, e.bi_valid += t); -}, M = (e, i, t)=>{ +}, F = (e, i, t)=>{ N(e, t[i * 2], t[i * 2 + 1]); -}, bi = (e, i)=>{ +}, ci = (e, i)=>{ let t = 0; do t |= e & 1, e >>>= 1, t <<= 1; while (--i > 0) return t >>> 1; -}, ji = (e)=>{ +}, Pi = (e)=>{ e.bi_valid === 16 ? (ke(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8); -}, Wi = (e, i)=>{ +}, Xi = (e, i)=>{ let t = i.dyn_tree, n = i.max_code, a = i.stat_desc.static_tree, l = i.stat_desc.has_stree, o = i.stat_desc.extra_bits, f = i.stat_desc.extra_base, c = i.stat_desc.max_length, r, _, E, s, h, u, m = 0; for(s = 0; s <= Q; s++)e.bl_count[s] = 0; - for(t[e.heap[e.heap_max] * 2 + 1] = 0, r = e.heap_max + 1; r < ri; r++)_ = e.heap[r], s = t[t[_ * 2 + 1] * 2 + 1] + 1, s > c && (s = c, m++), t[_ * 2 + 1] = s, !(_ > n) && (e.bl_count[s]++, h = 0, _ >= f && (h = o[_ - f]), u = t[_ * 2], e.opt_len += u * (s + h), l && (e.static_len += u * (a[_ * 2 + 1] + h))); + for(t[e.heap[e.heap_max] * 2 + 1] = 0, r = e.heap_max + 1; r < ni; r++)_ = e.heap[r], s = t[t[_ * 2 + 1] * 2 + 1] + 1, s > c && (s = c, m++), t[_ * 2 + 1] = s, !(_ > n) && (e.bl_count[s]++, h = 0, _ >= f && (h = o[_ - f]), u = t[_ * 2], e.opt_len += u * (s + h), l && (e.static_len += u * (a[_ * 2 + 1] + h))); if (m !== 0) { do { for(s = c - 1; e.bl_count[s] === 0;)s--; @@ -2109,97 +2108,97 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ }while (m > 0) for(s = c; s !== 0; s--)for(_ = e.bl_count[s]; _ !== 0;)E = e.heap[--r], !(E > n) && (t[E * 2 + 1] !== s && (e.opt_len += (s - t[E * 2 + 1]) * t[E * 2], t[E * 2 + 1] = s), _--); } -}, wi = (e, i, t)=>{ +}, ui = (e, i, t)=>{ let n = new Array(Q + 1), a = 0, l, o; for(l = 1; l <= Q; l++)n[l] = a = a + t[l - 1] << 1; for(o = 0; o <= i; o++){ let f = e[o * 2 + 1]; - f !== 0 && (e[o * 2] = bi(n[f]++, f)); + f !== 0 && (e[o * 2] = ci(n[f]++, f)); } -}, Vi = ()=>{ +}, Yi = ()=>{ let e, i, t, n, a, l = new Array(Q + 1); for(t = 0, n = 0; n < dt - 1; n++)for(ut[n] = t, e = 0; e < 1 << ft[n]; e++)xe[t++] = n; - for(xe[t - 1] = n, a = 0, n = 0; n < 16; n++)for(He[n] = a, e = 0; e < 1 << Ce[n]; e++)pe[a++] = n; - for(a >>= 7; n < oe; n++)for(He[n] = a << 7, e = 0; e < 1 << Ce[n] - 7; e++)pe[256 + a++] = n; + for(xe[t - 1] = n, a = 0, n = 0; n < 16; n++)for(He[n] = a, e = 0; e < 1 << $e[n]; e++)pe[a++] = n; + for(a >>= 7; n < oe; n++)for(He[n] = a << 7, e = 0; e < 1 << $e[n] - 7; e++)pe[256 + a++] = n; for(i = 0; i <= Q; i++)l[i] = 0; for(e = 0; e <= 143;)B[e * 2 + 1] = 8, e++, l[8]++; for(; e <= 255;)B[e * 2 + 1] = 9, e++, l[9]++; for(; e <= 279;)B[e * 2 + 1] = 7, e++, l[7]++; for(; e <= 287;)B[e * 2 + 1] = 8, e++, l[8]++; - for(wi(B, ge + 1, l), e = 0; e < oe; e++)ue[e * 2 + 1] = 5, ue[e * 2] = bi(e, 5); - di = new je(B, ft, Ae + 1, ge, Q), si = new je(ue, Ce, 0, oe, Q), ci = new je(new Array(0), Yi, 0, st, Xi); -}, gi = (e)=>{ + for(ui(B, ge + 1, l), e = 0; e < oe; e++)ue[e * 2 + 1] = 5, ue[e * 2] = ci(e, 5); + _i = new je(B, ft, Ae + 1, ge, Q), hi = new je(ue, $e, 0, oe, Q), di = new je(new Array(0), Bi, 0, st, Hi); +}, bi = (e)=>{ let i; for(i = 0; i < ge; i++)e.dyn_ltree[i * 2] = 0; for(i = 0; i < oe; i++)e.dyn_dtree[i * 2] = 0; for(i = 0; i < st; i++)e.bl_tree[i * 2] = 0; e.dyn_ltree[ct * 2] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0; -}, pi = (e)=>{ +}, wi = (e)=>{ e.bi_valid > 8 ? ke(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0; -}, Ji = (e, i, t, n)=>{ - pi(e), n && (ke(e, t), ke(e, ~t)), e.pending_buf.set(e.window.subarray(i, i + t), e.pending), e.pending += t; -}, vt = (e, i, t, n)=>{ +}, Gi = (e, i, t, n)=>{ + wi(e), n && (ke(e, t), ke(e, ~t)), e.pending_buf.set(e.window.subarray(i, i + t), e.pending), e.pending += t; +}, xt = (e, i, t, n)=>{ let a = i * 2, l = t * 2; return e[a] < e[l] || e[a] === e[l] && n[i] <= n[t]; }, Ve = (e, i, t)=>{ let n = e.heap[t], a = t << 1; - for(; a <= e.heap_len && (a < e.heap_len && vt(i, e.heap[a + 1], e.heap[a], e.depth) && a++, !vt(i, n, e.heap[a], e.depth));)e.heap[t] = e.heap[a], t = a, a <<= 1; + for(; a <= e.heap_len && (a < e.heap_len && xt(i, e.heap[a + 1], e.heap[a], e.depth) && a++, !xt(i, n, e.heap[a], e.depth));)e.heap[t] = e.heap[a], t = a, a <<= 1; e.heap[t] = n; -}, Et = (e, i, t)=>{ +}, kt = (e, i, t)=>{ let n, a, l = 0, o, f; - if (e.last_lit !== 0) do n = e.pending_buf[e.d_buf + l * 2] << 8 | e.pending_buf[e.d_buf + l * 2 + 1], a = e.pending_buf[e.l_buf + l], l++, n === 0 ? M(e, a, i) : (o = xe[a], M(e, o + Ae + 1, i), f = ft[o], f !== 0 && (a -= ut[o], N(e, a, f)), n--, o = ui(n), M(e, o, t), f = Ce[o], f !== 0 && (n -= He[o], N(e, n, f))); + if (e.last_lit !== 0) do n = e.pending_buf[e.d_buf + l * 2] << 8 | e.pending_buf[e.d_buf + l * 2 + 1], a = e.pending_buf[e.l_buf + l], l++, n === 0 ? F(e, a, i) : (o = xe[a], F(e, o + Ae + 1, i), f = ft[o], f !== 0 && (a -= ut[o], N(e, a, f)), n--, o = si(n), F(e, o, t), f = $e[o], f !== 0 && (n -= He[o], N(e, n, f))); while (l < e.last_lit) - M(e, ct, i); + F(e, ct, i); }, ot = (e, i)=>{ let t = i.dyn_tree, n = i.stat_desc.static_tree, a = i.stat_desc.has_stree, l = i.stat_desc.elems, o, f, c = -1, r; - for(e.heap_len = 0, e.heap_max = ri, o = 0; o < l; o++)t[o * 2] !== 0 ? (e.heap[++e.heap_len] = c = o, e.depth[o] = 0) : t[o * 2 + 1] = 0; + for(e.heap_len = 0, e.heap_max = ni, o = 0; o < l; o++)t[o * 2] !== 0 ? (e.heap[++e.heap_len] = c = o, e.depth[o] = 0) : t[o * 2 + 1] = 0; for(; e.heap_len < 2;)r = e.heap[++e.heap_len] = c < 2 ? ++c : 0, t[r * 2] = 1, e.depth[r] = 0, e.opt_len--, a && (e.static_len -= n[r * 2 + 1]); for(i.max_code = c, o = e.heap_len >> 1; o >= 1; o--)Ve(e, t, o); r = l; do o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], Ve(e, t, 1), f = e.heap[1], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = f, t[r * 2] = t[o * 2] + t[f * 2], e.depth[r] = (e.depth[o] >= e.depth[f] ? e.depth[o] : e.depth[f]) + 1, t[o * 2 + 1] = t[f * 2 + 1] = r, e.heap[1] = r++, Ve(e, t, 1); while (e.heap_len >= 2) - e.heap[--e.heap_max] = e.heap[1], Wi(e, i), wi(t, c, e.bl_count); -}, yt = (e, i, t)=>{ + e.heap[--e.heap_max] = e.heap[1], Xi(e, i), ui(t, c, e.bl_count); +}, vt = (e, i, t)=>{ let n, a = -1, l, o = i[0 * 2 + 1], f = 0, c = 7, r = 4; - for(o === 0 && (c = 138, r = 3), i[(t + 1) * 2 + 1] = 65535, n = 0; n <= t; n++)l = o, o = i[(n + 1) * 2 + 1], !(++f < c && l === o) && (f < r ? e.bl_tree[l * 2] += f : l !== 0 ? (l !== a && e.bl_tree[l * 2]++, e.bl_tree[fi * 2]++) : f <= 10 ? e.bl_tree[oi * 2]++ : e.bl_tree[_i * 2]++, f = 0, a = l, o === 0 ? (c = 138, r = 3) : l === o ? (c = 6, r = 3) : (c = 7, r = 4)); -}, St = (e, i, t)=>{ + for(o === 0 && (c = 138, r = 3), i[(t + 1) * 2 + 1] = 65535, n = 0; n <= t; n++)l = o, o = i[(n + 1) * 2 + 1], !(++f < c && l === o) && (f < r ? e.bl_tree[l * 2] += f : l !== 0 ? (l !== a && e.bl_tree[l * 2]++, e.bl_tree[li * 2]++) : f <= 10 ? e.bl_tree[ri * 2]++ : e.bl_tree[fi * 2]++, f = 0, a = l, o === 0 ? (c = 138, r = 3) : l === o ? (c = 6, r = 3) : (c = 7, r = 4)); +}, Et = (e, i, t)=>{ let n, a = -1, l, o = i[0 * 2 + 1], f = 0, c = 7, r = 4; for(o === 0 && (c = 138, r = 3), n = 0; n <= t; n++)if (l = o, o = i[(n + 1) * 2 + 1], !(++f < c && l === o)) { - if (f < r) do M(e, l, e.bl_tree); + if (f < r) do F(e, l, e.bl_tree); while (--f !== 0) - else l !== 0 ? (l !== a && (M(e, l, e.bl_tree), f--), M(e, fi, e.bl_tree), N(e, f - 3, 2)) : f <= 10 ? (M(e, oi, e.bl_tree), N(e, f - 3, 3)) : (M(e, _i, e.bl_tree), N(e, f - 11, 7)); + else l !== 0 ? (l !== a && (F(e, l, e.bl_tree), f--), F(e, li, e.bl_tree), N(e, f - 3, 2)) : f <= 10 ? (F(e, ri, e.bl_tree), N(e, f - 3, 3)) : (F(e, fi, e.bl_tree), N(e, f - 11, 7)); f = 0, a = l, o === 0 ? (c = 138, r = 3) : l === o ? (c = 6, r = 3) : (c = 7, r = 4); } -}, Qi = (e)=>{ +}, ji = (e)=>{ let i; - for(yt(e, e.dyn_ltree, e.l_desc.max_code), yt(e, e.dyn_dtree, e.d_desc.max_code), ot(e, e.bl_desc), i = st - 1; i >= 3 && e.bl_tree[hi[i] * 2 + 1] === 0; i--); + for(vt(e, e.dyn_ltree, e.l_desc.max_code), vt(e, e.dyn_dtree, e.d_desc.max_code), ot(e, e.bl_desc), i = st - 1; i >= 3 && e.bl_tree[oi[i] * 2 + 1] === 0; i--); return e.opt_len += 3 * (i + 1) + 5 + 5 + 4, i; -}, qi = (e, i, t, n)=>{ +}, Wi = (e, i, t, n)=>{ let a; - for(N(e, i - 257, 5), N(e, t - 1, 5), N(e, n - 4, 4), a = 0; a < n; a++)N(e, e.bl_tree[hi[a] * 2 + 1], 3); - St(e, e.dyn_ltree, i - 1), St(e, e.dyn_dtree, t - 1); -}, ea = (e)=>{ + for(N(e, i - 257, 5), N(e, t - 1, 5), N(e, n - 4, 4), a = 0; a < n; a++)N(e, e.bl_tree[oi[a] * 2 + 1], 3); + Et(e, e.dyn_ltree, i - 1), Et(e, e.dyn_dtree, t - 1); +}, Vi = (e)=>{ let i = 4093624447, t; - for(t = 0; t <= 31; t++, i >>>= 1)if (i & 1 && e.dyn_ltree[t * 2] !== 0) return xt; - if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0) return kt; - for(t = 32; t < Ae; t++)if (e.dyn_ltree[t * 2] !== 0) return kt; - return xt; -}, At = !1, ta = (e)=>{ - At || (Vi(), At = !0), e.l_desc = new We(e.dyn_ltree, di), e.d_desc = new We(e.dyn_dtree, si), e.bl_desc = new We(e.bl_tree, ci), e.bi_buf = 0, e.bi_valid = 0, gi(e); -}, xi = (e, i, t, n)=>{ - N(e, (Hi << 1) + (n ? 1 : 0), 3), Ji(e, i, t, !0); -}, ia = (e)=>{ - N(e, li << 1, 3), M(e, ct, B), ji(e); -}, aa = (e, i, t, n)=>{ + for(t = 0; t <= 31; t++, i >>>= 1)if (i & 1 && e.dyn_ltree[t * 2] !== 0) return 0; + if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0) return 1; + for(t = 32; t < Ae; t++)if (e.dyn_ltree[t * 2] !== 0) return 1; + return 0; +}, yt = !1, Ji = (e)=>{ + yt || (Yi(), yt = !0), e.l_desc = new We(e.dyn_ltree, _i), e.d_desc = new We(e.dyn_dtree, hi), e.bl_desc = new We(e.bl_tree, di), e.bi_buf = 0, e.bi_valid = 0, bi(e); +}, gi = (e, i, t, n)=>{ + N(e, ($i << 1) + (n ? 1 : 0), 3), Gi(e, i, t, !0); +}, Qi = (e)=>{ + N(e, ai << 1, 3), F(e, ct, B), Pi(e); +}, qi = (e, i, t, n)=>{ let a, l, o = 0; - e.level > 0 ? (e.strm.data_type === Fi && (e.strm.data_type = ea(e)), ot(e, e.l_desc), ot(e, e.d_desc), o = Qi(e), a = e.opt_len + 3 + 7 >>> 3, l = e.static_len + 3 + 7 >>> 3, l <= a && (a = l)) : a = l = t + 5, t + 4 <= a && i !== -1 ? xi(e, i, t, n) : e.strategy === Mi || l === a ? (N(e, (li << 1) + (n ? 1 : 0), 3), Et(e, B, ue)) : (N(e, (Bi << 1) + (n ? 1 : 0), 3), qi(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), Et(e, e.dyn_ltree, e.dyn_dtree)), gi(e), n && pi(e); -}, na = (e, i, t)=>(e.pending_buf[e.d_buf + e.last_lit * 2] = i >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = i & 255, e.pending_buf[e.l_buf + e.last_lit] = t & 255, e.last_lit++, i === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, i--, e.dyn_ltree[(xe[t] + Ae + 1) * 2]++, e.dyn_dtree[ui(i) * 2]++), e.last_lit === e.lit_bufsize - 1), la = ta, ra = xi, fa = aa, oa = na, _a = ia, ha = { - _tr_init: la, - _tr_stored_block: ra, - _tr_flush_block: fa, - _tr_tally: oa, - _tr_align: _a -}, da = (e, i, t, n)=>{ + e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = Vi(e)), ot(e, e.l_desc), ot(e, e.d_desc), o = ji(e), a = e.opt_len + 3 + 7 >>> 3, l = e.static_len + 3 + 7 >>> 3, l <= a && (a = l)) : a = l = t + 5, t + 4 <= a && i !== -1 ? gi(e, i, t, n) : e.strategy === 4 || l === a ? (N(e, (ai << 1) + (n ? 1 : 0), 3), kt(e, B, ue)) : (N(e, (Ci << 1) + (n ? 1 : 0), 3), Wi(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, o + 1), kt(e, e.dyn_ltree, e.dyn_dtree)), bi(e), n && wi(e); +}, ea = (e, i, t)=>(e.pending_buf[e.d_buf + e.last_lit * 2] = i >>> 8 & 255, e.pending_buf[e.d_buf + e.last_lit * 2 + 1] = i & 255, e.pending_buf[e.l_buf + e.last_lit] = t & 255, e.last_lit++, i === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, i--, e.dyn_ltree[(xe[t] + Ae + 1) * 2]++, e.dyn_dtree[si(i) * 2]++), e.last_lit === e.lit_bufsize - 1), ta = Ji, ia = gi, aa = qi, na = ea, la = Qi, ra = { + _tr_init: ta, + _tr_stored_block: ia, + _tr_flush_block: aa, + _tr_tally: na, + _tr_align: la +}, fa = (e, i, t, n)=>{ let a = e & 65535 | 0, l = e >>> 16 & 65535 | 0, o = 0; for(; t !== 0;){ o = t > 2e3 ? 2e3 : t, t -= o; @@ -2208,7 +2207,7 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ a %= 65521, l %= 65521; } return a | l << 16 | 0; -}, ve = da, sa = ()=>{ +}, ve = fa, oa = ()=>{ let e, i = []; for(var t = 0; t < 256; t++){ e = t; @@ -2216,12 +2215,12 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ i[t] = e; } return i; -}, ca = new Uint32Array(sa()), ua = (e, i, t, n)=>{ - let a = ca, l = n + t; +}, _a = new Uint32Array(oa()), ha = (e, i, t, n)=>{ + let a = _a, l = n + t; e ^= -1; for(let o = n; o < l; o++)e = e >>> 8 ^ a[(e ^ i[o]) & 255]; return e ^ -1; -}, I = ua, ee = { +}, I = ha, ee = { 2: "need dictionary", 1: "stream end", 0: "", @@ -2260,23 +2259,23 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ Z_TEXT: 1, Z_UNKNOWN: 2, Z_DEFLATED: 8 -}, { _tr_init: ba , _tr_stored_block: wa , _tr_flush_block: ga , _tr_tally: j , _tr_align: pa } = ha, { Z_NO_FLUSH: le , Z_PARTIAL_FLUSH: xa , Z_FULL_FLUSH: ka , Z_FINISH: W , Z_BLOCK: Rt , Z_OK: F , Z_STREAM_END: zt , Z_STREAM_ERROR: L , Z_DATA_ERROR: va , Z_BUF_ERROR: Je , Z_DEFAULT_COMPRESSION: Ea , Z_FILTERED: ya , Z_HUFFMAN_ONLY: Ie , Z_RLE: Sa , Z_FIXED: Aa , Z_DEFAULT_STRATEGY: Ra , Z_UNKNOWN: za , Z_DEFLATED: Pe } = ne, Ta = 9, ma = 15, Da = 8, Za = 29, Ia = 256, _t = Ia + 1 + Za, Oa = 30, Na = 19, La = 2 * _t + 1, Ua = 15, k = 3, Y = 258, C = Y + k + 1, Ca = 32, Xe = 42, ht = 69, $e = 73, Me = 91, Fe = 103, q = 113, se = 666, D = 1, Re = 2, te = 3, he = 4, $a = 3, G = (e, i)=>(e.msg = ee[i], i), Tt = (e)=>(e << 1) - (e > 4 ? 9 : 0), X = (e)=>{ +}, { _tr_init: da , _tr_stored_block: sa , _tr_flush_block: ca , _tr_tally: j , _tr_align: ua } = ra, { Z_NO_FLUSH: le , Z_PARTIAL_FLUSH: ba , Z_FULL_FLUSH: wa , Z_FINISH: W , Z_BLOCK: St , Z_OK: M , Z_STREAM_END: At , Z_STREAM_ERROR: L , Z_DATA_ERROR: ga , Z_BUF_ERROR: Je , Z_DEFAULT_COMPRESSION: pa , Z_FILTERED: xa , Z_HUFFMAN_ONLY: Ie , Z_RLE: ka , Z_FIXED: va , Z_DEFAULT_STRATEGY: Ea , Z_UNKNOWN: ya , Z_DEFLATED: Pe } = ne, Sa = 9, Aa = 15, Ra = 8, za = 29, Ta = 256, _t = Ta + 1 + za, ma = 30, Da = 19, Za = 2 * _t + 1, Ia = 15, k = 3, Y = 258, $ = Y + k + 1, Oa = 32, Xe = 42, ht = 69, Ce = 73, Fe = 91, Me = 103, q = 113, se = 666, D = 1, Re = 2, te = 3, he = 4, Na = 3, G = (e, i)=>(e.msg = ee[i], i), Rt = (e)=>(e << 1) - (e > 4 ? 9 : 0), X = (e)=>{ let i = e.length; for(; --i >= 0;)e[i] = 0; -}, Ma = (e, i, t)=>(i << e.hash_shift ^ t) & e.hash_mask, V = Ma, P = (e)=>{ +}, La = (e, i, t)=>(i << e.hash_shift ^ t) & e.hash_mask, V = La, P = (e)=>{ let i = e.state, t = i.pending; t > e.avail_out && (t = e.avail_out), t !== 0 && (e.output.set(i.pending_buf.subarray(i.pending_out, i.pending_out + t), e.next_out), e.next_out += t, i.pending_out += t, e.total_out += t, e.avail_out -= t, i.pending -= t, i.pending === 0 && (i.pending_out = 0)); }, O = (e, i)=>{ - ga(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, i), e.block_start = e.strstart, P(e.strm); + ca(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, i), e.block_start = e.strstart, P(e.strm); }, y = (e, i)=>{ e.pending_buf[e.pending++] = i; }, de = (e, i)=>{ e.pending_buf[e.pending++] = i >>> 8 & 255, e.pending_buf[e.pending++] = i & 255; -}, Fa = (e, i, t, n)=>{ +}, Ua = (e, i, t, n)=>{ let a = e.avail_in; return a > n && (a = n), a === 0 ? 0 : (e.avail_in -= a, i.set(e.input.subarray(e.next_in, e.next_in + a), t), e.state.wrap === 1 ? e.adler = ve(e.adler, i, a, t) : e.state.wrap === 2 && (e.adler = I(e.adler, i, a, t)), e.next_in += a, e.total_in += a, a); -}, ki = (e, i)=>{ - let t = e.max_chain_length, n = e.strstart, a, l, o = e.prev_length, f = e.nice_match, c = e.strstart > e.w_size - C ? e.strstart - (e.w_size - C) : 0, r = e.window, _ = e.w_mask, E = e.prev, s = e.strstart + Y, h = r[n + o - 1], u = r[n + o]; +}, pi = (e, i)=>{ + let t = e.max_chain_length, n = e.strstart, a, l, o = e.prev_length, f = e.nice_match, c = e.strstart > e.w_size - $ ? e.strstart - (e.w_size - $) : 0, r = e.window, _ = e.w_mask, E = e.prev, s = e.strstart + Y, h = r[n + o - 1], u = r[n + o]; e.prev_length >= e.good_match && (t >>= 2), f > e.lookahead && (f = e.lookahead); do if (a = i, !(r[a + o] !== u || r[a + o - 1] !== h || r[a] !== r[n] || r[++a] !== r[n + 1])) { n += 2, a++; @@ -2292,7 +2291,7 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ }, ie = (e)=>{ let i = e.w_size, t, n, a, l, o; do { - if (l = e.window_size - e.lookahead - e.strstart, e.strstart >= i + (i - C)) { + if (l = e.window_size - e.lookahead - e.strstart, e.strstart >= i + (i - $)) { e.window.set(e.window.subarray(i, i + i), 0), e.match_start -= i, e.strstart -= i, e.block_start -= i, n = e.hash_size, t = n; do a = e.head[--t], e.head[t] = a >= i ? a - i : 0; while (--n) @@ -2302,9 +2301,9 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ l += i; } if (e.strm.avail_in === 0) break; - if (n = Fa(e.strm, e.window, e.strstart + e.lookahead, l), e.lookahead += n, e.lookahead + e.insert >= k) for(o = e.strstart - e.insert, e.ins_h = e.window[o], e.ins_h = V(e, e.ins_h, e.window[o + 1]); e.insert && (e.ins_h = V(e, e.ins_h, e.window[o + k - 1]), e.prev[o & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = o, o++, e.insert--, !(e.lookahead + e.insert < k));); - }while (e.lookahead < C && e.strm.avail_in !== 0) -}, Ha = (e, i)=>{ + if (n = Ua(e.strm, e.window, e.strstart + e.lookahead, l), e.lookahead += n, e.lookahead + e.insert >= k) for(o = e.strstart - e.insert, e.ins_h = e.window[o], e.ins_h = V(e, e.ins_h, e.window[o + 1]); e.insert && (e.ins_h = V(e, e.ins_h, e.window[o + k - 1]), e.prev[o & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = o, o++, e.insert--, !(e.lookahead + e.insert < k));); + }while (e.lookahead < $ && e.strm.avail_in !== 0) +}, $a = (e, i)=>{ let t = 65535; for(t > e.pending_buf_size - 5 && (t = e.pending_buf_size - 5);;){ if (e.lookahead <= 1) { @@ -2313,17 +2312,17 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ } e.strstart += e.lookahead, e.lookahead = 0; let n = e.block_start + t; - if ((e.strstart === 0 || e.strstart >= n) && (e.lookahead = e.strstart - n, e.strstart = n, O(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - C && (O(e, !1), e.strm.avail_out === 0)) return D; + if ((e.strstart === 0 || e.strstart >= n) && (e.lookahead = e.strstart - n, e.strstart = n, O(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - $ && (O(e, !1), e.strm.avail_out === 0)) return D; } return e.insert = 0, i === W ? (O(e, !0), e.strm.avail_out === 0 ? te : he) : (e.strstart > e.block_start && (O(e, !1), e.strm.avail_out === 0), D); }, Qe = (e, i)=>{ let t, n; for(;;){ - if (e.lookahead < C) { - if (ie(e), e.lookahead < C && i === le) return D; + if (e.lookahead < $) { + if (ie(e), e.lookahead < $ && i === le) return D; if (e.lookahead === 0) break; } - if (t = 0, e.lookahead >= k && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - C && (e.match_length = ki(e, t)), e.match_length >= k) if (n = j(e, e.strstart - e.match_start, e.match_length - k), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= k) { + if (t = 0, e.lookahead >= k && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - $ && (e.match_length = pi(e, t)), e.match_length >= k) if (n = j(e, e.strstart - e.match_start, e.match_length - k), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= k) { e.match_length--; do e.strstart++, e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart; while (--e.match_length !== 0) @@ -2336,11 +2335,11 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ }, re = (e, i)=>{ let t, n, a; for(;;){ - if (e.lookahead < C) { - if (ie(e), e.lookahead < C && i === le) return D; + if (e.lookahead < $) { + if (ie(e), e.lookahead < $ && i === le) return D; if (e.lookahead === 0) break; } - if (t = 0, e.lookahead >= k && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = k - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - C && (e.match_length = ki(e, t), e.match_length <= 5 && (e.strategy === ya || e.match_length === k && e.strstart - e.match_start > 4096) && (e.match_length = k - 1)), e.prev_length >= k && e.match_length <= e.prev_length) { + if (t = 0, e.lookahead >= k && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = k - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - $ && (e.match_length = pi(e, t), e.match_length <= 5 && (e.strategy === xa || e.match_length === k && e.strstart - e.match_start > 4096) && (e.match_length = k - 1)), e.prev_length >= k && e.match_length <= e.prev_length) { a = e.strstart + e.lookahead - k, n = j(e, e.strstart - 1 - e.prev_match, e.prev_length - k), e.lookahead -= e.prev_length - 1, e.prev_length -= 2; do ++e.strstart <= a && (e.ins_h = V(e, e.ins_h, e.window[e.strstart + k - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart); while (--e.prev_length !== 0) @@ -2350,7 +2349,7 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ } else e.match_available = 1, e.strstart++, e.lookahead--; } return e.match_available && (n = j(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < k - 1 ? e.strstart : k - 1, i === W ? (O(e, !0), e.strm.avail_out === 0 ? te : he) : e.last_lit && (O(e, !1), e.strm.avail_out === 0) ? D : Re; -}, Ba = (e, i)=>{ +}, Ca = (e, i)=>{ let t, n, a, l, o = e.window; for(;;){ if (e.lookahead <= Y) { @@ -2366,7 +2365,7 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ if (e.match_length >= k ? (t = j(e, 1, e.match_length - k), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = j(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && (O(e, !1), e.strm.avail_out === 0)) return D; } return e.insert = 0, i === W ? (O(e, !0), e.strm.avail_out === 0 ? te : he) : e.last_lit && (O(e, !1), e.strm.avail_out === 0) ? D : Re; -}, Ka = (e, i)=>{ +}, Fa = (e, i)=>{ let t; for(;;){ if (e.lookahead === 0 && (ie(e), e.lookahead === 0)) { @@ -2377,58 +2376,58 @@ var ui = (e)=>e < 256 ? pe[e] : pe[256 + (e >>> 7)], ke = (e, i)=>{ } return e.insert = 0, i === W ? (O(e, !0), e.strm.avail_out === 0 ? te : he) : e.last_lit && (O(e, !1), e.strm.avail_out === 0) ? D : Re; }; -function $(e, i, t, n, a) { +function C(e, i, t, n, a) { this.good_length = e, this.max_lazy = i, this.nice_length = t, this.max_chain = n, this.func = a; } var ce = [ - new $(0, 0, 0, 0, Ha), - new $(4, 4, 8, 4, Qe), - new $(4, 5, 16, 8, Qe), - new $(4, 6, 32, 32, Qe), - new $(4, 4, 16, 16, re), - new $(8, 16, 32, 32, re), - new $(8, 16, 128, 128, re), - new $(8, 32, 128, 256, re), - new $(32, 128, 258, 1024, re), - new $(32, 258, 258, 4096, re) -], Pa = (e)=>{ + new C(0, 0, 0, 0, $a), + new C(4, 4, 8, 4, Qe), + new C(4, 5, 16, 8, Qe), + new C(4, 6, 32, 32, Qe), + new C(4, 4, 16, 16, re), + new C(8, 16, 32, 32, re), + new C(8, 16, 128, 128, re), + new C(8, 32, 128, 256, re), + new C(32, 128, 258, 1024, re), + new C(32, 258, 258, 4096, re) +], Ma = (e)=>{ e.window_size = 2 * e.w_size, X(e.head), e.max_lazy_match = ce[e.level].max_lazy, e.good_match = ce[e.level].good_length, e.nice_match = ce[e.level].nice_length, e.max_chain_length = ce[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = k - 1, e.match_available = 0, e.ins_h = 0; }; -function Xa() { - 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 = Pe, 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(La * 2), this.dyn_dtree = new Uint16Array((2 * Oa + 1) * 2), this.bl_tree = new Uint16Array((2 * Na + 1) * 2), X(this.dyn_ltree), X(this.dyn_dtree), X(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(Ua + 1), this.heap = new Uint16Array(2 * _t + 1), X(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * _t + 1), X(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0; +function Ha() { + 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 = Pe, 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(Za * 2), this.dyn_dtree = new Uint16Array((2 * ma + 1) * 2), this.bl_tree = new Uint16Array((2 * Da + 1) * 2), X(this.dyn_ltree), X(this.dyn_dtree), X(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(Ia + 1), this.heap = new Uint16Array(2 * _t + 1), X(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * _t + 1), X(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0; } -var vi = (e)=>{ +var xi = (e)=>{ if (!e || !e.state) return G(e, L); - e.total_in = e.total_out = 0, e.data_type = za; + e.total_in = e.total_out = 0, e.data_type = ya; let i = e.state; - return i.pending = 0, i.pending_out = 0, i.wrap < 0 && (i.wrap = -i.wrap), i.status = i.wrap ? Xe : q, e.adler = i.wrap === 2 ? 0 : 1, i.last_flush = le, ba(i), F; -}, Ei = (e)=>{ - let i = vi(e); - return i === F && Pa(e.state), i; -}, Ya = (e, i)=>!e || !e.state || e.state.wrap !== 2 ? L : (e.state.gzhead = i, F), yi = (e, i, t, n, a, l)=>{ + return i.pending = 0, i.pending_out = 0, i.wrap < 0 && (i.wrap = -i.wrap), i.status = i.wrap ? Xe : q, e.adler = i.wrap === 2 ? 0 : 1, i.last_flush = le, da(i), M; +}, ki = (e)=>{ + let i = xi(e); + return i === M && Ma(e.state), i; +}, Ba = (e, i)=>!e || !e.state || e.state.wrap !== 2 ? L : (e.state.gzhead = i, M), vi = (e, i, t, n, a, l)=>{ if (!e) return L; let o = 1; - if (i === Ea && (i = 6), n < 0 ? (o = 0, n = -n) : n > 15 && (o = 2, n -= 16), a < 1 || a > Ta || t !== Pe || n < 8 || n > 15 || i < 0 || i > 9 || l < 0 || l > Aa) return G(e, L); + if (i === pa && (i = 6), n < 0 ? (o = 0, n = -n) : n > 15 && (o = 2, n -= 16), a < 1 || a > Sa || t !== Pe || n < 8 || n > 15 || i < 0 || i > 9 || l < 0 || l > va) return G(e, L); n === 8 && (n = 9); - let f = new Xa; - return e.state = f, f.strm = e, f.wrap = o, f.gzhead = null, f.w_bits = n, f.w_size = 1 << f.w_bits, f.w_mask = f.w_size - 1, f.hash_bits = a + 7, f.hash_size = 1 << f.hash_bits, f.hash_mask = f.hash_size - 1, f.hash_shift = ~~((f.hash_bits + k - 1) / k), f.window = new Uint8Array(f.w_size * 2), f.head = new Uint16Array(f.hash_size), f.prev = new Uint16Array(f.w_size), f.lit_bufsize = 1 << a + 6, f.pending_buf_size = f.lit_bufsize * 4, f.pending_buf = new Uint8Array(f.pending_buf_size), f.d_buf = 1 * f.lit_bufsize, f.l_buf = (1 + 2) * f.lit_bufsize, f.level = i, f.strategy = l, f.method = t, Ei(e); -}, Ga = (e, i)=>yi(e, i, Pe, ma, Da, Ra), ja = (e, i)=>{ + let f = new Ha; + return e.state = f, f.strm = e, f.wrap = o, f.gzhead = null, f.w_bits = n, f.w_size = 1 << f.w_bits, f.w_mask = f.w_size - 1, f.hash_bits = a + 7, f.hash_size = 1 << f.hash_bits, f.hash_mask = f.hash_size - 1, f.hash_shift = ~~((f.hash_bits + k - 1) / k), f.window = new Uint8Array(f.w_size * 2), f.head = new Uint16Array(f.hash_size), f.prev = new Uint16Array(f.w_size), f.lit_bufsize = 1 << a + 6, f.pending_buf_size = f.lit_bufsize * 4, f.pending_buf = new Uint8Array(f.pending_buf_size), f.d_buf = 1 * f.lit_bufsize, f.l_buf = (1 + 2) * f.lit_bufsize, f.level = i, f.strategy = l, f.method = t, ki(e); +}, Ka = (e, i)=>vi(e, i, Pe, Aa, Ra, Ea), Pa = (e, i)=>{ let t, n; - if (!e || !e.state || i > Rt || i < 0) return e ? G(e, L) : L; + if (!e || !e.state || i > St || i < 0) return e ? G(e, L) : L; let a = e.state; if (!e.output || !e.input && e.avail_in !== 0 || a.status === se && i !== W) return G(e, e.avail_out === 0 ? Je : L); a.strm = e; let l = a.last_flush; - if (a.last_flush = i, a.status === Xe) if (a.wrap === 2) e.adler = 0, y(a, 31), y(a, 139), y(a, 8), a.gzhead ? (y(a, (a.gzhead.text ? 1 : 0) + (a.gzhead.hcrc ? 2 : 0) + (a.gzhead.extra ? 4 : 0) + (a.gzhead.name ? 8 : 0) + (a.gzhead.comment ? 16 : 0)), y(a, a.gzhead.time & 255), y(a, a.gzhead.time >> 8 & 255), y(a, a.gzhead.time >> 16 & 255), y(a, a.gzhead.time >> 24 & 255), y(a, a.level === 9 ? 2 : a.strategy >= Ie || a.level < 2 ? 4 : 0), y(a, a.gzhead.os & 255), a.gzhead.extra && a.gzhead.extra.length && (y(a, a.gzhead.extra.length & 255), y(a, a.gzhead.extra.length >> 8 & 255)), a.gzhead.hcrc && (e.adler = I(e.adler, a.pending_buf, a.pending, 0)), a.gzindex = 0, a.status = ht) : (y(a, 0), y(a, 0), y(a, 0), y(a, 0), y(a, 0), y(a, a.level === 9 ? 2 : a.strategy >= Ie || a.level < 2 ? 4 : 0), y(a, $a), a.status = q); + if (a.last_flush = i, a.status === Xe) if (a.wrap === 2) e.adler = 0, y(a, 31), y(a, 139), y(a, 8), a.gzhead ? (y(a, (a.gzhead.text ? 1 : 0) + (a.gzhead.hcrc ? 2 : 0) + (a.gzhead.extra ? 4 : 0) + (a.gzhead.name ? 8 : 0) + (a.gzhead.comment ? 16 : 0)), y(a, a.gzhead.time & 255), y(a, a.gzhead.time >> 8 & 255), y(a, a.gzhead.time >> 16 & 255), y(a, a.gzhead.time >> 24 & 255), y(a, a.level === 9 ? 2 : a.strategy >= Ie || a.level < 2 ? 4 : 0), y(a, a.gzhead.os & 255), a.gzhead.extra && a.gzhead.extra.length && (y(a, a.gzhead.extra.length & 255), y(a, a.gzhead.extra.length >> 8 & 255)), a.gzhead.hcrc && (e.adler = I(e.adler, a.pending_buf, a.pending, 0)), a.gzindex = 0, a.status = ht) : (y(a, 0), y(a, 0), y(a, 0), y(a, 0), y(a, 0), y(a, a.level === 9 ? 2 : a.strategy >= Ie || a.level < 2 ? 4 : 0), y(a, Na), a.status = q); else { let o = Pe + (a.w_bits - 8 << 4) << 8, f = -1; - a.strategy >= Ie || a.level < 2 ? f = 0 : a.level < 6 ? f = 1 : a.level === 6 ? f = 2 : f = 3, o |= f << 6, a.strstart !== 0 && (o |= Ca), o += 31 - o % 31, a.status = q, de(a, o), a.strstart !== 0 && (de(a, e.adler >>> 16), de(a, e.adler & 65535)), e.adler = 1; + a.strategy >= Ie || a.level < 2 ? f = 0 : a.level < 6 ? f = 1 : a.level === 6 ? f = 2 : f = 3, o |= f << 6, a.strstart !== 0 && (o |= Oa), o += 31 - o % 31, a.status = q, de(a, o), a.strstart !== 0 && (de(a, e.adler >>> 16), de(a, e.adler & 65535)), e.adler = 1; } if (a.status === ht) if (a.gzhead.extra) { for(t = a.pending; a.gzindex < (a.gzhead.extra.length & 65535) && !(a.pending === a.pending_buf_size && (a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), P(e), t = a.pending, a.pending === a.pending_buf_size));)y(a, a.gzhead.extra[a.gzindex] & 255), a.gzindex++; - a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), a.gzindex === a.gzhead.extra.length && (a.gzindex = 0, a.status = $e); - } else a.status = $e; - if (a.status === $e) if (a.gzhead.name) { + a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), a.gzindex === a.gzhead.extra.length && (a.gzindex = 0, a.status = Ce); + } else a.status = Ce; + if (a.status === Ce) if (a.gzhead.name) { t = a.pending; do { if (a.pending === a.pending_buf_size && (a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), P(e), t = a.pending, a.pending === a.pending_buf_size)) { @@ -2437,9 +2436,9 @@ var vi = (e)=>{ } a.gzindex < a.gzhead.name.length ? n = a.gzhead.name.charCodeAt(a.gzindex++) & 255 : n = 0, y(a, n); }while (n !== 0) - a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), n === 0 && (a.gzindex = 0, a.status = Me); - } else a.status = Me; - if (a.status === Me) if (a.gzhead.comment) { + a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), n === 0 && (a.gzindex = 0, a.status = Fe); + } else a.status = Fe; + if (a.status === Fe) if (a.gzhead.comment) { t = a.pending; do { if (a.pending === a.pending_buf_size && (a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), P(e), t = a.pending, a.pending === a.pending_buf_size)) { @@ -2448,23 +2447,23 @@ var vi = (e)=>{ } a.gzindex < a.gzhead.comment.length ? n = a.gzhead.comment.charCodeAt(a.gzindex++) & 255 : n = 0, y(a, n); }while (n !== 0) - a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), n === 0 && (a.status = Fe); - } else a.status = Fe; - if (a.status === Fe && (a.gzhead.hcrc ? (a.pending + 2 > a.pending_buf_size && P(e), a.pending + 2 <= a.pending_buf_size && (y(a, e.adler & 255), y(a, e.adler >> 8 & 255), e.adler = 0, a.status = q)) : a.status = q), a.pending !== 0) { - if (P(e), e.avail_out === 0) return a.last_flush = -1, F; - } else if (e.avail_in === 0 && Tt(i) <= Tt(l) && i !== W) return G(e, Je); + a.gzhead.hcrc && a.pending > t && (e.adler = I(e.adler, a.pending_buf, a.pending - t, t)), n === 0 && (a.status = Me); + } else a.status = Me; + if (a.status === Me && (a.gzhead.hcrc ? (a.pending + 2 > a.pending_buf_size && P(e), a.pending + 2 <= a.pending_buf_size && (y(a, e.adler & 255), y(a, e.adler >> 8 & 255), e.adler = 0, a.status = q)) : a.status = q), a.pending !== 0) { + if (P(e), e.avail_out === 0) return a.last_flush = -1, M; + } else if (e.avail_in === 0 && Rt(i) <= Rt(l) && i !== W) return G(e, Je); if (a.status === se && e.avail_in !== 0) return G(e, Je); if (e.avail_in !== 0 || a.lookahead !== 0 || i !== le && a.status !== se) { - let o = a.strategy === Ie ? Ka(a, i) : a.strategy === Sa ? Ba(a, i) : ce[a.level].func(a, i); - if ((o === te || o === he) && (a.status = se), o === D || o === te) return e.avail_out === 0 && (a.last_flush = -1), F; - if (o === Re && (i === xa ? pa(a) : i !== Rt && (wa(a, 0, 0, !1), i === ka && (X(a.head), a.lookahead === 0 && (a.strstart = 0, a.block_start = 0, a.insert = 0))), P(e), e.avail_out === 0)) return a.last_flush = -1, F; + let o = a.strategy === Ie ? Fa(a, i) : a.strategy === ka ? Ca(a, i) : ce[a.level].func(a, i); + if ((o === te || o === he) && (a.status = se), o === D || o === te) return e.avail_out === 0 && (a.last_flush = -1), M; + if (o === Re && (i === ba ? ua(a) : i !== St && (sa(a, 0, 0, !1), i === wa && (X(a.head), a.lookahead === 0 && (a.strstart = 0, a.block_start = 0, a.insert = 0))), P(e), e.avail_out === 0)) return a.last_flush = -1, M; } - return i !== W ? F : a.wrap <= 0 ? zt : (a.wrap === 2 ? (y(a, e.adler & 255), y(a, e.adler >> 8 & 255), y(a, e.adler >> 16 & 255), y(a, e.adler >> 24 & 255), y(a, e.total_in & 255), y(a, e.total_in >> 8 & 255), y(a, e.total_in >> 16 & 255), y(a, e.total_in >> 24 & 255)) : (de(a, e.adler >>> 16), de(a, e.adler & 65535)), P(e), a.wrap > 0 && (a.wrap = -a.wrap), a.pending !== 0 ? F : zt); -}, Wa = (e)=>{ + return i !== W ? M : a.wrap <= 0 ? At : (a.wrap === 2 ? (y(a, e.adler & 255), y(a, e.adler >> 8 & 255), y(a, e.adler >> 16 & 255), y(a, e.adler >> 24 & 255), y(a, e.total_in & 255), y(a, e.total_in >> 8 & 255), y(a, e.total_in >> 16 & 255), y(a, e.total_in >> 24 & 255)) : (de(a, e.adler >>> 16), de(a, e.adler & 65535)), P(e), a.wrap > 0 && (a.wrap = -a.wrap), a.pending !== 0 ? M : At); +}, Xa = (e)=>{ if (!e || !e.state) return L; let i = e.state.status; - return i !== Xe && i !== ht && i !== $e && i !== Me && i !== Fe && i !== q && i !== se ? G(e, L) : (e.state = null, i === q ? G(e, va) : F); -}, Va = (e, i)=>{ + return i !== Xe && i !== ht && i !== Ce && i !== Fe && i !== Me && i !== q && i !== se ? G(e, L) : (e.state = null, i === q ? G(e, ga) : M); +}, Ya = (e, i)=>{ let t = i.length; if (!e || !e.state) return L; let n = e.state, a = n.wrap; @@ -2481,28 +2480,28 @@ var vi = (e)=>{ while (--r) n.strstart = c, n.lookahead = k - 1, ie(n); } - return n.strstart += n.lookahead, n.block_start = n.strstart, n.insert = n.lookahead, n.lookahead = 0, n.match_length = n.prev_length = k - 1, n.match_available = 0, e.next_in = o, e.input = f, e.avail_in = l, n.wrap = a, F; -}, Ja = Ga, Qa = yi, qa = Ei, en = vi, tn = Ya, an = ja, nn = Wa, ln = Va, rn = "pako deflate (from Nodeca project)", be = { - deflateInit: Ja, - deflateInit2: Qa, - deflateReset: qa, - deflateResetKeep: en, - deflateSetHeader: tn, - deflate: an, - deflateEnd: nn, - deflateSetDictionary: ln, - deflateInfo: rn -}, fn = (e, i)=>Object.prototype.hasOwnProperty.call(e, i), on = function(e) { + return n.strstart += n.lookahead, n.block_start = n.strstart, n.insert = n.lookahead, n.lookahead = 0, n.match_length = n.prev_length = k - 1, n.match_available = 0, e.next_in = o, e.input = f, e.avail_in = l, n.wrap = a, M; +}, Ga = Ka, ja = vi, Wa = ki, Va = xi, Ja = Ba, Qa = Pa, qa = Xa, en = Ya, tn = "pako deflate (from Nodeca project)", be = { + deflateInit: Ga, + deflateInit2: ja, + deflateReset: Wa, + deflateResetKeep: Va, + deflateSetHeader: Ja, + deflate: Qa, + deflateEnd: qa, + deflateSetDictionary: en, + deflateInfo: tn +}, an = (e, i)=>Object.prototype.hasOwnProperty.call(e, i), nn = function(e) { let i = Array.prototype.slice.call(arguments, 1); for(; i.length;){ let t = i.shift(); - if (!!t) { + if (t) { if (typeof t != "object") throw new TypeError(t + "must be non-object"); - for(let n in t)fn(t, n) && (e[n] = t[n]); + for(let n in t)an(t, n) && (e[n] = t[n]); } } return e; -}, _n = (e)=>{ +}, ln = (e)=>{ let i = 0; for(let n = 0, a = e.length; n < a; n++)i += e[n].length; let t = new Uint8Array(i); @@ -2512,29 +2511,29 @@ var vi = (e)=>{ } return t; }, Ye = { - assign: on, - flattenChunks: _n -}, Si = !0; + assign: nn, + flattenChunks: ln +}, Ei = !0; try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch { - Si = !1; + Ei = !1; } var Ee = new Uint8Array(256); for(let e = 0; e < 256; e++)Ee[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1; Ee[254] = Ee[254] = 1; -var hn = (e)=>{ +var rn = (e)=>{ if (typeof TextEncoder == "function" && TextEncoder.prototype.encode) return new TextEncoder().encode(e); let i, t, n, a, l, o = e.length, f = 0; for(a = 0; a < o; a++)t = e.charCodeAt(a), (t & 64512) === 55296 && a + 1 < o && (n = e.charCodeAt(a + 1), (n & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (n - 56320), a++)), f += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4; for(i = new Uint8Array(f), l = 0, a = 0; l < f; a++)t = e.charCodeAt(a), (t & 64512) === 55296 && a + 1 < o && (n = e.charCodeAt(a + 1), (n & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (n - 56320), a++)), t < 128 ? i[l++] = t : t < 2048 ? (i[l++] = 192 | t >>> 6, i[l++] = 128 | t & 63) : t < 65536 ? (i[l++] = 224 | t >>> 12, i[l++] = 128 | t >>> 6 & 63, i[l++] = 128 | t & 63) : (i[l++] = 240 | t >>> 18, i[l++] = 128 | t >>> 12 & 63, i[l++] = 128 | t >>> 6 & 63, i[l++] = 128 | t & 63); return i; -}, dn = (e, i)=>{ - if (i < 65534 && e.subarray && Si) return String.fromCharCode.apply(null, e.length === i ? e : e.subarray(0, i)); +}, fn = (e, i)=>{ + if (i < 65534 && e.subarray && Ei) return String.fromCharCode.apply(null, e.length === i ? e : e.subarray(0, i)); let t = ""; for(let n = 0; n < i; n++)t += String.fromCharCode(e[n]); return t; -}, sn = (e, i)=>{ +}, on = (e, i)=>{ let t = i || e.length; if (typeof TextDecoder == "function" && TextDecoder.prototype.decode) return new TextDecoder().decode(e.subarray(0, i)); let n, a, l = new Array(t * 2); @@ -2556,49 +2555,49 @@ var hn = (e)=>{ } o < 65536 ? l[a++] = o : (o -= 65536, l[a++] = 55296 | o >> 10 & 1023, l[a++] = 56320 | o & 1023); } - return dn(l, a); -}, cn = (e, i)=>{ + return fn(l, a); +}, _n = (e, i)=>{ i = i || e.length, i > e.length && (i = e.length); let t = i - 1; for(; t >= 0 && (e[t] & 192) === 128;)t--; return t < 0 || t === 0 ? i : t + Ee[e[t]] > i ? t : i; }, ye = { - string2buf: hn, - buf2string: sn, - utf8border: cn + string2buf: rn, + buf2string: on, + utf8border: _n }; -function un() { +function hn() { this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0; } -var Ai = un, Ri = Object.prototype.toString, { Z_NO_FLUSH: bn , Z_SYNC_FLUSH: wn , Z_FULL_FLUSH: gn , Z_FINISH: pn , Z_OK: Be , Z_STREAM_END: xn , Z_DEFAULT_COMPRESSION: kn , Z_DEFAULT_STRATEGY: vn , Z_DEFLATED: En } = ne; +var yi = hn, Si = Object.prototype.toString, { Z_NO_FLUSH: dn , Z_SYNC_FLUSH: sn , Z_FULL_FLUSH: cn , Z_FINISH: un , Z_OK: Be , Z_STREAM_END: bn , Z_DEFAULT_COMPRESSION: wn , Z_DEFAULT_STRATEGY: gn , Z_DEFLATED: pn } = ne; function ze(e) { this.options = Ye.assign({ - level: kn, - method: En, + level: wn, + method: pn, chunkSize: 16384, windowBits: 15, memLevel: 8, - strategy: vn + strategy: gn }, e || {}); let i = this.options; - i.raw && i.windowBits > 0 ? i.windowBits = -i.windowBits : i.gzip && i.windowBits > 0 && i.windowBits < 16 && (i.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Ai, this.strm.avail_out = 0; + i.raw && i.windowBits > 0 ? i.windowBits = -i.windowBits : i.gzip && i.windowBits > 0 && i.windowBits < 16 && (i.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new yi, this.strm.avail_out = 0; let t = be.deflateInit2(this.strm, i.level, i.method, i.windowBits, i.memLevel, i.strategy); if (t !== Be) throw new Error(ee[t]); if (i.header && be.deflateSetHeader(this.strm, i.header), i.dictionary) { let n; - if (typeof i.dictionary == "string" ? n = ye.string2buf(i.dictionary) : Ri.call(i.dictionary) === "[object ArrayBuffer]" ? n = new Uint8Array(i.dictionary) : n = i.dictionary, t = be.deflateSetDictionary(this.strm, n), t !== Be) throw new Error(ee[t]); + if (typeof i.dictionary == "string" ? n = ye.string2buf(i.dictionary) : Si.call(i.dictionary) === "[object ArrayBuffer]" ? n = new Uint8Array(i.dictionary) : n = i.dictionary, t = be.deflateSetDictionary(this.strm, n), t !== Be) throw new Error(ee[t]); this._dict_set = !0; } } ze.prototype.push = function(e, i) { let t = this.strm, n = this.options.chunkSize, a, l; if (this.ended) return !1; - for(i === ~~i ? l = i : l = i === !0 ? pn : bn, typeof e == "string" ? t.input = ye.string2buf(e) : Ri.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length;;){ - if (t.avail_out === 0 && (t.output = new Uint8Array(n), t.next_out = 0, t.avail_out = n), (l === wn || l === gn) && t.avail_out <= 6) { + for(i === ~~i ? l = i : l = i === !0 ? un : dn, typeof e == "string" ? t.input = ye.string2buf(e) : Si.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length;;){ + if (t.avail_out === 0 && (t.output = new Uint8Array(n), t.next_out = 0, t.avail_out = n), (l === sn || l === cn) && t.avail_out <= 6) { this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0; continue; } - if (a = be.deflate(t, l), a === xn) return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), a = be.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === Be; + if (a = be.deflate(t, l), a === bn) return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), a = be.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === Be; if (t.avail_out === 0) { this.onData(t.output); continue; @@ -2622,19 +2621,19 @@ function bt(e, i) { if (t.push(e, !0), t.err) throw t.msg || ee[t.err]; return t.result; } -function yn(e, i) { +function xn(e, i) { return i = i || {}, i.raw = !0, bt(e, i); } -function Sn(e, i) { +function kn(e, i) { return i = i || {}, i.gzip = !0, bt(e, i); } -var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { - Deflate: An, - deflate: Rn, - deflateRaw: zn, - gzip: Tn, - constants: mn -}, Oe = 30, Zn = 12, In = function(i, t) { +var vn = ze, En = bt, yn = xn, Sn = kn, An = ne, Rn = { + Deflate: vn, + deflate: En, + deflateRaw: yn, + gzip: Sn, + constants: An +}, Oe = 30, zn = 12, Tn = function(i, t) { let n, a, l, o, f, c, r, _, E, s, h, u, m, v, w, A, x, d, S, Z, b, z, R, g, p = i.state; n = i.next_in, R = i.input, a = n + (i.avail_in - 5), l = i.next_out, g = i.output, o = l - (t - i.avail_out), f = l + (i.avail_out - 257), c = p.dmax, r = p.wsize, _ = p.whave, E = p.wnext, s = p.window, h = p.hold, u = p.bits, m = p.lencode, v = p.distcode, w = (1 << p.lenbits) - 1, A = (1 << p.distbits) - 1; e: do { @@ -2687,30 +2686,31 @@ var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { while (S > 2) S && (g[l++] = g[b++], S > 1 && (g[l++] = g[b++])); } - } else if ((d & 64) === 0) { - x = v[(x & 65535) + (h & (1 << d) - 1)]; - continue i; - } else { + } else if (d & 64) { i.msg = "invalid distance code", p.mode = Oe; break e; + } else { + x = v[(x & 65535) + (h & (1 << d) - 1)]; + continue i; } break; } - } else if ((d & 64) === 0) { - x = m[(x & 65535) + (h & (1 << d) - 1)]; - continue t; - } else if (d & 32) { - p.mode = Zn; + } else if (d & 64) if (d & 32) { + p.mode = zn; break e; } else { i.msg = "invalid literal/length code", p.mode = Oe; break e; } + else { + x = m[(x & 65535) + (h & (1 << d) - 1)]; + continue t; + } break; } }while (n < a && l < f) S = u >> 3, n -= S, u -= S << 3, h &= (1 << u) - 1, i.next_in = n, i.next_out = l, i.avail_in = n < a ? 5 + (a - n) : 5 - (n - a), i.avail_out = l < f ? 257 + (f - l) : 257 - (l - f), p.hold = h, p.bits = u; -}, fe = 15, mt = 852, Dt = 592, Zt = 0, qe = 1, It = 2, On = new Uint16Array([ +}, fe = 15, zt = 852, Tt = 592, mt = 0, qe = 1, Dt = 2, mn = new Uint16Array([ 3, 4, 5, @@ -2742,7 +2742,7 @@ var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { 258, 0, 0 -]), Nn = new Uint8Array([ +]), Dn = new Uint8Array([ 16, 16, 16, @@ -2774,7 +2774,7 @@ var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { 16, 72, 78 -]), Ln = new Uint16Array([ +]), Zn = new Uint16Array([ 1, 2, 3, @@ -2807,7 +2807,7 @@ var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { 24577, 0, 0 -]), Un = new Uint8Array([ +]), In = new Uint8Array([ 16, 16, 16, @@ -2840,7 +2840,7 @@ var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { 29, 64, 64 -]), Cn = (e, i, t, n, a, l, o, f)=>{ +]), On = (e, i, t, n, a, l, o, f)=>{ let c = f.bits, r = 0, _ = 0, E = 0, s = 0, h = 0, u = 0, m = 0, v = 0, w = 0, A = 0, x, d, S, Z, b, z = null, R = 0, g, p = new Uint16Array(fe + 1), J = new Uint16Array(fe + 1), me = null, gt = 0, pt, De, Ze; for(r = 0; r <= fe; r++)p[r] = 0; for(_ = 0; _ < n; _++)p[i[t + _]]++; @@ -2848,10 +2848,10 @@ var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { if (h > s && (h = s), s === 0) return a[l++] = 1 << 24 | 64 << 16 | 0, a[l++] = 1 << 24 | 64 << 16 | 0, f.bits = 1, 0; for(E = 1; E < s && p[E] === 0; E++); for(h < E && (h = E), v = 1, r = 1; r <= fe; r++)if (v <<= 1, v -= p[r], v < 0) return -1; - if (v > 0 && (e === Zt || s !== 1)) return -1; + if (v > 0 && (e === mt || s !== 1)) return -1; for(J[1] = 0, r = 1; r < fe; r++)J[r + 1] = J[r] + p[r]; for(_ = 0; _ < n; _++)i[t + _] !== 0 && (o[J[i[t + _]]++] = _); - if (e === Zt ? (z = me = o, g = 19) : e === qe ? (z = On, R -= 257, me = Nn, gt -= 257, g = 256) : (z = Ln, me = Un, g = -1), A = 0, _ = 0, r = E, b = l, u = h, m = 0, S = -1, w = 1 << h, Z = w - 1, e === qe && w > mt || e === It && w > Dt) return 1; + if (e === mt ? (z = me = o, g = 19) : e === qe ? (z = mn, R -= 257, me = Dn, gt -= 257, g = 256) : (z = Zn, me = In, g = -1), A = 0, _ = 0, r = E, b = l, u = h, m = 0, S = -1, w = 1 << h, Z = w - 1, e === qe && w > zt || e === Dt && w > Tt) return 1; for(;;){ pt = r - m, o[_] < g ? (De = 0, Ze = o[_]) : o[_] > g ? (De = me[gt + o[_]], Ze = z[R + o[_]]) : (De = 32 + 64, Ze = 0), x = 1 << r - m, d = 1 << u, E = d; do d -= x, a[b + (A >> m) + d] = pt << 24 | De << 16 | Ze | 0; @@ -2863,54 +2863,54 @@ var An = ze, Rn = bt, zn = yn, Tn = Sn, mn = ne, Dn = { } if (r > h && (A & Z) !== S) { for(m === 0 && (m = h), b += E, u = r - m, v = 1 << u; u + m < s && (v -= p[u + m], !(v <= 0));)u++, v <<= 1; - if (w += 1 << u, e === qe && w > mt || e === It && w > Dt) return 1; + if (w += 1 << u, e === qe && w > zt || e === Dt && w > Tt) return 1; S = A & Z, a[S] = h << 24 | u << 16 | b - l | 0; } } return A !== 0 && (a[b + A] = r - m << 24 | 64 << 16 | 0), f.bits = h, 0; -}, we = Cn, $n = 0, zi = 1, Ti = 2, { Z_FINISH: Ot , Z_BLOCK: Mn , Z_TREES: Ne , Z_OK: ae , Z_STREAM_END: Fn , Z_NEED_DICT: Hn , Z_STREAM_ERROR: U , Z_DATA_ERROR: mi , Z_MEM_ERROR: Di , Z_BUF_ERROR: Bn , Z_DEFLATED: Nt } = ne, Zi = 1, Lt = 2, Ut = 3, Ct = 4, $t = 5, Mt = 6, Ft = 7, Ht = 8, Bt = 9, Kt = 10, Ke = 11, H = 12, et = 13, Pt = 14, tt = 15, Xt = 16, Yt = 17, Gt = 18, jt = 19, Le = 20, Ue = 21, Wt = 22, Vt = 23, Jt = 24, Qt = 25, qt = 26, it = 27, ei = 28, ti = 29, T = 30, Ii = 31, Kn = 32, Pn = 852, Xn = 592, Yn = 15, Gn = Yn, ii = (e)=>(e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24); -function jn() { +}, we = On, Nn = 0, Ai = 1, Ri = 2, { Z_FINISH: Zt , Z_BLOCK: Ln , Z_TREES: Ne , Z_OK: ae , Z_STREAM_END: Un , Z_NEED_DICT: $n , Z_STREAM_ERROR: U , Z_DATA_ERROR: zi , Z_MEM_ERROR: Ti , Z_BUF_ERROR: Cn , Z_DEFLATED: It } = ne, mi = 1, Ot = 2, Nt = 3, Lt = 4, Ut = 5, $t = 6, Ct = 7, Ft = 8, Mt = 9, Ht = 10, Ke = 11, H = 12, et = 13, Bt = 14, tt = 15, Kt = 16, Pt = 17, Xt = 18, Yt = 19, Le = 20, Ue = 21, Gt = 22, jt = 23, Wt = 24, Vt = 25, Jt = 26, it = 27, Qt = 28, qt = 29, T = 30, Di = 31, Fn = 32, Mn = 852, Hn = 592, Bn = 15, Kn = Bn, ei = (e)=>(e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24); +function Pn() { this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0; } -var Oi = (e)=>{ +var Zi = (e)=>{ if (!e || !e.state) return U; let i = e.state; - return e.total_in = e.total_out = i.total = 0, e.msg = "", i.wrap && (e.adler = i.wrap & 1), i.mode = Zi, i.last = 0, i.havedict = 0, i.dmax = 32768, i.head = null, i.hold = 0, i.bits = 0, i.lencode = i.lendyn = new Int32Array(Pn), i.distcode = i.distdyn = new Int32Array(Xn), i.sane = 1, i.back = -1, ae; -}, Ni = (e)=>{ + return e.total_in = e.total_out = i.total = 0, e.msg = "", i.wrap && (e.adler = i.wrap & 1), i.mode = mi, i.last = 0, i.havedict = 0, i.dmax = 32768, i.head = null, i.hold = 0, i.bits = 0, i.lencode = i.lendyn = new Int32Array(Mn), i.distcode = i.distdyn = new Int32Array(Hn), i.sane = 1, i.back = -1, ae; +}, Ii = (e)=>{ if (!e || !e.state) return U; let i = e.state; - return i.wsize = 0, i.whave = 0, i.wnext = 0, Oi(e); -}, Li = (e, i)=>{ + return i.wsize = 0, i.whave = 0, i.wnext = 0, Zi(e); +}, Oi = (e, i)=>{ let t; if (!e || !e.state) return U; let n = e.state; - return i < 0 ? (t = 0, i = -i) : (t = (i >> 4) + 1, i < 48 && (i &= 15)), i && (i < 8 || i > 15) ? U : (n.window !== null && n.wbits !== i && (n.window = null), n.wrap = t, n.wbits = i, Ni(e)); -}, Ui = (e, i)=>{ + return i < 0 ? (t = 0, i = -i) : (t = (i >> 4) + 1, i < 48 && (i &= 15)), i && (i < 8 || i > 15) ? U : (n.window !== null && n.wbits !== i && (n.window = null), n.wrap = t, n.wbits = i, Ii(e)); +}, Ni = (e, i)=>{ if (!e) return U; - let t = new jn; + let t = new Pn; e.state = t, t.window = null; - let n = Li(e, i); + let n = Oi(e, i); return n !== ae && (e.state = null), n; -}, Wn = (e)=>Ui(e, Gn), ai = !0, at, nt, Vn = (e)=>{ - if (ai) { +}, Xn = (e)=>Ni(e, Kn), ti = !0, at, nt, Yn = (e)=>{ + if (ti) { at = new Int32Array(512), nt = new Int32Array(32); let i = 0; for(; i < 144;)e.lens[i++] = 8; for(; i < 256;)e.lens[i++] = 9; for(; i < 280;)e.lens[i++] = 7; for(; i < 288;)e.lens[i++] = 8; - for(we(zi, e.lens, 0, 288, at, 0, e.work, { + for(we(Ai, e.lens, 0, 288, at, 0, e.work, { bits: 9 }), i = 0; i < 32;)e.lens[i++] = 5; - we(Ti, e.lens, 0, 32, nt, 0, e.work, { + we(Ri, e.lens, 0, 32, nt, 0, e.work, { bits: 5 - }), ai = !1; + }), ti = !1; } e.lencode = at, e.lenbits = 9, e.distcode = nt, e.distbits = 5; -}, Ci = (e, i, t, n)=>{ +}, Li = (e, i, t, n)=>{ let a, l = e.state; return l.window === null && (l.wsize = 1 << l.wbits, l.wnext = 0, l.whave = 0, l.window = new Uint8Array(l.wsize)), n >= l.wsize ? (l.window.set(i.subarray(t - l.wsize, t), 0), l.wnext = 0, l.whave = l.wsize) : (a = l.wsize - l.wnext, a > n && (a = n), l.window.set(i.subarray(t - n, t - n + a), l.wnext), n -= a, n ? (l.window.set(i.subarray(t - n, t), 0), l.wnext = n, l.whave = l.wsize) : (l.wnext += a, l.wnext === l.wsize && (l.wnext = 0), l.whave < l.wsize && (l.whave += a))), 0; -}, Jn = (e, i)=>{ +}, Gn = (e, i)=>{ let t, n, a, l, o, f, c, r, _, E, s, h, u, m, v = 0, w, A, x, d, S, Z, b, z, R = new Uint8Array(4), g, p, J = new Uint8Array([ 16, 17, @@ -2935,7 +2935,7 @@ var Oi = (e)=>{ if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0) return U; t = e.state, t.mode === H && (t.mode = et), o = e.next_out, a = e.output, c = e.avail_out, l = e.next_in, n = e.input, f = e.avail_in, r = t.hold, _ = t.bits, E = f, s = c, z = ae; e: for(;;)switch(t.mode){ - case Zi: + case mi: if (t.wrap === 0) { t.mode = et; break; @@ -2945,14 +2945,14 @@ var Oi = (e)=>{ f--, r += n[l++] << _, _ += 8; } if (t.wrap & 2 && r === 35615) { - t.check = 0, R[0] = r & 255, R[1] = r >>> 8 & 255, t.check = I(t.check, R, 2, 0), r = 0, _ = 0, t.mode = Lt; + t.check = 0, R[0] = r & 255, R[1] = r >>> 8 & 255, t.check = I(t.check, R, 2, 0), r = 0, _ = 0, t.mode = Ot; break; } if (t.flags = 0, t.head && (t.head.done = !1), !(t.wrap & 1) || (((r & 255) << 8) + (r >> 8)) % 31) { e.msg = "incorrect header check", t.mode = T; break; } - if ((r & 15) !== Nt) { + if ((r & 15) !== It) { e.msg = "unknown compression method", t.mode = T; break; } @@ -2961,14 +2961,14 @@ var Oi = (e)=>{ e.msg = "invalid window size", t.mode = T; break; } - t.dmax = 1 << t.wbits, e.adler = t.check = 1, t.mode = r & 512 ? Kt : H, r = 0, _ = 0; + t.dmax = 1 << t.wbits, e.adler = t.check = 1, t.mode = r & 512 ? Ht : H, r = 0, _ = 0; break; - case Lt: + case Ot: for(; _ < 16;){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; } - if (t.flags = r, (t.flags & 255) !== Nt) { + if (t.flags = r, (t.flags & 255) !== It) { e.msg = "unknown compression method", t.mode = T; break; } @@ -2976,20 +2976,20 @@ var Oi = (e)=>{ e.msg = "unknown header flags set", t.mode = T; break; } - t.head && (t.head.text = r >> 8 & 1), t.flags & 512 && (R[0] = r & 255, R[1] = r >>> 8 & 255, t.check = I(t.check, R, 2, 0)), r = 0, _ = 0, t.mode = Ut; - case Ut: + t.head && (t.head.text = r >> 8 & 1), t.flags & 512 && (R[0] = r & 255, R[1] = r >>> 8 & 255, t.check = I(t.check, R, 2, 0)), r = 0, _ = 0, t.mode = Nt; + case Nt: for(; _ < 32;){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; } - t.head && (t.head.time = r), t.flags & 512 && (R[0] = r & 255, R[1] = r >>> 8 & 255, R[2] = r >>> 16 & 255, R[3] = r >>> 24 & 255, t.check = I(t.check, R, 4, 0)), r = 0, _ = 0, t.mode = Ct; - case Ct: + t.head && (t.head.time = r), t.flags & 512 && (R[0] = r & 255, R[1] = r >>> 8 & 255, R[2] = r >>> 16 & 255, R[3] = r >>> 24 & 255, t.check = I(t.check, R, 4, 0)), r = 0, _ = 0, t.mode = Lt; + case Lt: for(; _ < 16;){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; } - t.head && (t.head.xflags = r & 255, t.head.os = r >> 8), t.flags & 512 && (R[0] = r & 255, R[1] = r >>> 8 & 255, t.check = I(t.check, R, 2, 0)), r = 0, _ = 0, t.mode = $t; - case $t: + t.head && (t.head.xflags = r & 255, t.head.os = r >> 8), t.flags & 512 && (R[0] = r & 255, R[1] = r >>> 8 & 255, t.check = I(t.check, R, 2, 0)), r = 0, _ = 0, t.mode = Ut; + case Ut: if (t.flags & 1024) { for(; _ < 16;){ if (f === 0) break e; @@ -2997,11 +2997,11 @@ var Oi = (e)=>{ } t.length = r, t.head && (t.head.extra_len = r), t.flags & 512 && (R[0] = r & 255, R[1] = r >>> 8 & 255, t.check = I(t.check, R, 2, 0)), r = 0, _ = 0; } else t.head && (t.head.extra = null); - t.mode = Mt; - case Mt: + t.mode = $t; + case $t: if (t.flags & 1024 && (h = t.length, h > f && (h = f), h && (t.head && (b = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(n.subarray(l, l + h), b)), t.flags & 512 && (t.check = I(t.check, n, h, l)), f -= h, l += h, t.length -= h), t.length)) break e; - t.length = 0, t.mode = Ft; - case Ft: + t.length = 0, t.mode = Ct; + case Ct: if (t.flags & 2048) { if (f === 0) break e; h = 0; @@ -3009,8 +3009,8 @@ var Oi = (e)=>{ while (b && h < f) if (t.flags & 512 && (t.check = I(t.check, n, h, l)), f -= h, l += h, b) break e; } else t.head && (t.head.name = null); - t.length = 0, t.mode = Ht; - case Ht: + t.length = 0, t.mode = Ft; + case Ft: if (t.flags & 4096) { if (f === 0) break e; h = 0; @@ -3018,8 +3018,8 @@ var Oi = (e)=>{ while (b && h < f) if (t.flags & 512 && (t.check = I(t.check, n, h, l)), f -= h, l += h, b) break e; } else t.head && (t.head.comment = null); - t.mode = Bt; - case Bt: + t.mode = Mt; + case Mt: if (t.flags & 512) { for(; _ < 16;){ if (f === 0) break e; @@ -3033,17 +3033,17 @@ var Oi = (e)=>{ } t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = H; break; - case Kt: + case Ht: for(; _ < 32;){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; } - e.adler = t.check = ii(r), r = 0, _ = 0, t.mode = Ke; + e.adler = t.check = ei(r), r = 0, _ = 0, t.mode = Ke; case Ke: - if (t.havedict === 0) return e.next_out = o, e.avail_out = c, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, Hn; + if (t.havedict === 0) return e.next_out = o, e.avail_out = c, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, $n; e.adler = t.check = 1, t.mode = H; case H: - if (i === Mn || i === Ne) break e; + if (i === Ln || i === Ne) break e; case et: if (t.last) { r >>>= _ & 7, _ -= _ & 7, t.mode = it; @@ -3055,23 +3055,23 @@ var Oi = (e)=>{ } switch(t.last = r & 1, r >>>= 1, _ -= 1, r & 3){ case 0: - t.mode = Pt; + t.mode = Bt; break; case 1: - if (Vn(t), t.mode = Le, i === Ne) { + if (Yn(t), t.mode = Le, i === Ne) { r >>>= 2, _ -= 2; break e; } break; case 2: - t.mode = Yt; + t.mode = Pt; break; case 3: e.msg = "invalid block type", t.mode = T; } r >>>= 2, _ -= 2; break; - case Pt: + case Bt: for(r >>>= _ & 7, _ -= _ & 7; _ < 32;){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; @@ -3082,8 +3082,8 @@ var Oi = (e)=>{ } if (t.length = r & 65535, r = 0, _ = 0, t.mode = tt, i === Ne) break e; case tt: - t.mode = Xt; - case Xt: + t.mode = Kt; + case Kt: if (h = t.length, h) { if (h > f && (h = f), h > c && (h = c), h === 0) break e; a.set(n.subarray(l, l + h), o), f -= h, l += h, c -= h, o += h, t.length -= h; @@ -3091,7 +3091,7 @@ var Oi = (e)=>{ } t.mode = H; break; - case Yt: + case Pt: for(; _ < 14;){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; @@ -3100,8 +3100,8 @@ var Oi = (e)=>{ e.msg = "too many length or distance symbols", t.mode = T; break; } - t.have = 0, t.mode = Gt; - case Gt: + t.have = 0, t.mode = Xt; + case Xt: for(; t.have < t.ncode;){ for(; _ < 3;){ if (f === 0) break e; @@ -3112,12 +3112,12 @@ var Oi = (e)=>{ for(; t.have < 19;)t.lens[J[t.have++]] = 0; if (t.lencode = t.lendyn, t.lenbits = 7, g = { bits: t.lenbits - }, z = we($n, t.lens, 0, 19, t.lencode, 0, t.work, g), t.lenbits = g.bits, z) { + }, z = we(Nn, t.lens, 0, 19, t.lencode, 0, t.work, g), t.lenbits = g.bits, z) { e.msg = "invalid code lengths set", t.mode = T; break; } - t.have = 0, t.mode = jt; - case jt: + t.have = 0, t.mode = Yt; + case Yt: for(; t.have < t.nlen + t.ndist;){ for(; v = t.lencode[r & (1 << t.lenbits) - 1], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(w <= _);){ if (f === 0) break e; @@ -3162,13 +3162,13 @@ var Oi = (e)=>{ } if (t.lenbits = 9, g = { bits: t.lenbits - }, z = we(zi, t.lens, 0, t.nlen, t.lencode, 0, t.work, g), t.lenbits = g.bits, z) { + }, z = we(Ai, t.lens, 0, t.nlen, t.lencode, 0, t.work, g), t.lenbits = g.bits, z) { e.msg = "invalid literal/lengths set", t.mode = T; break; } if (t.distbits = 6, t.distcode = t.distdyn, g = { bits: t.distbits - }, z = we(Ti, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, g), t.distbits = g.bits, z) { + }, z = we(Ri, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, g), t.distbits = g.bits, z) { e.msg = "invalid distances set", t.mode = T; break; } @@ -3177,14 +3177,14 @@ var Oi = (e)=>{ t.mode = Ue; case Ue: if (f >= 6 && c >= 258) { - e.next_out = o, e.avail_out = c, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, In(e, s), o = e.next_out, a = e.output, c = e.avail_out, l = e.next_in, n = e.input, f = e.avail_in, r = t.hold, _ = t.bits, t.mode === H && (t.back = -1); + e.next_out = o, e.avail_out = c, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, Tn(e, s), o = e.next_out, a = e.output, c = e.avail_out, l = e.next_in, n = e.input, f = e.avail_in, r = t.hold, _ = t.bits, t.mode === H && (t.back = -1); break; } for(t.back = 0; v = t.lencode[r & (1 << t.lenbits) - 1], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(w <= _);){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; } - if (A && (A & 240) === 0) { + if (A && !(A & 240)) { for(d = w, S = A, Z = x; v = t.lencode[Z + ((r & (1 << d + S) - 1) >> d)], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(d + w <= _);){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; @@ -3192,7 +3192,7 @@ var Oi = (e)=>{ r >>>= d, _ -= d, t.back += d; } if (r >>>= w, _ -= w, t.back += w, t.length = x, A === 0) { - t.mode = qt; + t.mode = Jt; break; } if (A & 32) { @@ -3203,8 +3203,8 @@ var Oi = (e)=>{ e.msg = "invalid literal/length code", t.mode = T; break; } - t.extra = A & 15, t.mode = Wt; - case Wt: + t.extra = A & 15, t.mode = Gt; + case Gt: if (t.extra) { for(p = t.extra; _ < p;){ if (f === 0) break e; @@ -3212,13 +3212,13 @@ var Oi = (e)=>{ } t.length += r & (1 << t.extra) - 1, r >>>= t.extra, _ -= t.extra, t.back += t.extra; } - t.was = t.length, t.mode = Vt; - case Vt: + t.was = t.length, t.mode = jt; + case jt: for(; v = t.distcode[r & (1 << t.distbits) - 1], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(w <= _);){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; } - if ((A & 240) === 0) { + if (!(A & 240)) { for(d = w, S = A, Z = x; v = t.distcode[Z + ((r & (1 << d + S) - 1) >> d)], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(d + w <= _);){ if (f === 0) break e; f--, r += n[l++] << _, _ += 8; @@ -3229,8 +3229,8 @@ var Oi = (e)=>{ e.msg = "invalid distance code", t.mode = T; break; } - t.offset = x, t.extra = A & 15, t.mode = Jt; - case Jt: + t.offset = x, t.extra = A & 15, t.mode = Wt; + case Wt: if (t.extra) { for(p = t.extra; _ < p;){ if (f === 0) break e; @@ -3242,8 +3242,8 @@ var Oi = (e)=>{ e.msg = "invalid distance too far back", t.mode = T; break; } - t.mode = Qt; - case Qt: + t.mode = Vt; + case Vt: if (c === 0) break e; if (h = s - c, t.offset > h) { if (h = t.offset - h, h > t.whave && t.sane) { @@ -3257,7 +3257,7 @@ var Oi = (e)=>{ while (--h) t.length === 0 && (t.mode = Ue); break; - case qt: + case Jt: if (c === 0) break e; a[o++] = t.length, c--, t.mode = Ue; break; @@ -3267,14 +3267,14 @@ var Oi = (e)=>{ if (f === 0) break e; f--, r |= n[l++] << _, _ += 8; } - if (s -= c, e.total_out += s, t.total += s, s && (e.adler = t.check = t.flags ? I(t.check, a, s, o - s) : ve(t.check, a, s, o - s)), s = c, (t.flags ? r : ii(r)) !== t.check) { + if (s -= c, e.total_out += s, t.total += s, s && (e.adler = t.check = t.flags ? I(t.check, a, s, o - s) : ve(t.check, a, s, o - s)), s = c, (t.flags ? r : ei(r)) !== t.check) { e.msg = "incorrect data check", t.mode = T; break; } r = 0, _ = 0; } - t.mode = ei; - case ei: + t.mode = Qt; + case Qt: if (t.wrap && t.flags) { for(; _ < 32;){ if (f === 0) break e; @@ -3286,47 +3286,47 @@ var Oi = (e)=>{ } r = 0, _ = 0; } - t.mode = ti; - case ti: - z = Fn; + t.mode = qt; + case qt: + z = Un; break e; case T: - z = mi; + z = zi; break e; - case Ii: - return Di; - case Kn: + case Di: + return Ti; + case Fn: default: return U; } - return e.next_out = o, e.avail_out = c, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, (t.wsize || s !== e.avail_out && t.mode < T && (t.mode < it || i !== Ot)) && Ci(e, e.output, e.next_out, s - e.avail_out), E -= e.avail_in, s -= e.avail_out, e.total_in += E, e.total_out += s, t.total += s, t.wrap && s && (e.adler = t.check = t.flags ? I(t.check, a, s, e.next_out - s) : ve(t.check, a, s, e.next_out - s)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === H ? 128 : 0) + (t.mode === Le || t.mode === tt ? 256 : 0), (E === 0 && s === 0 || i === Ot) && z === ae && (z = Bn), z; -}, Qn = (e)=>{ + return e.next_out = o, e.avail_out = c, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, (t.wsize || s !== e.avail_out && t.mode < T && (t.mode < it || i !== Zt)) && Li(e, e.output, e.next_out, s - e.avail_out), E -= e.avail_in, s -= e.avail_out, e.total_in += E, e.total_out += s, t.total += s, t.wrap && s && (e.adler = t.check = t.flags ? I(t.check, a, s, e.next_out - s) : ve(t.check, a, s, e.next_out - s)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === H ? 128 : 0) + (t.mode === Le || t.mode === tt ? 256 : 0), (E === 0 && s === 0 || i === Zt) && z === ae && (z = Cn), z; +}, jn = (e)=>{ if (!e || !e.state) return U; let i = e.state; return i.window && (i.window = null), e.state = null, ae; -}, qn = (e, i)=>{ +}, Wn = (e, i)=>{ if (!e || !e.state) return U; let t = e.state; - return (t.wrap & 2) === 0 ? U : (t.head = i, i.done = !1, ae); -}, el = (e, i)=>{ + return t.wrap & 2 ? (t.head = i, i.done = !1, ae) : U; +}, Vn = (e, i)=>{ let t = i.length, n, a, l; - return !e || !e.state || (n = e.state, n.wrap !== 0 && n.mode !== Ke) ? U : n.mode === Ke && (a = 1, a = ve(a, i, t, 0), a !== n.check) ? mi : (l = Ci(e, i, t, t), l ? (n.mode = Ii, Di) : (n.havedict = 1, ae)); -}, tl = Ni, il = Li, al = Oi, nl = Wn, ll = Ui, rl = Jn, fl = Qn, ol = qn, _l = el, hl = "pako inflate (from Nodeca project)", K = { - inflateReset: tl, - inflateReset2: il, - inflateResetKeep: al, - inflateInit: nl, - inflateInit2: ll, - inflate: rl, - inflateEnd: fl, - inflateGetHeader: ol, - inflateSetDictionary: _l, - inflateInfo: hl + return !e || !e.state || (n = e.state, n.wrap !== 0 && n.mode !== Ke) ? U : n.mode === Ke && (a = 1, a = ve(a, i, t, 0), a !== n.check) ? zi : (l = Li(e, i, t, t), l ? (n.mode = Di, Ti) : (n.havedict = 1, ae)); +}, Jn = Ii, Qn = Oi, qn = Zi, el = Xn, tl = Ni, il = Gn, al = jn, nl = Wn, ll = Vn, rl = "pako inflate (from Nodeca project)", K = { + inflateReset: Jn, + inflateReset2: Qn, + inflateResetKeep: qn, + inflateInit: el, + inflateInit2: tl, + inflate: il, + inflateEnd: al, + inflateGetHeader: nl, + inflateSetDictionary: ll, + inflateInfo: rl }; -function dl() { +function fl() { this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1; } -var sl = dl, $i = Object.prototype.toString, { Z_NO_FLUSH: cl , Z_FINISH: ul , Z_OK: Se , Z_STREAM_END: lt , Z_NEED_DICT: rt , Z_STREAM_ERROR: bl , Z_DATA_ERROR: ni , Z_MEM_ERROR: wl } = ne; +var ol = fl, Ui = Object.prototype.toString, { Z_NO_FLUSH: _l , Z_FINISH: hl , Z_OK: Se , Z_STREAM_END: lt , Z_NEED_DICT: rt , Z_STREAM_ERROR: dl , Z_DATA_ERROR: ii , Z_MEM_ERROR: sl } = ne; function Te(e) { this.options = Ye.assign({ chunkSize: 1024 * 64, @@ -3334,21 +3334,21 @@ function Te(e) { to: "" }, e || {}); let i = this.options; - i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(e && e.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15) === 0 && (i.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Ai, this.strm.avail_out = 0; + i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(e && e.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15 || (i.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new yi, this.strm.avail_out = 0; let t = K.inflateInit2(this.strm, i.windowBits); if (t !== Se) throw new Error(ee[t]); - if (this.header = new sl, K.inflateGetHeader(this.strm, this.header), i.dictionary && (typeof i.dictionary == "string" ? i.dictionary = ye.string2buf(i.dictionary) : $i.call(i.dictionary) === "[object ArrayBuffer]" && (i.dictionary = new Uint8Array(i.dictionary)), i.raw && (t = K.inflateSetDictionary(this.strm, i.dictionary), t !== Se))) throw new Error(ee[t]); + if (this.header = new ol, K.inflateGetHeader(this.strm, this.header), i.dictionary && (typeof i.dictionary == "string" ? i.dictionary = ye.string2buf(i.dictionary) : Ui.call(i.dictionary) === "[object ArrayBuffer]" && (i.dictionary = new Uint8Array(i.dictionary)), i.raw && (t = K.inflateSetDictionary(this.strm, i.dictionary), t !== Se))) throw new Error(ee[t]); } Te.prototype.push = function(e, i) { let t = this.strm, n = this.options.chunkSize, a = this.options.dictionary, l, o, f; if (this.ended) return !1; - for(i === ~~i ? o = i : o = i === !0 ? ul : cl, $i.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length;;){ - for(t.avail_out === 0 && (t.output = new Uint8Array(n), t.next_out = 0, t.avail_out = n), l = K.inflate(t, o), l === rt && a && (l = K.inflateSetDictionary(t, a), l === Se ? l = K.inflate(t, o) : l === ni && (l = rt)); t.avail_in > 0 && l === lt && t.state.wrap > 0 && e[t.next_in] !== 0;)K.inflateReset(t), l = K.inflate(t, o); + for(i === ~~i ? o = i : o = i === !0 ? hl : _l, Ui.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length;;){ + for(t.avail_out === 0 && (t.output = new Uint8Array(n), t.next_out = 0, t.avail_out = n), l = K.inflate(t, o), l === rt && a && (l = K.inflateSetDictionary(t, a), l === Se ? l = K.inflate(t, o) : l === ii && (l = rt)); t.avail_in > 0 && l === lt && t.state.wrap > 0 && e[t.next_in] !== 0;)K.inflateReset(t), l = K.inflate(t, o); switch(l){ - case bl: - case ni: + case dl: + case ii: case rt: - case wl: + case sl: return this.onEnd(l), this.ended = !0, !1; } if (f = t.avail_out, t.next_out && (t.avail_out === 0 || l === lt)) if (this.options.to === "string") { @@ -3373,16 +3373,16 @@ function wt(e, i) { if (t.push(e), t.err) throw t.msg || ee[t.err]; return t.result; } -function gl(e, i) { +function cl(e, i) { return i = i || {}, i.raw = !0, wt(e, i); } -var pl = Te, xl = wt, kl = gl, vl = wt, El = ne, yl = { - Inflate: pl, - inflate: xl, - inflateRaw: kl, - ungzip: vl, - constants: El -}, { Deflate: Sl , deflate: Al , deflateRaw: Rl , gzip: zl } = Dn, { Inflate: Tl , inflate: ml , inflateRaw: Dl , ungzip: Zl } = yl, Ol = Al, Cl = ml; +var ul = Te, bl = wt, wl = cl, gl = wt, pl = ne, xl = { + Inflate: ul, + inflate: bl, + inflateRaw: wl, + ungzip: gl, + constants: pl +}, { Deflate: kl , deflate: vl , deflateRaw: El , gzip: yl } = Rn, { Inflate: Sl , inflate: Al , inflateRaw: Rl , ungzip: zl } = xl, ml = vl, Ol = Al; const UpdateObservable = "0"; class Retain { constructor(value){ @@ -3505,7 +3505,7 @@ function send_pingpong() { } function encode_binary(data, compression_enabled) { if (compression_enabled) { - return pack(Ol(pack(data))); + return pack(ml(pack(data))); } else { return pack(data); } @@ -3730,7 +3730,7 @@ function free_object(id) { } return; } else { - send_warning(`Trying to delete object ${id}, which is not in global session cache.`); + console.warn(`Trying to delete object ${id}, which is not in global session cache.`); } return; } @@ -3868,17 +3868,15 @@ function close_session(session_id) { } function free_session(session_id) { OBJECT_FREEING_LOCK.lock(()=>{ - console.log(`actually freeing session ${session_id}`); const session = SESSIONS[session_id]; if (!session) { console.warn("double freeing session from Julia!"); return; } const [tracked_objects, status] = session; + delete SESSIONS[session_id]; tracked_objects.forEach(free_object); tracked_objects.clear(); - delete SESSIONS[session_id]; - sweep_object_cache(); }); } function on_node_available(node_id, timeout) { @@ -3923,20 +3921,6 @@ function update_session_dom(message) { }); return; } -function sweep_object_cache() { - for(const id in GLOBAL_OBJECT_CACHE){ - const data = GLOBAL_OBJECT_CACHE[id]; - if (data instanceof Promise) { - continue; - } - if (data instanceof Retain) { - continue; - } - if (!is_still_referenced(id)) { - delete GLOBAL_OBJECT_CACHE[id]; - } - } -} function update_session_cache(session_id, new_jl_objects, session_status) { function update_cache(tracked_objects) { for(const key in new_jl_objects){ @@ -4020,7 +4004,7 @@ function decode_base64_message(base64_string, compression_enabled) { } function unpack_binary(binary, compression_enabled) { if (compression_enabled) { - return unpack(Cl(binary)); + return unpack(Ol(binary)); } else { return unpack(binary); } diff --git a/js_dependencies/Sessions.js b/js_dependencies/Sessions.js index a6568203..99f1a7ce 100644 --- a/js_dependencies/Sessions.js +++ b/js_dependencies/Sessions.js @@ -67,7 +67,7 @@ function free_object(id) { } return; } else { - send_warning( + console.warn( `Trying to delete object ${id}, which is not in global session cache.` ); } @@ -191,18 +191,15 @@ export function close_session(session_id) { // called from julia! export function free_session(session_id) { OBJECT_FREEING_LOCK.lock(() => { - console.log(`actually freeing session ${session_id}`); const session = SESSIONS[session_id]; if (!session) { console.warn("double freeing session from Julia!"); - //double free? return } const [tracked_objects, status] = session; + delete SESSIONS[session_id]; tracked_objects.forEach(free_object); tracked_objects.clear(); - delete SESSIONS[session_id]; - sweep_object_cache(); }); } diff --git a/js_dependencies/Websocket.bundled.js b/js_dependencies/Websocket.bundled.js index c4b68eba..8939ffba 100644 --- a/js_dependencies/Websocket.bundled.js +++ b/js_dependencies/Websocket.bundled.js @@ -66,7 +66,7 @@ function websocket_send(binary_data) { } } function send_pings() { - console.log("pong"); + console.debug("pong"); JSServe.send_pingpong(); setTimeout(send_pings, 5000); } diff --git a/js_dependencies/Websocket.js b/js_dependencies/Websocket.js index 5718157f..0053841d 100644 --- a/js_dependencies/Websocket.js +++ b/js_dependencies/Websocket.js @@ -80,7 +80,7 @@ function websocket_send(binary_data) { } function send_pings() { - console.log("pong") + console.debug("pong") JSServe.send_pingpong() setTimeout(send_pings, 5000) } diff --git a/src/session.jl b/src/session.jl index 243941b6..8501be57 100644 --- a/src/session.jl +++ b/src/session.jl @@ -74,7 +74,7 @@ function get_session(session::Session, id::String) end function free(session::Session) - # don't double free! + # don't double free! session.status === CLOSED && return # unregister all cached objects from root session root = root_session(session) @@ -111,6 +111,7 @@ end function Base.close(session::Session) lock(root_session(session).deletion_lock) do + session.status === CLOSED && return session.on_close[] = true while !isempty(session.children) close(last(first(session.children))) # child removes itself from parent!